Searched refs:domains (Results 1 - 3 of 3) sorted by relevance
| /haiku-buildtools/cloog/examples/example/ |
| H A D | example-isl.c | 22 CloogUnionDomain *domains; local
36 /* Translate them to CLooG context, domains and scattering */
43 /* Prepare the list of domains to scan */
44 domains = cloog_union_domain_alloc(nb_parameters);
45 cloog_union_domain_add_domain(domains, "S1", domain1, scattering1, NULL);
46 cloog_union_domain_add_domain(domains, "S2", domain2, scattering2, NULL);
47 cloog_union_domain_set_name(domains, CLOOG_PARAM, 0, parameter_name[0]);
48 cloog_union_domain_set_name(domains, CLOOG_ITER, 0, iterator_name[0]);
49 cloog_union_domain_set_name(domains, CLOOG_ITER, 1, iterator_name[1]);
50 cloog_union_domain_set_name(domains, CLOOG_SCA
[all...] |
| /haiku-buildtools/isl/ |
| H A D | isl_ast_codegen.c | 1014 * to compute a lower or upper bound using exact_bound. The domains
1753 /* Generate code for the schedule domains in "scc"
1756 * The domains in "scc" form a strongly connected component in the ordering.
1757 * If the number of domains in "scc" is larger than 1, then this means
1758 * that we cannot determine a valid ordering for the domains in the component.
1759 * This should be fairly rare because the individual domains
1761 * The problem is that the domains may be integrally disjoint but not
1762 * rationally disjoint. For example, we may have domains
1766 * These two domains have an empty intersection, but their rational
1767 * relaxations do intersect. It is impossible to order these domains
2323 do_unroll(struct isl_codegen_domains *domains, __isl_take isl_set *domain, __isl_take isl_set *class_domain) argument
2404 compute_unroll_domains( struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) argument
2463 compute_atomic_domain( struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) argument
2509 compute_separate_domain(struct isl_codegen_domains *domains, __isl_keep isl_set *class_domain) argument
2575 compute_partial_domains(struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) argument
2626 struct isl_codegen_domains *domains = user; local
2694 struct isl_codegen_domains domains; local
[all...] |
| /haiku-buildtools/isl/doc/ |
| H A D | implementation.tex | 1634 \subsection{Partitioning the domains and ranges of $R$}
1641 domains, then this assumption no longer holds.
1645 sense to look at differences between iterations of different domains.
1650 However, it is also possible to detect disjoint domains and ranges
1683 Let $D_{2i}$ be the domains of $R_i$ and $D_{2i+1}$ the ranges of $R_i$.
1759 The domains and ranges can therefore be partitioned into two parts,
|
Completed in 52 milliseconds