/external/valgrind/main/none/tests/ |
H A D | mmap_fcntl_bug.stderr.exp | 0 Child exited with zero (TEST PASSED).
|
/external/llvm/include/llvm/Object/ |
H A D | Archive.h | 27 class Child { class in class:llvm::object::Archive 32 Child(const Archive *p, StringRef d) : Parent(p), Data(d) {} function in class:llvm::object::Archive::Child 34 bool operator ==(const Child &other) const { 38 bool operator <(const Child &other) const { 42 Child getNext() const; 56 Child child; 58 child_iterator() : child(Child(0, StringRef())) {} 59 child_iterator(const Child &c) : child(c) {} 60 const Child* operator->() const {
|
/external/skia/src/gpu/ |
H A D | GrTLList.h | 47 GrTDLList<Child> fList; 50 class Child : public GrTLList::Entry<Child> { class in inherits:GrTLList::Entry
|
/external/compiler-rt/lib/asan/output_tests/ |
H A D | clone_test.cc | 9 int Child(void *arg) { function 11 printf("Child: %p\n", x); 20 pid_t clone_pid = clone(Child, sp, CLONE_FILES | CLONE_VM, NULL, 0, 0, 0);
|
/external/chromium/base/ |
H A D | template_util_unittest.cc | 16 class Child : public Parent {}; class in namespace:base::__anon1211 44 // EXPECT_TRUE( (is_convertible < Child), (Parent > ::value)); 47 EXPECT_TRUE( (is_convertible<Child, Parent>::value) ); 48 EXPECT_FALSE( (is_convertible<Parent, Child>::value) );
|
/external/llvm/lib/Object/ |
H A D | Archive.cpp | 79 Archive::Child Archive::Child::getNext() const { 90 return Child(Parent, StringRef(0, 0)); 95 return Child(Parent, StringRef(NextLoc, NextSize)); 98 error_code Archive::Child::getName(StringRef &Result) const { 141 uint64_t Archive::Child::getSize() const { 153 MemoryBuffer *Archive::Child::getBuffer() const { 167 error_code Archive::Child::getAsBinary(OwningPtr<Binary> &Result) const { 206 Child c(this, StringRef(Loc, Size)); 214 return Child(thi [all...] |
/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Object/ |
H A D | regress-137000.js | 108 * the parameter to both the Base and Child constructors, 114 function Child(id) class 118 Child.prototype=Base; 121 var c1 = new Child('child1');
|
/external/llvm/include/llvm/ADT/ |
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) 243 void printOneChild(raw_ostream &OS, Child Ptr, NodeKind Kind) const; 246 void printOneChildRepr(raw_ostream &OS, Child Ptr, 375 Child LHS, RHS; 482 Child NewLHS, NewRHS;
|
/external/clang/test/SemaCXX/ |
H A D | typo-correction.cpp | 168 class Child: public Parent {}; class in inherits:Parent 169 void Child::add_types(int value) {} // expected-error{{out-of-line definition of 'add_types' does not match any declaration in 'Child'}}
|
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcherOpt.cpp | 34 OwningPtr<Matcher> Child(Scope->takeChild(i)); 35 ContractNodes(Child, CGP); 36 Scope->resetChild(i, Child.take()); 192 OwningPtr<Matcher> Child(Scope->takeChild(i)); 193 SinkPatternPredicates(Child); 194 Scope->resetChild(i, Child.take()); 265 OwningPtr<Matcher> Child(Scope->takeChild(i)); 266 FactorNodes(Child); 268 if (Matcher *N = Child.take())
|
H A D | CodeGenDAGPatterns.cpp | 717 TreePatternNode *Child = P->getChild(i); local 718 if (!Child->isLeaf() && Child->getNumTypes() && 719 Child->getType(0) != MVT::Other) 720 Size += getPatternSize(Child, CGP); 721 else if (Child->isLeaf()) { 722 if (dynamic_cast<IntInit*>(Child->getLeafValue())) 724 else if (Child->getComplexPatternInfo(CGP)) 725 Size += getPatternSize(Child, CGP); 726 else if (!Child 1158 TreePatternNode *Child = getChild(i); local 1188 TreePatternNode *Child = getChild(i); local 1442 TreePatternNode *Child = getChild(i); local 1595 TreePatternNode *Child = getChild(ChildNo++); local 1904 TreePatternNode *Child = N->getChild(i); local 3192 TreePatternNode *Child = N->getChild(i); local [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DIE.h | 168 void addChild(DIE *Child) { argument 169 if (Child->getParent()) { 170 assert (Child->getParent() == this && "Unexpected DIE Parent!"); 174 Children.push_back(Child); 175 Child->Parent = this;
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 377 LoopT *Child = *I; local 378 assert(Child->ParentLoop == this && "Child is not a child of this loop!"); 380 Child->ParentLoop = 0; 381 return Child; 840 LoopT *Child = L->SubLoops[i]; local 841 assert(Child->getParentLoop() == L && "Not proper child loop?"); 843 if (LoopT *ContainingLoop = ContainingLoops[Child->getHeader()]) { 846 MoveSiblingLoopInto(Child, ContainingLoop); 852 for (unsigned b = 0, e = Child [all...] |
/external/llvm/lib/Support/ |
H A D | Twine.cpp | 58 void Twine::printOneChild(raw_ostream &OS, Child Ptr, 102 void Twine::printOneChildRepr(raw_ostream &OS, Child Ptr,
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
H A D | ANTLRBaseTreeAdaptor.h | 137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
H A D | ANTLRBaseTreeAdaptor.h | 137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
H A D | ANTLRBaseTreeAdaptor.h | 137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRCommonTreeAdaptor.h | 56 - (void) setChild:(ANTLRCommonTree *)t At:(NSInteger)i Child:(ANTLRCommonTree *)child;
|
H A D | ANTLRTreeAdaptor.h | 133 - (void) setChild:(id)aTree At:(NSInteger)index Child:(id)child;
|
H A D | ANTLRBaseTreeAdaptor.h | 130 - (void) setChild:(id<ANTLRBaseTree>)aTree At:(NSInteger)index Child:(id<ANTLRBaseTree>)aChild;
|
/external/tinyxml/ |
H A D | xmltest.cpp | 522 TiXmlText* text = docH.FirstChildElement( "document" ).FirstChildElement( (const char*) russianElementName ).Child( 0 ).Text(); 530 TiXmlDeclaration* dec = docH.Child( 0 ).Node()->ToDeclaration(); 879 TiXmlUnknown* unknown = docH.Child( 1 ).Unknown(); 882 TiXmlNode* node = docH.Child( 2 ).Node(); 898 TiXmlComment* comment = docH.Child( 0 ).Node()->ToComment(); 921 text = docH.FirstChildElement( "element" ).Child( 0 ).Text(); 926 text = docH.FirstChildElement( "element" ).Child( 0 ).Text(); 931 text = docH.FirstChildElement( "element" ).Child( 0 ).Text(); 937 text = docH.FirstChildElement( "element" ).Child( 0 ).Text(); 942 text = docH.FirstChildElement( "element" ).Child( [all...] |
/external/llvm/lib/Analysis/ |
H A D | RegionInfo.cpp | 314 if (Region* Child = getSubRegionNode(BB)) 315 return Child->getNode(); 363 Region *Region::removeSubRegion(Region *Child) { argument 364 assert(Child->parent == this && "Child is not a child of this region!"); 365 Child->parent = 0; 366 RegionSet::iterator I = std::find(children.begin(), children.end(), Child); 369 return Child;
|