Lines Matching defs:check
108 * Since A_k is known to be an overapproximation, we only need to check
157 * then we check
163 * More specifically, since A is known to be an overapproximation, we check
167 * Otherwise, we check if the power is exact.
436 * check if setting the length to zero results in only the identity
717 * That is, check whether
876 int check;
900 check = exact && *exact == isl_bool_true;
902 check ? &project : NULL);
905 if (check &&
1012 /* For each basic map in "map", except i, check whether it combines
1214 * Of course, we need to check that this is actually equal to map_i^ \cup Id_C.
1553 int check = exact && *exact == isl_bool_true;
1555 check ? &r_exact : NULL);
1556 if (check && !r_exact)
1782 * That is check whether
2014 * closure, so we can use a more relaxed exactness check.
2335 * In particular, check that app is acyclic and, if so,
2336 * check that
2377 * In particular, check if we can compute a compact representation
2486 * We first check whether we can can split of any basic map M_i and