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