Searched refs:splay_tree_key (Results 1 - 25 of 35) sorted by relevance

12

/haiku-buildtools/legacy/gcc/include/
H A Dsplay-tree.h43 typedef unsigned long int splay_tree_key; typedef
51 typedef int (*splay_tree_compare_fn) PARAMS((splay_tree_key, splay_tree_key));
55 typedef void (*splay_tree_delete_key_fn) PARAMS((splay_tree_key));
68 splay_tree_key key;
99 splay_tree_key,
103 splay_tree_key));
107 extern int splay_tree_compare_ints PARAMS((splay_tree_key,
108 splay_tree_key));
109 extern int splay_tree_compare_pointers PARAMS((splay_tree_key,
[all...]
/haiku-buildtools/legacy/binutils/include/
H A Dsplay-tree.h47 typedef unsigned long int splay_tree_key; typedef
55 typedef int (*splay_tree_compare_fn) (splay_tree_key, splay_tree_key);
59 typedef void (*splay_tree_delete_key_fn) (splay_tree_key);
84 splay_tree_key GTY ((use_param1)) key;
128 splay_tree_key,
130 extern void splay_tree_remove (splay_tree, splay_tree_key);
131 extern splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);
132 extern splay_tree_node splay_tree_predecessor (splay_tree, splay_tree_key);
133 extern splay_tree_node splay_tree_successor (splay_tree, splay_tree_key);
[all...]
/haiku-buildtools/gcc/include/
H A Dsplay-tree.h51 typedef uintptr_t splay_tree_key; typedef
59 typedef int (*splay_tree_compare_fn) (splay_tree_key, splay_tree_key);
63 typedef void (*splay_tree_delete_key_fn) (splay_tree_key);
87 splay_tree_key key;
141 splay_tree_key,
143 extern void splay_tree_remove (splay_tree, splay_tree_key);
144 extern splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);
145 extern splay_tree_node splay_tree_predecessor (splay_tree, splay_tree_key);
146 extern splay_tree_node splay_tree_successor (splay_tree, splay_tree_key);
[all...]
/haiku-buildtools/binutils/include/
H A Dsplay-tree.h50 typedef uintptr_t splay_tree_key; typedef
58 typedef int (*splay_tree_compare_fn) (splay_tree_key, splay_tree_key);
62 typedef void (*splay_tree_delete_key_fn) (splay_tree_key);
86 splay_tree_key key;
140 splay_tree_key,
142 extern void splay_tree_remove (splay_tree, splay_tree_key);
143 extern splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);
144 extern splay_tree_node splay_tree_predecessor (splay_tree, splay_tree_key);
145 extern splay_tree_node splay_tree_successor (splay_tree, splay_tree_key);
[all...]
/haiku-buildtools/gcc/libgomp/
H A Dsplay-tree.h34 typedef struct splay_tree_key_s *splay_tree_key;
62 extern splay_tree_key splay_tree_lookup (splay_tree, splay_tree_key);
64 extern void splay_tree_remove (splay_tree, splay_tree_key);
H A Dsplay-tree.c42 extern int splay_compare (splay_tree_key, splay_tree_key);
73 splay_tree_splay (splay_tree sp, splay_tree_key key)
174 splay_tree_remove (splay_tree sp, splay_tree_key key)
208 attribute_hidden splay_tree_key
209 splay_tree_lookup (splay_tree sp, splay_tree_key key)
H A Doacc-mem.c40 static splay_tree_key
44 splay_tree_key key;
61 static splay_tree_key
87 splay_tree_key k = &t->array[i].key;
121 splay_tree_key k;
174 splay_tree_key n;
200 splay_tree_key n;
225 splay_tree_key n;
302 splay_tree_key n = lookup_host (acc_dev, h, 1);
354 splay_tree_key
[all...]
H A Dtarget.c96 splay_compare (splay_tree_key x, splay_tree_key y)
143 gomp_map_vars_existing (struct gomp_device_descr *devicep, splay_tree_key oldn,
144 splay_tree_key newn, unsigned char kind)
209 splay_tree_key n = splay_tree_lookup (mem_map, &cur_node);
291 splay_tree_key k = &array->key;
297 splay_tree_key n = splay_tree_lookup (mem_map, k);
557 splay_tree_key k = tgt->list[i];
594 splay_tree_key k = tgt->list[i];
634 splay_tree_key
[all...]
H A Dlibgomp.h637 typedef struct splay_tree_key_s *splay_tree_key; typedef in typeref:struct:splay_tree_key_s
660 splay_tree_key list[];
H A Doacc-parallel.c69 splay_tree_key tgt_fn_key;
/haiku-buildtools/legacy/gcc/libiberty/
H A Dsplay-tree.c41 splay_tree_key));
44 splay_tree_key,
80 splay_tree_key key;
191 splay_tree_key key;
264 splay_tree_key key;
316 splay_tree_key key;
344 splay_tree_key k1;
345 splay_tree_key k2;
359 splay_tree_key k1;
360 splay_tree_key k
[all...]
/haiku-buildtools/gcc/gcc/
H A Dtyped-splay-tree.h83 splay_tree_node node = splay_tree_lookup (m_inner, (splay_tree_key)key);
94 splay_tree_node node = splay_tree_predecessor (m_inner, (splay_tree_key)key);
105 splay_tree_node node = splay_tree_successor (m_inner, (splay_tree_key)k);
119 (splay_tree_key)key,
H A Dgimplify.c374 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
1103 (splay_tree_key) t) == NULL))
5566 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5662 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5745 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5763 n = splay_tree_lookup (octx->variables, (splay_tree_key)decl);
5769 splay_tree_insert (octx->variables, (splay_tree_key)decl, 0);
5772 splay_tree_insert (octx->variables, (splay_tree_key)decl2, 0);
5777 n = splay_tree_lookup (ctx->variables, (splay_tree_key)dec
[all...]
H A Dtree-dump.c78 dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
116 n = splay_tree_lookup (di->nodes, (splay_tree_key) t);
H A Domp-low.c976 n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var);
986 (splay_tree_key) var);
994 n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var);
1002 n = splay_tree_lookup (ctx->reduction_map, (splay_tree_key) id);
1011 n = splay_tree_lookup (ctx->reduction_map, (splay_tree_key) var);
1231 || !splay_tree_lookup (ctx->field_map, (splay_tree_key) var));
1233 || !splay_tree_lookup (ctx->sfield_map, (splay_tree_key) var));
1293 (splay_tree_key) DECL_ABSTRACT_ORIGIN (t),
1303 splay_tree_insert (ctx->field_map, (splay_tree_key) var,
1306 splay_tree_insert (ctx->sfield_map, (splay_tree_key) va
[all...]
/haiku-buildtools/binutils/libiberty/
H A Dsplay-tree.c46 static void splay_tree_splay (splay_tree, splay_tree_key);
68 node->key = (splay_tree_key)pending;
90 active->left->key = (splay_tree_key)pending;
97 active->right->key = (splay_tree_key)pending;
139 splay_tree_splay (splay_tree sp, splay_tree_key key)
362 splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value)
414 splay_tree_remove (splay_tree sp, splay_tree_key key)
454 splay_tree_lookup (splay_tree sp, splay_tree_key key)
500 splay_tree_predecessor (splay_tree sp, splay_tree_key key)
531 splay_tree_successor (splay_tree sp, splay_tree_key ke
[all...]
/haiku-buildtools/gcc/libiberty/
H A Dsplay-tree.c46 static void splay_tree_splay (splay_tree, splay_tree_key);
68 node->key = (splay_tree_key)pending;
90 active->left->key = (splay_tree_key)pending;
97 active->right->key = (splay_tree_key)pending;
139 splay_tree_splay (splay_tree sp, splay_tree_key key)
362 splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value)
414 splay_tree_remove (splay_tree sp, splay_tree_key key)
454 splay_tree_lookup (splay_tree sp, splay_tree_key key)
500 splay_tree_predecessor (splay_tree sp, splay_tree_key key)
531 splay_tree_successor (splay_tree sp, splay_tree_key ke
[all...]
/haiku-buildtools/legacy/binutils/libiberty/
H A Dsplay-tree.c45 static void splay_tree_splay (splay_tree, splay_tree_key);
67 node->key = (splay_tree_key)pending;
89 active->left->key = (splay_tree_key)pending;
96 active->right->key = (splay_tree_key)pending;
138 splay_tree_splay (splay_tree sp, splay_tree_key key)
295 splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value)
347 splay_tree_remove (splay_tree sp, splay_tree_key key)
387 splay_tree_lookup (splay_tree sp, splay_tree_key key)
433 splay_tree_predecessor (splay_tree sp, splay_tree_key key)
464 splay_tree_successor (splay_tree sp, splay_tree_key ke
[all...]
/haiku-buildtools/gcc/gcc/fortran/
H A Dconstructor.c152 node = splay_tree_insert (*base, (splay_tree_key) n, (splay_tree_value) c);
181 node = splay_tree_lookup (base, (splay_tree_key) offset);
187 node = splay_tree_predecessor (base, (splay_tree_key) offset);
272 node = splay_tree_successor (base, (splay_tree_key) offset);
H A Ddata.c363 && node->key == (splay_tree_key)
372 node->key = (splay_tree_key) mpz_get_si (end);
/haiku-buildtools/gcc/gcc/cp/
H A Dcp-gimplify.c812 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
856 (splay_tree_key) decl);
868 n = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
897 splay_tree_insert (omp_ctx->variables, (splay_tree_key) decl, flags);
1099 (splay_tree_key) decl);
1102 (splay_tree_key) decl,
1191 n = splay_tree_lookup (omp_ctx.variables, (splay_tree_key) decl);
1194 splay_tree_insert (omp_ctx.variables, (splay_tree_key) decl,
/haiku-buildtools/legacy/gcc/gcc/
H A Dalias.c178 splay_tree_lookup (alias_sets, (splay_tree_key) alias_set);
228 (splay_tree_key) MEM_ALIAS_SET (mem2)))
234 (splay_tree_key) MEM_ALIAS_SET (mem1)))
289 (splay_tree_key) superset,
304 (splay_tree_key) subset,
/haiku-buildtools/gcc/gcc/java/
H A Dlang.c734 n = splay_tree_lookup (decl_map, (splay_tree_key) ite->value);
793 (splay_tree_key) ite->value,
/haiku-buildtools/gcc/gcc/c-family/
H A Dc-lex.c124 n = splay_tree_lookup (file_info_tree, (splay_tree_key) name);
132 splay_tree_insert (file_info_tree, (splay_tree_key) name,
/haiku-buildtools/gcc/gcc/lto/
H A Dlto.c135 lto_splay_tree_delete_id (splay_tree_key key)
143 lto_splay_tree_compare_ids (splay_tree_key a, splay_tree_key b)
163 return splay_tree_lookup (t, (splay_tree_key) &id);
169 lto_splay_tree_id_equal_p (splay_tree_key key, unsigned HOST_WIDE_INT id)
176 be wider than a splay_tree_key. */
184 splay_tree_insert (t, (splay_tree_key) idp, (splay_tree_value) file_data);

Completed in 397 milliseconds

12