HomeSort by: relevance | last modified time | path
    Searched refs:TraverseStmt (Results 1 - 25 of 34) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/clang/include/clang/AST/
RecursiveASTVisitor.h 117 /// TraverseStmt(Stmt *x) and TraverseType(QualType x) work
210 bool TraverseStmt(Stmt *S, DataRecursionQueue *Queue = nullptr);
539 // it only enqueues the children and does not traverse them. TraverseStmt
578 bool RecursiveASTVisitor<Derived>::TraverseStmt(Stmt *S,
793 return getDerived().TraverseStmt(Arg.getAsExpr());
834 return getDerived().TraverseStmt(ArgLoc.getSourceExpression());
861 TRY_TO(TraverseStmt(Init->getInit()));
874 TRY_TO(TraverseStmt(Init));
919 TRY_TO(TraverseStmt(const_cast<Expr*>(T->getSizeExpr())));
927 TRY_TO(TraverseStmt(T->getSizeExpr()))
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/
TransBlockObjCVariable.cpp 93 bool onlyValueOfVarIsNeeded = checker.TraverseStmt(block->getBody());
131 trans.TraverseStmt(BodyCtx.getTopStmt());
TransGCCalls.cpp 75 .TraverseStmt(BodyCtx.getTopStmt());
TransUnusedInitDelegate.cpp 46 TraverseStmt(body);
TransProtectedScope.cpp 108 .TraverseStmt(BodyCtx.getTopStmt());
109 LocalRefsCollector(LocalRefs).TraverseStmt(BodyCtx.getTopStmt());
Transforms.cpp 252 TraverseStmt(*I);
302 ReferenceClear(refs).TraverseStmt(S);
306 ReferenceCollector(D, refs).TraverseStmt(S);
310 RemovablesCollector(exprs).TraverseStmt(S);
338 bool TraverseStmt(Stmt *rootS) {
TransAutoreleasePool.cpp 80 TraverseStmt(body);
317 declarationLoc).TraverseStmt(*SI);
343 releaseColl.TraverseStmt(*I);
TransEmptyStatementsAndDealloc.cpp 159 TraverseStmt(*I);
Transforms.h 193 bool TraverseStmt(Stmt *rootS) {
TransRetainReleaseDealloc.cpp 57 TraverseStmt(body);
TransUnbridgedCasts.cpp 77 TraverseStmt(body);
ObjCMT.cpp 352 if (!TraverseStmt(SubStmt))
369 bool TraverseStmt(Stmt *S) {
371 ObjCMigrator(Consumer, *PMap).TraverseStmt(S);
1696 return !SuperInitChecker().TraverseStmt(MD->getBody());
  /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 173 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) {
188 return VisitorBase::TraverseStmt(StmtToTraverse, Queue);
251 if (!VisitorBase::TraverseStmt(Node->getRangeInit()))
255 return VisitorBase::TraverseStmt(Node->getBody());
298 return VisitorBase::TraverseStmt(Node->getBody());
326 return VisitorBase::TraverseStmt(const_cast<Stmt*>(&StmtNode));
485 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
497 TraverseStmt(RF->getInit());
500 TraverseStmt(RF->getRangeInit());
506 TraverseStmt(SubStmt)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaAvailability.cpp 635 if (!Visitor.TraverseStmt(const_cast<Stmt *>(S)))
676 bool TraverseStmt(Stmt *S) {
680 bool Result = Base::TraverseStmt(S);
685 void IssueDiagnostics(Stmt *S) { TraverseStmt(S); }
693 bool TraverseCaseStmt(CaseStmt *CS) { return TraverseStmt(CS->getSubStmt()); }
887 return TraverseStmt(If->getThen()) && TraverseStmt(If->getElse());
894 bool ShouldContinue = TraverseStmt(If->getThen());
897 return ShouldContinue && TraverseStmt(If->getElse());
SemaTemplateVariadic.cpp 122 TraverseStmt(Element.Key);
123 TraverseStmt(Element.Value);
133 bool TraverseStmt(Stmt *S) {
136 return inherited::TraverseStmt(S);
406 CollectUnexpandedParameterPacksVisitor(Unexpanded).TraverseStmt(E);
416 CollectUnexpandedParameterPacksVisitor(Unexpanded).TraverseStmt(RE);
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/
ASTSelection.cpp 67 return TraverseStmt(E->getSyntacticForm());
74 return TraverseStmt(E->getSourceExpr());
111 bool TraverseStmt(Stmt *S) {
126 LexicallyOrderedRecursiveASTVisitor::TraverseStmt(S);
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
BuildTree.cpp 806 if (S->getInit() && !TraverseStmt(S->getInit())) {
813 if (!TraverseStmt(S->getConditionVariableDeclStmt()))
815 } else if (S->getCond() && !TraverseStmt(S->getCond()))
818 if (S->getThen() && !TraverseStmt(S->getThen()))
820 if (S->getElse() && !TraverseStmt(S->getElse()))
834 if (S->getInit() && !TraverseStmt(S->getInit()))
838 if (S->getRangeInit() && !TraverseStmt(S->getRangeInit()))
840 if (S->getBody() && !TraverseStmt(S->getBody()))
848 bool TraverseStmt(Stmt *S) {
854 return RecursiveASTVisitor::TraverseStmt(IgnoreImplicit(E))
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Index/
IndexBody.cpp 394 if (!base::TraverseStmt(Init))
411 if (!TraverseStmt(SubStmt, Q))
489 BodyIndexer(*this, Parent, DC).TraverseStmt(const_cast<Stmt*>(S));
IndexTypeSourceInfo.cpp 227 bool TraverseStmt(Stmt *S) {
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DeadStoresChecker.cpp 52 return TraverseStmt(S->getHandlerBlock());
166 V.TraverseStmt(AC->getBody());
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CallGraph.h 136 bool TraverseStmt(Stmt *S) { return true; }
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 240 bool TraverseStmt(Stmt *S) {
246 RecursiveASTVisitor<PreorderVisitor>::TraverseStmt(S);
277 PreorderWalker.TraverseStmt(N);
  /src/external/apache2/llvm/dist/clang/lib/AST/
ASTStructuralEquivalence.cpp 165 // class. Should only be called from TraverseStmt.
337 bool TraverseStmt(const Stmt *S1, const Stmt *S2) { return true; }
340 // the accumulated result of the comparison. Each TraverseStmt overload
341 // calls the TraverseStmt overload of the parent class. For example,
342 // the TraverseStmt overload for 'BinaryOperator' calls the TraverseStmt
345 bool TraverseStmt(const CLASS *S1, const CLASS *S2) { \
346 if (!TraverseStmt(static_cast<const PARENT *>(S1), \
363 // Each TraverseStmt walks the class hierarchy from the leaf class to
373 return TraverseStmt(static_cast<const CLASS *>(S1),
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CalledOnceCheck.cpp 437 Impl.TraverseStmt(const_cast<Expr *>(From));
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CodeGenPGO.cpp 245 TraverseStmt(CS);

Completed in 43 milliseconds

1 2