/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/llvm/tools/llvm-pdbdump/ |
H A D | ClassDefinitionDumper.cpp | 61 auto Children = Class.findAllChildren(); local 62 if (Children->getChildCount() == 0) { 79 while (auto Child = Children->getNext()) {
|
H A D | CompilandDumper.cpp | 45 void CompilandDumper::start(const PDBSymbolCompiland &Symbol, bool Children) { argument 52 if (!Children)
|
/external/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 64 if (Children.empty()) { 71 Children[Element].Path = Path; 75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); 103 if (Children.empty()) { 111 Children.find(Element); 112 if (MatchingChild != Children.end()) { 141 if (Children.empty()) { 146 It = Children.begin(), E = Children.end(); 150 It->getValue().getAll(Results, Children 159 llvm::StringMap<FileMatchTrieNode> Children; member in class:clang::tooling::FileMatchTrieNode [all...] |
/external/clang/lib/Format/ |
H A D | 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; member in class:clang::format::AnnotatedLine
|
H A D | UnwrappedLineParser.h | 211 SmallVector<UnwrappedLine, 0> Children; member in struct:clang::format::UnwrappedLineNode
|
H A D | FormatToken.h | 271 SmallVector<AnnotatedLine *, 1> Children; member in struct:clang::format::FormatToken
|
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.h | 64 enum Children { enum in class:webrtc::PartitionTreeNode
|
/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/guice/lib/build/ |
H A D | safesax.jar | META-INF/MANIFEST.MF safesax/ safesax/BadXmlException.class BadXmlException.java package safesax safesax.BadXmlException ... |
/external/llvm/include/llvm/CodeGen/ |
H A D | 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. member in class:llvm::LexicalScope
|
H A D | DIE.h | 68 /// Children - Whether or not this node has children. 72 bool Children; member in class:llvm::DIEAbbrev 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; } 627 /// Children DIEs. 628 IntrusiveBackList<DIE> Children; member in class:llvm::DIE 645 bool hasChildren() const { return !Children.empty(); } 653 return llvm::make_range(Children.begin(), Children [all...] |
/external/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); local 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);
|
H A D | MachineSink.cpp | 559 const std::vector<MachineDomTreeNode *> &Children = local 561 for (const auto &DTChild : Children)
|
H A D | MachineCSE.cpp | 687 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local 688 unsigned NumChildren = Children.size(); 691 MachineDomTreeNode *Child = Children[i];
|
H A D | MachineLICM.cpp | 659 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local 660 unsigned NumChildren = Children.size(); 673 MachineDomTreeNode *Child = Children[i];
|
/external/llvm/lib/Support/ |
H A D | Dwarf.cpp | 38 const char *llvm::dwarf::ChildrenString(unsigned Children) { argument 39 switch (Children) {
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsOptimizePICCall.cpp | 201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); local 202 WorkList.append(Children.begin(), Children.end());
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 686 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children = local 688 while (!Children.empty()) { 689 DomTreeNode *Child = Children.front();
|
H A D | 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; local 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)
|
H A D | CodeExtractor.cpp | 275 SmallVector<DomTreeNode*, 8> Children; local 278 Children.push_back(*DI); 282 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(), 283 E = Children.end(); I != E; ++I)
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 324 const std::vector<DomTreeNode*> &Children = N->getChildren(); local 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(); local 408 for (unsigned i = 0, e = Children.size(); i != e; ++i) 410 hoistRegion(Children[i], AA, LI, DT, TLI, CurLoop, CurAST, SafetyInfo);
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children; member in class:llvm::DomTreeNodeBase 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 [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfCompileUnit.cpp | 320 SmallVector<DIE *, 8> Children; local 331 createScopeChildrenDIE(Scope, Children); 341 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); 347 Children.push_back( 353 if (Children.size() == ChildScopeCount) { 355 std::make_move_iterator(Children.begin()), 356 std::make_move_iterator(Children.end())); 364 for (auto &I : Children) 548 SmallVectorImpl<DIE *> &Children, 553 Children 547 createScopeChildrenDIE(LexicalScope *Scope, SmallVectorImpl<DIE *> &Children, unsigned *ChildScopeCount) argument 597 SmallVector<DIE *, 8> Children; local [all...] |