Searched refs:Children (Results 1 - 25 of 38) sorted by relevance

12

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DAntlrRuntime_BaseTreeDebugView.cs47 public ITree[] Children property in class: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);
H A DBaseTree.cs73 public virtual IList<ITree> Children property in class:Antlr.Runtime.Tree.BaseTree
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count )
177 return Children[i];
182 foreach ( ITree child in Children )
211 if ( childTree != null && this.Children != null && this.Children == childTree.Children )
[all...]
H A DCommonTree.cs94 return Children[0].CharPositionInLine;
135 return Children[0].Line;
253 if ( Children == null )
261 foreach (ITree childTree in Children)
273 if ( Children.Count > 0 )
275 ITree firstChild = Children[0];
276 ITree lastChild = Children[Children.Count - 1];
H A DParseTree.cs160 for ( int i = 0; Children != null && i < Children.Count; i++ )
162 ParseTree t = (ParseTree)Children[i];
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DCommonTree.cs87 return Children[0].CharPositionInLine;
114 return Children[0].Line;
195 if (Children == null) {
201 for (int i = 0; i < Children.Count; i++) {
202 ((CommonTree)Children[i]).SetUnknownTokenBoundaries();
206 if (Children.Count > 0) {
207 CommonTree firstChild = (CommonTree)Children[0];
208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1];
H A DParseTree.cs135 for (int i = 0; Children != null && i < Children.Count; i++) {
136 ParseTree t = (ParseTree)Children[i];
H A DBaseTree.cs68 public virtual IList<ITree> Children { property in class:Antlr.Runtime.Tree.BaseTree
78 if (Children == null)
81 return Children.Count;
/external/llvm/include/llvm/ADT/
H A DTrie.h64 NodeVectorType Children; member in class:llvm::Trie::Node
71 if (Children.empty())
72 Children.push_back(N);
74 iterator I = std::lower_bound(Children.begin(), Children.end(),
77 Children.insert(I, N);
83 iterator I = std::lower_bound(Children.begin(), Children.end(),
85 assert(I != Children.end() && "Node does not exists!");
124 << "Children
[all...]
/external/clang/lib/Rewrite/
H A DDeltaTree.cpp125 DeltaTreeNode *Children[2*WidthFactor];
128 Children[i]->Destroy();
136 Children[0] = IR.LHS;
137 Children[1] = IR.RHS;
145 return Children[i];
149 return Children[i];
230 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes))
240 memmove(&IN->Children[i+2], &IN->Children[i+1],
241 (e-i)*sizeof(IN->Children[
[all...]
H A DRewriteRope.cpp396 /// Children array.
398 RopePieceBTreeNode *Children[2*WidthFactor];
404 Children[0] = LHS;
405 Children[1] = RHS;
412 Children[i]->Destroy();
420 return Children[i];
424 return Children[i];
534 memmove(&Children[i+2], &Children[i+1],
535 (getNumChildren()-i-1)*sizeof(Children[
[all...]
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp166 /// Children - Set of nodes which are children of this one and that haven't
168 NodeSubset Children;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
177 Children(other.Children) {}
182 other.Children == this->Children;
192 if (Children.count(i)) {
194 Children.DeleteNode(i);
212 if (Children
[all...]
/external/llvm/lib/CodeGen/
H A DLexicalScopes.cpp221 const SmallVector<LexicalScope *, 4> &Children = WS->getChildren(); local
223 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children.begin(),
224 SE = Children.end(); SI != SE; ++SI) {
328 if (!Children.empty())
329 err << "Children ...\n";
330 for (unsigned i = 0, e = Children.size(); i != e; ++i)
331 if (Children[i] != this)
332 Children[i]->dump();
/external/llvm/include/llvm/CodeGen/
H A DLexicalScopes.h174 SmallVector<LexicalScope *, 4> &getChildren() { return Children; }
178 void addChild(LexicalScope *S) { Children.push_back(S); }
236 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in class:llvm::LexicalScope
H A DScheduleDAGInstrs.h90 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local
92 Children.begin(), E = Children.end(); I != E; ++I) {
/external/llvm/include/llvm/Analysis/
H A DDominators.h67 std::vector<DomTreeNodeBase<NodeT> *> Children; member in class:llvm::DomTreeNodeBase
77 iterator begin() { return Children.begin(); }
78 iterator end() { return Children.end(); }
79 const_iterator begin() const { return Children.begin(); }
80 const_iterator end() const { return Children.end(); }
85 return Children;
92 Children.push_back(C);
97 return Children.size();
101 Children.clear();
126 std::find(IDom->Children
[all...]
/external/llvm/utils/TableGen/
H A DDAGISelMatcher.h189 SmallVector<Matcher*, 4> Children; member in class:llvm::ScopeMatcher
192 : Matcher(Scope), Children(children, children+numchildren) {
196 unsigned getNumChildren() const { return Children.size(); }
198 Matcher *getChild(unsigned i) { return Children[i]; }
199 const Matcher *getChild(unsigned i) const { return Children[i]; }
202 delete Children[i];
203 Children[i] = N;
207 Matcher *Res = Children[i];
208 Children[i] = 0;
213 if (NC < Children
[all...]
H A DCodeGenDAGPatterns.h324 std::vector<TreePatternNode*> Children;
328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
365 unsigned getNumChildren() const { return Children.size(); }
366 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
368 Children[i] = N;
373 for (unsigned i = 0, e = Children.size(); i != e; ++i)
374 if (Children[i] == N) return true;
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/
H A Dplugin.properties19 descriptionSWTComposite=Children
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDIE.cpp111 for (unsigned i = 0, N = Children.size(); i < N; ++i)
112 delete Children[i];
155 for (unsigned j = 0, M = Children.size(); j < M; ++j) {
156 Children[j]->print(O, 4);
H A DDIE.h128 /// Children DIEs.
130 std::vector<DIE *> Children; member in class:llvm::DIE
152 const std::vector<DIE *> &getChildren() const { return Children; }
174 Children.push_back(Child);
H A DDwarfDebug.cpp463 SmallVector<DIE *, 8> Children;
471 Children.push_back(Arg);
478 Children.push_back(Variable);
482 Children.push_back(Nested);
500 if (Children.empty())
508 for (SmallVector<DIE *, 8>::iterator I = Children.begin(),
509 E = Children.end(); I != E; ++I)
1169 const SmallVector<LexicalScope *, 4> &Children = S->getChildren(); local
1170 if (!Children.empty())
1171 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children
1503 const std::vector<DIE *> &Children = Die->getChildren(); local
1662 const std::vector<DIE *> &Children = Die->getChildren(); local
[all...]
/external/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp172 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
173 for (SmallVector<DomTreeNode*, 8>::iterator DI = Children.begin(),
174 DE = Children.end(); DI != DE; ++DI)
302 std::vector<DomTreeNode *> Children; local
305 Children.push_back(*I);
308 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
309 E = Children.end(); I != E; ++I)
/external/llvm/lib/Transforms/Scalar/
H A DLICM.cpp292 const std::vector<DomTreeNode*> &Children = N->getChildren(); local
293 for (unsigned i = 0, e = Children.size(); i != e; ++i)
294 SinkRegion(Children[i]);
365 const std::vector<DomTreeNode*> &Children = N->getChildren(); local
366 for (unsigned i = 0, e = Children.size(); i != e; ++i)
367 HoistRegion(Children[i]);
/external/webkit/Source/WebCore/dom/
H A DTreeWalker.cpp255 Children:
274 goto Children;
/external/clang/include/clang/AST/
H A DStmt.h1611 Stmt *Children[2]; member in class:clang::SEHExceptStmt
1636 return reinterpret_cast<Expr*>(Children[FILTER_EXPR]);
1640 return llvm::cast<CompoundStmt>(Children[BLOCK]);
1644 return child_range(Children,Children+2);
1695 Stmt *Children[2]; member in class:clang::SEHTryStmt
1720 SourceLocation getEndLoc() const { return Children[HANDLER]->getLocEnd(); }
1725 return llvm::cast<CompoundStmt>(Children[TRY]);
1728 Stmt *getHandler() const { return Children[HANDLER]; }
1735 return child_range(Children,Childre
[all...]

Completed in 3881 milliseconds

12