Home
last modified time | relevance | path

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

123

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs73 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 …]
DCommonTree.cs94 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()
DAntlrRuntime_BaseTreeDebugView.cs47 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);
DParseTree.cs160 for ( int i = 0; Children != null && i < Children.Count; i++ ) in ToStringLeaves()
162 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
/external/clang/lib/Rewrite/
DDeltaTree.cpp123 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 …]
DRewriteRope.cpp395 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anona82c88c50411::RopePieceBTreeInterior
401 Children[0] = LHS; in RopePieceBTreeInterior()
402 Children[1] = RHS; in RopePieceBTreeInterior()
409 Children[i]->Destroy(); in ~RopePieceBTreeInterior()
417 return Children[i]; in getChild()
421 return Children[i]; in getChild()
530 memmove(&Children[i+2], &Children[i+1], in HandleChildPiece()
531 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece()
532 Children[i+1] = RHS; in HandleChildPiece()
544 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
[all …]
/external/clang/lib/Tooling/
DFileMatchTrie.cpp64 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/
DCommonTree.cs87 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()
DParseTree.cs135 for (int i = 0; Children != null && i < Children.Count; i++) { in ToStringLeaves()
136 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
DBaseTree.cs68 public virtual IList<ITree> Children { property in Antlr.Runtime.Tree.BaseTree
78 if (Children == null)
81 return Children.Count;
/external/clang/lib/Format/
DTokenAnnotator.h61 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()
86 SmallVector<AnnotatedLine *, 0> Children; variable
DUnwrappedLineFormatter.cpp329 for (AnnotatedLine *Child : Tok->Children) in markFinalized()
440 format(TheLine.Children, DryRun); in format()
677 Previous.Children.size() == 0) in formatChildren()
684 Previous.Children[0]->Level * Style.IndentWidth; in formatChildren()
686 Penalty += format(Previous.Children, DryRun, AdditionalIndent, in formatChildren()
691 if (Previous.Children[0]->First->MustBreakBefore) in formatChildren()
695 if (Previous.Children.size() > 1) in formatChildren()
703 if (Previous.Children[0]->Last->isTrailingComment()) in formatChildren()
709 Previous.Children[0]->Last->TotalLength + State.Column + 2 > in formatChildren()
715 *Previous.Children[0]->First, in formatChildren()
[all …]
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp166 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/
DGenericDomTree.h72 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/llvm/lib/CodeGen/
DLexicalScopes.cpp224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
226 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), in constructScopeNest()
227 SE = Children.end(); in constructScopeNest()
327 if (!Children.empty()) in dump()
329 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
330 if (Children[i] != this) in dump()
331 Children[i]->dump(Indent + 2); in dump()
/external/llvm/lib/CodeGen/AsmPrinter/
DDwarfCompileUnit.cpp315 SmallVector<std::unique_ptr<DIE>, 8> Children; in constructScopeDIE() local
326 createScopeChildrenDIE(Scope, Children); in constructScopeDIE()
336 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); in constructScopeDIE()
342 Children.push_back( in constructScopeDIE()
348 if (Children.size() == ChildScopeCount) { in constructScopeDIE()
350 std::make_move_iterator(Children.begin()), in constructScopeDIE()
351 std::make_move_iterator(Children.end())); in constructScopeDIE()
359 for (auto &I : Children) in constructScopeDIE()
543 LexicalScope *Scope, SmallVectorImpl<std::unique_ptr<DIE>> &Children, in createScopeChildrenDIE() argument
548 Children.push_back(constructVariableDIE(*DV, *Scope, ObjectPointer)); in createScopeChildrenDIE()
[all …]
DDwarfFile.cpp106 const auto &Children = Die.getChildren(); in computeSizeAndOffset() local
109 if (!Children.empty()) { in computeSizeAndOffset()
112 for (auto &Child : Children) in computeSizeAndOffset()
DDIE.cpp55 ID.AddInteger(unsigned(Children)); in Profile()
69 AP->EmitULEB128((unsigned)Children, dwarf::ChildrenString(Children)); in Emit()
96 << dwarf::ChildrenString(Children) in print()
182 for (unsigned j = 0, M = Children.size(); j < M; ++j) { in print()
183 Children[j]->print(O, IndentCount+4); in print()
/external/llvm/include/llvm/CodeGen/
DDIE.h69 bool Children; variable
76 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {} in DIEAbbrev()
81 bool hasChildren() const { return Children; } in hasChildren()
83 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag()
133 std::vector<std::unique_ptr<DIE>> Children; variable
159 return Children; in getChildren()
185 Children.push_back(std::move(Child)); in addChild()
DLexicalScopes.h64 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } in getChildren()
68 void addChild(LexicalScope *S) { Children.push_back(S); } in addChild()
126 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. variable
/external/llvm/utils/TableGen/
DDAGISelMatcher.h192 SmallVector<Matcher*, 4> Children; variable
195 : Matcher(Scope), Children(children.begin(), children.end()) { in ScopeMatcher()
199 unsigned getNumChildren() const { return Children.size(); } in getNumChildren()
201 Matcher *getChild(unsigned i) { return Children[i]; } in getChild()
202 const Matcher *getChild(unsigned i) const { return Children[i]; } in getChild()
205 delete Children[i]; in resetChild() local
206 Children[i] = N; in resetChild()
210 Matcher *Res = Children[i]; in takeChild()
211 Children[i] = nullptr; in takeChild()
216 if (NC < Children.size()) { in setNumChildren()
[all …]
DCodeGenDAGPatterns.h342 std::vector<TreePatternNode*> Children; variable
346 : Operator(Op), Val(nullptr), TransformFn(nullptr), Children(Ch) { in TreePatternNode()
384 unsigned getNumChildren() const { return Children.size(); } in getNumChildren()
385 TreePatternNode *getChild(unsigned N) const { return Children[N]; } in getChild()
387 Children[i] = N; in setChild()
392 for (unsigned i = 0, e = Children.size(); i != e; ++i) in hasChild()
393 if (Children[i] == N) return true; in hasChild()
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp168 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end()); in MergeBlockIntoPredecessor() local
169 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(), in MergeBlockIntoPredecessor()
170 DE = Children.end(); in MergeBlockIntoPredecessor()
296 std::vector<DomTreeNode *> Children; in SplitBlock() local
299 Children.push_back(*I); in SplitBlock()
302 for (std::vector<DomTreeNode *>::iterator I = Children.begin(), in SplitBlock()
303 E = Children.end(); I != E; ++I) in SplitBlock()
722 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen() local
725 for (auto Child : Children) in SplitBlockAndInsertIfThen()
/external/llvm/tools/llvm-pdbdump/
DClassDefinitionDumper.cpp61 auto Children = Class.findAllChildren(); in start() local
62 if (Children->getChildCount() == 0) { in start()
79 while (auto Child = Children->getNext()) { in start()
/external/llvm/lib/Target/Mips/
DMipsOptimizePICCall.cpp201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); in runOnMachineFunction() local
202 WorkList.append(Children.begin(), Children.end()); in runOnMachineFunction()

123