100   for (std::deque<Loop *>::iterator I = LQ.begin(),  in deleteLoopFromQueue()
101          E = LQ.end(); I != E; ++I) {  in deleteLoopFromQueue()
103       LQ.erase(I);  in deleteLoopFromQueue()
129     LQ.push_front(L);  in insertLoopIntoQueue()
132     for (std::deque<Loop *>::iterator I = LQ.begin(),  in insertLoopIntoQueue()
133            E = LQ.end(); I != E; ++I) {  in insertLoopIntoQueue()
137         LQ.insert(I, 1, L);  in insertLoopIntoQueue()
179 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {  in addLoopIntoQueue()  argument
180   LQ.push_back(L);  in addLoopIntoQueue()
182     addLoopIntoQueue(*I, LQ);  in addLoopIntoQueue()
205     addLoopIntoQueue(*I, LQ);  in runOnFunction()
207   if (LQ.empty()) // No loops, skip calling finalizers  in runOnFunction()
211   for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end();  in runOnFunction()
221   while (!LQ.empty()) {  in runOnFunction()
223     CurrentLoop  = LQ.back();  in runOnFunction()
289     LQ.pop_back();  in runOnFunction()
292       LQ.push_back(CurrentLoop);  in runOnFunction()