Cross Reference: /src/external/mit/isl/dist/isl

Lines Matching defs:n_ineq
106 	int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq);
111 	for (k = 0; k < bmap_i->n_ineq; ++k) {
226 	isl_size n_ineq;
228 	n_ineq = isl_basic_map_n_inequality(info->bmap);
229 	return any(info->ineq, n_ineq, status);
254 	isl_size n_ineq;
256 	n_ineq = isl_basic_map_n_inequality(info->bmap);
257 	return find(info->ineq, n_ineq, status);
278 	isl_size n_ineq;
280 	n_ineq = isl_basic_map_n_inequality(info->bmap);
281 	return count(info->ineq, n_ineq, status);
301 	for (i = 0; i < info->bmap->n_ineq; ++i) {
457 	for (k = 0; k < info->bmap->n_ineq; ++k) {
479 	n_old = 2 * info[i].bmap->n_eq + info[i].bmap->n_ineq;
480 	n_old += 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
483 	for (k = 0; k < bmap->n_ineq; ++k)
519 	unsigned n_eq, n_ineq;
528 	n_ineq = info[i].bmap->n_ineq + info[j].bmap->n_ineq;
530 		    info[i].bmap->n_div, n_eq, n_eq + n_ineq + extra_rows);
636 	for (k = 0; k < info[i].bmap->n_ineq; ++k) {
641 		for (l = 0; l < info[j].bmap->n_ineq; ++l) {
653 		if (l < info[j].bmap->n_ineq)
657 	if (k < info[i].bmap->n_ineq) {
696 	for (k = 0; k < bmap->n_ineq; ++k) {
1003 	for (i = 0; i < info->bmap->n_ineq; ++i) {
1202 	for (k = 0; k < info->bmap->n_ineq; ++k) {
1357 	for (l = 0; l < bmap->n_ineq; ++l) {
1489 	isl_size n_eq, n_ineq;
1492 	n_ineq = isl_basic_map_n_inequality(info->bmap);
1493 	if (n_eq < 0 || n_ineq < 0)
1495 	for (l = 0; l < n_ineq; ++l) {
1776 				    info[i].bmap->n_ineq + info[j].bmap->n_ineq,
1915 	for (k = 0; k < info[i].bmap->n_ineq; ++k) {
1958 	max_wrap = 1 + 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
2094 	for (k = 0; k < info[i].bmap->n_ineq; ++k) {
2137 	for (l = 0; l < info[i].bmap->n_ineq; ++l) {
2321 				    info[i].bmap->n_ineq + info[j].bmap->n_ineq,
2420 	for (i = 0; i < info->bmap->n_ineq; ++i) {
2553 	if (info[i].bmap->n_ineq && !info[i].ineq)
2561 	if (info[j].bmap->n_ineq && !info[j].ineq)
2586 	    all(info[i].ineq, info[i].bmap->n_ineq, STATUS_VALID)) {
2590 		   all(info[j].ineq, info[j].bmap->n_ineq, STATUS_VALID)) {
3007 	int i, n_ineq;
3012 	n_ineq = tab->n_con - tab->n_eq;
3013 	for (i = n_ineq; i < bmap->n_ineq; ++i)
3137 	int i, n_ineq;
3144 	if (info->bmap->n_eq + info->bmap->n_ineq != info->tab->n_con)
3161 	n_ineq = info->tab->n_con - info->tab->n_eq;
3190 	for (i = 0; i < n_ineq; ++i) {
3382 	if (bmap->n_ineq && !info_i->ineq)
3390 	    all(info_i->ineq, bmap->n_ineq, STATUS_VALID)) {
OpenGrok
