| /src/external/mit/isl/dist/ |
| isl_factorization.h | 12 * After applying "morph" to the basic set, there are "n_group"
14 * with 0 <= i < n_group.
15 * If no factorization is possible, then "n_group" is set to 0.
20 int n_group; member in struct:isl_factorizer
|
| isl_factorization.c | 32 int n_group)
40 if (n_group > 0) {
41 len = isl_alloc_array(morph->dom->ctx, int, n_group);
52 f->n_group = n_group;
83 for (i = 0; i < f->n_group; ++i) {
366 for (i = 0, n = 0; i < f->n_group; ++i) {
|
| isl_bernstein.c | 431 * set variables at a time, with i ranging from n_group - 1 to 0.
435 int n_group, int *len, struct bernstein_data *data, isl_bool *tight)
448 isl_dim_in, 0, nvar - len[n_group - 1]);
451 for (i = n_group - 2; i >= 0; --i) {
481 if (f->n_group == 0) {
490 pwf = bernstein_coefficients_recursive(pwqp, f->n_group, f->len, data,
|
| isl_transitive_closure.c | 1681 isl_set ***set, int *n_group)
1716 *n_group = g;
2632 int n_group; local
2638 group = setup_groups(ctx, list, n, &set, &n_group);
2642 grid = isl_calloc_array(ctx, isl_map **, n_group);
2645 for (i = 0; i < n_group; ++i) {
2646 grid[i] = isl_calloc_array(ctx, isl_map *, n_group);
2649 for (j = 0; j < n_group; ++j) {
2666 floyd_warshall_iterate(grid, n_group, exact);
2670 for (i = 0; i < n_group; ++i)
[all...] |
| isl_farkas.c | 736 if (isl_coefficients_product_data_init(ctx, &data, f->n_group) < 0)
828 if (f->n_group > 0) {
|
| isl_sample.c | 653 if (f->n_group != 0)
|
| isl_polynomial.c | 5056 if (f->n_group == 0) {
|
| /src/usr.sbin/netgroup_mkdb/ |
| netgroup_mkdb.c | 65 #define n_group _n._group macro
278 e->n_group = ng;
372 ng = e->n_group;
478 NG_EMPTY(e->n_group->ng_host),
479 NG_EMPTY(e->n_group->ng_user),
480 NG_EMPTY(e->n_group->ng_domain));
|
