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

/freebsd-10.0-release/contrib/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...]
/freebsd-10.0-release/contrib/gcclibs/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...]
/freebsd-10.0-release/contrib/gdb/include/
H A Dsplay-tree.h47 typedef unsigned long int splay_tree_key; typedef
55 typedef int (*splay_tree_compare_fn) PARAMS((splay_tree_key, splay_tree_key));
59 typedef void (*splay_tree_delete_key_fn) PARAMS((splay_tree_key));
84 splay_tree_key GTY ((use_param1 (""))) key;
130 splay_tree_key,
133 splay_tree_key));
136 splay_tree_key));
139 splay_tree_key));
142 splay_tree_key));
[all...]
/freebsd-10.0-release/contrib/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...]
/freebsd-10.0-release/contrib/gcclibs/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...]
/freebsd-10.0-release/contrib/gcc/cp/
H A Doptimize.c156 (splay_tree_key) parm,
169 (splay_tree_key) parm,
177 (splay_tree_key) parm,
186 (splay_tree_key) parm,
196 splay_tree_insert (decl_map, (splay_tree_key) parm,
H A Dclass.c203 static int splay_tree_compare_integer_csts (splay_tree_key k1,
204 splay_tree_key k2);
3097 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3100 (splay_tree_key) offset,
3123 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
4507 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
6313 (splay_tree_key) name,
6332 n = splay_tree_lookup (names_used, (splay_tree_key) name);
H A Dtree.c1223 (splay_tree_key) TREE_OPERAND (t, 0),
1253 (splay_tree_key) *t);
H A Ddecl2.c2543 (splay_tree_key) priority);
2552 (splay_tree_key) priority,
/freebsd-10.0-release/contrib/gcc/
H A Dipa-type-escape.c178 compare_type_brand (splay_tree_key sk1, splay_tree_key sk2)
212 result = splay_tree_lookup (all_canon_types, (splay_tree_key) brand);
224 (splay_tree_key) type,
237 (splay_tree_key) brand,
242 (splay_tree_key) type,
247 (splay_tree_key) TYPE_UID (type),
307 result = splay_tree_lookup(type_to_canon_type, (splay_tree_key) type);
443 result = splay_tree_lookup (uid_to_addressof_down_map, (splay_tree_key) uid);
850 (splay_tree_key) from_ui
[all...]
H A Dipa-utils.c190 (splay_tree_key)node->uid,
H A Dtree-inline.c133 splay_tree_insert (id->decl_map, (splay_tree_key) key,
139 splay_tree_insert (id->decl_map, (splay_tree_key) value,
156 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
206 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
327 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
571 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
590 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
634 (splay_tree_key) TREE_BLOCK (*tp));
2390 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2398 splay_tree_insert (st, (splay_tree_key) *t
[all...]
H A Domp-low.c448 n = splay_tree_lookup (ctx->cb.decl_map, (splay_tree_key) var);
456 n = splay_tree_lookup (ctx->cb.decl_map, (splay_tree_key) var);
464 n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var);
472 n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var);
614 gcc_assert (!splay_tree_lookup (ctx->field_map, (splay_tree_key) var));
629 splay_tree_insert (ctx->field_map, (splay_tree_key) var,
826 splay_tree_insert (all_contexts, (splay_tree_key) stmt,
914 splay_tree_insert (ctx->field_map, (splay_tree_key) f,
1447 n = splay_tree_lookup (all_contexts, (splay_tree_key) stmt);
3931 n = splay_tree_lookup (critical_name_mutexes, (splay_tree_key) nam
[all...]
H A Dc-common.h778 extern int case_compare (splay_tree_key, splay_tree_key);
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,
H A Ddwarf2asm.c727 node = splay_tree_lookup (indirect_pool, (splay_tree_key) str);
765 splay_tree_insert (indirect_pool, (splay_tree_key) str,
H A Dgimplify.c252 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
1073 (splay_tree_key) t) == NULL))
4336 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4425 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4498 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4532 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4600 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4655 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4824 = splay_tree_lookup (ctx->variables, (splay_tree_key) dec
[all...]
H A Dc-common.c3628 case_compare (splay_tree_key k1, splay_tree_key k2)
3716 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3733 (splay_tree_key) low_value);
3735 (splay_tree_key) low_value);
3783 (splay_tree_key) low_value,
3882 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3913 node = splay_tree_lookup (cases, (splay_tree_key) value);
3924 node = splay_tree_predecessor (cases, (splay_tree_key) value);
H A Dtree-dump.c70 dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
108 n = splay_tree_lookup (di->nodes, (splay_tree_key) t);
H A Dalias.c316 (splay_tree_key) set2)))
324 (splay_tree_key) set1)))
702 (splay_tree_key) subset, 0);
/freebsd-10.0-release/contrib/gdb/gdb/
H A Dmacrotab.c319 macro_tree_compare (splay_tree_key untyped_key1,
320 splay_tree_key untyped_key2)
624 n = splay_tree_lookup (t->definitions, (splay_tree_key) &query);
634 (splay_tree_key) &query);
752 splay_tree_insert (t->definitions, (splay_tree_key) k, (splay_tree_value) d);
779 splay_tree_insert (t->definitions, (splay_tree_key) k, (splay_tree_value) d);

Completed in 173 milliseconds