Lines Matching defs:Loops
385 /// \brief Indexed information about loops.
386 std::list<LoopData> Loops;
401 /// every edge should be a local edge (since all the loops are packaged up).
417 /// Insert them into \a Loops before \c Insert.
435 /// backedges and exits are stored in its entry in Loops.
447 /// \brief Unwrap loops.
563 /// loops.
629 /// which is called the header. A given loop, L, can have sub-loops, which are
630 /// loops within the subgraph of L that exclude its header. (A "trivial" SCC
633 /// In addition to loops, this algorithm has limited support for irreducible
635 /// discovered on they fly, and modelled as loops with multiple headers.
639 /// true sub-loops). Block frequency calculations act as if a block is
673 /// 2. Calculate mass and scale in loops (\a computeMassInLoops()).
676 /// from ignoring backedges and treating sub-loops as a single pseudo-node.
679 /// members that represent sub-loops will already have been visited and
713 /// loops in the function. This uses the same algorithm as distributing
716 /// 4. Unpackage loops (\a unwrapLoops()).
721 /// Visit loops top-down, scaling the frequencies of its immediate members
748 /// as sub-loops, rather than arbitrarily shoving the problematic
818 /// Build up \a Loops using \a LoopInfo. \a LoopInfo gives us a mapping from
821 /// the header, the headers of immediate sub-loops, and all other blocks in
822 /// the loop that are not in sub-loops.
837 /// that have not been packaged into sub-loops.
847 /// been packaged into loops.
855 /// Find the irreducible SCCs in \c OuterLoop, add them to \a Loops (in front
868 /// \brief Compute mass in all loops.
872 /// \a computeMassInLoop() aborts (and returns \c false) on loops that
946 // Visit loops in post-order to find thelocal mass distribution, and then do
981 // Visit loops top down and assign them an index.
993 Loops.emplace_back(Parent, Header);
994 Working[Header.Index].Loop = &Loops.back();
998 Q.emplace_back(L, &Loops.back());
1030 // Visit loops with the deepest first, and the top-level loops last.
1031 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
1096 computeIrreducibleMass(nullptr, Loops.begin());
