Home
last modified time | relevance | path

Searched refs:Parents (Results 1 – 11 of 11) sorted by relevance

/external/clang/utils/TableGen/
DClangDiagnosticsEmitter.cpp71 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); in getCategoryFromDiagGroup() local
72 for (unsigned i = 0, e = Parents.size(); i != e; ++i) { in getCategoryFromDiagGroup()
73 CatName = getCategoryFromDiagGroup(Parents[i], DiagGroupParents); in getCategoryFromDiagGroup()
345 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); in isSubGroupOfGroup() local
346 for (unsigned i = 0, e = Parents.size(); i != e; ++i) in isSubGroupOfGroup()
347 if (isSubGroupOfGroup(Parents[i], GName)) in isSubGroupOfGroup()
388 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); in markGroup() local
389 for (unsigned i = 0, e = Parents.size(); i != e; ++i) in markGroup()
390 markGroup(Parents[i]); in markGroup()
447 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group); in compute() local
[all …]
/external/clang/lib/StaticAnalyzer/Checkers/
DTraversalChecker.cpp43 const ParentMap &Parents = C.getLocationContext()->getParentMap(); in checkBranchCondition() local
44 Parent = Parents.getParent(Condition); in checkBranchCondition()
DDeadStoresChecker.cpp129 ParentMap& Parents; member in __anonf3d88fd00211::DeadStoreObs
142 : cfg(cfg), Ctx(ctx), BR(br), Checker(checker), AC(ac), Parents(parents), in DeadStoreObs()
295 DeadStoreKind dsk = Parents.isConsumedExpr(B) in observeStmt()
306 const Stmt *parent = Parents.getParentIgnoreParenCasts(U); in observeStmt()
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp242 assert(TargetSCC.getOuterRefSCC().Parents.count(this) && in verify()
257 for (const RefSCC *ParentC : AncestorC->Parents) in isDescendantOf()
739 TargetC.Parents.insert(this); in insertOutgoingEdge()
845 for (RefSCC *ParentC : C->Parents) in insertIncomingRefEdge()
847 Parents.insert(ParentC); in insertIncomingRefEdge()
848 C->Parents.clear(); in insertIncomingRefEdge()
865 ChildRC.Parents.erase(C); in insertIncomingRefEdge()
866 ChildRC.Parents.insert(this); in insertIncomingRefEdge()
942 bool Removed = TargetRC.Parents.erase(this); in removeOutgoingEdge()
949 if (TargetRC.Parents.empty()) in removeOutgoingEdge()
[all …]
/external/llvm/lib/CodeGen/AsmPrinter/
DDIEHash.cpp87 SmallVector<const DIE *, 1> Parents; in addParentContext() local
90 Parents.push_back(Cur); in addParentContext()
98 for (SmallVectorImpl<const DIE *>::reverse_iterator I = Parents.rbegin(), in addParentContext()
99 E = Parents.rend(); in addParentContext()
DDwarfUnit.cpp768 SmallVector<const DIScope *, 1> Parents; in getParentContextString() local
770 Parents.push_back(Context); in getParentContextString()
781 for (const DIScope *Ctx : make_range(Parents.rbegin(), Parents.rend())) { in getParentContextString()
/external/clang/lib/ASTMatchers/
DASTMatchFinder.cpp652 const auto &Parents = ActiveASTContext->getParents(Node); in matchesAncestorOfRecursively() local
653 assert(!Parents.empty() && "Found node that is not in the parent map."); in matchesAncestorOfRecursively()
654 if (Parents.size() == 1) { in matchesAncestorOfRecursively()
656 const ast_type_traits::DynTypedNode Parent = Parents[0]; in matchesAncestorOfRecursively()
671 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(), in matchesAncestorOfRecursively()
672 Parents.end()); in matchesAncestorOfRecursively()
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h444 SmallPtrSet<RefSCC *, 1> Parents; variable
514 parent_iterator parent_begin() const { return Parents.begin(); } in parent_begin()
515 parent_iterator parent_end() const { return Parents.end(); } in parent_end()
529 return Parents.count(const_cast<RefSCC *>(&C)); in isChildOf()
/external/clang/include/clang/ASTMatchers/
DASTMatchers.h5369 const auto &Parents = Finder->getASTContext().getParents(Node); in AST_MATCHER_P() local
5371 llvm::SmallVector<ast_type_traits::DynTypedNode, 8> Stack(Parents.begin(), in AST_MATCHER_P()
5372 Parents.end()); in AST_MATCHER_P()
/external/clang/lib/AST/
DASTContext.cpp8933 return std::make_pair(Visitor.Parents, Visitor.OtherParents); in buildMap()
8939 ParentMapASTVisitor(ASTContext::ParentMapPointers *Parents, in ParentMapASTVisitor() argument
8941 : Parents(Parents), OtherParents(OtherParents) {} in ParentMapASTVisitor()
8953 BaseTraverseFn BaseTraverse, MapTy *Parents) { in TraverseNode() argument
8967 auto &NodeOrVector = (*Parents)[MapNode]; in TraverseNode()
9009 Parents); in TraverseDecl()
9015 Parents); in TraverseStmt()
9034 ASTContext::ParentMapPointers *Parents; member in __anond181a69d0611::ParentMapASTVisitor
/external/clang/unittests/ASTMatchers/
DASTMatchersTraversalTest.cpp1741 std::set<const void *> Parents; in TEST() local
1743 if (!Parents.insert(Parent.getMemoizationData()).second) { in TEST()