/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | LexicallyOrderedRecursiveASTVisitor.h | 116 SmallVector<Stmt *, 8> Children(CE->children()); 129 Swap = Children.size() != 2; 135 if (Swap && Children.size() > 1) 136 std::swap(Children[0], Children[1]); 137 return Children;
|
H A D | OpenMPClause.h | 90 auto Children = const_cast<OMPClause *>(this)->children(); local 91 return const_child_range(Children.begin(), Children.end()); 99 auto Children = const_cast<OMPClause *>(this)->children(); local 100 return const_child_range(Children.begin(), Children.end()); 402 auto Children = const_cast<OMPAllocateClause *>(this)->children(); local 403 return const_child_range(Children.begin(), Children.end()); 509 auto Children local 577 auto Children = const_cast<OMPFinalClause *>(this)->used_children(); local 1451 auto Children = const_cast<OMPScheduleClause *>(this)->children(); local 1967 auto Children = const_cast<OMPPrivateClause *>(this)->children(); local 2106 auto Children = const_cast<OMPFirstprivateClause *>(this)->children(); local 2115 auto Children = const_cast<OMPFirstprivateClause *>(this)->used_children(); local 2347 auto Children = const_cast<OMPLastprivateClause *>(this)->children(); local 2419 auto Children = const_cast<OMPSharedClause *>(this)->children(); local 2653 auto Children = const_cast<OMPReductionClause *>(this)->children(); local 2662 auto Children = const_cast<OMPReductionClause *>(this)->used_children(); local 2887 auto Children = const_cast<OMPTaskReductionClause *>(this)->children(); local 3142 auto Children = const_cast<OMPInReductionClause *>(this)->children(); local 3419 auto Children = const_cast<OMPLinearClause *>(this)->children(); local 3426 auto Children = const_cast<OMPLinearClause *>(this)->used_children(); local 3518 auto Children = const_cast<OMPAlignedClause *>(this)->children(); local 3694 auto Children = const_cast<OMPCopyinClause *>(this)->children(); local 3857 auto Children = const_cast<OMPCopyprivateClause *>(this)->children(); local 3934 auto Children = const_cast<OMPFlushClause *>(this)->children(); local 4065 auto Children = const_cast<OMPDependClause *>(this)->children(); local 5297 auto Children = const_cast<OMPPriorityClause *>(this)->used_children(); local 5365 auto Children = const_cast<OMPGrainsizeClause *>(this)->used_children(); local 5472 auto Children = const_cast<OMPNumTasksClause *>(this)->used_children(); local 5645 auto Children = const_cast<OMPDistScheduleClause *>(this)->children(); local 5874 auto Children = const_cast<OMPToClause *>(this)->children(); local 5992 auto Children = const_cast<OMPFromClause *>(this)->children(); local 6155 auto Children = const_cast<OMPUseDevicePtrClause *>(this)->children(); local 6258 auto Children = const_cast<OMPIsDevicePtrClause *>(this)->children(); local 6344 auto Children = const_cast<OMPNontemporalClause *>(this)->children(); local 6354 auto Children = const_cast<OMPNontemporalClause *>(this)->private_refs(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 69 if (Children.empty()) { 76 Children[Element].Path = Path; 80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); 108 if (Children.empty()) { 116 Children.find(Element); 117 if (MatchingChild != Children.end()) { 146 if (Children.empty()) { 151 It = Children.begin(), E = Children.end(); 155 It->getValue().getAll(Results, Children 164 llvm::StringMap<FileMatchTrieNode> Children; member in class:clang::tooling::FileMatchTrieNode [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
H A D | InlineInfo.h | 32 /// "Children" variable. All address ranges must be sorted and all address 67 std::vector<InlineInfo> Children; member in struct:llvm::gsym::InlineInfo 74 Children.clear(); 174 LHS.Children == RHS.Children;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Rewrite/ |
H A D | DeltaTree.cpp | 126 DeltaTreeNode *Children[2*WidthFactor]; 130 Children[i]->Destroy(); 138 Children[0] = IR.LHS; 139 Children[1] = IR.RHS; 147 return Children[i]; 152 return Children[i]; 232 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) 242 memmove(&IN->Children[i+2], &IN->Children[i+1], 243 (e-i)*sizeof(IN->Children[ [all...] |
H A D | RewriteRope.cpp | 397 /// Children array. 400 RopePieceBTreeNode *Children[2*WidthFactor]; 407 Children[0] = LHS; 408 Children[1] = RHS; 415 Children[i]->Destroy(); 424 return Children[i]; 429 return Children[i]; 537 memmove(&Children[i+2], &Children[i+1], 538 (getNumChildren()-i-1)*sizeof(Children[ [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Format/ |
H A D | TokenAnnotator.h | 62 Current->Children.clear(); 63 for (const auto &Child : Node.Children) { 64 Children.push_back(new AnnotatedLine(Child)); 65 Current->Children.push_back(Children.back()); 73 for (unsigned i = 0, e = Children.size(); i != e; ++i) { 74 delete Children[i]; 78 Current->Children.clear(); 125 SmallVector<AnnotatedLine *, 0> Children; member in class:clang::format::AnnotatedLine
|
H A D | AffectedRangeManager.cpp | 96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end()); 105 Line->ChildrenAffected = computeAffectedLines(Line->Children); 125 if (!Tok->Children.empty() && Tok->Children.front()->Affected) 128 IncludeLeadingNewlines = Tok->Children.empty();
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | IteratedDominanceFrontier.h | 72 auto Children = children<OrderedNodeTy>(N); local 73 return {Children.begin(), Children.end()};
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Refactoring/ |
H A D | ASTSelection.h | 53 std::vector<SelectedASTNode> Children; member in struct:clang::tooling::SelectedASTNode 107 return SelectedNode.get().Children.size(); 115 return SelectedNode.get().Children[I].Node.get<Stmt>();
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/ |
H A D | PrettyCompilandDumper.h | 22 enum Flags { None = 0x0, Children = 0x1, Symbols = 0x2, Lines = 0x4 }; enumerator in enum:llvm::pdb::CompilandDumper::Flags
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/ASTDiff/ |
H A D | ASTDiff.h | 41 SmallVector<NodeId, 4> Children; member in struct:clang::diff::Node 46 bool isLeaf() const { return Children.empty(); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/ |
H A D | InlineInfo.cpp | 34 for (const auto &Child : II.Children) 47 for (const auto &Child : II.Children) { 68 /// objects to the InlineInfo::Children array. 98 /// InlineInfo::Children array and also skips any InlineInfo objects that do 212 Inline.Children.emplace_back(std::move(*Child)); 232 bool HasChildren = !Children.empty(); 242 for (const auto &Child : Children) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericIteratedDominanceFrontier.h | 124 auto Children = children<OrderedNodeTy>(N); 125 return {Children.begin(), Children.end()};
|
H A D | GenericDomTree.h | 64 std::vector<DomTreeNodeBase *> Children; member in class:llvm::DomTreeNodeBase 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(); } 85 const std::vector<DomTreeNodeBase *> &getChildren() const { return Children; } 89 Children.push_back(C.get()); 93 size_t getNumChildren() const { return Children.size(); } 95 void clearAllChildren() { Children.clear(); } 121 auto I = find(IDom->Children, thi [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 240 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); local 242 for (auto &ChildScope : Children) 332 if (!Children.empty()) 333 err << std::string(Indent + 2, ' ') << "Children ...\n"; 334 for (unsigned i = 0, e = Children.size(); i != e; ++i) 335 if (Children[i] != this) 336 Children[i]->dump(Indent + 2);
|
/freebsd-11-stable/cddl/usr.sbin/zfsd/ |
H A D | vdev.h | 122 std::list<Vdev> Children();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugHandlerBase.cpp | 99 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren(); local 100 if (!Children.empty()) 101 WorkList.append(Children.begin(), Children.end());
|
H A D | DwarfCompileUnit.cpp | 435 SmallVector<DIE *, 8> Children; local 446 createScopeChildrenDIE(Scope, Children); 456 createScopeChildrenDIE(Scope, Children, &HasNonScopeChildren); 462 std::make_move_iterator(Children.begin()), 463 std::make_move_iterator(Children.end())); 471 for (auto &I : Children) 792 SmallVectorImpl<DIE *> &Children, 794 assert(Children.empty()); 800 Children.push_back(constructVariableDIE(*DV.second, *Scope, ObjectPointer)); 805 Children 791 createScopeChildrenDIE(LexicalScope *Scope, SmallVectorImpl<DIE *> &Children, bool *HasNonScopeChildren) argument 858 SmallVector<DIE *, 8> Children; local [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Refactoring/ |
H A D | ASTSelection.cpp | 58 if (Result.Children.empty()) 136 if (SelectionKind != SourceSelectionKind::None || !Node.Children.empty()) 137 SelectionStack.back().Children.push_back(std::move(Node)); 227 for (const auto &Child : Node.Children) 241 for (const auto &Child : Node.Children) { 349 for (const auto &Child : ASTSelection.Children) { 366 for (const auto &Child : ASTSelection.Children)
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Object/ |
H A D | WindowsResource.h | 171 using Children = std::map<T, std::unique_ptr<TreeNode>>; 181 const Children<uint32_t> &getIDChildren() const { return IDChildren; } 182 const Children<std::string> &getStringChildren() const { 225 Children<uint32_t> IDChildren; 226 Children<std::string> StringChildren;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | DIE.h | 90 bool Children; member in class:llvm::DIEAbbrev 96 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C) {} 102 bool hasChildren() const { return Children; } 104 void setChildrenFlag(bool hasChild) { Children = hasChild; } 726 /// Children DIEs. 727 IntrusiveBackList<DIE> Children; member in class:llvm::DIE 752 bool hasChildren() const { return ForceChildren || !Children.empty(); } 761 return make_range(Children.begin(), Children.end()); 764 return make_range(Children [all...] |
H A D | LexicalScopes.h | 65 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } 69 void addChild(LexicalScope *S) { Children.push_back(S); } 127 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in class:llvm::LexicalScope
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchTree.h | 132 std::vector<GIMatchTree> Children; member in class:llvm::GIMatchTree 140 void setNumChildren(unsigned Num) { Children.resize(Num); } 157 return Children.begin(); 159 std::vector<GIMatchTree>::iterator children_end() { return Children.end(); } 164 return Children.begin(); 167 return Children.end();
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 184 SmallVector<Matcher*, 4> Children; member in class:llvm::ScopeMatcher 187 : Matcher(Scope), Children(children.begin(), children.end()) { 191 unsigned getNumChildren() const { return Children.size(); } 193 Matcher *getChild(unsigned i) { return Children[i]; } 194 const Matcher *getChild(unsigned i) const { return Children[i]; } 197 delete Children[i]; 198 Children[i] = N; 202 Matcher *Res = Children[i]; 203 Children[i] = nullptr; 208 if (NC < Children [all...] |