Home
last modified time | relevance | path

Searched refs:child_end (Results 1 – 25 of 73) sorted by relevance

123

/external/clang/lib/StaticAnalyzer/Core/
DCheckerHelpers.cpp25 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsMacro()
41 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsEnum()
59 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsStaticLocal()
73 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsBuiltinOffsetOf()
/external/clang/include/clang/AST/
DStmtGraphTraits.h39 static inline ChildIteratorType child_end(NodeType* N) {
40 if (N) return N->child_end();
66 static inline ChildIteratorType child_end(NodeType* N) {
67 if (N) return N->child_end();
DComment.h229 child_iterator child_end() const;
234 return child_end() - child_begin(); in child_count()
283 child_iterator child_end() const { return nullptr; } in child_end() function
341 child_iterator child_end() const { return nullptr; } in child_end() function
474 child_iterator child_end() const { return nullptr; } in child_end() function
529 child_iterator child_end() const { return nullptr; } in child_end() function
580 child_iterator child_end() const { in child_end() function
650 child_iterator child_end() const { in child_end() function
885 child_iterator child_end() const { return nullptr; } in child_end() function
918 child_iterator child_end() const { in child_end() function
[all …]
/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
93 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
117 if (SI != BlockTraits::child_end(Out)) in getLoopPreheader()
139 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { in getLoopPredecessor()
162 InvBlockTraits::child_end(Header); in getLoopLatch()
249 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); in verifyLoop()
257 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); in verifyLoop()
373 InvBlockTraits::child_end(PredBB)); in discoverAndMapSubloop()
395 PE = InvBlockTraits::child_end(PredBB); PI != PE; ++PI) { in discoverAndMapSubloop()
[all …]
DIntervalIterator.h175 E = GT::child_end(Node); I != E; ++I) in ProcessInterval()
206 E = IGT::child_end(Node); I != E; ++I) { in ProcessNode()
229 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
DInterval.h131 static inline ChildIteratorType child_end(NodeType *N) {
143 static inline ChildIteratorType child_end(NodeType *N) {
DLoopInfo.h158 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { in isLoopExiting()
174 E = InvBlockTraits::child_end(H); I != E; ++I) in getNumBackEdges()
241 E = InvBlockTraits::child_end(H); I != E; ++I) in getLoopLatches()
761 static inline ChildIteratorType child_end(NodeType *N) {
774 static inline ChildIteratorType child_end(NodeType *N) {
DCallGraph.h412 static inline ChildIteratorType child_end(NodeType *N) {
427 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
/external/llvm/lib/Object/
DArchive.cpp135 if (Parent->StringTable == Parent->child_end() in getName()
198 : Binary(Binary::ID_Archive, std::move(Source)), SymbolTable(child_end()) { in Archive()
208 child_iterator e = child_end(); in Archive()
316 return child_end(); in child_begin()
326 Archive::child_iterator Archive::child_end() const { in child_end() function in Archive
497 return child_end(); in findSym()
501 return child_end(); in findSym()
505 return SymbolTable != child_end(); in hasSymbolTable()
/external/llvm/include/llvm/ADT/
DGraphTraits.h99 static ChildIteratorType child_end(NodeType* N) {
100 return GraphTraits<T>::child_end(N);
DSCCIterator.h156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
181 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC()
216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
/external/clang/lib/AST/
DComment.cpp59 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_end); in CheckCommentASTNodes()
83 Comment::child_iterator Comment::child_end() const { in child_end() function in clang::comments::Comment
89 return static_cast<const CLASS *>(this)->child_end(); in child_end()
107 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
/external/llvm/include/llvm/IR/
DCFG.h282 static inline ChildIteratorType child_end(NodeType *N) {
296 static inline ChildIteratorType child_end(NodeType *N) {
313 static inline ChildIteratorType child_end(NodeType *N) {
327 static inline ChildIteratorType child_end(NodeType *N) {
DType.h452 static inline ChildIteratorType child_end(NodeType *N) {
465 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp227 static ChildIterator child_end(NodeType *Parent) { in child_end() function in llvm::Graph
241 static inline ChildIteratorType child_end(NodeType *Node) { in child_end() function
242 return Graph<N>::child_end(Node); in child_end()
/external/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h171 static inline ChildIteratorType child_end(NodeType *N) {
184 static inline ChildIteratorType child_end(NodeType *N) {
DMachineBasicBlock.h711 static inline ChildIteratorType child_end(NodeType *N) {
724 static inline ChildIteratorType child_end(NodeType *N) {
744 static inline ChildIteratorType child_end(NodeType *N) {
758 static inline ChildIteratorType child_end(NodeType *N) {
/external/chromium_org/content/browser/accessibility/
Dbrowser_accessibility.cc254 int child_end = 0; in GetLocalBoundsForRange() local
257 for (size_t i = 0; i < InternalChildCount() && child_end < start + len; ++i) { in GetLocalBoundsForRange()
263 child_start = child_end; in GetLocalBoundsForRange()
264 child_end += child_len; in GetLocalBoundsForRange()
266 if (child_end < start) in GetLocalBoundsForRange()
270 int overlap_end = std::min(end, child_end); in GetLocalBoundsForRange()
/external/chromium_org/cc/layers/
Dlayer_utils_unittest.cc130 TransformOperations child_end; in TEST_F() local
131 child_end.AppendTranslate(50.f, 0.f, 0.f); in TEST_F()
132 AddAnimatedTransformToLayer(parent(), duration, start, child_end); in TEST_F()
/external/clang/lib/StaticAnalyzer/Checkers/
DIdenticalExprChecker.cpp316 while (I1 != Expr1->child_end() && I2 != Expr2->child_end()) { in isIdenticalStmt()
324 if (I1 != Expr1->child_end()) in isIdenticalStmt()
326 if (I2 != Expr2->child_end()) in isIdenticalStmt()
DCheckObjCDealloc.cpp45 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I) in scan_dealloc()
93 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I) in scan_ivar_release()
DCheckSizeofPointer.cpp40 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I) in VisitChildren()
DUndefBranchChecker.cpp41 E = Ex->child_end();I!=E;++I) in FindExpr()
DUndefCapturedBlockVarChecker.cpp43 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end(); in FindBlockDeclRefExpr()
/external/clang/include/clang/Analysis/
DCallGraph.h183 static inline ChildIteratorType child_end (NodeType *N) {
196 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }

123