/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/ |
H A D | MachineDominators.h | 265 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin() function
|
H A D | ScheduleDAG.h | 671 static ChildIteratorType child_begin(NodeRef N) {
|
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/IPO/ |
H A D | ProfiledCallGraph.h | 191 static ChildIteratorType child_begin(NodeRef N) { return N->Edges.begin(); }
|
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 261 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch() 1254 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 1263 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
|
H A D | DDG.h | 500 static ChildIteratorType child_begin(NodeRef N) { 540 static ChildIteratorType child_begin(NodeRef N) {
|
H A D | LoopIterator.h | 76 static ChildIteratorType child_begin(NodeRef Node) { in child_begin() function
|
H A D | LazyCallGraph.h | 1244 static ChildIteratorType child_begin(NodeRef N) { return (*N)->begin(); } 1252 static ChildIteratorType child_begin(NodeRef N) { return (*N)->begin(); }
|
H A D | MemorySSA.h | 1200 static ChildIteratorType child_begin(NodeRef N) { return N->defs_begin(); } 1209 static ChildIteratorType child_begin(NodeRef N) { return N->user_begin(); }
|
H A D | BlockFrequencyInfoImpl.h | 1539 bool HasSucc = GraphTraits<const BlockT *>::child_begin(&BB) != 1707 for (auto SI = GraphTraits<const BlockT *>::child_begin(BB),
|
/openbsd/gnu/llvm/llvm/lib/CodeGen/ |
H A D | MachineBlockFrequencyInfo.cpp | 99 static ChildIteratorType child_begin(const NodeRef N) { in child_begin() function
|
/openbsd/gnu/llvm/clang/include/clang/Analysis/ |
H A D | CFG.h | 1495 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } 1504 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } 1516 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); } 1528 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
|
/openbsd/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 285 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
|
/openbsd/gnu/llvm/llvm/include/llvm/IR/ |
H A D | Dominators.h | 245 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
|
/openbsd/gnu/llvm/llvm/lib/Object/ |
H A D | Archive.cpp | 727 child_iterator I = child_begin(Err, false); in Archive() 943 Archive::child_iterator Archive::child_begin(Error &Err, in child_begin() function in Archive 1240 child_iterator I = child_begin(Err, false); in BigArchive()
|
/openbsd/gnu/llvm/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfo.cpp | 109 static ChildIteratorType child_begin(const NodeRef N) { in child_begin() function
|
H A D | BlockFrequencyInfoImpl.cpp | 702 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin() function
|
/openbsd/gnu/llvm/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 129 Opt.emplace(GT::child_begin(Node)); in toNext()
|
/openbsd/gnu/llvm/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 853 assert(std::distance(GraphT::child_begin(NewBB), 856 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
|
/openbsd/gnu/llvm/clang/tools/libclang/ |
H A D | CXComment.cpp | 102 return createCXComment(*(C->child_begin() + ChildIdx), CXC.TranslationUnit); in clang_Comment_getChild()
|
/openbsd/gnu/llvm/clang/lib/ARCMigrate/ |
H A D | TransRetainReleaseDealloc.cpp | 261 Stmt::child_iterator currChildS = OuterS->child_begin(); in getPreviousAndNextStmt()
|
/openbsd/gnu/llvm/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 480 static ChildIteratorType child_begin(NodeRef Node) { in child_begin() function
|
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonEarlyIfConv.cpp | 614 DTNodeVectType Cn(GTN::child_begin(N), GTN::child_end(N)); in visitBlock() 966 DTNodeVectType Cn(GTN::child_begin(N), GTN::child_end(N)); in removeBlock()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 132 {GraphTraits<RegionNode *>::child_begin(N.first), N.second}, in children() 137 static ChildIteratorType child_begin(const NodeRef &N) { in child_begin() function
|
/openbsd/gnu/llvm/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 415 static ChildIteratorType child_begin(NodeRef N) {
|
/openbsd/gnu/llvm/clang/include/clang/AST/ |
H A D | ASTNodeTraverser.h | 268 for (comments::Comment::child_iterator I = C->child_begin(), in Visit()
|