isl_aff_lex_templ.c
1.83 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/*
* Copyright 2014 INRIA Rocquencourt
*
* Use of this software is governed by the MIT license
*
* Written by Sven Verdoolaege,
* Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
* B.P. 105 - 78153 Le Chesnay, France
*/
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
#define FN(TYPE,NAME) xFN(TYPE,NAME)
/* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
* where the function value of "mpa1" lexicographically compares as "ORDER"
* to that of "mpa2". "space" is the space of the result.
* The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
*
* "mpa1" is in the given lexicographic order compared to "mpa2"
* if its i-th element is in that order compared to
* the i-th element of "mpa2" while all previous elements are
* pairwise equal.
*/
static __isl_give isl_map *FN(FN(isl_multi_pw_aff_lex,ORDER),map_on_space)(
__isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2,
__isl_take isl_space *space)
{
return isl_multi_pw_aff_lex_map_on_space(mpa1, mpa2,
&FN(FN(isl_pw_aff,ORDER),map), space);
}
/* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
* where the function value of "mpa1" lexicographically compares as "ORDER"
* to that of "mpa2".
*/
__isl_give isl_map *FN(FN(isl_multi_pw_aff_lex,ORDER),map)(
__isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2)
{
return isl_multi_pw_aff_order_map(mpa1, mpa2,
&FN(FN(isl_multi_pw_aff_lex,ORDER),map_on_space));
}
/* Return the subset of "map" where the domain and the range
* have "mpa" values that lexicographically compare as "ORDER".
*/
__isl_give isl_map *FN(FN(isl_map_lex,ORDER),at_multi_pw_aff)(
__isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa)
{
return isl_map_order_at_multi_pw_aff(map, mpa,
&FN(FN(isl_multi_pw_aff_lex,ORDER),map));
}