/external/tinyxml/ |
H A D | tinyxml.cpp | 1665 TiXmlHandle TiXmlHandle::Child( int count ) const function in class:TiXmlHandle 1684 TiXmlHandle TiXmlHandle::Child( const char* value, int count ) const function in class:TiXmlHandle
|
H A D | tinyxml.h | 1377 <Child attributeB = "value1" /> 1378 <Child attributeB = "value2" /> 1383 Assuming you want the value of "attributeB" in the 2nd "Child" element, it's very 1393 TiXmlElement* child = element->FirstChildElement( "Child" ); 1396 TiXmlElement* child2 = child->NextSiblingElement( "Child" ); 1408 TiXmlElement* child2 = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", 1 ).Element(); 1427 TiXmlElement* child = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", i ).Element(); 1435 It seems reasonable, but it is in fact two embedded while loops. The Child metho 1489 TiXmlHandle Child( const std::string& _value, int index ) const { return Child( _value.c_str(), index ); } function in class:TiXmlHandle [all...] |
/external/skia/src/gpu/ |
H A D | GrRedBlackTree.h | 139 enum Child { enum in class:GrRedBlackTree 358 Child pc = kLeft_Child; // suppress uninit warning 359 Child gpc = kLeft_Child; 500 Child c = d->fChildren[kLeft_Child] == n ? kLeft_Child : 532 Child c = d->fChildren[kRight_Child] == n ? kRight_Child : 595 Child c = hasLeft ? kLeft_Child : kRight_Child; 639 Child pc;
|
/external/sfntly/cpp/src/test/tinyxml/ |
H A D | tinyxml.h | 1567 <Child attributeB = "value1" /> 1568 <Child attributeB = "value2" /> 1573 Assuming you want the value of "attributeB" in the 2nd "Child" element, it's very 1583 TiXmlElement* child = element->FirstChildElement( "Child" ); 1586 TiXmlElement* child2 = child->NextSiblingElement( "Child" ); 1598 TiXmlElement* child2 = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", 1 ).ToElement(); 1617 TiXmlElement* child = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", i ).ToElement(); 1625 It seems reasonable, but it is in fact two embedded while loops. The Child metho 1679 TiXmlHandle Child( const std::string& _value, int index ) const { return Child( _value.c_str(), index ); } function in class:TiXmlHandle [all...] |
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | ant.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |
/external/pdfium/fpdfsdk/src/ |
H A D | fpdfdoc.cpp | 21 CPDF_Bookmark Child = tree.GetFirstChild(This);
local 22 while (Child != NULL) {
24 CPDF_Bookmark Found = FindBookmark(tree, Child, title);
26 Child = tree.GetNextSibling(Child);
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenDAGPatterns.cpp | 755 TreePatternNode *Child = P->getChild(i); local 756 if (!Child->isLeaf() && Child->getNumTypes() && 757 Child->getType(0) != MVT::Other) 758 Size += getPatternSize(Child, CGP); 759 else if (Child->isLeaf()) { 760 if (isa<IntInit>(Child->getLeafValue())) 762 else if (Child->getComplexPatternInfo(CGP)) 763 Size += getPatternSize(Child, CGP); 764 else if (!Child 1241 TreePatternNode *Child = getChild(i); local 1277 TreePatternNode *Child = getChild(i); local 1592 TreePatternNode *Child = getChild(i); local 1712 TreePatternNode *Child = getChild(ChildNo++); local 2035 TreePatternNode *Child = Children[i]; local 2089 TreePatternNode *Child = N->getChild(i); local 3583 TreePatternNode *Child = N->getChild(i); local [all...] |
H A D | DAGISelMatcherEmitter.cpp | 293 const Matcher *Child; local 296 Child = SOM->getCaseMatcher(i); 299 Child = cast<SwitchTypeMatcher>(N)->getCaseMatcher(i); 317 ChildSize = EmitMatcherList(Child, Indent+1, CurrentIdx+VBRSize+IdxSize,
|
H A D | DAGISelMatcherGen.cpp | 796 const TreePatternNode *Child = N->getChild(ChildNo); local 798 EmitResultOperand(Child, InstOps); 803 if (!Child->isLeaf() && Child->getOperator()->isSubClassOf("Instruction"))
|
/external/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) argument 56 : Node(Node), NextChild(Child), MinVisited(Min) {}
|
H A D | Twine.h | 133 union Child union in class:llvm::Twine 152 Child LHS; 155 Child RHS; 179 explicit Twine(Child _LHS, NodeKind _LHSKind, 180 Child _RHS, NodeKind _RHSKind) 247 void printOneChild(raw_ostream &OS, Child Ptr, NodeKind Kind) const; 250 void printOneChildRepr(raw_ostream &OS, Child Ptr, 379 Child LHS, RHS; 486 Child NewLHS, NewRHS;
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 278 LoopT *Child = *I; local 279 assert(Child->ParentLoop == this && "Child is not a child of this loop!"); 281 Child->ParentLoop = nullptr; 282 return Child;
|
/external/llvm/include/llvm/Object/ |
H A D | Archive.h | 50 class Child { class in class:llvm::object::Archive 62 Child(const Archive *Parent, const char *Start); 64 bool operator ==(const Child &other) const { 69 bool operator <(const Child &other) const { 73 Child getNext() const; 100 Child child; 102 child_iterator() : child(Child(nullptr, nullptr)) {} 103 child_iterator(const Child &c) : child(c) {} 104 const Child* operator->() const {
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 638 const DomTreeNodeBase<NodeT> *Child = *ChildIt; local 641 WorkStack.push_back(std::make_pair(Child, Child->begin())); 642 Child->DFSNumIn = DFSNum++;
|
/external/llvm/lib/Analysis/ |
H A D | RegionInfo.cpp | 326 if (Region* Child = getSubRegionNode(BB)) 327 return Child->getNode(); 379 Region *Region::removeSubRegion(Region *Child) { argument 380 assert(Child->parent == this && "Child is not a child of this region!"); 381 Child->parent = nullptr; 384 [&](const std::unique_ptr<Region> &R) { return R.get() == Child; }); 387 return Child;
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DIE.h | 181 void addChild(std::unique_ptr<DIE> Child) { argument 182 assert(!Child->getParent()); 184 Child->Parent = this; 185 Children.push_back(std::move(Child));
|
/external/llvm/lib/CodeGen/ |
H A D | MachineCSE.cpp | 643 MachineDomTreeNode *Child = Children[i]; local 644 WorkList.push_back(Child);
|
H A D | MachineLICM.cpp | 732 MachineDomTreeNode *Child = Children[i]; local 733 ParentMap[Child] = Node; 734 WorkList.push_back(Child);
|
H A D | ScheduleDAGInstrs.cpp | 1485 const SUnit *Child = DFS.getCurr(); local 1487 Impl.visitPostorderNode(Child);
|
/external/llvm/lib/DebugInfo/ |
H A D | DWARFDebugInfoEntry.cpp | 269 const DWARFDebugInfoEntryMinimal *Child = getFirstChild(); local 270 while (Child) { 271 Child->collectChildrenAddressRanges(U, Ranges); 272 Child = Child->getSibling(); 347 const DWARFDebugInfoEntryMinimal *Child = DIE->getFirstChild(); local 348 while (Child) { 349 if (Child->addressRangeContainsAddress(U, Address)) { 353 Child = Child [all...] |
/external/llvm/lib/Object/ |
H A D | Archive.cpp | 82 Archive::Child::Child(const Archive *Parent, const char *Start) function in class:Archive::Child 103 Archive::Child Archive::Child::getNext() const { 113 return Child(Parent, nullptr); 115 return Child(Parent, NextLoc); 118 ErrorOr<StringRef> Archive::Child::getName() const { 163 Archive::Child::getMemoryBuffer(bool FullPath) const { 179 Archive::Child::getAsBinary(LLVMContext *Context) const { 322 Child [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 699 DomTreeNode *Child = Children.front(); local 700 DT->changeImmediateDominator(Child, Node->getIDom());
|
/external/libcxxabi/test/ |
H A D | inherited_exception.cpp | 38 struct Child : public Base, public Base2 { struct in inherits:Base,Base2 43 Child child; 51 Child child; 59 Child* child = new Child; 73 catch (const Child& c) 95 catch (const Child& b) 113 catch (const Child& b) 127 catch (const Child& c) 153 catch (const Child* [all...] |
/external/jarjar/lib/ |
H A D | apache-ant-1.9.4.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
H A D | ant.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ... |