Home
last modified time | relevance | path

Searched refs:Children (Results 1 – 25 of 99) sorted by relevance

1234

/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
H A DNodes.cpp112 std::vector<syntax::NameSpecifier *> Children; in getSpecifiers() local
114 Children.push_back(llvm::cast<syntax::NameSpecifier>(Element)); in getSpecifiers()
116 return Children; in getSpecifiers()
123 Children; in getSpecifiersAndDoubleColons() local
125 Children.push_back( in getSpecifiersAndDoubleColons()
129 return Children; in getSpecifiersAndDoubleColons()
134 std::vector<syntax::Expression *> Children; in getArguments() local
136 Children.push_back(llvm::cast<syntax::Expression>(ArgumentAsNode)); in getArguments()
138 return Children; in getArguments()
144 std::vector<syntax::List::ElementAndDelimiter<syntax::Expression>> Children; in getArgumentsAndCommas() local
[all …]
H A DTree.cpp345 std::vector<syntax::List::ElementAndDelimiter<Node>> Children; in getElementsAsNodesAndDelimiters() local
351 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
357 Children.push_back({ElementWithoutDelimiter, cast<syntax::Leaf>(&C)}); in getElementsAsNodesAndDelimiters()
369 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
375 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
381 return Children; in getElementsAsNodesAndDelimiters()
390 std::vector<syntax::Node *> Children; in getElementsAsNodes() local
396 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
402 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
413 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
[all …]
H A DSynthesis.cpp199 ArrayRef<std::pair<syntax::Node *, syntax::NodeRole>> Children, in createTree() argument
203 for (const auto &Child : Children) in createTree()
219 std::vector<std::pair<syntax::Node *, syntax::NodeRole>> Children; in deepCopyExpandingMacros() local
222 Children.push_back({deepCopyExpandingMacros(A, Child), Child->getRole()}); in deepCopyExpandingMacros()
224 return createTree(A, Children, N->getKind()); in deepCopyExpandingMacros()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Rewrite/
H A DDeltaTree.cpp126 DeltaTreeNode *Children[2*WidthFactor]; member in __anonb6a907500111::DeltaTreeInteriorNode
130 Children[i]->Destroy(); in ~DeltaTreeInteriorNode()
138 Children[0] = IR.LHS; in DeltaTreeInteriorNode()
139 Children[1] = IR.RHS; in DeltaTreeInteriorNode()
147 return Children[i]; in getChild()
152 return Children[i]; in getChild()
232 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion()
242 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion()
243 (e-i)*sizeof(IN->Children[0])); in DoInsertion()
244 IN->Children[i] = InsertRes->LHS; in DoInsertion()
[all …]
H A DRewriteRope.cpp400 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anoncedcbeae0311::RopePieceBTreeInterior
407 Children[0] = LHS; in RopePieceBTreeInterior()
408 Children[1] = RHS; in RopePieceBTreeInterior()
415 Children[i]->Destroy(); in ~RopePieceBTreeInterior()
424 return Children[i]; in getChild()
429 return Children[i]; in getChild()
537 memmove(&Children[i+2], &Children[i+1], in HandleChildPiece()
538 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece()
539 Children[i+1] = RHS; in HandleChildPiece()
551 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/
H A DFileMatchTrie.cpp69 if (Children.empty()) { in insert()
76 Children[Element].Path = Path; in insert()
80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert()
109 if (Children.empty()) { in findEquivalent()
121 Children.find(Element); in findEquivalent()
122 if (MatchingChild != Children.end()) { in findEquivalent()
158 if (Children.empty()) { in getAll()
163 It = Children.begin(), E = Children.end(); in getAll()
167 It->getValue().getAll(Results, Children.end()); in getAll()
176 llvm::StringMap<FileMatchTrieNode> Children; member in clang::tooling::FileMatchTrieNode
/netbsd-src/external/apache2/llvm/dist/clang/lib/Format/
H A DTokenAnnotator.h62 Current->Children.clear(); in AnnotatedLine()
63 for (const auto &Child : Node.Children) { in AnnotatedLine()
64 Children.push_back(new AnnotatedLine(Child)); in AnnotatedLine()
65 Current->Children.push_back(Children.back()); in AnnotatedLine()
73 for (unsigned i = 0, e = Children.size(); i != e; ++i) { in ~AnnotatedLine()
74 delete Children[i]; in ~AnnotatedLine() local
78 Current->Children.clear(); in ~AnnotatedLine()
125 SmallVector<AnnotatedLine *, 0> Children; variable
H A DAffectedRangeManager.cpp96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end()); in markAllAsAffected()
105 Line->ChildrenAffected = computeAffectedLines(Line->Children); in nonPPLineAffected()
125 if (!Tok->Children.empty() && Tok->Children.front()->Affected) in nonPPLineAffected()
128 IncludeLeadingNewlines = Tok->Children.empty(); in nonPPLineAffected()
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DLexicallyOrderedRecursiveASTVisitor.h116 SmallVector<Stmt *, 8> Children(CE->children()); in getStmtChildren()
129 Swap = Children.size() != 2; in getStmtChildren()
135 if (Swap && Children.size() > 1) in getStmtChildren()
136 std::swap(Children[0], Children[1]); in getStmtChildren()
137 return Children; in getStmtChildren()
H A DOpenMPClause.h93 auto Children = const_cast<OMPClause *>(this)->children(); in children() local
94 return const_child_range(Children.begin(), Children.end()); in children()
102 auto Children = const_cast<OMPClause *>(this)->children(); in used_children() local
103 return const_child_range(Children.begin(), Children.end()); in used_children()
406 auto Children = const_cast<OMPAllocateClause *>(this)->children(); in children() local
407 return const_child_range(Children.begin(), Children.end()); in children()
514 auto Children = const_cast<OMPIfClause *>(this)->used_children(); in used_children() local
515 return const_child_range(Children.begin(), Children.end()); in used_children()
582 auto Children = const_cast<OMPFinalClause *>(this)->used_children(); in used_children() local
583 return const_child_range(Children.begin(), Children.end()); in used_children()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DSuffixTree.cpp48 Parent.Children[Edge] = N; in insertLeaf()
65 Parent->Children[Edge] = N; in insertInternalNode()
85 for (auto &ChildPair : CurrNode->Children) { in setSuffixIndices()
92 if (CurrNode->Children.size() == 0 && !CurrNode->isRoot()) in setSuffixIndices()
114 if (Active.Node->Children.count(FirstChar) == 0) { in extend()
127 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend()
185 SplitNode->Children[Str[NextNode->StartIdx]] = NextNode; in extend()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A DGenericDomTree.h63 SmallVector<DomTreeNodeBase *, 4> Children;
75 iterator begin() { return Children.begin(); }
76 iterator end() { return Children.end(); }
77 const_iterator begin() const { return Children.begin(); }
78 const_iterator end() const { return Children.end(); }
80 DomTreeNodeBase *const &back() const { return Children.back(); }
81 DomTreeNodeBase *&back() { return Children.back(); }
94 Children.push_back(C.get());
98 bool isLeaf() const { return Children.empty(); }
99 size_t getNumChildren() const { return Children.size(); }
[all …]
H A DGenericDomTreeConstruction.h1139 auto ChIt = llvm::find(IDom->Children, TN); in EraseNode()
1140 assert(ChIt != IDom->Children.end()); in EraseNode()
1141 std::swap(*ChIt, IDom->Children.back()); in EraseNode()
1142 IDom->Children.pop_back(); in EraseNode()
1375 SmallVector<TreeNodePtr, 8> Children(Node->begin(), Node->end()); in VerifyDFSNumbers()
1376 llvm::sort(Children, [](const TreeNodePtr Ch1, const TreeNodePtr Ch2) { in VerifyDFSNumbers()
1380 auto PrintChildrenError = [Node, &Children, PrintNodeAndDFSNums]( in VerifyDFSNumbers()
1396 for (const TreeNodePtr Ch : Children) { in VerifyDFSNumbers()
1405 if (Children.front()->getDFSNumIn() != Node->getDFSNumIn() + 1) { in VerifyDFSNumbers()
1406 PrintChildrenError(Children.front(), nullptr); in VerifyDFSNumbers()
[all …]
H A DCFGDiff.h144 auto &Children = (InverseEdge != InverseGraph) ? Pred : Succ; in getChildren() local
145 auto It = Children.find(N); in getChildren()
146 if (It == Children.end()) in getChildren()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/
H A DInlineInfo.h67 std::vector<InlineInfo> Children; member
74 Children.clear(); in clear()
174 LHS.Children == RHS.Children;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DLexicalScopes.cpp245 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
246 if (ChildNum < Children.size()) { in constructScopeNest()
247 auto &ChildScope = Children[ChildNum]; in constructScopeNest()
341 if (!Children.empty()) in dump()
343 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
344 if (Children[i] != this) in dump()
345 Children[i]->dump(Indent + 2); in dump()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DDIE.h90 bool Children; variable
96 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C) {} in DIEAbbrev()
102 bool hasChildren() const { return Children; } in hasChildren()
104 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag()
754 IntrusiveBackList<DIE> Children; variable
779 bool hasChildren() const { return ForceChildren || !Children.empty(); } in hasChildren()
788 return make_range(Children.begin(), Children.end()); in children()
791 return make_range(Children.begin(), Children.end()); in children()
849 Children.push_back(*Child); in addChild()
850 return Children.back(); in addChild()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DIteratedDominanceFrontier.h72 auto Children = children<OrderedNodeTy>(N);
73 return {Children.begin(), Children.end()};
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Tooling/Refactoring/
H A DASTSelection.h54 std::vector<SelectedASTNode> Children; member
107 return SelectedNode.get().Children.size(); in size()
115 return SelectedNode.get().Children[I].Node.get<Stmt>();
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/
H A DASTSelection.cpp57 if (Result.Children.empty()) in getSelectedASTNode()
135 if (SelectionKind != SourceSelectionKind::None || !Node.Children.empty()) in popAndAddToSelectionIfSelected()
136 SelectionStack.back().Children.push_back(std::move(Node)); in popAndAddToSelectionIfSelected()
226 for (const auto &Child : Node.Children) in dump()
240 for (const auto &Child : Node.Children) { in hasAnyDirectChildrenWithKind()
348 for (const auto &Child : ASTSelection.Children) { in findDeepestWithKind()
365 for (const auto &Child : ASTSelection.Children) in findDeepestWithKind()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/
H A DInlineInfo.cpp34 for (const auto &Child : II.Children) in operator <<()
47 for (const auto &Child : II.Children) { in getInlineStackHelper()
216 Inline.Children.emplace_back(std::move(*Child)); in decode()
236 bool HasChildren = !Children.empty(); in encode()
246 for (const auto &Child : Children) { in encode()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Object/
H A DWindowsResource.h169 using Children = std::map<T, std::unique_ptr<TreeNode>>;
179 const Children<uint32_t> &getIDChildren() const { return IDChildren; } in getIDChildren()
180 const Children<std::string> &getStringChildren() const { in getStringChildren()
223 Children<uint32_t> IDChildren;
224 Children<std::string> StringChildren;
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DDAGISelMatcher.h190 SmallVector<Matcher*, 4> Children; variable
193 : Matcher(Scope), Children(children.begin(), children.end()) { in ScopeMatcher()
197 unsigned getNumChildren() const { return Children.size(); } in getNumChildren()
199 Matcher *getChild(unsigned i) { return Children[i]; } in getChild()
200 const Matcher *getChild(unsigned i) const { return Children[i]; } in getChild()
203 delete Children[i]; in resetChild() local
204 Children[i] = N; in resetChild()
208 Matcher *Res = Children[i]; in takeChild()
209 Children[i] = nullptr; in takeChild()
214 if (NC < Children.size()) { in setNumChildren()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.h132 std::vector<GIMatchTree> Children; variable
140 void setNumChildren(unsigned Num) { Children.resize(Num); } in setNumChildren()
157 return Children.begin(); in children_begin()
159 std::vector<GIMatchTree>::iterator children_end() { return Children.end(); } in children_end()
164 return Children.begin(); in children_begin()
167 return Children.end(); in children_end()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp208 P.Children.push_back(MyId); in PreTraverse()
229 for (NodeId Child : N.Children) in PostTraverse()
286 for (NodeId Child : N.Children) in getSubtreePostorder()
300 for (NodeId Child : Tree.getNode(Ids[Expanded++]).Children) in getSubtreeBfs()
310 for (NodeId Child : getNode(Id).Children) in initTree()
324 getNode(Parent).Children[0] == Cur) { in setLeftMostDescendants()
343 const auto &Siblings = getNode(Parent).Children; in findPositionInParent()
751 for (NodeId Child : Tree.getNode(Id).Children) in open()
760 if (N1.Children.size() != N2.Children.size() || in identical()
764 for (size_t Id = 0, E = N1.Children.size(); Id < E; ++Id) in identical()
[all …]

1234