/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | lto-section-out.c | 89 return (hashval_t) TYPE_UID (ds->t); in lto_hash_type_slot_node() 103 return TYPE_UID (ds1->t) == TYPE_UID (ds2->t); in lto_eq_type_slot_node()
|
H A D | gimple.c | 3218 if (TYPE_UID (t1) < TYPE_UID (t2)) in lookup_type_pair() 3220 uid1 = TYPE_UID (t1); in lookup_type_pair() 3221 uid2 = TYPE_UID (t2); in lookup_type_pair() 3225 uid1 = TYPE_UID (t2); in lookup_type_pair() 3226 uid2 = TYPE_UID (t1); in lookup_type_pair() 3288 leader = &gimple_type_leader[TYPE_UID (t) % GIMPLE_TYPE_LEADER_SIZE]; in gimple_lookup_type_leader() 4423 leader = &gimple_type_leader[TYPE_UID (t) % GIMPLE_TYPE_LEADER_SIZE]; in gimple_register_type_1()
|
H A D | dbxout.c | 2574 return TYPE_UID (lhs) - TYPE_UID (rhs); in output_types_sort()
|
H A D | tree-pretty-print.c | 780 pp_printf (buffer, "<T%x>", TYPE_UID (node)); in dump_generic_node() 1115 pp_printf (buffer, "<T%x>", TYPE_UID (node)); in dump_generic_node()
|
H A D | tree-sra.c | 1373 return TYPE_UID (f1->type) - TYPE_UID (f2->type); in compare_access_positions()
|
H A D | tree.h | 1038 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) 2161 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) macro
|
H A D | tree.c | 895 TYPE_UID (t) = next_type_uid++; in make_node_stat() 989 TYPE_UID (t) = next_type_uid++; in copy_node_stat()
|
/dragonfly/contrib/gcc-8.0/gcc/cp/ |
H A D | lex.c | 572 return (hashval_t) TYPE_UID (TREE_TYPE (node)); in hash() 607 (type, (hashval_t) TYPE_UID (type), INSERT); in make_conv_op_name()
|
H A D | typeck2.c | 167 return (hashval_t) TYPE_UID (pat->type); in hash() 205 = abstract_pending_vars->find_slot_with_hash (type, TYPE_UID (type), in complete_type_check_abstract() 289 = abstract_pending_vars->find_slot_with_hash (type, TYPE_UID (type), in abstract_virtuals_error_sfinae()
|
H A D | tree.c | 875 hash = TYPE_UID (TREE_TYPE (t)); in hash() 877 hash ^= TYPE_UID (TYPE_DOMAIN (t)); in hash() 954 hash = TYPE_UID (elt_type); in build_cplus_array_type() 956 hash ^= TYPE_UID (index_type); in build_cplus_array_type()
|
/dragonfly/contrib/gcc-4.7/gcc/cp/ |
H A D | typeck2.c | 163 return (hashval_t) TYPE_UID (pat->type); in pat_calc_hash() 206 (hashval_t)TYPE_UID (type), NO_INSERT); in complete_type_check_abstract() 280 (hashval_t)TYPE_UID (type), INSERT); in abstract_virtuals_error_sfinae()
|
H A D | tree.c | 702 hash = TYPE_UID (TREE_TYPE (t)); in cplus_array_hash() 704 hash ^= TYPE_UID (TYPE_DOMAIN (t)); in cplus_array_hash() 752 hash = TYPE_UID (elt_type); in build_cplus_array_type() 754 hash ^= TYPE_UID (index_type); in build_cplus_array_type()
|
H A D | mangle.c | 3619 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val)); in hash_type() 3647 (hashval_t) TYPE_UID (type), INSERT); in mangle_conv_op_name_for_type()
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | ipa-devirt.c | 151 return TYPE_UID (p.first) ^ TYPE_UID (p.second); 702 if (TYPE_UID (t1) > TYPE_UID (t2)) 2642 hstate.merge_hash (TYPE_UID (odr_query->context.outer_type)); 2648 hstate.merge_hash (TYPE_UID (odr_query->context.speculative_outer_type));
|
H A D | tree-ssa-alias.c | 973 unsigned int uid1 = TYPE_UID (DECL_FIELD_CONTEXT (field1)); in ncr_compar() 974 unsigned int uid2 = TYPE_UID (DECL_FIELD_CONTEXT (field2)); in ncr_compar() 1066 if (TYPE_UID (typex) < TYPE_UID (typey)) in nonoverlapping_component_refs_p()
|
H A D | ubsan.c | 65 return TYPE_UID (t->type.from); in hash() 101 h = decl_tree_for_type->find_with_hash (&in, TYPE_UID (type)); in decl_for_type_lookup() 115 *decl_tree_for_type->find_slot_with_hash (h, TYPE_UID (type), INSERT) = h; in decl_for_type_insert()
|
H A D | tree-ssa-structalias.c | 6022 TYPE_UID (TREE_TYPE (decl_type)))) in create_variable_info_for_1() 6029 TYPE_UID (TREE_TYPE (decl_type))); in create_variable_info_for_1() 6034 TYPE_UID (TREE_TYPE (decl_type))); in create_variable_info_for_1() 6081 TYPE_UID (fo->restrict_pointed_type))) in create_variable_info_for_1() 6088 TYPE_UID (fo->restrict_pointed_type)); in create_variable_info_for_1() 6093 TYPE_UID (fo->restrict_pointed_type)); in create_variable_info_for_1()
|
H A D | dbxout.c | 2597 return TYPE_UID (lhs) - TYPE_UID (rhs); in output_types_sort()
|
H A D | tree.c | 1064 TYPE_UID (t) = next_type_uid++; in make_node() 1212 TYPE_UID (t) = next_type_uid++; in copy_node() 1432 hashval_t code = TYPE_UID (TREE_TYPE (t)); in hash() 1623 hstate.add_int (TYPE_UID (TREE_TYPE (t))); in hash() 1652 h.add_int (TYPE_UID (type)); in build_poly_int_cst() 6626 if (TYPE_UID (type) + 1 == next_type_uid) in type_hash_canon()
|
H A D | tree-pretty-print.c | 1431 pp_printf (pp, "<T%x>", TYPE_UID (node)); in dump_generic_node() 1843 pp_printf (pp, "<T%x>", TYPE_UID (node)); in dump_generic_node()
|
H A D | tree-sra.c | 1604 return TYPE_UID (f1->type) - TYPE_UID (f2->type); in compare_access_positions()
|
H A D | tree.h | 439 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) 1868 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) macro
|
/dragonfly/contrib/gcc-4.7/gcc/c-family/ |
H A D | c-ada-spec.c | 1325 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (decl))); in dump_ada_decl_name() 1342 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (t1))); in dump_ada_double_name() 1352 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (t2))); in dump_ada_double_name() 2138 pp_scalar (buffer, "%d", TYPE_UID (node)); in dump_generic_ada_node()
|
/dragonfly/contrib/gcc-8.0/gcc/c-family/ |
H A D | c-ada-spec.c | 1539 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (decl))); in dump_ada_decl_name() 1556 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (t1))); in dump_ada_double_name() 1566 pp_scalar (buffer, "%d", TYPE_UID (TREE_TYPE (t2))); in dump_ada_double_name()
|