Searched refs:root (Results 1 - 25 of 431) sorted by relevance

1234567891011>>

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dassociated_target_4.f9014 class(node_type),pointer::root
15 allocate(root)
16 allocate(root%child)
17 root%child%parent=>root
18 root%id=1
19 root%child%id=2
20 print *,root%child%id," is child of ",root%id,":"
21 print *,root
[all...]
H A Dprivate_type_5.f9015 type(t) :: root local in subroutine:sub
16 call init(root, arg)
H A Dnull_3.f9013 TYPE(kd_tree_node) :: root component in type:kd_tree
/haiku-buildtools/legacy/binutils/gprof/
H A Dcg_dfn.h15 extern void cg_dfn (Sym * root);
/haiku-buildtools/binutils/gprof/
H A Dcg_dfn.h35 extern void cg_dfn (Sym * root);
/haiku-buildtools/gcc/gmp/mpz/
H A Droot.c1 /* mpz_root(root, u, nth) -- Set ROOT to floor(U^(1/nth)).
26 mpz_root (mpz_ptr root, mpz_srcptr u, unsigned long int nth) argument
38 /* root extraction interpreted as c^(1/nth) means a zeroth root should
45 if (root != NULL)
46 SIZ(root) = 0;
55 /* FIXME: Perhaps disallow root == NULL */
56 if (root != NULL && u != root)
57 rootp = MPZ_REALLOC (root, root
[all...]
H A Dsqrtrem.c1 /* mpz_sqrtrem(root,rem,x) -- Set ROOT to floor(sqrt(X)) and REM
31 mpz_sqrtrem (mpz_ptr root, mpz_ptr rem, mpz_srcptr op) argument
33 msqrt (mpz_srcptr op, mpz_ptr root, mpz_ptr rem)
48 SIZ(root) = 0;
56 /* The size of the root is accurate after this simple calculation. */
59 root_ptr = root->_mp_d;
62 if (root->_mp_alloc < root_size)
67 free_me_size = root->_mp_alloc;
70 (*__gmp_free_func) (root_ptr, root->_mp_alloc * BYTES_PER_MP_LIMB);
72 root
[all...]
H A Drootrem.c1 /* mpz_rootrem(root, rem, u, nth) -- Set ROOT to floor(U^(1/nth)) and
26 mpz_rootrem (mpz_ptr root, mpz_ptr rem, mpz_srcptr u, unsigned long int nth) argument
38 /* root extraction interpreted as c^(1/nth) means a zeroth root should
45 if (root != NULL)
46 SIZ(root) = 0;
56 /* FIXME: Perhaps disallow root == NULL */
57 if (root != NULL && u != root)
58 rootp = MPZ_REALLOC (root, root
[all...]
H A Dsqrt.c1 /* mpz_sqrt(root, u) -- Set ROOT to floor(sqrt(U)).
26 mpz_sqrt (mpz_ptr root, mpz_srcptr op) argument
40 SIZ(root) = 0;
44 /* The size of the root is accurate after this simple calculation. */
47 root_ptr = root->_mp_d;
50 if (root->_mp_alloc < root_size)
55 free_me_size = root->_mp_alloc;
58 (*__gmp_free_func) (root_ptr, root->_mp_alloc * BYTES_PER_MP_LIMB);
60 root->_mp_alloc = root_size;
62 root
[all...]
/haiku-buildtools/cloog/examples/example/
H A Dexample.c15 struct clast_stmt *root; local
21 root = cloog_clast_create_from_input(input, options);
22 clast_pprint(stdout, root, 0, options);
24 cloog_clast_free(root);
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/asan/
H A Dpr62089.c20 struct path root, pwd; member in struct:fs_struct
25 a->root = b->root;
32 __asan_poison_memory_region (&a.root, sizeof (a.root));
/haiku-buildtools/gcc/libgomp/
H A Dsplay-tree.c75 if (sp->root == NULL)
82 n = sp->root;
105 rotate_left (&sp->root, n, c);
107 rotate_right (&sp->root, n, c);
115 rotate_left (&sp->root, n, n->left);
120 rotate_right (&sp->root, n, n->right);
125 rotate_left (&sp->root, n, n->left);
130 rotate_right (&sp->root, n, n->right);
144 if (sp->root)
145 comparison = splay_compare (&sp->root
[all...]
/haiku-buildtools/legacy/binutils/bfd/
H A Di386linux.c155 struct aout_link_hash_entry root;
160 struct aout_link_hash_table root;
235 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
248 return &ret->root.root;
255 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
262 (&(table)->root, \
376 && (h->root.root.type == bfd_link_hash_defined
377 || h->root
154 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
159 struct aout_link_hash_table root; member in struct:linux_link_hash_table
[all...]
H A Dm68klinux.c156 struct aout_link_hash_entry root;
161 struct aout_link_hash_table root;
239 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
252 return &ret->root.root;
259 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
266 (&(table)->root, \
380 && (h->root.root.type == bfd_link_hash_defined
381 || h->root
155 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
160 struct aout_link_hash_table root; member in struct:linux_link_hash_table
[all...]
H A Dsparclinux.c155 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
160 struct aout_link_hash_table root; member in struct:linux_link_hash_table
235 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
248 return &ret->root.root;
255 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
262 (&(table)->root, \
376 && (h->root.root.type == bfd_link_hash_defined
377 || h->root
[all...]
H A Dgenlink.h43 struct bfd_link_hash_entry root; member in struct:generic_link_hash_entry
54 struct bfd_link_hash_table root; member in struct:generic_link_hash_table
61 bfd_link_hash_lookup (&(table)->root, (string), (create), (copy), (follow)))
67 (&(table)->root, \
/haiku-buildtools/binutils/bfd/
H A Di386linux.c149 struct aout_link_hash_entry root;
154 struct aout_link_hash_table root;
209 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
217 return &ret->root.root;
224 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
231 (&(table)->root, \
340 && (h->root.root.type == bfd_link_hash_defined
341 || h->root
148 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
153 struct aout_link_hash_table root; member in struct:linux_link_hash_table
[all...]
H A Dm68klinux.c148 struct aout_link_hash_entry root;
153 struct aout_link_hash_table root;
211 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
219 return &ret->root.root;
226 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
233 (&(table)->root, \
342 && (h->root.root.type == bfd_link_hash_defined
343 || h->root
147 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
152 struct aout_link_hash_table root; member in struct:linux_link_hash_table
[all...]
H A Dsparclinux.c143 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry
148 struct aout_link_hash_table root; member in struct:linux_link_hash_table
204 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
212 return &ret->root.root;
219 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
226 (&(table)->root, \
335 && (h->root.root.type == bfd_link_hash_defined
336 || h->root
[all...]
H A Dgenlink.h44 struct bfd_link_hash_entry root; member in struct:generic_link_hash_entry
55 struct bfd_link_hash_table root; member in struct:generic_link_hash_table
62 bfd_link_hash_lookup (&(table)->root, (string), (create), (copy), (follow)))
68 (&(table)->root, \
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/issue4879.dir/
H A Da.go8 root unsafe.Pointer
19 root: unsafe.Pointer(&nodeLoc{}),
25 root: unsafe.Pointer(&slice{}),
30 root: unsafe.Pointer(&maptype{}),
/haiku-buildtools/cloog/include/cloog/
H A Dpprint.h60 void clast_pprint(FILE *foo, struct clast_stmt *root, int indent,
/haiku-buildtools/gcc/gcc/
H A Dtree-phinodes.h46 struct phi_arg_d *element, *root; local
57 root = gimple_phi_arg (phi, 0);
58 index = element - root;
62 gcc_checking_assert ((((char *)element - (char *)root)
/haiku-buildtools/binutils/libiberty/
H A Dsplay-tree.c141 if (sp->root == 0)
148 n = sp->root;
171 rotate_left (&sp->root, n, c);
173 rotate_right (&sp->root, n, c);
181 rotate_left (&sp->root, n, n->left);
186 rotate_right (&sp->root, n, n->right);
191 rotate_left (&sp->root, n, n->left);
196 rotate_right (&sp->root, n, n->right);
337 sp->root = 0;
353 splay_tree_delete_helper (sp, sp->root);
[all...]
/haiku-buildtools/gcc/libiberty/
H A Dsplay-tree.c141 if (sp->root == 0)
148 n = sp->root;
171 rotate_left (&sp->root, n, c);
173 rotate_right (&sp->root, n, c);
181 rotate_left (&sp->root, n, n->left);
186 rotate_right (&sp->root, n, n->right);
191 rotate_left (&sp->root, n, n->left);
196 rotate_right (&sp->root, n, n->right);
337 sp->root = 0;
353 splay_tree_delete_helper (sp, sp->root);
[all...]

Completed in 143 milliseconds

1234567891011>>