79     LQ.push_front(&L);  in addLoop()
84   for (auto I = LQ.begin(), E = LQ.end(); I != E; ++I) {  in addLoop()
88       LQ.insert(I, 1, &L);  in addLoop()
95 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {  in addLoopIntoQueue()  argument
96   LQ.push_back(L);  in addLoopIntoQueue()
98     addLoopIntoQueue(I, LQ);  in addLoopIntoQueue()
116   assert(LQ.back() == CurrentLoop && "Loop queue back isn't the current loop!");  in markLoopAsDeleted()
117   llvm::erase_value(LQ, &L);  in markLoopAsDeleted()
122     LQ.push_back(&L);  in markLoopAsDeleted()
150     addLoopIntoQueue(L, LQ);  in runOnFunction()
152   if (LQ.empty()) // No loops, skip calling finalizers  in runOnFunction()
156   for (Loop *L : LQ) {  in runOnFunction()
172   while (!LQ.empty()) {  in runOnFunction()
174     CurrentLoop = LQ.back();  in runOnFunction()
278     LQ.pop_back();  in runOnFunction()