HomeSort by relevance Sort by last modified time
    Searched refs:insertEdge (Results 1 - 6 of 6) sorted by null

  /external/llvm/include/llvm/ADT/
PostOrderIterator.h 44 // edges can be pruned by returning false in the insertEdge() function. This
48 // the post-order. The insertEdge() function is called in a pre-order, while
59 bool insertEdge(NodeType *From, NodeType *To) {
80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); }
106 if (this->insertEdge(VisitStack.back().first, BB)) {
114 this->insertEdge((NodeType*)nullptr, BB);
122 if (this->insertEdge((NodeType*)nullptr, BB)) {
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 117 bool insertEdge(BasicBlock *From, BasicBlock *To);
170 insertEdge(BasicBlock *From, BasicBlock *To) {
LazyCallGraph.h 442 void insertEdge(Node &Caller, Function &Callee);
445 void insertEdge(Function &Caller, Function &Callee) {
446 return insertEdge(get(Caller), Callee);
  /external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp 301 CG.insertEdge(B, lookupFunction(*M, "c"));
306 CG.insertEdge(C, B.getFunction());
310 CG.insertEdge(C, C.getFunction());
  /external/llvm/lib/Analysis/
LazyCallGraph.cpp 531 void LazyCallGraph::insertEdge(Node &CallerN, Function &Callee) {
  /external/llvm/lib/CodeGen/
MachineTraceMetrics.cpp 437 bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) {
    [all...]

Completed in 181 milliseconds