git
/
gcc
mirror of git://gcc.gnu.org/git/gcc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

lto-partition.c (lto_balanced_map): Fix -fno-toplevel-reorder partitioning of variables. 

* lto-partition.c (lto_balanced_map): Fix -fno-toplevel-reorder
	partitioning of variables.

From-SVN: r201065
This commit is contained in:
Jan Hubicka 2013-07-19 20:19:48 +02:00 committed by Jan Hubicka
parent 3ae1e1fdf4
commit c525ba9a3f
2 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/lto/ChangeLog
View File

@ -1,3 +1,8 @@
2013-06-20 Jan Hubicka <jh@suse.cz>
* lto-partition.c (lto_balanced_map): Fix -fno-toplevel-reorder
partitioning of variables.
2013-06-20 Jan Hubicka <jh@suse.cz> 2013-06-20 Jan Hubicka <jh@suse.cz>
* lto.c (read_cgraph_and_symbols): Set cgraph state. * lto.c (read_cgraph_and_symbols): Set cgraph state.

4
gcc/lto/lto-partition.c
View File

@ -444,7 +444,7 @@ void
lto_balanced_map (void) lto_balanced_map (void)
{ {
int n_nodes = 0; int n_nodes = 0;
int n_varpool_nodes = 0, varpool_pos = 0; int n_varpool_nodes = 0, varpool_pos = 0, best_varpool_pos = 0;
struct cgraph_node **postorder = struct cgraph_node **postorder =
XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
struct cgraph_node **order = XNEWVEC (struct cgraph_node *, cgraph_max_uid); struct cgraph_node **order = XNEWVEC (struct cgraph_node *, cgraph_max_uid);
@ -684,6 +684,7 @@ lto_balanced_map (void)
best_i = i; best_i = i;
best_n_nodes = lto_symtab_encoder_size (partition->encoder); best_n_nodes = lto_symtab_encoder_size (partition->encoder);
best_total_size = total_size; best_total_size = total_size;
best_varpool_pos = varpool_pos;
} }
if (cgraph_dump_file) if (cgraph_dump_file)
fprintf (cgraph_dump_file, "Step %i: added %s/%i, size %i, cost %i/%i " fprintf (cgraph_dump_file, "Step %i: added %s/%i, size %i, cost %i/%i "
@ -701,6 +702,7 @@ lto_balanced_map (void)
fprintf (cgraph_dump_file, "Unwinding %i insertions to step %i\n", fprintf (cgraph_dump_file, "Unwinding %i insertions to step %i\n",
i - best_i, best_i); i - best_i, best_i);
undo_partition (partition, best_n_nodes); undo_partition (partition, best_n_nodes);
varpool_pos = best_varpool_pos;
} }
i = best_i; i = best_i;
/* When we are finished, avoid creating empty partition. */ /* When we are finished, avoid creating empty partition. */