/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | AntlrRuntime_BaseTreeDebugView.cs | 47 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 D | BaseTree.cs | 73 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...] |
/external/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 62 if (Children.empty()) { 69 Children[Element].Path = Path; 73 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); 101 if (Children.empty()) { 109 Children.find(Element); 110 if (MatchingChild != Children.end()) { 139 if (Children.empty()) { 144 It = Children.begin(), E = Children.end(); 148 It->getValue().getAll(Results, Children 157 llvm::StringMap<FileMatchTrieNode> Children; member in class:clang::tooling::FileMatchTrieNode [all...] |
/external/llvm/lib/Support/ |
H A D | Dwarf.cpp | 103 const char *llvm::dwarf::ChildrenString(unsigned Children) { argument 104 switch (Children) {
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BaseTree.cs | 68 public virtual IList<ITree> Children { property in class:Antlr.Runtime.Tree.BaseTree 78 if (Children == null) 81 return Children.Count;
|
/external/llvm/include/llvm/CodeGen/ |
H A D | 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. member in class:llvm::LexicalScope
|
/external/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 221 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); local 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);
|
H A D | MachineCSE.cpp | 631 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local 632 unsigned NumChildren = Children.size(); 635 MachineDomTreeNode *Child = Children[i];
|
H A D | LiveDebugVariables.cpp | 545 const std::vector<MachineDomTreeNode*> &Children = local 547 for (unsigned i = 0, e = Children.size(); i != e; ++i) { 548 MachineBasicBlock *MBB = Children[i]->getBlock();
|
H A D | MachineLICM.cpp | 714 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local 715 unsigned NumChildren = Children.size(); 728 MachineDomTreeNode *Child = Children[i];
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 350 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children = local 352 while (!Children.empty()) { 353 DomTreeNode *Child = Children.front();
|
H A D | 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; local 290 Children.push_back(*I); 293 for (std::vector<DomTreeNode *>::iterator I = Children.begin(), 294 E = Children.end(); I != E; ++I)
|
H A D | CodeExtractor.cpp | 273 SmallVector<DomTreeNode*, 8> Children; local 276 Children.push_back(*DI); 280 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(), 281 E = Children.end(); I != E; ++I)
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DIE.h | 124 /// Children DIEs. 126 std::vector<DIE *> Children; member in class:llvm::DIE 149 const std::vector<DIE *> &getChildren() const { return Children; } 174 Children.push_back(Child);
|
H A D | DwarfDebug.cpp | 577 SmallVector<DIE *, 8> Children; 586 Children.push_back(Arg); 595 Children.push_back(Variable); 601 Children.push_back(Nested); 623 if (Children.empty() && Range.first == Range.second) 634 for (SmallVectorImpl<DIE *>::iterator I = Children.begin(), 635 E = Children.end(); I != E; ++I) 1556 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren(); local 1557 if (!Children.empty()) 1558 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children 1931 const std::vector<DIE *> &Children = Die->getChildren(); local 2116 const std::vector<DIE *> &Children = Die->getChildren(); local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 312 const std::vector<DomTreeNode*> &Children = N->getChildren(); local 313 for (unsigned i = 0, e = Children.size(); i != e; ++i) 314 SinkRegion(Children[i]); 385 const std::vector<DomTreeNode*> &Children = N->getChildren(); local 386 for (unsigned i = 0, e = Children.size(); i != e; ++i) 387 HoistRegion(Children[i]);
|
/external/chromium_org/tools/gyp/pylib/gyp/ |
H A D | xcodeproj_file.py | 445 for child in self.Children(): 475 def Children(self): member in class:XCObject 493 children = self.Children() 2504 def Children(self): member in class:PBXProject 2506 children = XCContainerPortal.Children(self)
|
/external/llvm/include/llvm/Analysis/ |
H A D | Dominators.h | 67 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 D | DAGISelMatcher.h | 187 SmallVector<Matcher*, 4> Children; member in class:llvm::ScopeMatcher 190 : Matcher(Scope), Children(children, children+numchildren) { 194 unsigned getNumChildren() const { return Children.size(); } 196 Matcher *getChild(unsigned i) { return Children[i]; } 197 const Matcher *getChild(unsigned i) const { return Children[i]; } 200 delete Children[i]; 201 Children[i] = N; 205 Matcher *Res = Children[i]; 206 Children[i] = 0; 211 if (NC < Children [all...] |
H A D | CodeGenDAGPatterns.cpp | 1202 CChildren.reserve(Children.size()); 1282 if (Frag->getNumArgs() != Children.size()) { 1953 std::vector<TreePatternNode*> Children; local 1957 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i))); 1977 Children.insert(Children.begin(), IIDNode); 1981 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults); 2844 std::vector<TreePatternNode*> Children; local 2845 Children.push_back(OpNode); 2846 OpNode = new TreePatternNode(Xform, Children, OpNod 3260 std::vector<TreePatternNode*> Children; local 3381 GatherChildrenOfAssociativeOpcode(TreePatternNode *N, std::vector<TreePatternNode *> &Children) argument [all...] |
/external/clang/include/clang/AST/ |
H A D | Stmt.h | 1776 Stmt *Children[2]; member in class:clang::SEHExceptStmt 1801 return reinterpret_cast<Expr*>(Children[FILTER_EXPR]); 1805 return cast<CompoundStmt>(Children[BLOCK]); 1809 return child_range(Children,Children+2); 1855 Stmt *Children[2]; member in class:clang::SEHTryStmt 1879 SourceLocation getEndLoc() const { return Children[HANDLER]->getLocEnd(); } 1884 return cast<CompoundStmt>(Children[TRY]); 1887 Stmt *getHandler() const { return Children[HANDLER]; } 1894 return child_range(Children,Childre [all...] |