| /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/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 45 /// - If the node has a path 'p2' but no children, take the last path segment
62 if (Children.empty()) {
69 Children[Element].Path = Path;
73 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
87 /// - .. have children. In this case it is checked
91 /// - .. a child matching the next path segment. In this case, all children of
92 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
101 if (Children.empty()) {
109 Children.find(Element);
110 if (MatchingChild != Children.end())
[all...] |
| /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 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; }
178 void addChild(LexicalScope *S) { Children.push_back(S); }
236 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 221 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
223 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(),
224 SE = Children.end(); SI != SE; ++SI) {
328 if (!Children.empty())
329 err << std::string(Indent + 2, ' ') << "Children ...\n";
330 for (unsigned i = 0, e = Children.size(); i != e; ++i)
331 if (Children[i] != this)
332 Children[i]->dump(Indent + 2);
|
| MachineCSE.cpp | 598 /// dominator tree node if its a leaf or all of its children are done. Walk
631 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
632 unsigned NumChildren = Children.size();
635 MachineDomTreeNode *Child = Children[i];
|
| LiveDebugVariables.cpp | 545 const std::vector<MachineDomTreeNode*> &Children =
547 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
548 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/CodeGen/AsmPrinter/ |
| DIE.h | 61 /// ChildrenFlag - Dwarf children flag.
116 /// Size - Size of instance + children.
124 /// Children DIEs.
126 std::vector<DIE *> Children;
149 const std::vector<DIE *> &getChildren() const { return Children; }
174 Children.push_back(Child);
|
| DwarfDebug.cpp | 365 // If we're updating an abstract DIE, then we will be adding the children and
577 SmallVector<DIE *, 8> Children;
586 Children.push_back(Arg);
590 // Collect lexical scope children first.
595 Children.push_back(Variable);
601 Children.push_back(Nested);
623 if (Children.empty() && Range.first == Range.second)
633 // Add children
634 for (SmallVectorImpl<DIE *>::iterator I = Children.begin(),
635 E = Children.end(); I != E; ++I
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 311 // We are processing blocks in reverse dfo, so process children first.
312 const std::vector<DomTreeNode*> &Children = N->getChildren();
313 for (unsigned i = 0, e = Children.size(); i != e; ++i)
314 SinkRegion(Children[i]);
385 const std::vector<DomTreeNode*> &Children = N->getChildren();
386 for (unsigned i = 0, e = Children.size(); i != e; ++i)
387 HoistRegion(Children[i]);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 173 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
174 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(),
175 DE = Children.end(); DI != DE; ++DI)
287 std::vector<DomTreeNode *> Children;
290 Children.push_back(*I);
293 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
294 E = Children.end(); I != E; ++I)
|
| CodeExtractor.cpp | 273 SmallVector<DomTreeNode*, 8> Children;
276 Children.push_back(*DI);
280 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(),
281 E = Children.end(); I != E; ++I)
|
| LoopSimplify.cpp | 350 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
352 while (!Children.empty()) {
353 DomTreeNode *Child = Children.front();
621 // Scan all of the loop children of L, moving them to OuterLoop if they are
|
| /external/chromium_org/tools/gyp/pylib/gyp/ |
| xcodeproj_file.py | 34 children of this property. The objects dictionary is keyed by unique 96-bit
445 for child in self.Children():
475 def Children(self):
476 """Returns a list of all of this object's owned (strong) children."""
478 children = []
483 children.append(self._properties[property])
485 children.extend(self._properties[property])
486 return children
493 children = self.Children()
[all...] |
| /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 | 119 /// operates on the node or its children without potential side effects or a
183 /// ScopeMatcher - This attempts to match each of its children to find the first
185 /// If none of the children match then this check fails. It never has a 'next'.
187 SmallVector<Matcher*, 4> Children;
189 ScopeMatcher(Matcher *const *children, unsigned numchildren)
190 : Matcher(Scope), Children(children, children+numchildren) {
194 unsigned getNumChildren() const { return Children.size(); }
196 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| CodeGenDAGPatterns.cpp | 749 // Count children in the count if they are also nodes.
[all...] |
| /external/clang/include/clang/AST/ |
| Stmt.h | 55 // references to children (to be compatible with StmtIterator).
400 /// Child Iterators: All subclasses must implement 'children'
409 child_range children();
410 const_child_range children() const { function in class:clang::Stmt
411 return const_cast<Stmt*>(this)->children();
414 child_iterator child_begin() { return children().first; }
415 child_iterator child_end() { return children().second; }
417 const_child_iterator child_begin() const { return children().first; }
418 const_child_iterator child_end() const { return children().second; }
479 child_range children() { function in class:clang::DeclStmt
533 child_range children() { return child_range(); } function in class:clang::NullStmt
612 child_range children() { function in class:clang::CompoundStmt
616 const_child_range children() const { function in class:clang::CompoundStmt
718 child_range children() { function in class:clang::CaseStmt
750 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::DefaultStmt
786 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::LabelStmt
834 child_range children() { return child_range(&SubStmt, &SubStmt + 1); } function in class:clang::AttributedStmt
901 child_range children() { function in class:clang::IfStmt
993 child_range children() { function in class:clang::SwitchStmt
1053 child_range children() { function in class:clang::WhileStmt
1101 child_range children() { function in class:clang::DoStmt
1174 child_range children() { function in class:clang::ForStmt
1208 child_range children() { return child_range(); } function in class:clang::GotoStmt
1251 child_range children() { return child_range(&Target, &Target+1); } function in class:clang::IndirectGotoStmt
1276 child_range children() { return child_range(); } function in class:clang::ContinueStmt
1300 child_range children() { return child_range(); } function in class:clang::BreakStmt
1354 child_range children() { function in class:clang::ReturnStmt
1490 child_range children() { function in class:clang::AsmStmt
1769 child_range children() { function in class:clang::MSAsmStmt
1808 child_range children() { function in class:clang::SEHExceptStmt
1842 child_range children() { function in class:clang::SEHFinallyStmt
1893 child_range children() { function in class:clang::SEHTryStmt
[all...] |
