Searched refs:child (Results 1 - 25 of 113) sorted by relevance

12345

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr60866.c9 int *child; local
15 for (child = *dn; child; child = xchild)
H A Dpr42245.c18 CON_list *child, *xchild; local
24 for (child = dn->cl; child != ((void *) 0); child = xchild)
H A Dpr24367.c5 test (const char *parent, const char *child) argument
10 const char *s2 = child;
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dassociated_target_4.f9011 class(node_type),pointer::parent,child
16 allocate(root%child)
17 root%child%parent=>root
19 root%child%id=2
20 print *,root%child%id," is child of ",root%id,":"
21 print *,root%child%parent%id,root%id
22 if (.not. associated(root%child%parent,root)) call abort()
H A Ddefined_assignment_3.f9016 type, extends(parent) :: child
31 type(child) :: infant0, infant1(2)
33 infant0 = child([component(1),component(2)], 99)
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/coarray/
H A Dalloc_comp_2.f9013 type, extends(parent) :: child
17 class(child) this
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/
H A Dftrapv-1.c24 pid_t child = fork (); local
26 if (child == 0)
31 else if (child == -1)
33 if (wait (&status) == child
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/
H A Dcrash3.C7 Node* child[2]; member in struct:Node
/haiku-buildtools/binutils/gprof/
H A Dsparc.c49 Sym *child; local
70 child = sym_lookup (&symtab, dest_pc);
71 if (child)
75 (unsigned long) dest_pc, child->name,
76 (unsigned long) child->addr));
77 if (child->addr == dest_pc)
80 arc_add (parent, child, (unsigned long) 0);
H A Daarch64.c52 Sym *child; local
77 child = sym_lookup (&symtab, dest_pc);
79 if (child)
83 (unsigned long) dest_pc, child->name,
84 (unsigned long) child->addr));
86 if (child->addr == dest_pc)
89 arc_add (parent, child, (unsigned long) 0);
H A Dcall_graph.c38 Sym *child;
41 child = sym_lookup (&symtab, self_pc);
43 if (child == NULL || parent == NULL)
47 child will probably point to line symbols instead of function
49 line number in the calling routing, but the child should always
55 while (child >= symtab.base && ! child->is_func)
56 --child;
58 if (child < symtab.base)
63 if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
37 Sym *child; local
[all...]
H A Di386.c53 Sym *child; local
76 child = sym_lookup (&symtab, destpc);
77 if (child && child->addr == destpc)
84 (unsigned long) destpc, child->name));
85 arc_add (parent, child, (unsigned long) 0);
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.
34 Sym *child; /* dest vertice of arc */
35 unsigned long count; /* # of calls from parent to child */
37 double child_time; /* child-time inherited along arc */
39 struct arc *next_child; /* next child of PARENT */
47 extern void arc_add (Sym * parent, Sym * child, unsigned long count);
48 extern Arc *arc_lookup (Sym * parent, Sym * child);
33 Sym *child; /* dest 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));
72 DBG (LOOKUPDEBUG, printf ("[arc_lookup]\t parent %s child %s\n",
73 arc->parent->name, arc->child->name));
74 if (child->addr >= arc->child->addr
75 && child
88 arc_add(Sym *parent, Sym *child, unsigned long count) argument
167 Sym *child; local
360 inherit_flags(Sym *child) argument
441 Sym *old_head, *child; local
[all...]
H A Dcg_dfn.c63 is_numbered (Sym *child) argument
65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
73 is_busy (Sym *child) argument
75 if (child->cg.top_order == DFN_NAN)
90 find_cycle (Sym *child) argument
100 if (child == head)
104 if (child->cg.cyc.head != child && child
[all...]
H A Dmips.c47 Sym *child; local
54 indirect_child.name = _("<indirect child>");
76 child = sym_lookup (&symtab, dest_pc);
77 if (child)
81 (unsigned long) dest_pc, child->name,
82 (unsigned long) child->addr));
83 if (child->addr == dest_pc)
87 arc_add (parent, child, (unsigned long) 0);
H A Dalpha.c97 Sym *child; local
102 indirect_child.name = _("<indirect child>");
150 child = sym_lookup (&symtab, dest_pc);
151 if (child)
155 (unsigned long) dest_pc, child->name,
156 (unsigned long) child->addr));
157 if (child->addr == dest_pc || child->addr == dest_pc - 8)
161 arc_add (parent, child, (unsigned long) 0);
/haiku-buildtools/legacy/binutils/gprof/
H A Dcall_graph.c38 Sym *child;
41 child = sym_lookup (&symtab, self_pc);
43 if (child == NULL || parent == NULL)
47 child will probably point to line symbols instead of function
49 line number in the calling routing, but the child should always
55 while (child >= symtab.base && ! child->is_func)
56 --child;
58 if (child < symtab.base)
63 if (sym_id_arc_is_present (&syms[INCL_ARCS], parent, child)
37 Sym *child; local
[all...]
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.
14 Sym *child; /* dest vertice of arc */ member in struct:arc
15 unsigned long count; /* # of calls from parent to child */
17 double child_time; /* child-time inherited along arc */
19 struct arc *next_child; /* next child of PARENT */
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));
72 DBG (LOOKUPDEBUG, printf ("[arc_lookup]\t parent %s child %s\n",
73 arc->parent->name, arc->child->name));
74 if (child->addr >= arc->child->addr
75 && child
88 arc_add(Sym *parent, Sym *child, unsigned long count) argument
167 Sym *child; local
360 inherit_flags(Sym *child) argument
441 Sym *old_head, *child; local
[all...]
H A Dcg_dfn.c63 is_numbered (Sym *child) argument
65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
73 is_busy (Sym *child) argument
75 if (child->cg.top_order == DFN_NAN)
90 find_cycle (Sym *child) argument
100 if (child == head)
104 if (child->cg.cyc.head != child && child
[all...]
H A Di386.c53 Sym *child; local
88 child = sym_lookup (&symtab, destpc);
89 if (child && child->addr == destpc)
96 (unsigned long) destpc, child->name));
97 arc_add (parent, child, (unsigned long) 0);
H A Dmips.c47 Sym *child; local
54 indirect_child.name = _("<indirect child>");
87 child = sym_lookup (&symtab, dest_pc);
90 (unsigned long) dest_pc, child->name,
91 (unsigned long) child->addr));
92 if (child->addr == dest_pc)
96 arc_add (parent, child, (unsigned long) 0);
H A Dsparc.c49 Sym *child; local
82 child = sym_lookup (&symtab, dest_pc);
85 (unsigned long) dest_pc, child->name,
86 (unsigned long) child->addr));
87 if (child->addr == dest_pc)
90 arc_add (parent, child, (unsigned long) 0);
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D920810-1.c8 t*child=(t*)malloc(size); local
9 memcpy(child,clas,clas->size);
10 child->super=clas;
11 child->name=0;
12 child->size=size;
13 return child;

Completed in 98 milliseconds

12345