* lto-partition.c (lto_balanced_map): Fix sanity check.

From-SVN: r259759

diff --git a/gcc/lto/ChangeLog b/gcc/lto/ChangeLog
index 6d00e4ebdfbcad47c254df2acc1bd1eb033a7a69..d54ef50a84be6d67a7d1bc54d87b566d68cc95d2 100644 (file)
--- a/gcc/lto/ChangeLog
+++ b/gcc/lto/ChangeLog
@@ -1,3 +1,7 @@
+2018-04-20  Jan Hubicka  <jh@suse.cz>
+
+       * lto-partition.c (lto_balanced_map): Fix sanity check.
+
 2018-04-19  Jan Hubicka  <jh@suse.cz>
 
        * lto-partition.c: Include sreal.h

diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c
index d83eba297ec06c41bb68e717f74db31a384c0662..3efebe73babfb129c9f914e6396453eef71b39e7 100644 (file)
--- a/gcc/lto/lto-partition.c
+++ b/gcc/lto/lto-partition.c
@@ -809,7 +809,7 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
     next_nodes.safe_push (noreorder[noreorder_pos++]);
   /* For one partition the cost of boundary should be 0 unless we added final
      symbols here (these are not accounted) or we have accounting bug.  */
-  gcc_assert (next_nodes.length () || npartitions != 1 || !best_cost);
+  gcc_assert (next_nodes.length () || npartitions != 1 || !best_cost || best_cost == -1);
   add_sorted_nodes (next_nodes, partition);
 
   free (order);