Mercurial > hg > CbC > CbC_gcc
annotate gcc/tree-chrec.c @ 118:fd00160c1b76
ifdef TARGET_64BIT
| author | mir3636 |
|---|---|
| date | Tue, 27 Feb 2018 15:01:35 +0900 |
| parents | 04ced10e8804 |
| children | 84e7813d76e9 |
| rev | line source |
|---|---|
| 0 | 1 /* Chains of recurrences. |
| 111 | 2 Copyright (C) 2003-2017 Free Software Foundation, Inc. |
| 0 | 3 Contributed by Sebastian Pop <pop@cri.ensmp.fr> |
| 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 | |
| 9 Software Foundation; either version 3, or (at your option) any later | |
| 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 | |
| 18 along with GCC; see the file COPYING3. If not see | |
| 19 <http://www.gnu.org/licenses/>. */ | |
| 20 | |
| 21 /* This file implements operations on chains of recurrences. Chains | |
| 22 of recurrences are used for modeling evolution functions of scalar | |
| 23 variables. | |
| 24 */ | |
| 25 | |
| 26 #include "config.h" | |
| 27 #include "system.h" | |
| 28 #include "coretypes.h" | |
| 111 | 29 #include "backend.h" |
| 30 #include "tree.h" | |
| 31 #include "gimple-expr.h" | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
32 #include "tree-pretty-print.h" |
| 111 | 33 #include "fold-const.h" |
| 0 | 34 #include "cfgloop.h" |
| 111 | 35 #include "tree-ssa-loop-ivopts.h" |
| 36 #include "tree-ssa-loop-niter.h" | |
| 0 | 37 #include "tree-chrec.h" |
| 111 | 38 #include "dumpfile.h" |
| 0 | 39 #include "params.h" |
| 40 #include "tree-scalar-evolution.h" | |
| 41 | |
| 42 /* Extended folder for chrecs. */ | |
| 43 | |
| 44 /* Determines whether CST is not a constant evolution. */ | |
| 45 | |
| 46 static inline bool | |
| 47 is_not_constant_evolution (const_tree cst) | |
| 48 { | |
| 49 return (TREE_CODE (cst) == POLYNOMIAL_CHREC); | |
| 50 } | |
| 51 | |
| 52 /* Fold CODE for a polynomial function and a constant. */ | |
| 53 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
54 static inline tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
55 chrec_fold_poly_cst (enum tree_code code, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
56 tree type, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
57 tree poly, |
| 0 | 58 tree cst) |
| 59 { | |
| 60 gcc_assert (poly); | |
| 61 gcc_assert (cst); | |
| 62 gcc_assert (TREE_CODE (poly) == POLYNOMIAL_CHREC); | |
| 111 | 63 gcc_checking_assert (!is_not_constant_evolution (cst)); |
| 64 gcc_checking_assert (useless_type_conversion_p (type, chrec_type (poly))); | |
| 0 | 65 |
| 66 switch (code) | |
| 67 { | |
| 68 case PLUS_EXPR: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
69 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
70 (CHREC_VARIABLE (poly), |
| 0 | 71 chrec_fold_plus (type, CHREC_LEFT (poly), cst), |
| 72 CHREC_RIGHT (poly)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
73 |
| 0 | 74 case MINUS_EXPR: |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
75 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
76 (CHREC_VARIABLE (poly), |
| 0 | 77 chrec_fold_minus (type, CHREC_LEFT (poly), cst), |
| 78 CHREC_RIGHT (poly)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
79 |
| 0 | 80 case MULT_EXPR: |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
81 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
82 (CHREC_VARIABLE (poly), |
| 0 | 83 chrec_fold_multiply (type, CHREC_LEFT (poly), cst), |
| 84 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
85 |
| 0 | 86 default: |
| 87 return chrec_dont_know; | |
| 88 } | |
| 89 } | |
| 90 | |
| 91 /* Fold the addition of two polynomial functions. */ | |
| 92 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
93 static inline tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
94 chrec_fold_plus_poly_poly (enum tree_code code, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
95 tree type, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
96 tree poly0, |
| 0 | 97 tree poly1) |
| 98 { | |
| 99 tree left, right; | |
| 100 struct loop *loop0 = get_chrec_loop (poly0); | |
| 101 struct loop *loop1 = get_chrec_loop (poly1); | |
| 111 | 102 tree rtype = code == POINTER_PLUS_EXPR ? chrec_type (poly1) : type; |
| 0 | 103 |
| 104 gcc_assert (poly0); | |
| 105 gcc_assert (poly1); | |
| 106 gcc_assert (TREE_CODE (poly0) == POLYNOMIAL_CHREC); | |
| 107 gcc_assert (TREE_CODE (poly1) == POLYNOMIAL_CHREC); | |
| 108 if (POINTER_TYPE_P (chrec_type (poly0))) | |
| 111 | 109 gcc_checking_assert (ptrofftype_p (chrec_type (poly1)) |
| 110 && useless_type_conversion_p (type, chrec_type (poly0))); | |
| 0 | 111 else |
| 111 | 112 gcc_checking_assert (useless_type_conversion_p (type, chrec_type (poly0)) |
| 113 && useless_type_conversion_p (type, chrec_type (poly1))); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
114 |
| 0 | 115 /* |
| 116 {a, +, b}_1 + {c, +, d}_2 -> {{a, +, b}_1 + c, +, d}_2, | |
| 117 {a, +, b}_2 + {c, +, d}_1 -> {{c, +, d}_1 + a, +, b}_2, | |
| 118 {a, +, b}_x + {c, +, d}_x -> {a+c, +, b+d}_x. */ | |
| 119 if (flow_loop_nested_p (loop0, loop1)) | |
| 120 { | |
| 121 if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
122 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
123 (CHREC_VARIABLE (poly1), |
| 0 | 124 chrec_fold_plus (type, poly0, CHREC_LEFT (poly1)), |
| 125 CHREC_RIGHT (poly1)); | |
| 126 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
127 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
128 (CHREC_VARIABLE (poly1), |
| 0 | 129 chrec_fold_minus (type, poly0, CHREC_LEFT (poly1)), |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
130 chrec_fold_multiply (type, CHREC_RIGHT (poly1), |
| 0 | 131 SCALAR_FLOAT_TYPE_P (type) |
| 132 ? build_real (type, dconstm1) | |
| 133 : build_int_cst_type (type, -1))); | |
| 134 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
135 |
| 0 | 136 if (flow_loop_nested_p (loop1, loop0)) |
| 137 { | |
| 138 if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
139 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
140 (CHREC_VARIABLE (poly0), |
| 0 | 141 chrec_fold_plus (type, CHREC_LEFT (poly0), poly1), |
| 142 CHREC_RIGHT (poly0)); | |
| 143 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
144 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
145 (CHREC_VARIABLE (poly0), |
| 0 | 146 chrec_fold_minus (type, CHREC_LEFT (poly0), poly1), |
| 147 CHREC_RIGHT (poly0)); | |
| 148 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
149 |
| 0 | 150 /* This function should never be called for chrecs of loops that |
| 151 do not belong to the same loop nest. */ | |
| 111 | 152 if (loop0 != loop1) |
| 153 { | |
| 154 /* It still can happen if we are not in loop-closed SSA form. */ | |
| 155 gcc_assert (! loops_state_satisfies_p (LOOP_CLOSED_SSA)); | |
| 156 return chrec_dont_know; | |
| 157 } | |
| 0 | 158 |
| 159 if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR) | |
| 160 { | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
161 left = chrec_fold_plus |
| 0 | 162 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
163 right = chrec_fold_plus |
| 0 | 164 (rtype, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1)); |
| 165 } | |
| 166 else | |
| 167 { | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
168 left = chrec_fold_minus |
| 0 | 169 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
170 right = chrec_fold_minus |
| 0 | 171 (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1)); |
| 172 } | |
| 173 | |
| 174 if (chrec_zerop (right)) | |
| 175 return left; | |
| 176 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
177 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
178 (CHREC_VARIABLE (poly0), left, right); |
| 0 | 179 } |
| 180 | |
| 181 | |
| 182 | |
| 183 /* Fold the multiplication of two polynomial functions. */ | |
| 184 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
185 static inline tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
186 chrec_fold_multiply_poly_poly (tree type, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
187 tree poly0, |
| 0 | 188 tree poly1) |
| 189 { | |
| 190 tree t0, t1, t2; | |
| 191 int var; | |
| 192 struct loop *loop0 = get_chrec_loop (poly0); | |
| 193 struct loop *loop1 = get_chrec_loop (poly1); | |
| 194 | |
| 195 gcc_assert (poly0); | |
| 196 gcc_assert (poly1); | |
| 197 gcc_assert (TREE_CODE (poly0) == POLYNOMIAL_CHREC); | |
| 198 gcc_assert (TREE_CODE (poly1) == POLYNOMIAL_CHREC); | |
| 111 | 199 gcc_checking_assert (useless_type_conversion_p (type, chrec_type (poly0)) |
| 200 && useless_type_conversion_p (type, chrec_type (poly1))); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
201 |
| 0 | 202 /* {a, +, b}_1 * {c, +, d}_2 -> {c*{a, +, b}_1, +, d}_2, |
| 203 {a, +, b}_2 * {c, +, d}_1 -> {a*{c, +, d}_1, +, b}_2, | |
| 204 {a, +, b}_x * {c, +, d}_x -> {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x. */ | |
| 205 if (flow_loop_nested_p (loop0, loop1)) | |
| 206 /* poly0 is a constant wrt. poly1. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
207 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
208 (CHREC_VARIABLE (poly1), |
| 0 | 209 chrec_fold_multiply (type, CHREC_LEFT (poly1), poly0), |
| 210 CHREC_RIGHT (poly1)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
211 |
| 0 | 212 if (flow_loop_nested_p (loop1, loop0)) |
| 213 /* poly1 is a constant wrt. poly0. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
214 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
215 (CHREC_VARIABLE (poly0), |
| 0 | 216 chrec_fold_multiply (type, CHREC_LEFT (poly0), poly1), |
| 217 CHREC_RIGHT (poly0)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
218 |
| 111 | 219 if (loop0 != loop1) |
| 220 { | |
| 221 /* It still can happen if we are not in loop-closed SSA form. */ | |
| 222 gcc_assert (! loops_state_satisfies_p (LOOP_CLOSED_SSA)); | |
| 223 return chrec_dont_know; | |
| 224 } | |
| 0 | 225 |
| 226 /* poly0 and poly1 are two polynomials in the same variable, | |
| 227 {a, +, b}_x * {c, +, d}_x -> {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
228 |
| 0 | 229 /* "a*c". */ |
| 230 t0 = chrec_fold_multiply (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)); | |
| 231 | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
232 /* "a*d + b*c". */ |
| 0 | 233 t1 = chrec_fold_multiply (type, CHREC_LEFT (poly0), CHREC_RIGHT (poly1)); |
| 234 t1 = chrec_fold_plus (type, t1, chrec_fold_multiply (type, | |
| 235 CHREC_RIGHT (poly0), | |
| 236 CHREC_LEFT (poly1))); | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
237 /* "b*d". */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
238 t2 = chrec_fold_multiply (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1)); |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
239 /* "a*d + b*c + b*d". */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
240 t1 = chrec_fold_plus (type, t1, t2); |
| 0 | 241 /* "2*b*d". */ |
| 242 t2 = chrec_fold_multiply (type, SCALAR_FLOAT_TYPE_P (type) | |
| 243 ? build_real (type, dconst2) | |
| 244 : build_int_cst (type, 2), t2); | |
| 245 | |
| 246 var = CHREC_VARIABLE (poly0); | |
| 247 return build_polynomial_chrec (var, t0, | |
| 248 build_polynomial_chrec (var, t1, t2)); | |
| 249 } | |
| 250 | |
| 251 /* When the operands are automatically_generated_chrec_p, the fold has | |
| 252 to respect the semantics of the operands. */ | |
| 253 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
254 static inline tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
255 chrec_fold_automatically_generated_operands (tree op0, |
| 0 | 256 tree op1) |
| 257 { | |
| 258 if (op0 == chrec_dont_know | |
| 259 || op1 == chrec_dont_know) | |
| 260 return chrec_dont_know; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
261 |
| 0 | 262 if (op0 == chrec_known |
| 263 || op1 == chrec_known) | |
| 264 return chrec_known; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
265 |
| 0 | 266 if (op0 == chrec_not_analyzed_yet |
| 267 || op1 == chrec_not_analyzed_yet) | |
| 268 return chrec_not_analyzed_yet; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
269 |
| 0 | 270 /* The default case produces a safe result. */ |
| 271 return chrec_dont_know; | |
| 272 } | |
| 273 | |
| 274 /* Fold the addition of two chrecs. */ | |
| 275 | |
| 276 static tree | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
277 chrec_fold_plus_1 (enum tree_code code, tree type, |
| 0 | 278 tree op0, tree op1) |
| 279 { | |
| 280 if (automatically_generated_chrec_p (op0) | |
| 281 || automatically_generated_chrec_p (op1)) | |
| 282 return chrec_fold_automatically_generated_operands (op0, op1); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
283 |
| 0 | 284 switch (TREE_CODE (op0)) |
| 285 { | |
| 286 case POLYNOMIAL_CHREC: | |
| 111 | 287 gcc_checking_assert |
| 288 (!chrec_contains_symbols_defined_in_loop (op0, CHREC_VARIABLE (op0))); | |
| 0 | 289 switch (TREE_CODE (op1)) |
| 290 { | |
| 291 case POLYNOMIAL_CHREC: | |
| 111 | 292 gcc_checking_assert |
| 293 (!chrec_contains_symbols_defined_in_loop (op1, | |
| 294 CHREC_VARIABLE (op1))); | |
| 0 | 295 return chrec_fold_plus_poly_poly (code, type, op0, op1); |
| 296 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
297 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
298 if (tree_contains_chrecs (op1, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
299 return chrec_dont_know; |
| 111 | 300 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
301 |
| 0 | 302 default: |
| 303 if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
304 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
305 (CHREC_VARIABLE (op0), |
| 0 | 306 chrec_fold_plus (type, CHREC_LEFT (op0), op1), |
| 307 CHREC_RIGHT (op0)); | |
| 308 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
309 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
310 (CHREC_VARIABLE (op0), |
| 0 | 311 chrec_fold_minus (type, CHREC_LEFT (op0), op1), |
| 312 CHREC_RIGHT (op0)); | |
| 313 } | |
| 314 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
315 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
316 if (tree_contains_chrecs (op0, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
317 return chrec_dont_know; |
| 111 | 318 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
319 |
| 0 | 320 default: |
| 321 switch (TREE_CODE (op1)) | |
| 322 { | |
| 323 case POLYNOMIAL_CHREC: | |
| 111 | 324 gcc_checking_assert |
| 325 (!chrec_contains_symbols_defined_in_loop (op1, | |
| 326 CHREC_VARIABLE (op1))); | |
| 0 | 327 if (code == PLUS_EXPR || code == POINTER_PLUS_EXPR) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
328 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
329 (CHREC_VARIABLE (op1), |
| 0 | 330 chrec_fold_plus (type, op0, CHREC_LEFT (op1)), |
| 331 CHREC_RIGHT (op1)); | |
| 332 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
333 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
334 (CHREC_VARIABLE (op1), |
| 0 | 335 chrec_fold_minus (type, op0, CHREC_LEFT (op1)), |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
336 chrec_fold_multiply (type, CHREC_RIGHT (op1), |
| 0 | 337 SCALAR_FLOAT_TYPE_P (type) |
| 338 ? build_real (type, dconstm1) | |
| 339 : build_int_cst_type (type, -1))); | |
| 340 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
341 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
342 if (tree_contains_chrecs (op1, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
343 return chrec_dont_know; |
| 111 | 344 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
345 |
| 0 | 346 default: |
| 347 { | |
| 348 int size = 0; | |
| 349 if ((tree_contains_chrecs (op0, &size) | |
| 350 || tree_contains_chrecs (op1, &size)) | |
| 351 && size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE)) | |
| 352 return build2 (code, type, op0, op1); | |
| 353 else if (size < PARAM_VALUE (PARAM_SCEV_MAX_EXPR_SIZE)) | |
| 111 | 354 { |
| 355 if (code == POINTER_PLUS_EXPR) | |
| 356 return fold_build_pointer_plus (fold_convert (type, op0), | |
| 357 op1); | |
| 358 else | |
| 359 return fold_build2 (code, type, | |
| 360 fold_convert (type, op0), | |
| 361 fold_convert (type, op1)); | |
| 362 } | |
| 0 | 363 else |
| 364 return chrec_dont_know; | |
| 365 } | |
| 366 } | |
| 367 } | |
| 368 } | |
| 369 | |
| 370 /* Fold the addition of two chrecs. */ | |
| 371 | |
| 372 tree | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
373 chrec_fold_plus (tree type, |
| 0 | 374 tree op0, |
| 375 tree op1) | |
| 376 { | |
| 377 enum tree_code code; | |
| 378 if (automatically_generated_chrec_p (op0) | |
| 379 || automatically_generated_chrec_p (op1)) | |
| 380 return chrec_fold_automatically_generated_operands (op0, op1); | |
| 381 | |
| 382 if (integer_zerop (op0)) | |
| 383 return chrec_convert (type, op1, NULL); | |
| 384 if (integer_zerop (op1)) | |
| 385 return chrec_convert (type, op0, NULL); | |
| 386 | |
| 387 if (POINTER_TYPE_P (type)) | |
| 388 code = POINTER_PLUS_EXPR; | |
| 389 else | |
| 390 code = PLUS_EXPR; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
391 |
| 0 | 392 return chrec_fold_plus_1 (code, type, op0, op1); |
| 393 } | |
| 394 | |
| 395 /* Fold the subtraction of two chrecs. */ | |
| 396 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
397 tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
398 chrec_fold_minus (tree type, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
399 tree op0, |
| 0 | 400 tree op1) |
| 401 { | |
| 402 if (automatically_generated_chrec_p (op0) | |
| 403 || automatically_generated_chrec_p (op1)) | |
| 404 return chrec_fold_automatically_generated_operands (op0, op1); | |
| 405 | |
| 406 if (integer_zerop (op1)) | |
| 407 return op0; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
408 |
| 0 | 409 return chrec_fold_plus_1 (MINUS_EXPR, type, op0, op1); |
| 410 } | |
| 411 | |
| 412 /* Fold the multiplication of two chrecs. */ | |
| 413 | |
| 414 tree | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
415 chrec_fold_multiply (tree type, |
| 0 | 416 tree op0, |
| 417 tree op1) | |
| 418 { | |
| 419 if (automatically_generated_chrec_p (op0) | |
| 420 || automatically_generated_chrec_p (op1)) | |
| 421 return chrec_fold_automatically_generated_operands (op0, op1); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
422 |
| 0 | 423 switch (TREE_CODE (op0)) |
| 424 { | |
| 425 case POLYNOMIAL_CHREC: | |
| 111 | 426 gcc_checking_assert |
| 427 (!chrec_contains_symbols_defined_in_loop (op0, CHREC_VARIABLE (op0))); | |
| 0 | 428 switch (TREE_CODE (op1)) |
| 429 { | |
| 430 case POLYNOMIAL_CHREC: | |
| 111 | 431 gcc_checking_assert |
| 432 (!chrec_contains_symbols_defined_in_loop (op1, | |
| 433 CHREC_VARIABLE (op1))); | |
| 0 | 434 return chrec_fold_multiply_poly_poly (type, op0, op1); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
435 |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
436 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
437 if (tree_contains_chrecs (op1, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
438 return chrec_dont_know; |
| 111 | 439 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
440 |
| 0 | 441 default: |
| 442 if (integer_onep (op1)) | |
| 443 return op0; | |
| 444 if (integer_zerop (op1)) | |
| 445 return build_int_cst (type, 0); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
446 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
447 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
448 (CHREC_VARIABLE (op0), |
| 0 | 449 chrec_fold_multiply (type, CHREC_LEFT (op0), op1), |
| 450 chrec_fold_multiply (type, CHREC_RIGHT (op0), op1)); | |
| 451 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
452 |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
453 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
454 if (tree_contains_chrecs (op0, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
455 return chrec_dont_know; |
| 111 | 456 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
457 |
| 0 | 458 default: |
| 459 if (integer_onep (op0)) | |
| 460 return op1; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
461 |
| 0 | 462 if (integer_zerop (op0)) |
| 463 return build_int_cst (type, 0); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
464 |
| 0 | 465 switch (TREE_CODE (op1)) |
| 466 { | |
| 467 case POLYNOMIAL_CHREC: | |
| 111 | 468 gcc_checking_assert |
| 469 (!chrec_contains_symbols_defined_in_loop (op1, | |
| 470 CHREC_VARIABLE (op1))); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
471 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
472 (CHREC_VARIABLE (op1), |
| 0 | 473 chrec_fold_multiply (type, CHREC_LEFT (op1), op0), |
| 474 chrec_fold_multiply (type, CHREC_RIGHT (op1), op0)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
475 |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
476 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
477 if (tree_contains_chrecs (op1, NULL)) |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
478 return chrec_dont_know; |
| 111 | 479 /* FALLTHRU */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
480 |
| 0 | 481 default: |
| 482 if (integer_onep (op1)) | |
| 483 return op0; | |
| 484 if (integer_zerop (op1)) | |
| 485 return build_int_cst (type, 0); | |
| 486 return fold_build2 (MULT_EXPR, type, op0, op1); | |
| 487 } | |
| 488 } | |
| 489 } | |
| 490 | |
| 491 | |
| 492 | |
| 493 /* Operations. */ | |
| 494 | |
| 495 /* Evaluate the binomial coefficient. Return NULL_TREE if the intermediate | |
| 496 calculation overflows, otherwise return C(n,k) with type TYPE. */ | |
| 497 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
498 static tree |
| 0 | 499 tree_fold_binomial (tree type, tree n, unsigned int k) |
| 500 { | |
| 111 | 501 bool overflow; |
| 0 | 502 unsigned int i; |
| 503 | |
| 504 /* Handle the most frequent cases. */ | |
| 505 if (k == 0) | |
| 506 return build_int_cst (type, 1); | |
| 507 if (k == 1) | |
| 508 return fold_convert (type, n); | |
| 509 | |
| 111 | 510 widest_int num = wi::to_widest (n); |
| 511 | |
| 0 | 512 /* Check that k <= n. */ |
| 111 | 513 if (wi::ltu_p (num, k)) |
| 0 | 514 return NULL_TREE; |
| 515 | |
| 516 /* Denominator = 2. */ | |
| 111 | 517 widest_int denom = 2; |
| 0 | 518 |
| 519 /* Index = Numerator-1. */ | |
| 111 | 520 widest_int idx = num - 1; |
| 0 | 521 |
| 522 /* Numerator = Numerator*Index = n*(n-1). */ | |
| 111 | 523 num = wi::smul (num, idx, &overflow); |
| 524 if (overflow) | |
| 0 | 525 return NULL_TREE; |
| 526 | |
| 527 for (i = 3; i <= k; i++) | |
| 528 { | |
| 529 /* Index--. */ | |
| 111 | 530 --idx; |
| 0 | 531 |
| 532 /* Numerator *= Index. */ | |
| 111 | 533 num = wi::smul (num, idx, &overflow); |
| 534 if (overflow) | |
| 0 | 535 return NULL_TREE; |
| 536 | |
| 537 /* Denominator *= i. */ | |
| 111 | 538 denom *= i; |
| 0 | 539 } |
| 540 | |
| 541 /* Result = Numerator / Denominator. */ | |
| 111 | 542 num = wi::udiv_trunc (num, denom); |
| 543 if (! wi::fits_to_tree_p (num, type)) | |
| 544 return NULL_TREE; | |
| 545 return wide_int_to_tree (type, num); | |
| 0 | 546 } |
| 547 | |
| 548 /* Helper function. Use the Newton's interpolating formula for | |
| 111 | 549 evaluating the value of the evolution function. |
| 550 The result may be in an unsigned type of CHREC. */ | |
| 0 | 551 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
552 static tree |
| 0 | 553 chrec_evaluate (unsigned var, tree chrec, tree n, unsigned int k) |
| 554 { | |
| 555 tree arg0, arg1, binomial_n_k; | |
| 556 tree type = TREE_TYPE (chrec); | |
| 111 | 557 struct loop *var_loop = get_loop (cfun, var); |
| 0 | 558 |
| 559 while (TREE_CODE (chrec) == POLYNOMIAL_CHREC | |
| 560 && flow_loop_nested_p (var_loop, get_chrec_loop (chrec))) | |
| 561 chrec = CHREC_LEFT (chrec); | |
| 562 | |
| 111 | 563 /* The formula associates the expression and thus we have to make |
| 564 sure to not introduce undefined overflow. */ | |
| 565 tree ctype = type; | |
| 566 if (INTEGRAL_TYPE_P (type) | |
| 567 && ! TYPE_OVERFLOW_WRAPS (type)) | |
| 568 ctype = unsigned_type_for (type); | |
| 569 | |
| 0 | 570 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC |
| 571 && CHREC_VARIABLE (chrec) == var) | |
| 572 { | |
| 573 arg1 = chrec_evaluate (var, CHREC_RIGHT (chrec), n, k + 1); | |
| 574 if (arg1 == chrec_dont_know) | |
| 575 return chrec_dont_know; | |
| 111 | 576 binomial_n_k = tree_fold_binomial (ctype, n, k); |
| 0 | 577 if (!binomial_n_k) |
| 578 return chrec_dont_know; | |
| 111 | 579 tree l = chrec_convert (ctype, CHREC_LEFT (chrec), NULL); |
| 580 arg0 = fold_build2 (MULT_EXPR, ctype, l, binomial_n_k); | |
| 581 return chrec_fold_plus (ctype, arg0, arg1); | |
| 0 | 582 } |
| 583 | |
| 111 | 584 binomial_n_k = tree_fold_binomial (ctype, n, k); |
| 0 | 585 if (!binomial_n_k) |
| 586 return chrec_dont_know; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
587 |
| 111 | 588 return fold_build2 (MULT_EXPR, ctype, |
| 589 chrec_convert (ctype, chrec, NULL), binomial_n_k); | |
| 0 | 590 } |
| 591 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
592 /* Evaluates "CHREC (X)" when the varying variable is VAR. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
593 Example: Given the following parameters, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
594 |
| 0 | 595 var = 1 |
| 596 chrec = {3, +, 4}_1 | |
| 597 x = 10 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
598 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
599 The result is given by the Newton's interpolating formula: |
| 0 | 600 3 * \binom{10}{0} + 4 * \binom{10}{1}. |
| 601 */ | |
| 602 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
603 tree |
| 0 | 604 chrec_apply (unsigned var, |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
605 tree chrec, |
| 0 | 606 tree x) |
| 607 { | |
| 608 tree type = chrec_type (chrec); | |
| 609 tree res = chrec_dont_know; | |
| 610 | |
| 611 if (automatically_generated_chrec_p (chrec) | |
| 612 || automatically_generated_chrec_p (x) | |
| 613 | |
| 614 /* When the symbols are defined in an outer loop, it is possible | |
| 615 to symbolically compute the apply, since the symbols are | |
| 616 constants with respect to the varying loop. */ | |
| 617 || chrec_contains_symbols_defined_in_loop (chrec, var)) | |
| 618 return chrec_dont_know; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
619 |
| 111 | 620 if (dump_file && (dump_flags & TDF_SCEV)) |
| 0 | 621 fprintf (dump_file, "(chrec_apply \n"); |
| 622 | |
| 623 if (TREE_CODE (x) == INTEGER_CST && SCALAR_FLOAT_TYPE_P (type)) | |
| 624 x = build_real_from_int_cst (type, x); | |
| 625 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
626 switch (TREE_CODE (chrec)) |
| 0 | 627 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
628 case POLYNOMIAL_CHREC: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
629 if (evolution_function_is_affine_p (chrec)) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
630 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
631 if (CHREC_VARIABLE (chrec) != var) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
632 return build_polynomial_chrec |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
633 (CHREC_VARIABLE (chrec), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
634 chrec_apply (var, CHREC_LEFT (chrec), x), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
635 chrec_apply (var, CHREC_RIGHT (chrec), x)); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
636 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
637 /* "{a, +, b} (x)" -> "a + b*x". */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
638 x = chrec_convert_rhs (type, x, NULL); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
639 res = chrec_fold_multiply (TREE_TYPE (x), CHREC_RIGHT (chrec), x); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
640 res = chrec_fold_plus (type, CHREC_LEFT (chrec), res); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
641 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
642 else if (TREE_CODE (x) == INTEGER_CST |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
643 && tree_int_cst_sgn (x) == 1) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
644 /* testsuite/.../ssa-chrec-38.c. */ |
| 111 | 645 res = chrec_convert (type, chrec_evaluate (var, chrec, x, 0), NULL); |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
646 else |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
647 res = chrec_dont_know; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
648 break; |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
649 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
650 CASE_CONVERT: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
651 res = chrec_convert (TREE_TYPE (chrec), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
652 chrec_apply (var, TREE_OPERAND (chrec, 0), x), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
653 NULL); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
654 break; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
655 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
656 default: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
657 res = chrec; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
658 break; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
659 } |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
660 |
| 111 | 661 if (dump_file && (dump_flags & TDF_SCEV)) |
| 0 | 662 { |
| 663 fprintf (dump_file, " (varying_loop = %d\n", var); | |
| 664 fprintf (dump_file, ")\n (chrec = "); | |
| 111 | 665 print_generic_expr (dump_file, chrec); |
| 0 | 666 fprintf (dump_file, ")\n (x = "); |
| 111 | 667 print_generic_expr (dump_file, x); |
| 0 | 668 fprintf (dump_file, ")\n (res = "); |
| 111 | 669 print_generic_expr (dump_file, res); |
| 0 | 670 fprintf (dump_file, "))\n"); |
| 671 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
672 |
| 0 | 673 return res; |
| 674 } | |
| 675 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
676 /* For a given CHREC and an induction variable map IV_MAP that maps |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
677 (loop->num, expr) for every loop number of the current_loops an |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
678 expression, calls chrec_apply when the expression is not NULL. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
679 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
680 tree |
| 111 | 681 chrec_apply_map (tree chrec, vec<tree> iv_map) |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
682 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
683 int i; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
684 tree expr; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
685 |
| 111 | 686 FOR_EACH_VEC_ELT (iv_map, i, expr) |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
687 if (expr) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
688 chrec = chrec_apply (i, chrec, expr); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
689 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
690 return chrec; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
691 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
692 |
| 0 | 693 /* Replaces the initial condition in CHREC with INIT_COND. */ |
| 694 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
695 tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
696 chrec_replace_initial_condition (tree chrec, |
| 0 | 697 tree init_cond) |
| 698 { | |
| 699 if (automatically_generated_chrec_p (chrec)) | |
| 700 return chrec; | |
| 701 | |
| 702 gcc_assert (chrec_type (chrec) == chrec_type (init_cond)); | |
| 703 | |
| 704 switch (TREE_CODE (chrec)) | |
| 705 { | |
| 706 case POLYNOMIAL_CHREC: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
707 return build_polynomial_chrec |
| 0 | 708 (CHREC_VARIABLE (chrec), |
| 709 chrec_replace_initial_condition (CHREC_LEFT (chrec), init_cond), | |
| 710 CHREC_RIGHT (chrec)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
711 |
| 0 | 712 default: |
| 713 return init_cond; | |
| 714 } | |
| 715 } | |
| 716 | |
| 717 /* Returns the initial condition of a given CHREC. */ | |
| 718 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
719 tree |
| 0 | 720 initial_condition (tree chrec) |
| 721 { | |
| 722 if (automatically_generated_chrec_p (chrec)) | |
| 723 return chrec; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
724 |
| 0 | 725 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC) |
| 726 return initial_condition (CHREC_LEFT (chrec)); | |
| 727 else | |
| 728 return chrec; | |
| 729 } | |
| 730 | |
| 731 /* Returns a univariate function that represents the evolution in | |
| 732 LOOP_NUM. Mask the evolution of any other loop. */ | |
| 733 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
734 tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
735 hide_evolution_in_other_loops_than_loop (tree chrec, |
| 0 | 736 unsigned loop_num) |
| 737 { | |
| 111 | 738 struct loop *loop = get_loop (cfun, loop_num), *chloop; |
| 0 | 739 if (automatically_generated_chrec_p (chrec)) |
| 740 return chrec; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
741 |
| 0 | 742 switch (TREE_CODE (chrec)) |
| 743 { | |
| 744 case POLYNOMIAL_CHREC: | |
| 745 chloop = get_chrec_loop (chrec); | |
| 746 | |
| 747 if (chloop == loop) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
748 return build_polynomial_chrec |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
749 (loop_num, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
750 hide_evolution_in_other_loops_than_loop (CHREC_LEFT (chrec), |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
751 loop_num), |
| 0 | 752 CHREC_RIGHT (chrec)); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
753 |
| 0 | 754 else if (flow_loop_nested_p (chloop, loop)) |
| 755 /* There is no evolution in this loop. */ | |
| 756 return initial_condition (chrec); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
757 |
| 111 | 758 else if (flow_loop_nested_p (loop, chloop)) |
| 759 return hide_evolution_in_other_loops_than_loop (CHREC_LEFT (chrec), | |
| 760 loop_num); | |
| 761 | |
| 0 | 762 else |
| 111 | 763 return chrec_dont_know; |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
764 |
| 0 | 765 default: |
| 766 return chrec; | |
| 767 } | |
| 768 } | |
| 769 | |
| 770 /* Returns the evolution part of CHREC in LOOP_NUM when RIGHT is | |
| 771 true, otherwise returns the initial condition in LOOP_NUM. */ | |
| 772 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
773 static tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
774 chrec_component_in_loop_num (tree chrec, |
| 0 | 775 unsigned loop_num, |
| 776 bool right) | |
| 777 { | |
| 778 tree component; | |
| 111 | 779 struct loop *loop = get_loop (cfun, loop_num), *chloop; |
| 0 | 780 |
| 781 if (automatically_generated_chrec_p (chrec)) | |
| 782 return chrec; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
783 |
| 0 | 784 switch (TREE_CODE (chrec)) |
| 785 { | |
| 786 case POLYNOMIAL_CHREC: | |
| 787 chloop = get_chrec_loop (chrec); | |
| 788 | |
| 789 if (chloop == loop) | |
| 790 { | |
| 791 if (right) | |
| 792 component = CHREC_RIGHT (chrec); | |
| 793 else | |
| 794 component = CHREC_LEFT (chrec); | |
| 795 | |
| 796 if (TREE_CODE (CHREC_LEFT (chrec)) != POLYNOMIAL_CHREC | |
| 797 || CHREC_VARIABLE (CHREC_LEFT (chrec)) != CHREC_VARIABLE (chrec)) | |
| 798 return component; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
799 |
| 0 | 800 else |
| 801 return build_polynomial_chrec | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
802 (loop_num, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
803 chrec_component_in_loop_num (CHREC_LEFT (chrec), |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
804 loop_num, |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
805 right), |
| 0 | 806 component); |
| 807 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
808 |
| 0 | 809 else if (flow_loop_nested_p (chloop, loop)) |
| 810 /* There is no evolution part in this loop. */ | |
| 811 return NULL_TREE; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
812 |
| 0 | 813 else |
| 814 { | |
| 815 gcc_assert (flow_loop_nested_p (loop, chloop)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
816 return chrec_component_in_loop_num (CHREC_LEFT (chrec), |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
817 loop_num, |
| 0 | 818 right); |
| 819 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
820 |
| 0 | 821 default: |
| 822 if (right) | |
| 823 return NULL_TREE; | |
| 824 else | |
| 825 return chrec; | |
| 826 } | |
| 827 } | |
| 828 | |
| 829 /* Returns the evolution part in LOOP_NUM. Example: the call | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
830 evolution_part_in_loop_num ({{0, +, 1}_1, +, 2}_1, 1) returns |
| 0 | 831 {1, +, 2}_1 */ |
| 832 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
833 tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
834 evolution_part_in_loop_num (tree chrec, |
| 0 | 835 unsigned loop_num) |
| 836 { | |
| 837 return chrec_component_in_loop_num (chrec, loop_num, true); | |
| 838 } | |
| 839 | |
| 840 /* Returns the initial condition in LOOP_NUM. Example: the call | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
841 initial_condition_in_loop_num ({{0, +, 1}_1, +, 2}_2, 2) returns |
| 0 | 842 {0, +, 1}_1 */ |
| 843 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
844 tree |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
845 initial_condition_in_loop_num (tree chrec, |
| 0 | 846 unsigned loop_num) |
| 847 { | |
| 848 return chrec_component_in_loop_num (chrec, loop_num, false); | |
| 849 } | |
| 850 | |
| 851 /* Set or reset the evolution of CHREC to NEW_EVOL in loop LOOP_NUM. | |
| 852 This function is essentially used for setting the evolution to | |
| 853 chrec_dont_know, for example after having determined that it is | |
| 854 impossible to say how many times a loop will execute. */ | |
| 855 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
856 tree |
| 0 | 857 reset_evolution_in_loop (unsigned loop_num, |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
858 tree chrec, |
| 0 | 859 tree new_evol) |
| 860 { | |
| 111 | 861 struct loop *loop = get_loop (cfun, loop_num); |
| 0 | 862 |
| 863 if (POINTER_TYPE_P (chrec_type (chrec))) | |
| 111 | 864 gcc_assert (ptrofftype_p (chrec_type (new_evol))); |
| 0 | 865 else |
| 866 gcc_assert (chrec_type (chrec) == chrec_type (new_evol)); | |
| 867 | |
| 868 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC | |
| 869 && flow_loop_nested_p (loop, get_chrec_loop (chrec))) | |
| 870 { | |
| 871 tree left = reset_evolution_in_loop (loop_num, CHREC_LEFT (chrec), | |
| 872 new_evol); | |
| 873 tree right = reset_evolution_in_loop (loop_num, CHREC_RIGHT (chrec), | |
| 874 new_evol); | |
| 111 | 875 return build_polynomial_chrec (CHREC_VARIABLE (chrec), left, right); |
| 0 | 876 } |
| 877 | |
| 878 while (TREE_CODE (chrec) == POLYNOMIAL_CHREC | |
| 879 && CHREC_VARIABLE (chrec) == loop_num) | |
| 880 chrec = CHREC_LEFT (chrec); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
881 |
| 0 | 882 return build_polynomial_chrec (loop_num, chrec, new_evol); |
| 883 } | |
| 884 | |
| 885 /* Merges two evolution functions that were found by following two | |
| 886 alternate paths of a conditional expression. */ | |
| 887 | |
| 888 tree | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
889 chrec_merge (tree chrec1, |
| 0 | 890 tree chrec2) |
| 891 { | |
| 892 if (chrec1 == chrec_dont_know | |
| 893 || chrec2 == chrec_dont_know) | |
| 894 return chrec_dont_know; | |
| 895 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
896 if (chrec1 == chrec_known |
| 0 | 897 || chrec2 == chrec_known) |
| 898 return chrec_known; | |
| 899 | |
| 900 if (chrec1 == chrec_not_analyzed_yet) | |
| 901 return chrec2; | |
| 902 if (chrec2 == chrec_not_analyzed_yet) | |
| 903 return chrec1; | |
| 904 | |
| 905 if (eq_evolutions_p (chrec1, chrec2)) | |
| 906 return chrec1; | |
| 907 | |
| 908 return chrec_dont_know; | |
| 909 } | |
| 910 | |
| 911 | |
| 912 | |
| 913 /* Observers. */ | |
| 914 | |
| 915 /* Helper function for is_multivariate_chrec. */ | |
| 916 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
917 static bool |
| 0 | 918 is_multivariate_chrec_rec (const_tree chrec, unsigned int rec_var) |
| 919 { | |
| 920 if (chrec == NULL_TREE) | |
| 921 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
922 |
| 0 | 923 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC) |
| 924 { | |
| 925 if (CHREC_VARIABLE (chrec) != rec_var) | |
| 926 return true; | |
| 927 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
928 return (is_multivariate_chrec_rec (CHREC_LEFT (chrec), rec_var) |
| 0 | 929 || is_multivariate_chrec_rec (CHREC_RIGHT (chrec), rec_var)); |
| 930 } | |
| 931 else | |
| 932 return false; | |
| 933 } | |
| 934 | |
| 935 /* Determine whether the given chrec is multivariate or not. */ | |
| 936 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
937 bool |
| 0 | 938 is_multivariate_chrec (const_tree chrec) |
| 939 { | |
| 940 if (chrec == NULL_TREE) | |
| 941 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
942 |
| 0 | 943 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
944 return (is_multivariate_chrec_rec (CHREC_LEFT (chrec), |
| 0 | 945 CHREC_VARIABLE (chrec)) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
946 || is_multivariate_chrec_rec (CHREC_RIGHT (chrec), |
| 0 | 947 CHREC_VARIABLE (chrec))); |
| 948 else | |
| 949 return false; | |
| 950 } | |
| 951 | |
| 952 /* Determines whether the chrec contains symbolic names or not. */ | |
| 953 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
954 bool |
| 0 | 955 chrec_contains_symbols (const_tree chrec) |
| 956 { | |
| 957 int i, n; | |
| 958 | |
| 959 if (chrec == NULL_TREE) | |
| 960 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
961 |
| 0 | 962 if (TREE_CODE (chrec) == SSA_NAME |
| 111 | 963 || VAR_P (chrec) |
| 0 | 964 || TREE_CODE (chrec) == PARM_DECL |
| 965 || TREE_CODE (chrec) == FUNCTION_DECL | |
| 966 || TREE_CODE (chrec) == LABEL_DECL | |
| 967 || TREE_CODE (chrec) == RESULT_DECL | |
| 968 || TREE_CODE (chrec) == FIELD_DECL) | |
| 969 return true; | |
| 970 | |
| 971 n = TREE_OPERAND_LENGTH (chrec); | |
| 972 for (i = 0; i < n; i++) | |
| 973 if (chrec_contains_symbols (TREE_OPERAND (chrec, i))) | |
| 974 return true; | |
| 975 return false; | |
| 976 } | |
| 977 | |
| 978 /* Determines whether the chrec contains undetermined coefficients. */ | |
| 979 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
980 bool |
| 0 | 981 chrec_contains_undetermined (const_tree chrec) |
| 982 { | |
| 983 int i, n; | |
| 984 | |
| 985 if (chrec == chrec_dont_know) | |
| 986 return true; | |
| 987 | |
| 988 if (chrec == NULL_TREE) | |
| 989 return false; | |
| 990 | |
| 991 n = TREE_OPERAND_LENGTH (chrec); | |
| 992 for (i = 0; i < n; i++) | |
| 993 if (chrec_contains_undetermined (TREE_OPERAND (chrec, i))) | |
| 994 return true; | |
| 995 return false; | |
| 996 } | |
| 997 | |
| 998 /* Determines whether the tree EXPR contains chrecs, and increment | |
| 999 SIZE if it is not a NULL pointer by an estimation of the depth of | |
| 1000 the tree. */ | |
| 1001 | |
| 1002 bool | |
| 1003 tree_contains_chrecs (const_tree expr, int *size) | |
| 1004 { | |
| 1005 int i, n; | |
| 1006 | |
| 1007 if (expr == NULL_TREE) | |
| 1008 return false; | |
| 1009 | |
| 1010 if (size) | |
| 1011 (*size)++; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1012 |
| 0 | 1013 if (tree_is_chrec (expr)) |
| 1014 return true; | |
| 1015 | |
| 1016 n = TREE_OPERAND_LENGTH (expr); | |
| 1017 for (i = 0; i < n; i++) | |
| 1018 if (tree_contains_chrecs (TREE_OPERAND (expr, i), size)) | |
| 1019 return true; | |
| 1020 return false; | |
| 1021 } | |
| 1022 | |
| 1023 /* Recursive helper function. */ | |
| 1024 | |
| 1025 static bool | |
| 1026 evolution_function_is_invariant_rec_p (tree chrec, int loopnum) | |
| 1027 { | |
| 1028 if (evolution_function_is_constant_p (chrec)) | |
| 1029 return true; | |
| 1030 | |
| 1031 if (TREE_CODE (chrec) == SSA_NAME | |
| 1032 && (loopnum == 0 | |
| 111 | 1033 || expr_invariant_in_loop_p (get_loop (cfun, loopnum), chrec))) |
| 0 | 1034 return true; |
| 1035 | |
| 1036 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC) | |
| 1037 { | |
| 1038 if (CHREC_VARIABLE (chrec) == (unsigned) loopnum | |
| 111 | 1039 || flow_loop_nested_p (get_loop (cfun, loopnum), |
| 1040 get_chrec_loop (chrec)) | |
| 0 | 1041 || !evolution_function_is_invariant_rec_p (CHREC_RIGHT (chrec), |
| 1042 loopnum) | |
| 1043 || !evolution_function_is_invariant_rec_p (CHREC_LEFT (chrec), | |
| 1044 loopnum)) | |
| 1045 return false; | |
| 1046 return true; | |
| 1047 } | |
| 1048 | |
| 1049 switch (TREE_OPERAND_LENGTH (chrec)) | |
| 1050 { | |
| 1051 case 2: | |
| 1052 if (!evolution_function_is_invariant_rec_p (TREE_OPERAND (chrec, 1), | |
| 1053 loopnum)) | |
| 1054 return false; | |
| 111 | 1055 /* FALLTHRU */ |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1056 |
| 0 | 1057 case 1: |
| 1058 if (!evolution_function_is_invariant_rec_p (TREE_OPERAND (chrec, 0), | |
| 1059 loopnum)) | |
| 1060 return false; | |
| 1061 return true; | |
| 1062 | |
| 1063 default: | |
| 1064 return false; | |
| 1065 } | |
| 1066 | |
| 1067 return false; | |
| 1068 } | |
| 1069 | |
| 1070 /* Return true if CHREC is invariant in loop LOOPNUM, false otherwise. */ | |
| 1071 | |
| 1072 bool | |
| 1073 evolution_function_is_invariant_p (tree chrec, int loopnum) | |
| 1074 { | |
| 1075 return evolution_function_is_invariant_rec_p (chrec, loopnum); | |
| 1076 } | |
| 1077 | |
| 1078 /* Determine whether the given tree is an affine multivariate | |
| 1079 evolution. */ | |
| 1080 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1081 bool |
| 0 | 1082 evolution_function_is_affine_multivariate_p (const_tree chrec, int loopnum) |
| 1083 { | |
| 1084 if (chrec == NULL_TREE) | |
| 1085 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1086 |
| 0 | 1087 switch (TREE_CODE (chrec)) |
| 1088 { | |
| 1089 case POLYNOMIAL_CHREC: | |
| 1090 if (evolution_function_is_invariant_rec_p (CHREC_LEFT (chrec), loopnum)) | |
| 1091 { | |
| 1092 if (evolution_function_is_invariant_rec_p (CHREC_RIGHT (chrec), loopnum)) | |
| 1093 return true; | |
| 1094 else | |
| 1095 { | |
| 1096 if (TREE_CODE (CHREC_RIGHT (chrec)) == POLYNOMIAL_CHREC | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1097 && CHREC_VARIABLE (CHREC_RIGHT (chrec)) |
| 0 | 1098 != CHREC_VARIABLE (chrec) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1099 && evolution_function_is_affine_multivariate_p |
| 0 | 1100 (CHREC_RIGHT (chrec), loopnum)) |
| 1101 return true; | |
| 1102 else | |
| 1103 return false; | |
| 1104 } | |
| 1105 } | |
| 1106 else | |
| 1107 { | |
| 1108 if (evolution_function_is_invariant_rec_p (CHREC_RIGHT (chrec), loopnum) | |
| 1109 && TREE_CODE (CHREC_LEFT (chrec)) == POLYNOMIAL_CHREC | |
| 1110 && CHREC_VARIABLE (CHREC_LEFT (chrec)) != CHREC_VARIABLE (chrec) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1111 && evolution_function_is_affine_multivariate_p |
| 0 | 1112 (CHREC_LEFT (chrec), loopnum)) |
| 1113 return true; | |
| 1114 else | |
| 1115 return false; | |
| 1116 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1117 |
| 0 | 1118 default: |
| 1119 return false; | |
| 1120 } | |
| 1121 } | |
| 1122 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1123 /* Determine whether the given tree is a function in zero or one |
| 0 | 1124 variables. */ |
| 1125 | |
| 1126 bool | |
| 1127 evolution_function_is_univariate_p (const_tree chrec) | |
| 1128 { | |
| 1129 if (chrec == NULL_TREE) | |
| 1130 return true; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1131 |
| 0 | 1132 switch (TREE_CODE (chrec)) |
| 1133 { | |
| 1134 case POLYNOMIAL_CHREC: | |
| 1135 switch (TREE_CODE (CHREC_LEFT (chrec))) | |
| 1136 { | |
| 1137 case POLYNOMIAL_CHREC: | |
| 1138 if (CHREC_VARIABLE (chrec) != CHREC_VARIABLE (CHREC_LEFT (chrec))) | |
| 1139 return false; | |
| 1140 if (!evolution_function_is_univariate_p (CHREC_LEFT (chrec))) | |
| 1141 return false; | |
| 1142 break; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1143 |
| 0 | 1144 default: |
| 111 | 1145 if (tree_contains_chrecs (CHREC_LEFT (chrec), NULL)) |
| 1146 return false; | |
| 0 | 1147 break; |
| 1148 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1149 |
| 0 | 1150 switch (TREE_CODE (CHREC_RIGHT (chrec))) |
| 1151 { | |
| 1152 case POLYNOMIAL_CHREC: | |
| 1153 if (CHREC_VARIABLE (chrec) != CHREC_VARIABLE (CHREC_RIGHT (chrec))) | |
| 1154 return false; | |
| 1155 if (!evolution_function_is_univariate_p (CHREC_RIGHT (chrec))) | |
| 1156 return false; | |
| 1157 break; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1158 |
| 0 | 1159 default: |
| 111 | 1160 if (tree_contains_chrecs (CHREC_RIGHT (chrec), NULL)) |
| 1161 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1162 break; |
| 0 | 1163 } |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1164 |
| 0 | 1165 default: |
| 1166 return true; | |
| 1167 } | |
| 1168 } | |
| 1169 | |
| 1170 /* Returns the number of variables of CHREC. Example: the call | |
| 1171 nb_vars_in_chrec ({{0, +, 1}_5, +, 2}_6) returns 2. */ | |
| 1172 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1173 unsigned |
| 0 | 1174 nb_vars_in_chrec (tree chrec) |
| 1175 { | |
| 1176 if (chrec == NULL_TREE) | |
| 1177 return 0; | |
| 1178 | |
| 1179 switch (TREE_CODE (chrec)) | |
| 1180 { | |
| 1181 case POLYNOMIAL_CHREC: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1182 return 1 + nb_vars_in_chrec |
| 0 | 1183 (initial_condition_in_loop_num (chrec, CHREC_VARIABLE (chrec))); |
| 1184 | |
| 1185 default: | |
| 1186 return 0; | |
| 1187 } | |
| 1188 } | |
| 1189 | |
| 1190 /* Converts BASE and STEP of affine scev to TYPE. LOOP is the loop whose iv | |
| 1191 the scev corresponds to. AT_STMT is the statement at that the scev is | |
| 111 | 1192 evaluated. USE_OVERFLOW_SEMANTICS is true if this function should assume |
| 1193 that the rules for overflow of the given language apply (e.g., that signed | |
| 1194 arithmetics in C does not overflow) -- i.e., to use them to avoid | |
| 1195 unnecessary tests, but also to enforce that the result follows them. | |
| 1196 FROM is the source variable converted if it's not NULL. Returns true if | |
| 1197 the conversion succeeded, false otherwise. */ | |
| 0 | 1198 |
| 1199 bool | |
| 1200 convert_affine_scev (struct loop *loop, tree type, | |
| 111 | 1201 tree *base, tree *step, gimple *at_stmt, |
| 1202 bool use_overflow_semantics, tree from) | |
| 0 | 1203 { |
| 1204 tree ct = TREE_TYPE (*step); | |
| 1205 bool enforce_overflow_semantics; | |
| 1206 bool must_check_src_overflow, must_check_rslt_overflow; | |
| 1207 tree new_base, new_step; | |
| 1208 tree step_type = POINTER_TYPE_P (type) ? sizetype : type; | |
| 1209 | |
| 1210 /* In general, | |
| 1211 (TYPE) (BASE + STEP * i) = (TYPE) BASE + (TYPE -- sign extend) STEP * i, | |
| 1212 but we must check some assumptions. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1213 |
| 0 | 1214 1) If [BASE, +, STEP] wraps, the equation is not valid when precision |
| 1215 of CT is smaller than the precision of TYPE. For example, when we | |
| 1216 cast unsigned char [254, +, 1] to unsigned, the values on left side | |
| 1217 are 254, 255, 0, 1, ..., but those on the right side are | |
| 1218 254, 255, 256, 257, ... | |
| 1219 2) In case that we must also preserve the fact that signed ivs do not | |
| 1220 overflow, we must additionally check that the new iv does not wrap. | |
| 1221 For example, unsigned char [125, +, 1] casted to signed char could | |
| 1222 become a wrapping variable with values 125, 126, 127, -128, -127, ..., | |
| 1223 which would confuse optimizers that assume that this does not | |
| 1224 happen. */ | |
| 1225 must_check_src_overflow = TYPE_PRECISION (ct) < TYPE_PRECISION (type); | |
| 1226 | |
| 1227 enforce_overflow_semantics = (use_overflow_semantics | |
| 1228 && nowrap_type_p (type)); | |
| 1229 if (enforce_overflow_semantics) | |
| 1230 { | |
| 1231 /* We can avoid checking whether the result overflows in the following | |
| 1232 cases: | |
| 1233 | |
| 1234 -- must_check_src_overflow is true, and the range of TYPE is superset | |
| 1235 of the range of CT -- i.e., in all cases except if CT signed and | |
| 1236 TYPE unsigned. | |
| 1237 -- both CT and TYPE have the same precision and signedness, and we | |
| 1238 verify instead that the source does not overflow (this may be | |
| 1239 easier than verifying it for the result, as we may use the | |
| 1240 information about the semantics of overflow in CT). */ | |
| 1241 if (must_check_src_overflow) | |
| 1242 { | |
| 1243 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (ct)) | |
| 1244 must_check_rslt_overflow = true; | |
| 1245 else | |
| 1246 must_check_rslt_overflow = false; | |
| 1247 } | |
| 1248 else if (TYPE_UNSIGNED (ct) == TYPE_UNSIGNED (type) | |
| 1249 && TYPE_PRECISION (ct) == TYPE_PRECISION (type)) | |
| 1250 { | |
| 1251 must_check_rslt_overflow = false; | |
| 1252 must_check_src_overflow = true; | |
| 1253 } | |
| 1254 else | |
| 1255 must_check_rslt_overflow = true; | |
| 1256 } | |
| 1257 else | |
| 1258 must_check_rslt_overflow = false; | |
| 1259 | |
| 1260 if (must_check_src_overflow | |
| 111 | 1261 && scev_probably_wraps_p (from, *base, *step, at_stmt, loop, |
| 0 | 1262 use_overflow_semantics)) |
| 1263 return false; | |
| 1264 | |
| 111 | 1265 new_base = chrec_convert (type, *base, at_stmt, use_overflow_semantics); |
| 0 | 1266 /* The step must be sign extended, regardless of the signedness |
| 1267 of CT and TYPE. This only needs to be handled specially when | |
| 1268 CT is unsigned -- to avoid e.g. unsigned char [100, +, 255] | |
| 1269 (with values 100, 99, 98, ...) from becoming signed or unsigned | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1270 [100, +, 255] with values 100, 355, ...; the sign-extension is |
| 0 | 1271 performed by default when CT is signed. */ |
| 1272 new_step = *step; | |
| 1273 if (TYPE_PRECISION (step_type) > TYPE_PRECISION (ct) && TYPE_UNSIGNED (ct)) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1274 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1275 tree signed_ct = build_nonstandard_integer_type (TYPE_PRECISION (ct), 0); |
| 111 | 1276 new_step = chrec_convert (signed_ct, new_step, at_stmt, |
| 1277 use_overflow_semantics); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1278 } |
| 111 | 1279 new_step = chrec_convert (step_type, new_step, at_stmt, |
| 1280 use_overflow_semantics); | |
| 0 | 1281 |
| 1282 if (automatically_generated_chrec_p (new_base) | |
| 1283 || automatically_generated_chrec_p (new_step)) | |
| 1284 return false; | |
| 1285 | |
| 1286 if (must_check_rslt_overflow | |
| 1287 /* Note that in this case we cannot use the fact that signed variables | |
| 1288 do not overflow, as this is what we are verifying for the new iv. */ | |
| 111 | 1289 && scev_probably_wraps_p (NULL_TREE, new_base, new_step, |
| 1290 at_stmt, loop, false)) | |
| 0 | 1291 return false; |
| 1292 | |
| 1293 *base = new_base; | |
| 1294 *step = new_step; | |
| 1295 return true; | |
| 1296 } | |
| 1297 | |
| 1298 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1299 /* Convert CHREC for the right hand side of a CHREC. |
| 0 | 1300 The increment for a pointer type is always sizetype. */ |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1301 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1302 tree |
| 111 | 1303 chrec_convert_rhs (tree type, tree chrec, gimple *at_stmt) |
| 0 | 1304 { |
| 1305 if (POINTER_TYPE_P (type)) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1306 type = sizetype; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1307 |
| 0 | 1308 return chrec_convert (type, chrec, at_stmt); |
| 1309 } | |
| 1310 | |
| 1311 /* Convert CHREC to TYPE. When the analyzer knows the context in | |
| 1312 which the CHREC is built, it sets AT_STMT to the statement that | |
| 1313 contains the definition of the analyzed variable, otherwise the | |
| 1314 conversion is less accurate: the information is used for | |
| 1315 determining a more accurate estimation of the number of iterations. | |
| 1316 By default AT_STMT could be safely set to NULL_TREE. | |
| 1317 | |
| 111 | 1318 USE_OVERFLOW_SEMANTICS is true if this function should assume that |
| 1319 the rules for overflow of the given language apply (e.g., that signed | |
| 1320 arithmetics in C does not overflow) -- i.e., to use them to avoid | |
| 1321 unnecessary tests, but also to enforce that the result follows them. | |
| 1322 | |
| 1323 FROM is the source variable converted if it's not NULL. */ | |
| 1324 | |
| 1325 static tree | |
| 1326 chrec_convert_1 (tree type, tree chrec, gimple *at_stmt, | |
| 1327 bool use_overflow_semantics, tree from) | |
| 1328 { | |
| 1329 tree ct, res; | |
| 1330 tree base, step; | |
| 1331 struct loop *loop; | |
| 1332 | |
| 1333 if (automatically_generated_chrec_p (chrec)) | |
| 1334 return chrec; | |
| 1335 | |
| 1336 ct = chrec_type (chrec); | |
| 1337 if (useless_type_conversion_p (type, ct)) | |
| 1338 return chrec; | |
| 1339 | |
| 1340 if (!evolution_function_is_affine_p (chrec)) | |
| 1341 goto keep_cast; | |
| 1342 | |
| 1343 loop = get_chrec_loop (chrec); | |
| 1344 base = CHREC_LEFT (chrec); | |
| 1345 step = CHREC_RIGHT (chrec); | |
| 1346 | |
| 1347 if (convert_affine_scev (loop, type, &base, &step, at_stmt, | |
| 1348 use_overflow_semantics, from)) | |
| 1349 return build_polynomial_chrec (loop->num, base, step); | |
| 1350 | |
| 1351 /* If we cannot propagate the cast inside the chrec, just keep the cast. */ | |
| 1352 keep_cast: | |
| 1353 /* Fold will not canonicalize (long)(i - 1) to (long)i - 1 because that | |
| 1354 may be more expensive. We do want to perform this optimization here | |
| 1355 though for canonicalization reasons. */ | |
| 1356 if (use_overflow_semantics | |
| 1357 && (TREE_CODE (chrec) == PLUS_EXPR | |
| 1358 || TREE_CODE (chrec) == MINUS_EXPR) | |
| 1359 && TREE_CODE (type) == INTEGER_TYPE | |
| 1360 && TREE_CODE (ct) == INTEGER_TYPE | |
| 1361 && TYPE_PRECISION (type) > TYPE_PRECISION (ct) | |
| 1362 && TYPE_OVERFLOW_UNDEFINED (ct)) | |
| 1363 res = fold_build2 (TREE_CODE (chrec), type, | |
| 1364 fold_convert (type, TREE_OPERAND (chrec, 0)), | |
| 1365 fold_convert (type, TREE_OPERAND (chrec, 1))); | |
| 1366 /* Similar perform the trick that (signed char)((int)x + 2) can be | |
| 1367 narrowed to (signed char)((unsigned char)x + 2). */ | |
| 1368 else if (use_overflow_semantics | |
| 1369 && TREE_CODE (chrec) == POLYNOMIAL_CHREC | |
| 1370 && TREE_CODE (ct) == INTEGER_TYPE | |
| 1371 && TREE_CODE (type) == INTEGER_TYPE | |
| 1372 && TYPE_OVERFLOW_UNDEFINED (type) | |
| 1373 && TYPE_PRECISION (type) < TYPE_PRECISION (ct)) | |
| 1374 { | |
| 1375 tree utype = unsigned_type_for (type); | |
| 1376 res = build_polynomial_chrec (CHREC_VARIABLE (chrec), | |
| 1377 fold_convert (utype, | |
| 1378 CHREC_LEFT (chrec)), | |
| 1379 fold_convert (utype, | |
| 1380 CHREC_RIGHT (chrec))); | |
| 1381 res = chrec_convert_1 (type, res, at_stmt, use_overflow_semantics, from); | |
| 1382 } | |
| 1383 else | |
| 1384 res = fold_convert (type, chrec); | |
| 1385 | |
| 1386 /* Don't propagate overflows. */ | |
| 1387 if (CONSTANT_CLASS_P (res)) | |
| 1388 TREE_OVERFLOW (res) = 0; | |
| 1389 | |
| 1390 /* But reject constants that don't fit in their type after conversion. | |
| 1391 This can happen if TYPE_MIN_VALUE or TYPE_MAX_VALUE are not the | |
| 1392 natural values associated with TYPE_PRECISION and TYPE_UNSIGNED, | |
| 1393 and can cause problems later when computing niters of loops. Note | |
| 1394 that we don't do the check before converting because we don't want | |
| 1395 to reject conversions of negative chrecs to unsigned types. */ | |
| 1396 if (TREE_CODE (res) == INTEGER_CST | |
| 1397 && TREE_CODE (type) == INTEGER_TYPE | |
| 1398 && !int_fits_type_p (res, type)) | |
| 1399 res = chrec_dont_know; | |
| 1400 | |
| 1401 return res; | |
| 1402 } | |
| 1403 | |
| 1404 /* Convert CHREC to TYPE. When the analyzer knows the context in | |
| 1405 which the CHREC is built, it sets AT_STMT to the statement that | |
| 1406 contains the definition of the analyzed variable, otherwise the | |
| 1407 conversion is less accurate: the information is used for | |
| 1408 determining a more accurate estimation of the number of iterations. | |
| 1409 By default AT_STMT could be safely set to NULL_TREE. | |
| 1410 | |
| 0 | 1411 The following rule is always true: TREE_TYPE (chrec) == |
| 1412 TREE_TYPE (CHREC_LEFT (chrec)) == TREE_TYPE (CHREC_RIGHT (chrec)). | |
| 1413 An example of what could happen when adding two chrecs and the type | |
| 1414 of the CHREC_RIGHT is different than CHREC_LEFT is: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1415 |
| 0 | 1416 {(uint) 0, +, (uchar) 10} + |
| 1417 {(uint) 0, +, (uchar) 250} | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1418 |
| 0 | 1419 that would produce a wrong result if CHREC_RIGHT is not (uint): |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1420 |
| 0 | 1421 {(uint) 0, +, (uchar) 4} |
| 1422 | |
| 1423 instead of | |
| 1424 | |
| 1425 {(uint) 0, +, (uint) 260} | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1426 |
| 0 | 1427 USE_OVERFLOW_SEMANTICS is true if this function should assume that |
| 1428 the rules for overflow of the given language apply (e.g., that signed | |
| 111 | 1429 arithmetics in C does not overflow) -- i.e., to use them to avoid |
| 1430 unnecessary tests, but also to enforce that the result follows them. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1431 |
| 111 | 1432 FROM is the source variable converted if it's not NULL. */ |
| 0 | 1433 |
| 111 | 1434 tree |
| 1435 chrec_convert (tree type, tree chrec, gimple *at_stmt, | |
| 1436 bool use_overflow_semantics, tree from) | |
| 1437 { | |
| 1438 return chrec_convert_1 (type, chrec, at_stmt, use_overflow_semantics, from); | |
| 0 | 1439 } |
| 1440 | |
| 1441 /* Convert CHREC to TYPE, without regard to signed overflows. Returns the new | |
| 1442 chrec if something else than what chrec_convert would do happens, NULL_TREE | |
| 111 | 1443 otherwise. This function set TRUE to variable pointed by FOLD_CONVERSIONS |
| 1444 if the result chrec may overflow. */ | |
| 0 | 1445 |
| 1446 tree | |
| 111 | 1447 chrec_convert_aggressive (tree type, tree chrec, bool *fold_conversions) |
| 0 | 1448 { |
| 1449 tree inner_type, left, right, lc, rc, rtype; | |
| 1450 | |
| 111 | 1451 gcc_assert (fold_conversions != NULL); |
| 1452 | |
| 0 | 1453 if (automatically_generated_chrec_p (chrec) |
| 1454 || TREE_CODE (chrec) != POLYNOMIAL_CHREC) | |
| 1455 return NULL_TREE; | |
| 1456 | |
| 1457 inner_type = TREE_TYPE (chrec); | |
| 1458 if (TYPE_PRECISION (type) > TYPE_PRECISION (inner_type)) | |
| 1459 return NULL_TREE; | |
| 1460 | |
| 111 | 1461 if (useless_type_conversion_p (type, inner_type)) |
| 1462 return NULL_TREE; | |
| 1463 | |
| 1464 if (!*fold_conversions && evolution_function_is_affine_p (chrec)) | |
| 1465 { | |
| 1466 tree base, step; | |
| 1467 struct loop *loop; | |
| 1468 | |
| 1469 loop = get_chrec_loop (chrec); | |
| 1470 base = CHREC_LEFT (chrec); | |
| 1471 step = CHREC_RIGHT (chrec); | |
| 1472 if (convert_affine_scev (loop, type, &base, &step, NULL, true)) | |
| 1473 return build_polynomial_chrec (loop->num, base, step); | |
| 1474 } | |
| 0 | 1475 rtype = POINTER_TYPE_P (type) ? sizetype : type; |
| 1476 | |
| 1477 left = CHREC_LEFT (chrec); | |
| 1478 right = CHREC_RIGHT (chrec); | |
| 111 | 1479 lc = chrec_convert_aggressive (type, left, fold_conversions); |
| 0 | 1480 if (!lc) |
| 1481 lc = chrec_convert (type, left, NULL); | |
| 111 | 1482 rc = chrec_convert_aggressive (rtype, right, fold_conversions); |
| 0 | 1483 if (!rc) |
| 1484 rc = chrec_convert (rtype, right, NULL); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1485 |
| 111 | 1486 *fold_conversions = true; |
| 1487 | |
| 0 | 1488 return build_polynomial_chrec (CHREC_VARIABLE (chrec), lc, rc); |
| 1489 } | |
| 1490 | |
| 1491 /* Returns true when CHREC0 == CHREC1. */ | |
| 1492 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1493 bool |
| 0 | 1494 eq_evolutions_p (const_tree chrec0, const_tree chrec1) |
| 1495 { | |
| 1496 if (chrec0 == NULL_TREE | |
| 1497 || chrec1 == NULL_TREE | |
| 1498 || TREE_CODE (chrec0) != TREE_CODE (chrec1)) | |
| 1499 return false; | |
| 1500 | |
| 1501 if (chrec0 == chrec1) | |
| 1502 return true; | |
| 1503 | |
| 111 | 1504 if (! types_compatible_p (TREE_TYPE (chrec0), TREE_TYPE (chrec1))) |
| 1505 return false; | |
| 1506 | |
| 0 | 1507 switch (TREE_CODE (chrec0)) |
| 1508 { | |
| 1509 case POLYNOMIAL_CHREC: | |
| 1510 return (CHREC_VARIABLE (chrec0) == CHREC_VARIABLE (chrec1) | |
| 1511 && eq_evolutions_p (CHREC_LEFT (chrec0), CHREC_LEFT (chrec1)) | |
| 1512 && eq_evolutions_p (CHREC_RIGHT (chrec0), CHREC_RIGHT (chrec1))); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1513 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1514 case PLUS_EXPR: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1515 case MULT_EXPR: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1516 case MINUS_EXPR: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1517 case POINTER_PLUS_EXPR: |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1518 return eq_evolutions_p (TREE_OPERAND (chrec0, 0), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1519 TREE_OPERAND (chrec1, 0)) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1520 && eq_evolutions_p (TREE_OPERAND (chrec0, 1), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1521 TREE_OPERAND (chrec1, 1)); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1522 |
| 111 | 1523 CASE_CONVERT: |
| 1524 return eq_evolutions_p (TREE_OPERAND (chrec0, 0), | |
| 1525 TREE_OPERAND (chrec1, 0)); | |
| 1526 | |
| 0 | 1527 default: |
| 111 | 1528 return operand_equal_p (chrec0, chrec1, 0); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1529 } |
| 0 | 1530 } |
| 1531 | |
| 1532 /* Returns EV_GROWS if CHREC grows (assuming that it does not overflow), | |
| 1533 EV_DECREASES if it decreases, and EV_UNKNOWN if we cannot determine | |
| 1534 which of these cases happens. */ | |
| 1535 | |
| 1536 enum ev_direction | |
| 1537 scev_direction (const_tree chrec) | |
| 1538 { | |
| 1539 const_tree step; | |
| 1540 | |
| 1541 if (!evolution_function_is_affine_p (chrec)) | |
| 1542 return EV_DIR_UNKNOWN; | |
| 1543 | |
| 1544 step = CHREC_RIGHT (chrec); | |
| 1545 if (TREE_CODE (step) != INTEGER_CST) | |
| 1546 return EV_DIR_UNKNOWN; | |
| 1547 | |
| 1548 if (tree_int_cst_sign_bit (step)) | |
| 1549 return EV_DIR_DECREASES; | |
| 1550 else | |
| 1551 return EV_DIR_GROWS; | |
| 1552 } | |
| 1553 | |
| 1554 /* Iterates over all the components of SCEV, and calls CBCK. */ | |
| 1555 | |
| 1556 void | |
| 1557 for_each_scev_op (tree *scev, bool (*cbck) (tree *, void *), void *data) | |
| 1558 { | |
| 1559 switch (TREE_CODE_LENGTH (TREE_CODE (*scev))) | |
| 1560 { | |
| 1561 case 3: | |
| 1562 for_each_scev_op (&TREE_OPERAND (*scev, 2), cbck, data); | |
| 111 | 1563 /* FALLTHRU */ |
| 0 | 1564 |
| 1565 case 2: | |
| 1566 for_each_scev_op (&TREE_OPERAND (*scev, 1), cbck, data); | |
| 111 | 1567 /* FALLTHRU */ |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1568 |
| 0 | 1569 case 1: |
| 1570 for_each_scev_op (&TREE_OPERAND (*scev, 0), cbck, data); | |
| 111 | 1571 /* FALLTHRU */ |
| 0 | 1572 |
| 1573 default: | |
| 1574 cbck (scev, data); | |
| 1575 break; | |
| 1576 } | |
| 1577 } | |
| 1578 | |
| 1579 /* Returns true when the operation can be part of a linear | |
| 1580 expression. */ | |
| 1581 | |
| 1582 static inline bool | |
| 1583 operator_is_linear (tree scev) | |
| 1584 { | |
| 1585 switch (TREE_CODE (scev)) | |
| 1586 { | |
| 1587 case INTEGER_CST: | |
| 1588 case POLYNOMIAL_CHREC: | |
| 1589 case PLUS_EXPR: | |
| 1590 case POINTER_PLUS_EXPR: | |
| 1591 case MULT_EXPR: | |
| 1592 case MINUS_EXPR: | |
| 1593 case NEGATE_EXPR: | |
| 1594 case SSA_NAME: | |
| 1595 case NON_LVALUE_EXPR: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1596 case BIT_NOT_EXPR: |
| 0 | 1597 CASE_CONVERT: |
| 1598 return true; | |
| 1599 | |
| 1600 default: | |
| 1601 return false; | |
| 1602 } | |
| 1603 } | |
| 1604 | |
| 1605 /* Return true when SCEV is a linear expression. Linear expressions | |
| 1606 can contain additions, substractions and multiplications. | |
| 1607 Multiplications are restricted to constant scaling: "cst * x". */ | |
| 1608 | |
| 1609 bool | |
| 1610 scev_is_linear_expression (tree scev) | |
| 1611 { | |
| 111 | 1612 if (evolution_function_is_constant_p (scev)) |
| 1613 return true; | |
| 1614 | |
| 0 | 1615 if (scev == NULL |
| 1616 || !operator_is_linear (scev)) | |
| 1617 return false; | |
| 1618 | |
| 1619 if (TREE_CODE (scev) == MULT_EXPR) | |
| 1620 return !(tree_contains_chrecs (TREE_OPERAND (scev, 0), NULL) | |
| 1621 && tree_contains_chrecs (TREE_OPERAND (scev, 1), NULL)); | |
| 1622 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1623 if (TREE_CODE (scev) == POLYNOMIAL_CHREC |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1624 && !evolution_function_is_affine_multivariate_p (scev, CHREC_VARIABLE (scev))) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1625 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1626 |
| 0 | 1627 switch (TREE_CODE_LENGTH (TREE_CODE (scev))) |
| 1628 { | |
| 1629 case 3: | |
| 1630 return scev_is_linear_expression (TREE_OPERAND (scev, 0)) | |
| 1631 && scev_is_linear_expression (TREE_OPERAND (scev, 1)) | |
| 1632 && scev_is_linear_expression (TREE_OPERAND (scev, 2)); | |
| 1633 | |
| 1634 case 2: | |
| 1635 return scev_is_linear_expression (TREE_OPERAND (scev, 0)) | |
| 1636 && scev_is_linear_expression (TREE_OPERAND (scev, 1)); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1637 |
| 0 | 1638 case 1: |
| 1639 return scev_is_linear_expression (TREE_OPERAND (scev, 0)); | |
| 1640 | |
| 1641 case 0: | |
| 1642 return true; | |
| 1643 | |
| 1644 default: | |
| 1645 return false; | |
| 1646 } | |
| 1647 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1648 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1649 /* Determines whether the expression CHREC contains only interger consts |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1650 in the right parts. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1651 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1652 bool |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1653 evolution_function_right_is_integer_cst (const_tree chrec) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1654 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1655 if (chrec == NULL_TREE) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1656 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1657 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1658 switch (TREE_CODE (chrec)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1659 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1660 case INTEGER_CST: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1661 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1662 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1663 case POLYNOMIAL_CHREC: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1664 return TREE_CODE (CHREC_RIGHT (chrec)) == INTEGER_CST |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1665 && (TREE_CODE (CHREC_LEFT (chrec)) != POLYNOMIAL_CHREC |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1666 || evolution_function_right_is_integer_cst (CHREC_LEFT (chrec))); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1667 |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1668 CASE_CONVERT: |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1669 return evolution_function_right_is_integer_cst (TREE_OPERAND (chrec, 0)); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1670 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1671 default: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1672 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1673 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1674 } |