| /external/llvm/utils/TableGen/ |
| DAGISelMatcherGen.cpp | 358 // the child numbers of the node are all offset by one.
399 // If it *is* an immediate child of the root, we can still need a check if
440 // Get the code suitable for matching this child. Move to the child, check
790 // multiple child patterns to cover them all. However, ComplexPattern
801 const TreePatternNode *Child = N->getChild(ChildNo);
803 EmitResultOperand(Child, InstOps);
808 if (!Child->isLeaf() && Child->getOperator()->isSubClassOf("Instruction"))
[all...] |
| /external/sfntly/cpp/src/test/tinyxml/ |
| tinyxml.h | 522 const TiXmlNode* FirstChild() const { return firstChild; } ///< The first child of this node. Will be null if there are no children.
524 const TiXmlNode* FirstChild( const char * value ) const; ///< The first child of this node with the matching 'value'. Will be null if none found.
525 /// The first child of this node with the matching 'value'. Will be null if none found.
531 const TiXmlNode* LastChild() const { return lastChild; } /// The last child of this node. Will be null if there are no children.
534 const TiXmlNode* LastChild( const char * value ) const; /// The last child of this node matching 'value'. Will be null if there are no children.
549 for( child = parent->FirstChild(); child; child = child->NextSibling() )
554 child = 0
[all...] |
| tinyxml.cpp | 305 // A document can never be a child. Thanks to Noam.
819 // 2) An element with only a text child is printed as <foo> text </foo>
902 const TiXmlNode* child = this->FirstChild(); local
903 if ( child ) {
904 const TiXmlText* childText = child->ToText();
[all...] |
| /external/tinyxml/ |
| tinyxml.h | 486 const TiXmlNode* FirstChild() const { return firstChild; } ///< The first child of this node. Will be null if there are no children.
488 const TiXmlNode* FirstChild( const char * value ) const; ///< The first child of this node with the matching 'value'. Will be null if none found.
489 TiXmlNode* FirstChild( const char * value ); ///< The first child of this node with the matching 'value'. Will be null if none found.
491 const TiXmlNode* LastChild() const { return lastChild; } /// The last child of this node. Will be null if there are no children.
493 const TiXmlNode* LastChild( const char * value ) const; /// The last child of this node matching 'value'. Will be null if there are no children.
506 for( child = parent->FirstChild(); child; child = child->NextSibling() )
511 child = 0
[all...] |
| tinyxml.cpp | 785 // 2) An element with only a text child is printed as <foo> text </foo>
884 const TiXmlNode* child = this->FirstChild(); local
885 if ( child ) {
886 const TiXmlText* childText = child->ToText();
1621 TiXmlNode* child = node->FirstChild(); local
1622 if ( child )
1623 return TiXmlHandle( child );
1633 TiXmlNode* child = node->FirstChild( value ); local
1634 if ( child )
1635 return TiXmlHandle( child );
1645 TiXmlElement* child = node->FirstChildElement(); local
1657 TiXmlElement* child = node->FirstChildElement( value ); local
1670 TiXmlNode* child = node->FirstChild(); local
1689 TiXmlNode* child = node->FirstChild( value ); local
1708 TiXmlElement* child = node->FirstChildElement(); local
1727 TiXmlElement* child = node->FirstChildElement( value ); local
[all...] |
| /external/clang/lib/CodeGen/ |
| CoverageMappingGen.cpp | 574 for (const Stmt *Child : S->children())
575 if (Child)
576 this->Visit(Child);
759 for (const auto *Child : CS->children())
760 Visit(Child);
[all...] |
| CodeGenPGO.cpp | 240 for (const Stmt *Child : S->children())
241 if (Child)
242 this->Visit(Child);
|
| CGException.cpp | [all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.cpp | 183 for (const auto &Child : children())
184 Child.print(O, IndentCount + 4);
|
| /external/llvm/lib/CodeGen/ |
| MachineCSE.cpp | 691 MachineDomTreeNode *Child = Children[i];
692 WorkList.push_back(Child);
|
| MachineLICM.cpp | 670 // the first child of this node. This means we ultimately traverse the
673 MachineDomTreeNode *Child = Children[i];
674 ParentMap[Child] = Node;
675 WorkList.push_back(Child);
[all...] |
| /external/v8/tools/ |
| profile.js | 610 * Finds an immediate child of the specified parent with the specified
611 * label, creates a child node if necessary. If a parent node isn't
614 * @param {string} label Child node label.
643 var child = (parent ? parent : subTree).findOrAddChild(node.label);
644 child.selfWeight += node.selfWeight;
645 return child;
686 node.forEachChild(function (child) {
687 morePairsToProcess.push({node: child, param: newParam}); });
740 * Adds a child node.
742 * @param {string} label Child node label
[all...] |
| profile_view.js | 181 * Adds a child to the node.
183 * @param {ProfileView.Node} node Child node.
|
| /external/libchrome/base/ |
| bind_unittest.cc | 73 class Child : public Parent {
75 ~Child() override = default;
364 Child child; local
365 child.value = 0;
366 Closure virtual_set_cb = Bind(&Parent::VirtualSet, &child);
368 EXPECT_EQ(kChildValue, child.value);
370 child.value = 0;
371 Closure non_virtual_set_cb = Bind(&Parent::NonVirtualSet, &child);
373 EXPECT_EQ(kParentValue, child.value)
[all...] |
| /external/libweave/third_party/chromium/base/ |
| bind_unittest.cc | 74 class Child : public Parent {
76 ~Child() override = default;
365 Child child; local
366 child.value = 0;
367 Closure virtual_set_cb = Bind(&Parent::VirtualSet, &child);
369 EXPECT_EQ(kChildValue, child.value);
371 child.value = 0;
372 Closure non_virtual_set_cb = Bind(&Parent::NonVirtualSet, &child);
374 EXPECT_EQ(kParentValue, child.value)
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_object_ref_count.cpp | 215 for (clang::Stmt* Child : S->children()) {
216 if (Child) {
217 Visit(Child);
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| LocalizationChecker.cpp | [all...] |
| /external/clang/unittests/AST/ |
| CommentParser.cpp | 95 T *&Child) {
107 return ::testing::AssertionFailure() << "Child is NULL";
109 Child = dyn_cast<T>(CommentChild);
110 if (!Child)
112 << "Child is not of requested type, but a "
[all...] |
| /external/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 456 for (AnnotatedLine *Child : Tok->Children)
457 markFinalized(Child->First);
544 // If the child line exceeds the column limit, we wouldn't want to merge it.
[all...] |
| /external/clang/lib/Sema/ |
| SemaStmtAsm.cpp | 102 for (Stmt *Child : E->children()) {
103 if (Expr *E = dyn_cast_or_null<Expr>(Child))
|
| /external/clang/tools/libclang/ |
| CXType.cpp | 768 if (const RecordDecl *Child = ChildType->getDecl()) {
769 long long ret = visitRecordForValidation(Child);
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 732 for (auto Child : Children)
733 DT->changeImmediateDominator(Child, NewNode);
[all...] |
| LoopSimplify.cpp | 294 // Change the parent loop to use the outer loop as its child now.
568 // If this is really a nested loop, rip it out into a child loop. Don't do
689 DomTreeNode *Child = Children.front();
690 DT->changeImmediateDominator(Child, Node->getIDom());
[all...] |
| /external/clang/lib/Analysis/ |
| CFG.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 768 // Append the location of each child.
775 // If the child is only used in GEP instructions (i.e. is not used in
[all...] |
