]>
Commit | Line | Data |
---|---|---|
7306ed3f | 1 | /* C-compiler utilities for types and variables storage layout |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1996, 1998, |
71d59383 RS |
3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 |
4 | Free Software Foundation, Inc. | |
7306ed3f | 5 | |
1322177d | 6 | This file is part of GCC. |
7306ed3f | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 2, or (at your option) any later | |
11 | version. | |
7306ed3f | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
7306ed3f JW |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d | 19 | along with GCC; see the file COPYING. If not, write to the Free |
366ccddb KC |
20 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
21 | 02110-1301, USA. */ | |
7306ed3f JW |
22 | |
23 | ||
24 | #include "config.h" | |
670ee920 | 25 | #include "system.h" |
4977bab6 ZW |
26 | #include "coretypes.h" |
27 | #include "tm.h" | |
7306ed3f | 28 | #include "tree.h" |
d05a5492 | 29 | #include "rtl.h" |
6baf1cc8 | 30 | #include "tm_p.h" |
566cdc73 | 31 | #include "flags.h" |
7306ed3f | 32 | #include "function.h" |
234042f4 | 33 | #include "expr.h" |
ea40ba9c | 34 | #include "output.h" |
10f0ad3d | 35 | #include "toplev.h" |
d7db6646 | 36 | #include "ggc.h" |
f913c102 | 37 | #include "target.h" |
43577e6b | 38 | #include "langhooks.h" |
26277d41 | 39 | #include "regs.h" |
89b0433e | 40 | #include "params.h" |
7306ed3f | 41 | |
7306ed3f | 42 | /* Data type for the expressions representing sizes of data types. |
896cced4 | 43 | It is the first integer type laid out. */ |
fed3cef0 | 44 | tree sizetype_tab[(int) TYPE_KIND_LAST]; |
7306ed3f | 45 | |
d4c40650 RS |
46 | /* If nonzero, this is an upper limit on alignment of structure fields. |
47 | The value is measured in bits. */ | |
467cecf3 | 48 | unsigned int maximum_field_alignment = TARGET_DEFAULT_PACK_STRUCT * BITS_PER_UNIT; |
8c27b7d4 | 49 | /* ... and its original value in bytes, specified via -fpack-struct=<value>. */ |
467cecf3 | 50 | unsigned int initial_max_fld_align = TARGET_DEFAULT_PACK_STRUCT; |
d4c40650 | 51 | |
b5d6a2ff RK |
52 | /* Nonzero if all REFERENCE_TYPEs are internal and hence should be |
53 | allocated in Pmode, not ptr_mode. Set only by internal_reference_types | |
54 | called only by a front end. */ | |
55 | static int reference_types_internal = 0; | |
56 | ||
46c5ad27 AJ |
57 | static void finalize_record_size (record_layout_info); |
58 | static void finalize_type_size (tree); | |
59 | static void place_union_field (record_layout_info, tree); | |
b8089d8d | 60 | #if defined (PCC_BITFIELD_TYPE_MATTERS) || defined (BITFIELD_NBYTES_LIMITED) |
46c5ad27 AJ |
61 | static int excess_unit_span (HOST_WIDE_INT, HOST_WIDE_INT, HOST_WIDE_INT, |
62 | HOST_WIDE_INT, tree); | |
b8089d8d | 63 | #endif |
46c5ad27 | 64 | extern void debug_rli (record_layout_info); |
7306ed3f JW |
65 | \f |
66 | /* SAVE_EXPRs for sizes of types and decls, waiting to be expanded. */ | |
67 | ||
e2500fed | 68 | static GTY(()) tree pending_sizes; |
7306ed3f | 69 | |
b5d6a2ff RK |
70 | /* Show that REFERENCE_TYPES are internal and should be Pmode. Called only |
71 | by front end. */ | |
72 | ||
73 | void | |
46c5ad27 | 74 | internal_reference_types (void) |
b5d6a2ff RK |
75 | { |
76 | reference_types_internal = 1; | |
77 | } | |
78 | ||
770ae6cc RK |
79 | /* Get a list of all the objects put on the pending sizes list. */ |
80 | ||
7306ed3f | 81 | tree |
46c5ad27 | 82 | get_pending_sizes (void) |
7306ed3f JW |
83 | { |
84 | tree chain = pending_sizes; | |
d4b60170 | 85 | |
7306ed3f JW |
86 | pending_sizes = 0; |
87 | return chain; | |
88 | } | |
89 | ||
fe375cf1 JJ |
90 | /* Add EXPR to the pending sizes list. */ |
91 | ||
92 | void | |
46c5ad27 | 93 | put_pending_size (tree expr) |
fe375cf1 | 94 | { |
3874585e RK |
95 | /* Strip any simple arithmetic from EXPR to see if it has an underlying |
96 | SAVE_EXPR. */ | |
a9ecacf6 | 97 | expr = skip_simple_arithmetic (expr); |
3874585e RK |
98 | |
99 | if (TREE_CODE (expr) == SAVE_EXPR) | |
100 | pending_sizes = tree_cons (NULL_TREE, expr, pending_sizes); | |
fe375cf1 JJ |
101 | } |
102 | ||
770ae6cc RK |
103 | /* Put a chain of objects into the pending sizes list, which must be |
104 | empty. */ | |
105 | ||
1fd7c4ac | 106 | void |
46c5ad27 | 107 | put_pending_sizes (tree chain) |
1fd7c4ac | 108 | { |
41374e13 | 109 | gcc_assert (!pending_sizes); |
1fd7c4ac RK |
110 | pending_sizes = chain; |
111 | } | |
112 | ||
76ffb3a0 | 113 | /* Given a size SIZE that may not be a constant, return a SAVE_EXPR |
7306ed3f JW |
114 | to serve as the actual size-expression for a type or decl. */ |
115 | ||
4e4b555d | 116 | tree |
46c5ad27 | 117 | variable_size (tree size) |
7306ed3f | 118 | { |
3695c25f JM |
119 | tree save; |
120 | ||
5e9bec99 RK |
121 | /* If the language-processor is to take responsibility for variable-sized |
122 | items (e.g., languages which have elaboration procedures like Ada), | |
ac79cd5a RK |
123 | just return SIZE unchanged. Likewise for self-referential sizes and |
124 | constant sizes. */ | |
76ffb3a0 | 125 | if (TREE_CONSTANT (size) |
ae2bcd98 | 126 | || lang_hooks.decls.global_bindings_p () < 0 |
679035f3 | 127 | || CONTAINS_PLACEHOLDER_P (size)) |
5e9bec99 RK |
128 | return size; |
129 | ||
ad50bc8d | 130 | size = save_expr (size); |
68de3831 | 131 | |
d26f8097 MM |
132 | /* If an array with a variable number of elements is declared, and |
133 | the elements require destruction, we will emit a cleanup for the | |
134 | array. That cleanup is run both on normal exit from the block | |
135 | and in the exception-handler for the block. Normally, when code | |
136 | is used in both ordinary code and in an exception handler it is | |
137 | `unsaved', i.e., all SAVE_EXPRs are recalculated. However, we do | |
138 | not wish to do that here; the array-size is the same in both | |
139 | places. */ | |
1c9766da | 140 | save = skip_simple_arithmetic (size); |
d26f8097 | 141 | |
6a0bec2c | 142 | if (cfun && cfun->x_dont_save_pending_sizes_p) |
6de9cd9a DN |
143 | /* The front-end doesn't want us to keep a list of the expressions |
144 | that determine sizes for variable size objects. Trust it. */ | |
145 | return size; | |
146 | ||
ae2bcd98 | 147 | if (lang_hooks.decls.global_bindings_p ()) |
7306ed3f | 148 | { |
80f9c711 | 149 | if (TREE_CONSTANT (size)) |
971801ff | 150 | error ("type size can%'t be explicitly evaluated"); |
80f9c711 RS |
151 | else |
152 | error ("variable-size type declared outside of any function"); | |
153 | ||
fed3cef0 | 154 | return size_one_node; |
7306ed3f JW |
155 | } |
156 | ||
6a0bec2c | 157 | put_pending_size (save); |
7306ed3f JW |
158 | |
159 | return size; | |
160 | } | |
161 | \f | |
162 | #ifndef MAX_FIXED_MODE_SIZE | |
163 | #define MAX_FIXED_MODE_SIZE GET_MODE_BITSIZE (DImode) | |
164 | #endif | |
165 | ||
37783865 ZW |
166 | /* Return the machine mode to use for a nonscalar of SIZE bits. The |
167 | mode must be in class CLASS, and have exactly that many value bits; | |
168 | it may have padding as well. If LIMIT is nonzero, modes of wider | |
169 | than MAX_FIXED_MODE_SIZE will not be used. */ | |
7306ed3f JW |
170 | |
171 | enum machine_mode | |
46c5ad27 | 172 | mode_for_size (unsigned int size, enum mode_class class, int limit) |
7306ed3f | 173 | { |
b3694847 | 174 | enum machine_mode mode; |
7306ed3f | 175 | |
72c602fc | 176 | if (limit && size > MAX_FIXED_MODE_SIZE) |
7306ed3f JW |
177 | return BLKmode; |
178 | ||
5e9bec99 | 179 | /* Get the first mode which has this size, in the specified class. */ |
7306ed3f JW |
180 | for (mode = GET_CLASS_NARROWEST_MODE (class); mode != VOIDmode; |
181 | mode = GET_MODE_WIDER_MODE (mode)) | |
37783865 | 182 | if (GET_MODE_PRECISION (mode) == size) |
7306ed3f JW |
183 | return mode; |
184 | ||
185 | return BLKmode; | |
186 | } | |
187 | ||
72c602fc RK |
188 | /* Similar, except passed a tree node. */ |
189 | ||
190 | enum machine_mode | |
46c5ad27 | 191 | mode_for_size_tree (tree size, enum mode_class class, int limit) |
72c602fc | 192 | { |
a6a12bb9 RS |
193 | unsigned HOST_WIDE_INT uhwi; |
194 | unsigned int ui; | |
195 | ||
196 | if (!host_integerp (size, 1)) | |
72c602fc | 197 | return BLKmode; |
a6a12bb9 RS |
198 | uhwi = tree_low_cst (size, 1); |
199 | ui = uhwi; | |
200 | if (uhwi != ui) | |
201 | return BLKmode; | |
202 | return mode_for_size (ui, class, limit); | |
72c602fc RK |
203 | } |
204 | ||
5e9bec99 | 205 | /* Similar, but never return BLKmode; return the narrowest mode that |
37783865 | 206 | contains at least the requested number of value bits. */ |
5e9bec99 | 207 | |
27922c13 | 208 | enum machine_mode |
46c5ad27 | 209 | smallest_mode_for_size (unsigned int size, enum mode_class class) |
5e9bec99 | 210 | { |
b3694847 | 211 | enum machine_mode mode; |
5e9bec99 RK |
212 | |
213 | /* Get the first mode which has at least this size, in the | |
214 | specified class. */ | |
215 | for (mode = GET_CLASS_NARROWEST_MODE (class); mode != VOIDmode; | |
216 | mode = GET_MODE_WIDER_MODE (mode)) | |
37783865 | 217 | if (GET_MODE_PRECISION (mode) >= size) |
5e9bec99 RK |
218 | return mode; |
219 | ||
41374e13 | 220 | gcc_unreachable (); |
5e9bec99 RK |
221 | } |
222 | ||
d006aa54 RH |
223 | /* Find an integer mode of the exact same size, or BLKmode on failure. */ |
224 | ||
225 | enum machine_mode | |
46c5ad27 | 226 | int_mode_for_mode (enum machine_mode mode) |
d006aa54 RH |
227 | { |
228 | switch (GET_MODE_CLASS (mode)) | |
229 | { | |
230 | case MODE_INT: | |
231 | case MODE_PARTIAL_INT: | |
232 | break; | |
233 | ||
234 | case MODE_COMPLEX_INT: | |
235 | case MODE_COMPLEX_FLOAT: | |
236 | case MODE_FLOAT: | |
15ed7b52 | 237 | case MODE_DECIMAL_FLOAT: |
62c07905 JM |
238 | case MODE_VECTOR_INT: |
239 | case MODE_VECTOR_FLOAT: | |
d006aa54 RH |
240 | mode = mode_for_size (GET_MODE_BITSIZE (mode), MODE_INT, 0); |
241 | break; | |
242 | ||
243 | case MODE_RANDOM: | |
244 | if (mode == BLKmode) | |
786de7eb | 245 | break; |
d4b60170 | 246 | |
2d76cb1a | 247 | /* ... fall through ... */ |
d006aa54 RH |
248 | |
249 | case MODE_CC: | |
250 | default: | |
41374e13 | 251 | gcc_unreachable (); |
d006aa54 RH |
252 | } |
253 | ||
254 | return mode; | |
255 | } | |
256 | ||
187515f5 AO |
257 | /* Return the alignment of MODE. This will be bounded by 1 and |
258 | BIGGEST_ALIGNMENT. */ | |
259 | ||
260 | unsigned int | |
46c5ad27 | 261 | get_mode_alignment (enum machine_mode mode) |
187515f5 | 262 | { |
0974c7d7 | 263 | return MIN (BIGGEST_ALIGNMENT, MAX (1, mode_base_align[mode]*BITS_PER_UNIT)); |
187515f5 AO |
264 | } |
265 | ||
7306ed3f | 266 | \f |
78d55cc8 JM |
267 | /* Subroutine of layout_decl: Force alignment required for the data type. |
268 | But if the decl itself wants greater alignment, don't override that. */ | |
269 | ||
270 | static inline void | |
271 | do_type_align (tree type, tree decl) | |
272 | { | |
273 | if (TYPE_ALIGN (type) > DECL_ALIGN (decl)) | |
274 | { | |
275 | DECL_ALIGN (decl) = TYPE_ALIGN (type); | |
3acef2ae JM |
276 | if (TREE_CODE (decl) == FIELD_DECL) |
277 | DECL_USER_ALIGN (decl) = TYPE_USER_ALIGN (type); | |
78d55cc8 JM |
278 | } |
279 | } | |
280 | ||
7306ed3f JW |
281 | /* Set the size, mode and alignment of a ..._DECL node. |
282 | TYPE_DECL does need this for C++. | |
283 | Note that LABEL_DECL and CONST_DECL nodes do not need this, | |
284 | and FUNCTION_DECL nodes have them set up in a special (and simple) way. | |
285 | Don't call layout_decl for them. | |
286 | ||
287 | KNOWN_ALIGN is the amount of alignment we can assume this | |
288 | decl has with no special effort. It is relevant only for FIELD_DECLs | |
289 | and depends on the previous fields. | |
290 | All that matters about KNOWN_ALIGN is which powers of 2 divide it. | |
291 | If KNOWN_ALIGN is 0, it means, "as much alignment as you like": | |
292 | the record will be aligned to suit. */ | |
293 | ||
294 | void | |
46c5ad27 | 295 | layout_decl (tree decl, unsigned int known_align) |
7306ed3f | 296 | { |
b3694847 SS |
297 | tree type = TREE_TYPE (decl); |
298 | enum tree_code code = TREE_CODE (decl); | |
a46666a9 | 299 | rtx rtl = NULL_RTX; |
7306ed3f JW |
300 | |
301 | if (code == CONST_DECL) | |
302 | return; | |
41374e13 NS |
303 | |
304 | gcc_assert (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL | |
305 | || code == TYPE_DECL ||code == FIELD_DECL); | |
306 | ||
a46666a9 RH |
307 | rtl = DECL_RTL_IF_SET (decl); |
308 | ||
7306ed3f | 309 | if (type == error_mark_node) |
33433751 | 310 | type = void_type_node; |
7306ed3f | 311 | |
770ae6cc RK |
312 | /* Usually the size and mode come from the data type without change, |
313 | however, the front-end may set the explicit width of the field, so its | |
314 | size may not be the same as the size of its type. This happens with | |
315 | bitfields, of course (an `int' bitfield may be only 2 bits, say), but it | |
316 | also happens with other fields. For example, the C++ front-end creates | |
317 | zero-sized fields corresponding to empty base classes, and depends on | |
318 | layout_type setting DECL_FIELD_BITPOS correctly for the field. Set the | |
4b6bf620 RK |
319 | size in bytes from the size in bits. If we have already set the mode, |
320 | don't set it again since we can be called twice for FIELD_DECLs. */ | |
770ae6cc | 321 | |
a150de29 | 322 | DECL_UNSIGNED (decl) = TYPE_UNSIGNED (type); |
4b6bf620 RK |
323 | if (DECL_MODE (decl) == VOIDmode) |
324 | DECL_MODE (decl) = TYPE_MODE (type); | |
770ae6cc | 325 | |
5e9bec99 | 326 | if (DECL_SIZE (decl) == 0) |
06ceef4e | 327 | { |
ad50bc8d RH |
328 | DECL_SIZE (decl) = TYPE_SIZE (type); |
329 | DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (type); | |
06ceef4e | 330 | } |
1a96dc46 | 331 | else if (DECL_SIZE_UNIT (decl) == 0) |
770ae6cc | 332 | DECL_SIZE_UNIT (decl) |
455f19cb MM |
333 | = fold_convert (sizetype, size_binop (CEIL_DIV_EXPR, DECL_SIZE (decl), |
334 | bitsize_unit_node)); | |
06ceef4e | 335 | |
78d55cc8 JM |
336 | if (code != FIELD_DECL) |
337 | /* For non-fields, update the alignment from the type. */ | |
338 | do_type_align (type, decl); | |
339 | else | |
340 | /* For fields, it's a bit more complicated... */ | |
786de7eb | 341 | { |
40aae178 | 342 | bool old_user_align = DECL_USER_ALIGN (decl); |
d1a701eb MM |
343 | bool zero_bitfield = false; |
344 | bool packed_p = DECL_PACKED (decl); | |
345 | unsigned int mfa; | |
40aae178 | 346 | |
78d55cc8 JM |
347 | if (DECL_BIT_FIELD (decl)) |
348 | { | |
349 | DECL_BIT_FIELD_TYPE (decl) = type; | |
7306ed3f | 350 | |
78d55cc8 | 351 | /* A zero-length bit-field affects the alignment of the next |
d1a701eb MM |
352 | field. In essence such bit-fields are not influenced by |
353 | any packing due to #pragma pack or attribute packed. */ | |
78d55cc8 | 354 | if (integer_zerop (DECL_SIZE (decl)) |
5fd9b178 | 355 | && ! targetm.ms_bitfield_layout_p (DECL_FIELD_CONTEXT (decl))) |
78d55cc8 | 356 | { |
d1a701eb MM |
357 | zero_bitfield = true; |
358 | packed_p = false; | |
78d55cc8 JM |
359 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
360 | if (PCC_BITFIELD_TYPE_MATTERS) | |
361 | do_type_align (type, decl); | |
362 | else | |
363 | #endif | |
ad3f5759 | 364 | { |
78d55cc8 | 365 | #ifdef EMPTY_FIELD_BOUNDARY |
ad3f5759 AS |
366 | if (EMPTY_FIELD_BOUNDARY > DECL_ALIGN (decl)) |
367 | { | |
368 | DECL_ALIGN (decl) = EMPTY_FIELD_BOUNDARY; | |
369 | DECL_USER_ALIGN (decl) = 0; | |
370 | } | |
78d55cc8 | 371 | #endif |
ad3f5759 | 372 | } |
78d55cc8 JM |
373 | } |
374 | ||
375 | /* See if we can use an ordinary integer mode for a bit-field. | |
376 | Conditions are: a fixed size that is correct for another mode | |
377 | and occupying a complete byte or bytes on proper boundary. */ | |
378 | if (TYPE_SIZE (type) != 0 | |
379 | && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST | |
380 | && GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT) | |
381 | { | |
382 | enum machine_mode xmode | |
383 | = mode_for_size_tree (DECL_SIZE (decl), MODE_INT, 1); | |
384 | ||
f676971a | 385 | if (xmode != BLKmode |
9a706ec7 MM |
386 | && (known_align == 0 |
387 | || known_align >= GET_MODE_ALIGNMENT (xmode))) | |
78d55cc8 JM |
388 | { |
389 | DECL_ALIGN (decl) = MAX (GET_MODE_ALIGNMENT (xmode), | |
390 | DECL_ALIGN (decl)); | |
391 | DECL_MODE (decl) = xmode; | |
392 | DECL_BIT_FIELD (decl) = 0; | |
393 | } | |
394 | } | |
395 | ||
396 | /* Turn off DECL_BIT_FIELD if we won't need it set. */ | |
397 | if (TYPE_MODE (type) == BLKmode && DECL_MODE (decl) == BLKmode | |
398 | && known_align >= TYPE_ALIGN (type) | |
399 | && DECL_ALIGN (decl) >= TYPE_ALIGN (type)) | |
400 | DECL_BIT_FIELD (decl) = 0; | |
401 | } | |
d1a701eb | 402 | else if (packed_p && DECL_USER_ALIGN (decl)) |
78d55cc8 | 403 | /* Don't touch DECL_ALIGN. For other packed fields, go ahead and |
2038bd69 | 404 | round up; we'll reduce it again below. We want packing to |
ba228239 | 405 | supersede USER_ALIGN inherited from the type, but defer to |
2038bd69 | 406 | alignment explicitly specified on the field decl. */; |
78d55cc8 | 407 | else |
40aae178 JM |
408 | do_type_align (type, decl); |
409 | ||
410 | /* If the field is of variable size, we can't misalign it since we | |
411 | have no way to make a temporary to align the result. But this | |
412 | isn't an issue if the decl is not addressable. Likewise if it | |
413 | is of unknown size. | |
414 | ||
415 | Note that do_type_align may set DECL_USER_ALIGN, so we need to | |
416 | check old_user_align instead. */ | |
d1a701eb | 417 | if (packed_p |
40aae178 JM |
418 | && !old_user_align |
419 | && (DECL_NONADDRESSABLE_P (decl) | |
420 | || DECL_SIZE_UNIT (decl) == 0 | |
421 | || TREE_CODE (DECL_SIZE_UNIT (decl)) == INTEGER_CST)) | |
422 | DECL_ALIGN (decl) = MIN (DECL_ALIGN (decl), BITS_PER_UNIT); | |
78d55cc8 | 423 | |
d1a701eb | 424 | if (! packed_p && ! DECL_USER_ALIGN (decl)) |
7306ed3f | 425 | { |
78d55cc8 JM |
426 | /* Some targets (i.e. i386, VMS) limit struct field alignment |
427 | to a lower boundary than alignment of variables unless | |
428 | it was overridden by attribute aligned. */ | |
429 | #ifdef BIGGEST_FIELD_ALIGNMENT | |
430 | DECL_ALIGN (decl) | |
431 | = MIN (DECL_ALIGN (decl), (unsigned) BIGGEST_FIELD_ALIGNMENT); | |
432 | #endif | |
433 | #ifdef ADJUST_FIELD_ALIGN | |
434 | DECL_ALIGN (decl) = ADJUST_FIELD_ALIGN (decl, DECL_ALIGN (decl)); | |
435 | #endif | |
7306ed3f | 436 | } |
9ca75f15 | 437 | |
d1a701eb MM |
438 | if (zero_bitfield) |
439 | mfa = initial_max_fld_align * BITS_PER_UNIT; | |
440 | else | |
441 | mfa = maximum_field_alignment; | |
9ca75f15 | 442 | /* Should this be controlled by DECL_USER_ALIGN, too? */ |
d1a701eb MM |
443 | if (mfa != 0) |
444 | DECL_ALIGN (decl) = MIN (DECL_ALIGN (decl), mfa); | |
7306ed3f JW |
445 | } |
446 | ||
447 | /* Evaluate nonconstant size only once, either now or as soon as safe. */ | |
448 | if (DECL_SIZE (decl) != 0 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
449 | DECL_SIZE (decl) = variable_size (DECL_SIZE (decl)); | |
06ceef4e RK |
450 | if (DECL_SIZE_UNIT (decl) != 0 |
451 | && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST) | |
452 | DECL_SIZE_UNIT (decl) = variable_size (DECL_SIZE_UNIT (decl)); | |
453 | ||
454 | /* If requested, warn about definitions of large data objects. */ | |
455 | if (warn_larger_than | |
17aec3eb | 456 | && (code == VAR_DECL || code == PARM_DECL) |
06ceef4e RK |
457 | && ! DECL_EXTERNAL (decl)) |
458 | { | |
459 | tree size = DECL_SIZE_UNIT (decl); | |
460 | ||
461 | if (size != 0 && TREE_CODE (size) == INTEGER_CST | |
05bccae2 | 462 | && compare_tree_int (size, larger_than_size) > 0) |
06ceef4e | 463 | { |
0384674e | 464 | int size_as_int = TREE_INT_CST_LOW (size); |
06ceef4e | 465 | |
05bccae2 | 466 | if (compare_tree_int (size, size_as_int) == 0) |
dee15844 | 467 | warning (0, "size of %q+D is %d bytes", decl, size_as_int); |
06ceef4e | 468 | else |
ea40ba9c | 469 | warning (0, "size of %q+D is larger than %wd bytes", |
dee15844 | 470 | decl, larger_than_size); |
06ceef4e RK |
471 | } |
472 | } | |
a46666a9 RH |
473 | |
474 | /* If the RTL was already set, update its mode and mem attributes. */ | |
475 | if (rtl) | |
476 | { | |
477 | PUT_MODE (rtl, DECL_MODE (decl)); | |
478 | SET_DECL_RTL (decl, 0); | |
479 | set_mem_attributes (rtl, decl, 1); | |
480 | SET_DECL_RTL (decl, rtl); | |
481 | } | |
7306ed3f | 482 | } |
d8472c75 JM |
483 | |
484 | /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of | |
485 | a previous call to layout_decl and calls it again. */ | |
486 | ||
487 | void | |
488 | relayout_decl (tree decl) | |
489 | { | |
490 | DECL_SIZE (decl) = DECL_SIZE_UNIT (decl) = 0; | |
491 | DECL_MODE (decl) = VOIDmode; | |
492 | DECL_ALIGN (decl) = 0; | |
493 | SET_DECL_RTL (decl, 0); | |
494 | ||
495 | layout_decl (decl, 0); | |
496 | } | |
7306ed3f | 497 | \f |
e0cea8d9 RK |
498 | /* Hook for a front-end function that can modify the record layout as needed |
499 | immediately before it is finalized. */ | |
500 | ||
1bb11558 | 501 | static void (*lang_adjust_rli) (record_layout_info) = 0; |
e0cea8d9 RK |
502 | |
503 | void | |
46c5ad27 | 504 | set_lang_adjust_rli (void (*f) (record_layout_info)) |
e0cea8d9 RK |
505 | { |
506 | lang_adjust_rli = f; | |
507 | } | |
508 | ||
770ae6cc RK |
509 | /* Begin laying out type T, which may be a RECORD_TYPE, UNION_TYPE, or |
510 | QUAL_UNION_TYPE. Return a pointer to a struct record_layout_info which | |
511 | is to be passed to all other layout functions for this record. It is the | |
786de7eb | 512 | responsibility of the caller to call `free' for the storage returned. |
770ae6cc RK |
513 | Note that garbage collection is not permitted until we finish laying |
514 | out the record. */ | |
7306ed3f | 515 | |
9328904c | 516 | record_layout_info |
46c5ad27 | 517 | start_record_layout (tree t) |
7306ed3f | 518 | { |
703ad42b | 519 | record_layout_info rli = xmalloc (sizeof (struct record_layout_info_s)); |
9328904c MM |
520 | |
521 | rli->t = t; | |
770ae6cc | 522 | |
9328904c MM |
523 | /* If the type has a minimum specified alignment (via an attribute |
524 | declaration, for example) use it -- otherwise, start with a | |
525 | one-byte alignment. */ | |
526 | rli->record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (t)); | |
78d55cc8 | 527 | rli->unpacked_align = rli->record_align; |
770ae6cc | 528 | rli->offset_align = MAX (rli->record_align, BIGGEST_ALIGNMENT); |
7306ed3f | 529 | |
5c19a356 MS |
530 | #ifdef STRUCTURE_SIZE_BOUNDARY |
531 | /* Packed structures don't need to have minimum size. */ | |
f132af85 | 532 | if (! TYPE_PACKED (t)) |
fc555370 | 533 | rli->record_align = MAX (rli->record_align, (unsigned) STRUCTURE_SIZE_BOUNDARY); |
5c19a356 | 534 | #endif |
7306ed3f | 535 | |
770ae6cc RK |
536 | rli->offset = size_zero_node; |
537 | rli->bitpos = bitsize_zero_node; | |
f913c102 | 538 | rli->prev_field = 0; |
770ae6cc RK |
539 | rli->pending_statics = 0; |
540 | rli->packed_maybe_necessary = 0; | |
541 | ||
9328904c MM |
542 | return rli; |
543 | } | |
7306ed3f | 544 | |
f2704b9f RK |
545 | /* These four routines perform computations that convert between |
546 | the offset/bitpos forms and byte and bit offsets. */ | |
547 | ||
548 | tree | |
46c5ad27 | 549 | bit_from_pos (tree offset, tree bitpos) |
f2704b9f RK |
550 | { |
551 | return size_binop (PLUS_EXPR, bitpos, | |
455f19cb MM |
552 | size_binop (MULT_EXPR, |
553 | fold_convert (bitsizetype, offset), | |
f2704b9f RK |
554 | bitsize_unit_node)); |
555 | } | |
556 | ||
557 | tree | |
46c5ad27 | 558 | byte_from_pos (tree offset, tree bitpos) |
f2704b9f RK |
559 | { |
560 | return size_binop (PLUS_EXPR, offset, | |
455f19cb MM |
561 | fold_convert (sizetype, |
562 | size_binop (TRUNC_DIV_EXPR, bitpos, | |
563 | bitsize_unit_node))); | |
f2704b9f RK |
564 | } |
565 | ||
f2704b9f | 566 | void |
46c5ad27 AJ |
567 | pos_from_bit (tree *poffset, tree *pbitpos, unsigned int off_align, |
568 | tree pos) | |
f2704b9f RK |
569 | { |
570 | *poffset = size_binop (MULT_EXPR, | |
455f19cb MM |
571 | fold_convert (sizetype, |
572 | size_binop (FLOOR_DIV_EXPR, pos, | |
573 | bitsize_int (off_align))), | |
f2704b9f RK |
574 | size_int (off_align / BITS_PER_UNIT)); |
575 | *pbitpos = size_binop (FLOOR_MOD_EXPR, pos, bitsize_int (off_align)); | |
576 | } | |
577 | ||
578 | /* Given a pointer to bit and byte offsets and an offset alignment, | |
579 | normalize the offsets so they are within the alignment. */ | |
580 | ||
581 | void | |
46c5ad27 | 582 | normalize_offset (tree *poffset, tree *pbitpos, unsigned int off_align) |
f2704b9f RK |
583 | { |
584 | /* If the bit position is now larger than it should be, adjust it | |
585 | downwards. */ | |
586 | if (compare_tree_int (*pbitpos, off_align) >= 0) | |
587 | { | |
588 | tree extra_aligns = size_binop (FLOOR_DIV_EXPR, *pbitpos, | |
589 | bitsize_int (off_align)); | |
590 | ||
591 | *poffset | |
592 | = size_binop (PLUS_EXPR, *poffset, | |
455f19cb MM |
593 | size_binop (MULT_EXPR, |
594 | fold_convert (sizetype, extra_aligns), | |
f2704b9f | 595 | size_int (off_align / BITS_PER_UNIT))); |
786de7eb | 596 | |
f2704b9f RK |
597 | *pbitpos |
598 | = size_binop (FLOOR_MOD_EXPR, *pbitpos, bitsize_int (off_align)); | |
599 | } | |
600 | } | |
601 | ||
770ae6cc | 602 | /* Print debugging information about the information in RLI. */ |
cc9d4a85 | 603 | |
770ae6cc | 604 | void |
46c5ad27 | 605 | debug_rli (record_layout_info rli) |
cc9d4a85 | 606 | { |
770ae6cc RK |
607 | print_node_brief (stderr, "type", rli->t, 0); |
608 | print_node_brief (stderr, "\noffset", rli->offset, 0); | |
609 | print_node_brief (stderr, " bitpos", rli->bitpos, 0); | |
cc9d4a85 | 610 | |
78d55cc8 JM |
611 | fprintf (stderr, "\naligns: rec = %u, unpack = %u, off = %u\n", |
612 | rli->record_align, rli->unpacked_align, | |
e0cea8d9 | 613 | rli->offset_align); |
770ae6cc RK |
614 | if (rli->packed_maybe_necessary) |
615 | fprintf (stderr, "packed may be necessary\n"); | |
616 | ||
617 | if (rli->pending_statics) | |
618 | { | |
619 | fprintf (stderr, "pending statics:\n"); | |
620 | debug_tree (rli->pending_statics); | |
621 | } | |
622 | } | |
623 | ||
624 | /* Given an RLI with a possibly-incremented BITPOS, adjust OFFSET and | |
625 | BITPOS if necessary to keep BITPOS below OFFSET_ALIGN. */ | |
626 | ||
627 | void | |
46c5ad27 | 628 | normalize_rli (record_layout_info rli) |
770ae6cc | 629 | { |
f2704b9f | 630 | normalize_offset (&rli->offset, &rli->bitpos, rli->offset_align); |
770ae6cc | 631 | } |
cc9d4a85 | 632 | |
770ae6cc RK |
633 | /* Returns the size in bytes allocated so far. */ |
634 | ||
635 | tree | |
46c5ad27 | 636 | rli_size_unit_so_far (record_layout_info rli) |
770ae6cc | 637 | { |
f2704b9f | 638 | return byte_from_pos (rli->offset, rli->bitpos); |
770ae6cc RK |
639 | } |
640 | ||
641 | /* Returns the size in bits allocated so far. */ | |
642 | ||
643 | tree | |
46c5ad27 | 644 | rli_size_so_far (record_layout_info rli) |
770ae6cc | 645 | { |
f2704b9f | 646 | return bit_from_pos (rli->offset, rli->bitpos); |
770ae6cc RK |
647 | } |
648 | ||
0645ba8f | 649 | /* FIELD is about to be added to RLI->T. The alignment (in bits) of |
cbbaf4ae R |
650 | the next available location within the record is given by KNOWN_ALIGN. |
651 | Update the variable alignment fields in RLI, and return the alignment | |
652 | to give the FIELD. */ | |
770ae6cc | 653 | |
6de9cd9a | 654 | unsigned int |
46c5ad27 AJ |
655 | update_alignment_for_field (record_layout_info rli, tree field, |
656 | unsigned int known_align) | |
9328904c MM |
657 | { |
658 | /* The alignment required for FIELD. */ | |
659 | unsigned int desired_align; | |
9328904c MM |
660 | /* The type of this field. */ |
661 | tree type = TREE_TYPE (field); | |
0645ba8f MM |
662 | /* True if the field was explicitly aligned by the user. */ |
663 | bool user_align; | |
78d55cc8 | 664 | bool is_bitfield; |
9328904c | 665 | |
9dfb66b9 CD |
666 | /* Do not attempt to align an ERROR_MARK node */ |
667 | if (TREE_CODE (type) == ERROR_MARK) | |
668 | return 0; | |
669 | ||
78d55cc8 JM |
670 | /* Lay out the field so we know what alignment it needs. */ |
671 | layout_decl (field, known_align); | |
770ae6cc | 672 | desired_align = DECL_ALIGN (field); |
11cf4d18 | 673 | user_align = DECL_USER_ALIGN (field); |
770ae6cc | 674 | |
78d55cc8 JM |
675 | is_bitfield = (type != error_mark_node |
676 | && DECL_BIT_FIELD_TYPE (field) | |
677 | && ! integer_zerop (TYPE_SIZE (type))); | |
7306ed3f | 678 | |
9328904c MM |
679 | /* Record must have at least as much alignment as any field. |
680 | Otherwise, the alignment of the field within the record is | |
681 | meaningless. */ | |
245f1bfa | 682 | if (is_bitfield && targetm.ms_bitfield_layout_p (rli->t)) |
f913c102 | 683 | { |
e4850f36 DR |
684 | /* Here, the alignment of the underlying type of a bitfield can |
685 | affect the alignment of a record; even a zero-sized field | |
686 | can do this. The alignment should be to the alignment of | |
687 | the type, except that for zero-size bitfields this only | |
0e9e1e0a | 688 | applies if there was an immediately prior, nonzero-size |
e4850f36 DR |
689 | bitfield. (That's the way it is, experimentally.) */ |
690 | if (! integer_zerop (DECL_SIZE (field)) | |
46c5ad27 AJ |
691 | ? ! DECL_PACKED (field) |
692 | : (rli->prev_field | |
693 | && DECL_BIT_FIELD_TYPE (rli->prev_field) | |
694 | && ! integer_zerop (DECL_SIZE (rli->prev_field)))) | |
f913c102 | 695 | { |
e4850f36 DR |
696 | unsigned int type_align = TYPE_ALIGN (type); |
697 | type_align = MAX (type_align, desired_align); | |
698 | if (maximum_field_alignment != 0) | |
699 | type_align = MIN (type_align, maximum_field_alignment); | |
700 | rli->record_align = MAX (rli->record_align, type_align); | |
f913c102 | 701 | rli->unpacked_align = MAX (rli->unpacked_align, TYPE_ALIGN (type)); |
cbbaf4ae R |
702 | /* If we start a new run, make sure we start it properly aligned. */ |
703 | if ((!rli->prev_field | |
704 | || integer_zerop (DECL_SIZE (field)) | |
705 | || integer_zerop (DECL_SIZE (rli->prev_field)) | |
706 | || !host_integerp (DECL_SIZE (rli->prev_field), 0) | |
707 | || !host_integerp (TYPE_SIZE (type), 0) | |
708 | || !simple_cst_equal (TYPE_SIZE (type), | |
709 | TYPE_SIZE (TREE_TYPE (rli->prev_field))) | |
710 | || (rli->remaining_in_alignment | |
711 | < tree_low_cst (DECL_SIZE (field), 0))) | |
712 | && desired_align < type_align) | |
713 | desired_align = type_align; | |
f913c102 | 714 | } |
786de7eb | 715 | } |
3c12fcc2 | 716 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
78d55cc8 | 717 | else if (is_bitfield && PCC_BITFIELD_TYPE_MATTERS) |
9328904c | 718 | { |
8dc65b6e | 719 | /* Named bit-fields cause the entire structure to have the |
13c1cd82 PB |
720 | alignment implied by their type. Some targets also apply the same |
721 | rules to unnamed bitfields. */ | |
722 | if (DECL_NAME (field) != 0 | |
723 | || targetm.align_anon_bitfield ()) | |
7306ed3f | 724 | { |
9328904c | 725 | unsigned int type_align = TYPE_ALIGN (type); |
729a2125 | 726 | |
ad9335eb JJ |
727 | #ifdef ADJUST_FIELD_ALIGN |
728 | if (! TYPE_USER_ALIGN (type)) | |
729 | type_align = ADJUST_FIELD_ALIGN (field, type_align); | |
730 | #endif | |
731 | ||
d1a701eb MM |
732 | /* Targets might chose to handle unnamed and hence possibly |
733 | zero-width bitfield. Those are not influenced by #pragmas | |
734 | or packed attributes. */ | |
735 | if (integer_zerop (DECL_SIZE (field))) | |
736 | { | |
737 | if (initial_max_fld_align) | |
738 | type_align = MIN (type_align, | |
739 | initial_max_fld_align * BITS_PER_UNIT); | |
740 | } | |
741 | else if (maximum_field_alignment != 0) | |
9328904c MM |
742 | type_align = MIN (type_align, maximum_field_alignment); |
743 | else if (DECL_PACKED (field)) | |
744 | type_align = MIN (type_align, BITS_PER_UNIT); | |
e2301a83 | 745 | |
8dc65b6e MM |
746 | /* The alignment of the record is increased to the maximum |
747 | of the current alignment, the alignment indicated on the | |
748 | field (i.e., the alignment specified by an __aligned__ | |
749 | attribute), and the alignment indicated by the type of | |
750 | the field. */ | |
751 | rli->record_align = MAX (rli->record_align, desired_align); | |
9328904c | 752 | rli->record_align = MAX (rli->record_align, type_align); |
8dc65b6e | 753 | |
3c12fcc2 | 754 | if (warn_packed) |
e0cea8d9 | 755 | rli->unpacked_align = MAX (rli->unpacked_align, TYPE_ALIGN (type)); |
daf06049 | 756 | user_align |= TYPE_USER_ALIGN (type); |
3c12fcc2 | 757 | } |
9328904c | 758 | } |
9328904c | 759 | #endif |
78d55cc8 | 760 | else |
9328904c MM |
761 | { |
762 | rli->record_align = MAX (rli->record_align, desired_align); | |
770ae6cc | 763 | rli->unpacked_align = MAX (rli->unpacked_align, TYPE_ALIGN (type)); |
9328904c | 764 | } |
3c12fcc2 | 765 | |
0645ba8f MM |
766 | TYPE_USER_ALIGN (rli->t) |= user_align; |
767 | ||
768 | return desired_align; | |
769 | } | |
770 | ||
771 | /* Called from place_field to handle unions. */ | |
772 | ||
773 | static void | |
46c5ad27 | 774 | place_union_field (record_layout_info rli, tree field) |
0645ba8f MM |
775 | { |
776 | update_alignment_for_field (rli, field, /*known_align=*/0); | |
777 | ||
778 | DECL_FIELD_OFFSET (field) = size_zero_node; | |
779 | DECL_FIELD_BIT_OFFSET (field) = bitsize_zero_node; | |
780 | SET_DECL_OFFSET_ALIGN (field, BIGGEST_ALIGNMENT); | |
781 | ||
9dfb66b9 CD |
782 | /* If this is an ERROR_MARK return *after* having set the |
783 | field at the start of the union. This helps when parsing | |
784 | invalid fields. */ | |
785 | if (TREE_CODE (TREE_TYPE (field)) == ERROR_MARK) | |
786 | return; | |
787 | ||
0645ba8f MM |
788 | /* We assume the union's size will be a multiple of a byte so we don't |
789 | bother with BITPOS. */ | |
790 | if (TREE_CODE (rli->t) == UNION_TYPE) | |
791 | rli->offset = size_binop (MAX_EXPR, rli->offset, DECL_SIZE_UNIT (field)); | |
792 | else if (TREE_CODE (rli->t) == QUAL_UNION_TYPE) | |
4845b383 KH |
793 | rli->offset = fold_build3 (COND_EXPR, sizetype, |
794 | DECL_QUALIFIER (field), | |
795 | DECL_SIZE_UNIT (field), rli->offset); | |
0645ba8f MM |
796 | } |
797 | ||
b8089d8d | 798 | #if defined (PCC_BITFIELD_TYPE_MATTERS) || defined (BITFIELD_NBYTES_LIMITED) |
4977bab6 | 799 | /* A bitfield of SIZE with a required access alignment of ALIGN is allocated |
272d0bee | 800 | at BYTE_OFFSET / BIT_OFFSET. Return nonzero if the field would span more |
4977bab6 ZW |
801 | units of alignment than the underlying TYPE. */ |
802 | static int | |
46c5ad27 AJ |
803 | excess_unit_span (HOST_WIDE_INT byte_offset, HOST_WIDE_INT bit_offset, |
804 | HOST_WIDE_INT size, HOST_WIDE_INT align, tree type) | |
4977bab6 ZW |
805 | { |
806 | /* Note that the calculation of OFFSET might overflow; we calculate it so | |
807 | that we still get the right result as long as ALIGN is a power of two. */ | |
808 | unsigned HOST_WIDE_INT offset = byte_offset * BITS_PER_UNIT + bit_offset; | |
809 | ||
810 | offset = offset % align; | |
811 | return ((offset + size + align - 1) / align | |
812 | > ((unsigned HOST_WIDE_INT) tree_low_cst (TYPE_SIZE (type), 1) | |
813 | / align)); | |
814 | } | |
b8089d8d | 815 | #endif |
4977bab6 | 816 | |
0645ba8f MM |
817 | /* RLI contains information about the layout of a RECORD_TYPE. FIELD |
818 | is a FIELD_DECL to be added after those fields already present in | |
819 | T. (FIELD is not actually added to the TYPE_FIELDS list here; | |
820 | callers that desire that behavior must manually perform that step.) */ | |
821 | ||
822 | void | |
46c5ad27 | 823 | place_field (record_layout_info rli, tree field) |
0645ba8f MM |
824 | { |
825 | /* The alignment required for FIELD. */ | |
826 | unsigned int desired_align; | |
827 | /* The alignment FIELD would have if we just dropped it into the | |
828 | record as it presently stands. */ | |
829 | unsigned int known_align; | |
830 | unsigned int actual_align; | |
831 | /* The type of this field. */ | |
832 | tree type = TREE_TYPE (field); | |
833 | ||
dbe91deb | 834 | gcc_assert (TREE_CODE (field) != ERROR_MARK); |
0645ba8f MM |
835 | |
836 | /* If FIELD is static, then treat it like a separate variable, not | |
837 | really like a structure field. If it is a FUNCTION_DECL, it's a | |
838 | method. In both cases, all we do is lay out the decl, and we do | |
839 | it *after* the record is laid out. */ | |
840 | if (TREE_CODE (field) == VAR_DECL) | |
841 | { | |
842 | rli->pending_statics = tree_cons (NULL_TREE, field, | |
843 | rli->pending_statics); | |
844 | return; | |
845 | } | |
846 | ||
847 | /* Enumerators and enum types which are local to this class need not | |
848 | be laid out. Likewise for initialized constant fields. */ | |
849 | else if (TREE_CODE (field) != FIELD_DECL) | |
850 | return; | |
851 | ||
852 | /* Unions are laid out very differently than records, so split | |
853 | that code off to another function. */ | |
854 | else if (TREE_CODE (rli->t) != RECORD_TYPE) | |
855 | { | |
856 | place_union_field (rli, field); | |
857 | return; | |
858 | } | |
859 | ||
9dfb66b9 CD |
860 | else if (TREE_CODE (type) == ERROR_MARK) |
861 | { | |
862 | /* Place this field at the current allocation position, so we | |
863 | maintain monotonicity. */ | |
864 | DECL_FIELD_OFFSET (field) = rli->offset; | |
865 | DECL_FIELD_BIT_OFFSET (field) = rli->bitpos; | |
866 | SET_DECL_OFFSET_ALIGN (field, rli->offset_align); | |
867 | return; | |
868 | } | |
869 | ||
0645ba8f MM |
870 | /* Work out the known alignment so far. Note that A & (-A) is the |
871 | value of the least-significant bit in A that is one. */ | |
872 | if (! integer_zerop (rli->bitpos)) | |
873 | known_align = (tree_low_cst (rli->bitpos, 1) | |
874 | & - tree_low_cst (rli->bitpos, 1)); | |
875 | else if (integer_zerop (rli->offset)) | |
cbbaf4ae | 876 | known_align = 0; |
0645ba8f MM |
877 | else if (host_integerp (rli->offset, 1)) |
878 | known_align = (BITS_PER_UNIT | |
879 | * (tree_low_cst (rli->offset, 1) | |
880 | & - tree_low_cst (rli->offset, 1))); | |
881 | else | |
882 | known_align = rli->offset_align; | |
46c5ad27 | 883 | |
0645ba8f | 884 | desired_align = update_alignment_for_field (rli, field, known_align); |
cbbaf4ae R |
885 | if (known_align == 0) |
886 | known_align = MAX (BIGGEST_ALIGNMENT, rli->record_align); | |
0645ba8f | 887 | |
9328904c MM |
888 | if (warn_packed && DECL_PACKED (field)) |
889 | { | |
78d55cc8 | 890 | if (known_align >= TYPE_ALIGN (type)) |
3c12fcc2 | 891 | { |
9328904c | 892 | if (TYPE_ALIGN (type) > desired_align) |
3c12fcc2 | 893 | { |
9328904c | 894 | if (STRICT_ALIGNMENT) |
dee15844 JM |
895 | warning (OPT_Wattributes, "packed attribute causes " |
896 | "inefficient alignment for %q+D", field); | |
9328904c | 897 | else |
dee15844 JM |
898 | warning (OPT_Wattributes, "packed attribute is " |
899 | "unnecessary for %q+D", field); | |
3c12fcc2 | 900 | } |
3c12fcc2 | 901 | } |
9328904c MM |
902 | else |
903 | rli->packed_maybe_necessary = 1; | |
904 | } | |
7306ed3f | 905 | |
9328904c MM |
906 | /* Does this field automatically have alignment it needs by virtue |
907 | of the fields that precede it and the record's own alignment? */ | |
770ae6cc | 908 | if (known_align < desired_align) |
9328904c MM |
909 | { |
910 | /* No, we need to skip space before this field. | |
911 | Bump the cumulative size to multiple of field alignment. */ | |
7306ed3f | 912 | |
dee15844 | 913 | warning (OPT_Wpadded, "padding struct to align %q+D", field); |
3c12fcc2 | 914 | |
770ae6cc RK |
915 | /* If the alignment is still within offset_align, just align |
916 | the bit position. */ | |
917 | if (desired_align < rli->offset_align) | |
918 | rli->bitpos = round_up (rli->bitpos, desired_align); | |
9328904c MM |
919 | else |
920 | { | |
770ae6cc RK |
921 | /* First adjust OFFSET by the partial bits, then align. */ |
922 | rli->offset | |
923 | = size_binop (PLUS_EXPR, rli->offset, | |
455f19cb MM |
924 | fold_convert (sizetype, |
925 | size_binop (CEIL_DIV_EXPR, rli->bitpos, | |
926 | bitsize_unit_node))); | |
770ae6cc RK |
927 | rli->bitpos = bitsize_zero_node; |
928 | ||
929 | rli->offset = round_up (rli->offset, desired_align / BITS_PER_UNIT); | |
7306ed3f | 930 | } |
770ae6cc | 931 | |
b1254b72 RK |
932 | if (! TREE_CONSTANT (rli->offset)) |
933 | rli->offset_align = desired_align; | |
934 | ||
9328904c | 935 | } |
7306ed3f | 936 | |
770ae6cc RK |
937 | /* Handle compatibility with PCC. Note that if the record has any |
938 | variable-sized fields, we need not worry about compatibility. */ | |
7306ed3f | 939 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
9328904c | 940 | if (PCC_BITFIELD_TYPE_MATTERS |
245f1bfa | 941 | && ! targetm.ms_bitfield_layout_p (rli->t) |
9328904c MM |
942 | && TREE_CODE (field) == FIELD_DECL |
943 | && type != error_mark_node | |
770ae6cc RK |
944 | && DECL_BIT_FIELD (field) |
945 | && ! DECL_PACKED (field) | |
9328904c | 946 | && maximum_field_alignment == 0 |
770ae6cc RK |
947 | && ! integer_zerop (DECL_SIZE (field)) |
948 | && host_integerp (DECL_SIZE (field), 1) | |
949 | && host_integerp (rli->offset, 1) | |
950 | && host_integerp (TYPE_SIZE (type), 1)) | |
9328904c MM |
951 | { |
952 | unsigned int type_align = TYPE_ALIGN (type); | |
770ae6cc RK |
953 | tree dsize = DECL_SIZE (field); |
954 | HOST_WIDE_INT field_size = tree_low_cst (dsize, 1); | |
955 | HOST_WIDE_INT offset = tree_low_cst (rli->offset, 0); | |
956 | HOST_WIDE_INT bit_offset = tree_low_cst (rli->bitpos, 0); | |
9328904c | 957 | |
ad9335eb JJ |
958 | #ifdef ADJUST_FIELD_ALIGN |
959 | if (! TYPE_USER_ALIGN (type)) | |
960 | type_align = ADJUST_FIELD_ALIGN (field, type_align); | |
961 | #endif | |
962 | ||
9328904c MM |
963 | /* A bit field may not span more units of alignment of its type |
964 | than its type itself. Advance to next boundary if necessary. */ | |
4977bab6 | 965 | if (excess_unit_span (offset, bit_offset, field_size, type_align, type)) |
770ae6cc | 966 | rli->bitpos = round_up (rli->bitpos, type_align); |
daf06049 | 967 | |
0645ba8f | 968 | TYPE_USER_ALIGN (rli->t) |= TYPE_USER_ALIGN (type); |
9328904c | 969 | } |
7306ed3f JW |
970 | #endif |
971 | ||
7306ed3f | 972 | #ifdef BITFIELD_NBYTES_LIMITED |
9328904c | 973 | if (BITFIELD_NBYTES_LIMITED |
245f1bfa | 974 | && ! targetm.ms_bitfield_layout_p (rli->t) |
9328904c MM |
975 | && TREE_CODE (field) == FIELD_DECL |
976 | && type != error_mark_node | |
977 | && DECL_BIT_FIELD_TYPE (field) | |
770ae6cc RK |
978 | && ! DECL_PACKED (field) |
979 | && ! integer_zerop (DECL_SIZE (field)) | |
980 | && host_integerp (DECL_SIZE (field), 1) | |
163d3408 | 981 | && host_integerp (rli->offset, 1) |
770ae6cc | 982 | && host_integerp (TYPE_SIZE (type), 1)) |
9328904c MM |
983 | { |
984 | unsigned int type_align = TYPE_ALIGN (type); | |
770ae6cc RK |
985 | tree dsize = DECL_SIZE (field); |
986 | HOST_WIDE_INT field_size = tree_low_cst (dsize, 1); | |
987 | HOST_WIDE_INT offset = tree_low_cst (rli->offset, 0); | |
988 | HOST_WIDE_INT bit_offset = tree_low_cst (rli->bitpos, 0); | |
e2301a83 | 989 | |
ad9335eb JJ |
990 | #ifdef ADJUST_FIELD_ALIGN |
991 | if (! TYPE_USER_ALIGN (type)) | |
992 | type_align = ADJUST_FIELD_ALIGN (field, type_align); | |
993 | #endif | |
994 | ||
9328904c MM |
995 | if (maximum_field_alignment != 0) |
996 | type_align = MIN (type_align, maximum_field_alignment); | |
997 | /* ??? This test is opposite the test in the containing if | |
998 | statement, so this code is unreachable currently. */ | |
999 | else if (DECL_PACKED (field)) | |
1000 | type_align = MIN (type_align, BITS_PER_UNIT); | |
1001 | ||
1002 | /* A bit field may not span the unit of alignment of its type. | |
1003 | Advance to next boundary if necessary. */ | |
4977bab6 | 1004 | if (excess_unit_span (offset, bit_offset, field_size, type_align, type)) |
770ae6cc | 1005 | rli->bitpos = round_up (rli->bitpos, type_align); |
daf06049 | 1006 | |
0645ba8f | 1007 | TYPE_USER_ALIGN (rli->t) |= TYPE_USER_ALIGN (type); |
9328904c | 1008 | } |
7306ed3f JW |
1009 | #endif |
1010 | ||
e4850f36 DR |
1011 | /* See the docs for TARGET_MS_BITFIELD_LAYOUT_P for details. |
1012 | A subtlety: | |
1013 | When a bit field is inserted into a packed record, the whole | |
1014 | size of the underlying type is used by one or more same-size | |
4977bab6 | 1015 | adjacent bitfields. (That is, if its long:3, 32 bits is |
e4850f36 DR |
1016 | used in the record, and any additional adjacent long bitfields are |
1017 | packed into the same chunk of 32 bits. However, if the size | |
1018 | changes, a new field of that size is allocated.) In an unpacked | |
14b493d6 | 1019 | record, this is the same as using alignment, but not equivalent |
4977bab6 | 1020 | when packing. |
e4850f36 | 1021 | |
14b493d6 | 1022 | Note: for compatibility, we use the type size, not the type alignment |
e4850f36 DR |
1023 | to determine alignment, since that matches the documentation */ |
1024 | ||
245f1bfa | 1025 | if (targetm.ms_bitfield_layout_p (rli->t) |
e4850f36 | 1026 | && ((DECL_BIT_FIELD_TYPE (field) && ! DECL_PACKED (field)) |
46c5ad27 | 1027 | || (rli->prev_field && ! DECL_PACKED (rli->prev_field)))) |
f913c102 | 1028 | { |
e4850f36 | 1029 | /* At this point, either the prior or current are bitfields, |
991b6592 | 1030 | (possibly both), and we're dealing with MS packing. */ |
e4850f36 | 1031 | tree prev_saved = rli->prev_field; |
f913c102 | 1032 | |
e4850f36 | 1033 | /* Is the prior field a bitfield? If so, handle "runs" of same |
991b6592 KH |
1034 | type size fields. */ |
1035 | if (rli->prev_field /* necessarily a bitfield if it exists. */) | |
e4850f36 DR |
1036 | { |
1037 | /* If both are bitfields, nonzero, and the same size, this is | |
1038 | the middle of a run. Zero declared size fields are special | |
1039 | and handled as "end of run". (Note: it's nonzero declared | |
1040 | size, but equal type sizes!) (Since we know that both | |
1041 | the current and previous fields are bitfields by the | |
1042 | time we check it, DECL_SIZE must be present for both.) */ | |
1043 | if (DECL_BIT_FIELD_TYPE (field) | |
1044 | && !integer_zerop (DECL_SIZE (field)) | |
1045 | && !integer_zerop (DECL_SIZE (rli->prev_field)) | |
0384674e RK |
1046 | && host_integerp (DECL_SIZE (rli->prev_field), 0) |
1047 | && host_integerp (TYPE_SIZE (type), 0) | |
e4850f36 | 1048 | && simple_cst_equal (TYPE_SIZE (type), |
0384674e | 1049 | TYPE_SIZE (TREE_TYPE (rli->prev_field)))) |
e4850f36 DR |
1050 | { |
1051 | /* We're in the middle of a run of equal type size fields; make | |
1052 | sure we realign if we run out of bits. (Not decl size, | |
1053 | type size!) */ | |
0384674e | 1054 | HOST_WIDE_INT bitsize = tree_low_cst (DECL_SIZE (field), 0); |
e4850f36 DR |
1055 | |
1056 | if (rli->remaining_in_alignment < bitsize) | |
1057 | { | |
cbbaf4ae R |
1058 | /* If PREV_FIELD is packed, and we haven't lumped |
1059 | non-packed bitfields with it, treat this as if PREV_FIELD | |
1060 | was not a bitfield. This avoids anomalies where a packed | |
1061 | bitfield with long long base type can take up more | |
1062 | space than a same-size bitfield with base type short. */ | |
1063 | if (rli->prev_packed) | |
1064 | rli->prev_field = prev_saved = NULL; | |
1065 | else | |
1066 | { | |
1067 | /* out of bits; bump up to next 'word'. */ | |
1068 | rli->offset = DECL_FIELD_OFFSET (rli->prev_field); | |
1069 | rli->bitpos | |
1070 | = size_binop (PLUS_EXPR, TYPE_SIZE (type), | |
1071 | DECL_FIELD_BIT_OFFSET (rli->prev_field)); | |
1072 | rli->prev_field = field; | |
1073 | rli->remaining_in_alignment | |
1074 | = tree_low_cst (TYPE_SIZE (type), 0) - bitsize; | |
1075 | } | |
e4850f36 | 1076 | } |
cbbaf4ae R |
1077 | else |
1078 | rli->remaining_in_alignment -= bitsize; | |
e4850f36 | 1079 | } |
cbbaf4ae R |
1080 | else if (rli->prev_packed) |
1081 | rli->prev_field = prev_saved = NULL; | |
e4850f36 DR |
1082 | else |
1083 | { | |
4977bab6 ZW |
1084 | /* End of a run: if leaving a run of bitfields of the same type |
1085 | size, we have to "use up" the rest of the bits of the type | |
e4850f36 DR |
1086 | size. |
1087 | ||
1088 | Compute the new position as the sum of the size for the prior | |
1089 | type and where we first started working on that type. | |
1090 | Note: since the beginning of the field was aligned then | |
1091 | of course the end will be too. No round needed. */ | |
1092 | ||
1093 | if (!integer_zerop (DECL_SIZE (rli->prev_field))) | |
1094 | { | |
0384674e RK |
1095 | tree type_size = TYPE_SIZE (TREE_TYPE (rli->prev_field)); |
1096 | ||
cbbaf4ae R |
1097 | /* If the desired alignment is greater or equal to TYPE_SIZE, |
1098 | we have already adjusted rli->bitpos / rli->offset above. | |
1099 | */ | |
1100 | if ((unsigned HOST_WIDE_INT) tree_low_cst (type_size, 0) | |
1101 | > desired_align) | |
1102 | rli->bitpos | |
1103 | = size_binop (PLUS_EXPR, type_size, | |
1104 | DECL_FIELD_BIT_OFFSET (rli->prev_field)); | |
e4850f36 DR |
1105 | } |
1106 | else | |
0384674e RK |
1107 | /* We "use up" size zero fields; the code below should behave |
1108 | as if the prior field was not a bitfield. */ | |
1109 | prev_saved = NULL; | |
e4850f36 | 1110 | |
4977bab6 | 1111 | /* Cause a new bitfield to be captured, either this time (if |
991b6592 | 1112 | currently a bitfield) or next time we see one. */ |
e4850f36 DR |
1113 | if (!DECL_BIT_FIELD_TYPE(field) |
1114 | || integer_zerop (DECL_SIZE (field))) | |
0384674e | 1115 | rli->prev_field = NULL; |
e4850f36 | 1116 | } |
0384674e | 1117 | |
cbbaf4ae | 1118 | rli->prev_packed = 0; |
e4850f36 DR |
1119 | normalize_rli (rli); |
1120 | } | |
1121 | ||
1122 | /* If we're starting a new run of same size type bitfields | |
1123 | (or a run of non-bitfields), set up the "first of the run" | |
4977bab6 | 1124 | fields. |
e4850f36 DR |
1125 | |
1126 | That is, if the current field is not a bitfield, or if there | |
1127 | was a prior bitfield the type sizes differ, or if there wasn't | |
1128 | a prior bitfield the size of the current field is nonzero. | |
1129 | ||
1130 | Note: we must be sure to test ONLY the type size if there was | |
1131 | a prior bitfield and ONLY for the current field being zero if | |
1132 | there wasn't. */ | |
1133 | ||
1134 | if (!DECL_BIT_FIELD_TYPE (field) | |
4977bab6 | 1135 | || ( prev_saved != NULL |
e4850f36 | 1136 | ? !simple_cst_equal (TYPE_SIZE (type), |
0384674e RK |
1137 | TYPE_SIZE (TREE_TYPE (prev_saved))) |
1138 | : !integer_zerop (DECL_SIZE (field)) )) | |
e4850f36 | 1139 | { |
0384674e RK |
1140 | /* Never smaller than a byte for compatibility. */ |
1141 | unsigned int type_align = BITS_PER_UNIT; | |
e4850f36 | 1142 | |
4977bab6 | 1143 | /* (When not a bitfield), we could be seeing a flex array (with |
e4850f36 | 1144 | no DECL_SIZE). Since we won't be using remaining_in_alignment |
4977bab6 | 1145 | until we see a bitfield (and come by here again) we just skip |
e4850f36 | 1146 | calculating it. */ |
0384674e RK |
1147 | if (DECL_SIZE (field) != NULL |
1148 | && host_integerp (TYPE_SIZE (TREE_TYPE (field)), 0) | |
1149 | && host_integerp (DECL_SIZE (field), 0)) | |
1150 | rli->remaining_in_alignment | |
1151 | = tree_low_cst (TYPE_SIZE (TREE_TYPE(field)), 0) | |
1152 | - tree_low_cst (DECL_SIZE (field), 0); | |
e4850f36 | 1153 | |
991b6592 | 1154 | /* Now align (conventionally) for the new type. */ |
e4850f36 | 1155 | if (!DECL_PACKED(field)) |
0384674e | 1156 | type_align = MAX(TYPE_ALIGN (type), type_align); |
e4850f36 DR |
1157 | |
1158 | if (prev_saved | |
1159 | && DECL_BIT_FIELD_TYPE (prev_saved) | |
1160 | /* If the previous bit-field is zero-sized, we've already | |
1161 | accounted for its alignment needs (or ignored it, if | |
1162 | appropriate) while placing it. */ | |
1163 | && ! integer_zerop (DECL_SIZE (prev_saved))) | |
1164 | type_align = MAX (type_align, | |
1165 | TYPE_ALIGN (TREE_TYPE (prev_saved))); | |
f913c102 | 1166 | |
e4850f36 DR |
1167 | if (maximum_field_alignment != 0) |
1168 | type_align = MIN (type_align, maximum_field_alignment); | |
f913c102 | 1169 | |
e4850f36 | 1170 | rli->bitpos = round_up (rli->bitpos, type_align); |
0384674e | 1171 | |
e4850f36 | 1172 | /* If we really aligned, don't allow subsequent bitfields |
991b6592 | 1173 | to undo that. */ |
e4850f36 DR |
1174 | rli->prev_field = NULL; |
1175 | } | |
f913c102 AO |
1176 | } |
1177 | ||
770ae6cc RK |
1178 | /* Offset so far becomes the position of this field after normalizing. */ |
1179 | normalize_rli (rli); | |
1180 | DECL_FIELD_OFFSET (field) = rli->offset; | |
1181 | DECL_FIELD_BIT_OFFSET (field) = rli->bitpos; | |
2f5c7f45 | 1182 | SET_DECL_OFFSET_ALIGN (field, rli->offset_align); |
770ae6cc RK |
1183 | |
1184 | /* If this field ended up more aligned than we thought it would be (we | |
1185 | approximate this by seeing if its position changed), lay out the field | |
1186 | again; perhaps we can use an integral mode for it now. */ | |
4b6bf620 | 1187 | if (! integer_zerop (DECL_FIELD_BIT_OFFSET (field))) |
770ae6cc RK |
1188 | actual_align = (tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1) |
1189 | & - tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)); | |
4b6bf620 | 1190 | else if (integer_zerop (DECL_FIELD_OFFSET (field))) |
cbbaf4ae | 1191 | actual_align = MAX (BIGGEST_ALIGNMENT, rli->record_align); |
770ae6cc RK |
1192 | else if (host_integerp (DECL_FIELD_OFFSET (field), 1)) |
1193 | actual_align = (BITS_PER_UNIT | |
1194 | * (tree_low_cst (DECL_FIELD_OFFSET (field), 1) | |
1195 | & - tree_low_cst (DECL_FIELD_OFFSET (field), 1))); | |
9328904c | 1196 | else |
770ae6cc | 1197 | actual_align = DECL_OFFSET_ALIGN (field); |
cbbaf4ae R |
1198 | /* ACTUAL_ALIGN is still the actual alignment *within the record* . |
1199 | store / extract bit field operations will check the alignment of the | |
1200 | record against the mode of bit fields. */ | |
770ae6cc RK |
1201 | |
1202 | if (known_align != actual_align) | |
1203 | layout_decl (field, actual_align); | |
1204 | ||
cbbaf4ae R |
1205 | if (DECL_BIT_FIELD_TYPE (field)) |
1206 | { | |
1207 | unsigned int type_align = TYPE_ALIGN (type); | |
d1a701eb MM |
1208 | unsigned int mfa = maximum_field_alignment; |
1209 | ||
1210 | if (integer_zerop (DECL_SIZE (field))) | |
1211 | mfa = initial_max_fld_align * BITS_PER_UNIT; | |
cbbaf4ae R |
1212 | |
1213 | /* Only the MS bitfields use this. We used to also put any kind of | |
1214 | packed bit fields into prev_field, but that makes no sense, because | |
1215 | an 8 bit packed bit field shouldn't impose more restriction on | |
1216 | following fields than a char field, and the alignment requirements | |
1217 | are also not fulfilled. | |
1218 | There is no sane value to set rli->remaining_in_alignment to when | |
1219 | a packed bitfield in prev_field is unaligned. */ | |
d1a701eb MM |
1220 | if (mfa != 0) |
1221 | type_align = MIN (type_align, mfa); | |
cbbaf4ae R |
1222 | gcc_assert (rli->prev_field |
1223 | || actual_align >= type_align || DECL_PACKED (field) | |
1224 | || integer_zerop (DECL_SIZE (field)) | |
1225 | || !targetm.ms_bitfield_layout_p (rli->t)); | |
1226 | if (rli->prev_field == NULL && actual_align >= type_align | |
1227 | && !integer_zerop (DECL_SIZE (field))) | |
1228 | { | |
1229 | rli->prev_field = field; | |
1230 | /* rli->remaining_in_alignment has not been set if the bitfield | |
1231 | has size zero, or if it is a packed bitfield. */ | |
1232 | rli->remaining_in_alignment | |
1233 | = (tree_low_cst (TYPE_SIZE (TREE_TYPE (field)), 0) | |
1234 | - tree_low_cst (DECL_SIZE (field), 0)); | |
1235 | rli->prev_packed = DECL_PACKED (field); | |
1236 | ||
1237 | } | |
1238 | else if (rli->prev_field && DECL_PACKED (field)) | |
1239 | { | |
1240 | HOST_WIDE_INT bitsize = tree_low_cst (DECL_SIZE (field), 0); | |
1241 | ||
1242 | if (rli->remaining_in_alignment < bitsize) | |
1243 | rli->prev_field = NULL; | |
1244 | else | |
1245 | rli->remaining_in_alignment -= bitsize; | |
1246 | } | |
1247 | } | |
f913c102 | 1248 | |
770ae6cc RK |
1249 | /* Now add size of this field to the size of the record. If the size is |
1250 | not constant, treat the field as being a multiple of bytes and just | |
1251 | adjust the offset, resetting the bit position. Otherwise, apportion the | |
1252 | size amongst the bit position and offset. First handle the case of an | |
1253 | unspecified size, which can happen when we have an invalid nested struct | |
1254 | definition, such as struct j { struct j { int i; } }. The error message | |
1255 | is printed in finish_struct. */ | |
1256 | if (DECL_SIZE (field) == 0) | |
1257 | /* Do nothing. */; | |
292f30c5 EB |
1258 | else if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST |
1259 | || TREE_CONSTANT_OVERFLOW (DECL_SIZE (field))) | |
9328904c | 1260 | { |
770ae6cc RK |
1261 | rli->offset |
1262 | = size_binop (PLUS_EXPR, rli->offset, | |
455f19cb MM |
1263 | fold_convert (sizetype, |
1264 | size_binop (CEIL_DIV_EXPR, rli->bitpos, | |
1265 | bitsize_unit_node))); | |
770ae6cc RK |
1266 | rli->offset |
1267 | = size_binop (PLUS_EXPR, rli->offset, DECL_SIZE_UNIT (field)); | |
1268 | rli->bitpos = bitsize_zero_node; | |
3923e410 | 1269 | rli->offset_align = MIN (rli->offset_align, desired_align); |
9328904c | 1270 | } |
9328904c MM |
1271 | else |
1272 | { | |
770ae6cc RK |
1273 | rli->bitpos = size_binop (PLUS_EXPR, rli->bitpos, DECL_SIZE (field)); |
1274 | normalize_rli (rli); | |
7306ed3f | 1275 | } |
9328904c | 1276 | } |
7306ed3f | 1277 | |
9328904c MM |
1278 | /* Assuming that all the fields have been laid out, this function uses |
1279 | RLI to compute the final TYPE_SIZE, TYPE_ALIGN, etc. for the type | |
14b493d6 | 1280 | indicated by RLI. */ |
7306ed3f | 1281 | |
9328904c | 1282 | static void |
46c5ad27 | 1283 | finalize_record_size (record_layout_info rli) |
9328904c | 1284 | { |
770ae6cc RK |
1285 | tree unpadded_size, unpadded_size_unit; |
1286 | ||
65e14bf5 RK |
1287 | /* Now we want just byte and bit offsets, so set the offset alignment |
1288 | to be a byte and then normalize. */ | |
1289 | rli->offset_align = BITS_PER_UNIT; | |
1290 | normalize_rli (rli); | |
7306ed3f JW |
1291 | |
1292 | /* Determine the desired alignment. */ | |
1293 | #ifdef ROUND_TYPE_ALIGN | |
9328904c | 1294 | TYPE_ALIGN (rli->t) = ROUND_TYPE_ALIGN (rli->t, TYPE_ALIGN (rli->t), |
b451555a | 1295 | rli->record_align); |
7306ed3f | 1296 | #else |
9328904c | 1297 | TYPE_ALIGN (rli->t) = MAX (TYPE_ALIGN (rli->t), rli->record_align); |
7306ed3f JW |
1298 | #endif |
1299 | ||
65e14bf5 RK |
1300 | /* Compute the size so far. Be sure to allow for extra bits in the |
1301 | size in bytes. We have guaranteed above that it will be no more | |
1302 | than a single byte. */ | |
1303 | unpadded_size = rli_size_so_far (rli); | |
1304 | unpadded_size_unit = rli_size_unit_so_far (rli); | |
1305 | if (! integer_zerop (rli->bitpos)) | |
1306 | unpadded_size_unit | |
1307 | = size_binop (PLUS_EXPR, unpadded_size_unit, size_one_node); | |
770ae6cc | 1308 | |
f9da5064 | 1309 | /* Round the size up to be a multiple of the required alignment. */ |
770ae6cc | 1310 | TYPE_SIZE (rli->t) = round_up (unpadded_size, TYPE_ALIGN (rli->t)); |
a4e9ffe5 RK |
1311 | TYPE_SIZE_UNIT (rli->t) |
1312 | = round_up (unpadded_size_unit, TYPE_ALIGN_UNIT (rli->t)); | |
729a2125 | 1313 | |
3176a0c2 | 1314 | if (TREE_CONSTANT (unpadded_size) |
770ae6cc | 1315 | && simple_cst_equal (unpadded_size, TYPE_SIZE (rli->t)) == 0) |
3176a0c2 | 1316 | warning (OPT_Wpadded, "padding struct size to alignment boundary"); |
786de7eb | 1317 | |
770ae6cc RK |
1318 | if (warn_packed && TREE_CODE (rli->t) == RECORD_TYPE |
1319 | && TYPE_PACKED (rli->t) && ! rli->packed_maybe_necessary | |
1320 | && TREE_CONSTANT (unpadded_size)) | |
3c12fcc2 GM |
1321 | { |
1322 | tree unpacked_size; | |
729a2125 | 1323 | |
3c12fcc2 | 1324 | #ifdef ROUND_TYPE_ALIGN |
9328904c MM |
1325 | rli->unpacked_align |
1326 | = ROUND_TYPE_ALIGN (rli->t, TYPE_ALIGN (rli->t), rli->unpacked_align); | |
3c12fcc2 | 1327 | #else |
9328904c | 1328 | rli->unpacked_align = MAX (TYPE_ALIGN (rli->t), rli->unpacked_align); |
3c12fcc2 | 1329 | #endif |
770ae6cc | 1330 | |
9328904c | 1331 | unpacked_size = round_up (TYPE_SIZE (rli->t), rli->unpacked_align); |
9328904c | 1332 | if (simple_cst_equal (unpacked_size, TYPE_SIZE (rli->t))) |
3c12fcc2 | 1333 | { |
770ae6cc RK |
1334 | TYPE_PACKED (rli->t) = 0; |
1335 | ||
9328904c | 1336 | if (TYPE_NAME (rli->t)) |
3c12fcc2 | 1337 | { |
63ad61ed | 1338 | const char *name; |
729a2125 | 1339 | |
9328904c MM |
1340 | if (TREE_CODE (TYPE_NAME (rli->t)) == IDENTIFIER_NODE) |
1341 | name = IDENTIFIER_POINTER (TYPE_NAME (rli->t)); | |
3c12fcc2 | 1342 | else |
9328904c | 1343 | name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (rli->t))); |
770ae6cc | 1344 | |
3c12fcc2 | 1345 | if (STRICT_ALIGNMENT) |
3176a0c2 | 1346 | warning (OPT_Wpacked, "packed attribute causes inefficient " |
971801ff | 1347 | "alignment for %qs", name); |
3c12fcc2 | 1348 | else |
3176a0c2 | 1349 | warning (OPT_Wpacked, |
5c498b10 | 1350 | "packed attribute is unnecessary for %qs", name); |
3c12fcc2 GM |
1351 | } |
1352 | else | |
1353 | { | |
1354 | if (STRICT_ALIGNMENT) | |
3176a0c2 | 1355 | warning (OPT_Wpacked, |
5c498b10 | 1356 | "packed attribute causes inefficient alignment"); |
3c12fcc2 | 1357 | else |
3176a0c2 | 1358 | warning (OPT_Wpacked, "packed attribute is unnecessary"); |
3c12fcc2 GM |
1359 | } |
1360 | } | |
3c12fcc2 | 1361 | } |
9328904c MM |
1362 | } |
1363 | ||
1364 | /* Compute the TYPE_MODE for the TYPE (which is a RECORD_TYPE). */ | |
7306ed3f | 1365 | |
65e14bf5 | 1366 | void |
46c5ad27 | 1367 | compute_record_mode (tree type) |
9328904c | 1368 | { |
770ae6cc RK |
1369 | tree field; |
1370 | enum machine_mode mode = VOIDmode; | |
1371 | ||
9328904c MM |
1372 | /* Most RECORD_TYPEs have BLKmode, so we start off assuming that. |
1373 | However, if possible, we use a mode that fits in a register | |
1374 | instead, in order to allow for better optimization down the | |
1375 | line. */ | |
1376 | TYPE_MODE (type) = BLKmode; | |
9328904c | 1377 | |
770ae6cc RK |
1378 | if (! host_integerp (TYPE_SIZE (type), 1)) |
1379 | return; | |
9328904c | 1380 | |
770ae6cc RK |
1381 | /* A record which has any BLKmode members must itself be |
1382 | BLKmode; it can't go in a register. Unless the member is | |
1383 | BLKmode only because it isn't aligned. */ | |
1384 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
1385 | { | |
770ae6cc RK |
1386 | if (TREE_CODE (field) != FIELD_DECL) |
1387 | continue; | |
9328904c | 1388 | |
770ae6cc RK |
1389 | if (TREE_CODE (TREE_TYPE (field)) == ERROR_MARK |
1390 | || (TYPE_MODE (TREE_TYPE (field)) == BLKmode | |
7a06d606 RK |
1391 | && ! TYPE_NO_FORCE_BLK (TREE_TYPE (field)) |
1392 | && !(TYPE_SIZE (TREE_TYPE (field)) != 0 | |
1393 | && integer_zerop (TYPE_SIZE (TREE_TYPE (field))))) | |
770ae6cc | 1394 | || ! host_integerp (bit_position (field), 1) |
6a9f6727 | 1395 | || DECL_SIZE (field) == 0 |
770ae6cc RK |
1396 | || ! host_integerp (DECL_SIZE (field), 1)) |
1397 | return; | |
1398 | ||
770ae6cc RK |
1399 | /* If this field is the whole struct, remember its mode so |
1400 | that, say, we can put a double in a class into a DF | |
a8ca7756 JW |
1401 | register instead of forcing it to live in the stack. */ |
1402 | if (simple_cst_equal (TYPE_SIZE (type), DECL_SIZE (field))) | |
770ae6cc | 1403 | mode = DECL_MODE (field); |
9328904c | 1404 | |
31a02448 | 1405 | #ifdef MEMBER_TYPE_FORCES_BLK |
770ae6cc RK |
1406 | /* With some targets, eg. c4x, it is sub-optimal |
1407 | to access an aligned BLKmode structure as a scalar. */ | |
0d7839da | 1408 | |
182e515e | 1409 | if (MEMBER_TYPE_FORCES_BLK (field, mode)) |
770ae6cc | 1410 | return; |
31a02448 | 1411 | #endif /* MEMBER_TYPE_FORCES_BLK */ |
770ae6cc | 1412 | } |
9328904c | 1413 | |
897f610b RS |
1414 | /* If we only have one real field; use its mode if that mode's size |
1415 | matches the type's size. This only applies to RECORD_TYPE. This | |
1416 | does not apply to unions. */ | |
1417 | if (TREE_CODE (type) == RECORD_TYPE && mode != VOIDmode | |
f439f9a5 R |
1418 | && host_integerp (TYPE_SIZE (type), 1) |
1419 | && GET_MODE_BITSIZE (mode) == TREE_INT_CST_LOW (TYPE_SIZE (type))) | |
770ae6cc | 1420 | TYPE_MODE (type) = mode; |
f439f9a5 R |
1421 | else |
1422 | TYPE_MODE (type) = mode_for_size_tree (TYPE_SIZE (type), MODE_INT, 1); | |
770ae6cc RK |
1423 | |
1424 | /* If structure's known alignment is less than what the scalar | |
1425 | mode would need, and it matters, then stick with BLKmode. */ | |
1426 | if (TYPE_MODE (type) != BLKmode | |
1427 | && STRICT_ALIGNMENT | |
1428 | && ! (TYPE_ALIGN (type) >= BIGGEST_ALIGNMENT | |
1429 | || TYPE_ALIGN (type) >= GET_MODE_ALIGNMENT (TYPE_MODE (type)))) | |
1430 | { | |
1431 | /* If this is the only reason this type is BLKmode, then | |
1432 | don't force containing types to be BLKmode. */ | |
1433 | TYPE_NO_FORCE_BLK (type) = 1; | |
1434 | TYPE_MODE (type) = BLKmode; | |
9328904c | 1435 | } |
7306ed3f | 1436 | } |
9328904c MM |
1437 | |
1438 | /* Compute TYPE_SIZE and TYPE_ALIGN for TYPE, once it has been laid | |
1439 | out. */ | |
1440 | ||
1441 | static void | |
46c5ad27 | 1442 | finalize_type_size (tree type) |
9328904c MM |
1443 | { |
1444 | /* Normally, use the alignment corresponding to the mode chosen. | |
1445 | However, where strict alignment is not required, avoid | |
1446 | over-aligning structures, since most compilers do not do this | |
490272b4 | 1447 | alignment. */ |
9328904c MM |
1448 | |
1449 | if (TYPE_MODE (type) != BLKmode && TYPE_MODE (type) != VOIDmode | |
490272b4 | 1450 | && (STRICT_ALIGNMENT |
9328904c MM |
1451 | || (TREE_CODE (type) != RECORD_TYPE && TREE_CODE (type) != UNION_TYPE |
1452 | && TREE_CODE (type) != QUAL_UNION_TYPE | |
1453 | && TREE_CODE (type) != ARRAY_TYPE))) | |
11cf4d18 | 1454 | { |
490272b4 RH |
1455 | unsigned mode_align = GET_MODE_ALIGNMENT (TYPE_MODE (type)); |
1456 | ||
1457 | /* Don't override a larger alignment requirement coming from a user | |
1458 | alignment of one of the fields. */ | |
1459 | if (mode_align >= TYPE_ALIGN (type)) | |
1460 | { | |
1461 | TYPE_ALIGN (type) = mode_align; | |
1462 | TYPE_USER_ALIGN (type) = 0; | |
1463 | } | |
11cf4d18 | 1464 | } |
9328904c MM |
1465 | |
1466 | /* Do machine-dependent extra alignment. */ | |
1467 | #ifdef ROUND_TYPE_ALIGN | |
1468 | TYPE_ALIGN (type) | |
1469 | = ROUND_TYPE_ALIGN (type, TYPE_ALIGN (type), BITS_PER_UNIT); | |
1470 | #endif | |
1471 | ||
9328904c | 1472 | /* If we failed to find a simple way to calculate the unit size |
770ae6cc | 1473 | of the type, find it by division. */ |
9328904c MM |
1474 | if (TYPE_SIZE_UNIT (type) == 0 && TYPE_SIZE (type) != 0) |
1475 | /* TYPE_SIZE (type) is computed in bitsizetype. After the division, the | |
1476 | result will fit in sizetype. We will get more efficient code using | |
1477 | sizetype, so we force a conversion. */ | |
1478 | TYPE_SIZE_UNIT (type) | |
455f19cb MM |
1479 | = fold_convert (sizetype, |
1480 | size_binop (FLOOR_DIV_EXPR, TYPE_SIZE (type), | |
1481 | bitsize_unit_node)); | |
9328904c | 1482 | |
770ae6cc RK |
1483 | if (TYPE_SIZE (type) != 0) |
1484 | { | |
770ae6cc | 1485 | TYPE_SIZE (type) = round_up (TYPE_SIZE (type), TYPE_ALIGN (type)); |
a4e9ffe5 RK |
1486 | TYPE_SIZE_UNIT (type) = round_up (TYPE_SIZE_UNIT (type), |
1487 | TYPE_ALIGN_UNIT (type)); | |
770ae6cc RK |
1488 | } |
1489 | ||
1490 | /* Evaluate nonconstant sizes only once, either now or as soon as safe. */ | |
1491 | if (TYPE_SIZE (type) != 0 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) | |
1492 | TYPE_SIZE (type) = variable_size (TYPE_SIZE (type)); | |
9328904c MM |
1493 | if (TYPE_SIZE_UNIT (type) != 0 |
1494 | && TREE_CODE (TYPE_SIZE_UNIT (type)) != INTEGER_CST) | |
1495 | TYPE_SIZE_UNIT (type) = variable_size (TYPE_SIZE_UNIT (type)); | |
1496 | ||
1497 | /* Also layout any other variants of the type. */ | |
1498 | if (TYPE_NEXT_VARIANT (type) | |
1499 | || type != TYPE_MAIN_VARIANT (type)) | |
1500 | { | |
1501 | tree variant; | |
1502 | /* Record layout info of this variant. */ | |
1503 | tree size = TYPE_SIZE (type); | |
1504 | tree size_unit = TYPE_SIZE_UNIT (type); | |
1505 | unsigned int align = TYPE_ALIGN (type); | |
11cf4d18 | 1506 | unsigned int user_align = TYPE_USER_ALIGN (type); |
9328904c MM |
1507 | enum machine_mode mode = TYPE_MODE (type); |
1508 | ||
1509 | /* Copy it into all variants. */ | |
1510 | for (variant = TYPE_MAIN_VARIANT (type); | |
1511 | variant != 0; | |
1512 | variant = TYPE_NEXT_VARIANT (variant)) | |
1513 | { | |
1514 | TYPE_SIZE (variant) = size; | |
1515 | TYPE_SIZE_UNIT (variant) = size_unit; | |
1516 | TYPE_ALIGN (variant) = align; | |
11cf4d18 | 1517 | TYPE_USER_ALIGN (variant) = user_align; |
9328904c MM |
1518 | TYPE_MODE (variant) = mode; |
1519 | } | |
1520 | } | |
1521 | } | |
1522 | ||
1523 | /* Do all of the work required to layout the type indicated by RLI, | |
1524 | once the fields have been laid out. This function will call `free' | |
17bbb839 MM |
1525 | for RLI, unless FREE_P is false. Passing a value other than false |
1526 | for FREE_P is bad practice; this option only exists to support the | |
1527 | G++ 3.2 ABI. */ | |
9328904c MM |
1528 | |
1529 | void | |
46c5ad27 | 1530 | finish_record_layout (record_layout_info rli, int free_p) |
9328904c | 1531 | { |
770ae6cc RK |
1532 | /* Compute the final size. */ |
1533 | finalize_record_size (rli); | |
1534 | ||
1535 | /* Compute the TYPE_MODE for the record. */ | |
1536 | compute_record_mode (rli->t); | |
cc9d4a85 | 1537 | |
8d8238b6 JM |
1538 | /* Perform any last tweaks to the TYPE_SIZE, etc. */ |
1539 | finalize_type_size (rli->t); | |
1540 | ||
9328904c MM |
1541 | /* Lay out any static members. This is done now because their type |
1542 | may use the record's type. */ | |
1543 | while (rli->pending_statics) | |
1544 | { | |
1545 | layout_decl (TREE_VALUE (rli->pending_statics), 0); | |
1546 | rli->pending_statics = TREE_CHAIN (rli->pending_statics); | |
1547 | } | |
cc9d4a85 | 1548 | |
9328904c | 1549 | /* Clean up. */ |
17bbb839 MM |
1550 | if (free_p) |
1551 | free (rli); | |
9328904c | 1552 | } |
7306ed3f | 1553 | \f |
4977bab6 ZW |
1554 | |
1555 | /* Finish processing a builtin RECORD_TYPE type TYPE. It's name is | |
1556 | NAME, its fields are chained in reverse on FIELDS. | |
1557 | ||
1558 | If ALIGN_TYPE is non-null, it is given the same alignment as | |
1559 | ALIGN_TYPE. */ | |
1560 | ||
1561 | void | |
46c5ad27 AJ |
1562 | finish_builtin_struct (tree type, const char *name, tree fields, |
1563 | tree align_type) | |
4977bab6 ZW |
1564 | { |
1565 | tree tail, next; | |
1566 | ||
1567 | for (tail = NULL_TREE; fields; tail = fields, fields = next) | |
1568 | { | |
1569 | DECL_FIELD_CONTEXT (fields) = type; | |
1570 | next = TREE_CHAIN (fields); | |
1571 | TREE_CHAIN (fields) = tail; | |
1572 | } | |
1573 | TYPE_FIELDS (type) = tail; | |
1574 | ||
1575 | if (align_type) | |
1576 | { | |
1577 | TYPE_ALIGN (type) = TYPE_ALIGN (align_type); | |
1578 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (align_type); | |
1579 | } | |
1580 | ||
1581 | layout_type (type); | |
1582 | #if 0 /* not yet, should get fixed properly later */ | |
1583 | TYPE_NAME (type) = make_type_decl (get_identifier (name), type); | |
1584 | #else | |
1585 | TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type); | |
1586 | #endif | |
1587 | TYPE_STUB_DECL (type) = TYPE_NAME (type); | |
1588 | layout_decl (TYPE_NAME (type), 0); | |
1589 | } | |
1590 | ||
7306ed3f JW |
1591 | /* Calculate the mode, size, and alignment for TYPE. |
1592 | For an array type, calculate the element separation as well. | |
1593 | Record TYPE on the chain of permanent or temporary types | |
1594 | so that dbxout will find out about it. | |
1595 | ||
1596 | TYPE_SIZE of a type is nonzero if the type has been laid out already. | |
1597 | layout_type does nothing on such a type. | |
1598 | ||
1599 | If the type is incomplete, its TYPE_SIZE remains zero. */ | |
1600 | ||
1601 | void | |
46c5ad27 | 1602 | layout_type (tree type) |
7306ed3f | 1603 | { |
41374e13 | 1604 | gcc_assert (type); |
7306ed3f | 1605 | |
6de9cd9a DN |
1606 | if (type == error_mark_node) |
1607 | return; | |
1608 | ||
7306ed3f JW |
1609 | /* Do nothing if type has been laid out before. */ |
1610 | if (TYPE_SIZE (type)) | |
1611 | return; | |
1612 | ||
7306ed3f JW |
1613 | switch (TREE_CODE (type)) |
1614 | { | |
1615 | case LANG_TYPE: | |
1616 | /* This kind of type is the responsibility | |
9faa82d8 | 1617 | of the language-specific code. */ |
41374e13 | 1618 | gcc_unreachable (); |
7306ed3f | 1619 | |
2d76cb1a | 1620 | case BOOLEAN_TYPE: /* Used for Java, Pascal, and Chill. */ |
e9a25f70 | 1621 | if (TYPE_PRECISION (type) == 0) |
2d76cb1a | 1622 | TYPE_PRECISION (type) = 1; /* default to one byte/boolean. */ |
d4b60170 | 1623 | |
2d76cb1a | 1624 | /* ... fall through ... */ |
e9a25f70 | 1625 | |
7306ed3f JW |
1626 | case INTEGER_TYPE: |
1627 | case ENUMERAL_TYPE: | |
e2a77f99 RK |
1628 | if (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST |
1629 | && tree_int_cst_sgn (TYPE_MIN_VALUE (type)) >= 0) | |
8df83eae | 1630 | TYPE_UNSIGNED (type) = 1; |
7306ed3f | 1631 | |
5e9bec99 RK |
1632 | TYPE_MODE (type) = smallest_mode_for_size (TYPE_PRECISION (type), |
1633 | MODE_INT); | |
06ceef4e | 1634 | TYPE_SIZE (type) = bitsize_int (GET_MODE_BITSIZE (TYPE_MODE (type))); |
ead17059 | 1635 | TYPE_SIZE_UNIT (type) = size_int (GET_MODE_SIZE (TYPE_MODE (type))); |
7306ed3f JW |
1636 | break; |
1637 | ||
1638 | case REAL_TYPE: | |
1639 | TYPE_MODE (type) = mode_for_size (TYPE_PRECISION (type), MODE_FLOAT, 0); | |
06ceef4e | 1640 | TYPE_SIZE (type) = bitsize_int (GET_MODE_BITSIZE (TYPE_MODE (type))); |
ead17059 | 1641 | TYPE_SIZE_UNIT (type) = size_int (GET_MODE_SIZE (TYPE_MODE (type))); |
7306ed3f JW |
1642 | break; |
1643 | ||
1644 | case COMPLEX_TYPE: | |
8df83eae | 1645 | TYPE_UNSIGNED (type) = TYPE_UNSIGNED (TREE_TYPE (type)); |
7306ed3f JW |
1646 | TYPE_MODE (type) |
1647 | = mode_for_size (2 * TYPE_PRECISION (TREE_TYPE (type)), | |
8df83eae RK |
1648 | (TREE_CODE (TREE_TYPE (type)) == REAL_TYPE |
1649 | ? MODE_COMPLEX_FLOAT : MODE_COMPLEX_INT), | |
7306ed3f | 1650 | 0); |
06ceef4e | 1651 | TYPE_SIZE (type) = bitsize_int (GET_MODE_BITSIZE (TYPE_MODE (type))); |
ead17059 | 1652 | TYPE_SIZE_UNIT (type) = size_int (GET_MODE_SIZE (TYPE_MODE (type))); |
7306ed3f JW |
1653 | break; |
1654 | ||
0b4565c9 | 1655 | case VECTOR_TYPE: |
26277d41 PB |
1656 | { |
1657 | int nunits = TYPE_VECTOR_SUBPARTS (type); | |
7d60be94 | 1658 | tree nunits_tree = build_int_cst (NULL_TREE, nunits); |
26277d41 PB |
1659 | tree innertype = TREE_TYPE (type); |
1660 | ||
41374e13 | 1661 | gcc_assert (!(nunits & (nunits - 1))); |
26277d41 PB |
1662 | |
1663 | /* Find an appropriate mode for the vector type. */ | |
1664 | if (TYPE_MODE (type) == VOIDmode) | |
1665 | { | |
1666 | enum machine_mode innermode = TYPE_MODE (innertype); | |
1667 | enum machine_mode mode; | |
1668 | ||
1669 | /* First, look for a supported vector type. */ | |
3d8bf70f | 1670 | if (SCALAR_FLOAT_MODE_P (innermode)) |
26277d41 PB |
1671 | mode = MIN_MODE_VECTOR_FLOAT; |
1672 | else | |
1673 | mode = MIN_MODE_VECTOR_INT; | |
1674 | ||
1675 | for (; mode != VOIDmode ; mode = GET_MODE_WIDER_MODE (mode)) | |
1676 | if (GET_MODE_NUNITS (mode) == nunits | |
1677 | && GET_MODE_INNER (mode) == innermode | |
f676971a | 1678 | && targetm.vector_mode_supported_p (mode)) |
26277d41 PB |
1679 | break; |
1680 | ||
1681 | /* For integers, try mapping it to a same-sized scalar mode. */ | |
1682 | if (mode == VOIDmode | |
1683 | && GET_MODE_CLASS (innermode) == MODE_INT) | |
1684 | mode = mode_for_size (nunits * GET_MODE_BITSIZE (innermode), | |
1685 | MODE_INT, 0); | |
1686 | ||
1687 | if (mode == VOIDmode || !have_regs_of_mode[mode]) | |
1688 | TYPE_MODE (type) = BLKmode; | |
1689 | else | |
1690 | TYPE_MODE (type) = mode; | |
1691 | } | |
1692 | ||
1693 | TYPE_UNSIGNED (type) = TYPE_UNSIGNED (TREE_TYPE (type)); | |
1694 | TYPE_SIZE_UNIT (type) = int_const_binop (MULT_EXPR, | |
1695 | TYPE_SIZE_UNIT (innertype), | |
1696 | nunits_tree, 0); | |
1697 | TYPE_SIZE (type) = int_const_binop (MULT_EXPR, TYPE_SIZE (innertype), | |
1698 | nunits_tree, 0); | |
e4ca3dc3 | 1699 | |
34bc6352 | 1700 | /* Always naturally align vectors. This prevents ABI changes |
e4ca3dc3 RH |
1701 | depending on whether or not native vector modes are supported. */ |
1702 | TYPE_ALIGN (type) = tree_low_cst (TYPE_SIZE (type), 0); | |
26277d41 PB |
1703 | break; |
1704 | } | |
0b4565c9 | 1705 | |
7306ed3f | 1706 | case VOID_TYPE: |
770ae6cc | 1707 | /* This is an incomplete type and so doesn't have a size. */ |
7306ed3f | 1708 | TYPE_ALIGN (type) = 1; |
11cf4d18 | 1709 | TYPE_USER_ALIGN (type) = 0; |
7306ed3f JW |
1710 | TYPE_MODE (type) = VOIDmode; |
1711 | break; | |
1712 | ||
321cb743 | 1713 | case OFFSET_TYPE: |
06ceef4e | 1714 | TYPE_SIZE (type) = bitsize_int (POINTER_SIZE); |
ead17059 | 1715 | TYPE_SIZE_UNIT (type) = size_int (POINTER_SIZE / BITS_PER_UNIT); |
25caaba8 R |
1716 | /* A pointer might be MODE_PARTIAL_INT, |
1717 | but ptrdiff_t must be integral. */ | |
1718 | TYPE_MODE (type) = mode_for_size (POINTER_SIZE, MODE_INT, 0); | |
321cb743 MT |
1719 | break; |
1720 | ||
7306ed3f JW |
1721 | case FUNCTION_TYPE: |
1722 | case METHOD_TYPE: | |
019dd4ec RK |
1723 | /* It's hard to see what the mode and size of a function ought to |
1724 | be, but we do know the alignment is FUNCTION_BOUNDARY, so | |
1725 | make it consistent with that. */ | |
1726 | TYPE_MODE (type) = mode_for_size (FUNCTION_BOUNDARY, MODE_INT, 0); | |
1727 | TYPE_SIZE (type) = bitsize_int (FUNCTION_BOUNDARY); | |
1728 | TYPE_SIZE_UNIT (type) = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
7306ed3f JW |
1729 | break; |
1730 | ||
1731 | case POINTER_TYPE: | |
1732 | case REFERENCE_TYPE: | |
b5d6a2ff | 1733 | { |
b5d6a2ff | 1734 | |
4977bab6 ZW |
1735 | enum machine_mode mode = ((TREE_CODE (type) == REFERENCE_TYPE |
1736 | && reference_types_internal) | |
1737 | ? Pmode : TYPE_MODE (type)); | |
1738 | ||
1739 | int nbits = GET_MODE_BITSIZE (mode); | |
1740 | ||
b5d6a2ff | 1741 | TYPE_SIZE (type) = bitsize_int (nbits); |
4977bab6 | 1742 | TYPE_SIZE_UNIT (type) = size_int (GET_MODE_SIZE (mode)); |
8df83eae | 1743 | TYPE_UNSIGNED (type) = 1; |
b5d6a2ff RK |
1744 | TYPE_PRECISION (type) = nbits; |
1745 | } | |
7306ed3f JW |
1746 | break; |
1747 | ||
1748 | case ARRAY_TYPE: | |
1749 | { | |
b3694847 SS |
1750 | tree index = TYPE_DOMAIN (type); |
1751 | tree element = TREE_TYPE (type); | |
7306ed3f JW |
1752 | |
1753 | build_pointer_type (element); | |
1754 | ||
1755 | /* We need to know both bounds in order to compute the size. */ | |
1756 | if (index && TYPE_MAX_VALUE (index) && TYPE_MIN_VALUE (index) | |
1757 | && TYPE_SIZE (element)) | |
1758 | { | |
ad50bc8d RH |
1759 | tree ub = TYPE_MAX_VALUE (index); |
1760 | tree lb = TYPE_MIN_VALUE (index); | |
e24ff973 | 1761 | tree length; |
74a4fbfc | 1762 | tree element_size; |
e24ff973 | 1763 | |
a2d53b28 RH |
1764 | /* The initial subtraction should happen in the original type so |
1765 | that (possible) negative values are handled appropriately. */ | |
e24ff973 | 1766 | length = size_binop (PLUS_EXPR, size_one_node, |
455f19cb | 1767 | fold_convert (sizetype, |
4845b383 KH |
1768 | fold_build2 (MINUS_EXPR, |
1769 | TREE_TYPE (lb), | |
1770 | ub, lb))); | |
7306ed3f | 1771 | |
74a4fbfc DB |
1772 | /* Special handling for arrays of bits (for Chill). */ |
1773 | element_size = TYPE_SIZE (element); | |
382110c0 RK |
1774 | if (TYPE_PACKED (type) && INTEGRAL_TYPE_P (element) |
1775 | && (integer_zerop (TYPE_MAX_VALUE (element)) | |
1776 | || integer_onep (TYPE_MAX_VALUE (element))) | |
1777 | && host_integerp (TYPE_MIN_VALUE (element), 1)) | |
74a4fbfc | 1778 | { |
d4b60170 | 1779 | HOST_WIDE_INT maxvalue |
382110c0 | 1780 | = tree_low_cst (TYPE_MAX_VALUE (element), 1); |
d4b60170 | 1781 | HOST_WIDE_INT minvalue |
382110c0 | 1782 | = tree_low_cst (TYPE_MIN_VALUE (element), 1); |
d4b60170 | 1783 | |
74a4fbfc DB |
1784 | if (maxvalue - minvalue == 1 |
1785 | && (maxvalue == 1 || maxvalue == 0)) | |
1786 | element_size = integer_one_node; | |
1787 | } | |
1788 | ||
0d3c8800 RK |
1789 | /* If neither bound is a constant and sizetype is signed, make |
1790 | sure the size is never negative. We should really do this | |
1791 | if *either* bound is non-constant, but this is the best | |
1792 | compromise between C and Ada. */ | |
8df83eae | 1793 | if (!TYPE_UNSIGNED (sizetype) |
0d3c8800 RK |
1794 | && TREE_CODE (TYPE_MIN_VALUE (index)) != INTEGER_CST |
1795 | && TREE_CODE (TYPE_MAX_VALUE (index)) != INTEGER_CST) | |
1796 | length = size_binop (MAX_EXPR, length, size_zero_node); | |
1797 | ||
fed3cef0 | 1798 | TYPE_SIZE (type) = size_binop (MULT_EXPR, element_size, |
455f19cb MM |
1799 | fold_convert (bitsizetype, |
1800 | length)); | |
ead17059 RH |
1801 | |
1802 | /* If we know the size of the element, calculate the total | |
1803 | size directly, rather than do some division thing below. | |
1804 | This optimization helps Fortran assumed-size arrays | |
1805 | (where the size of the array is determined at runtime) | |
7771032e DB |
1806 | substantially. |
1807 | Note that we can't do this in the case where the size of | |
1808 | the elements is one bit since TYPE_SIZE_UNIT cannot be | |
1809 | set correctly in that case. */ | |
fed3cef0 | 1810 | if (TYPE_SIZE_UNIT (element) != 0 && ! integer_onep (element_size)) |
d4b60170 RK |
1811 | TYPE_SIZE_UNIT (type) |
1812 | = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (element), length); | |
7306ed3f JW |
1813 | } |
1814 | ||
1815 | /* Now round the alignment and size, | |
1816 | using machine-dependent criteria if any. */ | |
1817 | ||
1818 | #ifdef ROUND_TYPE_ALIGN | |
1819 | TYPE_ALIGN (type) | |
1820 | = ROUND_TYPE_ALIGN (type, TYPE_ALIGN (element), BITS_PER_UNIT); | |
1821 | #else | |
1822 | TYPE_ALIGN (type) = MAX (TYPE_ALIGN (element), BITS_PER_UNIT); | |
1823 | #endif | |
c163d21d | 1824 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (element); |
7306ed3f JW |
1825 | TYPE_MODE (type) = BLKmode; |
1826 | if (TYPE_SIZE (type) != 0 | |
31a02448 | 1827 | #ifdef MEMBER_TYPE_FORCES_BLK |
182e515e | 1828 | && ! MEMBER_TYPE_FORCES_BLK (type, VOIDmode) |
31a02448 | 1829 | #endif |
7306ed3f JW |
1830 | /* BLKmode elements force BLKmode aggregate; |
1831 | else extract/store fields may lose. */ | |
1832 | && (TYPE_MODE (TREE_TYPE (type)) != BLKmode | |
1833 | || TYPE_NO_FORCE_BLK (TREE_TYPE (type)))) | |
1834 | { | |
a1471322 RK |
1835 | /* One-element arrays get the component type's mode. */ |
1836 | if (simple_cst_equal (TYPE_SIZE (type), | |
1837 | TYPE_SIZE (TREE_TYPE (type)))) | |
1838 | TYPE_MODE (type) = TYPE_MODE (TREE_TYPE (type)); | |
1839 | else | |
1840 | TYPE_MODE (type) | |
1841 | = mode_for_size_tree (TYPE_SIZE (type), MODE_INT, 1); | |
7306ed3f | 1842 | |
72c602fc RK |
1843 | if (TYPE_MODE (type) != BLKmode |
1844 | && STRICT_ALIGNMENT && TYPE_ALIGN (type) < BIGGEST_ALIGNMENT | |
1845 | && TYPE_ALIGN (type) < GET_MODE_ALIGNMENT (TYPE_MODE (type)) | |
7306ed3f JW |
1846 | && TYPE_MODE (type) != BLKmode) |
1847 | { | |
1848 | TYPE_NO_FORCE_BLK (type) = 1; | |
1849 | TYPE_MODE (type) = BLKmode; | |
1850 | } | |
7306ed3f | 1851 | } |
b606b65c OH |
1852 | /* When the element size is constant, check that it is at least as |
1853 | large as the element alignment. */ | |
002a9071 SE |
1854 | if (TYPE_SIZE_UNIT (element) |
1855 | && TREE_CODE (TYPE_SIZE_UNIT (element)) == INTEGER_CST | |
b606b65c OH |
1856 | /* If TYPE_SIZE_UNIT overflowed, then it is certainly larger than |
1857 | TYPE_ALIGN_UNIT. */ | |
1858 | && !TREE_CONSTANT_OVERFLOW (TYPE_SIZE_UNIT (element)) | |
002a9071 SE |
1859 | && !integer_zerop (TYPE_SIZE_UNIT (element)) |
1860 | && compare_tree_int (TYPE_SIZE_UNIT (element), | |
1861 | TYPE_ALIGN_UNIT (element)) < 0) | |
1862 | error ("alignment of array elements is greater than element size"); | |
7306ed3f JW |
1863 | break; |
1864 | } | |
1865 | ||
1866 | case RECORD_TYPE: | |
cc9d4a85 MM |
1867 | case UNION_TYPE: |
1868 | case QUAL_UNION_TYPE: | |
9328904c MM |
1869 | { |
1870 | tree field; | |
1871 | record_layout_info rli; | |
1872 | ||
1873 | /* Initialize the layout information. */ | |
770ae6cc RK |
1874 | rli = start_record_layout (type); |
1875 | ||
cc9d4a85 MM |
1876 | /* If this is a QUAL_UNION_TYPE, we want to process the fields |
1877 | in the reverse order in building the COND_EXPR that denotes | |
1878 | its size. We reverse them again later. */ | |
1879 | if (TREE_CODE (type) == QUAL_UNION_TYPE) | |
1880 | TYPE_FIELDS (type) = nreverse (TYPE_FIELDS (type)); | |
770ae6cc RK |
1881 | |
1882 | /* Place all the fields. */ | |
9328904c | 1883 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) |
770ae6cc RK |
1884 | place_field (rli, field); |
1885 | ||
cc9d4a85 MM |
1886 | if (TREE_CODE (type) == QUAL_UNION_TYPE) |
1887 | TYPE_FIELDS (type) = nreverse (TYPE_FIELDS (type)); | |
770ae6cc | 1888 | |
e0cea8d9 RK |
1889 | if (lang_adjust_rli) |
1890 | (*lang_adjust_rli) (rli); | |
1891 | ||
9328904c | 1892 | /* Finish laying out the record. */ |
17bbb839 | 1893 | finish_record_layout (rli, /*free_p=*/true); |
9328904c | 1894 | } |
7306ed3f JW |
1895 | break; |
1896 | ||
7306ed3f | 1897 | default: |
41374e13 | 1898 | gcc_unreachable (); |
729a2125 | 1899 | } |
7306ed3f | 1900 | |
9328904c | 1901 | /* Compute the final TYPE_SIZE, TYPE_ALIGN, etc. for TYPE. For |
cc9d4a85 MM |
1902 | records and unions, finish_record_layout already called this |
1903 | function. */ | |
786de7eb | 1904 | if (TREE_CODE (type) != RECORD_TYPE |
cc9d4a85 MM |
1905 | && TREE_CODE (type) != UNION_TYPE |
1906 | && TREE_CODE (type) != QUAL_UNION_TYPE) | |
9328904c | 1907 | finalize_type_size (type); |
7306ed3f | 1908 | |
dc5041ab JJ |
1909 | /* If an alias set has been set for this aggregate when it was incomplete, |
1910 | force it into alias set 0. | |
1911 | This is too conservative, but we cannot call record_component_aliases | |
1912 | here because some frontends still change the aggregates after | |
1913 | layout_type. */ | |
1914 | if (AGGREGATE_TYPE_P (type) && TYPE_ALIAS_SET_KNOWN_P (type)) | |
1915 | TYPE_ALIAS_SET (type) = 0; | |
7306ed3f JW |
1916 | } |
1917 | \f | |
1918 | /* Create and return a type for signed integers of PRECISION bits. */ | |
1919 | ||
1920 | tree | |
46c5ad27 | 1921 | make_signed_type (int precision) |
7306ed3f | 1922 | { |
b3694847 | 1923 | tree type = make_node (INTEGER_TYPE); |
7306ed3f JW |
1924 | |
1925 | TYPE_PRECISION (type) = precision; | |
1926 | ||
fed3cef0 | 1927 | fixup_signed_type (type); |
7306ed3f JW |
1928 | return type; |
1929 | } | |
1930 | ||
1931 | /* Create and return a type for unsigned integers of PRECISION bits. */ | |
1932 | ||
1933 | tree | |
46c5ad27 | 1934 | make_unsigned_type (int precision) |
7306ed3f | 1935 | { |
b3694847 | 1936 | tree type = make_node (INTEGER_TYPE); |
7306ed3f JW |
1937 | |
1938 | TYPE_PRECISION (type) = precision; | |
1939 | ||
7306ed3f JW |
1940 | fixup_unsigned_type (type); |
1941 | return type; | |
1942 | } | |
fed3cef0 RK |
1943 | \f |
1944 | /* Initialize sizetype and bitsizetype to a reasonable and temporary | |
1945 | value to enable integer types to be created. */ | |
1946 | ||
1947 | void | |
8c1d6d62 | 1948 | initialize_sizetypes (bool signed_p) |
fed3cef0 RK |
1949 | { |
1950 | tree t = make_node (INTEGER_TYPE); | |
a6a12bb9 | 1951 | int precision = GET_MODE_BITSIZE (SImode); |
fed3cef0 | 1952 | |
fed3cef0 RK |
1953 | TYPE_MODE (t) = SImode; |
1954 | TYPE_ALIGN (t) = GET_MODE_ALIGNMENT (SImode); | |
11cf4d18 | 1955 | TYPE_USER_ALIGN (t) = 0; |
3224bead | 1956 | TYPE_IS_SIZETYPE (t) = 1; |
8c1d6d62 | 1957 | TYPE_UNSIGNED (t) = !signed_p; |
a6a12bb9 | 1958 | TYPE_SIZE (t) = build_int_cst (t, precision); |
7d60be94 | 1959 | TYPE_SIZE_UNIT (t) = build_int_cst (t, GET_MODE_SIZE (SImode)); |
a6a12bb9 | 1960 | TYPE_PRECISION (t) = precision; |
fed3cef0 | 1961 | |
a6a12bb9 RS |
1962 | /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE. */ |
1963 | set_min_and_max_values_for_integral_type (t, precision, !signed_p); | |
fed3cef0 | 1964 | |
fed3cef0 | 1965 | sizetype = t; |
8c1d6d62 | 1966 | bitsizetype = build_distinct_type_copy (t); |
fed3cef0 | 1967 | } |
7306ed3f | 1968 | |
8c1d6d62 NS |
1969 | /* Make sizetype a version of TYPE, and initialize *sizetype |
1970 | accordingly. We do this by overwriting the stub sizetype and | |
1971 | bitsizetype nodes created by initialize_sizetypes. This makes sure | |
1972 | that (a) anything stubby about them no longer exists, (b) any | |
1973 | INTEGER_CSTs created with such a type, remain valid. */ | |
f8dac6eb R |
1974 | |
1975 | void | |
46c5ad27 | 1976 | set_sizetype (tree type) |
f8dac6eb | 1977 | { |
d4b60170 | 1978 | int oprecision = TYPE_PRECISION (type); |
f8dac6eb | 1979 | /* The *bitsizetype types use a precision that avoids overflows when |
d4b60170 RK |
1980 | calculating signed sizes / offsets in bits. However, when |
1981 | cross-compiling from a 32 bit to a 64 bit host, we are limited to 64 bit | |
1982 | precision. */ | |
11a6092b | 1983 | int precision = MIN (oprecision + BITS_PER_UNIT_LOG + 1, |
d4b60170 | 1984 | 2 * HOST_BITS_PER_WIDE_INT); |
ad41cc2a | 1985 | tree t; |
fed3cef0 | 1986 | |
41374e13 | 1987 | gcc_assert (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); |
81b3411c | 1988 | |
8c1d6d62 NS |
1989 | t = build_distinct_type_copy (type); |
1990 | /* We do want to use sizetype's cache, as we will be replacing that | |
1991 | type. */ | |
1992 | TYPE_CACHED_VALUES (t) = TYPE_CACHED_VALUES (sizetype); | |
1993 | TYPE_CACHED_VALUES_P (t) = TYPE_CACHED_VALUES_P (sizetype); | |
1994 | TREE_TYPE (TYPE_CACHED_VALUES (t)) = type; | |
1995 | TYPE_UID (t) = TYPE_UID (sizetype); | |
1996 | TYPE_IS_SIZETYPE (t) = 1; | |
1997 | ||
1998 | /* Replace our original stub sizetype. */ | |
1999 | memcpy (sizetype, t, tree_size (sizetype)); | |
2000 | TYPE_MAIN_VARIANT (sizetype) = sizetype; | |
2001 | ||
2002 | t = make_node (INTEGER_TYPE); | |
2003 | TYPE_NAME (t) = get_identifier ("bit_size_type"); | |
2004 | /* We do want to use bitsizetype's cache, as we will be replacing that | |
2005 | type. */ | |
2006 | TYPE_CACHED_VALUES (t) = TYPE_CACHED_VALUES (bitsizetype); | |
2007 | TYPE_CACHED_VALUES_P (t) = TYPE_CACHED_VALUES_P (bitsizetype); | |
2008 | TYPE_PRECISION (t) = precision; | |
2009 | TYPE_UID (t) = TYPE_UID (bitsizetype); | |
2010 | TYPE_IS_SIZETYPE (t) = 1; | |
4ecd8dc7 | 2011 | |
8c1d6d62 NS |
2012 | /* Replace our original stub bitsizetype. */ |
2013 | memcpy (bitsizetype, t, tree_size (bitsizetype)); | |
4ecd8dc7 | 2014 | TYPE_MAIN_VARIANT (bitsizetype) = bitsizetype; |
8c1d6d62 | 2015 | |
8df83eae | 2016 | if (TYPE_UNSIGNED (type)) |
896cced4 | 2017 | { |
8c1d6d62 NS |
2018 | fixup_unsigned_type (bitsizetype); |
2019 | ssizetype = build_distinct_type_copy (make_signed_type (oprecision)); | |
2020 | TYPE_IS_SIZETYPE (ssizetype) = 1; | |
2021 | sbitsizetype = build_distinct_type_copy (make_signed_type (precision)); | |
2022 | TYPE_IS_SIZETYPE (sbitsizetype) = 1; | |
896cced4 RH |
2023 | } |
2024 | else | |
2025 | { | |
8c1d6d62 | 2026 | fixup_signed_type (bitsizetype); |
896cced4 RH |
2027 | ssizetype = sizetype; |
2028 | sbitsizetype = bitsizetype; | |
896cced4 | 2029 | } |
7f18f917 JL |
2030 | |
2031 | /* If SIZETYPE is unsigned, we need to fix TYPE_MAX_VALUE so that | |
2032 | it is sign extended in a way consistent with force_fit_type. */ | |
2033 | if (TYPE_UNSIGNED (type)) | |
2034 | { | |
2035 | tree orig_max, new_max; | |
2036 | ||
2037 | orig_max = TYPE_MAX_VALUE (sizetype); | |
2038 | ||
2039 | /* Build a new node with the same values, but a different type. */ | |
2040 | new_max = build_int_cst_wide (sizetype, | |
2041 | TREE_INT_CST_LOW (orig_max), | |
2042 | TREE_INT_CST_HIGH (orig_max)); | |
2043 | ||
2044 | /* Now sign extend it using force_fit_type to ensure | |
2045 | consistency. */ | |
2046 | new_max = force_fit_type (new_max, 0, 0, 0); | |
2047 | TYPE_MAX_VALUE (sizetype) = new_max; | |
2048 | } | |
fed3cef0 RK |
2049 | } |
2050 | \f | |
71d59383 RS |
2051 | /* TYPE is an integral type, i.e., an INTEGRAL_TYPE, ENUMERAL_TYPE |
2052 | or BOOLEAN_TYPE. Set TYPE_MIN_VALUE and TYPE_MAX_VALUE | |
7b6d72fc MM |
2053 | for TYPE, based on the PRECISION and whether or not the TYPE |
2054 | IS_UNSIGNED. PRECISION need not correspond to a width supported | |
2055 | natively by the hardware; for example, on a machine with 8-bit, | |
2056 | 16-bit, and 32-bit register modes, PRECISION might be 7, 23, or | |
2057 | 61. */ | |
2058 | ||
2059 | void | |
2060 | set_min_and_max_values_for_integral_type (tree type, | |
2061 | int precision, | |
2062 | bool is_unsigned) | |
2063 | { | |
2064 | tree min_value; | |
2065 | tree max_value; | |
2066 | ||
2067 | if (is_unsigned) | |
2068 | { | |
7d60be94 | 2069 | min_value = build_int_cst (type, 0); |
f676971a | 2070 | max_value |
7d60be94 NS |
2071 | = build_int_cst_wide (type, precision - HOST_BITS_PER_WIDE_INT >= 0 |
2072 | ? -1 | |
2073 | : ((HOST_WIDE_INT) 1 << precision) - 1, | |
2074 | precision - HOST_BITS_PER_WIDE_INT > 0 | |
2075 | ? ((unsigned HOST_WIDE_INT) ~0 | |
2076 | >> (HOST_BITS_PER_WIDE_INT | |
2077 | - (precision - HOST_BITS_PER_WIDE_INT))) | |
2078 | : 0); | |
7b6d72fc MM |
2079 | } |
2080 | else | |
2081 | { | |
f676971a | 2082 | min_value |
7d60be94 NS |
2083 | = build_int_cst_wide (type, |
2084 | (precision - HOST_BITS_PER_WIDE_INT > 0 | |
2085 | ? 0 | |
2086 | : (HOST_WIDE_INT) (-1) << (precision - 1)), | |
2087 | (((HOST_WIDE_INT) (-1) | |
2088 | << (precision - HOST_BITS_PER_WIDE_INT - 1 > 0 | |
2089 | ? precision - HOST_BITS_PER_WIDE_INT - 1 | |
2090 | : 0)))); | |
7b6d72fc | 2091 | max_value |
7d60be94 NS |
2092 | = build_int_cst_wide (type, |
2093 | (precision - HOST_BITS_PER_WIDE_INT > 0 | |
2094 | ? -1 | |
2095 | : ((HOST_WIDE_INT) 1 << (precision - 1)) - 1), | |
2096 | (precision - HOST_BITS_PER_WIDE_INT - 1 > 0 | |
2097 | ? (((HOST_WIDE_INT) 1 | |
2098 | << (precision - HOST_BITS_PER_WIDE_INT - 1))) - 1 | |
2099 | : 0)); | |
7b6d72fc MM |
2100 | } |
2101 | ||
7b6d72fc MM |
2102 | TYPE_MIN_VALUE (type) = min_value; |
2103 | TYPE_MAX_VALUE (type) = max_value; | |
2104 | } | |
2105 | ||
4cc89e53 | 2106 | /* Set the extreme values of TYPE based on its precision in bits, |
13756074 | 2107 | then lay it out. Used when make_signed_type won't do |
4cc89e53 RS |
2108 | because the tree code is not INTEGER_TYPE. |
2109 | E.g. for Pascal, when the -fsigned-char option is given. */ | |
2110 | ||
2111 | void | |
46c5ad27 | 2112 | fixup_signed_type (tree type) |
4cc89e53 | 2113 | { |
b3694847 | 2114 | int precision = TYPE_PRECISION (type); |
4cc89e53 | 2115 | |
9cd56be1 JH |
2116 | /* We can not represent properly constants greater then |
2117 | 2 * HOST_BITS_PER_WIDE_INT, still we need the types | |
2118 | as they are used by i386 vector extensions and friends. */ | |
2119 | if (precision > HOST_BITS_PER_WIDE_INT * 2) | |
2120 | precision = HOST_BITS_PER_WIDE_INT * 2; | |
2121 | ||
f676971a | 2122 | set_min_and_max_values_for_integral_type (type, precision, |
7b6d72fc | 2123 | /*is_unsigned=*/false); |
4cc89e53 RS |
2124 | |
2125 | /* Lay out the type: set its alignment, size, etc. */ | |
4cc89e53 RS |
2126 | layout_type (type); |
2127 | } | |
2128 | ||
7306ed3f | 2129 | /* Set the extreme values of TYPE based on its precision in bits, |
13756074 | 2130 | then lay it out. This is used both in `make_unsigned_type' |
7306ed3f JW |
2131 | and for enumeral types. */ |
2132 | ||
2133 | void | |
46c5ad27 | 2134 | fixup_unsigned_type (tree type) |
7306ed3f | 2135 | { |
b3694847 | 2136 | int precision = TYPE_PRECISION (type); |
7306ed3f | 2137 | |
9cd56be1 JH |
2138 | /* We can not represent properly constants greater then |
2139 | 2 * HOST_BITS_PER_WIDE_INT, still we need the types | |
2140 | as they are used by i386 vector extensions and friends. */ | |
2141 | if (precision > HOST_BITS_PER_WIDE_INT * 2) | |
2142 | precision = HOST_BITS_PER_WIDE_INT * 2; | |
2143 | ||
89b0433e | 2144 | TYPE_UNSIGNED (type) = 1; |
f676971a EC |
2145 | |
2146 | set_min_and_max_values_for_integral_type (type, precision, | |
7b6d72fc | 2147 | /*is_unsigned=*/true); |
7306ed3f JW |
2148 | |
2149 | /* Lay out the type: set its alignment, size, etc. */ | |
7306ed3f JW |
2150 | layout_type (type); |
2151 | } | |
2152 | \f | |
2153 | /* Find the best machine mode to use when referencing a bit field of length | |
2154 | BITSIZE bits starting at BITPOS. | |
2155 | ||
2156 | The underlying object is known to be aligned to a boundary of ALIGN bits. | |
2157 | If LARGEST_MODE is not VOIDmode, it means that we should not use a mode | |
2158 | larger than LARGEST_MODE (usually SImode). | |
2159 | ||
c2a64439 PB |
2160 | If no mode meets all these conditions, we return VOIDmode. |
2161 | ||
2162 | If VOLATILEP is false and SLOW_BYTE_ACCESS is false, we return the | |
2163 | smallest mode meeting these conditions. | |
2164 | ||
2165 | If VOLATILEP is false and SLOW_BYTE_ACCESS is true, we return the | |
2166 | largest mode (but a mode no wider than UNITS_PER_WORD) that meets | |
2167 | all the conditions. | |
2168 | ||
2169 | If VOLATILEP is true the narrow_volatile_bitfields target hook is used to | |
2170 | decide which of the above modes should be used. */ | |
7306ed3f JW |
2171 | |
2172 | enum machine_mode | |
46c5ad27 AJ |
2173 | get_best_mode (int bitsize, int bitpos, unsigned int align, |
2174 | enum machine_mode largest_mode, int volatilep) | |
7306ed3f JW |
2175 | { |
2176 | enum machine_mode mode; | |
770ae6cc | 2177 | unsigned int unit = 0; |
7306ed3f JW |
2178 | |
2179 | /* Find the narrowest integer mode that contains the bit field. */ | |
2180 | for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode; | |
2181 | mode = GET_MODE_WIDER_MODE (mode)) | |
2182 | { | |
2183 | unit = GET_MODE_BITSIZE (mode); | |
956d6950 | 2184 | if ((bitpos % unit) + bitsize <= unit) |
7306ed3f JW |
2185 | break; |
2186 | } | |
2187 | ||
0c61f541 | 2188 | if (mode == VOIDmode |
7306ed3f | 2189 | /* It is tempting to omit the following line |
4e4b555d | 2190 | if STRICT_ALIGNMENT is true. |
7306ed3f JW |
2191 | But that is incorrect, since if the bitfield uses part of 3 bytes |
2192 | and we use a 4-byte mode, we could get a spurious segv | |
2193 | if the extra 4th byte is past the end of memory. | |
2194 | (Though at least one Unix compiler ignores this problem: | |
2195 | that on the Sequent 386 machine. */ | |
770ae6cc | 2196 | || MIN (unit, BIGGEST_ALIGNMENT) > align |
7306ed3f JW |
2197 | || (largest_mode != VOIDmode && unit > GET_MODE_BITSIZE (largest_mode))) |
2198 | return VOIDmode; | |
2199 | ||
c2a64439 PB |
2200 | if ((SLOW_BYTE_ACCESS && ! volatilep) |
2201 | || (volatilep && !targetm.narrow_volatile_bitfield())) | |
77fa0940 RK |
2202 | { |
2203 | enum machine_mode wide_mode = VOIDmode, tmode; | |
2204 | ||
2205 | for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT); tmode != VOIDmode; | |
2206 | tmode = GET_MODE_WIDER_MODE (tmode)) | |
2207 | { | |
2208 | unit = GET_MODE_BITSIZE (tmode); | |
2209 | if (bitpos / unit == (bitpos + bitsize - 1) / unit | |
2210 | && unit <= BITS_PER_WORD | |
770ae6cc | 2211 | && unit <= MIN (align, BIGGEST_ALIGNMENT) |
77fa0940 RK |
2212 | && (largest_mode == VOIDmode |
2213 | || unit <= GET_MODE_BITSIZE (largest_mode))) | |
2214 | wide_mode = tmode; | |
2215 | } | |
2216 | ||
2217 | if (wide_mode != VOIDmode) | |
2218 | return wide_mode; | |
2219 | } | |
7306ed3f JW |
2220 | |
2221 | return mode; | |
2222 | } | |
d7db6646 | 2223 | |
50654f6c | 2224 | /* Gets minimal and maximal values for MODE (signed or unsigned depending on |
0aea6467 | 2225 | SIGN). The returned constants are made to be usable in TARGET_MODE. */ |
50654f6c ZD |
2226 | |
2227 | void | |
0aea6467 ZD |
2228 | get_mode_bounds (enum machine_mode mode, int sign, |
2229 | enum machine_mode target_mode, | |
2230 | rtx *mmin, rtx *mmax) | |
50654f6c | 2231 | { |
0aea6467 ZD |
2232 | unsigned size = GET_MODE_BITSIZE (mode); |
2233 | unsigned HOST_WIDE_INT min_val, max_val; | |
50654f6c | 2234 | |
41374e13 | 2235 | gcc_assert (size <= HOST_BITS_PER_WIDE_INT); |
50654f6c ZD |
2236 | |
2237 | if (sign) | |
2238 | { | |
0aea6467 ZD |
2239 | min_val = -((unsigned HOST_WIDE_INT) 1 << (size - 1)); |
2240 | max_val = ((unsigned HOST_WIDE_INT) 1 << (size - 1)) - 1; | |
50654f6c ZD |
2241 | } |
2242 | else | |
2243 | { | |
0aea6467 ZD |
2244 | min_val = 0; |
2245 | max_val = ((unsigned HOST_WIDE_INT) 1 << (size - 1) << 1) - 1; | |
50654f6c | 2246 | } |
0aea6467 | 2247 | |
bb80db7b KH |
2248 | *mmin = gen_int_mode (min_val, target_mode); |
2249 | *mmax = gen_int_mode (max_val, target_mode); | |
50654f6c ZD |
2250 | } |
2251 | ||
e2500fed | 2252 | #include "gt-stor-layout.h" |