Searched refs:n_op (Results 1 - 2 of 2) sorted by relevance

/haiku-buildtools/isl/
H A Disl_tab.h260 __isl_take isl_basic_set *bset, int n_op, int n_region,
H A Disl_tab_pip.c4965 * n_op entries are zero.
4967 static int is_optimal(__isl_keep isl_vec *sol, int n_op) argument
4971 for (i = 0; i < n_op; ++i)
4979 * relevant (within first n_op) non-zero coefficient and force it (along
4985 __isl_keep isl_vec *sol, int n_op)
4994 for (i = 0; i < n_op; ++i)
4998 if (i == n_op) {
5035 * n_op is the number of initial coordinates to optimize.
5069 __isl_take isl_basic_set *bset, int n_op, int n_region,
5119 if (is_optimal(sol, n_op))
4984 force_better_solution(struct isl_tab *tab, __isl_keep isl_vec *sol, int n_op) argument
5068 isl_tab_basic_set_non_trivial_lexmin( __isl_take isl_basic_set *bset, int n_op, int n_region, struct isl_region *region, int (*conflict)(int con, void *user), void *user) argument
[all...]

Completed in 63 milliseconds