Home
last modified time | relevance | path

Searched refs:VEC_length (Results 1 – 25 of 66) sorted by relevance

123

/freebsd-11-stable/contrib/gcc/
HDtree-ssa-operands.c184 int num = VEC_length (tree, list); in operand_build_sort_virtual()
204 VEC_length (tree, list), in operand_build_sort_virtual()
473 while (old_ops && new_i < VEC_length (tree, build_defs)) in finalize_ssa_def_ops()
498 for ( ; new_i < VEC_length (tree, build_defs); new_i++) in finalize_ssa_def_ops()
520 gcc_assert (x == VEC_length (tree, build_defs)); in finalize_ssa_def_ops()
530 unsigned int num = VEC_length (tree, build_defs); in finalize_ssa_defs()
566 for (new_i = 0; new_i < VEC_length (tree, build_uses); new_i++) in finalize_ssa_use_ops()
580 gcc_assert (x == VEC_length (tree, build_uses)); in finalize_ssa_use_ops()
593 unsigned num = VEC_length (tree, build_uses); in finalize_ssa_uses()
626 while (old_ops && new_i < VEC_length (tree, build_v_may_defs)) in finalize_ssa_v_may_def_ops()
[all …]
HDtree-ssa-reassoc.c460 if (VEC_length (operand_entry_t, *ops) == 2) in eliminate_duplicate_pair()
597 += VEC_length (operand_entry_t, *ops) - 1; in eliminate_not_pairs()
628 if (VEC_length (operand_entry_t, *ops) != 1) in eliminate_using_constants()
634 += VEC_length (operand_entry_t, *ops) - 1; in eliminate_using_constants()
644 if (VEC_length (operand_entry_t, *ops) != 1) in eliminate_using_constants()
656 if (VEC_length (operand_entry_t, *ops) != 1) in eliminate_using_constants()
662 += VEC_length (operand_entry_t, *ops) - 1; in eliminate_using_constants()
672 if (VEC_length (operand_entry_t, *ops) != 1) in eliminate_using_constants()
684 if (VEC_length (operand_entry_t, *ops) != 1) in eliminate_using_constants()
690 += VEC_length (operand_entry_t, *ops) - 1; in eliminate_using_constants()
[all …]
HDtree-vn.c164 if (VEC_length (tree, ve1->vuses) != VEC_length (tree, ve2->vuses)) in val_expr_pair_expr_eq()
231 if (VEC_length (tree, shared_lookup_vuses) > 1)
337 if (vuses && VEC_length (tree, vuses) != 0) in print_creation_to_file()
346 if (VEC_length (tree, vuses) - 1 != i) in print_creation_to_file()
389 if (VEC_length (tree, vuses) > 1) in sort_vuses()
391 VEC_length (tree, vuses), in sort_vuses()
HDtree-data-ref.h122 #define DR_NUM_DIMENSIONS(DR) VEC_length (tree, DR_ACCESS_FNS (DR))
252 #define DDR_NUM_SUBSCRIPTS(DDR) VEC_length (subscript_p, DDR_SUBSCRIPTS (DDR))
257 #define DDR_NB_LOOPS(DDR) (VEC_length (loop_p, DDR_LOOP_NEST (DDR)))
262 (VEC_length (lambda_vector, DDR_DIST_VECTS (DDR)))
264 (VEC_length (lambda_vector, DDR_DIR_VECTS (DDR)))
HDgenextract.c119 op_count = VEC_length (locstr, acc.oplocs); in gen_insn()
120 dup_count = VEC_length (locstr, acc.duplocs); in gen_insn()
121 gcc_assert (dup_count == VEC_length (int, acc.dupnums)); in gen_insn()
189 if (ix < VEC_length (locstr, *vp)) in VEC_safe_set_locstr()
196 while (ix > VEC_length (locstr, *vp)) in VEC_safe_set_locstr()
207 size_t n = VEC_length (char, v); in VEC_char_to_string()
HDtree-ssa-structalias.c485 #define FIRST_REF_NODE (VEC_length (varinfo_t, varmap))
674 if (place >= VEC_length (constraint_t, vec)) in constraint_vec_find()
789 if (place >= VEC_length (constraint_t, complex) in insert_into_complex()
961 graph->size = (VEC_length (varinfo_t, varmap)) * 3; in build_pred_graph()
965 graph->indirect_cycles = XNEWVEC (int, VEC_length (varinfo_t, varmap)); in build_pred_graph()
970 VEC_length (varinfo_t, varmap)); in build_pred_graph()
986 for (j = 0; j < VEC_length (varinfo_t, varmap); j++) in build_pred_graph()
1159 if (VEC_length (unsigned, si->scc_stack) > 0 in scc_visit()
1169 while (VEC_length (unsigned, si->scc_stack) != 0 in scc_visit()
1281 size_t size = VEC_length (varinfo_t, varmap); in init_topo_info()
[all …]
HDtree-ssa-propagate.c192 if (cfg_blocks_num > VEC_length (basic_block, cfg_blocks)) in cfg_blocks_add()
199 cfg_blocks_tail = VEC_length (basic_block, cfg_blocks); in cfg_blocks_add()
210 % VEC_length (basic_block, cfg_blocks)); in cfg_blocks_add()
214 cfg_blocks_head = VEC_length (basic_block, cfg_blocks); in cfg_blocks_add()
240 % VEC_length (basic_block, cfg_blocks)); in cfg_blocks_get()
368 while (VEC_length (tree, *worklist) > 0) in process_ssa_edge_worklist()
693 || VEC_length (tree, interesting_ssa_edges) > 0 in ssa_propagate()
694 || VEC_length (tree, varying_ssa_edges) > 0) in ssa_propagate()
HDdomwalk.c171 if (VEC_length (void_p, walk_data->free_block_data) > 0) in walk_dominator_tree()
282 while (VEC_length (void_p, walk_data->free_block_data) > 0) in fini_walk_dominator_tree()
HDgenautomata.c3228 VEC_length (alt_state_t, alt_states), in uniq_sort_alt_states()
3232 for (i = 1; i < VEC_length (alt_state_t, alt_states); i++) in uniq_sort_alt_states()
3242 for (i = 1; i < VEC_length (alt_state_t, alt_states); i++) in uniq_sort_alt_states()
4933 while (VEC_length (unit_usage_t, cycle_alt_unit_usages) < length)
5028 for (i = 0; i < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages); i++) in check_regexp_units_distribution()
5038 k < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages) in check_regexp_units_distribution()
5054 if (k < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages) in check_regexp_units_distribution()
5265 for (i = 0; i < VEC_length (ainsn_t, last_insns); i++) in form_ainsn_with_same_reservs()
5271 if (i < VEC_length (ainsn_t, last_insns)) in form_ainsn_with_same_reservs()
5338 while (VEC_length (state_t, state_stack) != 0) in make_automaton()
[all …]
HDtree-outof-ssa.c262 return VEC_length (tree, g->nodes); in elim_graph_size()
299 for (x = 0; x < VEC_length (int, g->edge_list); x += 2) in elim_graph_remove_succ_edge()
319 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
338 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
501 gcc_assert (VEC_length (tree, g->const_copies) == 0); in eliminate_phi()
526 while (VEC_length (int, g->stack) > 0) in eliminate_phi()
535 while (VEC_length (tree, g->const_copies) > 0) in eliminate_phi()
2156 gcc_assert (VEC_length (edge, edge_leader) == 0); in analyze_edges_for_bb()
2157 gcc_assert (VEC_length (tree, stmt_list) == 0); in analyze_edges_for_bb()
HDc-pragma.c630 = VEC_length (visibility, visstack) != 0; in pop_visibility()
659 if (!VEC_length (visibility, visstack)) in handle_pragma_visibility()
747 id = VEC_length (pragma_handler, registered_pragmas);
HDtree-ssa-alias.c246 VEC_length (tree, taglist), in compute_tag_properties()
415 while (VEC_length (tree, worklist) != 0) in compute_call_clobbered()
1596 gcc_assert (VEC_length (tree, ann->may_aliases) == 1); in group_aliases()
2753 && (VEC_length (tree, aliases) == 1)) in add_may_alias_for_new_tag()
2820 len = VEC_length (tree, overlaps); in new_type_alias()
3008 if (VEC_length (fieldoff_s, fieldstack) != 0) in create_overlap_variables_for()
3076 for (i = VEC_length (fieldoff_s, fieldstack); in create_overlap_variables_for()
HDtree-ssa-dce.c479 while (VEC_length (tree, worklist) > 0) in propagate_necessity()
609 while (VEC_length (tree, worklist) > 0) in mark_really_necessary_kill_operand_phis()
HDtree-into-ssa.c271 unsigned len = VEC_length (ssa_name_info_p, info_for_ssa_name); in get_ssa_name_ann()
916 top = VEC_index (int, worklist, VEC_length (int, worklist) - 1); in prune_unused_phi_nodes()
1031 while (VEC_length (int, work_stack) > 0) in find_idf()
1106 for (i = VEC_length (tree_vec, phis_to_rewrite); i <= idx; i++) in mark_phi_for_rewrite()
1430 while (VEC_length (tree, block_defs_stack) > 0) in rewrite_finalize_block()
1696 while (VEC_length (tree, block_defs_stack) > 0) in rewrite_update_fini_block()
HDprofile.c174 for (i = 0; i < VEC_length (histogram_value, values); i++) in instrument_values()
622 for (i = 0; i < VEC_length (histogram_value, values); i++) in compute_value_histograms()
647 for (i = 0; i < VEC_length (histogram_value, values); i++) in compute_value_histograms()
HDfunction.c554 if (level >= (int) VEC_length (temp_slot_p, used_temp_slots)) in temp_slots_at_level()
556 size_t old_length = VEC_length (temp_slot_p, used_temp_slots); in temp_slots_at_level()
576 return VEC_length (temp_slot_p, used_temp_slots) - 1; in max_slot_level()
3927 gcc_assert (VEC_length (int, prologue) == 0); in init_function_for_compilation()
3928 gcc_assert (VEC_length (int, epilogue) == 0); in init_function_for_compilation()
3929 gcc_assert (VEC_length (int, sibcall_epilogue) == 0); in init_function_for_compilation()
4651 for (j = VEC_length (int, *vec) - 1; j >= 0; --j) in contains()
4659 for (j = VEC_length (int, *vec) - 1; j >= 0; --j) in contains()
5577 if ((len = VEC_length (int, prologue)) > 0) in reposition_prologue_and_epilogue_notes()
5618 if ((len = VEC_length (int, epilogue)) > 0) in reposition_prologue_and_epilogue_notes()
[all …]
HDalias.c222 (REGNO (X) < VEC_length (rtx, reg_base_value) \
636 return VEC_length (alias_set_entry, alias_sets) - 1; in new_alias_set()
818 && regno < VEC_length (rtx, reg_base_value)) in find_base_value()
971 gcc_assert (regno < VEC_length (rtx, reg_base_value)); in record_set()
2436 sizeof (rtx) * VEC_length (rtx, reg_base_value)); in init_alias_analysis()
HDloop-invariant.c493 htab_t eq = htab_create (VEC_length (invariant_p, invariants), in merge_identical_invariants()
652 inv->invno = VEC_length (invariant_p, invariants); in create_new_invariant()
1077 if (!VEC_length (invariant_p, invariants)) in find_invariants_to_move()
HDcfglayout.c424 int max = VEC_length (int, block_locators_locs); in insn_scope()
464 int max = VEC_length (int, line_locators_locs); in locator_line()
498 int max = VEC_length (int, file_locators_locs); in locator_file()
HDtree-loop-linear.c181 if (VEC_length (ddr_p, dependence_relations) == 0) in try_interchange_loops()
HDtree-eh.c516 int n = VEC_length (tree, tf->dest_array); in maybe_record_in_goto_queue()
1069 return_index = VEC_length (tree, tf->dest_array); in lower_try_finally_copy()
1158 nlabels = VEC_length (tree, tf->dest_array); in lower_try_finally_switch()
1392 ndests = VEC_length (tree, this_tf.dest_array); in lower_try_finally()
HDtree-vect-analyze.c1217 || VEC_length (tree, in vect_enhance_data_refs_alignment()
1250 if (VEC_length (tree, LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo)) == 0) in vect_enhance_data_refs_alignment()
1667 while (VEC_length (tree, worklist) > 0) in vect_mark_stmts_to_be_vectorized()
HDtree-cfg.c184 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks) in build_tree_cfg()
186 size_t old_size = VEC_length (basic_block, basic_block_info); in build_tree_cfg()
397 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info)) in create_bb()
399 size_t old_size = VEC_length (basic_block, basic_block_info); in create_bb()
840 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map) in label_to_block_fn()
2785 unsigned old_len = VEC_length (basic_block, label_to_block_map); in set_bb_for_stmt()
4714 old_len = VEC_length (basic_block, cfg->x_basic_block_info); in move_block_to_fn()
4752 old_len = VEC_length (basic_block, cfg->x_label_to_block_map); in move_block_to_fn()
4950 gcc_assert (VEC_length (basic_block, bbs) >= 2); in move_sese_region_to_fn()
/freebsd-11-stable/contrib/gcc/cp/
HDtypeck2.c319 if (VEC_length (tree, pure)) in abstract_virtuals_error()
807 gcc_assert (VEC_length (constructor_elt, v) <= len); in process_init_constructor_array()
903 if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init))) in process_init_constructor_record()
987 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) == 1); in process_init_constructor_union()
HDdecl2.c653 if (VEC_length (tree, methods) > (size_t) ++ix) in check_classfn()
3196 for (i = VEC_length (tree, unemitted_tinfo_decls); in emit_instantiate_pending_templates()
3354 if (VEC_length (tree, pending_statics) != 0 in emit_instantiate_pending_templates()
3356 VEC_length (tree, pending_statics))) in emit_instantiate_pending_templates()
3435 if (VEC_length (tree, pending_statics) != 0) in emit_deferred()
3438 VEC_length (tree, pending_statics)); in emit_deferred()
3440 VEC_length (tree, pending_statics)); in emit_deferred()

123