Lines Matching defs:LQ
76 // Insert loop into loop nest (LoopInfo) and loop queue (LQ).
80 LQ.push_front(&L);
85 for (auto I = LQ.begin(), E = LQ.end(); I != E; ++I) {
89 LQ.insert(I, 1, &L);
95 // Recurse through all subloops and all loops into LQ.
96 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
97 LQ.push_back(L);
99 addLoopIntoQueue(I, LQ);
117 assert(LQ.back() == CurrentLoop && "Loop queue back isn't the current loop!");
118 llvm::erase(LQ, &L);
123 LQ.push_back(&L);
151 addLoopIntoQueue(L, LQ);
153 if (LQ.empty()) // No loops, skip calling finalizers
157 for (Loop *L : LQ) {
173 while (!LQ.empty()) {
175 CurrentLoop = LQ.back();
279 LQ.pop_back();