| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children
51 if (_tree == null || _tree.Children == null)
54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
56 return children;
|
| BaseTree.cs | 42 * actually have any user data. ANTLR v3 uses a list of children approach
44 * an empty node whose children represent the list. An empty, but
60 * as there are no fields other than the children list, which cannot
61 * be copied as the children are not considered part of this node.
69 * Get the children internal List; note that if you directly mess with
73 public virtual IList<ITree> Children
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 20 * Contains element children. Using this class instead of HashMap results in
23 class Children {
25 Child[] children = new Child[16]; field in class:Children
34 Child current = children[index];
36 // We have no children in this bucket yet.
38 children[index] = current;
69 Child current = children[index];
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| BaseTree.cs | 41 * actually have any user data. ANTLR v3 uses a list of children approach
43 * an empty node whose children represent the list. An empty, but
49 List<ITree> children; field in class:Antlr.Runtime.Tree.BaseTree
56 * as there are no fields other than the children list, which cannot
57 * be copied as the children are not considered part of this node.
64 * Get the children internal List; note that if you directly mess with
68 public virtual IList<ITree> Children {
70 return children;
78 if (Children == null)
81 return Children.Count
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| LexicalScopes.h | 174 SmallVector<LexicalScope *, 4> &getChildren() { return Children; }
178 void addChild(LexicalScope *S) { Children.push_back(S); }
236 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| ScheduleDAGInstrs.h | 90 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
92 Children.begin(), E = Children.end(); I != E; ++I) {
|
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 221 const SmallVector<LexicalScope *, 4> &Children = WS->getChildren();
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();
|
| MachineCSE.cpp | 536 /// dominator tree node if its a leaf or all of its children are done. Walk
571 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
572 unsigned NumChildren = Children.size();
575 MachineDomTreeNode *Child = Children[i];
|
| LiveDebugVariables.cpp | 536 const std::vector<MachineDomTreeNode*> &Children =
538 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
539 MachineBasicBlock *MBB = Children[i]->getBlock();
[all...] |
| MachineLICM.cpp | 228 /// dominator tree node if its a leaf or all of its children are done. Walk
663 /// dominator tree node if its a leaf or all of its children are done. Walk
714 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
715 unsigned NumChildren = Children.size();
724 // Add children in reverse order as then the next popped worklist node is
728 MachineDomTreeNode *Child = Children[i];
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 172 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;
305 Children.push_back(*I);
308 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
309 E = Children.end(); I != E; ++I)
|
| CodeExtractor.cpp | 192 SmallVector<DomTreeNode*, 8> Children;
195 Children.push_back(*DI);
199 for (SmallVector<DomTreeNode*, 8>::iterator I = Children.begin(),
200 E = Children.end(); I != E; ++I)
|
| LoopSimplify.cpp | 342 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
344 while (!Children.empty()) {
345 DomTreeNode *Child = Children.front();
613 // Scan all of the loop children of L, moving them to OuterLoop if they are
|
| /external/llvm/include/llvm/ADT/ |
| Trie.h | 64 NodeVectorType Children;
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:\n"
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.h | 59 /// ChildrenFlag - Dwarf children flag.
120 /// Size - Size of instance + children.
128 /// Children DIEs.
130 std::vector<DIE *> Children;
152 const std::vector<DIE *> &getChildren() const { return Children; }
174 Children.push_back(Child);
|
| DwarfDebug.cpp | 463 SmallVector<DIE *, 8> Children;
471 Children.push_back(Arg);
473 // Collect lexical scope children first.
478 Children.push_back(Variable);
482 Children.push_back(Nested);
500 if (Children.empty())
507 // Add children
508 for (SmallVector<DIE *, 8>::iterator I = Children.begin(),
509 E = Children.end(); I != E; ++I)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 291 // We are processing blocks in reverse dfo, so process children first.
292 const std::vector<DomTreeNode*> &Children = N->getChildren();
293 for (unsigned i = 0, e = Children.size(); i != e; ++i)
294 SinkRegion(Children[i]);
365 const std::vector<DomTreeNode*> &Children = N->getChildren();
366 for (unsigned i = 0, e = Children.size(); i != e; ++i)
367 HoistRegion(Children[i]);
|
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 67 std::vector<DomTreeNodeBase<NodeT> *> Children;
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.begin(), IDom->Children.end(), this)
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 121 /// operates on the node or its children without potential side effects or a
185 /// ScopeMatcher - This attempts to match each of its children to find the first
187 /// If none of the children match then this check fails. It never has a 'next'.
189 SmallVector<Matcher*, 4> Children;
191 ScopeMatcher(Matcher *const *children, unsigned numchildren)
192 : Matcher(Scope), Children(children, children+numchildren) {
196 unsigned getNumChildren() const { return Children.size(); }
198 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| CodeGenDAGPatterns.cpp | 715 // Count children in the count if they are also nodes.
[all...] |
| /external/clang/include/clang/AST/ |
| Stmt.h | 47 // references to children (to be compatible with StmtIterator).
409 /// Child Iterators: All subclasses must implement 'children'
418 child_range children();
419 const_child_range children() const { function in class:clang::Stmt
420 return const_cast<Stmt*>(this)->children();
423 child_iterator child_begin() { return children().first; }
424 child_iterator child_end() { return children().second; }
426 const_child_iterator child_begin() const { return children().first; }
427 const_child_iterator child_end() const { return children().second; }
490 child_range children() { function in class:clang::DeclStmt
536 child_range children() { return child_range(); } function in class:clang::NullStmt
624 child_range children() { function in class:clang::CompoundStmt
628 const_child_range children() const { function in class:clang::CompoundStmt
723 child_range children() { function in class:clang::CaseStmt
758 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::DefaultStmt
789 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::LabelStmt
830 child_range children() { return child_range(&SubStmt, &SubStmt + 1); } function in class:clang::AttributedStmt
897 child_range children() { function in class:clang::IfStmt
991 child_range children() { function in class:clang::SwitchStmt
1051 child_range children() { function in class:clang::WhileStmt
1100 child_range children() { function in class:clang::DoStmt
1172 child_range children() { function in class:clang::ForStmt
1207 child_range children() { return child_range(); } function in class:clang::GotoStmt
1252 child_range children() { return child_range(&Target, &Target+1); } function in class:clang::IndirectGotoStmt
1279 child_range children() { return child_range(); } function in class:clang::ContinueStmt
1303 child_range children() { return child_range(); } function in class:clang::BreakStmt
1355 child_range children() { function in class:clang::ReturnStmt
1604 child_range children() { function in class:clang::AsmStmt
1643 child_range children() { function in class:clang::SEHExceptStmt
1680 child_range children() { function in class:clang::SEHFinallyStmt
1734 child_range children() { function in class:clang::SEHTryStmt
[all...] |
