LLVM
8.0.1
|
#include "llvm/IR/CFGDiff.h"
Classes | |
struct | DeletedEdgesFilter |
Public Types | |
using | DataRef = const GraphDiff< BasicBlock *, InverseGraph > * |
using | NodeRef = std::pair< DataRef, BasicBlock * > |
using | ExistingChildIterator = WrappedPairNodeDataIterator< pred_iterator, NodeRef, DataRef > |
using | FilterExistingChildrenIterator = filter_iterator< ExistingChildIterator, DeletedEdgesFilter > |
using | vec_iterator = SmallVectorImpl< BasicBlock * >::const_iterator |
using | AddNewChildrenIterator = WrappedPairNodeDataIterator< vec_iterator, NodeRef, DataRef > |
using | ChildIteratorType = concat_iterator< NodeRef, FilterExistingChildrenIterator, AddNewChildrenIterator > |
Static Public Member Functions | |
static ChildIteratorType | child_begin (NodeRef N) |
static ChildIteratorType | child_end (NodeRef N) |
using llvm::CFGViewPredecessors< InverseGraph >::AddNewChildrenIterator = WrappedPairNodeDataIterator<vec_iterator, NodeRef, DataRef> |
using llvm::CFGViewPredecessors< InverseGraph >::ChildIteratorType = concat_iterator<NodeRef, FilterExistingChildrenIterator, AddNewChildrenIterator> |
using llvm::CFGViewPredecessors< InverseGraph >::DataRef = const GraphDiff<BasicBlock *, InverseGraph> * |
using llvm::CFGViewPredecessors< InverseGraph >::ExistingChildIterator = WrappedPairNodeDataIterator<pred_iterator, NodeRef, DataRef> |
using llvm::CFGViewPredecessors< InverseGraph >::FilterExistingChildrenIterator = filter_iterator<ExistingChildIterator, DeletedEdgesFilter> |
using llvm::CFGViewPredecessors< InverseGraph >::NodeRef = std::pair<DataRef, BasicBlock *> |
using llvm::CFGViewPredecessors< InverseGraph >::vec_iterator = SmallVectorImpl<BasicBlock *>::const_iterator |
|
inlinestatic |
|
inlinestatic |