| /src/external/mit/isl/dist/ |
| isl_map_simplify.c | 41 isl_int *t = bmap->ineq[a];
42 bmap->ineq[a] = bmap->ineq[b];
43 bmap->ineq[b] = t;
81 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
83 if (isl_int_is_neg(bmap->ineq[i][0])) {
92 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
95 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
96 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total)
2631 isl_mat *ineq; local
2651 isl_mat *ineq; local
2704 isl_mat *ineq; local
[all...] |
| isl_tab_lexopt_templ.c | 81 isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
83 if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
93 isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
107 isl_seq_clr(bmap->ineq[k], 1 + n_in);
108 isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
109 isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
120 isl_int_set_si(dom->ineq[k][1 + n_in], -1);
121 isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
|
| isl_convex_hull.c | 231 isl_seq_clr(lp->ineq[k], 1+lp_dim);
232 isl_int_set_si(lp->ineq[k][1+dim*i], 1);
243 isl_seq_clr(lp->ineq[k], 1+dim*i);
244 isl_seq_cpy(lp->ineq[k]+1+dim*i, set->p[i]->ineq[j], dim);
245 isl_seq_clr(lp->ineq[k]+1+dim*(i+1), dim*(set->n-i-1));
555 facet = compute_facet(set, hull->ineq[i]);
556 facet = isl_basic_set_add_eq(facet, hull->ineq[i]);
560 hull_facet = isl_basic_set_add_eq(hull_facet, hull->ineq[i]);
571 if (isl_seq_eq(facet->ineq[j]
1518 int ineq; member in struct:max_constraint
1694 isl_int *ineq = set->p[s]->ineq[i]; local
1720 isl_int *ineq = set->p[s]->ineq[i]; local
2889 isl_int **ineq = NULL; local
[all...] |
| isl_tab_pip.c | 81 /* add inequality; check is 1 if ineq may not be valid;
84 void (*add_ineq)(struct isl_context *context, isl_int *ineq,
86 /* check sign of ineq based on previous information.
90 isl_int *ineq, int strict);
92 int (*test_ineq)(struct isl_context *context, isl_int *ineq);
228 /* Add inequality constraint "ineq" to the context of "sol".
229 * "check" is set if "ineq" is not known to be a valid constraint.
232 static void sol_context_add_ineq(struct isl_sol *sol, isl_int *ineq, int check,
237 sol->context->op->add_ineq(sol->context, ineq, check, update);
933 struct isl_vec *ineq; local
1040 struct isl_vec *ineq; local
2442 struct isl_vec *ineq = NULL; local
2745 struct isl_vec *ineq = NULL; local
3868 struct isl_vec *ineq = NULL; local
4158 struct isl_vec *ineq; local
4194 struct isl_vec *ineq; local
[all...] |
| isl_constraint.c | 229 &bmap->ineq[i]);
728 c = bmap->ineq[k];
822 if (isl_int_is_zero(bset->ineq[i][offset + pos]))
824 if (isl_int_is_one(bset->ineq[i][offset + pos]))
826 if (isl_int_is_negone(bset->ineq[i][offset + pos]))
828 if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1,
832 if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1,
835 isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0])
[all...] |
| isl_coalesce.c | 47 static int status_in(isl_int *ineq, struct isl_tab *tab)
49 enum isl_ineq_type type = isl_tab_ineq_type(tab, ineq);
106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq); local
108 if (!ineq)
113 ineq[k] = STATUS_REDUNDANT;
116 ineq[k] = status_in(bmap_i->ineq[k], tab_j);
117 if (ineq[k] == STATUS_ERROR)
119 if (ineq[k] == STATUS_SEPARATE)
123 return ineq;
205 int *ineq; member in struct:isl_coalesce_info
3064 isl_vec *ineq; local
[all...] |
| isl_farkas.c | 279 bset->ineq[j][1 + i]);
286 isl_seq_clr(dual->ineq[k],
288 isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1);
295 isl_seq_clr(dual->ineq[k], 2 + total);
296 isl_int_set_si(dual->ineq[k][1], 1);
298 isl_int_neg(dual->ineq[k][2 + total + j],
301 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j],
302 bset->ineq[j][0]);
410 /* Does inequality "ineq" in the (dual) basic set "bset" represent a ray?
414 static int is_ray(__isl_keep isl_basic_set *bset, int ineq)
[all...] |
| isl_sample.c | 99 if (isl_int_is_one(bset->ineq[0][1]))
100 isl_int_neg(sample->block.data[1], bset->ineq[0][0]);
102 isl_int_set(sample->block.data[1], bset->ineq[0][0]);
105 bset->ineq[i], 2, &t);
183 bset->ineq[i - bset->n_eq] + 1, tab->n_var);
807 isl_seq_cpy(shift->ineq[k] + 1, cone->ineq[i] + 1, total);
808 isl_seq_inner_product(shift->ineq[k] + 1, vec->el + 1, total,
809 &shift->ineq[k][0]);
810 isl_int_cdiv_q(shift->ineq[k][0]
[all...] |
| isl_point.c | 773 isl_seq_clr(bset->ineq[k] + 1, total);
775 isl_int_set_si(bset->ineq[k][1 + i], -1);
776 isl_int_set(bset->ineq[k][0], pnt1->vec->el[1 + i]);
778 isl_int_set_si(bset->ineq[k][1 + i], 1);
779 isl_int_neg(bset->ineq[k][0], pnt1->vec->el[1 + i]);
781 isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt1->vec->el[0]);
786 isl_seq_clr(bset->ineq[k] + 1, total);
788 isl_int_set_si(bset->ineq[k][1 + i], 1);
789 isl_int_neg(bset->ineq[k][0], pnt2->vec->el[1 + i])
[all...] |
| isl_ilp.c | 60 isl_seq_cpy(unit_box->ineq[k], bset->ineq[i], 1 + total);
62 if (isl_int_is_nonneg(unit_box->ineq[k][1 + j]))
64 isl_int_add(unit_box->ineq[k][0],
65 unit_box->ineq[k][0], unit_box->ineq[k][1 + j]);
122 isl_seq_cpy(bset->ineq[k], f, 1 + total);
123 isl_int_sub(bset->ineq[k][0], bset->ineq[k][0], l);
128 isl_seq_neg(bset->ineq[k], f, 1 + total)
[all...] |
| isl_map.c | 1306 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
1307 if ((n_ineq + n_eq) && !bmap->ineq)
1324 bmap->ineq[i] = bmap->block.data + i * row_size;
1332 bmap->eq = bmap->ineq + n_ineq;
1427 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
1513 free(bmap->ineq);
1640 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1646 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1651 t = bmap->ineq[j]
[all...] |
| isl_transitive_closure.c | 84 c = bmap->ineq[k];
274 isl_seq_clr(path->ineq[k], 1 + total);
275 isl_int_set_si(path->ineq[k][1 + nparam + 2 * d + i], 1);
321 isl_seq_clr(bset->ineq[k], 1 + total);
322 isl_seq_cpy(bset->ineq[k], c, 1 + nparam);
326 isl_int_set(bset->ineq[k][1 + nparam + d + i],
329 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
468 isl_int **delta_c = eq ? delta->eq : delta->ineq;
496 path_c = path->ineq[k]
[all...] |
| isl_map_subtract.c | 90 expand_constraint(v, dim, bmap->ineq[i], div_map, bmap_n_div);
153 isl_seq_neg(bmap->ineq[c], bmap->ineq[c],
155 isl_int_sub_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
157 expand_constraint(v, dim, bmap->ineq[c], div_map, bmap_n_div);
160 isl_int_add_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
161 isl_seq_neg(bmap->ineq[c], bmap->ineq[c]
[all...] |
| isl_tab.c | 1890 /* Add inequality "ineq" and check if it conflicts with the
1896 isl_stat isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq)
1912 tab->bmap = isl_basic_map_add_ineq(tab->bmap, ineq);
1921 isl_int_swap(ineq[0], cst);
1923 r = isl_tab_add_row(tab, ineq);
1925 isl_int_swap(ineq[0], cst);
2205 struct isl_vec *ineq; local
2213 ineq = isl_vec_alloc(bmap->ctx, 1 + total);
2214 if (!ineq)
2217 isl_seq_cpy(ineq->el, bmap->div[div] + 1, 1 + total)
2242 struct isl_vec *ineq; local
[all...] |
| isl_dim_map.c | 165 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
|
| isl_tab.h | 211 isl_stat isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq) WARN_UNUSED;
238 enum isl_ineq_type isl_tab_ineq_type(struct isl_tab *tab, isl_int *ineq);
|
| isl_scheduler.c | 2362 isl_size eq, ineq; local
2365 ineq = isl_basic_set_n_inequality(bset);
2368 if (eq < 0 || ineq < 0)
2372 *n_ineq += ineq;
2498 isl_seq_clr(graph->lp->ineq[k], 1 + total);
2500 isl_int_set_si(graph->lp->ineq[k][1 + pos], -1);
2501 isl_int_set_si(graph->lp->ineq[k][0], max);
2563 isl_vec *ineq; local
2579 isl_seq_clr(graph->lp->ineq[k], 1 + total);
2580 isl_int_set_si(graph->lp->ineq[k][dim], -1)
[all...] |
| isl_map_private.h | 68 isl_int **ineq; member in struct:isl_basic_map
247 isl_int *ineq);
249 isl_int *ineq);
547 int pos, int *div, int *ineq);
587 __isl_keep isl_basic_map *bmap, int ineq, int pos);
|
| isl_vertices.c | 284 indep = is_independent(facets, selected, bset->ineq[level] + 1 + ovar);
581 enum isl_ineq_type type = isl_tab_ineq_type(tab, bset->ineq[i]);
642 type = isl_tab_ineq_type(tab, bset->ineq[i]);
647 if (isl_tab_add_ineq(tab, bset->ineq[i]) < 0)
766 isl_seq_neg(todo->constraint->el, tab->bmap->ineq[con], 1 + tab->n_var);
1213 isl_seq_cpy(c->el + 1, bset->ineq[i], c->size - 1);
1503 isl_seq_cpy(v->el, bset->ineq[facet], v->size);
1554 if (isl_seq_first_non_zero(bset->ineq[i] + 1 + nparam, d) == -1)
|
| isl_output.c | 64 struct isl_basic_map *bmap, int ineq, int n, __isl_take isl_printer *p)
70 isl_int *c = ineq ? bmap->ineq[n] : bmap->eq[n];
76 p = isl_printer_print_int(p, ineq);
516 if (isl_seq_last_non_zero(bmap->ineq[i + 1], 1 + total) != last)
521 bmap->ineq[i + 1], last - o_div);
527 r = isl_int_abs_eq(bmap->ineq[i][last], bmap->ineq[i + 1][last]) &&
528 !isl_int_eq(bmap->ineq[i][last], bmap->ineq[i + 1][last])
[all...] |
| isl_factorization.c | 290 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
|
| isl_aff.c | 2333 isl_constraint *ineq; local
2348 ineq = isl_inequality_from_aff(aff);
2349 c = isl_constraint_get_constant_val(ineq);
2351 ineq = isl_constraint_set_constant_val(ineq, c);
2353 bset = isl_basic_set_from_constraint(ineq);
2370 isl_constraint *ineq; local
2381 ineq = isl_inequality_from_aff(aff);
2383 bset = isl_basic_set_from_constraint(ineq);
2425 isl_constraint *ineq; local
5078 int eq, div, ineq; local
[all...] |
| isl_polynomial.c | 4759 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4760 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
4765 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4766 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
4767 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
4768 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| graphite-dependences.cc | 235 isl_constraint *ineq = isl_inequality_alloc local
242 ineq = isl_constraint_set_coefficient_si (ineq, isl_dim_out, depth - 1, 1);
243 ineq = isl_constraint_set_coefficient_si (ineq, isl_dim_in, depth - 1, -1);
244 ineq = isl_constraint_set_constant_si (ineq, -1);
245 lex = isl_map_add_constraint (lex, ineq);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphite-dependences.cc | 235 isl_constraint *ineq = isl_inequality_alloc local
242 ineq = isl_constraint_set_coefficient_si (ineq, isl_dim_out, depth - 1, 1);
243 ineq = isl_constraint_set_coefficient_si (ineq, isl_dim_in, depth - 1, -1);
244 ineq = isl_constraint_set_constant_si (ineq, -1);
245 lex = isl_map_add_constraint (lex, ineq);
|
