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