| /external/valgrind/main/none/tests/ |
| mmap_fcntl_bug.stderr.exp | 0 Child exited with zero (TEST PASSED).
|
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 25 Child[] children = new Child[16];
28 * Looks up a child by name and creates a new one if necessary.
34 Child current = children[index];
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
42 Child previous;
47 // We already have a child with that name.
55 // Add a new child to the bucket.
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
63 * Looks up a child by name
[all...] |
| /external/skia/src/gpu/ |
| GrTLList.h | 47 GrTDLList<Child> fList;
50 class Child : public GrTLList::Entry<Child> {
|
| /external/llvm/include/llvm/Object/ |
| Archive.h | 27 class Child {
32 Child(const Archive *p, StringRef d) : Parent(p), Data(d) {}
34 bool operator ==(const Child &other) const {
38 bool operator <(const Child &other) const {
42 Child getNext() const;
56 Child child; member in class:llvm::object::Archive::child_iterator
58 child_iterator() : child(Child(0, StringRef())) {}
59 child_iterator(const Child &c) : child(c) {
[all...] |
| /external/compiler-rt/lib/asan/output_tests/ |
| clone_test.cc | 9 int Child(void *arg) {
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/ |
| template_util_unittest.cc | 16 class Child : public Parent {};
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/ |
| 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(this, StringRef(0, 0))
[all...] |
| /external/llvm/include/llvm/ADT/ |
| Twine.h | 65 /// - If a Twine has another Twine as a child, that child should always be
133 union Child
152 Child LHS;
155 Child RHS;
179 explicit Twine(Child _LHS, NodeKind _LHSKind,
180 Child _RHS, NodeKind _RHSKind)
225 // A twine child should always be binary.
242 /// printOneChild - Print one child from a twine.
243 void printOneChild(raw_ostream &OS, Child Ptr, NodeKind Kind) const
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Object/ |
| regress-137000.js | 76 * to chain constructors from child to parent.
108 * the parameter to both the Base and Child constructors,
114 function Child(id)
118 Child.prototype=Base;
121 var c1 = new Child('child1');
|
| /external/clang/test/SemaCXX/ |
| typo-correction.cpp | 168 class Child: public 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/ |
| 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())
|
| CodeGenDAGPatterns.cpp | 597 /// Find dependent variables within child patterns
717 TreePatternNode *Child = P->getChild(i);
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)
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.h | 166 /// addChild - Add a child to the DIE.
168 void addChild(DIE *Child) {
169 if (Child->getParent()) {
170 assert (Child->getParent() == this && "Unexpected DIE Parent!");
174 Children.push_back(Child);
175 Child->Parent = this;
|
| /frameworks/compile/slang/ |
| slang_rs_ast_replace.cpp | 71 if (clang::Stmt *Child = *I) {
72 if (!matchesStmt(Child)) {
73 Visit(Child);
|
| /external/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 350 /// This updates the loop depth of the new child.
363 /// addChildLoop - Add the specified loop to be a child of this loop. This
364 /// updates the loop depth of the new child.
372 /// removeChildLoop - This removes the specified child from being a subloop of
377 LoopT *Child = *I;
378 assert(Child->ParentLoop == this && "Child is not a child of this loop!");
380 Child->ParentLoop = 0;
381 return Child;
[all...] |
| /external/llvm/lib/Support/ |
| 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/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| ANTLRBaseTreeAdaptor.h | 79 /** Add a child to the tree t. If child is a flat tree (a list), make all
80 * in list children of t. Warning: if t has no children, but child does
81 * and child isNil then you can decide it is ok to move children to t via
82 * t.children = child.children; i.e., without copying the array. Just
89 * If not a nil root, make oldRoot a child of newRoot.
94 * If newRoot is a nil-rooted single child tree, use the single
95 * child as the new root node.
106 * simple node or nil root with a single child node--it must be a root
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRCommonTreeAdaptor.h | 56 - (void) setChild:(ANTLRCommonTree *)t At:(NSInteger)i Child:(ANTLRCommonTree *)child;
|
| ANTLRTreeAdaptor.h | 66 /** Is tree considered a nil node used to make lists of child nodes? */
70 - (void) addChild:(id)child toTree:(id)aTree;
73 * If not a nil root, make oldRoot a child of newRoot.
78 * If newRoot is a nil-rooted single child tree, use the single
79 * child as the new root node.
90 * simple node or nil root with a single child node--it must be a root
130 /** Get a child 0..n-1 node */
132 /** Set ith child (0..n-1) to t; t must be non-null and non-nil node */
133 - (void) setChild:(id)aTree At:(NSInteger)index Child:(id)child;
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/api/contextMenus/basic/ |
| sample.js | 27 {"title": "Child 1", "parentId": parent, "onclick": genericOnClick});
29 {"title": "Child 2", "parentId": parent, "onclick": genericOnClick});
|
| /external/tinyxml/ |
| xmltest.cpp | 160 // It is a child of the document, and can be selected by name.
182 // a particular child.
222 // And add the node to the existing list after the first child.
261 XmlTest( "First child exists & is a comment.", true, ( node != 0 && node->ToComment() ) );
267 XmlTest ( "First child exists.", true, ( node != 0 && node->ToText() ) );
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()
[all...] |
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 66 // Only clean the cache for this Region. Caches of child Regions will be
67 // cleaned when the child Regions are deleted.
314 if (Region* Child = getSubRegionNode(BB))
315 return Child->getNode();
363 Region *Region::removeSubRegion(Region *Child) {
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);
[all...] |
