Mercurial > hg > CbC > CbC_gcc
annotate gcc/tree-complex.c @ 63:b7f97abdc517 gcc-4.6-20100522
update gcc from gcc-4.5.0 to gcc-4.6
| author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Mon, 24 May 2010 12:47:05 +0900 |
| parents | 77e2b8dfacca |
| children | f6334be47118 |
| rev | line source |
|---|---|
| 0 | 1 /* Lower complex number operations to scalar operations. |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
3 Free Software Foundation, Inc. |
| 0 | 4 |
| 5 This file is part of GCC. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
6 |
| 0 | 7 GCC is free software; you can redistribute it and/or modify it |
| 8 under the terms of the GNU General Public License as published by the | |
| 9 Free Software Foundation; either version 3, or (at your option) any | |
| 10 later version. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
11 |
| 0 | 12 GCC is distributed in the hope that it will be useful, but WITHOUT |
| 13 ANY 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. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
16 |
| 0 | 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 #include "config.h" | |
| 22 #include "system.h" | |
| 23 #include "coretypes.h" | |
| 24 #include "tm.h" | |
| 25 #include "tree.h" | |
| 26 #include "flags.h" | |
| 27 #include "tree-flow.h" | |
| 28 #include "gimple.h" | |
| 29 #include "tree-iterator.h" | |
| 30 #include "tree-pass.h" | |
| 31 #include "tree-ssa-propagate.h" | |
| 32 #include "diagnostic.h" | |
| 33 | |
| 34 | |
| 35 /* For each complex ssa name, a lattice value. We're interested in finding | |
| 36 out whether a complex number is degenerate in some way, having only real | |
| 37 or only complex parts. */ | |
| 38 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
39 enum |
| 0 | 40 { |
| 41 UNINITIALIZED = 0, | |
| 42 ONLY_REAL = 1, | |
| 43 ONLY_IMAG = 2, | |
| 44 VARYING = 3 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
45 }; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
46 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
47 /* The type complex_lattice_t holds combinations of the above |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
48 constants. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
49 typedef int complex_lattice_t; |
| 0 | 50 |
| 51 #define PAIR(a, b) ((a) << 2 | (b)) | |
| 52 | |
| 53 DEF_VEC_I(complex_lattice_t); | |
| 54 DEF_VEC_ALLOC_I(complex_lattice_t, heap); | |
| 55 | |
| 56 static VEC(complex_lattice_t, heap) *complex_lattice_values; | |
| 57 | |
| 58 /* For each complex variable, a pair of variables for the components exists in | |
| 59 the hashtable. */ | |
| 60 static htab_t complex_variable_components; | |
| 61 | |
| 62 /* For each complex SSA_NAME, a pair of ssa names for the components. */ | |
| 63 static VEC(tree, heap) *complex_ssa_name_components; | |
| 64 | |
| 65 /* Lookup UID in the complex_variable_components hashtable and return the | |
| 66 associated tree. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
67 static tree |
| 0 | 68 cvc_lookup (unsigned int uid) |
| 69 { | |
| 70 struct int_tree_map *h, in; | |
| 71 in.uid = uid; | |
| 72 h = (struct int_tree_map *) htab_find_with_hash (complex_variable_components, &in, uid); | |
| 73 return h ? h->to : NULL; | |
| 74 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
75 |
| 0 | 76 /* Insert the pair UID, TO into the complex_variable_components hashtable. */ |
| 77 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
78 static void |
| 0 | 79 cvc_insert (unsigned int uid, tree to) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
80 { |
| 0 | 81 struct int_tree_map *h; |
| 82 void **loc; | |
| 83 | |
| 84 h = XNEW (struct int_tree_map); | |
| 85 h->uid = uid; | |
| 86 h->to = to; | |
| 87 loc = htab_find_slot_with_hash (complex_variable_components, h, | |
| 88 uid, INSERT); | |
| 89 *(struct int_tree_map **) loc = h; | |
| 90 } | |
| 91 | |
| 92 /* Return true if T is not a zero constant. In the case of real values, | |
| 93 we're only interested in +0.0. */ | |
| 94 | |
| 95 static int | |
| 96 some_nonzerop (tree t) | |
| 97 { | |
| 98 int zerop = false; | |
| 99 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
100 /* Operations with real or imaginary part of a complex number zero |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
101 cannot be treated the same as operations with a real or imaginary |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
102 operand if we care about the signs of zeros in the result. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
103 if (TREE_CODE (t) == REAL_CST && !flag_signed_zeros) |
| 0 | 104 zerop = REAL_VALUES_IDENTICAL (TREE_REAL_CST (t), dconst0); |
| 105 else if (TREE_CODE (t) == FIXED_CST) | |
| 106 zerop = fixed_zerop (t); | |
| 107 else if (TREE_CODE (t) == INTEGER_CST) | |
| 108 zerop = integer_zerop (t); | |
| 109 | |
| 110 return !zerop; | |
| 111 } | |
| 112 | |
| 113 | |
| 114 /* Compute a lattice value from the components of a complex type REAL | |
| 115 and IMAG. */ | |
| 116 | |
| 117 static complex_lattice_t | |
| 118 find_lattice_value_parts (tree real, tree imag) | |
| 119 { | |
| 120 int r, i; | |
| 121 complex_lattice_t ret; | |
| 122 | |
| 123 r = some_nonzerop (real); | |
| 124 i = some_nonzerop (imag); | |
| 125 ret = r * ONLY_REAL + i * ONLY_IMAG; | |
| 126 | |
| 127 /* ??? On occasion we could do better than mapping 0+0i to real, but we | |
| 128 certainly don't want to leave it UNINITIALIZED, which eventually gets | |
| 129 mapped to VARYING. */ | |
| 130 if (ret == UNINITIALIZED) | |
| 131 ret = ONLY_REAL; | |
| 132 | |
| 133 return ret; | |
| 134 } | |
| 135 | |
| 136 | |
| 137 /* Compute a lattice value from gimple_val T. */ | |
| 138 | |
| 139 static complex_lattice_t | |
| 140 find_lattice_value (tree t) | |
| 141 { | |
| 142 tree real, imag; | |
| 143 | |
| 144 switch (TREE_CODE (t)) | |
| 145 { | |
| 146 case SSA_NAME: | |
| 147 return VEC_index (complex_lattice_t, complex_lattice_values, | |
| 148 SSA_NAME_VERSION (t)); | |
| 149 | |
| 150 case COMPLEX_CST: | |
| 151 real = TREE_REALPART (t); | |
| 152 imag = TREE_IMAGPART (t); | |
| 153 break; | |
| 154 | |
| 155 default: | |
| 156 gcc_unreachable (); | |
| 157 } | |
| 158 | |
| 159 return find_lattice_value_parts (real, imag); | |
| 160 } | |
| 161 | |
| 162 /* Determine if LHS is something for which we're interested in seeing | |
| 163 simulation results. */ | |
| 164 | |
| 165 static bool | |
| 166 is_complex_reg (tree lhs) | |
| 167 { | |
| 168 return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs); | |
| 169 } | |
| 170 | |
| 171 /* Mark the incoming parameters to the function as VARYING. */ | |
| 172 | |
| 173 static void | |
| 174 init_parameter_lattice_values (void) | |
| 175 { | |
| 176 tree parm, ssa_name; | |
| 177 | |
| 178 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm)) | |
| 179 if (is_complex_reg (parm) | |
| 180 && var_ann (parm) != NULL | |
| 181 && (ssa_name = gimple_default_def (cfun, parm)) != NULL_TREE) | |
| 182 VEC_replace (complex_lattice_t, complex_lattice_values, | |
| 183 SSA_NAME_VERSION (ssa_name), VARYING); | |
| 184 } | |
| 185 | |
| 186 /* Initialize simulation state for each statement. Return false if we | |
| 187 found no statements we want to simulate, and thus there's nothing | |
| 188 for the entire pass to do. */ | |
| 189 | |
| 190 static bool | |
| 191 init_dont_simulate_again (void) | |
| 192 { | |
| 193 basic_block bb; | |
| 194 gimple_stmt_iterator gsi; | |
| 195 gimple phi; | |
| 196 bool saw_a_complex_op = false; | |
| 197 | |
| 198 FOR_EACH_BB (bb) | |
| 199 { | |
| 200 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 201 { | |
| 202 phi = gsi_stmt (gsi); | |
| 203 prop_set_simulate_again (phi, | |
| 204 is_complex_reg (gimple_phi_result (phi))); | |
| 205 } | |
| 206 | |
| 207 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 208 { | |
| 209 gimple stmt; | |
| 210 tree op0, op1; | |
| 211 bool sim_again_p; | |
| 212 | |
| 213 stmt = gsi_stmt (gsi); | |
| 214 op0 = op1 = NULL_TREE; | |
| 215 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
216 /* Most control-altering statements must be initially |
| 0 | 217 simulated, else we won't cover the entire cfg. */ |
| 218 sim_again_p = stmt_ends_bb_p (stmt); | |
| 219 | |
| 220 switch (gimple_code (stmt)) | |
| 221 { | |
| 222 case GIMPLE_CALL: | |
| 223 if (gimple_call_lhs (stmt)) | |
| 224 sim_again_p = is_complex_reg (gimple_call_lhs (stmt)); | |
| 225 break; | |
| 226 | |
| 227 case GIMPLE_ASSIGN: | |
| 228 sim_again_p = is_complex_reg (gimple_assign_lhs (stmt)); | |
| 229 if (gimple_assign_rhs_code (stmt) == REALPART_EXPR | |
| 230 || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR) | |
| 231 op0 = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0); | |
| 232 else | |
| 233 op0 = gimple_assign_rhs1 (stmt); | |
| 234 if (gimple_num_ops (stmt) > 2) | |
| 235 op1 = gimple_assign_rhs2 (stmt); | |
| 236 break; | |
| 237 | |
| 238 case GIMPLE_COND: | |
| 239 op0 = gimple_cond_lhs (stmt); | |
| 240 op1 = gimple_cond_rhs (stmt); | |
| 241 break; | |
| 242 | |
| 243 default: | |
| 244 break; | |
| 245 } | |
| 246 | |
| 247 if (op0 || op1) | |
| 248 switch (gimple_expr_code (stmt)) | |
| 249 { | |
| 250 case EQ_EXPR: | |
| 251 case NE_EXPR: | |
| 252 case PLUS_EXPR: | |
| 253 case MINUS_EXPR: | |
| 254 case MULT_EXPR: | |
| 255 case TRUNC_DIV_EXPR: | |
| 256 case CEIL_DIV_EXPR: | |
| 257 case FLOOR_DIV_EXPR: | |
| 258 case ROUND_DIV_EXPR: | |
| 259 case RDIV_EXPR: | |
| 260 if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE | |
| 261 || TREE_CODE (TREE_TYPE (op1)) == COMPLEX_TYPE) | |
| 262 saw_a_complex_op = true; | |
| 263 break; | |
| 264 | |
| 265 case NEGATE_EXPR: | |
| 266 case CONJ_EXPR: | |
| 267 if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE) | |
| 268 saw_a_complex_op = true; | |
| 269 break; | |
| 270 | |
| 271 case REALPART_EXPR: | |
| 272 case IMAGPART_EXPR: | |
| 273 /* The total store transformation performed during | |
| 274 gimplification creates such uninitialized loads | |
| 275 and we need to lower the statement to be able | |
| 276 to fix things up. */ | |
| 277 if (TREE_CODE (op0) == SSA_NAME | |
| 278 && ssa_undefined_value_p (op0)) | |
| 279 saw_a_complex_op = true; | |
| 280 break; | |
| 281 | |
| 282 default: | |
| 283 break; | |
| 284 } | |
| 285 | |
| 286 prop_set_simulate_again (stmt, sim_again_p); | |
| 287 } | |
| 288 } | |
| 289 | |
| 290 return saw_a_complex_op; | |
| 291 } | |
| 292 | |
| 293 | |
| 294 /* Evaluate statement STMT against the complex lattice defined above. */ | |
| 295 | |
| 296 static enum ssa_prop_result | |
| 297 complex_visit_stmt (gimple stmt, edge *taken_edge_p ATTRIBUTE_UNUSED, | |
| 298 tree *result_p) | |
| 299 { | |
| 300 complex_lattice_t new_l, old_l, op1_l, op2_l; | |
| 301 unsigned int ver; | |
| 302 tree lhs; | |
| 303 | |
| 304 lhs = gimple_get_lhs (stmt); | |
| 305 /* Skip anything but GIMPLE_ASSIGN and GIMPLE_CALL with a lhs. */ | |
| 306 if (!lhs) | |
| 307 return SSA_PROP_VARYING; | |
| 308 | |
| 309 /* These conditions should be satisfied due to the initial filter | |
| 310 set up in init_dont_simulate_again. */ | |
| 311 gcc_assert (TREE_CODE (lhs) == SSA_NAME); | |
| 312 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE); | |
| 313 | |
| 314 *result_p = lhs; | |
| 315 ver = SSA_NAME_VERSION (lhs); | |
| 316 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver); | |
| 317 | |
| 318 switch (gimple_expr_code (stmt)) | |
| 319 { | |
| 320 case SSA_NAME: | |
| 321 case COMPLEX_CST: | |
| 322 new_l = find_lattice_value (gimple_assign_rhs1 (stmt)); | |
| 323 break; | |
| 324 | |
| 325 case COMPLEX_EXPR: | |
| 326 new_l = find_lattice_value_parts (gimple_assign_rhs1 (stmt), | |
| 327 gimple_assign_rhs2 (stmt)); | |
| 328 break; | |
| 329 | |
| 330 case PLUS_EXPR: | |
| 331 case MINUS_EXPR: | |
| 332 op1_l = find_lattice_value (gimple_assign_rhs1 (stmt)); | |
| 333 op2_l = find_lattice_value (gimple_assign_rhs2 (stmt)); | |
| 334 | |
| 335 /* We've set up the lattice values such that IOR neatly | |
| 336 models addition. */ | |
| 337 new_l = op1_l | op2_l; | |
| 338 break; | |
| 339 | |
| 340 case MULT_EXPR: | |
| 341 case RDIV_EXPR: | |
| 342 case TRUNC_DIV_EXPR: | |
| 343 case CEIL_DIV_EXPR: | |
| 344 case FLOOR_DIV_EXPR: | |
| 345 case ROUND_DIV_EXPR: | |
| 346 op1_l = find_lattice_value (gimple_assign_rhs1 (stmt)); | |
| 347 op2_l = find_lattice_value (gimple_assign_rhs2 (stmt)); | |
| 348 | |
| 349 /* Obviously, if either varies, so does the result. */ | |
| 350 if (op1_l == VARYING || op2_l == VARYING) | |
| 351 new_l = VARYING; | |
| 352 /* Don't prematurely promote variables if we've not yet seen | |
| 353 their inputs. */ | |
| 354 else if (op1_l == UNINITIALIZED) | |
| 355 new_l = op2_l; | |
| 356 else if (op2_l == UNINITIALIZED) | |
| 357 new_l = op1_l; | |
| 358 else | |
| 359 { | |
| 360 /* At this point both numbers have only one component. If the | |
| 361 numbers are of opposite kind, the result is imaginary, | |
| 362 otherwise the result is real. The add/subtract translates | |
| 363 the real/imag from/to 0/1; the ^ performs the comparison. */ | |
| 364 new_l = ((op1_l - ONLY_REAL) ^ (op2_l - ONLY_REAL)) + ONLY_REAL; | |
| 365 | |
| 366 /* Don't allow the lattice value to flip-flop indefinitely. */ | |
| 367 new_l |= old_l; | |
| 368 } | |
| 369 break; | |
| 370 | |
| 371 case NEGATE_EXPR: | |
| 372 case CONJ_EXPR: | |
| 373 new_l = find_lattice_value (gimple_assign_rhs1 (stmt)); | |
| 374 break; | |
| 375 | |
| 376 default: | |
| 377 new_l = VARYING; | |
| 378 break; | |
| 379 } | |
| 380 | |
| 381 /* If nothing changed this round, let the propagator know. */ | |
| 382 if (new_l == old_l) | |
| 383 return SSA_PROP_NOT_INTERESTING; | |
| 384 | |
| 385 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l); | |
| 386 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING; | |
| 387 } | |
| 388 | |
| 389 /* Evaluate a PHI node against the complex lattice defined above. */ | |
| 390 | |
| 391 static enum ssa_prop_result | |
| 392 complex_visit_phi (gimple phi) | |
| 393 { | |
| 394 complex_lattice_t new_l, old_l; | |
| 395 unsigned int ver; | |
| 396 tree lhs; | |
| 397 int i; | |
| 398 | |
| 399 lhs = gimple_phi_result (phi); | |
| 400 | |
| 401 /* This condition should be satisfied due to the initial filter | |
| 402 set up in init_dont_simulate_again. */ | |
| 403 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE); | |
| 404 | |
| 405 /* We've set up the lattice values such that IOR neatly models PHI meet. */ | |
| 406 new_l = UNINITIALIZED; | |
| 407 for (i = gimple_phi_num_args (phi) - 1; i >= 0; --i) | |
| 408 new_l |= find_lattice_value (gimple_phi_arg_def (phi, i)); | |
| 409 | |
| 410 ver = SSA_NAME_VERSION (lhs); | |
| 411 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver); | |
| 412 | |
| 413 if (new_l == old_l) | |
| 414 return SSA_PROP_NOT_INTERESTING; | |
| 415 | |
| 416 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l); | |
| 417 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING; | |
| 418 } | |
| 419 | |
| 420 /* Create one backing variable for a complex component of ORIG. */ | |
| 421 | |
| 422 static tree | |
| 423 create_one_component_var (tree type, tree orig, const char *prefix, | |
| 424 const char *suffix, enum tree_code code) | |
| 425 { | |
| 426 tree r = create_tmp_var (type, prefix); | |
| 427 add_referenced_var (r); | |
| 428 | |
| 429 DECL_SOURCE_LOCATION (r) = DECL_SOURCE_LOCATION (orig); | |
| 430 DECL_ARTIFICIAL (r) = 1; | |
| 431 | |
| 432 if (DECL_NAME (orig) && !DECL_IGNORED_P (orig)) | |
| 433 { | |
| 434 const char *name = IDENTIFIER_POINTER (DECL_NAME (orig)); | |
| 435 | |
| 436 DECL_NAME (r) = get_identifier (ACONCAT ((name, suffix, NULL))); | |
| 437 | |
| 438 SET_DECL_DEBUG_EXPR (r, build1 (code, type, orig)); | |
| 439 DECL_DEBUG_EXPR_IS_FROM (r) = 1; | |
| 440 DECL_IGNORED_P (r) = 0; | |
| 441 TREE_NO_WARNING (r) = TREE_NO_WARNING (orig); | |
| 442 } | |
| 443 else | |
| 444 { | |
| 445 DECL_IGNORED_P (r) = 1; | |
| 446 TREE_NO_WARNING (r) = 1; | |
| 447 } | |
| 448 | |
| 449 return r; | |
| 450 } | |
| 451 | |
| 452 /* Retrieve a value for a complex component of VAR. */ | |
| 453 | |
| 454 static tree | |
| 455 get_component_var (tree var, bool imag_p) | |
| 456 { | |
| 457 size_t decl_index = DECL_UID (var) * 2 + imag_p; | |
| 458 tree ret = cvc_lookup (decl_index); | |
| 459 | |
| 460 if (ret == NULL) | |
| 461 { | |
| 462 ret = create_one_component_var (TREE_TYPE (TREE_TYPE (var)), var, | |
| 463 imag_p ? "CI" : "CR", | |
| 464 imag_p ? "$imag" : "$real", | |
| 465 imag_p ? IMAGPART_EXPR : REALPART_EXPR); | |
| 466 cvc_insert (decl_index, ret); | |
| 467 } | |
| 468 | |
| 469 return ret; | |
| 470 } | |
| 471 | |
| 472 /* Retrieve a value for a complex component of SSA_NAME. */ | |
| 473 | |
| 474 static tree | |
| 475 get_component_ssa_name (tree ssa_name, bool imag_p) | |
| 476 { | |
| 477 complex_lattice_t lattice = find_lattice_value (ssa_name); | |
| 478 size_t ssa_name_index; | |
| 479 tree ret; | |
| 480 | |
| 481 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)) | |
| 482 { | |
| 483 tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name)); | |
| 484 if (SCALAR_FLOAT_TYPE_P (inner_type)) | |
| 485 return build_real (inner_type, dconst0); | |
| 486 else | |
| 487 return build_int_cst (inner_type, 0); | |
| 488 } | |
| 489 | |
| 490 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; | |
| 491 ret = VEC_index (tree, complex_ssa_name_components, ssa_name_index); | |
| 492 if (ret == NULL) | |
| 493 { | |
| 494 ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); | |
| 495 ret = make_ssa_name (ret, NULL); | |
| 496 | |
| 497 /* Copy some properties from the original. In particular, whether it | |
| 498 is used in an abnormal phi, and whether it's uninitialized. */ | |
| 499 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ret) | |
| 500 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name); | |
| 501 if (TREE_CODE (SSA_NAME_VAR (ssa_name)) == VAR_DECL | |
| 502 && gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name))) | |
| 503 { | |
| 504 SSA_NAME_DEF_STMT (ret) = SSA_NAME_DEF_STMT (ssa_name); | |
| 505 set_default_def (SSA_NAME_VAR (ret), ret); | |
| 506 } | |
| 507 | |
| 508 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, ret); | |
| 509 } | |
| 510 | |
| 511 return ret; | |
| 512 } | |
| 513 | |
| 514 /* Set a value for a complex component of SSA_NAME, return a | |
| 515 gimple_seq of stuff that needs doing. */ | |
| 516 | |
| 517 static gimple_seq | |
| 518 set_component_ssa_name (tree ssa_name, bool imag_p, tree value) | |
| 519 { | |
| 520 complex_lattice_t lattice = find_lattice_value (ssa_name); | |
| 521 size_t ssa_name_index; | |
| 522 tree comp; | |
| 523 gimple last; | |
| 524 gimple_seq list; | |
| 525 | |
| 526 /* We know the value must be zero, else there's a bug in our lattice | |
| 527 analysis. But the value may well be a variable known to contain | |
| 528 zero. We should be safe ignoring it. */ | |
| 529 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)) | |
| 530 return NULL; | |
| 531 | |
| 532 /* If we've already assigned an SSA_NAME to this component, then this | |
| 533 means that our walk of the basic blocks found a use before the set. | |
| 534 This is fine. Now we should create an initialization for the value | |
| 535 we created earlier. */ | |
| 536 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; | |
| 537 comp = VEC_index (tree, complex_ssa_name_components, ssa_name_index); | |
| 538 if (comp) | |
| 539 ; | |
| 540 | |
| 541 /* If we've nothing assigned, and the value we're given is already stable, | |
| 542 then install that as the value for this SSA_NAME. This preemptively | |
| 543 copy-propagates the value, which avoids unnecessary memory allocation. */ | |
| 544 else if (is_gimple_min_invariant (value) | |
| 545 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
| 546 { | |
| 547 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value); | |
| 548 return NULL; | |
| 549 } | |
| 550 else if (TREE_CODE (value) == SSA_NAME | |
| 551 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
| 552 { | |
| 553 /* Replace an anonymous base value with the variable from cvc_lookup. | |
| 554 This should result in better debug info. */ | |
| 555 if (DECL_IGNORED_P (SSA_NAME_VAR (value)) | |
| 556 && !DECL_IGNORED_P (SSA_NAME_VAR (ssa_name))) | |
| 557 { | |
| 558 comp = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); | |
| 559 replace_ssa_name_symbol (value, comp); | |
| 560 } | |
| 561 | |
| 562 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value); | |
| 563 return NULL; | |
| 564 } | |
| 565 | |
| 566 /* Finally, we need to stabilize the result by installing the value into | |
| 567 a new ssa name. */ | |
| 568 else | |
| 569 comp = get_component_ssa_name (ssa_name, imag_p); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
570 |
| 0 | 571 /* Do all the work to assign VALUE to COMP. */ |
| 572 list = NULL; | |
| 573 value = force_gimple_operand (value, &list, false, NULL); | |
| 574 last = gimple_build_assign (comp, value); | |
| 575 gimple_seq_add_stmt (&list, last); | |
| 576 gcc_assert (SSA_NAME_DEF_STMT (comp) == last); | |
| 577 | |
| 578 return list; | |
| 579 } | |
| 580 | |
| 581 /* Extract the real or imaginary part of a complex variable or constant. | |
| 582 Make sure that it's a proper gimple_val and gimplify it if not. | |
| 583 Emit any new code before gsi. */ | |
| 584 | |
| 585 static tree | |
| 586 extract_component (gimple_stmt_iterator *gsi, tree t, bool imagpart_p, | |
| 587 bool gimple_p) | |
| 588 { | |
| 589 switch (TREE_CODE (t)) | |
| 590 { | |
| 591 case COMPLEX_CST: | |
| 592 return imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t); | |
| 593 | |
| 594 case COMPLEX_EXPR: | |
| 595 gcc_unreachable (); | |
| 596 | |
| 597 case VAR_DECL: | |
| 598 case RESULT_DECL: | |
| 599 case PARM_DECL: | |
| 600 case INDIRECT_REF: | |
| 601 case COMPONENT_REF: | |
| 602 case ARRAY_REF: | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
603 case VIEW_CONVERT_EXPR: |
| 0 | 604 { |
| 605 tree inner_type = TREE_TYPE (TREE_TYPE (t)); | |
| 606 | |
| 607 t = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR), | |
| 608 inner_type, unshare_expr (t)); | |
| 609 | |
| 610 if (gimple_p) | |
| 611 t = force_gimple_operand_gsi (gsi, t, true, NULL, true, | |
| 612 GSI_SAME_STMT); | |
| 613 | |
| 614 return t; | |
| 615 } | |
| 616 | |
| 617 case SSA_NAME: | |
| 618 return get_component_ssa_name (t, imagpart_p); | |
| 619 | |
| 620 default: | |
| 621 gcc_unreachable (); | |
| 622 } | |
| 623 } | |
| 624 | |
| 625 /* Update the complex components of the ssa name on the lhs of STMT. */ | |
| 626 | |
| 627 static void | |
| 628 update_complex_components (gimple_stmt_iterator *gsi, gimple stmt, tree r, | |
| 629 tree i) | |
| 630 { | |
| 631 tree lhs; | |
| 632 gimple_seq list; | |
| 633 | |
| 634 lhs = gimple_get_lhs (stmt); | |
| 635 | |
| 636 list = set_component_ssa_name (lhs, false, r); | |
| 637 if (list) | |
| 638 gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); | |
| 639 | |
| 640 list = set_component_ssa_name (lhs, true, i); | |
| 641 if (list) | |
| 642 gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); | |
| 643 } | |
| 644 | |
| 645 static void | |
| 646 update_complex_components_on_edge (edge e, tree lhs, tree r, tree i) | |
| 647 { | |
| 648 gimple_seq list; | |
| 649 | |
| 650 list = set_component_ssa_name (lhs, false, r); | |
| 651 if (list) | |
| 652 gsi_insert_seq_on_edge (e, list); | |
| 653 | |
| 654 list = set_component_ssa_name (lhs, true, i); | |
| 655 if (list) | |
| 656 gsi_insert_seq_on_edge (e, list); | |
| 657 } | |
| 658 | |
| 659 | |
| 660 /* Update an assignment to a complex variable in place. */ | |
| 661 | |
| 662 static void | |
| 663 update_complex_assignment (gimple_stmt_iterator *gsi, tree r, tree i) | |
| 664 { | |
| 665 gimple_stmt_iterator orig_si = *gsi; | |
| 666 | |
| 667 if (gimple_in_ssa_p (cfun)) | |
| 668 update_complex_components (gsi, gsi_stmt (*gsi), r, i); | |
| 669 | |
| 670 gimple_assign_set_rhs_with_ops (&orig_si, COMPLEX_EXPR, r, i); | |
| 671 update_stmt (gsi_stmt (orig_si)); | |
| 672 } | |
| 673 | |
| 674 | |
| 675 /* Generate code at the entry point of the function to initialize the | |
| 676 component variables for a complex parameter. */ | |
| 677 | |
| 678 static void | |
| 679 update_parameter_components (void) | |
| 680 { | |
| 681 edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR); | |
| 682 tree parm; | |
| 683 | |
| 684 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm)) | |
| 685 { | |
| 686 tree type = TREE_TYPE (parm); | |
| 687 tree ssa_name, r, i; | |
| 688 | |
| 689 if (TREE_CODE (type) != COMPLEX_TYPE || !is_gimple_reg (parm)) | |
| 690 continue; | |
| 691 | |
| 692 type = TREE_TYPE (type); | |
| 693 ssa_name = gimple_default_def (cfun, parm); | |
| 694 if (!ssa_name) | |
| 695 continue; | |
| 696 | |
| 697 r = build1 (REALPART_EXPR, type, ssa_name); | |
| 698 i = build1 (IMAGPART_EXPR, type, ssa_name); | |
| 699 update_complex_components_on_edge (entry_edge, ssa_name, r, i); | |
| 700 } | |
| 701 } | |
| 702 | |
| 703 /* Generate code to set the component variables of a complex variable | |
| 704 to match the PHI statements in block BB. */ | |
| 705 | |
| 706 static void | |
| 707 update_phi_components (basic_block bb) | |
| 708 { | |
| 709 gimple_stmt_iterator gsi; | |
| 710 | |
| 711 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 712 { | |
| 713 gimple phi = gsi_stmt (gsi); | |
| 714 | |
| 715 if (is_complex_reg (gimple_phi_result (phi))) | |
| 716 { | |
| 717 tree lr, li; | |
| 718 gimple pr = NULL, pi = NULL; | |
| 719 unsigned int i, n; | |
| 720 | |
| 721 lr = get_component_ssa_name (gimple_phi_result (phi), false); | |
| 722 if (TREE_CODE (lr) == SSA_NAME) | |
| 723 { | |
| 724 pr = create_phi_node (lr, bb); | |
| 725 SSA_NAME_DEF_STMT (lr) = pr; | |
| 726 } | |
| 727 | |
| 728 li = get_component_ssa_name (gimple_phi_result (phi), true); | |
| 729 if (TREE_CODE (li) == SSA_NAME) | |
| 730 { | |
| 731 pi = create_phi_node (li, bb); | |
| 732 SSA_NAME_DEF_STMT (li) = pi; | |
| 733 } | |
| 734 | |
| 735 for (i = 0, n = gimple_phi_num_args (phi); i < n; ++i) | |
| 736 { | |
| 737 tree comp, arg = gimple_phi_arg_def (phi, i); | |
| 738 if (pr) | |
| 739 { | |
| 740 comp = extract_component (NULL, arg, false, false); | |
| 741 SET_PHI_ARG_DEF (pr, i, comp); | |
| 742 } | |
| 743 if (pi) | |
| 744 { | |
| 745 comp = extract_component (NULL, arg, true, false); | |
| 746 SET_PHI_ARG_DEF (pi, i, comp); | |
| 747 } | |
| 748 } | |
| 749 } | |
| 750 } | |
| 751 } | |
| 752 | |
| 753 /* Expand a complex move to scalars. */ | |
| 754 | |
| 755 static void | |
| 756 expand_complex_move (gimple_stmt_iterator *gsi, tree type) | |
| 757 { | |
| 758 tree inner_type = TREE_TYPE (type); | |
| 759 tree r, i, lhs, rhs; | |
| 760 gimple stmt = gsi_stmt (*gsi); | |
| 761 | |
| 762 if (is_gimple_assign (stmt)) | |
| 763 { | |
| 764 lhs = gimple_assign_lhs (stmt); | |
| 765 if (gimple_num_ops (stmt) == 2) | |
| 766 rhs = gimple_assign_rhs1 (stmt); | |
| 767 else | |
| 768 rhs = NULL_TREE; | |
| 769 } | |
| 770 else if (is_gimple_call (stmt)) | |
| 771 { | |
| 772 lhs = gimple_call_lhs (stmt); | |
| 773 rhs = NULL_TREE; | |
| 774 } | |
| 775 else | |
| 776 gcc_unreachable (); | |
| 777 | |
| 778 if (TREE_CODE (lhs) == SSA_NAME) | |
| 779 { | |
| 780 if (is_ctrl_altering_stmt (stmt)) | |
| 781 { | |
| 782 edge_iterator ei; | |
| 783 edge e; | |
| 784 | |
| 785 /* The value is not assigned on the exception edges, so we need not | |
| 786 concern ourselves there. We do need to update on the fallthru | |
| 787 edge. Find it. */ | |
| 788 FOR_EACH_EDGE (e, ei, gsi_bb (*gsi)->succs) | |
| 789 if (e->flags & EDGE_FALLTHRU) | |
| 790 goto found_fallthru; | |
| 791 gcc_unreachable (); | |
| 792 found_fallthru: | |
| 793 | |
| 794 r = build1 (REALPART_EXPR, inner_type, lhs); | |
| 795 i = build1 (IMAGPART_EXPR, inner_type, lhs); | |
| 796 update_complex_components_on_edge (e, lhs, r, i); | |
| 797 } | |
| 798 else if (is_gimple_call (stmt) | |
| 799 || gimple_has_side_effects (stmt) | |
| 800 || gimple_assign_rhs_code (stmt) == PAREN_EXPR) | |
| 801 { | |
| 802 r = build1 (REALPART_EXPR, inner_type, lhs); | |
| 803 i = build1 (IMAGPART_EXPR, inner_type, lhs); | |
| 804 update_complex_components (gsi, stmt, r, i); | |
| 805 } | |
| 806 else | |
| 807 { | |
| 808 if (gimple_assign_rhs_code (stmt) != COMPLEX_EXPR) | |
| 809 { | |
| 810 r = extract_component (gsi, rhs, 0, true); | |
| 811 i = extract_component (gsi, rhs, 1, true); | |
| 812 } | |
| 813 else | |
| 814 { | |
| 815 r = gimple_assign_rhs1 (stmt); | |
| 816 i = gimple_assign_rhs2 (stmt); | |
| 817 } | |
| 818 update_complex_assignment (gsi, r, i); | |
| 819 } | |
| 820 } | |
| 821 else if (rhs && TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs)) | |
| 822 { | |
| 823 tree x; | |
| 824 gimple t; | |
| 825 | |
| 826 r = extract_component (gsi, rhs, 0, false); | |
| 827 i = extract_component (gsi, rhs, 1, false); | |
| 828 | |
| 829 x = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs)); | |
| 830 t = gimple_build_assign (x, r); | |
| 831 gsi_insert_before (gsi, t, GSI_SAME_STMT); | |
| 832 | |
| 833 if (stmt == gsi_stmt (*gsi)) | |
| 834 { | |
| 835 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs)); | |
| 836 gimple_assign_set_lhs (stmt, x); | |
| 837 gimple_assign_set_rhs1 (stmt, i); | |
| 838 } | |
| 839 else | |
| 840 { | |
| 841 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs)); | |
| 842 t = gimple_build_assign (x, i); | |
| 843 gsi_insert_before (gsi, t, GSI_SAME_STMT); | |
| 844 | |
| 845 stmt = gsi_stmt (*gsi); | |
| 846 gcc_assert (gimple_code (stmt) == GIMPLE_RETURN); | |
| 847 gimple_return_set_retval (stmt, lhs); | |
| 848 } | |
| 849 | |
| 850 update_stmt (stmt); | |
| 851 } | |
| 852 } | |
| 853 | |
| 854 /* Expand complex addition to scalars: | |
| 855 a + b = (ar + br) + i(ai + bi) | |
| 856 a - b = (ar - br) + i(ai + bi) | |
| 857 */ | |
| 858 | |
| 859 static void | |
| 860 expand_complex_addition (gimple_stmt_iterator *gsi, tree inner_type, | |
| 861 tree ar, tree ai, tree br, tree bi, | |
| 862 enum tree_code code, | |
| 863 complex_lattice_t al, complex_lattice_t bl) | |
| 864 { | |
| 865 tree rr, ri; | |
| 866 | |
| 867 switch (PAIR (al, bl)) | |
| 868 { | |
| 869 case PAIR (ONLY_REAL, ONLY_REAL): | |
| 870 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 871 ri = ai; | |
| 872 break; | |
| 873 | |
| 874 case PAIR (ONLY_REAL, ONLY_IMAG): | |
| 875 rr = ar; | |
| 876 if (code == MINUS_EXPR) | |
| 877 ri = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, bi); | |
| 878 else | |
| 879 ri = bi; | |
| 880 break; | |
| 881 | |
| 882 case PAIR (ONLY_IMAG, ONLY_REAL): | |
| 883 if (code == MINUS_EXPR) | |
| 884 rr = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ar, br); | |
| 885 else | |
| 886 rr = br; | |
| 887 ri = ai; | |
| 888 break; | |
| 889 | |
| 890 case PAIR (ONLY_IMAG, ONLY_IMAG): | |
| 891 rr = ar; | |
| 892 ri = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 893 break; | |
| 894 | |
| 895 case PAIR (VARYING, ONLY_REAL): | |
| 896 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 897 ri = ai; | |
| 898 break; | |
| 899 | |
| 900 case PAIR (VARYING, ONLY_IMAG): | |
| 901 rr = ar; | |
| 902 ri = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 903 break; | |
| 904 | |
| 905 case PAIR (ONLY_REAL, VARYING): | |
| 906 if (code == MINUS_EXPR) | |
| 907 goto general; | |
| 908 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 909 ri = bi; | |
| 910 break; | |
| 911 | |
| 912 case PAIR (ONLY_IMAG, VARYING): | |
| 913 if (code == MINUS_EXPR) | |
| 914 goto general; | |
| 915 rr = br; | |
| 916 ri = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 917 break; | |
| 918 | |
| 919 case PAIR (VARYING, VARYING): | |
| 920 general: | |
| 921 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 922 ri = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 923 break; | |
| 924 | |
| 925 default: | |
| 926 gcc_unreachable (); | |
| 927 } | |
| 928 | |
| 929 update_complex_assignment (gsi, rr, ri); | |
| 930 } | |
| 931 | |
| 932 /* Expand a complex multiplication or division to a libcall to the c99 | |
| 933 compliant routines. */ | |
| 934 | |
| 935 static void | |
| 936 expand_complex_libcall (gimple_stmt_iterator *gsi, tree ar, tree ai, | |
| 937 tree br, tree bi, enum tree_code code) | |
| 938 { | |
| 939 enum machine_mode mode; | |
| 940 enum built_in_function bcode; | |
| 941 tree fn, type, lhs; | |
| 942 gimple old_stmt, stmt; | |
| 943 | |
| 944 old_stmt = gsi_stmt (*gsi); | |
| 945 lhs = gimple_assign_lhs (old_stmt); | |
| 946 type = TREE_TYPE (lhs); | |
| 947 | |
| 948 mode = TYPE_MODE (type); | |
| 949 gcc_assert (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT); | |
| 950 | |
| 951 if (code == MULT_EXPR) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
952 bcode = ((enum built_in_function) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
953 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); |
| 0 | 954 else if (code == RDIV_EXPR) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
955 bcode = ((enum built_in_function) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
956 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); |
| 0 | 957 else |
| 958 gcc_unreachable (); | |
| 959 fn = built_in_decls[bcode]; | |
| 960 | |
| 961 stmt = gimple_build_call (fn, 4, ar, ai, br, bi); | |
| 962 gimple_call_set_lhs (stmt, lhs); | |
| 963 update_stmt (stmt); | |
| 964 gsi_replace (gsi, stmt, false); | |
| 965 | |
| 966 if (maybe_clean_or_replace_eh_stmt (old_stmt, stmt)) | |
| 967 gimple_purge_dead_eh_edges (gsi_bb (*gsi)); | |
| 968 | |
| 969 if (gimple_in_ssa_p (cfun)) | |
| 970 { | |
| 971 type = TREE_TYPE (type); | |
| 972 update_complex_components (gsi, stmt, | |
| 973 build1 (REALPART_EXPR, type, lhs), | |
| 974 build1 (IMAGPART_EXPR, type, lhs)); | |
| 975 SSA_NAME_DEF_STMT (lhs) = stmt; | |
| 976 } | |
| 977 } | |
| 978 | |
| 979 /* Expand complex multiplication to scalars: | |
| 980 a * b = (ar*br - ai*bi) + i(ar*bi + br*ai) | |
| 981 */ | |
| 982 | |
| 983 static void | |
| 984 expand_complex_multiplication (gimple_stmt_iterator *gsi, tree inner_type, | |
| 985 tree ar, tree ai, tree br, tree bi, | |
| 986 complex_lattice_t al, complex_lattice_t bl) | |
| 987 { | |
| 988 tree rr, ri; | |
| 989 | |
| 990 if (al < bl) | |
| 991 { | |
| 992 complex_lattice_t tl; | |
| 993 rr = ar, ar = br, br = rr; | |
| 994 ri = ai, ai = bi, bi = ri; | |
| 995 tl = al, al = bl, bl = tl; | |
| 996 } | |
| 997 | |
| 998 switch (PAIR (al, bl)) | |
| 999 { | |
| 1000 case PAIR (ONLY_REAL, ONLY_REAL): | |
| 1001 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); | |
| 1002 ri = ai; | |
| 1003 break; | |
| 1004 | |
| 1005 case PAIR (ONLY_IMAG, ONLY_REAL): | |
| 1006 rr = ar; | |
| 1007 if (TREE_CODE (ai) == REAL_CST | |
| 1008 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst1)) | |
| 1009 ri = br; | |
| 1010 else | |
| 1011 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); | |
| 1012 break; | |
| 1013 | |
| 1014 case PAIR (ONLY_IMAG, ONLY_IMAG): | |
| 1015 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); | |
| 1016 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr); | |
| 1017 ri = ar; | |
| 1018 break; | |
| 1019 | |
| 1020 case PAIR (VARYING, ONLY_REAL): | |
| 1021 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); | |
| 1022 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); | |
| 1023 break; | |
| 1024 | |
| 1025 case PAIR (VARYING, ONLY_IMAG): | |
| 1026 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); | |
| 1027 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr); | |
| 1028 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi); | |
| 1029 break; | |
| 1030 | |
| 1031 case PAIR (VARYING, VARYING): | |
| 1032 if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type)) | |
| 1033 { | |
| 1034 expand_complex_libcall (gsi, ar, ai, br, bi, MULT_EXPR); | |
| 1035 return; | |
| 1036 } | |
| 1037 else | |
| 1038 { | |
| 1039 tree t1, t2, t3, t4; | |
| 1040 | |
| 1041 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); | |
| 1042 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); | |
| 1043 t3 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi); | |
| 1044 | |
| 1045 /* Avoid expanding redundant multiplication for the common | |
| 1046 case of squaring a complex number. */ | |
| 1047 if (ar == br && ai == bi) | |
| 1048 t4 = t3; | |
| 1049 else | |
| 1050 t4 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); | |
| 1051 | |
| 1052 rr = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, t2); | |
| 1053 ri = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t3, t4); | |
| 1054 } | |
| 1055 break; | |
| 1056 | |
| 1057 default: | |
| 1058 gcc_unreachable (); | |
| 1059 } | |
| 1060 | |
| 1061 update_complex_assignment (gsi, rr, ri); | |
| 1062 } | |
| 1063 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1064 /* Keep this algorithm in sync with fold-const.c:const_binop(). |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1065 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1066 Expand complex division to scalars, straightforward algorithm. |
| 0 | 1067 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t) |
| 1068 t = br*br + bi*bi | |
| 1069 */ | |
| 1070 | |
| 1071 static void | |
| 1072 expand_complex_div_straight (gimple_stmt_iterator *gsi, tree inner_type, | |
| 1073 tree ar, tree ai, tree br, tree bi, | |
| 1074 enum tree_code code) | |
| 1075 { | |
| 1076 tree rr, ri, div, t1, t2, t3; | |
| 1077 | |
| 1078 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, br); | |
| 1079 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, bi); | |
| 1080 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2); | |
| 1081 | |
| 1082 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); | |
| 1083 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); | |
| 1084 t3 = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2); | |
| 1085 rr = gimplify_build2 (gsi, code, inner_type, t3, div); | |
| 1086 | |
| 1087 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); | |
| 1088 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi); | |
| 1089 t3 = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, t2); | |
| 1090 ri = gimplify_build2 (gsi, code, inner_type, t3, div); | |
| 1091 | |
| 1092 update_complex_assignment (gsi, rr, ri); | |
| 1093 } | |
| 1094 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1095 /* Keep this algorithm in sync with fold-const.c:const_binop(). |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1096 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1097 Expand complex division to scalars, modified algorithm to minimize |
| 0 | 1098 overflow with wide input ranges. */ |
| 1099 | |
| 1100 static void | |
| 1101 expand_complex_div_wide (gimple_stmt_iterator *gsi, tree inner_type, | |
| 1102 tree ar, tree ai, tree br, tree bi, | |
| 1103 enum tree_code code) | |
| 1104 { | |
| 1105 tree rr, ri, ratio, div, t1, t2, tr, ti, compare; | |
| 1106 basic_block bb_cond, bb_true, bb_false, bb_join; | |
| 1107 gimple stmt; | |
| 1108 | |
| 1109 /* Examine |br| < |bi|, and branch. */ | |
| 1110 t1 = gimplify_build1 (gsi, ABS_EXPR, inner_type, br); | |
| 1111 t2 = gimplify_build1 (gsi, ABS_EXPR, inner_type, bi); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1112 compare = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1113 LT_EXPR, boolean_type_node, t1, t2); |
| 0 | 1114 STRIP_NOPS (compare); |
| 1115 | |
| 1116 bb_cond = bb_true = bb_false = bb_join = NULL; | |
| 1117 rr = ri = tr = ti = NULL; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1118 if (TREE_CODE (compare) != INTEGER_CST) |
| 0 | 1119 { |
| 1120 edge e; | |
| 1121 gimple stmt; | |
| 1122 tree cond, tmp; | |
| 1123 | |
| 1124 tmp = create_tmp_var (boolean_type_node, NULL); | |
| 1125 stmt = gimple_build_assign (tmp, compare); | |
| 1126 if (gimple_in_ssa_p (cfun)) | |
| 1127 { | |
| 1128 tmp = make_ssa_name (tmp, stmt); | |
| 1129 gimple_assign_set_lhs (stmt, tmp); | |
| 1130 } | |
| 1131 | |
| 1132 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1133 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1134 cond = fold_build2_loc (gimple_location (stmt), |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1135 EQ_EXPR, boolean_type_node, tmp, boolean_true_node); |
| 0 | 1136 stmt = gimple_build_cond_from_tree (cond, NULL_TREE, NULL_TREE); |
| 1137 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1138 | |
| 1139 /* Split the original block, and create the TRUE and FALSE blocks. */ | |
| 1140 e = split_block (gsi_bb (*gsi), stmt); | |
| 1141 bb_cond = e->src; | |
| 1142 bb_join = e->dest; | |
| 1143 bb_true = create_empty_bb (bb_cond); | |
| 1144 bb_false = create_empty_bb (bb_true); | |
| 1145 | |
| 1146 /* Wire the blocks together. */ | |
| 1147 e->flags = EDGE_TRUE_VALUE; | |
| 1148 redirect_edge_succ (e, bb_true); | |
| 1149 make_edge (bb_cond, bb_false, EDGE_FALSE_VALUE); | |
| 1150 make_edge (bb_true, bb_join, EDGE_FALLTHRU); | |
| 1151 make_edge (bb_false, bb_join, EDGE_FALLTHRU); | |
| 1152 | |
| 1153 /* Update dominance info. Note that bb_join's data was | |
| 1154 updated by split_block. */ | |
| 1155 if (dom_info_available_p (CDI_DOMINATORS)) | |
| 1156 { | |
| 1157 set_immediate_dominator (CDI_DOMINATORS, bb_true, bb_cond); | |
| 1158 set_immediate_dominator (CDI_DOMINATORS, bb_false, bb_cond); | |
| 1159 } | |
| 1160 | |
| 1161 rr = make_rename_temp (inner_type, NULL); | |
| 1162 ri = make_rename_temp (inner_type, NULL); | |
| 1163 } | |
| 1164 | |
| 1165 /* In the TRUE branch, we compute | |
| 1166 ratio = br/bi; | |
| 1167 div = (br * ratio) + bi; | |
| 1168 tr = (ar * ratio) + ai; | |
| 1169 ti = (ai * ratio) - ar; | |
| 1170 tr = tr / div; | |
| 1171 ti = ti / div; */ | |
| 1172 if (bb_true || integer_nonzerop (compare)) | |
| 1173 { | |
| 1174 if (bb_true) | |
| 1175 { | |
| 1176 *gsi = gsi_last_bb (bb_true); | |
| 1177 gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT); | |
| 1178 } | |
| 1179 | |
| 1180 ratio = gimplify_build2 (gsi, code, inner_type, br, bi); | |
| 1181 | |
| 1182 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, ratio); | |
| 1183 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, bi); | |
| 1184 | |
| 1185 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio); | |
| 1186 tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ai); | |
| 1187 | |
| 1188 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio); | |
| 1189 ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, ar); | |
| 1190 | |
| 1191 tr = gimplify_build2 (gsi, code, inner_type, tr, div); | |
| 1192 ti = gimplify_build2 (gsi, code, inner_type, ti, div); | |
| 1193 | |
| 1194 if (bb_true) | |
| 1195 { | |
| 1196 stmt = gimple_build_assign (rr, tr); | |
| 1197 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1198 stmt = gimple_build_assign (ri, ti); | |
| 1199 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1200 gsi_remove (gsi, true); | |
| 1201 } | |
| 1202 } | |
| 1203 | |
| 1204 /* In the FALSE branch, we compute | |
| 1205 ratio = d/c; | |
| 1206 divisor = (d * ratio) + c; | |
| 1207 tr = (b * ratio) + a; | |
| 1208 ti = b - (a * ratio); | |
| 1209 tr = tr / div; | |
| 1210 ti = ti / div; */ | |
| 1211 if (bb_false || integer_zerop (compare)) | |
| 1212 { | |
| 1213 if (bb_false) | |
| 1214 { | |
| 1215 *gsi = gsi_last_bb (bb_false); | |
| 1216 gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT); | |
| 1217 } | |
| 1218 | |
| 1219 ratio = gimplify_build2 (gsi, code, inner_type, bi, br); | |
| 1220 | |
| 1221 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, ratio); | |
| 1222 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, br); | |
| 1223 | |
| 1224 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio); | |
| 1225 tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ar); | |
| 1226 | |
| 1227 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio); | |
| 1228 ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, t1); | |
| 1229 | |
| 1230 tr = gimplify_build2 (gsi, code, inner_type, tr, div); | |
| 1231 ti = gimplify_build2 (gsi, code, inner_type, ti, div); | |
| 1232 | |
| 1233 if (bb_false) | |
| 1234 { | |
| 1235 stmt = gimple_build_assign (rr, tr); | |
| 1236 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1237 stmt = gimple_build_assign (ri, ti); | |
| 1238 gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
| 1239 gsi_remove (gsi, true); | |
| 1240 } | |
| 1241 } | |
| 1242 | |
| 1243 if (bb_join) | |
| 1244 *gsi = gsi_start_bb (bb_join); | |
| 1245 else | |
| 1246 rr = tr, ri = ti; | |
| 1247 | |
| 1248 update_complex_assignment (gsi, rr, ri); | |
| 1249 } | |
| 1250 | |
| 1251 /* Expand complex division to scalars. */ | |
| 1252 | |
| 1253 static void | |
| 1254 expand_complex_division (gimple_stmt_iterator *gsi, tree inner_type, | |
| 1255 tree ar, tree ai, tree br, tree bi, | |
| 1256 enum tree_code code, | |
| 1257 complex_lattice_t al, complex_lattice_t bl) | |
| 1258 { | |
| 1259 tree rr, ri; | |
| 1260 | |
| 1261 switch (PAIR (al, bl)) | |
| 1262 { | |
| 1263 case PAIR (ONLY_REAL, ONLY_REAL): | |
| 1264 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 1265 ri = ai; | |
| 1266 break; | |
| 1267 | |
| 1268 case PAIR (ONLY_REAL, ONLY_IMAG): | |
| 1269 rr = ai; | |
| 1270 ri = gimplify_build2 (gsi, code, inner_type, ar, bi); | |
| 1271 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri); | |
| 1272 break; | |
| 1273 | |
| 1274 case PAIR (ONLY_IMAG, ONLY_REAL): | |
| 1275 rr = ar; | |
| 1276 ri = gimplify_build2 (gsi, code, inner_type, ai, br); | |
| 1277 break; | |
| 1278 | |
| 1279 case PAIR (ONLY_IMAG, ONLY_IMAG): | |
| 1280 rr = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 1281 ri = ar; | |
| 1282 break; | |
| 1283 | |
| 1284 case PAIR (VARYING, ONLY_REAL): | |
| 1285 rr = gimplify_build2 (gsi, code, inner_type, ar, br); | |
| 1286 ri = gimplify_build2 (gsi, code, inner_type, ai, br); | |
| 1287 break; | |
| 1288 | |
| 1289 case PAIR (VARYING, ONLY_IMAG): | |
| 1290 rr = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
| 1291 ri = gimplify_build2 (gsi, code, inner_type, ar, bi); | |
| 1292 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri); | |
| 1293 | |
| 1294 case PAIR (ONLY_REAL, VARYING): | |
| 1295 case PAIR (ONLY_IMAG, VARYING): | |
| 1296 case PAIR (VARYING, VARYING): | |
| 1297 switch (flag_complex_method) | |
| 1298 { | |
| 1299 case 0: | |
| 1300 /* straightforward implementation of complex divide acceptable. */ | |
| 1301 expand_complex_div_straight (gsi, inner_type, ar, ai, br, bi, code); | |
| 1302 break; | |
| 1303 | |
| 1304 case 2: | |
| 1305 if (SCALAR_FLOAT_TYPE_P (inner_type)) | |
| 1306 { | |
| 1307 expand_complex_libcall (gsi, ar, ai, br, bi, code); | |
| 1308 break; | |
| 1309 } | |
| 1310 /* FALLTHRU */ | |
| 1311 | |
| 1312 case 1: | |
| 1313 /* wide ranges of inputs must work for complex divide. */ | |
| 1314 expand_complex_div_wide (gsi, inner_type, ar, ai, br, bi, code); | |
| 1315 break; | |
| 1316 | |
| 1317 default: | |
| 1318 gcc_unreachable (); | |
| 1319 } | |
| 1320 return; | |
| 1321 | |
| 1322 default: | |
| 1323 gcc_unreachable (); | |
| 1324 } | |
| 1325 | |
| 1326 update_complex_assignment (gsi, rr, ri); | |
| 1327 } | |
| 1328 | |
| 1329 /* Expand complex negation to scalars: | |
| 1330 -a = (-ar) + i(-ai) | |
| 1331 */ | |
| 1332 | |
| 1333 static void | |
| 1334 expand_complex_negation (gimple_stmt_iterator *gsi, tree inner_type, | |
| 1335 tree ar, tree ai) | |
| 1336 { | |
| 1337 tree rr, ri; | |
| 1338 | |
| 1339 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ar); | |
| 1340 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai); | |
| 1341 | |
| 1342 update_complex_assignment (gsi, rr, ri); | |
| 1343 } | |
| 1344 | |
| 1345 /* Expand complex conjugate to scalars: | |
| 1346 ~a = (ar) + i(-ai) | |
| 1347 */ | |
| 1348 | |
| 1349 static void | |
| 1350 expand_complex_conjugate (gimple_stmt_iterator *gsi, tree inner_type, | |
| 1351 tree ar, tree ai) | |
| 1352 { | |
| 1353 tree ri; | |
| 1354 | |
| 1355 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai); | |
| 1356 | |
| 1357 update_complex_assignment (gsi, ar, ri); | |
| 1358 } | |
| 1359 | |
| 1360 /* Expand complex comparison (EQ or NE only). */ | |
| 1361 | |
| 1362 static void | |
| 1363 expand_complex_comparison (gimple_stmt_iterator *gsi, tree ar, tree ai, | |
| 1364 tree br, tree bi, enum tree_code code) | |
| 1365 { | |
| 1366 tree cr, ci, cc, type; | |
| 1367 gimple stmt; | |
| 1368 | |
| 1369 cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br); | |
| 1370 ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi); | |
| 1371 cc = gimplify_build2 (gsi, | |
| 1372 (code == EQ_EXPR ? TRUTH_AND_EXPR : TRUTH_OR_EXPR), | |
| 1373 boolean_type_node, cr, ci); | |
| 1374 | |
| 1375 stmt = gsi_stmt (*gsi); | |
| 1376 | |
| 1377 switch (gimple_code (stmt)) | |
| 1378 { | |
| 1379 case GIMPLE_RETURN: | |
| 1380 type = TREE_TYPE (gimple_return_retval (stmt)); | |
| 1381 gimple_return_set_retval (stmt, fold_convert (type, cc)); | |
| 1382 break; | |
| 1383 | |
| 1384 case GIMPLE_ASSIGN: | |
| 1385 type = TREE_TYPE (gimple_assign_lhs (stmt)); | |
| 1386 gimple_assign_set_rhs_from_tree (gsi, fold_convert (type, cc)); | |
| 1387 stmt = gsi_stmt (*gsi); | |
| 1388 break; | |
| 1389 | |
| 1390 case GIMPLE_COND: | |
| 1391 gimple_cond_set_code (stmt, EQ_EXPR); | |
| 1392 gimple_cond_set_lhs (stmt, cc); | |
| 1393 gimple_cond_set_rhs (stmt, boolean_true_node); | |
| 1394 break; | |
| 1395 | |
| 1396 default: | |
| 1397 gcc_unreachable (); | |
| 1398 } | |
| 1399 | |
| 1400 update_stmt (stmt); | |
| 1401 } | |
| 1402 | |
| 1403 | |
| 1404 /* Process one statement. If we identify a complex operation, expand it. */ | |
| 1405 | |
| 1406 static void | |
| 1407 expand_complex_operations_1 (gimple_stmt_iterator *gsi) | |
| 1408 { | |
| 1409 gimple stmt = gsi_stmt (*gsi); | |
| 1410 tree type, inner_type, lhs; | |
| 1411 tree ac, ar, ai, bc, br, bi; | |
| 1412 complex_lattice_t al, bl; | |
| 1413 enum tree_code code; | |
| 1414 | |
| 1415 lhs = gimple_get_lhs (stmt); | |
| 1416 if (!lhs && gimple_code (stmt) != GIMPLE_COND) | |
| 1417 return; | |
| 1418 | |
| 1419 type = TREE_TYPE (gimple_op (stmt, 0)); | |
| 1420 code = gimple_expr_code (stmt); | |
| 1421 | |
| 1422 /* Initial filter for operations we handle. */ | |
| 1423 switch (code) | |
| 1424 { | |
| 1425 case PLUS_EXPR: | |
| 1426 case MINUS_EXPR: | |
| 1427 case MULT_EXPR: | |
| 1428 case TRUNC_DIV_EXPR: | |
| 1429 case CEIL_DIV_EXPR: | |
| 1430 case FLOOR_DIV_EXPR: | |
| 1431 case ROUND_DIV_EXPR: | |
| 1432 case RDIV_EXPR: | |
| 1433 case NEGATE_EXPR: | |
| 1434 case CONJ_EXPR: | |
| 1435 if (TREE_CODE (type) != COMPLEX_TYPE) | |
| 1436 return; | |
| 1437 inner_type = TREE_TYPE (type); | |
| 1438 break; | |
| 1439 | |
| 1440 case EQ_EXPR: | |
| 1441 case NE_EXPR: | |
| 1442 /* Note, both GIMPLE_ASSIGN and GIMPLE_COND may have an EQ_EXPR | |
| 1443 subocde, so we need to access the operands using gimple_op. */ | |
| 1444 inner_type = TREE_TYPE (gimple_op (stmt, 1)); | |
| 1445 if (TREE_CODE (inner_type) != COMPLEX_TYPE) | |
| 1446 return; | |
| 1447 break; | |
| 1448 | |
| 1449 default: | |
| 1450 { | |
| 1451 tree rhs; | |
| 1452 | |
| 1453 /* GIMPLE_COND may also fallthru here, but we do not need to | |
| 1454 do anything with it. */ | |
| 1455 if (gimple_code (stmt) == GIMPLE_COND) | |
| 1456 return; | |
| 1457 | |
| 1458 if (TREE_CODE (type) == COMPLEX_TYPE) | |
| 1459 expand_complex_move (gsi, type); | |
| 1460 else if (is_gimple_assign (stmt) | |
| 1461 && (gimple_assign_rhs_code (stmt) == REALPART_EXPR | |
| 1462 || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR) | |
| 1463 && TREE_CODE (lhs) == SSA_NAME) | |
| 1464 { | |
| 1465 rhs = gimple_assign_rhs1 (stmt); | |
| 1466 rhs = extract_component (gsi, TREE_OPERAND (rhs, 0), | |
| 1467 gimple_assign_rhs_code (stmt) | |
| 1468 == IMAGPART_EXPR, | |
| 1469 false); | |
| 1470 gimple_assign_set_rhs_from_tree (gsi, rhs); | |
| 1471 stmt = gsi_stmt (*gsi); | |
| 1472 update_stmt (stmt); | |
| 1473 } | |
| 1474 } | |
| 1475 return; | |
| 1476 } | |
| 1477 | |
| 1478 /* Extract the components of the two complex values. Make sure and | |
| 1479 handle the common case of the same value used twice specially. */ | |
| 1480 if (is_gimple_assign (stmt)) | |
| 1481 { | |
| 1482 ac = gimple_assign_rhs1 (stmt); | |
| 1483 bc = (gimple_num_ops (stmt) > 2) ? gimple_assign_rhs2 (stmt) : NULL; | |
| 1484 } | |
| 1485 /* GIMPLE_CALL can not get here. */ | |
| 1486 else | |
| 1487 { | |
| 1488 ac = gimple_cond_lhs (stmt); | |
| 1489 bc = gimple_cond_rhs (stmt); | |
| 1490 } | |
| 1491 | |
| 1492 ar = extract_component (gsi, ac, false, true); | |
| 1493 ai = extract_component (gsi, ac, true, true); | |
| 1494 | |
| 1495 if (ac == bc) | |
| 1496 br = ar, bi = ai; | |
| 1497 else if (bc) | |
| 1498 { | |
| 1499 br = extract_component (gsi, bc, 0, true); | |
| 1500 bi = extract_component (gsi, bc, 1, true); | |
| 1501 } | |
| 1502 else | |
| 1503 br = bi = NULL_TREE; | |
| 1504 | |
| 1505 if (gimple_in_ssa_p (cfun)) | |
| 1506 { | |
| 1507 al = find_lattice_value (ac); | |
| 1508 if (al == UNINITIALIZED) | |
| 1509 al = VARYING; | |
| 1510 | |
| 1511 if (TREE_CODE_CLASS (code) == tcc_unary) | |
| 1512 bl = UNINITIALIZED; | |
| 1513 else if (ac == bc) | |
| 1514 bl = al; | |
| 1515 else | |
| 1516 { | |
| 1517 bl = find_lattice_value (bc); | |
| 1518 if (bl == UNINITIALIZED) | |
| 1519 bl = VARYING; | |
| 1520 } | |
| 1521 } | |
| 1522 else | |
| 1523 al = bl = VARYING; | |
| 1524 | |
| 1525 switch (code) | |
| 1526 { | |
| 1527 case PLUS_EXPR: | |
| 1528 case MINUS_EXPR: | |
| 1529 expand_complex_addition (gsi, inner_type, ar, ai, br, bi, code, al, bl); | |
| 1530 break; | |
| 1531 | |
| 1532 case MULT_EXPR: | |
| 1533 expand_complex_multiplication (gsi, inner_type, ar, ai, br, bi, al, bl); | |
| 1534 break; | |
| 1535 | |
| 1536 case TRUNC_DIV_EXPR: | |
| 1537 case CEIL_DIV_EXPR: | |
| 1538 case FLOOR_DIV_EXPR: | |
| 1539 case ROUND_DIV_EXPR: | |
| 1540 case RDIV_EXPR: | |
| 1541 expand_complex_division (gsi, inner_type, ar, ai, br, bi, code, al, bl); | |
| 1542 break; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1543 |
| 0 | 1544 case NEGATE_EXPR: |
| 1545 expand_complex_negation (gsi, inner_type, ar, ai); | |
| 1546 break; | |
| 1547 | |
| 1548 case CONJ_EXPR: | |
| 1549 expand_complex_conjugate (gsi, inner_type, ar, ai); | |
| 1550 break; | |
| 1551 | |
| 1552 case EQ_EXPR: | |
| 1553 case NE_EXPR: | |
| 1554 expand_complex_comparison (gsi, ar, ai, br, bi, code); | |
| 1555 break; | |
| 1556 | |
| 1557 default: | |
| 1558 gcc_unreachable (); | |
| 1559 } | |
| 1560 } | |
| 1561 | |
| 1562 | |
| 1563 /* Entry point for complex operation lowering during optimization. */ | |
| 1564 | |
| 1565 static unsigned int | |
| 1566 tree_lower_complex (void) | |
| 1567 { | |
| 1568 int old_last_basic_block; | |
| 1569 gimple_stmt_iterator gsi; | |
| 1570 basic_block bb; | |
| 1571 | |
| 1572 if (!init_dont_simulate_again ()) | |
| 1573 return 0; | |
| 1574 | |
| 1575 complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names); | |
| 1576 VEC_safe_grow_cleared (complex_lattice_t, heap, | |
| 1577 complex_lattice_values, num_ssa_names); | |
| 1578 | |
| 1579 init_parameter_lattice_values (); | |
| 1580 ssa_propagate (complex_visit_stmt, complex_visit_phi); | |
| 1581 | |
| 1582 complex_variable_components = htab_create (10, int_tree_map_hash, | |
| 1583 int_tree_map_eq, free); | |
| 1584 | |
| 1585 complex_ssa_name_components = VEC_alloc (tree, heap, 2*num_ssa_names); | |
| 1586 VEC_safe_grow_cleared (tree, heap, complex_ssa_name_components, | |
| 1587 2 * num_ssa_names); | |
| 1588 | |
| 1589 update_parameter_components (); | |
| 1590 | |
| 1591 /* ??? Ideally we'd traverse the blocks in breadth-first order. */ | |
| 1592 old_last_basic_block = last_basic_block; | |
| 1593 FOR_EACH_BB (bb) | |
| 1594 { | |
| 1595 if (bb->index >= old_last_basic_block) | |
| 1596 continue; | |
| 1597 | |
| 1598 update_phi_components (bb); | |
| 1599 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
| 1600 expand_complex_operations_1 (&gsi); | |
| 1601 } | |
| 1602 | |
| 1603 gsi_commit_edge_inserts (); | |
| 1604 | |
| 1605 htab_delete (complex_variable_components); | |
| 1606 VEC_free (tree, heap, complex_ssa_name_components); | |
| 1607 VEC_free (complex_lattice_t, heap, complex_lattice_values); | |
| 1608 return 0; | |
| 1609 } | |
| 1610 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1611 struct gimple_opt_pass pass_lower_complex = |
| 0 | 1612 { |
| 1613 { | |
| 1614 GIMPLE_PASS, | |
| 1615 "cplxlower", /* name */ | |
| 1616 0, /* gate */ | |
| 1617 tree_lower_complex, /* execute */ | |
| 1618 NULL, /* sub */ | |
| 1619 NULL, /* next */ | |
| 1620 0, /* static_pass_number */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1621 TV_NONE, /* tv_id */ |
| 0 | 1622 PROP_ssa, /* properties_required */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1623 PROP_gimple_lcx, /* properties_provided */ |
| 0 | 1624 0, /* properties_destroyed */ |
| 1625 0, /* todo_flags_start */ | |
| 1626 TODO_dump_func | |
| 1627 | TODO_ggc_collect | |
| 1628 | TODO_update_ssa | |
| 1629 | TODO_verify_stmts /* todo_flags_finish */ | |
| 1630 } | |
| 1631 }; | |
| 1632 | |
| 1633 | |
| 1634 static bool | |
| 1635 gate_no_optimization (void) | |
| 1636 { | |
| 1637 /* With errors, normal optimization passes are not run. If we don't | |
| 1638 lower complex operations at all, rtl expansion will abort. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1639 return !(cfun->curr_properties & PROP_gimple_lcx); |
| 0 | 1640 } |
| 1641 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1642 struct gimple_opt_pass pass_lower_complex_O0 = |
| 0 | 1643 { |
| 1644 { | |
| 1645 GIMPLE_PASS, | |
| 1646 "cplxlower0", /* name */ | |
| 1647 gate_no_optimization, /* gate */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1648 tree_lower_complex, /* execute */ |
| 0 | 1649 NULL, /* sub */ |
| 1650 NULL, /* next */ | |
| 1651 0, /* static_pass_number */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1652 TV_NONE, /* tv_id */ |
| 0 | 1653 PROP_cfg, /* properties_required */ |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1654 PROP_gimple_lcx, /* properties_provided */ |
| 0 | 1655 0, /* properties_destroyed */ |
| 1656 0, /* todo_flags_start */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1657 TODO_dump_func |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1658 | TODO_ggc_collect |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1659 | TODO_update_ssa |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1660 | TODO_verify_stmts /* todo_flags_finish */ |
| 0 | 1661 } |
| 1662 }; |