| /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];
|
| RootElement.java | 130 Children children = current.children; local
131 if (children != null) {
132 Element child = children.get(uri, localName);
|
| /external/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 456 for (AnnotatedLine *Child : Tok->Children)
492 /// Returns \c true if all children could be placed successfully and adapts
496 /// The crucial idea here is that children always get formatted upon
514 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0)
521 Previous.Children[0]->Level * Style.IndentWidth;
524 BlockFormatter->format(Previous.Children, DryRun, AdditionalIndent,
529 if (Previous.Children[0]->First->MustBreakBefore)
533 if (Previous.Children.size() > 1)
541 if (Previous.Children[0]->Last->isTrailingComment())
547 Previous.Children[0]->Last->TotalLength + State.Column + 2
[all...] |
| Format.cpp | [all...] |
| TokenAnnotator.cpp | [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/tools/llvm-pdbdump/ |
| ClassDefinitionDumper.cpp | 61 auto Children = Class.findAllChildren();
62 if (Children->getChildCount() == 0) {
79 while (auto Child = Children->getNext()) {
|
| /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/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/opencv3/samples/winrt/ImageManipulations/ |
| MainPage.xaml.cpp | 44 ContentRoot->Children->Append(HiddenFrame);
207 UIElementCollection^ collection = panel->Children;
|
| /external/clang/include/clang/AST/ |
| Stmt.h | 292 /// references to children (to be compatible with StmtIterator).
389 /// Child Iterators: All subclasses must implement 'children'
398 child_range children();
399 const_child_range children() const { function
400 auto Children = const_cast<Stmt *>(this)->children();
401 return const_child_range(Children.begin(), Children.end());
404 child_iterator child_begin() { return children().begin(); }
405 child_iterator child_end() { return children().end();
469 child_range children() { function in class:clang::DeclStmt
529 child_range children() { function in class:clang::NullStmt
625 child_range children() { function in class:clang::CompoundStmt
629 const_child_range children() const { function in class:clang::CompoundStmt
733 child_range children() { function in class:clang::CaseStmt
765 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::DefaultStmt
805 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::LabelStmt
859 child_range children() { return child_range(&SubStmt, &SubStmt + 1); } function in class:clang::AttributedStmt
927 child_range children() { function in class:clang::IfStmt
1013 child_range children() { function in class:clang::SwitchStmt
1073 child_range children() { function in class:clang::WhileStmt
1121 child_range children() { function in class:clang::DoStmt
1195 child_range children() { function in class:clang::ForStmt
1229 child_range children() { function in class:clang::GotoStmt
1274 child_range children() { return child_range(&Target, &Target+1); } function in class:clang::IndirectGotoStmt
1299 child_range children() { function in class:clang::ContinueStmt
1329 child_range children() { function in class:clang::BreakStmt
1384 child_range children() { function in class:clang::ReturnStmt
1536 child_range children() { function in class:clang::AsmStmt
1817 child_range children() { function in class:clang::MSAsmStmt
1856 child_range children() { function in class:clang::SEHExceptStmt
1890 child_range children() { function in class:clang::SEHFinallyStmt
1939 child_range children() { function in class:clang::SEHTryStmt
1970 child_range children() { function in class:clang::SEHLeaveStmt
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.h | 348 std::vector<TreePatternNode*> Children;
352 : Operator(Op), Val(nullptr), TransformFn(nullptr), Children(Ch) {
390 unsigned getNumChildren() const { return Children.size(); }
391 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
393 Children[i] = N;
396 /// hasChild - Return true if N is any of our children.
398 for (unsigned i = 0, e = Children.size(); i != e; ++i)
399 if (Children[i] == N) return true;
479 /// this node and its children in the tree. This returns true if it makes a
|
| CodeGenDAGPatterns.cpp | 832 // We don't want to count any children twice, so return early.
841 // Count children in the count if they are also nodes.
[all...] |
| DAGISelMatcher.cpp | 83 for (unsigned i = 0, e = Children.size(); i != e; ++i)
84 delete Children[i];
|
| /external/llvm/test/DebugInfo/SystemZ/ |
| variable-loc.s | 173 .byte 0 # End Of Children Mark
174 .byte 0 # End Of Children Mark
175 .byte 0 # End Of Children Mark
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.cpp | 55 ID.AddInteger(unsigned(Children));
68 // Emit whether it has children DIEs.
69 AP->EmitULEB128((unsigned)Children, dwarf::ChildrenString(Children));
96 << dwarf::ChildrenString(Children)
183 for (const auto &Child : children())
|
| DwarfCompileUnit.h | 153 /// A helper function to create children of a Scope DIE.
155 SmallVectorImpl<DIE *> &Children,
|
| /external/llvm/lib/Support/ |
| Dwarf.cpp | 38 const char *llvm::dwarf::ChildrenString(unsigned Children) {
39 switch (Children) {
|
| /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/CodeGen/ |
| 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];
|
| 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.
|
| /external/clang/lib/AST/ |
| Stmt.cpp | 189 (void) is_good(implements_children(&type::children))
208 Stmt::child_range Stmt::children() { function in class:Stmt
214 return static_cast<type*>(this)->children();
903 Children[TRY] = TryBlock;
904 Children[HANDLER] = Handler;
927 Children[FILTER_EXPR] = FilterExpr;
928 Children[BLOCK] = Block;
1058 Stmt::child_range CapturedStmt::children() { function in class:CapturedStmt
[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];
|
