| /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...] |
| /external/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 47 /// - If the node has a path 'p2' but no children, take the last path segment
64 if (Children.empty()) {
71 Children[Element].Path = Path;
75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
89 /// - .. have children. In this case it is checked
93 /// - .. a child matching the next path segment. In this case, all children of
94 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
103 if (Children.empty()) {
111 Children.find(Element);
112 if (MatchingChild != Children.end())
[all...] |
| /external/llvm/tools/llvm-pdbdump/ |
| ClassDefinitionDumper.cpp | 61 auto Children = Class.findAllChildren();
62 if (Children->getChildCount() == 0) {
79 while (auto Child = Children->getNext()) {
|
| /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/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 43 // Create the two children for this node.
64 enum Children {
|
| /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/clang/lib/Format/ |
| TokenAnnotator.h | 61 Current->Children.clear();
62 for (const auto &Child : Node.Children) {
63 Children.push_back(new AnnotatedLine(Child));
64 Current->Children.push_back(Children.back());
72 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
73 delete Children[i];
77 Current->Children.clear();
101 SmallVector<AnnotatedLine *, 0> Children;
118 /// \c True if a one of this line's children intersects with an input range
[all...] |
| UnwrappedLineParser.h | 211 SmallVector<UnwrappedLine, 0> Children;
|
| FormatToken.h | 271 SmallVector<AnnotatedLine *, 1> Children;
|
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
226 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(),
227 SE = Children.end();
327 if (!Children.empty())
328 err << std::string(Indent + 2, ' ') << "Children ...\n";
329 for (unsigned i = 0, e = Children.size(); i != e; ++i)
330 if (Children[i] != this)
331 Children[i]->dump(Indent + 2);
|
| MachineSink.cpp | 559 const std::vector<MachineDomTreeNode *> &Children =
561 for (const auto &DTChild : Children)
562 // DomTree children of MBB that have MBB as immediate dominator are added.
|
| MachineCSE.cpp | 654 /// dominator tree node if its a leaf or all of its children are done. Walk
687 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
688 unsigned NumChildren = Children.size();
691 MachineDomTreeNode *Child = Children[i];
|
| MachineLICM.cpp | 605 /// if its a leaf or all of its children are done. Walk up the dominator tree to
659 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
660 unsigned NumChildren = Children.size();
669 // Add children in reverse order as then the next popped worklist node is
673 MachineDomTreeNode *Child = Children[i];
[all...] |
| /external/guice/lib/build/ |
| safesax.jar | |
| /external/llvm/include/llvm/CodeGen/ |
| LexicalScopes.h | 64 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; }
68 void addChild(LexicalScope *S) { Children.push_back(S); }
126 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
| DIE.h | 68 /// Children - Whether or not this node has children.
71 // are 0 and 1 for no children and children respectively.
72 bool Children;
79 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {}
84 bool hasChildren() const { return Children; }
86 void setChildrenFlag(bool hasChild) { Children = hasChild; }
617 /// Size - Size of instance + children.
627 /// Children DIEs
652 child_range children() { function in class:llvm::DIE
655 const_child_range children() const { function in class:llvm::DIE
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizePICCall.cpp | 197 // Visit the MBB and add its children to the work list.
201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren();
202 WorkList.append(Children.begin(), Children.end());
|
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 323 // We are processing blocks in reverse dfo, so process children first.
324 const std::vector<DomTreeNode*> &Children = N->getChildren();
325 for (unsigned i = 0, e = Children.size(); i != e; ++i)
327 sinkRegion(Children[i], AA, LI, DT, TLI, CurLoop, CurAST, SafetyInfo);
407 const std::vector<DomTreeNode*> &Children = N->getChildren();
408 for (unsigned i = 0, e = Children.size(); i != e; ++i)
410 hoistRegion(Children[i], AA, LI, DT, TLI, CurLoop, CurAST, SafetyInfo);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 167 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end());
168 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(),
169 DE = Children.end();
300 std::vector<DomTreeNode *> Children;
303 Children.push_back(*I);
306 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
307 E = Children.end(); I != E; ++I)
729 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());
732 for (auto Child : Children)
[all...] |
| CodeExtractor.cpp | 275 SmallVector<DomTreeNode*, 8> Children;
278 Children.push_back(*DI);
282 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(),
283 E = Children.end(); I != E; ++I)
|
| LoopSimplify.cpp | 320 // Scan all of the loop children of L, moving them to OuterLoop if they are
686 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
688 while (!Children.empty()) {
689 DomTreeNode *Child = Children.front();
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children;
83 iterator begin() { return Children.begin(); }
84 iterator end() { return Children.end(); }
85 const_iterator begin() const { return Children.begin(); }
86 const_iterator end() const { return Children.end(); }
91 return Children;
99 Children.push_back(C.get());
103 size_t getNumChildren() const { return Children.size(); }
105 void clearAllChildren() { Children.clear(); }
129 std::find(IDom->Children.begin(), IDom->Children.end(), this)
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 320 SmallVector<DIE *, 8> Children;
322 // We try to create the scope DIE first, then the children DIEs. This will
323 // avoid creating un-used children then removing them later when we find out
330 // We create children when the scope DIE is not null.
331 createScopeChildrenDIE(Scope, Children);
339 // We create children here when we know the scope DIE is not going to be
340 // null and the children will be added to the scope DIE.
341 createScopeChildrenDIE(Scope, Children, &ChildScopeCount);
347 Children.push_back(
351 // If there are only other scopes as children, put them directly in th
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| acpiioct.h | 140 ACPI_ENUM_CHILD Children[ANYSIZE_ARRAY];
|
