]>
Commit | Line | Data |
---|---|---|
1364018f | 1 | /* Chains of recurrences. |
fbd26352 | 2 | Copyright (C) 2003-2019 Free Software Foundation, Inc. |
6b421feb | 3 | Contributed by Sebastian Pop <pop@cri.ensmp.fr> |
1364018f | 4 | |
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 9 | Software Foundation; either version 3, or (at your option) any later |
1364018f | 10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
1364018f | 20 | |
21 | #ifndef GCC_TREE_CHREC_H | |
22 | #define GCC_TREE_CHREC_H | |
23 | ||
48e1416a | 24 | /* The following trees are unique elements. Thus the comparison of another |
25 | element to these elements should be done on the pointer to these trees, | |
1364018f | 26 | and not on their value. */ |
27 | ||
28 | extern tree chrec_not_analyzed_yet; | |
29 | extern GTY(()) tree chrec_dont_know; | |
30 | extern GTY(()) tree chrec_known; | |
31 | ||
32 | /* After having added an automatically generated element, please | |
33 | include it in the following function. */ | |
34 | ||
35 | static inline bool | |
7ecb5bb2 | 36 | automatically_generated_chrec_p (const_tree chrec) |
1364018f | 37 | { |
c4e91ab3 | 38 | return (chrec == chrec_dont_know |
1364018f | 39 | || chrec == chrec_known); |
40 | } | |
41 | ||
42 | /* The tree nodes aka. CHRECs. */ | |
43 | ||
44 | static inline bool | |
7ecb5bb2 | 45 | tree_is_chrec (const_tree expr) |
1364018f | 46 | { |
47 | if (TREE_CODE (expr) == POLYNOMIAL_CHREC | |
48 | || automatically_generated_chrec_p (expr)) | |
49 | return true; | |
50 | else | |
51 | return false; | |
52 | } | |
53 | ||
54 | \f | |
64641360 | 55 | enum ev_direction {EV_DIR_GROWS, EV_DIR_DECREASES, EV_DIR_UNKNOWN}; |
56 | enum ev_direction scev_direction (const_tree); | |
1364018f | 57 | |
58 | /* Chrec folding functions. */ | |
59 | extern tree chrec_fold_plus (tree, tree, tree); | |
60 | extern tree chrec_fold_minus (tree, tree, tree); | |
61 | extern tree chrec_fold_multiply (tree, tree, tree); | |
90261646 | 62 | extern tree chrec_convert (tree, tree, gimple *, bool = true, tree = NULL); |
42acab1c | 63 | extern tree chrec_convert_rhs (tree, tree, gimple *); |
5fe66b3c | 64 | extern tree chrec_convert_aggressive (tree, tree, bool *); |
1364018f | 65 | |
66 | /* Operations. */ | |
67 | extern tree chrec_apply (unsigned, tree, tree); | |
f1f41a6c | 68 | extern tree chrec_apply_map (tree, vec<tree> ); |
1364018f | 69 | extern tree chrec_replace_initial_condition (tree, tree); |
1364018f | 70 | extern tree initial_condition (tree); |
9ce81338 | 71 | extern tree initial_condition_in_loop_num (tree, unsigned); |
1364018f | 72 | extern tree evolution_part_in_loop_num (tree, unsigned); |
73 | extern tree hide_evolution_in_other_loops_than_loop (tree, unsigned); | |
74 | extern tree reset_evolution_in_loop (unsigned, tree, tree); | |
75 | extern tree chrec_merge (tree, tree); | |
255b6be7 | 76 | extern void for_each_scev_op (tree *, bool (*) (tree *, void *), void *); |
42acab1c | 77 | extern bool convert_affine_scev (struct loop *, tree, tree *, tree *, gimple *, |
90261646 | 78 | bool, tree = NULL); |
1364018f | 79 | |
80 | /* Observers. */ | |
7ecb5bb2 | 81 | extern bool eq_evolutions_p (const_tree, const_tree); |
82 | extern bool is_multivariate_chrec (const_tree); | |
2199e93e | 83 | extern bool chrec_contains_symbols (const_tree, struct loop * = NULL); |
7ecb5bb2 | 84 | extern bool chrec_contains_symbols_defined_in_loop (const_tree, unsigned); |
85 | extern bool chrec_contains_undetermined (const_tree); | |
86 | extern bool tree_contains_chrecs (const_tree, int *); | |
87 | extern bool evolution_function_is_affine_multivariate_p (const_tree, int); | |
1183882b | 88 | extern bool evolution_function_is_univariate_p (const_tree, int = 0); |
bc3c8ad4 | 89 | extern unsigned nb_vars_in_chrec (tree); |
df09cc3d | 90 | extern bool evolution_function_is_invariant_p (tree, int); |
145bdf6a | 91 | extern bool scev_is_linear_expression (tree); |
e44bcf83 | 92 | extern bool evolution_function_right_is_integer_cst (const_tree); |
1364018f | 93 | |
3e6bc865 | 94 | /* Determines whether CHREC is equal to zero. */ |
95 | ||
48e1416a | 96 | static inline bool |
7ecb5bb2 | 97 | chrec_zerop (const_tree chrec) |
3e6bc865 | 98 | { |
99 | if (chrec == NULL_TREE) | |
100 | return false; | |
48e1416a | 101 | |
3e6bc865 | 102 | if (TREE_CODE (chrec) == INTEGER_CST) |
103 | return integer_zerop (chrec); | |
48e1416a | 104 | |
3e6bc865 | 105 | return false; |
106 | } | |
1364018f | 107 | |
48e1416a | 108 | /* Determines whether CHREC is a loop invariant with respect to LOOP_NUM. |
df09cc3d | 109 | Set the result in RES and return true when the property can be computed. */ |
110 | ||
111 | static inline bool | |
112 | no_evolution_in_loop_p (tree chrec, unsigned loop_num, bool *res) | |
113 | { | |
114 | tree scev; | |
48e1416a | 115 | |
df09cc3d | 116 | if (chrec == chrec_not_analyzed_yet |
117 | || chrec == chrec_dont_know | |
118 | || chrec_contains_symbols_defined_in_loop (chrec, loop_num)) | |
119 | return false; | |
120 | ||
8da11536 | 121 | STRIP_NOPS (chrec); |
df09cc3d | 122 | scev = hide_evolution_in_other_loops_than_loop (chrec, loop_num); |
ad732fa6 | 123 | *res = !tree_contains_chrecs (scev, NULL); |
df09cc3d | 124 | return true; |
125 | } | |
126 | ||
1364018f | 127 | /* Build a polynomial chain of recurrence. */ |
128 | ||
48e1416a | 129 | static inline tree |
130 | build_polynomial_chrec (unsigned loop_num, | |
131 | tree left, | |
1364018f | 132 | tree right) |
133 | { | |
df09cc3d | 134 | bool val; |
135 | ||
1364018f | 136 | if (left == chrec_dont_know |
137 | || right == chrec_dont_know) | |
138 | return chrec_dont_know; | |
139 | ||
0f0057aa | 140 | if (!no_evolution_in_loop_p (left, loop_num, &val) |
141 | || !val) | |
df09cc3d | 142 | return chrec_dont_know; |
143 | ||
5fa7ce8c | 144 | /* Types of left and right sides of a chrec should be compatible, but |
145 | pointer CHRECs are special in that the evolution is of ptroff type. */ | |
0de36bdb | 146 | if (POINTER_TYPE_P (TREE_TYPE (left))) |
5fa7ce8c | 147 | gcc_checking_assert (ptrofftype_p (TREE_TYPE (right))); |
0de36bdb | 148 | else |
5fa7ce8c | 149 | { |
150 | /* Pointer types should occur only on the left hand side, i.e. in | |
151 | the base of the chrec, and not in the step. */ | |
152 | gcc_checking_assert (!POINTER_TYPE_P (TREE_TYPE (right)) | |
153 | && types_compatible_p (TREE_TYPE (left), | |
154 | TREE_TYPE (right))); | |
155 | } | |
f84a688a | 156 | |
3e6bc865 | 157 | if (chrec_zerop (right)) |
158 | return left; | |
159 | ||
4a81b20b | 160 | tree chrec = build2 (POLYNOMIAL_CHREC, TREE_TYPE (left), left, right); |
161 | CHREC_VARIABLE (chrec) = loop_num; | |
162 | return chrec; | |
1364018f | 163 | } |
164 | ||
1364018f | 165 | /* Determines whether the expression CHREC is a constant. */ |
166 | ||
48e1416a | 167 | static inline bool |
7ecb5bb2 | 168 | evolution_function_is_constant_p (const_tree chrec) |
1364018f | 169 | { |
170 | if (chrec == NULL_TREE) | |
171 | return false; | |
172 | ||
51a2c146 | 173 | return is_gimple_min_invariant (chrec); |
1364018f | 174 | } |
175 | ||
8ceddf57 | 176 | /* Determine whether CHREC is an affine evolution function in LOOPNUM. */ |
1364018f | 177 | |
48e1416a | 178 | static inline bool |
8ceddf57 | 179 | evolution_function_is_affine_in_loop (const_tree chrec, int loopnum) |
1364018f | 180 | { |
181 | if (chrec == NULL_TREE) | |
182 | return false; | |
48e1416a | 183 | |
1364018f | 184 | switch (TREE_CODE (chrec)) |
185 | { | |
186 | case POLYNOMIAL_CHREC: | |
8ceddf57 | 187 | if (evolution_function_is_invariant_p (CHREC_LEFT (chrec), loopnum) |
188 | && evolution_function_is_invariant_p (CHREC_RIGHT (chrec), loopnum)) | |
1364018f | 189 | return true; |
190 | else | |
191 | return false; | |
48e1416a | 192 | |
1364018f | 193 | default: |
194 | return false; | |
195 | } | |
196 | } | |
197 | ||
8ceddf57 | 198 | /* Determine whether CHREC is an affine evolution function or not. */ |
1364018f | 199 | |
48e1416a | 200 | static inline bool |
8ceddf57 | 201 | evolution_function_is_affine_p (const_tree chrec) |
1364018f | 202 | { |
bef5a5f5 | 203 | return chrec |
204 | && TREE_CODE (chrec) == POLYNOMIAL_CHREC | |
205 | && evolution_function_is_invariant_p (CHREC_RIGHT (chrec), | |
2c8ee7ae | 206 | CHREC_VARIABLE (chrec)) |
207 | && (TREE_CODE (CHREC_RIGHT (chrec)) != POLYNOMIAL_CHREC | |
208 | || evolution_function_is_affine_p (CHREC_RIGHT (chrec))); | |
1364018f | 209 | } |
210 | ||
211 | /* Determines whether EXPR does not contains chrec expressions. */ | |
212 | ||
213 | static inline bool | |
7ecb5bb2 | 214 | tree_does_not_contain_chrecs (const_tree expr) |
1364018f | 215 | { |
a89ef955 | 216 | return !tree_contains_chrecs (expr, NULL); |
1364018f | 217 | } |
218 | ||
f84a688a | 219 | /* Returns the type of the chrec. */ |
220 | ||
221 | static inline tree | |
7ecb5bb2 | 222 | chrec_type (const_tree chrec) |
f84a688a | 223 | { |
224 | if (automatically_generated_chrec_p (chrec)) | |
225 | return NULL_TREE; | |
226 | ||
227 | return TREE_TYPE (chrec); | |
228 | } | |
229 | ||
8ceddf57 | 230 | static inline tree |
231 | chrec_fold_op (enum tree_code code, tree type, tree op0, tree op1) | |
232 | { | |
233 | switch (code) | |
234 | { | |
235 | case PLUS_EXPR: | |
236 | return chrec_fold_plus (type, op0, op1); | |
237 | ||
238 | case MINUS_EXPR: | |
239 | return chrec_fold_minus (type, op0, op1); | |
240 | ||
241 | case MULT_EXPR: | |
242 | return chrec_fold_multiply (type, op0, op1); | |
243 | ||
244 | default: | |
245 | gcc_unreachable (); | |
246 | } | |
247 | ||
248 | } | |
f84a688a | 249 | |
1364018f | 250 | #endif /* GCC_TREE_CHREC_H */ |