| /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) );
|
| bind_unittest.cc | 68 class Child : public Parent {
274 Child child; local
275 child.value = 0;
276 Closure virtual_set_cb = Bind(&Parent::VirtualSet, &child);
278 EXPECT_EQ(kChildValue, child.value);
280 child.value = 0;
281 Closure non_virtual_set_cb = Bind(&Parent::NonVirtualSet, &child);
283 EXPECT_EQ(kParentValue, child.value);
577 // const Child* const_child_ptr
[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/skia/src/gpu/ |
| GrTLList.h | 47 GrTDLList<Child> fList;
50 class Child : public GrTLList::Entry<Child> {
|
| GrRedBlackTree.h | 137 enum Child {
165 // node may be in an intermediate state where a red parent has a red child.
356 Child pc = kLeft_Child; // suppress uninit warning
357 Child gpc = kLeft_Child;
405 // gp must be black since it's child, p, is red.
462 // gp's child, u, that is not affected we know to be black. gp's new
463 // child is p's previous child (x's pre-rotation sibling) which must be
469 // preserved and removes the red/red parent child relationship.
498 Child c = d->fChildren[kLeft_Child] == n ? kLeft_Child
[all...] |
| /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/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/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'}}
|
| warn-thread-safety-analysis.cpp | 1109 class Child : public Base {
1116 Child *c;
1265 void Func(Foo* child) LOCKS_EXCLUDED(lock_) {
1270 child->Func(new_foo); // There shouldn't be any warning here as the
1271 // acquired lock is not in child.
1272 child->bar(7); // expected-warning {{calling function 'bar' requires exclusive lock on 'lock_'}}
1273 child->a_ = 5; // expected-warning {{writing variable 'a_' requires locking 'lock_' exclusively}}
1285 Foo *child = new Foo; local
1286 x->Func(child);
1300 void Func(Foo* child) LOCKS_EXCLUDED(lock_)
1326 Foo *child = new Foo; local
[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/llvm/utils/TableGen/ |
| DAGISelMatcherEmitter.cpp | 162 // We need to encode the child and the offset of the failure code before
165 // children depends on the VBR size of the child, so for large children we
180 assert(ChildSize != 0 && "Should not have a zero-sized child!");
287 const Matcher *Child;
290 Child = SOM->getCaseMatcher(i);
293 Child = cast<SwitchTypeMatcher>(N)->getCaseMatcher(i);
300 // children depends on the VBR size of the child, so for large children we
311 ChildSize = EmitMatcherList(Child, Indent+1, CurrentIdx+VBRSize+IdxSize,
315 assert(ChildSize != 0 && "Should not have a zero-sized child!");
|
| DAGISelMatcherGen.cpp | 318 // the child numbers of the node are all offset by one.
359 // If it *is* an immediate child of the root, we can still need a check if
400 // Get the code suitable for matching this child. Move to the child, check
735 const TreePatternNode *Child = N->getChild(ChildNo);
740 EmitResultOperand(Child, InstOps);
745 if (!Child->isLeaf() && Child->getOperator()->isSubClassOf("Instruction"))
[all...] |
| 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/ |
| MachineCSE.cpp | 575 MachineDomTreeNode *Child = Children[i];
576 ParentMap[Child] = Node;
577 WorkList.push_back(Child);
|
| MachineLICM.cpp | 725 // the first child of this node. This means we ultimately traverse the
728 MachineDomTreeNode *Child = Children[i];
729 ParentMap[Child] = Node;
730 WorkList.push_back(Child);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 240 // If this is really a nested loop, rip it out into a child loop. Don't do
345 DomTreeNode *Child = Children.front();
346 DT->changeImmediateDominator(Child, Node->getIDom());
584 // Change the parent loop to use the outer loop as its child now.
|
| /external/tinyxml/ |
| 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...] |
| 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...] |
| /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...] |
| Dominators.h | 129 // I am no longer your child...
479 /// creates a new node as a child of DomBB dominator node,linking it into
519 // I am no longer your child...
608 // Otherwise, recursively visit this child.
609 DomTreeNodeBase<NodeT> *Child = *ChildIt;
612 WorkStack.push_back(std::make_pair(Child, Child->begin()));
613 Child->DFSNumIn = DFSNum++;
632 // Add a new tree node for this BasicBlock, and link it as a child of
813 /// creates a new node as a child of DomBB dominator node,linking it int
[all...] |
| /external/webkit/Source/WebCore/css/ |
| CSSSelector.h | 108 Child,
|
| /external/clang/lib/AST/ |
| Expr.cpp | [all...] |
| /external/clang/lib/Sema/ |
| SemaDeclCXX.cpp | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant.jar | |
