Lines Matching defs:Loops
27 /// to innermost loops. By deleting the head of the loop from the graph, inner
28 /// loops can be found. This assumes that the head node is not shared between
29 /// loops but instead all paths to the head come from 'continue' constructs.
38 CfgVector<CfgUnorderedSet<SizeT>> getLoopBodies() { return Loops; }
102 /// The function to analyze for loops.
117 /// All the Loops, in descending order of size
118 CfgVector<CfgUnorderedSet<SizeT>> Loops;
249 Loops.push_back(LoopNodes);
260 CfgVector<Loop> Loops;
261 Loops.reserve(LoopBodies.size());
303 Loops.emplace_back(Header, PreHeader, LoopBody);
305 return Loops;
