OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

* lto.c (lto_balanced_map): Fix accounting of program size.

Browse Source 
From-SVN: r165145
This commit is contained in:
Jan Hubicka 2010-10-08 02:50:24 +02:00 committed by Jan Hubicka
parent 1b3fad8156
commit 937f7f69bc
2 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/lto/ChangeLog
View File

@ -1,3 +1,7 @@
2010-10-06 Jan Hubicka <jh@suse.cz>
* lto.c (lto_balanced_map): Fix accounting of program size.
2010-10-06 Jan Hubicka <jh@suse.cz>
* lto.c (lto_balanced_map): Do not produce empty partitions.

8
gcc/lto/lto.c
View File

@ -995,7 +995,7 @@ lto_balanced_map (void)
struct cgraph_node **order = XNEWVEC (struct cgraph_node *, cgraph_max_uid);
int i, postorder_len;
struct cgraph_node *node;
int total_size = 0;
int total_size = 0, best_total_size = 0;
int partition_size;
ltrans_partition partition;
unsigned int last_visited_cgraph_node = 0, last_visited_varpool_node = 0;
@ -1017,7 +1017,7 @@ lto_balanced_map (void)
if (partition_cgraph_node_p (node))
{
order[n_nodes++] = node;
total_size += node->local.inline_summary.self_size;
total_size += node->global.size;
}
}
free (postorder);
@ -1035,6 +1035,7 @@ lto_balanced_map (void)
for (i = 0; i < n_nodes; i++)
{
add_cgraph_node_to_partition (partition, order[i]);
total_size -= order[i]->global.size;
/* Once we added a new node to the partition, we also want to add
all referenced variables unless they was already added into some
@ -1069,7 +1070,6 @@ lto_balanced_map (void)
last_visited_cgraph_node);
refs = &node->ref_list;
total_size -= node->local.inline_summary.self_size;
last_visited_cgraph_node++;
gcc_assert (node->analyzed);
@ -1195,6 +1195,7 @@ lto_balanced_map (void)
partition->cgraph_set->nodes);
best_n_varpool_nodes = VEC_length (varpool_node_ptr,
partition->varpool_set->nodes);
best_total_size = total_size;
}
if (cgraph_dump_file)
fprintf (cgraph_dump_file, "Step %i: added %s, size %i, cost %i/%i best %i/%i, step %i\n", i,
@ -1218,6 +1219,7 @@ lto_balanced_map (void)
partition = new_partition ("");
last_visited_cgraph_node = 0;
last_visited_varpool_node = 0;
total_size = best_total_size;
cost = 0;
if (cgraph_dump_file)