80     LQ.push_front(&L);  in addLoop()
85   for (auto I = LQ.begin(), E = LQ.end(); I != E; ++I) {  in addLoop()
89       LQ.insert(I, 1, &L);  in addLoop()
96 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {  in addLoopIntoQueue()  argument
97   LQ.push_back(L);  in addLoopIntoQueue()
99     addLoopIntoQueue(I, LQ);  in addLoopIntoQueue()
117   assert(LQ.back() == CurrentLoop && "Loop queue back isn't the current loop!");  in markLoopAsDeleted()
118   llvm::erase(LQ, &L);  in markLoopAsDeleted()
123     LQ.push_back(&L);  in markLoopAsDeleted()
151     addLoopIntoQueue(L, LQ);  in runOnFunction()
153   if (LQ.empty()) // No loops, skip calling finalizers  in runOnFunction()
157   for (Loop *L : LQ) {  in runOnFunction()
173   while (!LQ.empty()) {  in runOnFunction()
175     CurrentLoop = LQ.back();  in runOnFunction()
279     LQ.pop_back();  in runOnFunction()