Lines Matching defs:LQ
77 // Insert loop into loop nest (LoopInfo) and loop queue (LQ).
81 LQ.push_front(&L);
86 for (auto I = LQ.begin(), E = LQ.end(); I != E; ++I) {
90 LQ.insert(I, 1, &L);
96 // Recurse through all subloops and all loops into LQ.
97 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
98 LQ.push_back(L);
100 addLoopIntoQueue(I, LQ);
118 assert(LQ.back() == CurrentLoop && "Loop queue back isn't the current loop!");
119 LQ.erase(std::remove(LQ.begin(), LQ.end(), &L), LQ.end());
124 LQ.push_back(&L);
152 addLoopIntoQueue(L, LQ);
154 if (LQ.empty()) // No loops, skip calling finalizers
158 for (Loop *L : LQ) {
174 while (!LQ.empty()) {
176 CurrentLoop = LQ.back();
267 LQ.pop_back();