/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
H A D | Nodes.cpp | 116 return Children; in getSpecifiers() 123 Children; in getSpecifiersAndDoubleColons() local 129 return Children; in getSpecifiersAndDoubleColons() 138 return Children; in getArguments() 150 return Children; in getArgumentsAndCommas() 160 return Children; in getParameterDeclarations() 167 Children; in getParametersAndCommas() local 173 return Children; in getParametersAndCommas() 183 return Children; in getDeclarators() 190 Children; in getDeclaratorsAndCommas() local [all …]
|
H A D | Tree.cpp | 316 std::vector<syntax::List::ElementAndDelimiter<Node>> Children; in getElementsAsNodesAndDelimiters() local 322 Children.push_back({ElementWithoutDelimiter, nullptr}); 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() 390 Children.push_back(ElementWithoutDelimiter); in getElementsAsNodes() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Rewrite/ |
H A D | DeltaTree.cpp | 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() 242 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion() 244 IN->Children[i] = InsertRes->LHS; in DoInsertion() 257 IN->Children[i] = InsertRes->LHS; in DoInsertion() 282 memmove(&InsertSide->Children[i+2], &InsertSide->Children[i+1], in DoInsertion() 284 InsertSide->Children[i+1] = SubRHS; in DoInsertion() [all …]
|
H A D | RewriteRope.cpp | 400 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anon18e341ab0311::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() 539 Children[i+1] = RHS; in HandleChildPiece() 551 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece() 552 WidthFactor*sizeof(Children[0])); in HandleChildPiece() [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/ |
H A D | StorageLocation.h | 101 : StorageLocation(Kind::Record, Type), Children(std::move(TheChildren)), in RecordStorageLocation() 106 for (auto [Field, Loc] : Children) { in RecordStorageLocation() 126 auto It = Children.find(&D); in getChild() 128 if (It == Children.end()) { in getChild() 133 for ([[maybe_unused]] auto [Field, Loc] : Children) { in getChild() 138 assert(It != Children.end()); in getChild() 164 Children[&D] = Loc; in setChild() 168 return {Children.begin(), Children.end()}; in children() 172 FieldToLoc Children;
|
/freebsd/contrib/llvm-project/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 69 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 D | TokenAnnotator.h | 85 Current->Children.clear(); in addChildren() 86 for (const auto &Child : Node.Children) { in addChildren() 87 Children.push_back(new AnnotatedLine(Child)); in addChildren() 88 if (Children.back()->ContainsMacroCall) in addChildren() 90 Current->Children.push_back(Children.back()); in addChildren() 96 for (const auto *Child : Children) in size() 102 for (AnnotatedLine *Child : Children) in ~AnnotatedLine() 106 Current->Children.clear(); in ~AnnotatedLine() 167 SmallVector<AnnotatedLine *, 0> Children; variable
|
H A D | MacroCallReconstructor.cpp | 38 for (const auto &Child : N.Children) in forEachToken() 64 Result.Tokens.front()->Children.size() == 1); in takeResult() 479 auto *I = Top.Children.begin(); in finalize() 484 for (auto *E = Top.Children.end(); I != E; ++I) { in finalize() 485 assert(Last->Children.empty()); in finalize() 486 Last->Children.push_back(std::move(*I)); in finalize() 494 Top.Children.resize(1); in finalize() 512 for (const auto &Child : N->Children) { in createUnwrappedLine() 517 if (Current.Children.size() == 1 && in createUnwrappedLine() 521 Current.Children.clear(); in createUnwrappedLine() [all …]
|
H A D | AffectedRangeManager.cpp | 96 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 D | UnwrappedLineParser.h | 416 llvm::ArrayRef<UnwrappedLine> Children = {}) 417 : Tok(Tok), Children(Children.begin(), Children.end()) {} in Tok() 420 SmallVector<UnwrappedLine, 0> Children; member
|
/freebsd/contrib/llvm-project/clang/include/clang/AST/ |
H A D | LexicallyOrderedRecursiveASTVisitor.h | 116 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 D | OpenMPClause.h | 95 return const_child_range(Children.begin(), Children.end()); in children() 104 return const_child_range(Children.begin(), Children.end()); in used_children() 505 return const_child_range(Children.begin(), Children.end()); in children() 613 return const_child_range(Children.begin(), Children.end()); in used_children() 663 return const_child_range(Children.begin(), Children.end()); in used_children() 1808 return const_child_range(Children.begin(), Children.end()); in children() 2689 return const_child_range(Children.begin(), Children.end()); in children() 2828 return const_child_range(Children.begin(), Children.end()); in children() 2837 return const_child_range(Children.begin(), Children.end()); in used_children() 3069 return const_child_range(Children.begin(), Children.end()); in children() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | SuffixTree.cpp | 56 Parent.Children[Edge] = N; in insertLeaf() 70 Parent->Children[Edge] = N; in insertInternalNode() 96 for (auto &ChildPair : InternalNode->Children) { in setSuffixIndices() 125 if (Active.Node->Children.count(FirstChar) == 0) { in extend() 138 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend() 198 SplitNode->Children[Str[NextNode->getStartIdx()]] = NextNode; in extend() 247 for (auto &ChildPair : Curr->Children) { in advance()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
H A D | InlineInfo.h | 65 std::vector<InlineInfo> Children; member 72 Children.clear(); in clear() 183 LHS.Children == RHS.Children;
|
/freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/ |
H A D | TypePool.h | 68 ArrayList<TypeEntry *, 5> Children; variable 78 : Children(&Allocator) {} in TypeEntryBody() 139 ParentEntry->getValue().load()->Children.add(Entry); in getOrCreateTypeEntryBody() 150 Entry->getValue().load()->Children.sort(TypesComparator); in sortTypes() 151 Entry->getValue().load()->Children.forEach(SortChildrenRec); in sortTypes()
|
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | SEHFrameSupport.h | 41 DenseSet<Block *> Children; in operator() local 46 Children.insert(&Sym.getBlock()); in operator() 48 for (auto *Child : Children) in operator()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 64 SmallVector<DomTreeNodeBase *, 4> Children; 76 iterator begin() { return Children.begin(); } 77 iterator end() { return Children.end(); } 95 Children.push_back(C.get()); 102 void clearAllChildren() { Children.clear(); } 128 auto I = find(IDom->Children, this); 129 assert(I != IDom->Children.end() && 132 IDom->Children.erase(I); 136 IDom->Children.push_back(this); 697 assert(I != IDom->Children.end() && [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/ |
H A D | InlineInfo.cpp | 34 for (const auto &Child : II.Children) in operator <<() 47 for (const auto &Child : II.Children) { in getInlineStackHelper() 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(); in GetTotalNumChildren() 270 for (const auto &Child : II.Children) in GetTotalNumChildren()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | GenericCycleInfo.h | 62 std::vector<std::unique_ptr<GenericCycle>> Children; variable 79 Children.clear(); in clear() 156 return const_child_iterator{Children.begin()}; in child_begin() 159 return const_child_iterator{Children.end()}; in child_end() 161 size_t getNumChildren() const { return Children.size(); } in getNumChildren() 163 return llvm::make_range(const_child_iterator{Children.begin()}, in children() 164 const_child_iterator{Children.end()}); in children()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 245 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()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | IteratedDominanceFrontier.h | 72 auto Children = children<OrderedNodeTy>(N); 73 return {Children.begin(), Children.end()};
|
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Refactoring/ |
H A D | ASTSelection.h | 55 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 D | DIE.h | 90 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 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() 944 Children.push_front(*Child); in addChildFront() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Tooling/Refactoring/ |
H A D | ASTSelection.cpp | 58 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/include/llvm/Object/ |
H A D | WindowsResource.h | 169 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;
|