| /prebuilts/go/darwin-x86/test/ |
| torture.go | 189 Children []J
192 func (u *U) Child(n int) J { return u.Children[n] }
251 Children[0].(*U).
252 Children[0].(*U).
253 Children[0].(*U).
254 Children[0].(*U).
255 Children[0].(*U).
256 Children[0].(*U).
257 Children[0].(*U).
258 Children[0].(*U)
[all...] |
| /prebuilts/go/linux-x86/test/ |
| torture.go | 189 Children []J
192 func (u *U) Child(n int) J { return u.Children[n] }
251 Children[0].(*U).
252 Children[0].(*U).
253 Children[0].(*U).
254 Children[0].(*U).
255 Children[0].(*U).
256 Children[0].(*U).
257 Children[0].(*U).
258 Children[0].(*U)
[all...] |
| /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...] |
| CommonTree.cs | 94 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];
|
| ParseTree.cs | 160 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/ |
| CommonTree.cs | 87 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];
|
| ParseTree.cs | 135 for (int i = 0; Children != null && i < Children.Count; i++) {
136 ParseTree t = (ParseTree)Children[i];
|
| /external/swiftshader/third_party/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/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/clang/lib/Rewrite/ |
| DeltaTree.cpp | 31 /// former and adds children pointers. Each node knows the full delta of all
82 /// all children nodes.
123 DeltaTreeNode *Children[2*WidthFactor];
126 Children[i]->Destroy();
134 Children[0] = IR.LHS;
135 Children[1] = IR.RHS;
143 return Children[i];
147 return Children[i];
214 // the value into one of the children, and return the result.
227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)
[all...] |
| RewriteRope.cpp | 36 /// contains a reasonable number of pointers to children/values) allows us to
50 /// 'WidthFactor' children/values. For our use cases, this doesn't seem to
72 /// children that it has. This allows efficient skipping over entire subtrees
78 /// 'WidthFactor' elements in it (either ropepieces or children), (except
84 /// potential children) covers.
394 /// NumChildren - This holds the number of children currently active in the
395 /// Children array.
397 RopePieceBTreeNode *Children[2*WidthFactor];
403 Children[0] = LHS;
404 Children[1] = RHS
[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();
109 SmallVector<AnnotatedLine *, 0> Children;
126 /// \c True if a one of this line's children intersects with an input range
[all...] |
| AffectedRangeManager.cpp | 96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end());
105 computeAffectedLines(Line->Children.begin(), Line->Children.end());
125 if (!Tok->Children.empty() && Tok->Children.front()->Affected)
128 IncludeLeadingNewlines = Tok->Children.empty();
|
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDriver1CommandsLib/ |
| Devices.c | 34 @param[in, out] Children On successful return this buffer will be
53 IN OUT UINTN *Children,
68 || Children == NULL
75 *Children = 0;
85 Status = ParseHandleDatabaseForChildControllers(TheHandle, Children, NULL);
88 if (/*!EFI_ERROR(Status) && */Parents != NULL && Children != NULL) {
91 } else if (*Children > 0) {
148 UINTN Children;
233 Status = GetDeviceHandleInfo(*HandleListWalker, &Type, &Cfg, &Diag, &Parents, &Devices, &Children, &Name, Language);
234 if (Name != NULL && (Parents != 0 || Devices != 0 || Children != 0)) {
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 95 /// NodeType - Node index and set of children of the node.
145 // Add in all nodes which are children of a reachable node.
158 /// ChildIterator - Visit all children of a node.
164 /// Children - Set of nodes which are children of this one and that haven't
166 NodeSubset Children;
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
175 Children(other.Children) {}
180 other.Children == this->Children
[all...] |
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| SCCIteratorTest.cpp | 97 /// NodeType - Node index and set of children of the node.
147 // Add in all nodes which are children of a reachable node.
160 /// ChildIterator - Visit all children of a node.
166 /// 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
[all...] |
| /external/llvm/tools/llvm-pdbdump/ |
| CompilandDumper.h | 23 enum Flags { None = 0x0, Children = 0x1, Symbols = 0x2, Lines = 0x4 };
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Acpi/AcpiTableDxe/ |
| AmlNamespace.c | 60 InitializeListHead (&AmlNodeList->Children);
68 Find the AML NameSeg in the children of AmlParentNodeList.
88 StartLink = &AmlParentNodeList->Children;
116 InsertTailList (&AmlParentNodeList->Children, &AmlNodeList->Link);
122 Find the AML NameString in the children of AmlParentNodeList or AmlRootNodeList.
436 // Get the children link
438 StartLink = &AmlParentNodeList->Children;
442 // Go through all the children
482 CurrentLink = AmlParentNodeList->Children.ForwardLink;
494 while (CurrentLink != &AmlParentNodeList->Children) {
[all...] |
| /external/guice/lib/build/ |
| safesax.jar | |
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 223 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren();
225 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(),
226 SE = Children.end();
326 if (!Children.empty())
327 err << std::string(Indent + 2, ' ') << "Children ...\n";
328 for (unsigned i = 0, e = Children.size(); i != e; ++i)
329 if (Children[i] != this)
330 Children[i]->dump(Indent + 2);
|
| /external/swiftshader/third_party/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) {
326 if (!Children.empty())
327 err << "Children ...\n";
328 for (unsigned i = 0, e = Children.size(); i != e; ++i)
329 if (Children[i] != this)
330 Children[i]->dump();
|
| /external/llvm/include/llvm/CodeGen/ |
| DIE.h | 67 /// Children - Whether or not this node has children.
70 // are 0 and 1 for no children and children respectively.
71 bool Children;
78 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {}
83 bool hasChildren() const { return Children; }
85 void setChildrenFlag(bool hasChild) { Children = hasChild; }
598 /// Size - Size of instance + children.
608 /// Children DIEs
633 child_range children() { function in class:llvm::DIE
636 const_child_range children() const { function in class:llvm::DIE
[all...] |
| 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.
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| LexicalScopes.h | 173 SmallVector<LexicalScope *, 4> &getChildren() { return Children; }
177 void addChild(LexicalScope *S) { Children.push_back(S); }
235 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
