From 055a19271a312bea1192433129b682d2dddff1cb Mon Sep 17 00:00:00 2001 From: Sven Verdoolaege Date: Sun, 20 Aug 2017 19:56:57 +0200 Subject: [PATCH] isl_tab_pip.c: first_trivial_region: pass isl_lexmin_data Now that all required information is available in the isl_lexmin_data object, there is no longer any need for passing them in separately. Signed-off-by: Sven Verdoolaege --- isl_tab_pip.c | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/isl_tab_pip.c b/isl_tab_pip.c index 978ba2db..54bd2037 100644 --- a/isl_tab_pip.c +++ b/isl_tab_pip.c @@ -5118,22 +5118,21 @@ struct isl_lexmin_data { /* Return the index of the first trivial region, "n_region" if all regions * are non-trivial or -1 in case of error. */ -static int first_trivial_region(struct isl_tab *tab, - int n_region, struct isl_trivial_region *region) +static int first_trivial_region(struct isl_lexmin_data *data) { int i; - for (i = 0; i < n_region; ++i) { + for (i = 0; i < data->n_region; ++i) { isl_bool trivial; - trivial = region_is_trivial(tab, region[i].pos, - region[i].trivial); + trivial = region_is_trivial(data->tab, data->region[i].pos, + data->region[i].trivial); if (trivial < 0) return -1; if (trivial) return i; } - return n_region; + return data->n_region; } /* Check if the solution is optimal, i.e., whether the first @@ -5389,7 +5388,7 @@ __isl_give isl_vec *isl_tab_basic_set_non_trivial_lexmin( goto error; if (data.tab->empty) goto backtrack; - r = first_trivial_region(data.tab, n_region, region); + r = first_trivial_region(&data); if (r < 0) goto error; if (r == n_region) { -- 2.11.4.GIT