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