| /freebsd-12-stable/contrib/gcc/ |
| D | tree-ssa-alias.c | 207 for (i = 0; VEC_iterate (tree, ma, i, entry); i++) in mark_aliases_call_clobbered() 264 for (k = 0; VEC_iterate (tree, taglist, k, tag); k++) in compute_tag_properties() 279 for (i = 0; VEC_iterate (tree, ma, i, entry); i++) in compute_tag_properties() 340 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) in set_initial_properties() 524 for (i = 0; VEC_iterate (tree, calls, i, stmt); i++) in recalculate_used_alone() 1065 for (i = 0; VEC_iterate (tree, with_ptvars, i, ptr); i++) in create_name_tags() 1128 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) in compute_flow_sensitive_aliasing() 1136 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) in compute_flow_sensitive_aliasing() 1196 for (j = 0; VEC_iterate (tree, tag_ann->may_aliases, j, var); ++j) in compute_flow_insensitive_aliasing() 1575 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++) in group_aliases() [all …]
|
| D | tree-vect-analyze.c | 624 for (i = 0; VEC_iterate (lambda_vector, DDR_DIST_VECTS (ddr), i, dist_v); i++) in vect_analyze_data_ref_dependence() 689 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) in vect_analyze_data_ref_dependences() 820 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_compute_data_refs_alignment() 856 for (i = 0; VEC_iterate (dr_p, same_align_drs, i, current_dr); i++) in vect_update_misalignment_for_peel() 891 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_verify_datarefs_alignment() 1108 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_enhance_data_refs_alignment() 1141 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_enhance_data_refs_alignment() 1169 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_enhance_data_refs_alignment() 1203 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in vect_enhance_data_refs_alignment() 1265 for (i = 0; VEC_iterate (tree, may_misalign_stmts, i, stmt); i++) in vect_enhance_data_refs_alignment() [all …]
|
| D | tree-data-ref.c | 594 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in dump_data_references() 607 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) in dump_data_dependence_relations() 728 for (j = 0; VEC_iterate (lambda_vector, dir_vects, j, v); j++) in print_dir_vectors() 741 for (j = 0; VEC_iterate (lambda_vector, dist_vects, j, v); j++) in print_dist_vectors() 785 for (i = 0; VEC_iterate (loop_p, DDR_LOOP_NEST (ddr), i, loopi); i++) in dump_data_dependence_relation() 860 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) in dump_dist_dir_vectors() 863 for (j = 0; VEC_iterate (lambda_vector, DDR_DIST_VECTS (ddr), j, v); j++) in dump_dist_dir_vectors() 870 for (j = 0; VEC_iterate (lambda_vector, DDR_DIR_VECTS (ddr), j, v); j++) in dump_dist_dir_vectors() 889 for (i = 0; VEC_iterate (ddr_p, ddrs, i, ddr); i++) in dump_ddrs() 3491 for (i = 0; VEC_iterate (lambda_vector, DDR_DIST_VECTS (ddr), i, v); i++) in save_dist_v() [all …]
|
| D | tree-ssa-structalias.c | 570 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) in dump_constraints() 691 for (i = 0; VEC_iterate (constraint_t, *from, i, c); i++) in constraint_set_union() 808 for (i = 0; VEC_iterate (constraint_t, graph->complex[from], i, c); i++) in merge_node_constraints() 989 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) in build_pred_graph() 1048 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) in build_succ_graph() 1905 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++) in move_complex_constraints() 2012 VEC_iterate (unsigned, queue, queuepos, i); in eliminate_indirect_cycles() 2107 for (j = 0; VEC_iterate (constraint_t, complex, j, c); j++) in solve_graph() 2484 for (i = 0; VEC_iterate (ce_s, *constraints, i, c); i++) in do_deref() 2610 for (i = 0; VEC_iterate (ce_s, *results, i, c); i++) in get_constraint_for() [all …]
|
| D | tree-loop-linear.c | 108 for (i = 0; VEC_iterate (ddr_p, dependence_relations, i, ddr); i++) in gather_interchange_stats() 134 for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++) in gather_interchange_stats()
|
| D | loop-invariant.c | 496 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) in merge_identical_invariants() 1022 for (invno = 0; VEC_iterate (invariant_p, invariants, invno, inv); invno++) in best_gain_for_invariant() 1097 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) in find_invariants_to_move() 1241 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) in move_invariants() 1282 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) in free_inv_motion_data()
|
| D | tree-vn.c | 167 for (i = 0; VEC_iterate (tree, ve1->vuses, i, vuse1); i++) in val_expr_pair_expr_eq() 343 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++) in print_creation_to_file()
|
| D | tree-ssa-reassoc.c | 511 VEC_iterate (operand_entry_t, *ops, i, oe) in eliminate_plus_minus_pair() 569 VEC_iterate (operand_entry_t, *ops, i, oe) in eliminate_not_pairs() 783 for (i = 0; VEC_iterate (operand_entry_t, *ops, i, oe);) in optimize_ops_list() 1206 for (i = 0; VEC_iterate (tree, broken_up_subtracts, i, negate); i++) in repropagate_negates() 1390 for (i = 0; VEC_iterate (operand_entry_t, ops, i, oe); i++) in dump_ops_vector()
|
| D | tree-ssa.c | 390 for (j = 0; VEC_iterate (tree, may_aliases, j, alias); j++) in verify_flow_insensitive_alias_info() 551 for (i = 0; VEC_iterate (tree, aliases, i, alias); i++) in verify_name_tags() 574 for (i = 0; VEC_iterate (bitmap, pt_vars_for_reps, i, first); i++) in verify_name_tags() 576 for (j = i + 1; VEC_iterate (bitmap, pt_vars_for_reps, j, second); j++) in verify_name_tags()
|
| D | tree-ssa-pre.c | 415 for (i = 0; VEC_iterate (tree, ve1->vuses, i, vuse1); i++) in expr_pred_trans_eq() 1001 for (i = 0; VEC_iterate (tree, vuses, i, oldvuse); i++) in VEC() 1524 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++) in vuses_dies_in_block_x() 1721 for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++) in compute_antic_aux() 1871 for (i = 0; VEC_iterate (tree, phis, i, phi); i++) in compute_vuse_representatives() 1905 for (i = 0; VEC_iterate (tree, phis, i, phi); i++) in compute_vuse_representatives() 2552 VEC_iterate (tree, VALUE_HANDLE_VUSES (vh), i, vuse); in insert_into_preds_of_block() 3301 for (i = 0; VEC_iterate (tree, need_creation, i, stmt); i++) in realify_fake_stores() 3671 for (i = 0; VEC_iterate (tree, inserted_exprs, i, t); i++) in remove_dead_inserted_code() 3721 for (i = 0; VEC_iterate (tree, inserted_exprs, i, t); i++) in remove_dead_inserted_code()
|
| D | lambda-code.c | 1135 for (i = 0; VEC_iterate (tree, outerinductionvars, i, iv); i++) in gcc_tree_to_linear_expression() 1148 for (i = 0; VEC_iterate (tree, invariants, i, invar); i++) in gcc_tree_to_linear_expression() 1511 for (i = 0; VEC_iterate (lambda_loop, loops, i, newloop); i++) in gcc_loopnest_to_lambda_loopnest() 1551 for (i = 0; VEC_iterate (tree, induction_vars, i, iv); i++) in lbv_to_gcc_expression() 1646 for (i = 0; VEC_iterate (tree, induction_vars, i, iv); i++) in lle_to_gcc_expression() 1688 for (i = 0; VEC_iterate (tree, invariants, i, invar); i++) in lle_to_gcc_expression() 1930 for (i = 0; VEC_iterate (tree, old_ivs, i, oldiv); i++) in lambda_loopnest_to_gcc_loopnest() 2679 for (i = 0; VEC_iterate (ddr_p, dependence_relations, i, ddr); i++) in lambda_transform_legal_p()
|
| D | loop-unroll.c | 1993 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) in insert_var_expansion_initialization() 1999 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) in insert_var_expansion_initialization() 2036 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) in combine_var_copies_in_loop_exit() 2042 for (i = 0; VEC_iterate (rtx, ve->var_expansions, i, var); i++) in combine_var_copies_in_loop_exit()
|
| D | tree-data-ref.h | 306 for (var_index = 0; VEC_iterate (loop_p, loop_nest, var_index, loopi); in index_in_loop_nest()
|
| D | tree-outof-ssa.c | 274 for (x = 0; VEC_iterate (tree, g->nodes, x, t); x++) in elim_graph_add_node() 518 for (x = 0; VEC_iterate (tree, g->nodes, x, var); x++) in eliminate_phi() 2173 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++) in analyze_edges_for_bb() 2198 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++) in analyze_edges_for_bb() 2214 for (x = 0; VEC_iterate (edge, edge_leader, x, leader); x++) in analyze_edges_for_bb()
|
| D | dwarf2out.c | 5324 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in get_AT() 5475 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in remove_AT() 5757 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in print_die() 6008 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in die_checksum() 6131 for (ix = 0; VEC_iterate (dw_attr_node, die1->die_attr, ix, a1); ix++) in same_die_p() 6505 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in output_location_lists() 6528 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in build_abbrev_table() 6553 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, die_a); ix++) in build_abbrev_table() 6617 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in size_of_die() 6755 for (ix = 0; VEC_iterate (dw_attr_node, die->die_attr, ix, a); ix++) in unmark_all_dies() [all …]
|
| D | opts.c | 674 VEC_iterate (char_p, flag_instrument_functions_exclude_functions, in flag_instrument_functions_exclude_p() 691 VEC_iterate (char_p, flag_instrument_functions_exclude_files, i, s); in flag_instrument_functions_exclude_p()
|
| D | tree-ssa-operands.c | 1285 for (i = 0; VEC_iterate (tree, aliases, i, al); i++) in add_virtual_operand() 1332 for (i = 0; VEC_iterate (tree, aliases, i, al); i++) in add_virtual_operand() 2019 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (expr), idx, ce); in get_expr_operands()
|
| D | tree-flow.h | 418 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
|
| /freebsd-12-stable/contrib/gcc/cp/ |
| D | search.c | 1342 VEC_iterate (tree, methods, i, fn); ++i) in lookup_conversion_operator() 1425 VEC_iterate (tree, method_vec, i, fn); in lookup_fnfields_1() 1457 for (; VEC_iterate (tree, method_vec, i, fn); ++i) in lookup_fnfields_1() 1688 VEC_iterate (tree, vbases, ix, base_binfo); ix++) in dfs_walk_once() 1796 VEC_iterate (tree, vbases, ix, base_binfo); ix++) in dfs_walk_once_accessible() 2314 VEC_iterate (tree, method_vec, i, conv); in lookup_conversions_r() 2554 VEC_iterate (tree, vbases, ix, binfo); ix++) in binfo_for_vbase()
|
| D | decl2.c | 2911 for (i = 0; VEC_iterate (tree, ssdf_decls, i, fndecl); ++i) in generate_ctor_or_dtor_function() 3197 VEC_iterate (tree, unemitted_tinfo_decls, --i, t);) in emit_instantiate_pending_templates() 3271 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i) in emit_instantiate_pending_templates() 3344 for (i = 0; VEC_iterate (tree, pending_statics, i, decl); ++i) in emit_instantiate_pending_templates() 3373 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i) in emit_deferred()
|
| D | class.c | 963 VEC_iterate (tree, method_vec, slot, m); in add_method() 1704 VEC_iterate (tree, method_vec, slot, fn); in resort_type_method_vec() 1749 VEC_iterate (tree, method_vec, slot, fn_fields); in finish_struct_methods() 1979 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++) in get_vcall_index() 2400 VEC_iterate (tree, method_vec, i, fns); in warn_hidden() 3257 VEC_iterate (tree, vbases, ix, binfo); ix++) in walk_subobject_offsets() 4299 VEC_iterate (tree, friends, ix, method); ix++) in fixup_inline_methods() 4472 VEC_iterate (tree, vbases, i, base_binfo); i++) in end_of_class() 4519 VEC_iterate (tree, vbases, i, binfo); i++) in warn_about_ambiguous_bases() 7250 VEC_iterate (tree, vbases, ix, vbinfo); ix++) in build_vtbl_initializer() [all …]
|
| D | typeck2.c | 327 for (ix = 0; VEC_iterate (tree, pure, ix, fn); ix++) in abstract_virtuals_error() 809 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i) in process_init_constructor_array()
|
| D | semantics.c | 240 VEC_iterate (deferred_access_check, checks, i, chk) ; in pop_to_parent_deferring_access_checks() 244 VEC_iterate (deferred_access_check, in pop_to_parent_deferring_access_checks() 275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i) in perform_access_checks() 331 VEC_iterate (deferred_access_check, in perform_or_defer_access_check()
|
| D | name-lookup.c | 1567 VEC_iterate(cp_class_binding, lvl->class_shadowed, i, b); in print_binding_level() 2478 VEC_iterate (cp_class_binding, level->class_shadowed, i, cb); in poplevel_class() 5051 for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i) in store_class_bindings() 5107 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, sb); ++i) in push_to_top_level() 5142 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, saved); ++i) in pop_from_top_level()
|
| D | mangle.c | 350 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i) in dump_substitution_candidates() 417 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++) in add_substitution()
|