HomeSort by relevance Sort by last modified time
    Searched defs:Child (Results 1 - 25 of 104) sorted by null

1 2 3 4 5

  /external/compiler-rt/test/asan/TestCases/Windows/
wrong_downcast_on_heap.cc 9 class Child : public Parent {
16 Child *c = (Child*)p; // Intentional error here!
wrong_downcast_on_stack.cc 9 class Child : public Parent {
16 Child *c = (Child*)&p; // Intentional error here!
  /external/compiler-rt/test/esan/TestCases/
large-stack-linux.c 33 pid_t Child = fork();
34 assert(Child >= 0);
35 if (Child > 0) {
36 pid_t WaitRes = waitpid(Child, NULL, 0);
37 assert(WaitRes == Child);
50 fprintf(stderr, "Testing child with infinite stack\n");
52 fprintf(stderr, "Testing child with 1TB stack\n");
57 // CHECK: Testing child with infinite stack
64 // CHECK: Testing child with 1TB stack
  /external/testng/src/test/java/test/failures/
Child.java 5 public class Child extends Base1 {
  /external/compiler-rt/test/asan/TestCases/Linux/
clone_test.cc 17 int Child(void *arg) {
19 printf("Child: %p\n", x);
28 pid_t clone_pid = clone(Child, sp, CLONE_FILES | CLONE_VM, NULL);
36 // Make sure the child stack was indeed unpoisoned.
swapcontext_test.cc 34 void Child(int mode) {
36 printf("Child: %p\n", x);
50 printf("Child stack: %p\n", child_stack);
51 // Setup child context.
58 makecontext(&child_context, (void (*)())Child, 1, mode);
swapcontext_annotation.cc 62 void Child(int mode) {
66 printf("Child: %p\n", x);
98 printf("Child stack: %p\n", child_stack);
99 // Setup child context.
106 makecontext(&child_context, (void (*)())Child, 1, mode);
  /external/compiler-rt/test/lsan/TestCases/
swapcontext.cc 19 void Child() {
21 printf("Child: %p\n", &child_stack);
30 printf("Child stack: %p\n", child_stack);
37 makecontext(&child_context, Child, 0);
  /external/llvm/include/llvm/DebugInfo/PDB/
ConcreteSymbolEnumerator.h 33 std::unique_ptr<PDBSymbol> Child = Enumerator->getChildAtIndex(Index);
34 return make_concrete_child(std::move(Child));
38 std::unique_ptr<PDBSymbol> Child = Enumerator->getNext();
39 return make_concrete_child(std::move(Child));
51 make_concrete_child(std::unique_ptr<PDBSymbol> Child) const {
52 ChildType *ConcreteChild = dyn_cast_or_null<ChildType>(Child.release());
  /hardware/interfaces/tests/inheritance/1.0/default/
Child.h 23 struct Child : public IChild {
  /external/clang/test/Analysis/inlining/
dyn-dispatch-bifurcate.cpp 28 class Child : public Parent {
34 Child *b = reinterpret_cast<Child *>(a);
  /external/libcxxabi/test/
inherited_exception.pass.cpp 30 // Clang emits warnings about exceptions of type 'Child' being caught by
47 struct Child : public Base, public Base2 {
52 Child child; local
53 child.b1 = 10;
54 child.b2 = 11;
55 child.c = 12;
56 throw child;
60 Child child; local
68 static Child child; local
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Object/
Archive.h 26 class Child {
31 Child(const Archive *p, StringRef d) : Parent(p), Data(d) {}
33 bool operator ==(const Child &other) const {
37 Child getNext() const;
51 Child child; member in class:llvm::object::Archive::child_iterator
53 child_iterator(const Child &c) : child(c) {}
54 const Child* operator->() const {
55 return &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...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
inherited_exception.pass.cpp 38 struct Child : public Base, public Base2 {
43 Child child; local
44 child.b1 = 10;
45 child.b2 = 11;
46 child.c = 12;
47 throw child;
51 Child child; local
52 child.b1 = 10
59 static Child child; local
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++abi/test/
inherited_exception.pass.cpp 38 struct Child : public Base, public Base2 {
43 Child child; local
44 child.b1 = 10;
45 child.b2 = 11;
46 child.c = 12;
47 throw child;
51 Child child; local
52 child.b1 = 10
59 static Child child; local
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Isa/IsaBusDxe/
IsaBusDxe.c 22 Tests to see if this driver supports a given controller. If a child device is provided,
23 it further tests to see if this driver supports creating a handle for the specified child device.
33 by ControllerHandle and the child controller specified
107 Creates a child handle and installs a protocol.
114 @param ChildHandle Pointer to the handle of the child to create. If it is NULL,
121 the child
122 @retval other The child handle was not created
135 ISA_BUS_CHILD_PRIVATE_DATA *Child;
139 Child = AllocateCopyPool (sizeof (mIsaBusChildPrivateTemplate), &mIsaBusChildPrivateTemplate);
140 if (Child == NULL) {
    [all...]
  /external/clang/test/CodeGenCXX/
microsoft-abi-methods.cpp 68 class Child: public Base { };
71 Child c;
72 // Make sure that the Base constructor call in the Child constructor uses
74 // CHECK: define linkonce_odr x86_thiscallcc %class.Child* @"\01??0Child@@QAE@XZ"
81 // Make sure that the Base destructor call in the Child denstructor uses
83 // CHECK: define linkonce_odr x86_thiscallcc void @"\01??1Child@@QAE@XZ"
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
sparsetree.go 13 child *Block
65 n.sibling = t[p.ID].child
66 t[p.ID].child = b
88 if c0 := t[b.ID].child; c0 != nil {
116 // two node tree, Root->Child, call with n=1
118 // entry=5 Child exit=8
135 for c := t[b.ID].child; c != nil; c = t[c.ID].sibling {
148 // order chosen. Because the Child-Sibling order is used
156 // Child returns a child of x in the dominator tree, o
    [all...]
  /prebuilts/go/darwin-x86/src/go/types/
scope.go 65 // Child returns the i'th child scope for 0 <= i < NumChildren().
66 func (s *Scope) Child(i int) *Scope { return s.children[i] }
127 // Innermost returns the innermost (child) scope containing
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
sparsetree.go 13 child *Block
65 n.sibling = t[p.ID].child
66 t[p.ID].child = b
88 if c0 := t[b.ID].child; c0 != nil {
116 // two node tree, Root->Child, call with n=1
118 // entry=5 Child exit=8
135 for c := t[b.ID].child; c != nil; c = t[c.ID].sibling {
148 // order chosen. Because the Child-Sibling order is used
156 // Child returns a child of x in the dominator tree, o
    [all...]
  /prebuilts/go/linux-x86/src/go/types/
scope.go 65 // Child returns the i'th child scope for 0 <= i < NumChildren().
66 func (s *Scope) Child(i int) *Scope { return s.children[i] }
127 // Innermost returns the innermost (child) scope containing
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_mutants.py 165 class Child:
182 self.a = Child(self)
  /device/linaro/bootloader/edk2/OvmfPkg/XenBusDxe/
XenBus.c 81 XENBUS_PRIVATE_DATA *Child;
92 Child = XENBUS_PRIVATE_DATA_FROM_LINK (Entry);
93 if (!AsciiStrCmp (Child->XenBusIo.Node, Node)) {
94 Result = Child;
147 XENBUS_PRIVATE_DATA *Child;
151 Child = XenBusDeviceInitialized (Dev, DevicePath);
152 if (Child != NULL) {
216 DEBUG ((EFI_D_ERROR, "open by child controller fail (%r)\n",
  /external/mockito/src/test/java/org/mockitousage/matchers/
ReflectionMatchersTest.java 29 class Child extends Parent {
32 public Child(int parentField, String protectedParentField, int childFieldOne, Object childFieldTwo) {
40 void run(Child child);
49 Child actual = new Child(1, "foo", 2, "bar");
55 Child wanted = new Child(1, "foo", 2, "bar");
61 Child wanted = new Child(1, "foo", 2, "bar XXX")
    [all...]

Completed in 995 milliseconds

1 2 3 4 5