class LazyCallGraph::EdgeSequence

Declaration

class LazyCallGraph::EdgeSequence { /* full declaration omitted */ };

Description

The edge sequence object. This typically exists entirely within the node but is exposed as a separate type because a node doesn't initially have edges. An explicit population step is required to produce this sequence at first and it is then cached in the node. It is also used to represent edges entering the graph from outside the module to model the graph's roots. The sequence itself both iterable and indexable. The indexes remain stable even as the sequence mutates (including removal).

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:186

Method Overview

• public llvm::LazyCallGraph::EdgeSequence::iterator begin()
• public llvm::LazyCallGraph::EdgeSequence::call_iterator call_begin()
• public llvm::LazyCallGraph::EdgeSequence::call_iterator call_end()
• public iterator_range<llvm::LazyCallGraph::EdgeSequence::call_iterator> calls()
• public bool empty()
• public llvm::LazyCallGraph::EdgeSequence::iterator end()
• public llvm::LazyCallGraph::Edge * lookup(llvm::LazyCallGraph::Node & N)

Methods

¶llvm::LazyCallGraph::EdgeSequence::iterator
begin()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:258

¶llvm::LazyCallGraph::EdgeSequence::call_iterator
call_begin()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:277

¶llvm::LazyCallGraph::EdgeSequence::call_iterator
call_end()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:280

¶iterator_range<llvm::LazyCallGraph::EdgeSequence::
                   call_iterator>
calls()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:282

¶bool empty()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:286

¶llvm::LazyCallGraph::EdgeSequence::iterator end()

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:259

¶llvm::LazyCallGraph::Edge* lookup(
    llvm::LazyCallGraph::Node& N)

Declared at: llvm/include/llvm/Analysis/LazyCallGraph.h:269

Parameters

llvm::LazyCallGraph::Node& N