| /openbsd/src/gnu/gcc/gcc/ |
| D | tree-data-ref.c | 1017 if (dump_file && (dump_flags & TDF_DETAILS)) in analyze_array()
1019 fprintf (dump_file, "(analyze_array \n"); in analyze_array()
1020 fprintf (dump_file, " (ref = "); in analyze_array()
1021 print_generic_stmt (dump_file, ref, 0); in analyze_array()
1022 fprintf (dump_file, ")\n"); in analyze_array()
1043 if (dump_file && (dump_flags & TDF_DETAILS)) in analyze_array()
1044 fprintf (dump_file, ")\n"); in analyze_array()
1071 if (dump_file && (dump_flags & TDF_DETAILS)) in analyze_indirect_ref()
1073 fprintf (dump_file, "\nBad access function of ptr: "); in analyze_indirect_ref()
1074 print_generic_expr (dump_file, ref, TDF_SLIM); in analyze_indirect_ref()
[all …]
|
| D | tree-ssa-reassoc.c | 300 if (dump_file && (dump_flags & TDF_DETAILS)) in get_rank()
302 fprintf (dump_file, "Rank for "); in get_rank()
303 print_generic_expr (dump_file, e, 0); in get_rank()
304 fprintf (dump_file, " is %d\n", (rank + 1)); in get_rank()
433 if (dump_file && (dump_flags & TDF_DETAILS)) in eliminate_duplicate_pair()
435 fprintf (dump_file, "Equivalence: "); in eliminate_duplicate_pair()
436 print_generic_expr (dump_file, curr->op, 0); in eliminate_duplicate_pair()
437 fprintf (dump_file, " [&|minmax] "); in eliminate_duplicate_pair()
438 print_generic_expr (dump_file, last->op, 0); in eliminate_duplicate_pair()
439 fprintf (dump_file, " -> "); in eliminate_duplicate_pair()
[all …]
|
| D | ipa-inline.c | 526 if (dump_file) in cgraph_find_cycles()
527 fprintf (dump_file, "Cycle contains %s\n", cgraph_node_name (node)); in cgraph_find_cycles()
559 if (dump_file) in cgraph_flatten_node()
560 fprintf (dump_file, " inlining %s", cgraph_node_name (e->callee)); in cgraph_flatten_node()
564 else if (dump_file) in cgraph_flatten_node()
565 fprintf (dump_file, " !inlining %s", cgraph_node_name (e->callee)); in cgraph_flatten_node()
602 if (dump_file) in cgraph_decide_recursive_inlining()
603 fprintf (dump_file, in cgraph_decide_recursive_inlining()
629 if (dump_file) in cgraph_decide_recursive_inlining()
630 fprintf (dump_file, in cgraph_decide_recursive_inlining()
[all …]
|
| D | loop-unroll.c | 248 if (dump_file) in peel_loops_completely()
249 fprintf (dump_file, in peel_loops_completely()
293 if (dump_file) in decide_unrolling_and_peeling()
294 fprintf (dump_file, "\n;; *** Considering loop %d ***\n", loop->num); in decide_unrolling_and_peeling()
299 if (dump_file) in decide_unrolling_and_peeling()
300 fprintf (dump_file, ";; Not considering loop, cold area\n"); in decide_unrolling_and_peeling()
308 if (dump_file) in decide_unrolling_and_peeling()
309 fprintf (dump_file, in decide_unrolling_and_peeling()
318 if (dump_file) in decide_unrolling_and_peeling()
319 fprintf (dump_file, ";; Not considering loop, is not innermost\n"); in decide_unrolling_and_peeling()
[all …]
|
| D | tree-if-conv.c | 155 if (dump_file && (dump_flags & TDF_DETAILS)) in tree_if_conversion()
156 fprintf (dump_file,"-------------------------\n"); in tree_if_conversion()
221 if (dump_file && (dump_flags & TDF_DETAILS)) in tree_if_convert_stmt()
223 fprintf (dump_file, "------if-convert stmt\n"); in tree_if_convert_stmt()
224 print_generic_stmt (dump_file, t, TDF_SLIM); in tree_if_convert_stmt()
225 print_generic_stmt (dump_file, cond, TDF_SLIM); in tree_if_convert_stmt()
304 if (dump_file && (dump_flags & TDF_DETAILS)) in if_convertible_phi_p()
306 fprintf (dump_file, "-------------------------\n"); in if_convertible_phi_p()
307 print_generic_stmt (dump_file, phi, TDF_SLIM); in if_convertible_phi_p()
312 if (dump_file && (dump_flags & TDF_DETAILS)) in if_convertible_phi_p()
[all …]
|
| D | see.c | 1339 if (dump_file) in see_initialize_data_structures()
1340 df_dump (df, dump_file); in see_initialize_data_structures()
1479 fprintf (dump_file, "Property found for register %d\n", prop->regno); in see_print_register_properties()
1499 fprintf (dump_file, "Index %d for:\n", pre_extension->bitmap_index); in see_print_pre_extension_expr()
1500 print_rtl_single (dump_file, pre_extension->se_insn); in see_print_pre_extension_expr()
1520 if (dump_file) in see_delete_merged_def_extension()
1522 fprintf (dump_file, "Deleting merged def extension:\n"); in see_delete_merged_def_extension()
1523 print_rtl_single (dump_file, def_se); in see_delete_merged_def_extension()
1548 if (dump_file) in see_delete_unmerged_def_extension()
1550 fprintf (dump_file, "Deleting unmerged def extension:\n"); in see_delete_unmerged_def_extension()
[all …]
|
| D | tree-scalar-evolution.c | 582 if (dump_file) in set_scalar_evolution()
586 fprintf (dump_file, "(set_scalar_evolution \n"); in set_scalar_evolution()
587 fprintf (dump_file, " (scalar = "); in set_scalar_evolution()
588 print_generic_expr (dump_file, scalar, 0); in set_scalar_evolution()
589 fprintf (dump_file, ")\n (scalar_evolution = "); in set_scalar_evolution()
590 print_generic_expr (dump_file, chrec, 0); in set_scalar_evolution()
591 fprintf (dump_file, "))\n"); in set_scalar_evolution()
607 if (dump_file) in get_scalar_evolution()
611 fprintf (dump_file, "(get_scalar_evolution \n"); in get_scalar_evolution()
612 fprintf (dump_file, " (scalar = "); in get_scalar_evolution()
[all …]
|
| D | lcm.c | 393 if (dump_file) in pre_edge_lcm()
395 fprintf (dump_file, "Edge List:\n"); in pre_edge_lcm()
396 verify_edge_list (dump_file, edge_list); in pre_edge_lcm()
397 print_edge_list (dump_file, edge_list); in pre_edge_lcm()
398 dump_sbitmap_vector (dump_file, "transp", "", transp, last_basic_block); in pre_edge_lcm()
399 dump_sbitmap_vector (dump_file, "antloc", "", antloc, last_basic_block); in pre_edge_lcm()
400 dump_sbitmap_vector (dump_file, "avloc", "", avloc, last_basic_block); in pre_edge_lcm()
401 dump_sbitmap_vector (dump_file, "kill", "", kill, last_basic_block); in pre_edge_lcm()
417 if (dump_file) in pre_edge_lcm()
419 dump_sbitmap_vector (dump_file, "antin", "", antin, last_basic_block); in pre_edge_lcm()
[all …]
|
| D | tracer.c | 163 if (dump_file) in find_trace()
164 fprintf (dump_file, "Trace seed %i [%i]", bb->index, bb->frequency); in find_trace()
172 if (dump_file) in find_trace()
173 fprintf (dump_file, ",%i [%i]", bb->index, bb->frequency); in find_trace()
176 if (dump_file) in find_trace()
177 fprintf (dump_file, " forward %i [%i]", bb->index, bb->frequency); in find_trace()
187 if (dump_file) in find_trace()
188 fprintf (dump_file, ",%i [%i]", bb->index, bb->frequency); in find_trace()
191 if (dump_file) in find_trace()
192 fprintf (dump_file, "\n"); in find_trace()
[all …]
|
| D | profile.c | 151 if (dump_file) in instrument_edges()
152 fprintf (dump_file, "Edge %d to %d instrumented%s\n", in instrument_edges()
161 if (dump_file) in instrument_edges()
162 fprintf (dump_file, "%d edges instrumented\n", num_instr_edges); in instrument_edges()
250 if (dump_file && profile_info) in get_exec_counts()
251 fprintf(dump_file, "Merged %u profiles with maximal count %u.\n", in get_exec_counts()
341 if (dump_file) in compute_branch_probabilities()
343 fprintf (dump_file, "\nRead edge from %i to %i, count:", in compute_branch_probabilities()
345 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, in compute_branch_probabilities()
351 if (dump_file) in compute_branch_probabilities()
[all …]
|
| D | tree-ssa-propagate.c | 280 if (dump_file && (dump_flags & TDF_DETAILS)) in add_control_edge()
281 fprintf (dump_file, "Adding Destination of edge (%d -> %d) to worklist\n\n", in add_control_edge()
367 if (dump_file && (dump_flags & TDF_DETAILS)) in process_ssa_edge_worklist()
369 fprintf (dump_file, "\nSimulating statement (from ssa_edges): "); in process_ssa_edge_worklist()
370 print_generic_stmt (dump_file, stmt, dump_flags); in process_ssa_edge_worklist()
397 if (dump_file && (dump_flags & TDF_DETAILS)) in simulate_block()
398 fprintf (dump_file, "\nSimulating block %d\n", block->index); in simulate_block()
478 if (dump_file && (dump_flags & TDF_DETAILS)) in ssa_prop_init()
479 dump_immediate_uses (dump_file); in ssa_prop_init()
1036 if (dump_file && (dump_flags & TDF_DETAILS)) in replace_phi_args_in()
[all …]
|
| D | tree-loop-linear.c | 298 if (dump_file && (dump_flags & TDF_DETAILS)) in linear_transform_loops()
299 dump_ddrs (dump_file, dependence_relations); in linear_transform_loops()
309 if (dump_file) in linear_transform_loops()
310 fprintf (dump_file, "Won't transform loop. Optimal transform is the identity transform\n"); in linear_transform_loops()
317 if (dump_file) in linear_transform_loops()
318 fprintf (dump_file, "Can't transform loop, transform is illegal:\n"); in linear_transform_loops()
328 if (dump_file) in linear_transform_loops()
330 fprintf (dump_file, "Before:\n"); in linear_transform_loops()
331 print_lambda_loopnest (dump_file, before, 'i'); in linear_transform_loops()
336 if (dump_file) in linear_transform_loops()
[all …]
|
| D | tree-ssa-copy.c | 640 if (dump_file && (dump_flags & TDF_DETAILS)) in copy_prop_visit_cond_stmt()
642 fprintf (dump_file, "Trying to determine truth value of "); in copy_prop_visit_cond_stmt()
643 fprintf (dump_file, "predicate "); in copy_prop_visit_cond_stmt()
644 print_generic_stmt (dump_file, cond, 0); in copy_prop_visit_cond_stmt()
663 if (dump_file && (dump_flags & TDF_DETAILS) && *taken_edge_p) in copy_prop_visit_cond_stmt()
664 fprintf (dump_file, "\nConditional will always take edge %d->%d\n", in copy_prop_visit_cond_stmt()
686 if (dump_file && (dump_flags & TDF_DETAILS)) in copy_prop_visit_stmt()
688 fprintf (dump_file, "\nVisiting statement:\n"); in copy_prop_visit_stmt()
689 print_generic_stmt (dump_file, stmt, dump_flags); in copy_prop_visit_stmt()
690 fprintf (dump_file, "\n"); in copy_prop_visit_stmt()
[all …]
|
| D | loop-doloop.c | 190 if (dump_file) in doloop_valid_p()
191 fprintf (dump_file, "Doloop: Possible infinite iteration case.\n"); in doloop_valid_p()
211 if (dump_file) in doloop_valid_p()
212 fprintf (dump_file, "Doloop: %s\n", invalid); in doloop_valid_p()
305 if (dump_file) in doloop_modify()
307 fprintf (dump_file, "Doloop: Inserting doloop pattern ("); in doloop_modify()
309 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, desc->niter); in doloop_modify()
311 fputs ("runtime", dump_file); in doloop_modify()
312 fputs (" iterations).\n", dump_file); in doloop_modify()
493 if (dump_file) in doloop_optimize()
[all …]
|
| D | tree-stdarg.c | 288 if (dump_file && (dump_flags & TDF_DETAILS)) in va_list_counter_op()
289 fprintf (dump_file, in va_list_counter_op()
380 if (dump_file && (dump_flags & TDF_DETAILS)) in va_list_ptr_read()
381 fprintf (dump_file, in va_list_ptr_read()
474 if (dump_file && (dump_flags & TDF_DETAILS)) in check_va_list_escapes()
475 fprintf (dump_file, in check_va_list_escapes()
578 if (dump_file && (dump_flags & TDF_DETAILS)) in check_all_va_list_escapes()
580 fputs ("va_list escapes in ", dump_file); in check_all_va_list_escapes()
581 print_generic_expr (dump_file, stmt, dump_flags); in check_all_va_list_escapes()
582 fputc ('\n', dump_file); in check_all_va_list_escapes()
[all …]
|
| D | ipa-reference.c | 805 if (dump_file) in analyze_function()
806 fprintf (dump_file, "\n local analysis of %s\n", cgraph_node_name (fn)); in analyze_function()
929 if (dump_file) in static_execute()
930 dump_cgraph (dump_file); in static_execute()
958 if (dump_file) in static_execute()
959 fprintf (dump_file, "Not TREE_ADDRESSABLE var %s\n", in static_execute()
984 if (dump_file) in static_execute()
985 fprintf (dump_file, "read-only var %s\n", in static_execute()
992 if (dump_file) in static_execute()
993 fprintf (dump_file, "read-only constant %s\n", in static_execute()
[all …]
|
| D | tree-outof-ssa.c | 200 if (dump_file && (dump_flags & TDF_DETAILS)) in insert_copy_on_edge()
202 fprintf (dump_file, in insert_copy_on_edge()
206 print_generic_expr (dump_file, copy, dump_flags); in insert_copy_on_edge()
207 fprintf (dump_file, "\n"); in insert_copy_on_edge()
650 if (dump_file && (dump_flags & TDF_DETAILS)) in coalesce_abnormal_edges()
652 print_exprs_edge (dump_file, e, in coalesce_abnormal_edges()
844 if (dump_file && (dump_flags & TDF_DETAILS)) in coalesce_ssa_name()
846 fprintf (dump_file, "Before sorting:\n"); in coalesce_ssa_name()
847 dump_coalesce_list (dump_file, cl); in coalesce_ssa_name()
852 if (dump_file && (dump_flags & TDF_DETAILS)) in coalesce_ssa_name()
[all …]
|
| D | bt-load.c | 325 if (dump_file) in add_btr_def()
326 fprintf (dump_file, in add_btr_def()
369 if (dump_file) in new_btr_user()
371 fprintf (dump_file, "Uses target reg: { bb %d, insn %d }", in new_btr_user()
375 fprintf (dump_file, ": unambiguous use of reg %d\n", in new_btr_user()
389 fprintf (dump_file, " %d", reg); in dump_hard_reg_set()
396 fprintf (dump_file, "BB%d live:", bb); in dump_btrs_live()
398 fprintf (dump_file, "\n"); in dump_btrs_live()
611 if (dump_file) in compute_defs_uses_and_gen()
733 if (dump_file) in link_btr_uses()
[all …]
|
| D | tree-ssa-dce.c | 232 if (dump_file && (dump_flags & TDF_DETAILS)) in mark_stmt_necessary()
234 fprintf (dump_file, "Marking useful stmt: "); in mark_stmt_necessary()
235 print_generic_stmt (dump_file, stmt, TDF_SLIM); in mark_stmt_necessary()
236 fprintf (dump_file, "\n"); in mark_stmt_necessary()
476 if (dump_file && (dump_flags & TDF_DETAILS)) in propagate_necessity()
477 fprintf (dump_file, "\nProcessing worklist:\n"); in propagate_necessity()
484 if (dump_file && (dump_flags & TDF_DETAILS)) in propagate_necessity()
486 fprintf (dump_file, "processing: "); in propagate_necessity()
487 print_generic_stmt (dump_file, i, TDF_SLIM); in propagate_necessity()
488 fprintf (dump_file, "\n"); in propagate_necessity()
[all …]
|
| D | modulo-sched.c | 832 if (dump_file) in loop_canon_p()
836 fprintf (dump_file, "SMS loop many exits "); in loop_canon_p()
841 fprintf (dump_file, " %s %d (file, line)\n", in loop_canon_p()
850 if (dump_file) in loop_canon_p()
854 fprintf (dump_file, "SMS loop many BBs. "); in loop_canon_p()
859 fprintf (dump_file, " %s %d (file, line)\n", in loop_canon_p()
943 if (dump_file) in sms_schedule()
944 df_dump (df, dump_file); in sms_schedule()
962 if (dump_file) in sms_schedule()
963 fprintf (dump_file, "SMS reached MAX_PASSES... \n"); in sms_schedule()
[all …]
|
| D | tree-object-size.c | 350 if (dump_file) in compute_builtin_object_size()
352 fprintf (dump_file, "Computing %s %sobject size for ", in compute_builtin_object_size()
355 print_generic_expr (dump_file, ptr, dump_flags); in compute_builtin_object_size()
356 fprintf (dump_file, ":\n"); in compute_builtin_object_size()
418 if (dump_file && (dump_flags & TDF_DETAILS)) in compute_builtin_object_size()
420 fprintf (dump_file, "Reexamining "); in compute_builtin_object_size()
421 print_generic_expr (dump_file, ssa_name (i), in compute_builtin_object_size()
423 fprintf (dump_file, "\n"); in compute_builtin_object_size()
435 if (dump_file) in compute_builtin_object_size()
441 print_generic_expr (dump_file, ssa_name (i), in compute_builtin_object_size()
[all …]
|
| D | passes.c | 219 dump_file = dump_begin (pass_profile.static_pass_number, NULL); in finish_optimization_passes()
221 if (dump_file) in finish_optimization_passes()
222 dump_end (pass_profile.static_pass_number, dump_file); in finish_optimization_passes()
227 dump_file = dump_begin (pass_combine.static_pass_number, NULL); in finish_optimization_passes()
228 if (dump_file) in finish_optimization_passes()
230 dump_combine_total_stats (dump_file); in finish_optimization_passes()
231 dump_end (pass_combine.static_pass_number, dump_file); in finish_optimization_passes()
762 && dump_file && current_function_decl) in execute_todo()
766 dump_file, dump_flags); in execute_todo()
770 print_rtl_slim_with_bb (dump_file, get_insns (), dump_flags); in execute_todo()
[all …]
|
| D | tree-ssa-loop-ivcanon.c | 80 if (dump_file && (dump_flags & TDF_DETAILS)) in create_canonical_iv()
82 fprintf (dump_file, "Added canonical iv to loop %d, ", loop->num); in create_canonical_iv()
83 print_generic_expr (dump_file, niter, TDF_SLIM); in create_canonical_iv()
84 fprintf (dump_file, " iterations.\n"); in create_canonical_iv()
196 if (dump_file && (dump_flags & TDF_DETAILS)) in try_unroll_loop_completely()
198 fprintf (dump_file, " Loop size: %d\n", (int) ninsns); in try_unroll_loop_completely()
199 fprintf (dump_file, " Estimated size after unrolling: %d\n", in try_unroll_loop_completely()
205 if (dump_file && (dump_flags & TDF_DETAILS)) in try_unroll_loop_completely()
206 fprintf (dump_file, "Not unrolling loop %d:\n", loop->num); in try_unroll_loop_completely()
263 if (dump_file && (dump_flags & TDF_DETAILS)) in try_unroll_loop_completely()
[all …]
|
| D | value-prof.c | 124 if (dump_file) in tree_value_profile_transformations()
126 fprintf (dump_file, "Trying transformations on insn "); in tree_value_profile_transformations()
127 print_generic_stmt (dump_file, stmt, TDF_SLIM); in tree_value_profile_transformations()
318 if (dump_file) in tree_divmod_fixed_value_transform()
320 fprintf (dump_file, "Div/mod by constant "); in tree_divmod_fixed_value_transform()
321 print_generic_expr (dump_file, value, TDF_SLIM); in tree_divmod_fixed_value_transform()
322 fprintf (dump_file, "="); in tree_divmod_fixed_value_transform()
323 print_generic_expr (dump_file, tree_val, TDF_SLIM); in tree_divmod_fixed_value_transform()
324 fprintf (dump_file, " transformation on insn "); in tree_divmod_fixed_value_transform()
325 print_generic_stmt (dump_file, stmt, TDF_SLIM); in tree_divmod_fixed_value_transform()
[all …]
|
| D | tree-ssa-loop-prefetch.c | 220 fprintf (dump_file, " delta "); in dump_mem_ref()
297 if (dump_file && (dump_flags & TDF_DETAILS)) in record_ref()
298 dump_mem_ref (dump_file, *aref); in record_ref()
695 if (dump_file && (dump_flags & TDF_DETAILS)) in prune_group_by_reuse()
697 fprintf (dump_file, "Reference %p:", (void *) ref_pruned); in prune_group_by_reuse()
701 fprintf (dump_file, " no restrictions"); in prune_group_by_reuse()
703 fprintf (dump_file, " do not prefetch"); in prune_group_by_reuse()
705 fprintf (dump_file, " prefetch once"); in prune_group_by_reuse()
710 fprintf (dump_file, " prefetch before "); in prune_group_by_reuse()
711 fprintf (dump_file, HOST_WIDE_INT_PRINT_DEC, in prune_group_by_reuse()
[all …]
|