| /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/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.h | 88 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
90 Children.begin(), E = Children.end(); I != E; ++I) {
|
| 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();
|
| MachineCSE.cpp | 480 /// dominator tree node if its a leaf or all of its children are done. Walk
515 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
516 unsigned NumChildren = Children.size();
519 MachineDomTreeNode *Child = Children[i];
|
| LiveDebugVariables.cpp | 536 const std::vector<MachineDomTreeNode*> &Children =
538 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
539 MachineBasicBlock *MBB = Children[i]->getBlock();
[all...] |
| MachineLICM.cpp | 653 const std::vector<MachineDomTreeNode*> &Children = N->getChildren();
654 for (unsigned I = 0, E = Children.size(); I != E; ++I)
655 HoistRegion(Children[I]);
[all...] |
| /external/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.
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 172 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
173 for (SmallVector<DomTreeNode*, 8>::iterator DI = Children.begin(),
174 DE = Children.end(); DI != DE; ++DI)
303 std::vector<DomTreeNode *> Children;
306 Children.push_back(*I);
309 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
310 E = Children.end(); I != E; ++I)
|
| CodeExtractor.cpp | 192 SmallVector<DomTreeNode*, 8> Children;
195 Children.push_back(*DI);
199 for (SmallVector<DomTreeNode*, 8>::iterator I = Children.begin(),
200 E = Children.end(); I != E; ++I)
|
| LoopSimplify.cpp | 341 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children =
343 while (!Children.empty()) {
344 DomTreeNode *Child = Children.front();
599 // Scan all of the loop children of L, moving them to OuterLoop if they are
|
| /frameworks/base/tools/localize/ |
| XMLHandler.h | 92 inline const vector<XMLNode*>& Children() const { return m_children; }
|
| /external/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/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.h | 63 /// ChildrenFlag - Dwarf children flag.
124 /// Size - Size of instance + children.
128 /// Children DIEs.
130 std::vector<DIE *> Children;
152 const std::vector<DIE *> &getChildren() const { return Children; }
184 Children.push_back(Child);
|
| DwarfDebug.cpp | 379 SmallVector <DIE *, 8> Children;
387 Children.push_back(Arg);
389 // Collect lexical scope children first.
394 Children.push_back(Variable);
398 Children.push_back(Nested);
416 if (Children.empty())
423 // Add children
424 for (SmallVector<DIE *, 8>::iterator I = Children.begin(),
425 E = Children.end(); I != E; ++I)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 280 // We are processing blocks in reverse dfo, so process children first.
281 const std::vector<DomTreeNode*> &Children = N->getChildren();
282 for (unsigned i = 0, e = Children.size(); i != e; ++i)
283 SinkRegion(Children[i]);
354 const std::vector<DomTreeNode*> &Children = N->getChildren();
355 for (unsigned i = 0, e = Children.size(); i != e; ++i)
356 HoistRegion(Children[i]);
|
| /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 | 120 /// operates on the node or its children without potential side effects or a
184 /// ScopeMatcher - This attempts to match each of its children to find the first
186 /// If none of the children match then this check fails. It never has a 'next'.
188 SmallVector<Matcher*, 4> Children;
190 ScopeMatcher(Matcher *const *children, unsigned numchildren)
191 : Matcher(Scope), Children(children, children+numchildren) {
195 unsigned getNumChildren() const { return Children.size(); }
197 Matcher *getChild(unsigned i) { return Children[i];
[all...] |
| CodeGenDAGPatterns.cpp | 712 // Count children in the count if they are also nodes.
[all...] |
| /external/clang/include/clang/AST/ |
| Stmt.h | 45 // references to children (to be compatible with StmtIterator).
316 /// Child Iterators: All subclasses must implement 'children'
325 child_range children();
326 const_child_range children() const { function in class:clang::Stmt
327 return const_cast<Stmt*>(this)->children();
330 child_iterator child_begin() { return children().first; }
331 child_iterator child_end() { return children().second; }
333 const_child_iterator child_begin() const { return children().first; }
334 const_child_iterator child_end() const { return children().second; }
397 child_range children() { function in class:clang::DeclStmt
443 child_range children() { return child_range(); } function in class:clang::NullStmt
531 child_range children() { function in class:clang::CompoundStmt
535 const_child_range children() const { function in class:clang::CompoundStmt
630 child_range children() { function in class:clang::CaseStmt
665 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::DefaultStmt
696 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::LabelStmt
763 child_range children() { function in class:clang::IfStmt
856 child_range children() { function in class:clang::SwitchStmt
916 child_range children() { function in class:clang::WhileStmt
965 child_range children() { function in class:clang::DoStmt
1037 child_range children() { function in class:clang::ForStmt
1072 child_range children() { return child_range(); } function in class:clang::GotoStmt
1117 child_range children() { return child_range(&Target, &Target+1); } function in class:clang::IndirectGotoStmt
1144 child_range children() { return child_range(); } function in class:clang::ContinueStmt
1168 child_range children() { return child_range(); } function in class:clang::BreakStmt
1220 child_range children() { function in class:clang::ReturnStmt
1469 child_range children() { function in class:clang::AsmStmt
1503 child_range children() { function in class:clang::SEHExceptStmt
1540 child_range children() { function in class:clang::SEHFinallyStmt
1590 child_range children() { function in class:clang::SEHTryStmt
[all...] |
