Searched refs:disjoint (Results 1 - 7 of 7) sorted by relevance

/haiku-buildtools/isl/
H A Disl_map_simplify.c2370 /* Quick check to see if two basic maps are disjoint.
2408 goto disjoint;
2416 goto disjoint;
2425 goto disjoint;
2430 disjoint:
2447 /* Are "map1" and "map2" obviously disjoint?
2455 * they have the same parameters), then they are clearly disjoint.
2458 * not be able to detect if they are disjoint.
2460 * Otherwise we check if each basic map in "map1" is obviously disjoint
2467 int disjoint; local
2521 int disjoint; local
[all...]
H A Disl_ast_graft.c230 * disjuncts disjoint and insert an if node corresponding to each disjunct
1099 * but if the guard of a graft in "list2" is disjoint from the guards
1105 * after g as long as each of these elements has a guard that is disjoint
1110 * that element didn't move up further was that its guard was not disjoint
1139 int cmp, disjoint; local
1148 disjoint = isl_set_is_disjoint(graft->guard,
1150 if (disjoint < 0) {
1154 if (!disjoint)
H A Disl_ast_codegen.c1760 * have been made disjoint first.
1761 * The problem is that the domains may be integrally disjoint but not
1762 * rationally disjoint. For example, we may have domains
1829 * are pair-wise disjoint. It can, however, in principle happen that
2258 * of disjoint basic sets for which code should be generated.
2266 * that they have been made pair-wise disjoint.
2314 * remain disjoint. The constraints that are dropped by taking the hull
2321 * is disjoint from the other class domains.
2396 * has been made disjoint in compute_domains_init_options,
2538 /* Split up the domain at the current depth into disjoint
2629 int disjoint; local
[all...]
H A Disl_test.c3252 /* Check that two sets are not considered disjoint just because
3259 int disjoint; local
3265 disjoint = isl_set_is_disjoint(set, set2);
3268 if (disjoint < 0)
3270 if (disjoint)
4134 /* Check that the AST generator handles domains that are integrally disjoint
4135 * but not ratinoally disjoint.
4491 { "disjoint", &test_disjoint },
/haiku-buildtools/gcc/gmp/mpn/x86/p6/
H A Dcopyd.asm93 C src+4*size<=dst, since then the regions are disjoint
99 C regions are disjoint
/haiku-buildtools/cloog/source/
H A Dloop.c465 * union into a list of *disjoint* polyhedra then adds the list. This function
494 /* This first element is the first of the list of disjoint polyhedra. */
543 * domains are the components of the union of *disjoint* polyhedra equivalent
854 * loops: for a given set of polyhedra (loop), it computes a set of disjoint
868 { int lazy_equal=0, disjoint = 0; local
895 if ((disjoint = cloog_domain_lazy_disjoint(Q->domain,loop->domain)))
911 disjoint = 1;
917 if (disjoint)
1084 * parameterized disjoint polyhedra, in order to not have lexicographic order
1892 /* 3. Separate all projections into disjoint polyhedr
[all...]
/haiku-buildtools/isl/doc/
H A Dimplementation.tex1650 However, it is also possible to detect disjoint domains and ranges

Completed in 172 milliseconds