haiku-buildtools/isl/isl_coalesce.c

105 static int any(int *con, unsigned len, int status)
254  * To see that we are not introducing any extra points, call the
462 	cut_i = any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT) ||
463 		any(ineq_i, map->p[i]->n_ineq, STATUS_CUT);
464 	cut_j = any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT) ||
465 		any(ineq_j, map->p[j]->n_ineq, STATUS_CUT);
639  * If any of the wrapping problems results in a constraint that is
883  * by any of the other cut constraints.
895  * If any wrapping fails, i.e., if we cannot wrap to touch
1028  * around its edges does not produce any new facet constraint.
1105 	if (!any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT))
1111 	if (!any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT))
1123  * If "i" has any "cut" (in)equality, then relaxing the inequality
1133 	if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) &&
1134 	    any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ))
1138 	if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ))
1144 	if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT))
1146 	if (any(ineq_i, map->p[i]->n_ineq, STATUS_CUT))
1150 	    any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ) ||
1151 	    any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) ||
1152 	    any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ))
1363 	if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ERROR))
1365 	if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_SEPARATE))
1371 	if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_ERROR))
1373 	if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_SEPARATE))
1379 	if (any(ineq_i, map->p[i]->n_ineq, STATUS_ERROR))
1381 	if (any(ineq_i, map->p[i]->n_ineq, STATUS_SEPARATE))
1387 	if (any(ineq_j, map->p[j]->n_ineq, STATUS_ERROR))
1389 	if (any(ineq_j, map->p[j]->n_ineq, STATUS_SEPARATE))
1400 	} else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_EQ)) {
1403 	} else if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_EQ)) {
1406 	} else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) ||
1407 		   any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ)) {
1410 	} else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_EQ) ||
1411 		   any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ)) {
1414 	} else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) ||
1415 		   any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ)) {
1419 		if (!any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT) &&
1420 		    !any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT))
1443  * If either basic map has any unknown divs, then we can only assume
1501 	if (any(eq_i, 2 * bmap->n_eq, STATUS_ERROR))
1503 	if (any(eq_i, 2 * bmap->n_eq, STATUS_SEPARATE))
1509 	if (any(ineq_i, bmap->n_ineq, STATUS_ERROR))
1511 	if (any(ineq_i, bmap->n_ineq, STATUS_SEPARATE))