Home
last modified time | relevance | path

Searched refs:TREE_VEC_ELT (Results 1 – 25 of 70) sorted by relevance

123

/openbsd/gnu/usr.bin/gcc/gcc/objc/
H A Dobjc-act.h93 #define CLASS_IVARS(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 0)
94 #define CLASS_RAW_IVARS(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 1)
97 #define CLASS_STATIC_TEMPLATE(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 2)
98 #define CLASS_CATEGORY_LIST(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 3)
99 #define CLASS_PROTOCOL_LIST(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 4)
100 #define CLASS_OWN_IVARS(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 5)
102 #define PROTOCOL_LIST(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 0)
105 #define PROTOCOL_FORWARD_DECL(CLASS) TREE_VEC_ELT (TYPE_BINFO (CLASS), 1)
/openbsd/gnu/gcc/gcc/objc/
H A Dobjc-act.h63 #define CLASS_IVARS(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 0)
64 #define CLASS_RAW_IVARS(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 1)
67 #define CLASS_STATIC_TEMPLATE(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 2)
68 #define CLASS_CATEGORY_LIST(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 3)
69 #define CLASS_PROTOCOL_LIST(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 4)
71 #define PROTOCOL_LIST(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 0)
74 #define PROTOCOL_FORWARD_DECL(CLASS) TREE_VEC_ELT (TYPE_LANG_SLOT_1 (CLASS), 1)
91 #define TYPE_OBJC_INTERFACE(TYPE) TREE_VEC_ELT (TYPE_OBJC_INFO (TYPE), 0)
92 #define TYPE_OBJC_PROTOCOL_LIST(TYPE) TREE_VEC_ELT (TYPE_OBJC_INFO (TYPE), 1)
/openbsd/gnu/usr.bin/gcc/gcc/java/
H A Dverify.c260 TREE_VEC_ELT (vec, cur_length) = type_map [cur_length];
278 tree old_type = TREE_VEC_ELT (vec, i);
280 if (TREE_VEC_ELT (vec, i) != new_type)
287 || TREE_VEC_ELT (return_map, i) != TYPE_UNUSED
292 TREE_VEC_ELT (vec, i) = new_type;
559 = TREE_VEC_ELT (return_state, index);
740 if (TREE_VEC_ELT (vec, index) == TYPE_UNUSED)
741 TREE_VEC_ELT (vec, index) = TREE_VEC_ELT (subr_vec, index);
1362 TREE_VEC_ELT (ret_map, index) = type_map[index];
1372 tree type = TREE_VEC_ELT (ret_map, index);
[all …]
H A Dmangle.c284 if (TREE_VEC_ELT (compression_table, i) == string)
309 if (TREE_VEC_ELT (compression_table, j) == TREE_PURPOSE (current))
323 && TREE_CODE (TREE_VEC_ELT (compression_table, j)) ==
530 tree t = TREE_VEC_ELT (compression_table, i);
602 TREE_VEC_ELT (new, i) = TREE_VEC_ELT (compression_table, i);
606 TREE_VEC_ELT (compression_table, compression_next++) = type;
H A Dclass.c378 TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (this_class)), 0)
436 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
442 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
521 TREE_VEC_ELT (basetype_vec, i) = interface_binfo;
542 else if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
567 else if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
1332 TREE_VEC_ELT (vtable, i) = TREE_VEC_ELT (super_vtable, i);
1339 TREE_VEC_ELT (vtable, tree_low_cst (DECL_VINDEX (method), 0))
1360 tree method = TREE_VEC_ELT (vtable, i);
1576 tree child = TREE_VEC_ELT (TYPE_BINFO_BASETYPES (type), i);
[all …]
H A Ddecl.c117 tmp = TREE_VEC_ELT (decl_map, index);
143 DECL_LOCAL_SLOT_CHAIN (decl) = TREE_VEC_ELT (decl_map, index);
144 TREE_VEC_ELT (decl_map, index) = decl;
210 tree decl = TREE_VEC_ELT (decl_map, index);
1618 tree decl = TREE_VEC_ELT (decl_map, slot);
/openbsd/gnu/usr.bin/gcc/gcc/cp/
H A Dpt.c2237 tree t = TREE_VEC_ELT (a, i); in current_template_args()
2251 TREE_VEC_ELT (a, i) = t; in current_template_args()
2256 TREE_VEC_ELT (args, --l) = a; in current_template_args()
7541 TREE_VEC_ELT (targs, i)
8144 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8555 if (TREE_VEC_ELT (tempargs, i))
8556 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
8639 TREE_VEC_ELT (targs, i) = elt; in try_one_overload()
9058 TREE_VEC_ELT (argvec, i),
9302 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
[all …]
H A Dsearch.c218 tree base_binfo = TREE_VEC_ELT (bases, i);
394 tree base_binfo = TREE_VEC_ELT (binfos, i);
761 tree base_binfo = TREE_VEC_ELT (binfos, i);
1132 tree base_binfo = TREE_VEC_ELT (binfos, i);
1676 tree fn = TREE_VEC_ELT (methods, i); in lookup_conversion_operator()
1734 methods = &TREE_VEC_ELT (method_vec, 0); in lookup_fnfields_1()
1897 tree base_binfo = TREE_VEC_ELT (binfos, i);
1945 tree base_binfo = TREE_VEC_ELT (binfos, i);
2726 for (methods = &TREE_VEC_ELT (method_vec, 2);
2847 tree tmp = TREE_VEC_ELT (method_vec, i);
[all …]
H A Dcall.c1522 TREE_VEC_ELT (convs, i) = t; in add_function_candidate()
1598 TREE_VEC_ELT (convs, i) = t;
1654 TREE_VEC_ELT (convs, i) = t;
1660 TREE_VEC_ELT (convs, 2) = TREE_VEC_ELT (convs, 1);
1661 TREE_VEC_ELT (convs, 1) = TREE_VEC_ELT (convs, 0);
1664 TREE_VEC_ELT (convs, 0) = t;
3393 conv = TREE_VEC_ELT (cand->convs, 0);
3395 conv = TREE_VEC_ELT (cand->convs, 1);
3397 conv = TREE_VEC_ELT (cand->convs, 2);
3796 conv = TREE_VEC_ELT (cand->convs, 0);
[all …]
H A Dclass.c850 if (TREE_VEC_ELT (method_vec, slot))
877 memcpy (&TREE_VEC_ELT (new_vec, 0), &TREE_VEC_ELT (method_vec, 0),
921 &TREE_VEC_ELT (method_vec, slot),
1007 TREE_VEC_ELT (method_vec, slot)
1311 TREE_VEC_ELT (binfos, j) = TREE_VEC_ELT (binfos, j+1);
2943 TREE_VEC_ELT (field_vec, idx++) = x;
4607 if (TREE_VEC_ELT (method, 1))
4608 method = TREE_VEC_ELT (method, 1);
4609 else if (TREE_VEC_ELT (method, 0))
4610 method = TREE_VEC_ELT (method, 0);
[all …]
H A Drtti.c1061 tree base_binfo = TREE_VEC_ELT (base_binfos, 0);
1079 tree base_binfo = TREE_VEC_ELT (base_binfos, ix);
1221 TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (type)), 0);
1241 TREE_VEC_ELT (extend, ix)
1242 = TREE_VEC_ELT (vmi_class_desc_type_node, ix);
1245 var_desc = TREE_VEC_ELT (vmi_class_desc_type_node, num_bases);
1264 TREE_VEC_ELT (vmi_class_desc_type_node, num_bases) = var_desc;
1395 dtor = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (bltn_type), 1); in emit_support_tinfos()
H A Dmangle.c438 && TREE_VEC_ELT (args, 0) == char_type_node;
521 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
522 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
524 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
551 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
552 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
1865 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1869 args = TREE_VEC_ELT (args, length - 1);
1873 write_template_arg (TREE_VEC_ELT (args, i));
H A Dmethod.c582 tree binfo = TREE_VEC_ELT (binfos, i);
834 tree base = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
877 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
894 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
937 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
H A Derror.c228 dump_template_argument (TREE_VEC_ELT (args, i), flags);
298 arg = TREE_VEC_ELT (lvl_args, arg_idx);
303 dump_template_parameter (TREE_VEC_ELT (p, i), TFF_PLAIN_IDENTIFIER);
1060 dump_template_parameter (TREE_VEC_ELT (inner_parms, i), flags);
1327 && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1328 args = TREE_VEC_ELT (args, TREE_VEC_LENGTH (args) - 1);
1339 arg = TREE_VEC_ELT (args, ix);
1368 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, ix));
H A Dcp-lang.c229 tree binfo = TREE_VEC_ELT (TYPE_BINFO_BASETYPES (t), i);
H A Dcp-tree.h1372 (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_CONSTRUCTOR_SLOT))
1377 (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_DESTRUCTOR_SLOT))
1654 #define BINFO_SUBVTT_INDEX(NODE) TREE_VEC_ELT (NODE, 8)
1658 #define BINFO_VPTR_INDEX(NODE) TREE_VEC_ELT (NODE, 9)
1664 #define BINFO_PRIMARY_BASE_OF(NODE) TREE_VEC_ELT (NODE, 10)
2325 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
2326 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
2340 ? TREE_VEC_ELT (ARGS, (LEVEL) - 1) : (ARGS))
2345 (TREE_VEC_ELT (ARGS, (LEVEL) - 1) = (VAL))
2349 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
[all …]
/openbsd/gnu/gcc/gcc/cp/
H A Dpt.c2140 = TREE_VEC_ELT (targs, i); in check_explicit_specialization()
2557 tree t = TREE_VEC_ELT (a, i); in current_template_args()
2575 TREE_VEC_ELT (a, i) = t; in current_template_args()
2580 TREE_VEC_ELT (args, --l) = a; in current_template_args()
9731 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); in fn_type_unification()
10099 if (TREE_VEC_ELT (tempargs, i)) in resolve_overloaded_unification()
10100 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); in resolve_overloaded_unification()
10180 TREE_VEC_ELT (targs, i) = elt; in try_one_overload()
10532 TREE_VEC_ELT (parmvec, i), in unify()
10533 TREE_VEC_ELT (argvec, i), in unify()
[all …]
H A Dmangle.c489 && TREE_VEC_ELT (args, 0) == char_type_node; in is_std_substitution_char()
571 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node) in find_substitution()
572 && is_std_substitution_char (TREE_VEC_ELT (args, 1), in find_substitution()
574 && is_std_substitution_char (TREE_VEC_ELT (args, 2), in find_substitution()
601 && TYPE_P (TREE_VEC_ELT (args, 0)) in find_substitution()
602 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node) in find_substitution()
603 && is_std_substitution_char (TREE_VEC_ELT (args, 1), in find_substitution()
1986 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC) in write_template_args()
1990 args = TREE_VEC_ELT (args, length - 1); in write_template_args()
1994 write_template_arg (TREE_VEC_ELT (args, i)); in write_template_args()
H A Dcp-gimplify.c876 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), decl, NULL); in cxx_omp_clause_default_ctor()
890 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), dst, src); in cxx_omp_clause_copy_ctor()
906 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 2), dst, src); in cxx_omp_clause_assign_op()
922 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 1), decl, NULL); in cxx_omp_clause_dtor()
H A Derror.c159 dump_template_argument (TREE_VEC_ELT (args, i), flags); in dump_template_argument_list()
231 arg = TREE_VEC_ELT (lvl_args, arg_idx); in dump_template_bindings()
236 dump_template_parameter (TREE_VEC_ELT (p, i), TFF_PLAIN_IDENTIFIER); in dump_template_bindings()
944 dump_template_parameter (TREE_VEC_ELT (inner_parms, i), flags); in dump_template_decl()
1217 args = TREE_VEC_ELT (args, TREE_VEC_LENGTH (args) - 1); in dump_template_parms()
1223 tree arg = TREE_VEC_ELT (args, ix); in dump_template_parms()
1247 if (TREE_VEC_ELT (parms, ix) == error_mark_node) in dump_template_parms()
1253 parm = TREE_VALUE (TREE_VEC_ELT (parms, ix)); in dump_template_parms()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dtree.h837 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) macro
1317 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1325 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1331 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1345 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1346 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1355 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1364 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1368 #define BINFO_SIZE(NODE) TREE_VEC_ELT (NODE, 6)
1369 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT (NODE, 7)
[all …]
H A Dtree-inline.c1058 if (TREE_VEC_ELT (inlined_fns, j) == VARRAY_TREE (id->fns, 0))
1494 memcpy (&TREE_VEC_ELT (ifn, 0), &VARRAY_TREE (id.inlined_fns, 0),
1724 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
1727 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
/openbsd/gnu/gcc/gcc/
H A Dtree-cfg.c1030 tree elt = TREE_VEC_ELT (vec, i); in cleanup_dead_labels()
1119 base_case = TREE_VEC_ELT (labels, i); in group_case_labels()
1128 TREE_VEC_ELT (labels, i) = NULL_TREE; in group_case_labels()
1142 tree merge_case = TREE_VEC_ELT (labels, i); in group_case_labels()
1155 TREE_VEC_ELT (labels, i) = NULL_TREE; in group_case_labels()
1168 while (! TREE_VEC_ELT (labels, j)) in group_case_labels()
1170 TREE_VEC_ELT (labels, i) = TREE_VEC_ELT (labels, j++); in group_case_labels()
2212 tree t = TREE_VEC_ELT (vec, i); in find_case_label_for_value()
3903 prev = TREE_VEC_ELT (vec, 0); in tree_verify_flow_info()
3906 tree c = TREE_VEC_ELT (vec, i); in tree_verify_flow_info()
[all …]
H A Dtree-data-ref.c2119 if (!eq_evolutions_p (TREE_VEC_ELT (chrec, j), in all_chrecs_equal_p()
2120 TREE_VEC_ELT (chrec, j + 1))) in all_chrecs_equal_p()
2153 conflicts_a = TREE_VEC_ELT (conflicts_a, 0); in compute_subscript_distance()
2164 conflicts_b = TREE_VEC_ELT (conflicts_b, 0); in compute_subscript_distance()
2751 TREE_VEC_ELT (*overlaps_a, 0) = integer_zero_node; in compute_overlap_steps_for_affine_1_2()
2752 TREE_VEC_ELT (*overlaps_a, 1) = integer_zero_node; in compute_overlap_steps_for_affine_1_2()
2757 TREE_VEC_ELT (*overlaps_a, 0), NULL_TREE); in compute_overlap_steps_for_affine_1_2()
2765 TREE_VEC_ELT (*overlaps_a, 0) = chrec_fold_plus (integer_type_node, in compute_overlap_steps_for_affine_1_2()
2773 TREE_VEC_ELT (*overlaps_a, 1), NULL_TREE); in compute_overlap_steps_for_affine_1_2()
2786 TREE_VEC_ELT (*overlaps_a, 0), NULL_TREE); in compute_overlap_steps_for_affine_1_2()
[all …]
H A Dtree-eh.c573 tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i)); in verify_norecord_switch_expr()
1194 TREE_VEC_ELT (case_label_vec, last_case_index) = last_case; in lower_try_finally_switch()
1217 TREE_VEC_ELT (case_label_vec, last_case_index) = last_case; in lower_try_finally_switch()
1256 if (!TREE_VEC_ELT (case_label_vec, case_index)) in lower_try_finally_switch()
1257 TREE_VEC_ELT (case_label_vec, case_index) in lower_try_finally_switch()
1273 last_case = TREE_VEC_ELT (case_label_vec, j); in lower_try_finally_switch()

123