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