Graph traits for traversing basic blocks in a loop body.

Synopsis

Declared in <llvm/Analysis/LoopIterator.h>

struct LoopBodyTraits;

Description

The graph starts at the loop header and visits the BasicBlocks that are in the loop body, but not the loop header. Since the loop header is skipped, the back edges are excluded.

TODO: Explore the possibility to implement LoopBlocksTraversal in terms of LoopBodyTraits, so that insertEdge doesn't have to be specialized.

Types

Name

Description

LoopBodyFilter

Predicate that keeps only non‐header blocks contained in the loop.

WrappedSuccIterator

Successor iterator that carries the enclosing loop for edge filtering.

Type Aliases

Name

Description

ChildIteratorType

Filtered iterator over loop‐body successor nodes.

NodeRef

Node type pairing a loop with one of its basic blocks.

Static Member Functions

Name

Description

child_begin

Return an iterator to the first child of Node.

child_end

Return an iterator past the last child of Node.

getEntryNode

Return the graph entry node for loop G.

Created with MrDocs