diff options
author | Jan Hubicka <hubicka@ucw.cz> | 2018-06-08 18:12:39 +0200 |
---|---|---|
committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2018-06-08 16:12:39 +0000 |
commit | 29a50dfb47ff12c7730a3d604642ce500a39c78f (patch) | |
tree | bc0b8a743872bd4b0673daa75981a8ee8dbce830 /gcc/lto/lto-partition.c | |
parent | 850078b7387f7286aac70e1e594f39baf9f429af (diff) | |
download | gcc-29a50dfb47ff12c7730a3d604642ce500a39c78f.zip gcc-29a50dfb47ff12c7730a3d604642ce500a39c78f.tar.gz gcc-29a50dfb47ff12c7730a3d604642ce500a39c78f.tar.bz2 |
dumpfile.c (FIRST_ME_AUTO_NUMBERED_DUMP): Bump to 4.
* dumpfile.c (FIRST_ME_AUTO_NUMBERED_DUMP): Bump to 4.
* lto-lang.c (lto_link_dump_id, decl_merge_dump_id, partition_dump_id):
New global vars.
(lto_register_dumps): New hook.
(LANG_HOOKS_REGISTER_DUMPS): New.
* lto-partition.c: Dump into dump_file instead of symtab->dump_file.
* lto-symtab.c: Include lto.h; dump into dump_file instead of
symtab->dump_file.
(lto_symtab_merge_decls): Initialize dump file.
* lto.c (read_cgraph_and_symbols): Initialize dump file.
(do_whole_program_analysis): Likewise.
From-SVN: r261337
Diffstat (limited to 'gcc/lto/lto-partition.c')
-rw-r--r-- | gcc/lto/lto-partition.c | 66 |
1 files changed, 33 insertions, 33 deletions
diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c index 006eec7..0ceb1b6 100644 --- a/gcc/lto/lto-partition.c +++ b/gcc/lto/lto-partition.c @@ -160,8 +160,8 @@ add_symbol_to_partition_1 (ltrans_partition part, symtab_node *node) if (symbol_partitioned_p (node)) { node->in_other_partition = 1; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Symbol node %s now used in multiple partitions\n", node->name ()); } @@ -541,13 +541,13 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) order.qsort (node_cmp); noreorder.qsort (node_cmp); - if (symtab->dump_file) + if (dump_file) { for (unsigned i = 0; i < order.length (); i++) - fprintf (symtab->dump_file, "Balanced map symbol order:%s:%u\n", + fprintf (dump_file, "Balanced map symbol order:%s:%u\n", order[i]->name (), order[i]->tp_first_run); for (unsigned i = 0; i < noreorder.length (); i++) - fprintf (symtab->dump_file, "Balanced map symbol no_reorder:%s:%u\n", + fprintf (dump_file, "Balanced map symbol no_reorder:%s:%u\n", noreorder[i]->name (), noreorder[i]->tp_first_run); } @@ -569,8 +569,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) partition_size = PARAM_VALUE (MIN_PARTITION_SIZE); npartitions = 1; partition = new_partition (""); - if (symtab->dump_file) - fprintf (symtab->dump_file, "Total unit size: %" PRId64 ", partition size: %" PRId64 "\n", + if (dump_file) + fprintf (dump_file, "Total unit size: %" PRId64 ", partition size: %" PRId64 "\n", total_size, partition_size); auto_vec<symtab_node *> next_nodes; @@ -763,8 +763,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) best_n_nodes = lto_symtab_encoder_size (partition->encoder); best_varpool_pos = varpool_pos; } - if (symtab->dump_file) - fprintf (symtab->dump_file, "Step %i: added %s/%i, size %i, " + if (dump_file) + fprintf (dump_file, "Step %i: added %s/%i, size %i, " "cost %" PRId64 "/%" PRId64 " " "best %" PRId64 "/%" PRId64", step %i\n", i, order[i]->name (), order[i]->order, @@ -777,16 +777,16 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) { if (best_i != i) { - if (symtab->dump_file) - fprintf (symtab->dump_file, "Unwinding %i insertions to step %i\n", + if (dump_file) + fprintf (dump_file, "Unwinding %i insertions to step %i\n", i - best_i, best_i); undo_partition (partition, best_n_nodes); varpool_pos = best_varpool_pos; } gcc_assert (best_size == partition->insns); i = best_i; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Partition insns: %i (want %" PRId64 ")\n", partition->insns, partition_size); /* When we are finished, avoid creating empty partition. */ @@ -799,8 +799,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) last_visited_node = 0; cost = 0; - if (symtab->dump_file) - fprintf (symtab->dump_file, "New partition\n"); + if (dump_file) + fprintf (dump_file, "New partition\n"); best_n_nodes = 0; best_cost = -1; @@ -812,8 +812,8 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) /* Watch for overflow. */ partition_size = INT_MAX / 16; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Total size: %" PRId64 " partition_size: %" PRId64 "\n", total_size, partition_size); if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE)) @@ -840,21 +840,21 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) gcc_assert (next_nodes.length () || npartitions != 1 || !best_cost || best_cost == -1); add_sorted_nodes (next_nodes, partition); - if (symtab->dump_file) + if (dump_file) { - fprintf (symtab->dump_file, "\nPartition sizes:\n"); + fprintf (dump_file, "\nPartition sizes:\n"); unsigned partitions = ltrans_partitions.length (); for (unsigned i = 0; i < partitions ; i++) { ltrans_partition p = ltrans_partitions[i]; - fprintf (symtab->dump_file, "partition %d contains %d (%2.2f%%)" + fprintf (dump_file, "partition %d contains %d (%2.2f%%)" " symbols and %d (%2.2f%%) insns\n", i, p->symbols, 100.0 * p->symbols / order.length (), p->insns, 100.0 * p->insns / original_total_size); } - fprintf (symtab->dump_file, "\n"); + fprintf (dump_file, "\n"); } } @@ -869,8 +869,8 @@ must_not_rename (symtab_node *node, const char *name) if (node->lto_file_data && lto_get_decl_name_mapping (node->lto_file_data, name) != name) { - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Not privatizing symbol name: %s. It privatized already.\n", name); return true; @@ -881,8 +881,8 @@ must_not_rename (symtab_node *node, const char *name) that are not really clones. */ if (node->unique_name) { - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Not privatizing symbol name: %s. Has unique name.\n", name); return true; @@ -972,8 +972,8 @@ privatize_symbol_name_1 (symtab_node *node, tree decl) IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Privatizing symbol name: %s -> %s\n", name, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); @@ -1018,8 +1018,8 @@ promote_symbol (symtab_node *node) TREE_PUBLIC (node->decl) = 1; DECL_VISIBILITY (node->decl) = VISIBILITY_HIDDEN; DECL_VISIBILITY_SPECIFIED (node->decl) = true; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Promoting as hidden: %s (%s)\n", node->name (), IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl))); @@ -1035,8 +1035,8 @@ promote_symbol (symtab_node *node) TREE_PUBLIC (alias->decl) = 1; DECL_VISIBILITY (alias->decl) = VISIBILITY_HIDDEN; DECL_VISIBILITY_SPECIFIED (alias->decl) = true; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Promoting alias as hidden: %s\n", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl))); } @@ -1102,8 +1102,8 @@ rename_statics (lto_symtab_encoder_t encoder, symtab_node *node) if (!s) return; - if (symtab->dump_file) - fprintf (symtab->dump_file, + if (dump_file) + fprintf (dump_file, "Renaming statics with asm name: %s\n", node->name ()); /* Assign every symbol in the set that shares the same ASM name an unique |