Searched refs:n_group (Results 1 - 6 of 6) sorted by relevance
/haiku-buildtools/isl/ |
H A D | isl_factorization.h | 9 * After applying "morph" to the basic set, there are "n_group" 11 * with 0 <= i < n_group. 12 * If no factorization is possible, then "n_group" is set to 0. 16 int n_group; member in struct:isl_factorizer
|
H A D | isl_factorization.c | 22 __isl_take isl_morph *morph, int n_group) 30 if (n_group > 0) { 31 len = isl_alloc_array(morph->dom->ctx, int, n_group); 41 f->n_group = n_group; 70 for (i = 0; i < f->n_group; ++i) { 21 isl_factorizer_alloc( __isl_take isl_morph *morph, int n_group) argument
|
H A D | isl_bernstein.c | 405 * set variables at a time, with i ranging from n_group - 1 to 0. 409 int n_group, int *len, struct bernstein_data *data, int *tight) 423 isl_dim_in, 0, nvar - len[n_group - 1]); 426 for (i = n_group - 2; i >= 0; --i) { 450 if (f->n_group == 0) { 459 pwf = bernstein_coefficients_recursive(pwqp, f->n_group, f->len, data, 407 bernstein_coefficients_recursive( __isl_take isl_pw_qpolynomial *pwqp, int n_group, int *len, struct bernstein_data *data, int *tight) argument
|
H A D | isl_transitive_closure.c | 1638 isl_set ***set, int *n_group) 1673 *n_group = g; 2641 int n_group; local 2647 group = setup_groups(ctx, list, n, &set, &n_group); 2651 grid = isl_calloc_array(ctx, isl_map **, n_group); 2654 for (i = 0; i < n_group; ++i) { 2655 grid[i] = isl_calloc_array(ctx, isl_map *, n_group); 2658 for (j = 0; j < n_group; ++j) { 2675 floyd_warshall_iterate(grid, n_group, exact); 2679 for (i = 0; i < n_group; 1637 setup_groups(isl_ctx *ctx, __isl_keep isl_basic_map **list, int n, isl_set ***set, int *n_group) argument [all...] |
H A D | isl_sample.c | 686 for (i = 0, n = 0; i < f->n_group; ++i) { 760 if (f->n_group != 0)
|
H A D | isl_polynomial.c | 4506 if (f->n_group == 0) { 4522 for (i = 0, n = 0; i < f->n_group; ++i) {
|
Completed in 41 milliseconds