| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 72 auto Children = children<OrderedNodeTy>(N);
73 return {Children.begin(), Children.end()};
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 52 /// - If the node has a path 'p2' but no children, take the last path segment
69 if (Children.empty()) {
76 Children[Element].Path = Path;
80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
94 /// - .. have children. In this case it is checked
98 /// - .. a child matching the next path segment. In this case, all children of
99 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
109 if (Children.empty()) {
121 Children.find(Element);
122 if (MatchingChild != Children.end())
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| Synthesis.cpp | 199 ArrayRef<std::pair<syntax::Node *, syntax::NodeRole>> Children,
203 for (const auto &Child : Children)
219 std::vector<std::pair<syntax::Node *, syntax::NodeRole>> Children;
222 Children.push_back({deepCopyExpandingMacros(A, Child), Child->getRole()});
224 return createTree(A, Children, N->getKind());
|
| Nodes.cpp | 112 std::vector<syntax::NameSpecifier *> Children;
114 Children.push_back(llvm::cast<syntax::NameSpecifier>(Element));
116 return Children;
123 Children;
125 Children.push_back(
129 return Children;
134 std::vector<syntax::Expression *> Children;
136 Children.push_back(llvm::cast<syntax::Expression>(ArgumentAsNode));
138 return Children;
144 std::vector<syntax::List::ElementAndDelimiter<syntax::Expression>> Children;
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/ |
| InlineInfo.h | 32 /// "Children" variable. All address ranges must be sorted and all address
33 /// ranges of all children must be contained in the ranges of this function.
51 /// - UINT8 boolean value that specifies if the InlineInfo object has children.
58 /// - if this object has children, enocode each child InlineInfo using the
67 std::vector<InlineInfo> Children;
74 Children.clear();
174 LHS.Children == RHS.Children;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/ |
| PrettyCompilandDumper.h | 22 enum Flags { None = 0x0, Children = 0x1, Symbols = 0x2, Lines = 0x4 };
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 54 std::vector<SelectedASTNode> Children;
107 return SelectedNode.get().Children.size();
115 return SelectedNode.get().Children[I].Node.get<Stmt>();
148 /// True only when the children of the selected node are actually selected.
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ExprObjC.cpp | 339 Stmt::child_range ObjCMessageExpr::children() { function in class:ObjCMessageExpr
349 Stmt::const_child_range ObjCMessageExpr::children() const { function in class:ObjCMessageExpr
350 auto Children = const_cast<ObjCMessageExpr *>(this)->children();
351 return const_child_range(Children.begin(), Children.end());
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFVerifier.h | 43 std::set<DieRangeInfo> Children;
62 /// children address ranges must all be contained in.
79 /// This is used for finding overlapping children of the same DIE.
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ASTDiff/ |
| ASTDiff.h | 41 SmallVector<NodeId, 4> Children;
46 bool isLeaf() const { return Children.empty(); }
|
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| 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;
144 /// \c True if one of this line's children intersects with an input range
[all...] |
| UnwrappedLineParser.h | 305 SmallVector<UnwrappedLine, 0> Children;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGDiff.h | 30 // a non-inversed graph, the children are naturally the successors when
53 // a getChildren method to get a Node's children based on the additional updates
68 // and inserted edges are considered deleted when returning children.
138 auto R = children<DirectedNodeT>(N);
141 // Remove nullptr children for clang.
144 auto &Children = (InverseEdge != InverseGraph) ? Pred : Succ;
145 auto It = Children.find(N);
146 if (It == Children.end())
149 // Remove children present in the CFG but not in the snapshot.
153 // Add children present in the snapshot for not in the real CFG
[all...] |
| SuffixTree.h | 27 /// Each node has either no children or at least two children, with the root
30 /// Children are represented as a map between unsigned integers and nodes. If
42 /// The children of this node.
47 llvm::DenseMap<unsigned, SuffixTreeNode *> Children;
72 /// helps with inserting children of internal nodes.
278 for (auto &ChildPair : Curr->Children) {
279 // Save all of this node's children for processing.
284 // long enough string, then save the leaf children.
335 // Yes. At the first step, we need to visit all of N's children
[all...] |
| GenericDomTree.h | 63 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(); }
83 iterator_range<iterator> children() { return make_range(begin(), end()); } function in class:llvm::DomTreeNodeBase
84 iterator_range<const_iterator> children() const { function in class:llvm::DomTreeNodeBase
94 Children.push_back(C.get())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DebugHandlerBase.cpp | 119 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren();
120 if (!Children.empty())
121 WorkList.append(Children.begin(), Children.end());
|
| CodeViewDebug.h | 121 SmallVector<LexicalBlock *, 1> Children;
369 /// Emits a sequence of lexical block scopes and their children.
373 /// Emit a lexical block scope and its children.
|
| DwarfCompileUnit.cpp | 517 SmallVector<DIE *, 8> Children;
519 // We try to create the scope DIE first, then the children DIEs. This will
520 // avoid creating un-used children then removing them later when we find out
527 // We create children when the scope DIE is not null.
528 createScopeChildrenDIE(Scope, Children);
536 // We create children here when we know the scope DIE is not going to be
537 // null and the children will be added to the scope DIE.
538 createScopeChildrenDIE(Scope, Children, &HasNonScopeChildren);
540 // If there are only other scopes as children, put them directly in the
544 std::make_move_iterator(Children.begin())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 245 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
246 if (ChildNum < Children.size()) {
247 auto &ChildScope = Children[ChildNum];
341 if (!Children.empty())
342 err << std::string(Indent + 2, ' ') << "Children ...\n";
343 for (unsigned i = 0, e = Children.size(); i != e; ++i)
344 if (Children[i] != this)
345 Children[i]->dump(Indent + 2);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| 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.
|
| DIE.h | 86 /// Whether or not this node has children.
89 /// are 0 and 1 for no children and children respectively.
90 bool Children;
96 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C) {}
102 bool hasChildren() const { return Children; }
104 void setChildrenFlag(bool hasChild) { Children = hasChild; }
745 /// Size of instance + children.
751 /// children even when it doesn't. This is used for unit testing purposes.
753 /// Children DIEs
787 child_range children() { function in class:llvm::DIE
790 const_child_range children() const { function in class:llvm::DIE
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/ |
| UDTLayout.cpp | 108 // UDT storage comes from a union of all the children's storage, so start out
175 auto Children = Sym.findAllChildren();
176 while (auto Child = Children->getNext()) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| MachOYAML.h | 113 std::vector<MachOYAML::ExportEntry> Children;
|
| DWARFYAML.h | 39 llvm::dwarf::Constants Children;
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchTree.h | 127 /// children but this currently isn't done to aid debuggability of the DOT
130 /// The children of this node. The index into this array must match the index
132 std::vector<GIMatchTree> Children;
140 void setNumChildren(unsigned Num) { Children.resize(Num); }
157 return Children.begin();
159 std::vector<GIMatchTree>::iterator children_end() { return Children.end(); }
160 iterator_range<std::vector<GIMatchTree>::iterator> children() { function in class:llvm::GIMatchTree
164 return Children.begin();
167 return Children.end();
169 iterator_range<std::vector<GIMatchTree>::const_iterator> children() const function in class:llvm::GIMatchTree
[all...] |
