| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | BaseTree.cs | 73 public virtual IList<ITree> Children property in Antlr.Runtime.Tree.BaseTree
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count ) in GetChild()
177 return Children[i]; in GetChild()
182 foreach ( ITree child in Children ) in GetFirstChildWithType()
211 … if ( childTree != null && this.Children != null && this.Children == childTree.Children ) in AddChild()
218 if ( this.Children != null || childTree == null ) in AddChild()
220 if ( this.Children == null ) in AddChild()
221 this.Children = CreateChildrenList(); in AddChild()
[all …]
|
| D | CommonTree.cs | 94 return Children[0].CharPositionInLine;
135 return Children[0].Line;
253 if ( Children == null ) in SetUnknownTokenBoundaries()
261 foreach (ITree childTree in Children) in SetUnknownTokenBoundaries()
273 if ( Children.Count > 0 ) in SetUnknownTokenBoundaries()
275 ITree firstChild = Children[0]; in SetUnknownTokenBoundaries()
276 ITree lastChild = Children[Children.Count - 1]; in SetUnknownTokenBoundaries()
|
| D | AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children property in Antlr.Runtime.Tree.AntlrRuntime_BaseTreeDebugView
51 if (_tree == null || _tree.Children == null)
54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
|
| D | ParseTree.cs | 160 for ( int i = 0; Children != null && i < Children.Count; i++ ) in ToStringLeaves()
162 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | Trie.h | 64 NodeVectorType Children; variable
71 if (Children.empty()) in addEdge()
72 Children.push_back(N); in addEdge()
74 iterator I = std::lower_bound(Children.begin(), Children.end(), in addEdge()
77 Children.insert(I, N); in addEdge()
83 iterator I = std::lower_bound(Children.begin(), Children.end(), in setEdge()
85 assert(I != Children.end() && "Node does not exists!"); in setEdge()
126 for (iterator I = Children.begin(), E = Children.end(); I != E; ++I) in dump()
133 iterator I = std::lower_bound(Children.begin(), Children.end(), in getEdge()
135 if (I != Children.end() && (*I)->Label[0] == Id) in getEdge()
[all …]
|
| /external/clang/lib/Rewrite/ |
| D | DeltaTree.cpp | 123 DeltaTreeNode *Children[2*WidthFactor]; member in __anonb8815fa70311::DeltaTreeInteriorNode
126 Children[i]->Destroy(); in ~DeltaTreeInteriorNode()
134 Children[0] = IR.LHS; in DeltaTreeInteriorNode()
135 Children[1] = IR.RHS; in DeltaTreeInteriorNode()
143 return Children[i]; in getChild()
147 return Children[i]; in getChild()
227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion()
237 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion()
238 (e-i)*sizeof(IN->Children[0])); in DoInsertion()
239 IN->Children[i] = InsertRes->LHS; in DoInsertion()
[all …]
|
| D | RewriteRope.cpp | 397 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anona82c88c50411::RopePieceBTreeInterior
403 Children[0] = LHS; in RopePieceBTreeInterior()
404 Children[1] = RHS; in RopePieceBTreeInterior()
411 Children[i]->Destroy(); in ~RopePieceBTreeInterior()
419 return Children[i]; in getChild()
423 return Children[i]; in getChild()
532 memmove(&Children[i+2], &Children[i+1], in HandleChildPiece()
533 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece()
534 Children[i+1] = RHS; in HandleChildPiece()
546 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
[all …]
|
| /external/clang/lib/Tooling/ |
| D | FileMatchTrie.cpp | 64 if (Children.empty()) { in insert()
71 Children[Element].Path = Path; in insert()
75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert()
103 if (Children.empty()) { in findEquivalent()
111 Children.find(Element); in findEquivalent()
112 if (MatchingChild != Children.end()) { in findEquivalent()
141 if (Children.empty()) { in getAll()
146 It = Children.begin(), E = Children.end(); in getAll()
150 It->getValue().getAll(Results, Children.end()); in getAll()
159 llvm::StringMap<FileMatchTrieNode> Children; member in clang::tooling::FileMatchTrieNode
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | CommonTree.cs | 87 return Children[0].CharPositionInLine;
114 return Children[0].Line;
195 if (Children == null) { in SetUnknownTokenBoundaries()
201 for (int i = 0; i < Children.Count; i++) { in SetUnknownTokenBoundaries()
202 ((CommonTree)Children[i]).SetUnknownTokenBoundaries(); in SetUnknownTokenBoundaries()
206 if (Children.Count > 0) { in SetUnknownTokenBoundaries()
207 CommonTree firstChild = (CommonTree)Children[0]; in SetUnknownTokenBoundaries()
208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1]; in SetUnknownTokenBoundaries()
|
| D | ParseTree.cs | 135 for (int i = 0; Children != null && i < Children.Count; i++) { in ToStringLeaves()
136 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
|
| /external/clang/lib/Format/ |
| D | TokenAnnotator.h | 61 Current->Children.clear(); in AnnotatedLine()
62 for (const auto &Child : Node.Children) { in AnnotatedLine()
63 Children.push_back(new AnnotatedLine(Child)); in AnnotatedLine()
64 Current->Children.push_back(Children.back()); in AnnotatedLine()
72 for (unsigned i = 0, e = Children.size(); i != e; ++i) { in ~AnnotatedLine()
73 delete Children[i]; in ~AnnotatedLine() local
77 Current->Children.clear(); in ~AnnotatedLine()
109 SmallVector<AnnotatedLine *, 0> Children; variable
|
| D | AffectedRangeManager.cpp | 96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end()); in markAllAsAffected()
105 computeAffectedLines(Line->Children.begin(), Line->Children.end()); in nonPPLineAffected()
125 if (!Tok->Children.empty() && Tok->Children.front()->Affected) in nonPPLineAffected()
128 IncludeLeadingNewlines = Tok->Children.empty(); in nonPPLineAffected()
|
| D | UnwrappedLineFormatter.cpp | 456 for (AnnotatedLine *Child : Tok->Children) in markFinalized()
514 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0) in formatChildren()
521 Previous.Children[0]->Level * Style.IndentWidth; in formatChildren()
524 BlockFormatter->format(Previous.Children, DryRun, AdditionalIndent, in formatChildren()
529 if (Previous.Children[0]->First->MustBreakBefore) in formatChildren()
533 if (Previous.Children.size() > 1) in formatChildren()
541 if (Previous.Children[0]->Last->isTrailingComment()) in formatChildren()
547 Previous.Children[0]->Last->TotalLength + State.Column + 2 > in formatChildren()
553 *Previous.Children[0]->First, in formatChildren()
557 Penalty += formatLine(*Previous.Children[0], State.Column + 1, DryRun); in formatChildren()
[all …]
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 168 NodeSubset Children; member in llvm::Graph::ChildIterator
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
177 Children(other.Children) {} in ChildIterator()
182 other.Children == this->Children; in operator ==()
192 if (Children.count(i)) { in operator ++()
194 Children.DeleteNode(i); in operator ++()
212 if (Children.count(i)) in operator *()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 166 NodeSubset Children; member in llvm::Graph::ChildIterator
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
175 Children(other.Children) {} in ChildIterator()
180 other.Children == this->Children; in operator ==()
190 if (Children.count(i)) { in operator ++()
192 Children.DeleteNode(i); in operator ++()
210 if (Children.count(i)) in operator *()
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children; variable
83 iterator begin() { return Children.begin(); } in begin()
84 iterator end() { return Children.end(); } in end()
85 const_iterator begin() const { return Children.begin(); } in begin()
86 const_iterator end() const { return Children.end(); } in end()
91 return Children; in getChildren()
99 Children.push_back(C.get()); in addChild()
103 size_t getNumChildren() const { return Children.size(); } in getNumChildren()
105 void clearAllChildren() { Children.clear(); } in clearAllChildren()
129 std::find(IDom->Children.begin(), IDom->Children.end(), this); in setIDom()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | Dominators.h | 67 std::vector<DomTreeNodeBase<NodeT> *> Children; variable
77 iterator begin() { return Children.begin(); } in begin()
78 iterator end() { return Children.end(); } in end()
79 const_iterator begin() const { return Children.begin(); } in begin()
80 const_iterator end() const { return Children.end(); } in end()
85 return Children; in getChildren()
92 Children.push_back(C); in addChild()
97 return Children.size(); in getNumChildren()
101 Children.clear(); in clearAllChildren()
126 std::find(IDom->Children.begin(), IDom->Children.end(), this); in setIDom()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | LexicalScopes.cpp | 221 const SmallVector<LexicalScope *, 4> &Children = WS->getChildren(); in constructScopeNest() local
223 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children.begin(), in constructScopeNest()
224 SE = Children.end(); SI != SE; ++SI) { in constructScopeNest()
326 if (!Children.empty()) in dump()
328 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
329 if (Children[i] != this) in dump()
330 Children[i]->dump(); in dump()
|
| /external/llvm/lib/CodeGen/ |
| D | LexicalScopes.cpp | 223 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
225 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), in constructScopeNest()
226 SE = Children.end(); in constructScopeNest()
326 if (!Children.empty()) in dump()
328 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
329 if (Children[i] != this) in dump()
330 Children[i]->dump(Indent + 2); in dump()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | DIE.h | 71 bool Children; variable
78 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {} in DIEAbbrev()
83 bool hasChildren() const { return Children; } in hasChildren()
85 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag()
609 IntrusiveBackList<DIE> Children; variable
626 bool hasChildren() const { return !Children.empty(); } in hasChildren()
634 return llvm::make_range(Children.begin(), Children.end()); in children()
637 return llvm::make_range(Children.begin(), Children.end()); in children()
664 Children.push_back(*Child); in addChild()
665 return Children.back(); in addChild()
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfCompileUnit.cpp | 333 SmallVector<DIE *, 8> Children; in constructScopeDIE() local
344 createScopeChildrenDIE(Scope, Children); in constructScopeDIE()
354 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); in constructScopeDIE()
360 Children.push_back( in constructScopeDIE()
366 if (Children.size() == ChildScopeCount) { in constructScopeDIE()
368 std::make_move_iterator(Children.begin()), in constructScopeDIE()
369 std::make_move_iterator(Children.end())); in constructScopeDIE()
377 for (auto &I : Children) in constructScopeDIE()
573 SmallVectorImpl<DIE *> &Children, in createScopeChildrenDIE() argument
578 Children.push_back(constructVariableDIE(*DV, *Scope, ObjectPointer)); in createScopeChildrenDIE()
[all …]
|
| D | DebugHandlerBase.cpp | 37 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren(); in identifyScopeMarkers() local
38 if (!Children.empty()) in identifyScopeMarkers()
39 WorkList.append(Children.begin(), Children.end()); in identifyScopeMarkers()
|
| /external/guice/lib/build/ |
| D | safesax.jar | META-INF/MANIFEST.MF
safesax/
safesax/BadXmlException.class
BadXmlException.java
package safesax
... |
| /external/llvm/utils/TableGen/ |
| D | DAGISelMatcher.h | 179 SmallVector<Matcher*, 4> Children; variable
182 : Matcher(Scope), Children(children.begin(), children.end()) { in ScopeMatcher()
186 unsigned getNumChildren() const { return Children.size(); } in getNumChildren()
188 Matcher *getChild(unsigned i) { return Children[i]; } in getChild()
189 const Matcher *getChild(unsigned i) const { return Children[i]; } in getChild()
192 delete Children[i]; in resetChild() local
193 Children[i] = N; in resetChild()
197 Matcher *Res = Children[i]; in takeChild()
198 Children[i] = nullptr; in takeChild()
203 if (NC < Children.size()) { in setNumChildren()
[all …]
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | DAGISelMatcher.h | 188 SmallVector<Matcher*, 4> Children; variable
191 : Matcher(Scope), Children(children, children+numchildren) { in ScopeMatcher()
195 unsigned getNumChildren() const { return Children.size(); } in getNumChildren()
197 Matcher *getChild(unsigned i) { return Children[i]; } in getChild()
198 const Matcher *getChild(unsigned i) const { return Children[i]; } in getChild()
201 delete Children[i]; in resetChild() local
202 Children[i] = N; in resetChild()
206 Matcher *Res = Children[i]; in takeChild()
207 Children[i] = 0; in takeChild()
212 if (NC < Children.size()) { in setNumChildren()
[all …]
|