Lines Matching defs:empty
230 while (!Stack.empty() && Root.lookup(Stack.back()) >= OurDFS) {
308 // purposes, and for skipping empty classes.
312 return empty() && memory_empty();
336 bool empty() const { return Members.empty(); }
345 bool memory_empty() const { return MemoryMembers.empty(); }
1763 if (Filtered.empty()) {
2289 if (OldClass->empty() && OldClass != TOPClass) {
2638 while (!Worklist.empty()) {
2940 while (!TempInst.empty()) {
3343 // until the set of touched instructions is completely empty.
3416 // Add an empty instruction to account for the fact that we start at 1
3481 Changed |= !InstructionsToErase.empty();
3734 bool empty() const { return DFSStack.empty(); }
3737 if (empty())
3748 !DFSStack.empty() &&
3880 if (CC->isDead() || CC->empty())
3962 if (EliminationStack.empty()) {
3963 LLVM_DEBUG(dbgs() << "Elimination Stack is empty\n");
3972 // First, we see if we are out of scope or empty. If so,
3980 // If the stack is now empty, we need to push
3985 bool ShouldPush = Def && EliminationStack.empty();
3992 bool ShouldPush = Def && EliminationStack.empty();
4013 if (!EliminationStack.empty() && Def != EliminationStack.back() &&
4038 // If we get to this point, and the stack is empty we must have a use
4040 if (EliminationStack.empty())
4107 if (EliminationStack.empty() ||
4111 if (EliminationStack.empty()) {
4119 assert(!EliminationStack.empty());