Lines Matching defs:level
89 * We basically perform a depth first search, where in each level i
94 * in turn and then continue to the next level.
96 * The search is implemented iteratively. "level" identifies the current
98 * level and false if we want the next value.
111 int level;
146 level = 0;
149 while (level >= 0) {
152 res = isl_tab_min(tab, B->row[1 + level],
153 bset->ctx->one, &min->el[level], NULL, 0);
158 isl_seq_neg(B->row[1 + level] + 1,
159 B->row[1 + level] + 1, dim);
160 res = isl_tab_min(tab, B->row[1 + level],
161 bset->ctx->one, &max->el[level], NULL, 0);
162 isl_seq_neg(B->row[1 + level] + 1,
163 B->row[1 + level] + 1, dim);
164 isl_int_neg(max->el[level], max->el[level]);
169 snap[level] = isl_tab_snap(tab);
171 isl_int_add_ui(min->el[level], min->el[level], 1);
173 if (empty || isl_int_gt(min->el[level], max->el[level])) {
174 level--;
176 if (level >= 0)
177 if (isl_tab_rollback(tab, snap[level]) < 0)
181 if (level == dim - 1 && callback->add == increment_counter) {
183 min->el[level], max->el[level]))
185 level--;
187 if (level >= 0)
188 if (isl_tab_rollback(tab, snap[level]) < 0)
192 isl_int_neg(B->row[1 + level][0], min->el[level]);
193 if (isl_tab_add_valid_eq(tab, B->row[1 + level]) < 0)
195 isl_int_set_si(B->row[1 + level][0], 0);
196 if (level < dim - 1) {
197 ++level;
204 if (isl_tab_rollback(tab, snap[level]) < 0)