Home
last modified time | relevance | path

Searched refs:ssa_name (Results 1 – 25 of 90) sorted by relevance

1234

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa.c571 names.quick_push (ssa_name (j)); in release_defs_bitset()
749 verify_ssa_name (tree ssa_name, bool is_virtual) in verify_ssa_name() argument
751 if (TREE_CODE (ssa_name) != SSA_NAME) in verify_ssa_name()
757 if (SSA_NAME_IN_FREE_LIST (ssa_name)) in verify_ssa_name()
763 if (SSA_NAME_VAR (ssa_name) != NULL_TREE in verify_ssa_name()
764 && TREE_TYPE (ssa_name) != TREE_TYPE (SSA_NAME_VAR (ssa_name))) in verify_ssa_name()
770 if (is_virtual && !virtual_operand_p (ssa_name)) in verify_ssa_name()
776 if (is_virtual && SSA_NAME_VAR (ssa_name) != gimple_vop (cfun)) in verify_ssa_name()
782 if (!is_virtual && virtual_operand_p (ssa_name)) in verify_ssa_name()
788 if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) in verify_ssa_name()
[all …]
H A Dtree-ssanames.h63 #define ssa_name(i) ((*cfun->gimple_df->ssa_names)[(i)]) macro
150 tree ssa_name; in make_temp_ssa_name() local
152 ssa_name = make_ssa_name_fn (cfun, type, stmt); in make_temp_ssa_name()
153 SET_SSA_NAME_VAR_OR_IDENTIFIER (ssa_name, get_identifier (name)); in make_temp_ssa_name()
154 return ssa_name; in make_temp_ssa_name()
H A Dtree-complex.c193 tree parm, ssa_name; in init_parameter_lattice_values() local
197 && (ssa_name = ssa_default_def (cfun, parm)) != NULL_TREE) in init_parameter_lattice_values()
198 complex_lattice_values[SSA_NAME_VERSION (ssa_name)] = VARYING; in init_parameter_lattice_values()
492 get_component_ssa_name (tree ssa_name, bool imag_p) in get_component_ssa_name() argument
494 complex_lattice_t lattice = find_lattice_value (ssa_name); in get_component_ssa_name()
500 tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name)); in get_component_ssa_name()
507 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; in get_component_ssa_name()
511 if (SSA_NAME_VAR (ssa_name)) in get_component_ssa_name()
512 ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); in get_component_ssa_name()
514 ret = TREE_TYPE (TREE_TYPE (ssa_name)); in get_component_ssa_name()
[all …]
H A Dtree-ssa-coalesce.c390 int p1 = var_to_partition (map, ssa_name (p->first_element)); in initialize_conflict_count()
391 int p2 = var_to_partition (map, ssa_name (p->second_element)); in initialize_conflict_count()
507 tree var1 = ssa_name (node->first_element); in dump_coalesce_list()
508 tree var2 = ssa_name (node->second_element); in dump_coalesce_list()
523 var = ssa_name (node->first_element); in dump_coalesce_list()
526 var = ssa_name (node->second_element); in dump_coalesce_list()
999 print_generic_expr (stderr, ssa_name (x), TDF_SLIM); in fail_abnormal_edge_coalesce()
1001 print_generic_stmt (stderr, ssa_name (y), TDF_SLIM); in fail_abnormal_edge_coalesce()
1326 p1 = var_to_partition (map, ssa_name (x)); in attempt_coalesce()
1327 p2 = var_to_partition (map, ssa_name (y)); in attempt_coalesce()
[all …]
H A Dgimple-ssa.h57 return item->ssa_name.var->decl_minimal.uid; in hash()
65 return (a->ssa_name.var->decl_minimal.uid == b->ssa_name.var->decl_minimal.uid); in equal()
H A Dtree-ssanames.c223 if (ssa_name (i) && SSA_NAME_IS_DEFAULT_DEF (ssa_name (i))) in verify_ssaname_freelists()
236 gcc_assert (!ssa_name (i)); in verify_ssaname_freelists()
265 imm->loc.ssa_name = name; in init_ssa_name_imm_use()
623 imm->loc.ssa_name = var; in release_ssa_name_fn()
884 replace_ssa_name_symbol (tree ssa_name, tree sym) in replace_ssa_name_symbol() argument
886 SET_SSA_NAME_VAR_OR_IDENTIFIER (ssa_name, sym); in replace_ssa_name_symbol()
887 TREE_TYPE (ssa_name) = TREE_TYPE (sym); in replace_ssa_name_symbol()
906 tree name = ssa_name (i); in release_free_names_and_compact_live_names()
H A Dtree-ssa-live.c217 if (ssa_name (tmp) != NULL_TREE && !virtual_operand_p (ssa_name (tmp)) in partition_view_init()
218 && (!has_zero_uses (ssa_name (tmp)) in partition_view_init()
219 || !SSA_NAME_IS_DEFAULT_DEF (ssa_name (tmp)) in partition_view_init()
220 || (SSA_NAME_VAR (ssa_name (tmp)) in partition_view_init()
221 && !VAR_P (SSA_NAME_VAR (ssa_name (tmp)))))) in partition_view_init()
1041 set_var_live_on_entry (tree ssa_name, tree_live_info_p live) in set_var_live_on_entry() argument
1050 p = var_to_partition (live->map, ssa_name); in set_var_live_on_entry()
1054 stmt = SSA_NAME_DEF_STMT (ssa_name); in set_var_live_on_entry()
1066 if (ssa_undefined_value_p (ssa_name, false)) in set_var_live_on_entry()
1071 FOR_EACH_IMM_USE_FAST (use, imm_iter, ssa_name) in set_var_live_on_entry()
[all …]
H A Dsese.c107 tree name = ssa_name (i); in sese_reset_debug_liveouts()
214 if (!virtual_operand_p (ssa_name (i))) in sese_insert_phis_for_liveouts()
215 sese_add_exit_phis_edge (bb, ssa_name (i), false_e, true_e); in sese_insert_phis_for_liveouts()
H A Dtree-into-ssa.c1807 register_new_update_single (new_name, ssa_name (i)); in register_new_update_set()
2554 set_def_block (ssa_name (i), bb, is_phi_p); in mark_def_interesting()
2830 prepare_def_site_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2837 prepare_def_site_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2838 prepare_use_sites_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2858 print_generic_expr (file, ssa_name (i)); in dump_names_replaced_by()
2895 dump_names_replaced_by (file, ssa_name (i)); in dump_update_ssa()
2910 print_generic_expr (file, ssa_name (i)); in dump_update_ssa()
2969 release_ssa_name (ssa_name (i)); in delete_update_ssa()
3489 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update, in update_ssa()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-ssanames.h63 #define ssa_name(i) ((*cfun->gimple_df->ssa_names)[(i)]) macro
145 tree ssa_name; in make_temp_ssa_name() local
147 ssa_name = make_ssa_name_fn (cfun, type, stmt); in make_temp_ssa_name()
148 SET_SSA_NAME_VAR_OR_IDENTIFIER (ssa_name, get_identifier (name)); in make_temp_ssa_name()
149 return ssa_name; in make_temp_ssa_name()
H A Dtree-ssa.cc570 names.quick_push (ssa_name (j)); in release_defs_bitset()
746 verify_ssa_name (tree ssa_name, bool is_virtual) in verify_ssa_name() argument
748 if (TREE_CODE (ssa_name) != SSA_NAME) in verify_ssa_name()
754 if (SSA_NAME_IN_FREE_LIST (ssa_name)) in verify_ssa_name()
760 if (SSA_NAME_VAR (ssa_name) != NULL_TREE in verify_ssa_name()
761 && TREE_TYPE (ssa_name) != TREE_TYPE (SSA_NAME_VAR (ssa_name))) in verify_ssa_name()
767 if (is_virtual && !virtual_operand_p (ssa_name)) in verify_ssa_name()
773 if (is_virtual && SSA_NAME_VAR (ssa_name) != gimple_vop (cfun)) in verify_ssa_name()
779 if (!is_virtual && virtual_operand_p (ssa_name)) in verify_ssa_name()
785 if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) in verify_ssa_name()
[all …]
H A Dtree-complex.cc195 tree parm, ssa_name; in init_parameter_lattice_values() local
199 && (ssa_name = ssa_default_def (cfun, parm)) != NULL_TREE) in init_parameter_lattice_values()
200 complex_lattice_values[SSA_NAME_VERSION (ssa_name)] = VARYING; in init_parameter_lattice_values()
494 get_component_ssa_name (tree ssa_name, bool imag_p) in get_component_ssa_name() argument
496 complex_lattice_t lattice = find_lattice_value (ssa_name); in get_component_ssa_name()
502 tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name)); in get_component_ssa_name()
509 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; in get_component_ssa_name()
513 if (SSA_NAME_VAR (ssa_name)) in get_component_ssa_name()
514 ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); in get_component_ssa_name()
516 ret = TREE_TYPE (TREE_TYPE (ssa_name)); in get_component_ssa_name()
[all …]
H A Dtree-ssa-coalesce.cc390 int p1 = var_to_partition (map, ssa_name (p->first_element)); in initialize_conflict_count()
391 int p2 = var_to_partition (map, ssa_name (p->second_element)); in initialize_conflict_count()
507 tree var1 = ssa_name (node->first_element); in dump_coalesce_list()
508 tree var2 = ssa_name (node->second_element); in dump_coalesce_list()
523 var = ssa_name (node->first_element); in dump_coalesce_list()
526 var = ssa_name (node->second_element); in dump_coalesce_list()
999 print_generic_expr (stderr, ssa_name (x), TDF_SLIM); in fail_abnormal_edge_coalesce()
1001 print_generic_stmt (stderr, ssa_name (y), TDF_SLIM); in fail_abnormal_edge_coalesce()
1326 p1 = var_to_partition (map, ssa_name (x)); in attempt_coalesce()
1327 p2 = var_to_partition (map, ssa_name (y)); in attempt_coalesce()
[all …]
H A Dtree-ssanames.cc232 if (ssa_name (i) && SSA_NAME_IS_DEFAULT_DEF (ssa_name (i))) in verify_ssaname_freelists()
245 gcc_assert (!ssa_name (i)); in verify_ssaname_freelists()
274 imm->loc.ssa_name = name; in init_ssa_name_imm_use()
576 imm->loc.ssa_name = var; in release_ssa_name_fn()
837 replace_ssa_name_symbol (tree ssa_name, tree sym) in replace_ssa_name_symbol() argument
839 SET_SSA_NAME_VAR_OR_IDENTIFIER (ssa_name, sym); in replace_ssa_name_symbol()
840 TREE_TYPE (ssa_name) = TREE_TYPE (sym); in replace_ssa_name_symbol()
859 tree name = ssa_name (i); in release_free_names_and_compact_live_names()
H A Dgimple-ssa.h57 return item->ssa_name.var->decl_minimal.uid; in hash()
65 return (a->ssa_name.var->decl_minimal.uid == b->ssa_name.var->decl_minimal.uid); in equal()
H A Dtree-ssa-live.cc217 if (ssa_name (tmp) != NULL_TREE && !virtual_operand_p (ssa_name (tmp)) in partition_view_init()
218 && (!has_zero_uses (ssa_name (tmp)) in partition_view_init()
219 || !SSA_NAME_IS_DEFAULT_DEF (ssa_name (tmp)) in partition_view_init()
220 || (SSA_NAME_VAR (ssa_name (tmp)) in partition_view_init()
221 && !VAR_P (SSA_NAME_VAR (ssa_name (tmp)))))) in partition_view_init()
1096 set_var_live_on_entry (tree ssa_name, tree_live_info_p live) in set_var_live_on_entry() argument
1105 p = var_to_partition (live->map, ssa_name); in set_var_live_on_entry()
1109 stmt = SSA_NAME_DEF_STMT (ssa_name); in set_var_live_on_entry()
1121 if (ssa_undefined_value_p (ssa_name, false)) in set_var_live_on_entry()
1126 FOR_EACH_IMM_USE_FAST (use, imm_iter, ssa_name) in set_var_live_on_entry()
[all …]
H A Dgimple-range-path.cc124 tree name = ssa_name (i); in dump()
436 tree name = ssa_name (i); in compute_ranges_in_block()
446 tree name = ssa_name (i); in compute_ranges_in_block()
477 tree name = ssa_name (i); in compute_ranges_in_block()
518 tree name = ssa_name (i); in adjust_for_non_null_uses()
569 tree name = ssa_name (i); in compute_imports()
H A Dgimple-range-cache.cc523 print_generic_expr (f, ssa_name (x), TDF_NONE); in dump()
544 if (!gimple_range_ssa_p (ssa_name (x))) in dump()
553 print_generic_expr (f, ssa_name (x), TDF_NONE); in dump()
568 if (!gimple_range_ssa_p (ssa_name (x))) in dump()
574 print_generic_expr (f, ssa_name (x), TDF_NONE); in dump()
666 if (gimple_range_ssa_p (ssa_name (x)) && in dump()
667 get_global_range (r, ssa_name (x)) && !r.varying_p ()) in dump()
678 print_generic_expr (f, ssa_name (x), TDF_NONE); in dump()
H A Dsese.cc107 tree name = ssa_name (i); in sese_reset_debug_liveouts()
214 if (!virtual_operand_p (ssa_name (i))) in sese_insert_phis_for_liveouts()
215 sese_add_exit_phis_edge (bb, ssa_name (i), false_e, true_e); in sese_insert_phis_for_liveouts()
H A Dtree-into-ssa.cc1804 register_new_update_single (new_name, ssa_name (i)); in register_new_update_set()
2558 set_def_block (ssa_name (i), bb, is_phi_p); in mark_def_interesting()
2834 prepare_def_site_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2841 prepare_def_site_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2842 prepare_use_sites_for (ssa_name (i), insert_phi_p); in prepare_names_to_update()
2862 print_generic_expr (file, ssa_name (i)); in dump_names_replaced_by()
2899 dump_names_replaced_by (file, ssa_name (i)); in dump_update_ssa()
2914 print_generic_expr (file, ssa_name (i)); in dump_update_ssa()
2973 release_ssa_name (ssa_name (i)); in delete_update_ssa()
3493 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update, in update_ssa()
[all …]
H A Dgimple-range.cc475 tree name = ssa_name (x); in export_global_ranges()
527 tree name = ssa_name (x); in dump_bb()
548 tree name = gimple_range_ssa_p (ssa_name (x)); in dump_bb()
H A Dpointer-query.cc1371 ssa_name_limit_t::visit_phi (tree ssa_name) in visit_phi() argument
1377 return bitmap_set_bit (visited, SSA_NAME_VERSION (ssa_name)); in visit_phi()
1383 ssa_name_limit_t::leave_phi (tree ssa_name) in leave_phi() argument
1386 bitmap_clear_bit (visited, SSA_NAME_VERSION (ssa_name)); in leave_phi()
1409 ssa_name_limit_t::next_phi (tree ssa_name) in next_phi() argument
1412 gimple *def_stmt = SSA_NAME_DEF_STMT (ssa_name); in next_phi()
1415 && !visit_phi (ssa_name)) in next_phi()
1620 if (tree name = ssa_name (ver)) in dump()
H A Dtree-object-size.cc976 release_ssa_name (ssa_name (i)); in gimplify_size_expressions()
985 gimple *stmt = SSA_NAME_DEF_STMT (ssa_name (i)); in gimplify_size_expressions()
1152 check_for_plus_in_loops (&osi, ssa_name (i)); in compute_builtin_object_size()
1171 collect_object_sizes_for (&osi, ssa_name (i)); in compute_builtin_object_size()
1175 print_generic_expr (dump_file, ssa_name (i), in compute_builtin_object_size()
1194 print_generic_expr (dump_file, ssa_name (i), in compute_builtin_object_size()
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Danalyzer.cc120 maybe_reconstruct_from_def_stmt (tree ssa_name, in maybe_reconstruct_from_def_stmt() argument
124 if (visited->contains (ssa_name)) in maybe_reconstruct_from_def_stmt()
126 visited->add (ssa_name); in maybe_reconstruct_from_def_stmt()
128 gimple *def_stmt = SSA_NAME_DEF_STMT (ssa_name); in maybe_reconstruct_from_def_stmt()
H A Dregion.cc259 tree ssa_name = decl; in can_have_initial_svalue_p() local
262 if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) in can_have_initial_svalue_p()
263 && SSA_NAME_VAR (ssa_name) in can_have_initial_svalue_p()
264 && TREE_CODE (SSA_NAME_VAR (ssa_name)) == PARM_DECL) in can_have_initial_svalue_p()

1234