/haiku-buildtools/isl/ |
H A D | isl_coalesce.c | 54 int *eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq); 58 for (k = 0; k < bmap_i->n_eq; ++k) { 84 unsigned n_eq = bmap_i->n_eq; local 88 if (tab_i && isl_tab_is_redundant(tab_i, n_eq + k)) { 168 map->p[i]->n_eq + map->p[j]->n_eq, 173 for (k = 0; k < map->p[i]->n_eq; ++k) { 183 for (k = 0; k < map->p[j]->n_eq; ++k) { 272 unsigned n_eq local 374 unsigned n_eq = map->p[i]->n_eq; local 505 unsigned n_eq = map->p[i]->n_eq; local 863 set_is_redundant(struct isl_tab *tab, unsigned n_eq, int *cuts, int n, int k, int v) argument [all...] |
H A D | isl_morph.c | 376 int f_eq, n_eq; local 394 for (f_eq = 0; f_eq < bset->n_eq; ++f_eq) 397 for (n_eq = 0; f_eq + n_eq < bset->n_eq; ++n_eq) 398 if (isl_seq_first_non_zero(bset->eq[f_eq + n_eq] + otype, ntype) == -1) 400 if (n_eq == 0) 403 H = isl_mat_sub_alloc6(bset->ctx, bset->eq, f_eq, n_eq, otype, ntype); 407 Q = isl_mat_drop_rows(Q, 0, n_eq); 494 int n_eq; local [all...] |
H A D | isl_farkas.c | 213 dual = isl_basic_set_alloc_space(dim, bset->n_eq + bset->n_ineq, 217 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) { 230 for (j = 0; j < bset->n_eq; ++j) 234 isl_int_set(dual->eq[k][1 + shift + total + bset->n_eq + j], 243 1 + shift + total + bset->n_eq + bset->n_ineq); 244 isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1); 253 for (j = 0; j < bset->n_eq; ++j) 257 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j],
|
H A D | isl_convex_hull.c | 293 unsigned n_eq; local 302 n_eq = 1; 305 n_eq += set->p[i]->n_eq; 308 lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq); 325 for (j = 0; j < set->p[i]->n_eq; ++j) { 508 if (face->n_eq == 1) { 512 for (i = 0; i < face->n_eq; ++i) 517 isl_assert(set->ctx, i < face->n_eq, goto error); 594 isl_assert(ctx, facet->n_eq [all...] |
H A D | isl_sample.c | 63 if (bset->n_eq == 0 && bset->n_ineq == 0) 73 if (bset->n_eq > 0) { 74 isl_assert(bset->ctx, bset->n_eq == 1, goto error); 216 isl_assert(bset->ctx, bset->n_eq == 0, goto error); 284 int n_eq; local 294 n_eq = tab->n_var - tab->n_col + tab->n_dead; 295 if (tab->empty || n_eq == 0) 297 if (n_eq == tab->n_var) 300 eq = isl_mat_alloc(tab->mat->ctx, n_eq, tab->n_var); 308 if (i < bset->n_eq) 331 int n_eq; local [all...] |
H A D | isl_affine_hull.c | 115 bset->n_eq--; 116 for (r = row; r < bset->n_eq; ++r) 118 bset->eq[bset->n_eq] = t; 222 int is_zero1 = row >= bset1->n_eq || 224 int is_zero2 = row >= bset2->n_eq || 238 isl_assert(bset1->ctx, row == bset1->n_eq, goto error); 322 for (i = 0; i < bset->n_eq; ++i) 457 for (j = 0; j < hull->n_eq; ++j) { 474 if (j == hull->n_eq) 511 for (i = bmap->n_eq [all...] |
H A D | isl_equalities.c | 568 isl_assert(bset->ctx, bset->n_eq <= dim, goto error); 569 if (bset->n_eq == 0) 572 B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, 1 + dim); 643 H = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 1, total); 648 isl_seq_gcd(U->row[nparam + pos]+bset->n_eq, 649 total-bset->n_eq, modulo); 659 C = isl_mat_alloc(bset->ctx, 1+bset->n_eq, 1); 663 isl_mat_sub_neg(C->ctx, C->row+1, bset->eq, bset->n_eq, 0, 0, 1); 668 U1 = isl_mat_sub_alloc(U, nparam+pos, 1, 0, bset->n_eq);
|
H A D | polytope_scan.c | 82 if (bset->n_eq == 0)
|
H A D | isl_map_simplify.c | 68 for (i = 0; i < bset->n_eq; ++i) 181 for (i = 0; i < bmap->n_eq; ++i) 281 for (i = 0; i < bmap->n_eq; ++i) 325 for (i = bmap->n_eq - 1; i >= 0; --i) { 449 for (k = 0; k < bmap->n_eq; ++k) { 549 for (i = 0; i < bmap->n_eq; ++i) { 584 for (i = 0; i < bmap->n_eq; ++i) 587 if (i < bmap->n_eq) 623 for (done = 0; done < bmap->n_eq; ++done) { 625 for (k = done; k < bmap->n_eq; [all...] |
H A D | basis_reduction_templ.c | 336 if (bset->n_eq == 0) 341 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 345 tab->n_zero = bset->n_eq;
|
H A D | isl_map_private.h | 60 unsigned n_eq; member in struct:isl_basic_map 142 unsigned n_eq, unsigned n_ineq); 145 unsigned n_eq, unsigned n_ineq); 156 unsigned extra, unsigned n_eq, unsigned n_ineq); 160 unsigned extra, unsigned n_eq, unsigned n_ineq);
|
H A D | isl_map.c | 723 if (bmap->n_eq == total) { 725 for (i = 0; i < bmap->n_eq; ++i) { 737 if (i == bmap->n_eq) 802 unsigned n_eq, unsigned n_ineq) 810 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size); 814 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq); 815 if ((n_ineq + n_eq) && !bmap->ineq) 831 for (i = 0; i < n_ineq + n_eq; ++i) 839 bmap->c_size = n_eq + n_ineq; 842 bmap->n_eq 800 basic_map_init(struct isl_ctx *ctx, struct isl_basic_map *bmap, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 853 isl_basic_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 868 isl_basic_set_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 882 isl_basic_map_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 900 isl_basic_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 1430 isl_basic_map_extend_space(struct isl_basic_map *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 1482 isl_basic_set_extend_space(struct isl_basic_set *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 1491 isl_basic_map_extend_constraints( struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq) argument 1500 isl_basic_map_extend(struct isl_basic_map *base, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 1520 isl_basic_set_extend(struct isl_basic_set *base, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument 1529 isl_basic_set_extend_constraints( struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq) argument 9048 unsigned n_eq; local [all...] |
H A D | isl_map_subtract.c | 61 if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0) 68 for (i = 0; i < bmap->n_eq; ++i) { 121 if (c < 2 * bmap->n_eq) { 135 c -= 2 * bmap->n_eq; 681 return bmap->n_eq == isl_basic_map_total_dim(bmap); 711 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL); 719 for (j = 0; j < bmap->n_eq; ++j) {
|
H A D | isl_factorization.c | 275 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar); 278 isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq, 280 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
|
H A D | isl_tab.c | 62 tab->n_eq = 0; 281 dup->n_eq = tab->n_eq; 534 prod->n_eq = 0; 1790 isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq, return -1); 1792 tab->n_con == bmap->n_eq + bmap->n_ineq, return -1); 1888 tab->n_eq++; 2236 for (i = 0; i < bmap->n_eq; ++i) { 2276 tab = isl_tab_alloc(bset->ctx, bset->n_eq 2441 unsigned n_eq; local [all...] |
H A D | isl_schedule.c | 814 coef->n_eq, coef->n_ineq); 892 coef->n_eq, coef->n_ineq); 969 coef->n_eq, coef->n_ineq); 1069 coef->n_eq, coef->n_ineq); 1194 int *n_eq, int *n_ineq, int carry) 1210 *n_eq += f * coef->n_eq; 1225 int *n_eq, int *n_ineq) 1229 *n_eq = *n_ineq = 0; 1235 n_eq, n_ine 1192 count_map_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int *n_eq, int *n_ineq, int carry) argument 1224 count_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument 1323 int n_eq, n_ineq; local 2331 count_all_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument 2393 int n_eq, n_ineq; local [all...] |
H A D | isl_map_piplib.c | 380 nrow = extra_front + bmap->n_eq + bmap->n_ineq; 387 for (i = 0; i < bmap->n_eq; ++i) { 392 off += bmap->n_eq;
|
H A D | isl_dim_map.c | 144 for (i = 0; i < src->n_eq; ++i) {
|
H A D | isl_tab.h | 145 unsigned n_eq; member in struct:isl_tab
|
H A D | isl_constraint.c | 199 return bset->n_eq + bset->n_ineq; 214 for (i = 0; i < bmap->n_eq; ++i) { 635 n = bset->n_eq; 771 for (i = 0; i < bmap->n_eq; ++i) 1141 for (i = 0; i < bset->n_eq; ++i) {
|
H A D | isl_output.c | 87 for (i = 0; i < bmap->n_eq; ++i) 106 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq); 309 for (i = 0; i < eq->n_eq; ++i) { 494 for (i = bmap->n_eq - 1; i >= 0; --i) { 497 if (i != bmap->n_eq - 1) 507 "=", i == bmap->n_eq - 1, latex); 522 op, !bmap->n_eq && !i, latex); 537 if (bmap->n_eq + bmap->n_ineq == 0) 666 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1) 669 if (map->n > 1 && map->p[i]->n_eq [all...] |
H A D | isl_ilp.c | 39 if (bset->n_eq != 0) { 318 if (bset->n_eq)
|
H A D | isl_bound.c | 66 if (bset->n_eq == 0)
|
H A D | isl_vertices.c | 135 isl_assert(bset->ctx, v->v.vertex->n_eq >= nvar, goto error); 410 if (bset->n_eq != 0) 1143 for (i = 0; i < bset->n_eq; ++i) { 1454 for (i = 0; i < vertex->n_eq; ++i) {
|
/haiku-buildtools/isl/include/isl/ |
H A D | set.h | 90 unsigned n_eq, unsigned n_ineq); 93 unsigned n_eq, unsigned n_ineq); 95 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq);
|