Lines Matching refs:loops

13 Cycles are a generalization of LLVM :ref:`loops <loop-terminology>`,
39 follows the nesting of loops in the same function. The unique entry of
66 - If the CFG is reducible, the cycles are exactly the natural loops and
72                   loops." ACM Transactions on Programming Languages
80 Irreducible cycle enclosing natural loops
106 The self-loops of ``A`` and ``B`` give rise to two single-block
107 natural loops. A possible hierarchy of cycles is::
116 Irreducible union of two natural loops
146 There are two natural loops: ``{A, C}`` and ``{B, D}``. A possible
152 Irreducible cycle without natural loops
183 This graph does not contain any natural loops --- the nodes ``A``,