/freebsd-10.3-release/contrib/gcc/ |
H A D | tree-vect-analyze.c | 624 for (i = 0; VEC_iterate (lambda_vector, DDR_DIST_VECTS (ddr), i, dist_v); i++) 689 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) 820 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 856 for (i = 0; VEC_iterate (dr_p, same_align_drs, i, current_dr); i++) 891 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 1108 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 1141 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 1169 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 1203 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 1265 for (i = 0; VEC_iterate (tre [all...] |
H A D | tree-ssa-alias.c | 207 for (i = 0; VEC_iterate (tree, ma, i, entry); i++) 264 for (k = 0; VEC_iterate (tree, taglist, k, tag); k++) 279 for (i = 0; VEC_iterate (tree, ma, i, entry); i++) 340 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) 524 for (i = 0; VEC_iterate (tree, calls, i, stmt); i++) 1065 for (i = 0; VEC_iterate (tree, with_ptvars, i, ptr); i++) 1128 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) 1136 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) 1196 for (j = 0; VEC_iterate (tree, tag_ann->may_aliases, j, var); ++j) 1575 for (i = 0; VEC_iterate (tre [all...] |
H A D | tree-loop-linear.c | 108 for (i = 0; VEC_iterate (ddr_p, dependence_relations, i, ddr); i++) 134 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++)
|
H A D | tree-ssa-structalias.c | 570 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) 691 for (i = 0; VEC_iterate (constraint_t, *from, i, c); i++) 808 for (i = 0; VEC_iterate (constraint_t, graph->complex[from], i, c); i++) 989 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) 1048 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) 1905 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) 2012 VEC_iterate (unsigned, queue, queuepos, i); 2107 for (j = 0; VEC_iterate (constraint_t, complex, j, c); j++) 2484 for (i = 0; VEC_iterate (ce_s, *constraints, i, c); i++) 2610 for (i = 0; VEC_iterate (ce_ [all...] |
H A D | tree-vn.c | 167 for (i = 0; VEC_iterate (tree, ve1->vuses, i, vuse1); i++) 343 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++)
|
H A D | tree-data-ref.c | 595 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) 608 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) 729 for (j = 0; VEC_iterate (lambda_vector, dir_vects, j, v); j++) 742 for (j = 0; VEC_iterate (lambda_vector, dist_vects, j, v); j++) 786 for (i = 0; VEC_iterate (loop_p, DDR_LOOP_NEST (ddr), i, loopi); i++) 861 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) 864 for (j = 0; VEC_iterate (lambda_vector, DDR_DIST_VECTS (ddr), j, v); j++) 871 for (j = 0; VEC_iterate (lambda_vector, DDR_DIR_VECTS (ddr), j, v); j++) 890 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) 3495 for (i = 0; VEC_iterate (lambda_vecto [all...] |
H A D | loop-invariant.c | 496 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) 1022 for (invno = 0; VEC_iterate (invariant_p, invariants, invno, inv); invno++) 1097 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) 1241 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) 1282 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++)
|
H A D | tree-ssa-reassoc.c | 511 VEC_iterate (operand_entry_t, *ops, i, oe) 569 VEC_iterate (operand_entry_t, *ops, i, oe) 783 for (i = 0; VEC_iterate (operand_entry_t, *ops, i, oe);) 1206 for (i = 0; VEC_iterate (tree, broken_up_subtracts, i, negate); i++) 1390 for (i = 0; VEC_iterate (operand_entry_t, ops, i, oe); i++)
|
H A D | tree-data-ref.h | 307 for (var_index = 0; VEC_iterate (loop_p, loop_nest, var_index, loopi);
|
H A D | tree-ssa.c | 390 for (j = 0; VEC_iterate (tree, may_aliases, j, alias); j++) 551 for (i = 0; VEC_iterate (tree, aliases, i, alias); i++) 574 for (i = 0; VEC_iterate (bitmap, pt_vars_for_reps, i, first); i++) 576 for (j = i + 1; VEC_iterate (bitmap, pt_vars_for_reps, j, second); j++)
|
H A D | lambda-code.c | 1135 for (i = 0; VEC_iterate (tree, outerinductionvars, i, iv); i++) 1148 for (i = 0; VEC_iterate (tree, invariants, i, invar); i++) 1511 for (i = 0; VEC_iterate (lambda_loop, loops, i, newloop); i++) 1551 for (i = 0; VEC_iterate (tree, induction_vars, i, iv); i++) 1646 for (i = 0; VEC_iterate (tree, induction_vars, i, iv); i++) 1688 for (i = 0; VEC_iterate (tree, invariants, i, invar); i++) 1930 for (i = 0; VEC_iterate (tree, old_ivs, i, oldiv); i++) 2679 for (i = 0; VEC_iterate (ddr_p, dependence_relations, i, ddr); i++)
|
H A D | tree-outof-ssa.c | 274 for (x = 0; VEC_iterate (tree, g->nodes, x, t); x++) 518 for (x = 0; VEC_iterate (tree, g->nodes, x, var); x++) 2173 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++) 2198 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++) 2214 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++)
|
H A D | tree-ssa-pre.c | 415 for (i = 0; VEC_iterate (tree, ve1->vuses, i, vuse1); i++) 1001 for (i = 0; VEC_iterate (tree, vuses, i, oldvuse); i++) 1524 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++) 1721 for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++) 1871 for (i = 0; VEC_iterate (tree, phis, i, phi); i++) 1905 for (i = 0; VEC_iterate (tree, phis, i, phi); i++) 2552 VEC_iterate (tree, VALUE_HANDLE_VUSES (vh), i, vuse); 3301 for (i = 0; VEC_iterate (tree, need_creation, i, stmt); i++) 3671 for (i = 0; VEC_iterate (tree, inserted_exprs, i, t); i++) 3721 for (i = 0; VEC_iterate (tre [all...] |
H A D | loop-unroll.c | 1993 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) 1999 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) 2036 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) 2042 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++)
|
H A D | opts.c | 674 VEC_iterate (char_p, flag_instrument_functions_exclude_functions, 691 VEC_iterate (char_p, flag_instrument_functions_exclude_files, i, s);
|
H A D | tree-ssa-operands.c | 1285 for (i = 0; VEC_iterate (tree, aliases, i, al); i++) 1332 for (i = 0; VEC_iterate (tree, aliases, i, al); i++) 2019 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (expr), idx, ce);
|
H A D | dwarf2out.c | 5331 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 5482 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 5765 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 6017 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 6140 for (ix = 0; VEC_iterate (dw_attr_node, die1->die_attr, ix, a1); ix++) 6514 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 6537 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 6562 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, die_a); ix++) 6627 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) 6765 for (ix = 0; VEC_iterate (dw_attr_nod [all...] |
H A D | tree-flow.h | 418 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
|
H A D | varasm.c | 4259 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), cnt, ce); 4956 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++) 4984 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++) 6209 for (i = 0; VEC_iterate (rtx, block->anchors, i, symbol); i++) 6214 for (i = 0; VEC_iterate (rtx, block->objects, i, symbol); i++)
|
/freebsd-10.3-release/contrib/gcc/cp/ |
H A D | search.c | 1344 VEC_iterate (tree, methods, i, fn); ++i) 1427 VEC_iterate (tree, method_vec, i, fn); 1459 for (; VEC_iterate (tree, method_vec, i, fn); ++i) 1691 VEC_iterate (tree, vbases, ix, base_binfo); ix++) 1799 VEC_iterate (tree, vbases, ix, base_binfo); ix++) 2319 VEC_iterate (tree, method_vec, i, conv); 2559 VEC_iterate (tree, vbases, ix, binfo); ix++)
|
H A D | class.c | 965 VEC_iterate (tree, method_vec, slot, m); 1708 VEC_iterate (tree, method_vec, slot, fn); 1753 VEC_iterate (tree, method_vec, slot, fn_fields); 1983 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++) 2404 VEC_iterate (tree, method_vec, i, fns); 3261 VEC_iterate (tree, vbases, ix, binfo); ix++) 4303 VEC_iterate (tree, friends, ix, method); ix++) 4476 VEC_iterate (tree, vbases, i, base_binfo); i++) 4523 VEC_iterate (tree, vbases, i, binfo); i++) 7258 VEC_iterate (tre [all...] |
H A D | typeck2.c | 328 for (ix = 0; VEC_iterate (tree, pure, ix, fn); ix++) 813 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
|
H A D | decl2.c | 2916 for (i = 0; VEC_iterate (tree, ssdf_decls, i, fndecl); ++i) 3202 VEC_iterate (tree, unemitted_tinfo_decls, --i, t);) 3276 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i) 3349 for (i = 0; VEC_iterate (tree, pending_statics, i, decl); ++i) 3378 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
|
H A D | semantics.c | 240 VEC_iterate (deferred_access_check, checks, i, chk) ; 244 VEC_iterate (deferred_access_check, 275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i) 331 VEC_iterate (deferred_access_check,
|
H A D | name-lookup.c | 1569 VEC_iterate(cp_class_binding, lvl->class_shadowed, i, b); 2482 VEC_iterate (cp_class_binding, level->class_shadowed, i, cb); 5057 for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i) 5113 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, sb); ++i) 5148 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, saved); ++i)
|