Searched refs:child_end (Results 1 - 24 of 24) sorted by relevance

/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/ADT/
H A DGraphTraits.h37 // static ChildIteratorType child_end (NodeType *)
99 static ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits
100 return GraphTraits<T>::child_end(N);
H A DSCCIterator.h82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first));
181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI)
H A DDepthFirstIterator.h112 while (It != GT::child_end(Node)) {
H A DPostOrderIterator.h104 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Support/
H A DDataFlow.h38 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
55 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
74 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
95 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DCFG.h256 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
270 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
287 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
301 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DGraphWriter.h67 child_iterator EE = GTraits::child_end(Node);
217 child_iterator EE = GTraits::child_end(Node);
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/
H A DLoopInfoImpl.h41 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
75 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
105 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
129 if (SI != BlockTraits::child_end(Out))
151 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) {
174 InvBlockTraits::child_end(Header);
266 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB);
274 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB);
391 InvBlockTraits::child_end(PredBB));
413 PE = InvBlockTraits::child_end(PredB
[all...]
H A DInterval.h134 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
146 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DBlockFrequencyImpl.h158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
327 SE = GraphTraits<BlockT *>::child_end(BB); SI != SE; ++SI) {
H A DIntervalIterator.h175 E = GT::child_end(Node); I != E; ++I)
206 E = IGT::child_end(Node); I != E; ++I) {
229 End = GT::child_end(Node); It != End; ++It)
H A DCallGraph.h322 static inline ChildIteratorType child_end (NodeType *N) { function in struct:GraphTraits
338 static inline ChildIteratorType child_end (NodeType *N) { return N->end(); } function in struct:GraphTraits
H A DLoopInfo.h157 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) {
173 E = InvBlockTraits::child_end(const_cast<BlockT*>(H)); I != E; ++I)
680 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
693 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DDominatorInternals.h84 if (NextSucc == GraphT::child_end(BB)) {
210 E = InvTraits::child_end(W); CI != E; ++CI) {
H A DRegionIterator.h263 // and child_end fail.
273 static inline ChildIteratorType child_end(NodeType *N) { \
284 static inline ChildIteratorType child_end(NodeType *N) { \
H A DDominators.h242 GraphT::child_end(NewBB)) == 1 &&
250 PE = InvTraits::child_end(NewBB); PI != PE; ++PI)
258 E = InvTraits::child_end(NewBBSucc); PI != E; ++PI) {
667 TraitsTy::child_end(I)) == 0)
888 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/
H A DMachineLoopInfo.h170 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
183 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DMachineBasicBlock.h649 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
662 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
682 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
696 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DMachineDominators.h189 static inline ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits
H A DScheduleDAG.h635 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
H A DSelectionDAGNodes.h1800 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::SDNode::GraphTraits
/macosx-10.9.5/llvmCore-3425.0.33/unittests/ADT/
H A DSCCIteratorTest.cpp226 /// child_end - Return the end iterator for children of the given node.
227 static ChildIterator child_end(NodeType *Parent) {
241 static inline ChildIteratorType child_end(NodeType *Node) { function in struct:llvm::GraphTraits
242 return Graph<N>::child_end(Node);
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/
H A DType.h433 static inline ChildIteratorType child_end(NodeType *N) {
446 static inline ChildIteratorType child_end(NodeType *N) { function in class:llvm::Type
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/IPO/
H A DFunctionAttrs.cpp321 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits

Completed in 593 milliseconds