]>
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); |
a369b639 | 192 | enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as); |
ac182688 | 193 | rtx address, sym, bse, idx, st, off; |
ac182688 ZD |
194 | struct mem_addr_template *templ; |
195 | ||
196 | if (addr->step && !integer_onep (addr->step)) | |
a369b639 | 197 | st = immed_double_int_const (tree_to_double_int (addr->step), pointer_mode); |
ac182688 ZD |
198 | else |
199 | st = NULL_RTX; | |
200 | ||
201 | if (addr->offset && !integer_zerop (addr->offset)) | |
4b228e61 RG |
202 | off = immed_double_int_const |
203 | (double_int_sext (tree_to_double_int (addr->offset), | |
204 | TYPE_PRECISION (TREE_TYPE (addr->offset))), | |
a369b639 | 205 | pointer_mode); |
ac182688 ZD |
206 | else |
207 | off = NULL_RTX; | |
208 | ||
209 | if (!really_expand) | |
210 | { | |
d4ebfa65 BE |
211 | unsigned int templ_index |
212 | = TEMPL_IDX (as, addr->symbol, addr->base, addr->index, st, off); | |
213 | ||
214 | if (templ_index | |
215 | >= VEC_length (mem_addr_template, mem_addr_template_list)) | |
216 | VEC_safe_grow_cleared (mem_addr_template, gc, mem_addr_template_list, | |
217 | templ_index + 1); | |
218 | ||
ac182688 | 219 | /* Reuse the templates for addresses, so that we do not waste memory. */ |
d4ebfa65 BE |
220 | templ = VEC_index (mem_addr_template, mem_addr_template_list, templ_index); |
221 | if (!templ->ref) | |
ac182688 | 222 | { |
d4ebfa65 | 223 | sym = (addr->symbol ? |
a369b639 | 224 | gen_rtx_SYMBOL_REF (pointer_mode, ggc_strdup ("test_symbol")) |
d4ebfa65 BE |
225 | : NULL_RTX); |
226 | bse = (addr->base ? | |
a369b639 | 227 | gen_raw_REG (pointer_mode, LAST_VIRTUAL_REGISTER + 1) |
d4ebfa65 BE |
228 | : NULL_RTX); |
229 | idx = (addr->index ? | |
a369b639 | 230 | gen_raw_REG (pointer_mode, LAST_VIRTUAL_REGISTER + 2) |
d4ebfa65 BE |
231 | : NULL_RTX); |
232 | ||
a369b639 | 233 | gen_addr_rtx (pointer_mode, sym, bse, idx, |
d4ebfa65 BE |
234 | st? const0_rtx : NULL_RTX, |
235 | off? const0_rtx : NULL_RTX, | |
236 | &templ->ref, | |
237 | &templ->step_p, | |
238 | &templ->off_p); | |
ac182688 ZD |
239 | } |
240 | ||
ac182688 ZD |
241 | if (st) |
242 | *templ->step_p = st; | |
243 | if (off) | |
244 | *templ->off_p = off; | |
245 | ||
246 | return templ->ref; | |
247 | } | |
248 | ||
249 | /* Otherwise really expand the expressions. */ | |
250 | sym = (addr->symbol | |
a369b639 | 251 | ? expand_expr (addr->symbol, NULL_RTX, pointer_mode, EXPAND_NORMAL) |
ac182688 ZD |
252 | : NULL_RTX); |
253 | bse = (addr->base | |
a369b639 | 254 | ? expand_expr (addr->base, NULL_RTX, pointer_mode, EXPAND_NORMAL) |
ac182688 ZD |
255 | : NULL_RTX); |
256 | idx = (addr->index | |
a369b639 | 257 | ? expand_expr (addr->index, NULL_RTX, pointer_mode, EXPAND_NORMAL) |
ac182688 ZD |
258 | : NULL_RTX); |
259 | ||
a369b639 L |
260 | gen_addr_rtx (pointer_mode, sym, bse, idx, st, off, &address, NULL, NULL); |
261 | if (pointer_mode != address_mode) | |
262 | address = convert_memory_address (address_mode, address); | |
ac182688 ZD |
263 | return address; |
264 | } | |
265 | ||
266 | /* Returns address of MEM_REF in TYPE. */ | |
267 | ||
268 | tree | |
269 | tree_mem_ref_addr (tree type, tree mem_ref) | |
270 | { | |
820410e0 | 271 | tree addr; |
ac182688 ZD |
272 | tree act_elem; |
273 | tree step = TMR_STEP (mem_ref), offset = TMR_OFFSET (mem_ref); | |
820410e0 | 274 | tree addr_base = NULL_TREE, addr_off = NULL_TREE; |
ac182688 | 275 | |
4d948885 | 276 | addr_base = fold_convert (type, TMR_BASE (mem_ref)); |
ac182688 | 277 | |
820410e0 | 278 | act_elem = TMR_INDEX (mem_ref); |
ac182688 ZD |
279 | if (act_elem) |
280 | { | |
820410e0 | 281 | if (step) |
0d82a1c8 RG |
282 | act_elem = fold_build2 (MULT_EXPR, TREE_TYPE (act_elem), |
283 | act_elem, step); | |
820410e0 | 284 | addr_off = act_elem; |
ac182688 ZD |
285 | } |
286 | ||
4d948885 | 287 | act_elem = TMR_INDEX2 (mem_ref); |
ac182688 ZD |
288 | if (act_elem) |
289 | { | |
820410e0 | 290 | if (addr_off) |
0d82a1c8 RG |
291 | addr_off = fold_build2 (PLUS_EXPR, TREE_TYPE (addr_off), |
292 | addr_off, act_elem); | |
ac182688 | 293 | else |
820410e0 | 294 | addr_off = act_elem; |
ac182688 ZD |
295 | } |
296 | ||
6e682d7e | 297 | if (offset && !integer_zerop (offset)) |
ac182688 | 298 | { |
820410e0 | 299 | if (addr_off) |
0d82a1c8 RG |
300 | addr_off = fold_build2 (PLUS_EXPR, TREE_TYPE (addr_off), addr_off, |
301 | fold_convert (TREE_TYPE (addr_off), offset)); | |
ac182688 | 302 | else |
820410e0 | 303 | addr_off = offset; |
ac182688 ZD |
304 | } |
305 | ||
820410e0 | 306 | if (addr_off) |
5d49b6a7 | 307 | addr = fold_build_pointer_plus (addr_base, addr_off); |
820410e0 | 308 | else |
4d948885 | 309 | addr = addr_base; |
ac182688 ZD |
310 | |
311 | return addr; | |
312 | } | |
313 | ||
314 | /* Returns true if a memory reference in MODE and with parameters given by | |
315 | ADDR is valid on the current target. */ | |
316 | ||
317 | static bool | |
09e881c9 BE |
318 | valid_mem_ref_p (enum machine_mode mode, addr_space_t as, |
319 | struct mem_address *addr) | |
ac182688 ZD |
320 | { |
321 | rtx address; | |
322 | ||
d4ebfa65 | 323 | address = addr_for_mem_ref (addr, as, false); |
ac182688 ZD |
324 | if (!address) |
325 | return false; | |
326 | ||
09e881c9 | 327 | return memory_address_addr_space_p (mode, address, as); |
ac182688 ZD |
328 | } |
329 | ||
330 | /* Checks whether a TARGET_MEM_REF with type TYPE and parameters given by ADDR | |
331 | is valid on the current target and if so, creates and returns the | |
863a7578 | 332 | TARGET_MEM_REF. If VERIFY is false omit the verification step. */ |
ac182688 ZD |
333 | |
334 | static tree | |
863a7578 RB |
335 | create_mem_ref_raw (tree type, tree alias_ptr_type, struct mem_address *addr, |
336 | bool verify) | |
ac182688 | 337 | { |
4d948885 RG |
338 | tree base, index2; |
339 | ||
863a7578 RB |
340 | if (verify |
341 | && !valid_mem_ref_p (TYPE_MODE (type), TYPE_ADDR_SPACE (type), addr)) | |
ac182688 ZD |
342 | return NULL_TREE; |
343 | ||
344 | if (addr->step && integer_onep (addr->step)) | |
345 | addr->step = NULL_TREE; | |
346 | ||
4b228e61 RG |
347 | if (addr->offset) |
348 | addr->offset = fold_convert (alias_ptr_type, addr->offset); | |
349 | else | |
350 | addr->offset = build_int_cst (alias_ptr_type, 0); | |
ac182688 | 351 | |
4d948885 | 352 | if (addr->symbol) |
a41e5e86 | 353 | { |
4d948885 RG |
354 | base = addr->symbol; |
355 | index2 = addr->base; | |
356 | } | |
357 | else if (addr->base | |
358 | && POINTER_TYPE_P (TREE_TYPE (addr->base))) | |
359 | { | |
360 | base = addr->base; | |
361 | index2 = NULL_TREE; | |
a41e5e86 | 362 | } |
4d948885 RG |
363 | else |
364 | { | |
365 | base = build_int_cst (ptr_type_node, 0); | |
366 | index2 = addr->base; | |
367 | } | |
368 | ||
ac8e1875 RG |
369 | /* If possible use a plain MEM_REF instead of a TARGET_MEM_REF. |
370 | ??? As IVOPTs does not follow restrictions to where the base | |
371 | pointer may point to create a MEM_REF only if we know that | |
372 | base is valid. */ | |
35979cc2 | 373 | if ((TREE_CODE (base) == ADDR_EXPR || TREE_CODE (base) == INTEGER_CST) |
4d948885 RG |
374 | && (!index2 || integer_zerop (index2)) |
375 | && (!addr->index || integer_zerop (addr->index))) | |
376 | return fold_build2 (MEM_REF, type, base, addr->offset); | |
a41e5e86 | 377 | |
4b228e61 | 378 | return build5 (TARGET_MEM_REF, type, |
4d948885 | 379 | base, addr->offset, addr->index, addr->step, index2); |
ac182688 ZD |
380 | } |
381 | ||
382 | /* Returns true if OBJ is an object whose address is a link time constant. */ | |
383 | ||
384 | static bool | |
385 | fixed_address_object_p (tree obj) | |
386 | { | |
387 | return (TREE_CODE (obj) == VAR_DECL | |
388 | && (TREE_STATIC (obj) | |
8c51effa RG |
389 | || DECL_EXTERNAL (obj)) |
390 | && ! DECL_DLLIMPORT_P (obj)); | |
ac182688 ZD |
391 | } |
392 | ||
820410e0 ZD |
393 | /* If ADDR contains an address of object that is a link time constant, |
394 | move it to PARTS->symbol. */ | |
ac182688 ZD |
395 | |
396 | static void | |
820410e0 | 397 | move_fixed_address_to_symbol (struct mem_address *parts, aff_tree *addr) |
ac182688 | 398 | { |
820410e0 ZD |
399 | unsigned i; |
400 | tree val = NULL_TREE; | |
73f30c63 | 401 | |
820410e0 | 402 | for (i = 0; i < addr->n; i++) |
ac182688 | 403 | { |
820410e0 ZD |
404 | if (!double_int_one_p (addr->elts[i].coef)) |
405 | continue; | |
406 | ||
407 | val = addr->elts[i].val; | |
408 | if (TREE_CODE (val) == ADDR_EXPR | |
409 | && fixed_address_object_p (TREE_OPERAND (val, 0))) | |
410 | break; | |
ac182688 ZD |
411 | } |
412 | ||
820410e0 ZD |
413 | if (i == addr->n) |
414 | return; | |
415 | ||
23a534a1 | 416 | parts->symbol = val; |
820410e0 ZD |
417 | aff_combination_remove_elt (addr, i); |
418 | } | |
419 | ||
d7c0c068 UW |
420 | /* If ADDR contains an instance of BASE_HINT, move it to PARTS->base. */ |
421 | ||
422 | static void | |
423 | move_hint_to_base (tree type, struct mem_address *parts, tree base_hint, | |
424 | aff_tree *addr) | |
425 | { | |
426 | unsigned i; | |
427 | tree val = NULL_TREE; | |
5456cefc | 428 | int qual; |
d7c0c068 UW |
429 | |
430 | for (i = 0; i < addr->n; i++) | |
431 | { | |
432 | if (!double_int_one_p (addr->elts[i].coef)) | |
433 | continue; | |
434 | ||
435 | val = addr->elts[i].val; | |
436 | if (operand_equal_p (val, base_hint, 0)) | |
437 | break; | |
438 | } | |
439 | ||
440 | if (i == addr->n) | |
441 | return; | |
442 | ||
5456cefc UW |
443 | /* Cast value to appropriate pointer type. We cannot use a pointer |
444 | to TYPE directly, as the back-end will assume registers of pointer | |
445 | type are aligned, and just the base itself may not actually be. | |
446 | We use void pointer to the type's address space instead. */ | |
447 | qual = ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (type)); | |
448 | type = build_qualified_type (void_type_node, qual); | |
d7c0c068 UW |
449 | parts->base = fold_convert (build_pointer_type (type), val); |
450 | aff_combination_remove_elt (addr, i); | |
451 | } | |
452 | ||
820410e0 ZD |
453 | /* If ADDR contains an address of a dereferenced pointer, move it to |
454 | PARTS->base. */ | |
455 | ||
456 | static void | |
457 | move_pointer_to_base (struct mem_address *parts, aff_tree *addr) | |
458 | { | |
459 | unsigned i; | |
460 | tree val = NULL_TREE; | |
461 | ||
462 | for (i = 0; i < addr->n; i++) | |
ac182688 | 463 | { |
820410e0 ZD |
464 | if (!double_int_one_p (addr->elts[i].coef)) |
465 | continue; | |
466 | ||
467 | val = addr->elts[i].val; | |
468 | if (POINTER_TYPE_P (TREE_TYPE (val))) | |
469 | break; | |
ac182688 ZD |
470 | } |
471 | ||
820410e0 ZD |
472 | if (i == addr->n) |
473 | return; | |
474 | ||
475 | parts->base = val; | |
476 | aff_combination_remove_elt (addr, i); | |
477 | } | |
478 | ||
880a1451 XDL |
479 | /* Moves the loop variant part V in linear address ADDR to be the index |
480 | of PARTS. */ | |
481 | ||
482 | static void | |
483 | move_variant_to_index (struct mem_address *parts, aff_tree *addr, tree v) | |
484 | { | |
485 | unsigned i; | |
486 | tree val = NULL_TREE; | |
487 | ||
488 | gcc_assert (!parts->index); | |
489 | for (i = 0; i < addr->n; i++) | |
490 | { | |
491 | val = addr->elts[i].val; | |
492 | if (operand_equal_p (val, v, 0)) | |
493 | break; | |
494 | } | |
495 | ||
496 | if (i == addr->n) | |
497 | return; | |
498 | ||
499 | parts->index = fold_convert (sizetype, val); | |
500 | parts->step = double_int_to_tree (sizetype, addr->elts[i].coef); | |
501 | aff_combination_remove_elt (addr, i); | |
502 | } | |
503 | ||
820410e0 ZD |
504 | /* Adds ELT to PARTS. */ |
505 | ||
506 | static void | |
507 | add_to_parts (struct mem_address *parts, tree elt) | |
508 | { | |
509 | tree type; | |
510 | ||
ac182688 ZD |
511 | if (!parts->index) |
512 | { | |
5be014d5 | 513 | parts->index = fold_convert (sizetype, elt); |
ac182688 ZD |
514 | return; |
515 | } | |
516 | ||
820410e0 ZD |
517 | if (!parts->base) |
518 | { | |
519 | parts->base = elt; | |
520 | return; | |
521 | } | |
522 | ||
ac182688 | 523 | /* Add ELT to base. */ |
820410e0 | 524 | type = TREE_TYPE (parts->base); |
6fe2f65a | 525 | if (POINTER_TYPE_P (type)) |
5d49b6a7 | 526 | parts->base = fold_build_pointer_plus (parts->base, elt); |
6fe2f65a RG |
527 | else |
528 | parts->base = fold_build2 (PLUS_EXPR, type, | |
529 | parts->base, elt); | |
ac182688 ZD |
530 | } |
531 | ||
532 | /* Finds the most expensive multiplication in ADDR that can be | |
533 | expressed in an addressing mode and move the corresponding | |
820410e0 | 534 | element(s) to PARTS. */ |
ac182688 ZD |
535 | |
536 | static void | |
d7c0c068 UW |
537 | most_expensive_mult_to_index (tree type, struct mem_address *parts, |
538 | aff_tree *addr, bool speed) | |
ac182688 | 539 | { |
d7c0c068 UW |
540 | addr_space_t as = TYPE_ADDR_SPACE (type); |
541 | enum machine_mode address_mode = targetm.addr_space.address_mode (as); | |
73f30c63 ZD |
542 | HOST_WIDE_INT coef; |
543 | double_int best_mult, amult, amult_neg; | |
ac182688 ZD |
544 | unsigned best_mult_cost = 0, acost; |
545 | tree mult_elt = NULL_TREE, elt; | |
546 | unsigned i, j; | |
73f30c63 | 547 | enum tree_code op_code; |
ac182688 | 548 | |
73f30c63 | 549 | best_mult = double_int_zero; |
ac182688 ZD |
550 | for (i = 0; i < addr->n; i++) |
551 | { | |
73f30c63 ZD |
552 | if (!double_int_fits_in_shwi_p (addr->elts[i].coef)) |
553 | continue; | |
554 | ||
73f30c63 ZD |
555 | coef = double_int_to_shwi (addr->elts[i].coef); |
556 | if (coef == 1 | |
d7c0c068 | 557 | || !multiplier_allowed_in_address_p (coef, TYPE_MODE (type), as)) |
ac182688 | 558 | continue; |
73f30c63 | 559 | |
d7c0c068 | 560 | acost = multiply_by_cost (coef, address_mode, speed); |
ac182688 ZD |
561 | |
562 | if (acost > best_mult_cost) | |
563 | { | |
564 | best_mult_cost = acost; | |
73f30c63 | 565 | best_mult = addr->elts[i].coef; |
ac182688 ZD |
566 | } |
567 | } | |
568 | ||
73f30c63 | 569 | if (!best_mult_cost) |
ac182688 ZD |
570 | return; |
571 | ||
73f30c63 | 572 | /* Collect elements multiplied by best_mult. */ |
ac182688 ZD |
573 | for (i = j = 0; i < addr->n; i++) |
574 | { | |
73f30c63 ZD |
575 | amult = addr->elts[i].coef; |
576 | amult_neg = double_int_ext_for_comb (double_int_neg (amult), addr); | |
b8698a0f | 577 | |
73f30c63 ZD |
578 | if (double_int_equal_p (amult, best_mult)) |
579 | op_code = PLUS_EXPR; | |
580 | else if (double_int_equal_p (amult_neg, best_mult)) | |
581 | op_code = MINUS_EXPR; | |
582 | else | |
ac182688 | 583 | { |
ac182688 ZD |
584 | addr->elts[j] = addr->elts[i]; |
585 | j++; | |
586 | continue; | |
587 | } | |
5be014d5 | 588 | |
820410e0 | 589 | elt = fold_convert (sizetype, addr->elts[i].val); |
73f30c63 | 590 | if (mult_elt) |
820410e0 | 591 | mult_elt = fold_build2 (op_code, sizetype, mult_elt, elt); |
73f30c63 | 592 | else if (op_code == PLUS_EXPR) |
ac182688 ZD |
593 | mult_elt = elt; |
594 | else | |
820410e0 | 595 | mult_elt = fold_build1 (NEGATE_EXPR, sizetype, elt); |
ac182688 ZD |
596 | } |
597 | addr->n = j; | |
b8698a0f | 598 | |
ac182688 | 599 | parts->index = mult_elt; |
820410e0 | 600 | parts->step = double_int_to_tree (sizetype, best_mult); |
ac182688 ZD |
601 | } |
602 | ||
d7c0c068 UW |
603 | /* Splits address ADDR for a memory access of type TYPE into PARTS. |
604 | If BASE_HINT is non-NULL, it specifies an SSA name to be used | |
880a1451 XDL |
605 | preferentially as base of the reference, and IV_CAND is the selected |
606 | iv candidate used in ADDR. | |
d7c0c068 | 607 | |
ac182688 ZD |
608 | TODO -- be more clever about the distribution of the elements of ADDR |
609 | to PARTS. Some architectures do not support anything but single | |
610 | register in address, possibly with a small integer offset; while | |
611 | create_mem_ref will simplify the address to an acceptable shape | |
73f30c63 ZD |
612 | later, it would be more efficient to know that asking for complicated |
613 | addressing modes is useless. */ | |
ac182688 ZD |
614 | |
615 | static void | |
880a1451 XDL |
616 | addr_to_parts (tree type, aff_tree *addr, tree iv_cand, |
617 | tree base_hint, struct mem_address *parts, | |
618 | bool speed) | |
ac182688 | 619 | { |
73f30c63 | 620 | tree part; |
ac182688 ZD |
621 | unsigned i; |
622 | ||
623 | parts->symbol = NULL_TREE; | |
624 | parts->base = NULL_TREE; | |
625 | parts->index = NULL_TREE; | |
626 | parts->step = NULL_TREE; | |
627 | ||
73f30c63 | 628 | if (!double_int_zero_p (addr->offset)) |
820410e0 | 629 | parts->offset = double_int_to_tree (sizetype, addr->offset); |
ac182688 ZD |
630 | else |
631 | parts->offset = NULL_TREE; | |
632 | ||
820410e0 ZD |
633 | /* Try to find a symbol. */ |
634 | move_fixed_address_to_symbol (parts, addr); | |
635 | ||
880a1451 XDL |
636 | /* No need to do address parts reassociation if the number of parts |
637 | is <= 2 -- in that case, no loop invariant code motion can be | |
638 | exposed. */ | |
639 | ||
640 | if (!base_hint && (addr->n > 2)) | |
641 | move_variant_to_index (parts, addr, iv_cand); | |
642 | ||
ac182688 ZD |
643 | /* First move the most expensive feasible multiplication |
644 | to index. */ | |
880a1451 XDL |
645 | if (!parts->index) |
646 | most_expensive_mult_to_index (type, parts, addr, speed); | |
820410e0 ZD |
647 | |
648 | /* Try to find a base of the reference. Since at the moment | |
649 | there is no reliable way how to distinguish between pointer and its | |
650 | offset, this is just a guess. */ | |
d7c0c068 UW |
651 | if (!parts->symbol && base_hint) |
652 | move_hint_to_base (type, parts, base_hint, addr); | |
653 | if (!parts->symbol && !parts->base) | |
820410e0 | 654 | move_pointer_to_base (parts, addr); |
ac182688 ZD |
655 | |
656 | /* Then try to process the remaining elements. */ | |
657 | for (i = 0; i < addr->n; i++) | |
73f30c63 | 658 | { |
820410e0 | 659 | part = fold_convert (sizetype, addr->elts[i].val); |
73f30c63 | 660 | if (!double_int_one_p (addr->elts[i].coef)) |
820410e0 ZD |
661 | part = fold_build2 (MULT_EXPR, sizetype, part, |
662 | double_int_to_tree (sizetype, addr->elts[i].coef)); | |
663 | add_to_parts (parts, part); | |
73f30c63 | 664 | } |
ac182688 | 665 | if (addr->rest) |
820410e0 | 666 | add_to_parts (parts, fold_convert (sizetype, addr->rest)); |
ac182688 ZD |
667 | } |
668 | ||
669 | /* Force the PARTS to register. */ | |
670 | ||
671 | static void | |
726a989a | 672 | gimplify_mem_ref_parts (gimple_stmt_iterator *gsi, struct mem_address *parts) |
ac182688 ZD |
673 | { |
674 | if (parts->base) | |
bcf71673 RG |
675 | parts->base = force_gimple_operand_gsi_1 (gsi, parts->base, |
676 | is_gimple_mem_ref_addr, NULL_TREE, | |
726a989a | 677 | true, GSI_SAME_STMT); |
ac182688 | 678 | if (parts->index) |
726a989a | 679 | parts->index = force_gimple_operand_gsi (gsi, parts->index, |
c6540bde | 680 | true, NULL_TREE, |
726a989a | 681 | true, GSI_SAME_STMT); |
ac182688 ZD |
682 | } |
683 | ||
684 | /* Creates and returns a TARGET_MEM_REF for address ADDR. If necessary | |
726a989a | 685 | computations are emitted in front of GSI. TYPE is the mode |
880a1451 XDL |
686 | of created memory reference. IV_CAND is the selected iv candidate in ADDR, |
687 | and BASE_HINT is non NULL if IV_CAND comes from a base address | |
688 | object. */ | |
ac182688 ZD |
689 | |
690 | tree | |
880a1451 XDL |
691 | create_mem_ref (gimple_stmt_iterator *gsi, tree type, aff_tree *addr, |
692 | tree alias_ptr_type, tree iv_cand, tree base_hint, bool speed) | |
ac182688 ZD |
693 | { |
694 | tree mem_ref, tmp; | |
ac182688 ZD |
695 | struct mem_address parts; |
696 | ||
880a1451 | 697 | addr_to_parts (type, addr, iv_cand, base_hint, &parts, speed); |
726a989a | 698 | gimplify_mem_ref_parts (gsi, &parts); |
863a7578 | 699 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
700 | if (mem_ref) |
701 | return mem_ref; | |
702 | ||
703 | /* The expression is too complicated. Try making it simpler. */ | |
704 | ||
705 | if (parts.step && !integer_onep (parts.step)) | |
706 | { | |
707 | /* Move the multiplication to index. */ | |
708 | gcc_assert (parts.index); | |
726a989a | 709 | parts.index = force_gimple_operand_gsi (gsi, |
820410e0 ZD |
710 | fold_build2 (MULT_EXPR, sizetype, |
711 | parts.index, parts.step), | |
726a989a | 712 | true, NULL_TREE, true, GSI_SAME_STMT); |
ac182688 | 713 | parts.step = NULL_TREE; |
b8698a0f | 714 | |
863a7578 | 715 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
716 | if (mem_ref) |
717 | return mem_ref; | |
718 | } | |
719 | ||
720 | if (parts.symbol) | |
721 | { | |
23a534a1 | 722 | tmp = parts.symbol; |
69bd3423 | 723 | gcc_assert (is_gimple_val (tmp)); |
b8698a0f | 724 | |
ac182688 ZD |
725 | /* Add the symbol to base, eventually forcing it to register. */ |
726 | if (parts.base) | |
39278c14 | 727 | { |
36618b93 | 728 | gcc_assert (useless_type_conversion_p |
5f787cbc | 729 | (sizetype, TREE_TYPE (parts.base))); |
69bd3423 | 730 | |
39278c14 | 731 | if (parts.index) |
69bd3423 | 732 | { |
bcf71673 | 733 | parts.base = force_gimple_operand_gsi_1 (gsi, |
5d49b6a7 | 734 | fold_build_pointer_plus (tmp, parts.base), |
bcf71673 | 735 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
69bd3423 | 736 | } |
39278c14 AK |
737 | else |
738 | { | |
739 | parts.index = parts.base; | |
740 | parts.base = tmp; | |
741 | } | |
742 | } | |
ac182688 ZD |
743 | else |
744 | parts.base = tmp; | |
745 | parts.symbol = NULL_TREE; | |
746 | ||
863a7578 | 747 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
748 | if (mem_ref) |
749 | return mem_ref; | |
750 | } | |
751 | ||
820410e0 | 752 | if (parts.index) |
ac182688 | 753 | { |
820410e0 ZD |
754 | /* Add index to base. */ |
755 | if (parts.base) | |
756 | { | |
bcf71673 | 757 | parts.base = force_gimple_operand_gsi_1 (gsi, |
5d49b6a7 | 758 | fold_build_pointer_plus (parts.base, parts.index), |
bcf71673 | 759 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
820410e0 | 760 | } |
ac182688 | 761 | else |
820410e0 ZD |
762 | parts.base = parts.index; |
763 | parts.index = NULL_TREE; | |
ac182688 | 764 | |
863a7578 | 765 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
766 | if (mem_ref) |
767 | return mem_ref; | |
768 | } | |
769 | ||
770 | if (parts.offset && !integer_zerop (parts.offset)) | |
771 | { | |
820410e0 ZD |
772 | /* Try adding offset to base. */ |
773 | if (parts.base) | |
774 | { | |
bcf71673 | 775 | parts.base = force_gimple_operand_gsi_1 (gsi, |
5d49b6a7 | 776 | fold_build_pointer_plus (parts.base, parts.offset), |
bcf71673 | 777 | is_gimple_mem_ref_addr, NULL_TREE, true, GSI_SAME_STMT); |
820410e0 | 778 | } |
ac182688 | 779 | else |
cdd76d88 | 780 | parts.base = parts.offset; |
ac182688 ZD |
781 | |
782 | parts.offset = NULL_TREE; | |
783 | ||
863a7578 | 784 | mem_ref = create_mem_ref_raw (type, alias_ptr_type, &parts, true); |
ac182688 ZD |
785 | if (mem_ref) |
786 | return mem_ref; | |
787 | } | |
788 | ||
789 | /* Verify that the address is in the simplest possible shape | |
790 | (only a register). If we cannot create such a memory reference, | |
791 | something is really wrong. */ | |
792 | gcc_assert (parts.symbol == NULL_TREE); | |
820410e0 | 793 | gcc_assert (parts.index == NULL_TREE); |
ac182688 ZD |
794 | gcc_assert (!parts.step || integer_onep (parts.step)); |
795 | gcc_assert (!parts.offset || integer_zerop (parts.offset)); | |
796 | gcc_unreachable (); | |
797 | } | |
798 | ||
799 | /* Copies components of the address from OP to ADDR. */ | |
800 | ||
801 | void | |
802 | get_address_description (tree op, struct mem_address *addr) | |
803 | { | |
4d948885 RG |
804 | if (TREE_CODE (TMR_BASE (op)) == ADDR_EXPR) |
805 | { | |
806 | addr->symbol = TMR_BASE (op); | |
807 | addr->base = TMR_INDEX2 (op); | |
808 | } | |
809 | else | |
810 | { | |
811 | addr->symbol = NULL_TREE; | |
812 | if (TMR_INDEX2 (op)) | |
813 | { | |
814 | gcc_assert (integer_zerop (TMR_BASE (op))); | |
815 | addr->base = TMR_INDEX2 (op); | |
816 | } | |
817 | else | |
818 | addr->base = TMR_BASE (op); | |
819 | } | |
ac182688 ZD |
820 | addr->index = TMR_INDEX (op); |
821 | addr->step = TMR_STEP (op); | |
822 | addr->offset = TMR_OFFSET (op); | |
823 | } | |
824 | ||
825 | /* Copies the additional information attached to target_mem_ref FROM to TO. */ | |
826 | ||
827 | void | |
828 | copy_mem_ref_info (tree to, tree from) | |
829 | { | |
ac182688 | 830 | /* And the info about the original reference. */ |
5e9fb3db RG |
831 | TREE_SIDE_EFFECTS (to) = TREE_SIDE_EFFECTS (from); |
832 | TREE_THIS_VOLATILE (to) = TREE_THIS_VOLATILE (from); | |
ac182688 ZD |
833 | } |
834 | ||
f0286f95 BS |
835 | /* Copies the reference information from OLD_REF to NEW_REF, where |
836 | NEW_REF should be either a MEM_REF or a TARGET_MEM_REF. */ | |
837 | ||
838 | void | |
839 | copy_ref_info (tree new_ref, tree old_ref) | |
840 | { | |
841 | tree new_ptr_base = NULL_TREE; | |
842 | ||
843 | gcc_assert (TREE_CODE (new_ref) == MEM_REF | |
844 | || TREE_CODE (new_ref) == TARGET_MEM_REF); | |
845 | ||
846 | TREE_SIDE_EFFECTS (new_ref) = TREE_SIDE_EFFECTS (old_ref); | |
847 | TREE_THIS_VOLATILE (new_ref) = TREE_THIS_VOLATILE (old_ref); | |
848 | ||
849 | new_ptr_base = TREE_OPERAND (new_ref, 0); | |
850 | ||
851 | /* We can transfer points-to information from an old pointer | |
852 | or decl base to the new one. */ | |
853 | if (new_ptr_base | |
854 | && TREE_CODE (new_ptr_base) == SSA_NAME | |
855 | && !SSA_NAME_PTR_INFO (new_ptr_base)) | |
856 | { | |
857 | tree base = get_base_address (old_ref); | |
858 | if (!base) | |
859 | ; | |
860 | else if ((TREE_CODE (base) == MEM_REF | |
861 | || TREE_CODE (base) == TARGET_MEM_REF) | |
862 | && TREE_CODE (TREE_OPERAND (base, 0)) == SSA_NAME | |
863 | && SSA_NAME_PTR_INFO (TREE_OPERAND (base, 0))) | |
864 | { | |
865 | struct ptr_info_def *new_pi; | |
644ffefd MJ |
866 | unsigned int align, misalign; |
867 | ||
f0286f95 BS |
868 | duplicate_ssa_name_ptr_info |
869 | (new_ptr_base, SSA_NAME_PTR_INFO (TREE_OPERAND (base, 0))); | |
870 | new_pi = SSA_NAME_PTR_INFO (new_ptr_base); | |
871 | /* We have to be careful about transfering alignment information. */ | |
644ffefd MJ |
872 | if (get_ptr_info_alignment (new_pi, &align, &misalign) |
873 | && TREE_CODE (old_ref) == MEM_REF | |
f0286f95 BS |
874 | && !(TREE_CODE (new_ref) == TARGET_MEM_REF |
875 | && (TMR_INDEX2 (new_ref) | |
876 | || (TMR_STEP (new_ref) | |
877 | && (TREE_INT_CST_LOW (TMR_STEP (new_ref)) | |
644ffefd | 878 | < align))))) |
f0286f95 | 879 | { |
644ffefd MJ |
880 | unsigned int inc = double_int_sub (mem_ref_offset (old_ref), |
881 | mem_ref_offset (new_ref)).low; | |
882 | adjust_ptr_info_misalignment (new_pi, inc); | |
f0286f95 BS |
883 | } |
884 | else | |
644ffefd | 885 | mark_ptr_info_alignment_unknown (new_pi); |
f0286f95 BS |
886 | } |
887 | else if (TREE_CODE (base) == VAR_DECL | |
888 | || TREE_CODE (base) == PARM_DECL | |
889 | || TREE_CODE (base) == RESULT_DECL) | |
890 | { | |
891 | struct ptr_info_def *pi = get_ptr_info (new_ptr_base); | |
892 | pt_solution_set_var (&pi->pt, base); | |
893 | } | |
894 | } | |
895 | } | |
896 | ||
ac182688 ZD |
897 | /* Move constants in target_mem_ref REF to offset. Returns the new target |
898 | mem ref if anything changes, NULL_TREE otherwise. */ | |
899 | ||
900 | tree | |
901 | maybe_fold_tmr (tree ref) | |
902 | { | |
903 | struct mem_address addr; | |
904 | bool changed = false; | |
905 | tree ret, off; | |
906 | ||
907 | get_address_description (ref, &addr); | |
908 | ||
4d948885 RG |
909 | if (addr.base |
910 | && TREE_CODE (addr.base) == INTEGER_CST | |
911 | && !integer_zerop (addr.base)) | |
ac182688 | 912 | { |
4b228e61 RG |
913 | addr.offset = fold_binary_to_constant (PLUS_EXPR, |
914 | TREE_TYPE (addr.offset), | |
915 | addr.offset, addr.base); | |
ac182688 ZD |
916 | addr.base = NULL_TREE; |
917 | changed = true; | |
918 | } | |
919 | ||
4d948885 RG |
920 | if (addr.symbol |
921 | && TREE_CODE (TREE_OPERAND (addr.symbol, 0)) == MEM_REF) | |
922 | { | |
923 | addr.offset = fold_binary_to_constant | |
924 | (PLUS_EXPR, TREE_TYPE (addr.offset), | |
925 | addr.offset, | |
926 | TREE_OPERAND (TREE_OPERAND (addr.symbol, 0), 1)); | |
927 | addr.symbol = TREE_OPERAND (TREE_OPERAND (addr.symbol, 0), 0); | |
928 | changed = true; | |
929 | } | |
930 | else if (addr.symbol | |
931 | && handled_component_p (TREE_OPERAND (addr.symbol, 0))) | |
932 | { | |
933 | HOST_WIDE_INT offset; | |
934 | addr.symbol = build_fold_addr_expr | |
935 | (get_addr_base_and_unit_offset | |
936 | (TREE_OPERAND (addr.symbol, 0), &offset)); | |
937 | addr.offset = int_const_binop (PLUS_EXPR, | |
d35936ab | 938 | addr.offset, size_int (offset)); |
4d948885 RG |
939 | changed = true; |
940 | } | |
941 | ||
ac182688 ZD |
942 | if (addr.index && TREE_CODE (addr.index) == INTEGER_CST) |
943 | { | |
944 | off = addr.index; | |
945 | if (addr.step) | |
946 | { | |
820410e0 | 947 | off = fold_binary_to_constant (MULT_EXPR, sizetype, |
ac182688 ZD |
948 | off, addr.step); |
949 | addr.step = NULL_TREE; | |
950 | } | |
951 | ||
4b228e61 RG |
952 | addr.offset = fold_binary_to_constant (PLUS_EXPR, |
953 | TREE_TYPE (addr.offset), | |
954 | addr.offset, off); | |
ac182688 ZD |
955 | addr.index = NULL_TREE; |
956 | changed = true; | |
957 | } | |
958 | ||
959 | if (!changed) | |
960 | return NULL_TREE; | |
b8698a0f | 961 | |
863a7578 RB |
962 | /* If we have propagated something into this TARGET_MEM_REF and thus |
963 | ended up folding it, always create a new TARGET_MEM_REF regardless | |
964 | if it is valid in this for on the target - the propagation result | |
965 | wouldn't be anyway. */ | |
966 | ret = create_mem_ref_raw (TREE_TYPE (ref), | |
967 | TREE_TYPE (addr.offset), &addr, false); | |
ac182688 ZD |
968 | copy_mem_ref_info (ret, ref); |
969 | return ret; | |
970 | } | |
971 | ||
972 | /* Dump PARTS to FILE. */ | |
973 | ||
974 | extern void dump_mem_address (FILE *, struct mem_address *); | |
975 | void | |
976 | dump_mem_address (FILE *file, struct mem_address *parts) | |
977 | { | |
978 | if (parts->symbol) | |
979 | { | |
980 | fprintf (file, "symbol: "); | |
23a534a1 | 981 | print_generic_expr (file, TREE_OPERAND (parts->symbol, 0), TDF_SLIM); |
ac182688 ZD |
982 | fprintf (file, "\n"); |
983 | } | |
984 | if (parts->base) | |
985 | { | |
986 | fprintf (file, "base: "); | |
987 | print_generic_expr (file, parts->base, TDF_SLIM); | |
988 | fprintf (file, "\n"); | |
989 | } | |
990 | if (parts->index) | |
991 | { | |
992 | fprintf (file, "index: "); | |
993 | print_generic_expr (file, parts->index, TDF_SLIM); | |
994 | fprintf (file, "\n"); | |
995 | } | |
996 | if (parts->step) | |
997 | { | |
998 | fprintf (file, "step: "); | |
999 | print_generic_expr (file, parts->step, TDF_SLIM); | |
1000 | fprintf (file, "\n"); | |
1001 | } | |
1002 | if (parts->offset) | |
1003 | { | |
1004 | fprintf (file, "offset: "); | |
1005 | print_generic_expr (file, parts->offset, TDF_SLIM); | |
1006 | fprintf (file, "\n"); | |
1007 | } | |
1008 | } | |
1009 | ||
1010 | #include "gt-tree-ssa-address.h" |