lib/Analysis/LoopPass.cpp

74   // runOnFunction remove L from LQ. Otherwise, remove L from LQ now
84   for (std::deque<Loop *>::iterator I = LQ.begin(),
85          E = LQ.end(); I != E; ++I) {
87       LQ.erase(I);
93 // Inset loop into loop nest (LoopInfo) and loop queue (LQ).
113     LQ.push_front(L);
116     for (std::deque<Loop *>::iterator I = LQ.begin(),
117            E = LQ.end(); I != E; ++I) {
121         LQ.insert(I, 1, L);
162 // Recurse through all subloops and all loops  into LQ.
163 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
164   LQ.push_back(L);
166     addLoopIntoQueue(*I, LQ);
196     addLoopIntoQueue(*I, LQ);
198   if (LQ.empty()) // No loops, skip calling finalizers
202   for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end();
212   while (!LQ.empty()) {
214     CurrentLoop  = LQ.back();
278     LQ.pop_back();
281       LQ.push_back(CurrentLoop);