From e693ebce815cd4d29cb0e438e61a692624423628 Mon Sep 17 00:00:00 2001 From: Jan Hubicka Date: Mon, 30 Apr 2018 13:40:47 +0200 Subject: [PATCH] * lto-partition.c (lto_balanced_map): Fix sanity check. From-SVN: r259759 --- gcc/lto/ChangeLog | 4 ++++ gcc/lto/lto-partition.c | 2 +- 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/gcc/lto/ChangeLog b/gcc/lto/ChangeLog index 6d00e4ebdfb..d54ef50a84b 100644 --- a/gcc/lto/ChangeLog +++ b/gcc/lto/ChangeLog @@ -1,3 +1,7 @@ +2018-04-20 Jan Hubicka + + * lto-partition.c (lto_balanced_map): Fix sanity check. + 2018-04-19 Jan Hubicka * lto-partition.c: Include sreal.h diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c index d83eba297ec..3efebe73bab 100644 --- 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); -- 2.30.2