]>
Commit | Line | Data |
---|---|---|
ac182688 | 1 | /* Memory address lowering and addressing mode selection. |
35979cc2 | 2 | Copyright (C) 2004, 2006, 2007, 2008, 2009, 2010, 2011 |
c75c517d | 3 | Free Software Foundation, Inc. |
b8698a0f | 4 | |
ac182688 | 5 | This file is part of GCC. |
b8698a0f | 6 | |
ac182688 ZD |
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 | |
9dcd6f09 | 9 | Free Software Foundation; either version 3, or (at your option) any |
ac182688 | 10 | later version. |
b8698a0f | 11 | |
ac182688 ZD |
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. | |
b8698a0f | 16 | |
ac182688 | 17 | You should have received a copy of the GNU General Public License |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
ac182688 ZD |
20 | |
21 | /* Utility functions for manipulation with TARGET_MEM_REFs -- tree expressions | |
22 | that directly map to addressing modes of the target. */ | |
23 | ||
24 | #include "config.h" | |
25 | #include "system.h" | |
26 | #include "coretypes.h" | |
27 | #include "tm.h" | |
28 | #include "tree.h" | |
ac182688 | 29 | #include "tm_p.h" |
ac182688 ZD |
30 | #include "basic-block.h" |
31 | #include "output.h" | |
cf835838 | 32 | #include "tree-pretty-print.h" |
ac182688 ZD |
33 | #include "tree-flow.h" |
34 | #include "tree-dump.h" | |
35 | #include "tree-pass.h" | |
36 | #include "timevar.h" | |
37 | #include "flags.h" | |
38 | #include "tree-inline.h" | |
40013784 SB |
39 | #include "tree-affine.h" |
40 | ||
41 | /* FIXME: We compute address costs using RTL. */ | |
ac182688 | 42 | #include "insn-config.h" |
40013784 | 43 | #include "rtl.h" |
ac182688 ZD |
44 | #include "recog.h" |
45 | #include "expr.h" | |
46 | #include "ggc.h" | |
d4ebfa65 | 47 | #include "target.h" |
ac182688 ZD |
48 | |
49 | /* TODO -- handling of symbols (according to Richard Hendersons | |
50 | comments, http://gcc.gnu.org/ml/gcc-patches/2005-04/msg00949.html): | |
b8698a0f | 51 | |
ac182688 ZD |
52 | There are at least 5 different kinds of symbols that we can run up against: |
53 | ||
54 | (1) binds_local_p, small data area. | |
55 | (2) binds_local_p, eg local statics | |
56 | (3) !binds_local_p, eg global variables | |
57 | (4) thread local, local_exec | |
58 | (5) thread local, !local_exec | |
59 | ||
60 | Now, (1) won't appear often in an array context, but it certainly can. | |
61 | All you have to do is set -GN high enough, or explicitly mark any | |
62 | random object __attribute__((section (".sdata"))). | |
63 | ||
64 | All of these affect whether or not a symbol is in fact a valid address. | |
65 | The only one tested here is (3). And that result may very well | |
66 | be incorrect for (4) or (5). | |
67 | ||
68 | An incorrect result here does not cause incorrect results out the | |
69 | back end, because the expander in expr.c validizes the address. However | |
70 | it would be nice to improve the handling here in order to produce more | |
71 | precise results. */ | |
72 | ||
73 | /* A "template" for memory address, used to determine whether the address is | |
74 | valid for mode. */ | |
75 | ||
d4ebfa65 | 76 | typedef struct GTY (()) mem_addr_template { |
ac182688 ZD |
77 | rtx ref; /* The template. */ |
78 | rtx * GTY ((skip)) step_p; /* The point in template where the step should be | |
79 | filled in. */ | |
80 | rtx * GTY ((skip)) off_p; /* The point in template where the offset should | |
81 | be filled in. */ | |
d4ebfa65 | 82 | } mem_addr_template; |
ac182688 | 83 | |
d4ebfa65 BE |
84 | DEF_VEC_O (mem_addr_template); |
85 | DEF_VEC_ALLOC_O (mem_addr_template, gc); | |
ac182688 | 86 | |
d4ebfa65 BE |
87 | /* The templates. Each of the low five bits of the index corresponds to one |
88 | component of TARGET_MEM_REF being present, while the high bits identify | |
89 | the address space. See TEMPL_IDX. */ | |
ac182688 | 90 | |
d4ebfa65 BE |
91 | static GTY(()) VEC (mem_addr_template, gc) *mem_addr_template_list; |
92 | ||
93 | #define TEMPL_IDX(AS, SYMBOL, BASE, INDEX, STEP, OFFSET) \ | |
94 | (((int) (AS) << 5) \ | |
95 | | ((SYMBOL != 0) << 4) \ | |
ac182688 ZD |
96 | | ((BASE != 0) << 3) \ |
97 | | ((INDEX != 0) << 2) \ | |
98 | | ((STEP != 0) << 1) \ | |
99 | | (OFFSET != 0)) | |
100 | ||
101 | /* Stores address for memory reference with parameters SYMBOL, BASE, INDEX, | |
d4ebfa65 BE |
102 | STEP and OFFSET to *ADDR using address mode ADDRESS_MODE. Stores pointers |
103 | to where step is placed to *STEP_P and offset to *OFFSET_P. */ | |
ac182688 ZD |
104 | |
105 | static void | |
d4ebfa65 BE |
106 | gen_addr_rtx (enum machine_mode address_mode, |
107 | rtx symbol, rtx base, rtx index, rtx step, rtx offset, | |
ac182688 ZD |
108 | rtx *addr, rtx **step_p, rtx **offset_p) |
109 | { | |
110 | rtx act_elem; | |
111 | ||
112 | *addr = NULL_RTX; | |
113 | if (step_p) | |
114 | *step_p = NULL; | |
115 | if (offset_p) | |
116 | *offset_p = NULL; | |
117 | ||
118 | if (index) | |
119 | { | |
120 | act_elem = index; | |
121 | if (step) | |
122 | { | |
d4ebfa65 | 123 | act_elem = gen_rtx_MULT (address_mode, act_elem, step); |
ac182688 ZD |
124 | |
125 | if (step_p) | |
126 | *step_p = &XEXP (act_elem, 1); | |
127 | } | |
128 | ||
129 | *addr = act_elem; | |
130 | } | |
131 | ||
35979cc2 | 132 | if (base && base != const0_rtx) |
ac182688 ZD |
133 | { |
134 | if (*addr) | |
d4ebfa65 | 135 | *addr = simplify_gen_binary (PLUS, address_mode, base, *addr); |
ac182688 ZD |
136 | else |
137 | *addr = base; | |
138 | } | |
139 | ||
140 | if (symbol) | |
141 | { | |
142 | act_elem = symbol; | |
143 | if (offset) | |
144 | { | |
d4ebfa65 | 145 | act_elem = gen_rtx_PLUS (address_mode, act_elem, offset); |
8893239d | 146 | |
ac182688 | 147 | if (offset_p) |
8893239d RH |
148 | *offset_p = &XEXP (act_elem, 1); |
149 | ||
150 | if (GET_CODE (symbol) == SYMBOL_REF | |
151 | || GET_CODE (symbol) == LABEL_REF | |
152 | || GET_CODE (symbol) == CONST) | |
d4ebfa65 | 153 | act_elem = gen_rtx_CONST (address_mode, act_elem); |
ac182688 ZD |
154 | } |
155 | ||
156 | if (*addr) | |
d4ebfa65 | 157 | *addr = gen_rtx_PLUS (address_mode, *addr, act_elem); |
ac182688 ZD |
158 | else |
159 | *addr = act_elem; | |
160 | } | |
161 | else if (offset) | |
162 | { | |
163 | if (*addr) | |
164 | { | |
d4ebfa65 | 165 | *addr = gen_rtx_PLUS (address_mode, *addr, offset); |
ac182688 ZD |
166 | if (offset_p) |
167 | *offset_p = &XEXP (*addr, 1); | |
168 | } | |
169 | else | |
170 | { | |
171 | *addr = offset; | |
172 | if (offset_p) | |
173 | *offset_p = addr; | |
174 | } | |
175 | } | |
176 | ||
177 | if (!*addr) | |
178 | *addr = const0_rtx; | |
179 | } | |
180 | ||
d4ebfa65 BE |
181 | /* Returns address for TARGET_MEM_REF with parameters given by ADDR |
182 | in address space AS. | |
b8698a0f | 183 | If REALLY_EXPAND is false, just make fake registers instead |
ac182688 ZD |
184 | of really expanding the operands, and perform the expansion in-place |
185 | by using one of the "templates". */ | |
186 | ||
187 | rtx | |
d4ebfa65 BE |
188 | addr_for_mem_ref (struct mem_address *addr, addr_space_t as, |
189 | bool really_expand) | |
ac182688 | 190 | { |
d4ebfa65 | 191 | enum machine_mode address_mode = targetm.addr_space.address_mode (as); |
ac182688 | 192 | rtx address, sym, bse, idx, st, off; |
ac182688 ZD |
193 | struct mem_addr_template *templ; |
194 | ||
195 | if (addr->step && !integer_onep (addr->step)) | |
54fb1ae0 | 196 | st = immed_double_int_const (tree_to_double_int (addr->step), address_mode); |
ac182688 ZD |
197 | else |
198 | st = NULL_RTX; | |
199 | ||
200 | if (addr->offset && !integer_zerop (addr->offset)) | |
4b228e61 RG |
201 | off = immed_double_int_const |
202 | (double_int_sext (tree_to_double_int (addr->offset), | |
203 | TYPE_PRECISION (TREE_TYPE (addr->offset))), | |
204 | address_mode); | |
ac182688 ZD |
205 | else |
206 | off = NULL_RTX; | |
207 | ||
208 | if (!really_expand) | |
209 | { | |
d4ebfa65 BE |
210 | unsigned int templ_index |
211 | = TEMPL_IDX (as, addr->symbol, addr->base, addr->index, st, off); | |
212 | ||
213 | if (templ_index | |
214 | >= VEC_length (mem_addr_template, mem_addr_template_list)) | |
215 | VEC_safe_grow_cleared (mem_addr_template, gc, mem_addr_template_list, | |
216 | templ_index + 1); | |
217 | ||
ac182688 | 218 | /* Reuse the templates for addresses, so that we do not waste memory. */ |
d4ebfa65 BE |
219 | templ = VEC_index (mem_addr_template, mem_addr_template_list, templ_index); |
220 | if (!templ->ref) | |
ac182688 | 221 | { |
d4ebfa65 BE |
222 | sym = (addr->symbol ? |
223 | gen_rtx_SYMBOL_REF (address_mode, ggc_strdup ("test_symbol")) | |
224 | : NULL_RTX); | |
225 | bse = (addr->base ? | |
226 | gen_raw_REG (address_mode, LAST_VIRTUAL_REGISTER + 1) | |
227 | : NULL_RTX); | |
228 | idx = (addr->index ? | |
229 | gen_raw_REG (address_mode, LAST_VIRTUAL_REGISTER + 2) | |
230 | : NULL_RTX); | |
231 | ||
232 | gen_addr_rtx (address_mode, sym, bse, idx, | |
233 | st? const0_rtx : NULL_RTX, | |
234 | off? const0_rtx : NULL_RTX, | |
235 | &templ->ref, | |
236 | &templ->step_p, | |
237 | &templ->off_p); | |
ac182688 ZD |
238 | } |
239 | ||
ac182688 ZD |
240 | if (st) |
241 | *templ->step_p = st; | |
242 | if (off) | |
243 | *templ->off_p = off; | |
244 | ||
245 | return templ->ref; | |
246 | } | |
247 | ||
248 | /* Otherwise really expand the expressions. */ | |
249 | sym = (addr->symbol | |
23a534a1 | 250 | ? expand_expr (addr->symbol, NULL_RTX, address_mode, EXPAND_NORMAL) |
ac182688 ZD |
251 | : NULL_RTX); |
252 | bse = (addr->base | |
d4ebfa65 | 253 | ? expand_expr (addr->base, NULL_RTX, address_mode, EXPAND_NORMAL) |
ac182688 ZD |
254 | : NULL_RTX); |
255 | idx = (addr->index | |
d4ebfa65 | 256 | ? expand_expr (addr->index, NULL_RTX, address_mode, EXPAND_NORMAL) |
ac182688 ZD |
257 | : NULL_RTX); |
258 | ||
d4ebfa65 | 259 | gen_addr_rtx (address_mode, sym, bse, idx, st, off, &address, NULL, NULL); |
ac182688 ZD |
260 | return address; |
261 | } | |
262 | ||
263 | /* Returns address of MEM_REF in TYPE. */ | |
264 | ||
265 | tree | |
266 | tree_mem_ref_addr (tree type, tree mem_ref) | |
267 | { | |
820410e0 | 268 | tree addr; |
ac182688 ZD |
269 | tree act_elem; |
270 | tree step = TMR_STEP (mem_ref), offset = TMR_OFFSET (mem_ref); | |
820410e0 | 271 | tree addr_base = NULL_TREE, addr_off = NULL_TREE; |
ac182688 | 272 | |
4d948885 | 273 | addr_base = fold_convert (type, TMR_BASE (mem_ref)); |
ac182688 | 274 | |
820410e0 | 275 | act_elem = TMR_INDEX (mem_ref); |
ac182688 ZD |
276 | if (act_elem) |
277 | { | |
820410e0 ZD |
278 | if (step) |
279 | act_elem = fold_build2 (MULT_EXPR, sizetype, act_elem, step); | |
280 | addr_off = act_elem; | |
ac182688 ZD |
281 | } |
282 | ||
4d948885 | 283 | act_elem = TMR_INDEX2 (mem_ref); |
ac182688 ZD |
284 | if (act_elem) |
285 | { | |
820410e0 ZD |
286 | if (addr_off) |
287 | addr_off = fold_build2 (PLUS_EXPR, sizetype, addr_off, act_elem); | |
ac182688 | 288 | else |
820410e0 | 289 | addr_off = act_elem; |
ac182688 ZD |
290 | } |
291 | ||
6e682d7e | 292 | if (offset && !integer_zerop (offset)) |
ac182688 | 293 | { |
521fdcda | 294 | offset = fold_convert (sizetype, offset); |
820410e0 ZD |
295 | if (addr_off) |
296 | addr_off = fold_build2 (PLUS_EXPR, sizetype, addr_off, offset); | |
ac182688 | 297 | else |
820410e0 | 298 | addr_off = offset; |
ac182688 ZD |
299 | } |
300 | ||
820410e0 | 301 | if (addr_off) |
4d948885 | 302 | addr = fold_build2 (POINTER_PLUS_EXPR, type, addr_base, addr_off); |
820410e0 | 303 | else |
4d948885 | 304 | addr = addr_base; |
ac182688 ZD |
305 | |
306 | return addr; | |
307 | } | |
308 | ||
309 | /* Returns true if a memory reference in MODE and with parameters given by | |
310 | ADDR is valid on the current target. */ | |
311 | ||
312 | static bool | |
09e881c9 BE |
313 | valid_mem_ref_p (enum machine_mode mode, addr_space_t as, |
314 | struct mem_address *addr) | |
ac182688 ZD |
315 | { |
316 | rtx address; | |
317 | ||
d4ebfa65 | 318 | address = addr_for_mem_ref (addr, as, false); |
ac182688 ZD |
319 | if (!address) |
320 | return false; | |
321 | ||
09e881c9 | 322 | return memory_address_addr_space_p (mode, address, as); |
ac182688 ZD |
323 | } |
324 | ||
325 | /* Checks whether a TARGET_MEM_REF with type TYPE and parameters given by ADDR | |
326 | is valid on the current target and if so, creates and returns the | |
863a7578 | 327 | TARGET_MEM_REF. If VERIFY is false omit the verification step. */ |
ac182688 ZD |
328 | |
329 | static tree | |
863a7578 RB |
330 | create_mem_ref_raw (tree type, tree alias_ptr_type, struct mem_address *addr, |
331 | bool verify) | |
ac182688 | 332 | { |
4d948885 RG |
333 | tree base, index2; |
334 | ||
863a7578 RB |
335 | if (verify |
336 | && !valid_mem_ref_p (TYPE_MODE (type), TYPE_ADDR_SPACE (type), addr)) | |
ac182688 ZD |
337 | return NULL_TREE; |
338 | ||
339 | if (addr->step && integer_onep (addr->step)) | |
340 | addr->step = NULL_TREE; | |
341 | ||
4b228e61 RG |
342 | if (addr->offset) |
343 | addr->offset = fold_convert (alias_ptr_type, addr->offset); | |
344 | else | |
345 | addr->offset = build_int_cst (alias_ptr_type, 0); | |
ac182688 | 346 | |
4d948885 | 347 | if (addr->symbol) |
a41e5e86 | 348 | { |
4d948885 RG |
349 | base = addr->symbol; |
350 | index2 = addr->base; | |
351 | } | |
352 | else if (addr->base | |
353 | && POINTER_TYPE_P (TREE_TYPE (addr->base))) | |
354 | { | |
355 | base = addr->base; | |
356 | index2 = NULL_TREE; | |
a41e5e86 | 357 | } |
4d948885 RG |
358 | else |
359 | { | |
360 | base = build_int_cst (ptr_type_node, 0); | |
361 | index2 = addr->base; | |
362 | } | |
363 | ||
ac8e1875 RG |
364 | /* If possible use a plain MEM_REF instead of a TARGET_MEM_REF. |
365 | ??? As IVOPTs does not follow restrictions to where the base | |
366 | pointer may point to create a MEM_REF only if we know that | |
367 | base is valid. */ | |
35979cc2 | 368 | if ((TREE_CODE (base) == ADDR_EXPR || TREE_CODE (base) == INTEGER_CST) |
4d948885 RG |
369 | && (!index2 || integer_zerop (index2)) |
370 | && (!addr->index || integer_zerop (addr->index))) | |
371 | return fold_build2 (MEM_REF, type, base, addr->offset); | |
a41e5e86 | 372 | |
4b228e61 | 373 | return build5 (TARGET_MEM_REF, type, |
4d948885 | 374 | base, addr->offset, addr->index, addr->step, index2); |
ac182688 ZD |
375 | } |
376 | ||
377 | /* Returns true if OBJ is an object whose address is a link time constant. */ | |
378 | ||
379 | static bool | |
380 | fixed_address_object_p (tree obj) | |
381 | { | |
382 | return (TREE_CODE (obj) == VAR_DECL | |
383 | && (TREE_STATIC (obj) | |
8c51effa RG |
384 | || DECL_EXTERNAL (obj)) |
385 | && ! DECL_DLLIMPORT_P (obj)); | |
ac182688 ZD |
386 | } |
387 | ||
820410e0 ZD |
388 | /* If ADDR contains an address of object that is a link time constant, |
389 | move it to PARTS->symbol. */ | |
ac182688 ZD |
390 | |
391 | static void | |
820410e0 | 392 | move_fixed_address_to_symbol (struct mem_address *parts, aff_tree *addr) |
ac182688 | 393 | { |
820410e0 ZD |
394 | unsigned i; |
395 | tree val = NULL_TREE; | |
73f30c63 | 396 | |
820410e0 | 397 | for (i = 0; i < addr->n; i++) |
ac182688 | 398 | { |
820410e0 ZD |
399 | if (!double_int_one_p (addr->elts[i].coef)) |
400 | continue; | |
401 | ||
402 | val = addr->elts[i].val; | |
403 | if (TREE_CODE (val) == ADDR_EXPR | |
404 | && fixed_address_object_p (TREE_OPERAND (val, 0))) | |
405 | break; | |
ac182688 ZD |
406 | } |
407 | ||
820410e0 ZD |
408 | if (i == addr->n) |
409 | return; | |
410 | ||
23a534a1 | 411 | parts->symbol = val; |
820410e0 ZD |
412 | aff_combination_remove_elt (addr, i); |
413 | } | |
414 | ||
d7c0c068 UW |
415 | /* If ADDR contains an instance of BASE_HINT, move it to PARTS->base. */ |
416 | ||
417 | static void | |
418 | move_hint_to_base (tree type, struct mem_address *parts, tree base_hint, | |
419 | aff_tree *addr) | |
420 | { | |
421 | unsigned i; | |
422 | tree val = NULL_TREE; | |
5456cefc | 423 | int qual; |
d7c0c068 UW |
424 | |
425 | for (i = 0; i < addr->n; i++) | |
426 | { | |
427 | if (!double_int_one_p (addr->elts[i].coef)) | |
428 | continue; | |
429 | ||
430 | val = addr->elts[i].val; | |
431 | if (operand_equal_p (val, base_hint, 0)) | |
432 | break; | |
433 | } | |
434 | ||
435 | if (i == addr->n) | |
436 | return; | |
437 | ||
5456cefc UW |
438 | /* Cast value to appropriate pointer type. We cannot use a pointer |
439 | to TYPE directly, as the back-end will assume registers of pointer | |
440 | type are aligned, and just the base itself may not actually be. | |
441 | We use void pointer to the type's address space instead. */ | |
442 | qual = ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (type)); | |
443 | type = build_qualified_type (void_type_node, qual); | |
d7c0c068 UW |
444 | parts->base = fold_convert (build_pointer_type (type), val); |
445 | aff_combination_remove_elt (addr, i); | |
446 | } | |
447 | ||
820410e0 ZD |
448 | /* If ADDR contains an address of a dereferenced pointer, move it to |
449 | PARTS->base. */ | |
450 | ||
451 | static void | |
452 | move_pointer_to_base (struct mem_address *parts, aff_tree *addr) | |
453 | { | |
454 | unsigned i; | |
455 | tree val = NULL_TREE; | |
456 | ||
457 | for (i = 0; i < addr->n; i++) | |
ac182688 | 458 | { |
820410e0 ZD |
459 | if (!double_int_one_p (addr->elts[i].coef)) |
460 | continue; | |
461 | ||
462 | val = addr->elts[i].val; | |
463 | if (POINTER_TYPE_P (TREE_TYPE (val))) | |
464 | break; | |
ac182688 ZD |
465 | } |
466 | ||
820410e0 ZD |
467 | if (i == addr->n) |
468 | return; | |
469 | ||
470 | parts->base = val; | |
471 | aff_combination_remove_elt (addr, i); | |
472 | } | |
473 | ||
880a1451 XDL |
474 | /* Moves the loop variant part V in linear address ADDR to be the index |
475 | of PARTS. */ | |
476 | ||
477 | static void | |
478 | move_variant_to_index (struct mem_address *parts, aff_tree *addr, tree v) | |
479 | { | |
480 | unsigned i; | |
481 | tree val = NULL_TREE; | |
482 | ||
483 | gcc_assert (!parts->index); | |
484 | for (i = 0; i < addr->n; i++) | |
485 | { | |
486 | val = addr->elts[i].val; | |
487 | if (operand_equal_p (val, v, 0)) | |
488 | break; | |
489 | } | |
490 | ||
491 | if (i == addr->n) | |
492 | return; | |
493 | ||
494 | parts->index = fold_convert (sizetype, val); | |
495 | parts->step = double_int_to_tree (sizetype, addr->elts[i].coef); | |
496 | aff_combination_remove_elt (addr, i); | |
497 | } | |
498 | ||
820410e0 ZD |
499 | /* Adds ELT to PARTS. */ |
500 | ||
501 | static void | |
502 | add_to_parts (struct mem_address *parts, tree elt) | |
503 | { | |
504 | tree type; | |
505 | ||
ac182688 ZD |
506 | if (!parts->index) |
507 | { | |
5be014d5 | 508 | parts->index = fold_convert (sizetype, elt); |
ac182688 ZD |
509 | return; |
510 | } | |
511 | ||
820410e0 ZD |
512 | if (!parts->base) |
513 | { | |
514 | parts->base = elt; | |
515 | return; | |
516 | } | |
517 | ||
ac182688 | 518 | /* Add ELT to base. */ |
820410e0 | 519 | type = TREE_TYPE (parts->base); |
6fe2f65a RG |
520 | if (POINTER_TYPE_P (type)) |
521 | parts->base = fold_build2 (POINTER_PLUS_EXPR, type, | |
522 | parts->base, | |
523 | fold_convert (sizetype, elt)); | |
524 | else | |
525 | parts->base = fold_build2 (PLUS_EXPR, type, | |
526 | parts->base, elt); | |
ac182688 ZD |
527 | } |
528 | ||
529 | /* Finds the most expensive multiplication in ADDR that can be | |
530 | expressed in an addressing mode and move the corresponding | |
820410e0 | 531 | element(s) to PARTS. */ |
ac182688 ZD |
532 | |
533 | static void | |
d7c0c068 UW |
534 | most_expensive_mult_to_index (tree type, struct mem_address *parts, |
535 | aff_tree *addr, bool speed) | |
ac182688 | 536 | { |
d7c0c068 UW |
537 | addr_space_t as = TYPE_ADDR_SPACE (type); |
538 | enum machine_mode address_mode = targetm.addr_space.address_mode (as); | |
73f30c63 ZD |
539 | HOST_WIDE_INT coef; |
540 | double_int best_mult, amult, amult_neg; | |
ac182688 ZD |
541 | unsigned best_mult_cost = 0, acost; |
542 | tree mult_elt = NULL_TREE, elt; | |
543 | unsigned i, j; | |
73f30c63 | 544 | enum tree_code op_code; |
ac182688 | 545 | |
73f30c63 | 546 | best_mult = double_int_zero; |
ac182688 ZD |
547 | for (i = 0; i < addr->n; i++) |
548 | { | |
73f30c63 ZD |
549 | if (!double_int_fits_in_shwi_p (addr->elts[i].coef)) |
550 | continue; | |
551 | ||
73f30c63 ZD |
552 | coef = double_int_to_shwi (addr->elts[i].coef); |
553 | if (coef == 1 | |
d7c0c068 | 554 | || !multiplier_allowed_in_address_p (coef, TYPE_MODE (type), as)) |
ac182688 | 555 | continue; |
73f30c63 | 556 | |
d7c0c068 | 557 | acost = multiply_by_cost (coef, address_mode, speed); |
ac182688 ZD |
558 | |
559 | if (acost > best_mult_cost) | |
560 | { | |
561 | best_mult_cost = acost; | |
73f30c63 | 562 | best_mult = addr->elts[i].coef; |
ac182688 ZD |
563 | } |
564 | } | |
565 | ||
73f30c63 | 566 | if (!best_mult_cost) |
ac182688 ZD |
567 | return; |
568 | ||
73f30c63 | 569 | /* Collect elements multiplied by best_mult. */ |
ac182688 ZD |
570 | for (i = j = 0; i < addr->n; i++) |
571 | { | |
73f30c63 ZD |
572 | amult = addr->elts[i].coef; |
573 | amult_neg = double_int_ext_for_comb (double_int_neg (amult), addr); | |
b8698a0f | 574 | |
73f30c63 ZD |
575 | if (double_int_equal_p (amult, best_mult)) |
576 | op_code = PLUS_EXPR; | |
577 | else if (double_int_equal_p (amult_neg, best_mult)) | |
578 | op_code = MINUS_EXPR; | |
579 | else | |
ac182688 | 580 | { |
ac182688 ZD |
581 | addr->elts[j] = addr->elts[i]; |
582 | j++; | |
583 | continue; | |
584 | } | |
5be014d5 | 585 | |
820410e0 | 586 | elt = fold_convert (sizetype, addr->elts[i].val); |
73f30c63 | 587 | if (mult_elt) |
820410e0 | 588 | mult_elt = fold_build2 (op_code, sizetype, mult_elt, elt); |
73f30c63 | 589 | else if (op_code == PLUS_EXPR) |
ac182688 ZD |
590 | mult_elt = elt; |
591 | else | |
820410e0 | 592 | mult_elt = fold_build1 (NEGATE_EXPR, sizetype, elt); |
ac182688 ZD |
593 | } |
594 | addr->n = j; | |
b8698a0f | 595 | |
ac182688 | 596 | parts->index = mult_elt; |
820410e0 | 597 | parts->step = double_int_to_tree (sizetype, best_mult); |
ac182688 ZD |
598 | } |
599 | ||
d7c0c068 UW |
600 | /* Splits address ADDR for a memory access of type TYPE into PARTS. |
601 | If BASE_HINT is non-NULL, it specifies an SSA name to be used | |
880a1451 XDL |
602 | preferentially as base of the reference, and IV_CAND is the selected |
603 | iv candidate used in ADDR. | |
d7c0c068 | 604 | |
ac182688 ZD |
605 | TODO -- be more clever about the distribution of the elements of ADDR |
606 | to PARTS. Some architectures do not support anything but single | |
607 | register in address, possibly with a small integer offset; while | |
608 | create_mem_ref will simplify the address to an acceptable shape | |
73f30c63 ZD |
609 | later, it would be more efficient to know that asking for complicated |
610 | addressing modes is useless. */ | |
ac182688 ZD |
611 | |
612 | static void | |
880a1451 XDL |
613 | addr_to_parts (tree type, aff_tree *addr, tree iv_cand, |
614 | tree base_hint, struct mem_address *parts, | |
615 | bool speed) | |
ac182688 | 616 | { |
73f30c63 | 617 | tree part; |
ac182688 ZD |
618 | unsigned i; |
619 | ||
620 | parts->symbol = NULL_TREE; | |
621 | parts->base = NULL_TREE; | |
622 | parts->index = NULL_TREE; | |
623 | parts->step = NULL_TREE; | |
624 | ||
73f30c63 | 625 | if (!double_int_zero_p (addr->offset)) |
820410e0 | 626 | parts->offset = double_int_to_tree (sizetype, addr->offset); |
ac182688 ZD |
627 | else |
628 | parts->offset = NULL_TREE; | |
629 | ||
820410e0 ZD |
630 | /* Try to find a symbol. */ |
631 | move_fixed_address_to_symbol (parts, addr); | |
632 | ||
880a1451 XDL |
633 | /* No need to do address parts reassociation if the number of parts |
634 | is <= 2 -- in that case, no loop invariant code motion can be | |
635 | exposed. */ | |
636 | ||
637 | if (!base_hint && (addr->n > 2)) | |
638 | move_variant_to_index (parts, addr, iv_cand); | |
639 | ||
ac182688 ZD |
640 | /* First move the most expensive feasible multiplication |
641 | to index. */ | |
880a1451 XDL |
642 | if (!parts->index) |
643 | most_expensive_mult_to_index (type, parts, addr, speed); | |
820410e0 ZD |
644 | |
645 | /* Try to find a base of the reference. Since at the moment | |
646 | there is no reliable way how to distinguish between pointer and its | |
647 | offset, this is just a guess. */ | |
d7c0c068 UW |
648 | if (!parts->symbol && base_hint) |
649 | move_hint_to_base (type, parts, base_hint, addr); | |
650 | if (!parts->symbol && !parts->base) | |
820410e0 | 651 | move_pointer_to_base (parts, addr); |
ac182688 ZD |
652 | |
653 | /* Then try to process the remaining elements. */ | |
654 | for (i = 0; i < addr->n; i++) | |
73f30c63 | 655 | { |
820410e0 | 656 | part = fold_convert (sizetype, addr->elts[i].val); |
73f30c63 | 657 | if (!double_int_one_p (addr->elts[i].coef)) |
820410e0 ZD |
658 | part = fold_build2 (MULT_EXPR, sizetype, part, |
659 | double_int_to_tree (sizetype, addr->elts[i].coef)); | |
660 | add_to_parts (parts, part); | |
73f30c63 | 661 | } |
ac182688 | 662 | if (addr->rest) |
820410e0 | 663 | add_to_parts (parts, fold_convert (sizetype, addr->rest)); |
ac182688 ZD |
664 | } |
665 | ||
666 | /* Force the PARTS to register. */ | |
667 | ||
668 | static void | |
726a989a | 669 | gimplify_mem_ref_parts (gimple_stmt_iterator *gsi, struct mem_address *parts) |
ac182688 ZD |
670 | { |
671 | if (parts->base) | |
bcf71673 RG |
672 | parts->base = force_gimple_operand_gsi_1 (gsi, parts->base, |
673 | is_gimple_mem_ref_addr, NULL_TREE, | |
726a989a | 674 | true, GSI_SAME_STMT); |
ac182688 | 675 | if (parts->index) |
726a989a | 676 | parts->index = force_gimple_operand_gsi (gsi, parts->index, |
c6540bde | 677 | true, NULL_TREE, |
726a989a | 678 | true, GSI_SAME_STMT); |
ac182688 ZD |
679 | } |
680 | ||
681 | /* Creates and returns a TARGET_MEM_REF for address ADDR. If necessary | |
726a989a | 682 | computations are emitted in front of GSI. TYPE is the mode |
880a1451 XDL |
683 | of created memory reference. IV_CAND is the selected iv candidate in ADDR, |
684 | and BASE_HINT is non NULL if IV_CAND comes from a base address | |
685 | object. */ | |
ac182688 ZD |
686 | |
687 | tree | |
880a1451 XDL |
688 | create_mem_ref (gimple_stmt_iterator *gsi, tree type, aff_tree *addr, |
689 | tree alias_ptr_type, tree iv_cand, tree base_hint, bool speed) | |
ac182688 ZD |
690 | { |
691 | tree mem_ref, tmp; | |
69bd3423 | 692 | tree atype; |
ac182688 ZD |
693 | struct mem_address parts; |
694 | ||
880a1451 | 695 | addr_to_parts (type, addr, iv_cand, base_hint, &parts, speed); |
726a989a | 696 | gimplify_mem_ref_parts (gsi, &parts); |
863a7578 | 697 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
698 | if (mem_ref) |
699 | return mem_ref; | |
700 | ||
701 | /* The expression is too complicated. Try making it simpler. */ | |
702 | ||
703 | if (parts.step && !integer_onep (parts.step)) | |
704 | { | |
705 | /* Move the multiplication to index. */ | |
706 | gcc_assert (parts.index); | |
726a989a | 707 | parts.index = force_gimple_operand_gsi (gsi, |
820410e0 ZD |
708 | fold_build2 (MULT_EXPR, sizetype, |
709 | parts.index, parts.step), | |
726a989a | 710 | true, NULL_TREE, true, GSI_SAME_STMT); |
ac182688 | 711 | parts.step = NULL_TREE; |
b8698a0f | 712 | |
863a7578 | 713 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
714 | if (mem_ref) |
715 | return mem_ref; | |
716 | } | |
717 | ||
718 | if (parts.symbol) | |
719 | { | |
23a534a1 | 720 | tmp = parts.symbol; |
69bd3423 | 721 | gcc_assert (is_gimple_val (tmp)); |
b8698a0f | 722 | |
ac182688 ZD |
723 | /* Add the symbol to base, eventually forcing it to register. */ |
724 | if (parts.base) | |
39278c14 | 725 | { |
36618b93 | 726 | gcc_assert (useless_type_conversion_p |
5f787cbc | 727 | (sizetype, TREE_TYPE (parts.base))); |
69bd3423 | 728 | |
39278c14 | 729 | if (parts.index) |
69bd3423 ZD |
730 | { |
731 | atype = TREE_TYPE (tmp); | |
bcf71673 | 732 | parts.base = force_gimple_operand_gsi_1 (gsi, |
786ce82d RG |
733 | fold_build2 (POINTER_PLUS_EXPR, atype, |
734 | tmp, | |
735 | fold_convert (sizetype, parts.base)), | |
bcf71673 | 736 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
69bd3423 | 737 | } |
39278c14 AK |
738 | else |
739 | { | |
740 | parts.index = parts.base; | |
741 | parts.base = tmp; | |
742 | } | |
743 | } | |
ac182688 ZD |
744 | else |
745 | parts.base = tmp; | |
746 | parts.symbol = NULL_TREE; | |
747 | ||
863a7578 | 748 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
749 | if (mem_ref) |
750 | return mem_ref; | |
751 | } | |
752 | ||
820410e0 | 753 | if (parts.index) |
ac182688 | 754 | { |
820410e0 ZD |
755 | /* Add index to base. */ |
756 | if (parts.base) | |
757 | { | |
758 | atype = TREE_TYPE (parts.base); | |
bcf71673 | 759 | parts.base = force_gimple_operand_gsi_1 (gsi, |
903b3003 | 760 | fold_build2 (POINTER_PLUS_EXPR, atype, |
820410e0 | 761 | parts.base, |
903b3003 | 762 | parts.index), |
bcf71673 | 763 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
820410e0 | 764 | } |
ac182688 | 765 | else |
820410e0 ZD |
766 | parts.base = parts.index; |
767 | parts.index = NULL_TREE; | |
ac182688 | 768 | |
863a7578 | 769 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
770 | if (mem_ref) |
771 | return mem_ref; | |
772 | } | |
773 | ||
774 | if (parts.offset && !integer_zerop (parts.offset)) | |
775 | { | |
820410e0 ZD |
776 | /* Try adding offset to base. */ |
777 | if (parts.base) | |
778 | { | |
779 | atype = TREE_TYPE (parts.base); | |
bcf71673 | 780 | parts.base = force_gimple_operand_gsi_1 (gsi, |
5be014d5 | 781 | fold_build2 (POINTER_PLUS_EXPR, atype, |
820410e0 | 782 | parts.base, |
5be014d5 | 783 | fold_convert (sizetype, parts.offset)), |
bcf71673 | 784 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
820410e0 | 785 | } |
ac182688 | 786 | else |
cdd76d88 | 787 | parts.base = parts.offset; |
ac182688 ZD |
788 | |
789 | parts.offset = NULL_TREE; | |
790 | ||
863a7578 | 791 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
792 | if (mem_ref) |
793 | return mem_ref; | |
794 | } | |
795 | ||
796 | /* Verify that the address is in the simplest possible shape | |
797 | (only a register). If we cannot create such a memory reference, | |
798 | something is really wrong. */ | |
799 | gcc_assert (parts.symbol == NULL_TREE); | |
820410e0 | 800 | gcc_assert (parts.index == NULL_TREE); |
ac182688 ZD |
801 | gcc_assert (!parts.step || integer_onep (parts.step)); |
802 | gcc_assert (!parts.offset || integer_zerop (parts.offset)); | |
803 | gcc_unreachable (); | |
804 | } | |
805 | ||
806 | /* Copies components of the address from OP to ADDR. */ | |
807 | ||
808 | void | |
809 | get_address_description (tree op, struct mem_address *addr) | |
810 | { | |
4d948885 RG |
811 | if (TREE_CODE (TMR_BASE (op)) == ADDR_EXPR) |
812 | { | |
813 | addr->symbol = TMR_BASE (op); | |
814 | addr->base = TMR_INDEX2 (op); | |
815 | } | |
816 | else | |
817 | { | |
818 | addr->symbol = NULL_TREE; | |
819 | if (TMR_INDEX2 (op)) | |
820 | { | |
821 | gcc_assert (integer_zerop (TMR_BASE (op))); | |
822 | addr->base = TMR_INDEX2 (op); | |
823 | } | |
824 | else | |
825 | addr->base = TMR_BASE (op); | |
826 | } | |
ac182688 ZD |
827 | addr->index = TMR_INDEX (op); |
828 | addr->step = TMR_STEP (op); | |
829 | addr->offset = TMR_OFFSET (op); | |
830 | } | |
831 | ||
832 | /* Copies the additional information attached to target_mem_ref FROM to TO. */ | |
833 | ||
834 | void | |
835 | copy_mem_ref_info (tree to, tree from) | |
836 | { | |
ac182688 | 837 | /* And the info about the original reference. */ |
5e9fb3db RG |
838 | TREE_SIDE_EFFECTS (to) = TREE_SIDE_EFFECTS (from); |
839 | TREE_THIS_VOLATILE (to) = TREE_THIS_VOLATILE (from); | |
ac182688 ZD |
840 | } |
841 | ||
842 | /* Move constants in target_mem_ref REF to offset. Returns the new target | |
843 | mem ref if anything changes, NULL_TREE otherwise. */ | |
844 | ||
845 | tree | |
846 | maybe_fold_tmr (tree ref) | |
847 | { | |
848 | struct mem_address addr; | |
849 | bool changed = false; | |
850 | tree ret, off; | |
851 | ||
852 | get_address_description (ref, &addr); | |
853 | ||
4d948885 RG |
854 | if (addr.base |
855 | && TREE_CODE (addr.base) == INTEGER_CST | |
856 | && !integer_zerop (addr.base)) | |
ac182688 | 857 | { |
4b228e61 RG |
858 | addr.offset = fold_binary_to_constant (PLUS_EXPR, |
859 | TREE_TYPE (addr.offset), | |
860 | addr.offset, addr.base); | |
ac182688 ZD |
861 | addr.base = NULL_TREE; |
862 | changed = true; | |
863 | } | |
864 | ||
4d948885 RG |
865 | if (addr.symbol |
866 | && TREE_CODE (TREE_OPERAND (addr.symbol, 0)) == MEM_REF) | |
867 | { | |
868 | addr.offset = fold_binary_to_constant | |
869 | (PLUS_EXPR, TREE_TYPE (addr.offset), | |
870 | addr.offset, | |
871 | TREE_OPERAND (TREE_OPERAND (addr.symbol, 0), 1)); | |
872 | addr.symbol = TREE_OPERAND (TREE_OPERAND (addr.symbol, 0), 0); | |
873 | changed = true; | |
874 | } | |
875 | else if (addr.symbol | |
876 | && handled_component_p (TREE_OPERAND (addr.symbol, 0))) | |
877 | { | |
878 | HOST_WIDE_INT offset; | |
879 | addr.symbol = build_fold_addr_expr | |
880 | (get_addr_base_and_unit_offset | |
881 | (TREE_OPERAND (addr.symbol, 0), &offset)); | |
882 | addr.offset = int_const_binop (PLUS_EXPR, | |
d35936ab | 883 | addr.offset, size_int (offset)); |
4d948885 RG |
884 | changed = true; |
885 | } | |
886 | ||
ac182688 ZD |
887 | if (addr.index && TREE_CODE (addr.index) == INTEGER_CST) |
888 | { | |
889 | off = addr.index; | |
890 | if (addr.step) | |
891 | { | |
820410e0 | 892 | off = fold_binary_to_constant (MULT_EXPR, sizetype, |
ac182688 ZD |
893 | off, addr.step); |
894 | addr.step = NULL_TREE; | |
895 | } | |
896 | ||
4b228e61 RG |
897 | addr.offset = fold_binary_to_constant (PLUS_EXPR, |
898 | TREE_TYPE (addr.offset), | |
899 | addr.offset, off); | |
ac182688 ZD |
900 | addr.index = NULL_TREE; |
901 | changed = true; | |
902 | } | |
903 | ||
904 | if (!changed) | |
905 | return NULL_TREE; | |
b8698a0f | 906 | |
863a7578 RB |
907 | /* If we have propagated something into this TARGET_MEM_REF and thus |
908 | ended up folding it, always create a new TARGET_MEM_REF regardless | |
909 | if it is valid in this for on the target - the propagation result | |
910 | wouldn't be anyway. */ | |
911 | ret = create_mem_ref_raw (TREE_TYPE (ref), | |
912 | TREE_TYPE (addr.offset), &addr, false); | |
ac182688 ZD |
913 | copy_mem_ref_info (ret, ref); |
914 | return ret; | |
915 | } | |
916 | ||
917 | /* Dump PARTS to FILE. */ | |
918 | ||
919 | extern void dump_mem_address (FILE *, struct mem_address *); | |
920 | void | |
921 | dump_mem_address (FILE *file, struct mem_address *parts) | |
922 | { | |
923 | if (parts->symbol) | |
924 | { | |
925 | fprintf (file, "symbol: "); | |
23a534a1 | 926 | print_generic_expr (file, TREE_OPERAND (parts->symbol, 0), TDF_SLIM); |
ac182688 ZD |
927 | fprintf (file, "\n"); |
928 | } | |
929 | if (parts->base) | |
930 | { | |
931 | fprintf (file, "base: "); | |
932 | print_generic_expr (file, parts->base, TDF_SLIM); | |
933 | fprintf (file, "\n"); | |
934 | } | |
935 | if (parts->index) | |
936 | { | |
937 | fprintf (file, "index: "); | |
938 | print_generic_expr (file, parts->index, TDF_SLIM); | |
939 | fprintf (file, "\n"); | |
940 | } | |
941 | if (parts->step) | |
942 | { | |
943 | fprintf (file, "step: "); | |
944 | print_generic_expr (file, parts->step, TDF_SLIM); | |
945 | fprintf (file, "\n"); | |
946 | } | |
947 | if (parts->offset) | |
948 | { | |
949 | fprintf (file, "offset: "); | |
950 | print_generic_expr (file, parts->offset, TDF_SLIM); | |
951 | fprintf (file, "\n"); | |
952 | } | |
953 | } | |
954 | ||
955 | #include "gt-tree-ssa-address.h" |