Searched refs:VEC_index (Results 1 - 25 of 59) sorted by relevance

123

/openbsd-current/gnu/gcc/gcc/
H A Dregs.h77 #define REG_N_REFS(N) (VEC_index (reg_info_p, reg_n_info, N)->refs)
81 #define REG_FREQ(N) (VEC_index (reg_info_p, reg_n_info, N)->freq)
105 #define REG_N_SETS(N) (VEC_index (reg_info_p, reg_n_info, N)->sets)
113 #define REG_N_DEATHS(N) (VEC_index (reg_info_p, reg_n_info, N)->deaths)
133 (VEC_index (reg_info_p, reg_n_info, N)->calls_crossed)
139 (VEC_index (reg_info_p, reg_n_info, N)->throw_calls_crossed)
157 (VEC_index (reg_info_p, reg_n_info, N)->live_length)
192 #define REGNO_FIRST_UID(N) (VEC_index (reg_info_p, reg_n_info, N)->first_uid)
200 #define REGNO_LAST_UID(N) (VEC_index (reg_info_p, reg_n_info, N)->last_uid)
H A Dtree-data-ref.h121 #define DR_ACCESS_FN(DR, I) VEC_index (tree, DR_ACCESS_FNS (DR), I)
251 #define DDR_SUBSCRIPT(DDR, I) VEC_index (subscript_p, DDR_SUBSCRIPTS (DDR), I)
266 VEC_index (lambda_vector, DDR_DIR_VECTS (DDR), I)
268 VEC_index (lambda_vector, DDR_DIST_VECTS (DDR), I)
H A Dgenextract.c131 char *b = VEC_index (locstr, acc.oplocs, j);
140 if (p->dupnums[j] != VEC_index (int, acc.dupnums, j)
141 || strcmp (p->duplocs[j], VEC_index (locstr, acc.duplocs, j)))
192 gcc_assert (VEC_index (locstr, *vp, ix) == 0);
H A Dtree-ssa-operands.c191 if (get_name_decl (VEC_index (tree, list, 0))
192 > get_name_decl (VEC_index (tree, list, 1)))
195 tree tmp = VEC_index (tree, list, 0);
196 VEC_replace (tree, list, 0, VEC_index (tree, list, 1));
475 tree *new_base = (tree *) VEC_index (tree, build_defs, new_i);
499 add_def_op ((tree *) VEC_index (tree, build_defs, new_i), &last);
567 add_use_op (stmt, (tree *) VEC_index (tree, build_uses, new_i), &last);
600 gcc_assert (*((tree *)VEC_index (tree, build_uses, x)) != stmt);
628 act = VEC_index (tree, build_v_may_defs, new_i);
655 add_maydef_op (stmt, VEC_index (tre
[all...]
H A Dexcept.c575 struct eh_region *reg = VEC_index (eh_region,
689 r = VEC_index (eh_region, cfun->eh->region_array, i);
710 r = VEC_index (eh_region, cfun->eh->region_array, i);
773 region = VEC_index (eh_region, cfun->eh->region_array, i);
828 region = VEC_index (eh_region, cfun->eh->region_array, i);
857 region = VEC_index (eh_region, cfun->eh->region_array, i);
948 cur = VEC_index (eh_region, ifun->eh->region_array, copy_region);
973 outer = VEC_index (eh_region, cfun->eh->region_array, outer_region);
987 cur = VEC_index (eh_region, ifun->eh->region_array, copy_region);
1013 for (prev_try = VEC_index (eh_regio
[all...]
H A Dloop-invariant.c469 dep = VEC_index (invariant_p, invariants, depno);
923 inv = VEC_index (invariant_p, invariants, inv->eqto);
963 dep = VEC_index (invariant_p, invariants, depno);
1049 struct invariant *inv = VEC_index (invariant_p, invariants, invno);
1053 inv = VEC_index (invariant_p, invariants, inv->eqto);
1132 struct invariant *inv = VEC_index (invariant_p, invariants, invno);
1133 struct invariant *repr = VEC_index (invariant_p, invariants, inv->eqto);
H A Dtree-ssa-reassoc.c753 operand_entry_t oelm1 = VEC_index (operand_entry_t, *ops, length - 2);
863 oe1 = VEC_index (operand_entry_t, ops, opindex);
864 oe2 = VEC_index (operand_entry_t, ops, opindex + 1);
865 oe3 = VEC_index (operand_entry_t, ops, opindex + 2);
890 oe1 = VEC_index (operand_entry_t, ops, opindex);
891 oe2 = VEC_index (operand_entry_t, ops, opindex + 1);
921 oe = VEC_index (operand_entry_t, ops, opindex);
H A Dgenautomata.c3246 if (VEC_index (alt_state_t, alt_states, prev_unique_state_ind)->state
3247 != VEC_index (alt_state_t, alt_states, i)->state)
3251 VEC_index (alt_state_t, alt_states, i));
3256 VEC_index (alt_state_t, alt_states, i-1)->next_sorted_alt_state
3257 = VEC_index (alt_state_t, alt_states, i);
3260 result = VEC_index (alt_state_t, alt_states, 0);
4962 unit_usage_ptr->next = VEC_index (unit_usage_t, cycle_alt_unit_usages, index);
5052 for (unit_usage_ptr = VEC_index (unit_usage_t, cycle_alt_unit_usages, i);
5064 = VEC_index (unit_usage_t, cycle_alt_unit_usages, k);
5071 && (VEC_index (unit_usage_
[all...]
H A Dbasic-block.h402 (VEC_index (basic_block, basic_block_info_for_function(FN), (N)))
414 #define BASIC_BLOCK(N) (VEC_index (basic_block, basic_block_info, (N)))
464 (VEC_index (reg_info_p, reg_n_info, N)->basic_block)
598 #define EDGE_I(ev,i) VEC_index (edge, (ev), (i))
599 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
600 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
H A Dcfglayout.c450 int tmp = VEC_index (int, block_locators_locs, pos);
462 return VEC_index (tree, block_locators_blocks, min);
477 int tmp = VEC_index (int, line_locators_locs, pos);
489 return VEC_index (int, line_locators_lines, min);
511 int tmp = VEC_index (int, file_locators_locs, pos);
H A Dlambda-code.c1657 mult = VEC_index (tree, induction_vars, i);
1778 tree op1 = VEC_index (tree, results, 0);
1779 tree op2 = VEC_index (tree, results, 1);
1843 oldiv = VEC_index (tree, old_ivs, i);
2531 oldivvar = VEC_index (tree, loopivs, 0);
2535 create_iv (VEC_index (tree, lbounds, 0),
2536 build_int_cst (TREE_TYPE (oldivvar), VEC_index (int, steps, 0)),
2546 VEC_index (tree, ubounds, 0));
2565 oldivvar = VEC_index (tree, loopivs, 0);
2622 (loop, stmt, oldivvar, VEC_index (in
[all...]
H A Dtree-outof-ssa.c300 if (VEC_index (int, g->edge_list, x) == node)
303 y = VEC_index (int, g->edge_list, x + 1);
321 y_ = VEC_index (int, (GRAPH)->edge_list, x_); \
324 (VAR) = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
340 y_ = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
343 (VAR) = VEC_index (int, (GRAPH)->edge_list, x_); \
2229 curr_stmt_list = VEC_index (tree, stmt_list, x);
2258 PENDING_STMT (leader) = VEC_index (tree, stmt_list, x);
H A Dtree-ssa-live.c962 swap_t = VEC_index (tree, tpa->trees, last);
963 swap_i = VEC_index (int, tpa->first_partition, last);
968 VEC_index (tree, tpa->trees, x));
970 VEC_index (int, tpa->first_partition, x));
1046 rv->next_partition[p] = VEC_index (int, rv->first_partition,
1063 t = VEC_index (tree, rv->trees, x);
1119 if (t == VEC_index (tree, tv->trees, y))
1129 tv->next_partition[p] = VEC_index (int, tv->first_partition, y);
H A Dtree-ssa-live.h379 return VEC_index (tree, tpa->trees, i);
388 return VEC_index (int, tpa->first_partition, i);
H A Dtree-ssa-threadupdate.c845 edge e = VEC_index (edge, threaded_edges, i);
846 edge e2 = VEC_index (edge, threaded_edges, i + 1);
H A Dalias.c223 ? VEC_index (rtx, reg_base_value, REGNO (X)) : 0)
264 return VEC_index (alias_set_entry, alias_sets, alias_set);
829 if (VEC_index (rtx, reg_base_value, regno))
830 return VEC_index (rtx, reg_base_value, regno);
2575 && new_reg_base_value[ui] != VEC_index (rtx, reg_base_value, ui)
2577 VEC_index (rtx, reg_base_value, ui)))
2608 rtx base = VEC_index (rtx, reg_base_value, ui);
2616 VEC_index (rtx, reg_base_value, base_regno));
H A Dtree-loop-linear.c186 ddr = VEC_index (ddr_p, dependence_relations, 0);
H A Dtree-vn.c169 if (VEC_index (tree, ve2->vuses, i) != vuse1)
H A Dprofile.c177 histogram_value hist = VEC_index (histogram_value, values, i);
627 histogram_value hist = VEC_index (histogram_value, values, i);
652 histogram_value hist = VEC_index (histogram_value, values, i);
H A Dtree-complex.c119 return VEC_index (complex_lattice_t, complex_lattice_values,
283 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
374 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
456 ret = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
500 comp = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
H A Dtree-into-ssa.c287 info = VEC_index (ssa_name_info_p, info_for_ssa_name, ver);
916 top = VEC_index (int, worklist, VEC_length (int, worklist) - 1);
1109 phis = VEC_index (tree_vec, phis_to_rewrite, idx);
1866 phis = VEC_index (tree_vec, phis_to_rewrite, e->dest->index);
3147 tree_vec phis = VEC_index (tree_vec, phis_to_rewrite, i);
H A Dtree-ssa-uncprop.c525 tree equiv = VEC_index (tree, elt->equivalences, j);
/openbsd-current/gnu/gcc/gcc/cp/
H A Drtti.c374 tinfo_s *ti = VEC_index (tinfo_s, tinfo_descs, ix);
1005 tinfo_s *ti = VEC_index (tinfo_s, tinfo_descs, tk_index);
1032 ti = VEC_index (tinfo_s, tinfo_descs, tk_index);
1057 if (VEC_index (tree, base_accesses, ix) == access_public_node)
1093 ti = VEC_index (tinfo_s, tinfo_descs, tk_index);
1135 VEC_index (tinfo_s, tinfo_descs,
1150 ti = VEC_index (tinfo_s, tinfo_descs, tk);
1220 && VEC_index (tree, base_accesses, 0) == access_public_node
1243 else if (VEC_index (tinfo_s, tinfo_descs, ix)->type)
1256 build_array_type (VEC_index (tinfo_
[all...]
H A Dsearch.c652 tree base_access = VEC_index (tree, accesses, i);
1061 nval = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), idx);
1448 tmp = VEC_index (tree, method_vec, i);
1956 tree fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
/openbsd-current/gnu/gcc/gcc/config/sh/
H A Dsymbian.c567 tree member = VEC_index (tree, method_vec, len);
665 tree member = VEC_index (tree, method_vec, len);
769 DECL_ATTRIBUTES (VEC_index (tree, method_vec, 0))))
781 tree member = VEC_index (tree, method_vec, len);

Completed in 242 milliseconds

123