Searched refs:parent (Results 1 - 25 of 248) sorted by relevance

12345678910

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dssa-vrp-thread-1.c17 build_omp_regions_1 (basic_block bb, struct omp_region *parent, argument
21 parent = parent->outer;
23 parent->cont = bb;
24 if (single_tree && !parent)
H A Dpr34244.c26 int parent = GetParent(); local
27 if (!parent)
29 anc1 = parent;
34 int parent = GetParent(); local
35 if (!parent)
37 anc2 = parent;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/
H A Dvtable2.C13 template <class T> struct parent { struct
15 { parent<inner<T> > p; };
18 template struct parent<int>;
H A Dptrmem11.C10 typedef the_base<derivedT<T> > parent; typedef in struct:derivedT
12 this->parent::template foo< &derivedT<T>::ice>();
H A Dspec22.C19 srp<int> parent; local
20 return parent; // { dg-error "is ambiguous" }
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/coarray/
H A Dalloc_comp_2.f9010 type parent type in module:parent_coarray_component
13 type, extends(parent) :: child
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/
H A Dinitlist78.C5 node &parent; member in struct:node
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dassociated_target_4.f9011 class(node_type),pointer::parent,child
17 root%child%parent=>root
21 print *,root%child%parent%id,root%id
22 if (.not. associated(root%child%parent,root)) call abort()
H A Ddefined_assignment_9.f9015 type parent type in module:m0
30 type(parent), allocatable :: left
31 type(parent) :: right
38 type(parent), allocatable :: left(:)
39 type(parent) :: right(5)
H A Dtypebound_operator_20.f9010 type parent type in module:overwrite
16 type, extends(parent) :: child
25 class(parent), intent(in) :: op1, op2
32 class(parent), intent(in) :: op2
42 type(parent) :: m1, m2
43 class(parent), pointer :: mres
45 class(parent), pointer :: hres
H A Dproc_ptr_comp_41.f907 TYPE :: parent type
10 TYPE, EXTENDS(parent) :: extension
20 CLASS(parent), INTENT(IN) :: arg
H A Ddefined_assignment_2.f9015 type parent type in module:m0
18 type, extends(parent) :: child
36 new_child%parent%foo1%i = 20
38 new_child%parent%foo1%j = [99,199]
53 if (infant0%parent%foo1%i .ne. 20) call abort
55 if (any (infant0%parent%foo1%j .ne. [99,199])) call abort
64 if (infant0%parent%foo1%i .ne. 40) call abort
65 if (any (infant0%parent%foo1%j .ne. [99,199,198,398])) call abort
H A Ddefined_assignment_8.f9020 type parent type in module:m0
34 type(parent), allocatable :: left
35 type(parent) :: right
H A Ddefined_assignment_3.f9013 type parent type in module:m0
16 type, extends(parent) :: child
34 if (any (infant0%parent%foo%i .ne. [20, 20])) call abort
H A Ddefined_assignment_10.f9015 type parent type in module:m0
29 type(parent), allocatable :: left
30 type(parent) :: right
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dnested-func-8.c32 parent (int nested_arg) function
37 return parent (zero (5));
49 return parent (arg);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr55789.C15 intrusive_ptr < section_info > parent; member in struct:section_info
20 intrusive_ptr < file_info > parent; member in struct:file_info
28 intrusive_ptr < file_info > parent; local
H A Dpr51737.C12 intrusive_ptr<file_info> parent; member in struct:file_info
16 intrusive_ptr<section_info> parent; member in struct:section_info
22 intrusive_ptr<file_info> parent; local
/haiku-buildtools/legacy/binutils/gprof/
H A Dcg_arcs.h7 * With pointers to the symbols of the parent and the child, a count
9 * parent of this child and the next child of this parent.
13 Sym *parent; /* source vertice of arc */ member in struct:arc
15 unsigned long count; /* # of calls from parent to child */
18 struct arc *next_parent; /* next parent of CHILD */
27 extern void arc_add (Sym * parent, Sym * child, unsigned long count);
28 extern Arc *arc_lookup (Sym * parent, Sym * child);
H A Dcg_arcs.c59 arc_lookup (Sym *parent, Sym *child) argument
63 if (!parent || !child)
65 printf ("[arc_lookup] parent == 0 || child == 0\n");
68 DBG (LOOKUPDEBUG, printf ("[arc_lookup] parent %s child %s\n",
69 parent->name, child->name));
70 for (arc = parent->cg.children; arc; arc = arc->next_child)
72 DBG (LOOKUPDEBUG, printf ("[arc_lookup]\t parent %s child %s\n",
73 arc->parent->name, arc->child->name));
88 arc_add (Sym *parent, Sym *child, unsigned long count) argument
94 count, parent
164 propagate_time(Sym *parent) argument
362 Sym *head, *parent, *member; local
597 Sym *parent, **time_sorted_syms, **top_sorted_syms; local
[all...]
H A Dcall_graph.c37 Sym *parent;
40 parent = sym_lookup (&symtab, from_pc);
43 if (child == NULL || parent == NULL)
46 /* If we're doing line-by-line profiling, both the parent and the
48 symbols. For the parent this is fine, since this identifies the
63 if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
65 && !sym_id_arc_is_present (&syms[EXCL_ARCS], parent, child)))
70 parent->name, child->name, count));
71 arc_add (parent, child, count);
118 || gmon_io_write_vma (ofp, arc->parent
36 Sym *parent; local
[all...]
/haiku-buildtools/binutils/gprof/
H A Dcg_arcs.h27 * With pointers to the symbols of the parent and the child, a count
29 * parent of this child and the next child of this parent.
33 Sym *parent; /* source vertice of arc */
35 unsigned long count; /* # of calls from parent to child */
38 struct arc *next_parent; /* next parent of CHILD */
47 extern void arc_add (Sym * parent, Sym * child, unsigned long count);
48 extern Arc *arc_lookup (Sym * parent, Sym * child);
32 Sym *parent; /* source vertice of arc */ member in struct:arc
H A Dcg_arcs.c59 arc_lookup (Sym *parent, Sym *child) argument
63 if (!parent || !child)
65 printf ("[arc_lookup] parent == 0 || child == 0\n");
68 DBG (LOOKUPDEBUG, printf ("[arc_lookup] parent %s child %s\n",
69 parent->name, child->name));
70 for (arc = parent->cg.children; arc; arc = arc->next_child)
72 DBG (LOOKUPDEBUG, printf ("[arc_lookup]\t parent %s child %s\n",
73 arc->parent->name, arc->child->name));
88 arc_add (Sym *parent, Sym *child, unsigned long count) argument
94 count, parent
164 propagate_time(Sym *parent) argument
362 Sym *head, *parent, *member; local
596 Sym *parent, **time_sorted_syms, **top_sorted_syms; local
[all...]
H A Dcall_graph.c37 Sym *parent;
40 parent = sym_lookup (&symtab, from_pc);
43 if (child == NULL || parent == NULL)
46 /* If we're doing line-by-line profiling, both the parent and the
48 symbols. For the parent this is fine, since this identifies the
63 if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
65 && !sym_id_arc_is_present (&syms[EXCL_ARCS], parent, child)))
70 parent->name, child->name, count));
71 arc_add (parent, child, count);
118 || gmon_io_write_vma (ofp, arc->parent
36 Sym *parent; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr53249.c7 struct gomp_task *parent; member in struct:gomp_task
25 thr->task = task->parent;

Completed in 125 milliseconds

12345678910