Home
last modified time | relevance | path

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

12345

/freebsd/contrib/llvm-project/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.cpp316 std::vector<syntax::List::ElementAndDelimiter<Node>> Children; in getElementsAsNodesAndDelimiters() local
322 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
328 Children.push_back({ElementWithoutDelimiter, cast<syntax::Leaf>(&C)}); in getElementsAsNodesAndDelimiters()
340 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
346 Children.push_back({ElementWithoutDelimiter, nullptr}); in getElementsAsNodesAndDelimiters()
352 return Children; in getElementsAsNodesAndDelimiters()
361 std::vector<syntax::Node *> Children; in getElementsAsNodes() local
367 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
373 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
384 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Rewrite/
H A DDeltaTree.cpp126 DeltaTreeNode *Children[2*WidthFactor]; member in __anon5fc690450111::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 __anon358058e30311::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 …]
/freebsd/contrib/llvm-project/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
/freebsd/contrib/llvm-project/clang/lib/Format/
H A DMacroCallReconstructor.cpp38 for (const auto &Child : N.Children) in forEachToken()
63 Result.Tokens.front()->Children.size() == 1); in takeResult()
65 *Result.Tokens.front()->Children.front(), Result.Level); in takeResult()
174 ActiveReconstructedLines.back()->Tokens.back()->Children.push_back( in prepareParent()
177 &*ActiveReconstructedLines.back()->Tokens.back()->Children.back()); in prepareParent()
473 assert(Result.Tokens.size() == 1 && !Result.Tokens.front()->Children.empty()); in finalize()
481 auto *I = Top.Children.begin(); in finalize()
486 for (auto *E = Top.Children.end(); I != E; ++I) { in finalize()
487 assert(Last->Children.empty()); in finalize()
488 Last->Children.push_back(std::move(*I)); in finalize()
[all …]
H A DTokenAnnotator.h86 Current->Children.clear(); in addChildren()
87 for (const auto &Child : Node.Children) { in addChildren()
88 Children.push_back(new AnnotatedLine(Child)); in addChildren()
89 if (Children.back()->ContainsMacroCall) in addChildren()
91 Current->Children.push_back(Children.back()); in addChildren()
97 for (const auto *Child : Children) in size()
103 for (AnnotatedLine *Child : Children) in ~AnnotatedLine()
107 Current->Children.clear(); in ~AnnotatedLine()
168 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()
126 if (!Tok->Children.empty() && Tok->Children.front()->Affected) in nonPPLineAffected()
129 IncludeLeadingNewlines = Tok->Children.empty(); in nonPPLineAffected()
H A DUnwrappedLineParser.h412 llvm::ArrayRef<UnwrappedLine> Children = {})
413 : Tok(Tok), Children(Children.begin(), Children.end()) {} in Tok()
416 SmallVector<UnwrappedLine, 0> Children; member
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp63 Parent.Children[Edge] = N; in insertLeaf()
77 Parent->Children[Edge] = N; in insertInternalNode()
103 for (auto &ChildPair : InternalNode->Children) { in setSuffixIndices()
141 auto J = CurrInternalNode->Children.begin(); in setLeafNodes()
142 if (J != CurrInternalNode->Children.end()) { in setLeafNodes()
146 for (; J != CurrInternalNode->Children.end(); ++J) { in setLeafNodes()
196 if (Active.Node->Children.count(FirstChar) == 0) { in extend()
209 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend()
269 SplitNode->Children[Str[NextNode->getStartIdx()]] = NextNode; in extend()
317 for (auto &ChildPair : Curr->Children) in advance()
[all …]
/freebsd/contrib/llvm-project/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.h94 auto Children = const_cast<OMPClause *>(this)->children(); in children() local
95 return const_child_range(Children.begin(), Children.end()); in children()
103 auto Children = const_cast<OMPClause *>(this)->children(); in used_children() local
104 return const_child_range(Children.begin(), Children.end()); in used_children()
504 auto Children = const_cast<OMPAllocateClause *>(this)->children(); in children() local
505 return const_child_range(Children.begin(), Children.end()); in children()
612 auto Children = const_cast<OMPIfClause *>(this)->used_children(); in used_children() local
613 return const_child_range(Children.begin(), Children.end()); in used_children()
662 auto Children = const_cast<OMPFinalClause *>(this)->used_children(); in used_children() local
663 return const_child_range(Children.begin(), Children.end()); in used_children()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/
H A DInlineInfo.h30 /// "Children" variable. All address ranges must be sorted and all address
65 std::vector<InlineInfo> Children; member
72 Children.clear(); in clear()
183 LHS.Children == RHS.Children;
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h64 SmallVector<DomTreeNodeBase *, 4> Children;
76 iterator begin() { return Children.begin(); }
77 iterator end() { return Children.end(); }
78 const_iterator begin() const { return Children.begin(); }
79 const_iterator end() const { return Children.end(); }
81 DomTreeNodeBase *const &back() const { return Children.back(); }
82 DomTreeNodeBase *&back() { return Children.back(); }
95 Children.push_back(C.get());
99 bool isLeaf() const { return Children.empty(); }
100 size_t getNumChildren() const { return Children.size(); }
[all …]
H A DGenericDomTreeConstruction.h1120 auto ChIt = llvm::find(IDom->Children, TN); in EraseNode()
1121 assert(ChIt != IDom->Children.end()); in EraseNode()
1122 std::swap(*ChIt, IDom->Children.back()); in EraseNode()
1123 IDom->Children.pop_back(); in EraseNode()
1356 SmallVector<TreeNodePtr, 8> Children(Node->begin(), Node->end()); in VerifyDFSNumbers()
1357 llvm::sort(Children, [](const TreeNodePtr Ch1, const TreeNodePtr Ch2) { in VerifyDFSNumbers()
1361 auto PrintChildrenError = [Node, &Children, PrintNodeAndDFSNums]( in VerifyDFSNumbers()
1377 for (const TreeNodePtr Ch : Children) { in VerifyDFSNumbers()
1386 if (Children.front()->getDFSNumIn() != Node->getDFSNumIn() + 1) { in VerifyDFSNumbers()
1387 PrintChildrenError(Children.front(), nullptr); in VerifyDFSNumbers()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DSEHFrameSupport.h42 SetVector<Block *> Children; in operator() local
47 Children.insert(&Sym.getBlock()); in operator()
49 for (auto *Child : Children) in operator()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h62 std::vector<std::unique_ptr<GenericCycle>> Children; variable
79 Children.clear(); in clear()
160 return const_child_iterator{Children.begin()}; in child_begin()
163 return const_child_iterator{Children.end()}; in child_end()
165 size_t getNumChildren() const { return Children.size(); } in getNumChildren()
167 return llvm::make_range(const_child_iterator{Children.begin()}, in children()
168 const_child_iterator{Children.end()}); in children()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIteratedDominanceFrontier.h72 auto Children = children<OrderedNodeTy>(N);
73 return {Children.begin(), Children.end()};
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Refactoring/
H A DASTSelection.h55 std::vector<SelectedASTNode> Children; member
108 return SelectedNode.get().Children.size(); in size()
116 return SelectedNode.get().Children[I].Node.get<Stmt>();
/freebsd/contrib/llvm-project/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()
834 IntrusiveBackList<DIE> Children; variable
867 bool hasChildren() const { return ForceChildren || !Children.empty(); } in hasChildren()
876 return make_range(Children.begin(), Children.end()); in children()
879 return make_range(Children.begin(), Children.end()); in children()
937 Children.push_back(*Child); in addChild()
938 return Children.back(); in addChild()
[all …]
/freebsd/contrib/llvm-project/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()
69 /// objects to the InlineInfo::Children array.
99 /// InlineInfo::Children array and also skips any InlineInfo objects that do
217 Inline.Children.emplace_back(std::move(*Child)); in decode()
237 bool HasChildren = !Children.empty(); in encode()
247 for (const auto &Child : Children) { in encode()
269 uint64_t NumChildren = II.Children.size();
270 for (const auto &Child : II.Children)
/freebsd/contrib/llvm-project/clang/lib/Tooling/Refactoring/
H A DASTSelection.cpp58 if (Result.Children.empty()) in getSelectedASTNode()
136 if (SelectionKind != SourceSelectionKind::None || !Node.Children.empty()) in popAndAddToSelectionIfSelected()
137 SelectionStack.back().Children.push_back(std::move(Node)); in popAndAddToSelectionIfSelected()
227 for (const auto &Child : Node.Children) in dump()
241 for (const auto &Child : Node.Children) { in hasAnyDirectChildrenWithKind()
349 for (const auto &Child : ASTSelection.Children) { in findDeepestWithKind()
366 for (const auto &Child : ASTSelection.Children) in findDeepestWithKind()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp99 if (Candidate->Children.size() == 0) in findParentRegion()
102 for (auto *Child : Candidate->Children) { in findParentRegion()
149 for (auto *Child : Children) { in releaseMemory()
153 Children.resize(0); in releaseMemory()
191 for (const auto Child : Children) in dump()
304 Region->Parent->Children.push_back(Region); in analyze()
/freebsd/contrib/llvm-project/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;
/freebsd/contrib/llvm-project/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 (const LexicalScope *Child : Children) in dump()

12345