| /external/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | TraversalChecker.cpp | 43 const ParentMap &Parents = C.getLocationContext()->getParentMap(); local
44 Parent = Parents.getParent(Condition);
|
| H A D | DeadStoresChecker.cpp | 129 ParentMap& Parents; member in class:__anon1963::DeadStoreObs
142 : cfg(cfg), Ctx(ctx), BR(br), Checker(checker), AC(ac), Parents(parents),
295 DeadStoreKind dsk = Parents.isConsumedExpr(B)
306 const Stmt *parent = Parents.getParentIgnoreParenCasts(U);
|
| /external/clang/utils/TableGen/ |
| H A D | ClangDiagnosticsEmitter.cpp | 71 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); local
72 for (unsigned i = 0, e = Parents.size(); i != e; ++i) {
73 CatName = getCategoryFromDiagGroup(Parents[i], DiagGroupParents);
345 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); local
346 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
347 if (isSubGroupOfGroup(Parents[i], GName))
388 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); local
389 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
390 markGroup(Parents[i]);
447 const std::vector<Record*> &Parents local
[all...] |
| /external/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 242 assert(TargetSCC.getOuterRefSCC().Parents.count(this) &&
257 for (const RefSCC *ParentC : AncestorC->Parents)
739 TargetC.Parents.insert(this);
845 for (RefSCC *ParentC : C->Parents)
847 Parents.insert(ParentC);
848 C->Parents.clear();
865 ChildRC.Parents.erase(C);
866 ChildRC.Parents.insert(this);
942 bool Removed = TargetRC.Parents.erase(this);
949 if (TargetRC.Parents
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DIEHash.cpp | 87 SmallVector<const DIE *, 1> Parents; local
90 Parents.push_back(Cur);
98 for (SmallVectorImpl<const DIE *>::reverse_iterator I = Parents.rbegin(),
99 E = Parents.rend();
|
| H A D | DwarfUnit.cpp | 768 SmallVector<const DIScope *, 1> Parents; local
770 Parents.push_back(Context);
781 for (const DIScope *Ctx : make_range(Parents.rbegin(), Parents.rend())) {
|
| /external/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 444 SmallPtrSet<RefSCC *, 1> Parents; member in class:llvm::LazyCallGraph::Edge::RefSCC
514 parent_iterator parent_begin() const { return Parents.begin(); }
515 parent_iterator parent_end() const { return Parents.end(); }
529 return Parents.count(const_cast<RefSCC *>(&C));
|
| /external/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 652 const auto &Parents = ActiveASTContext->getParents(Node); local
653 assert(!Parents.empty() && "Found node that is not in the parent map.");
654 if (Parents.size() == 1) {
656 const ast_type_traits::DynTypedNode Parent = Parents[0];
671 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(),
672 Parents.end());
|
| /external/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchers.h | 5369 const auto &Parents = Finder->getASTContext().getParents(Node); local
5371 llvm::SmallVector<ast_type_traits::DynTypedNode, 8> Stack(Parents.begin(),
5372 Parents.end());
|
| /external/clang/unittests/ASTMatchers/ |
| H A D | ASTMatchersTraversalTest.cpp | 1741 std::set<const void *> Parents; local
1743 if (!Parents.insert(Parent.getMemoizationData()).second) {
|
| /external/clang/lib/AST/ |
| H A D | ASTContext.cpp | 8933 return std::make_pair(Visitor.Parents, Visitor.OtherParents);
8939 ParentMapASTVisitor(ASTContext::ParentMapPointers *Parents, argument
8941 : Parents(Parents), OtherParents(OtherParents) {}
8953 BaseTraverseFn BaseTraverse, MapTy *Parents) {
8967 auto &NodeOrVector = (*Parents)[MapNode];
9009 Parents); member in class:__anon1420::ParentMapASTVisitor
9015 Parents); member in namespace:__anon1420
9034 ASTContext::ParentMapPointers *Parents;
8952 TraverseNode(T Node, MapNodeTy MapNode, BaseTraverseFn BaseTraverse, MapTy *Parents) argument
|