1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2010, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License along with GCC; see the file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
33 #include "diagnostic-core.h"
39 #include "langhooks.h"
41 #include "tree-dump.h"
42 #include "tree-inline.h"
43 #include "tree-iterator.h"
59 #ifndef MAX_BITS_PER_WORD
60 #define MAX_BITS_PER_WORD BITS_PER_WORD
63 /* If nonzero, pretend we are allocating at global level. */
66 /* The default alignment of "double" floating-point types, i.e. floating
67 point types whose size is equal to 64 bits, or 0 if this alignment is
68 not specifically capped. */
69 int double_float_alignment
;
71 /* The default alignment of "double" or larger scalar types, i.e. scalar
72 types whose size is greater or equal to 64 bits, or 0 if this alignment
73 is not specifically capped. */
74 int double_scalar_alignment
;
76 /* Tree nodes for the various types and decls we create. */
77 tree gnat_std_decls
[(int) ADT_LAST
];
79 /* Functions to call for each of the possible raise reasons. */
80 tree gnat_raise_decls
[(int) LAST_REASON_CODE
+ 1];
82 /* Forward declarations for handlers of attributes. */
83 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
84 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
85 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
86 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
87 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
88 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
89 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
90 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
91 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
92 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int, bool *);
93 static tree
handle_vector_type_attribute (tree
*, tree
, tree
, int, bool *);
95 /* Fake handler for attributes we don't properly support, typically because
96 they'd require dragging a lot of the common-c front-end circuitry. */
97 static tree
fake_attribute_handler (tree
*, tree
, tree
, int, bool *);
99 /* Table of machine-independent internal attributes for Ada. We support
100 this minimal set of attributes to accommodate the needs of builtins. */
101 const struct attribute_spec gnat_internal_attribute_table
[] =
103 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
104 { "const", 0, 0, true, false, false, handle_const_attribute
},
105 { "nothrow", 0, 0, true, false, false, handle_nothrow_attribute
},
106 { "pure", 0, 0, true, false, false, handle_pure_attribute
},
107 { "no vops", 0, 0, true, false, false, handle_novops_attribute
},
108 { "nonnull", 0, -1, false, true, true, handle_nonnull_attribute
},
109 { "sentinel", 0, 1, false, true, true, handle_sentinel_attribute
},
110 { "noreturn", 0, 0, true, false, false, handle_noreturn_attribute
},
111 { "malloc", 0, 0, true, false, false, handle_malloc_attribute
},
112 { "type generic", 0, 0, false, true, true, handle_type_generic_attribute
},
114 { "vector_size", 1, 1, false, true, false, handle_vector_size_attribute
},
115 { "vector_type", 0, 0, false, true, false, handle_vector_type_attribute
},
116 { "may_alias", 0, 0, false, true, false, NULL
},
118 /* ??? format and format_arg are heavy and not supported, which actually
119 prevents support for stdio builtins, which we however declare as part
120 of the common builtins.def contents. */
121 { "format", 3, 3, false, true, true, fake_attribute_handler
},
122 { "format_arg", 1, 1, false, true, true, fake_attribute_handler
},
124 { NULL
, 0, 0, false, false, false, NULL
}
127 /* Associates a GNAT tree node to a GCC tree node. It is used in
128 `save_gnu_tree', `get_gnu_tree' and `present_gnu_tree'. See documentation
129 of `save_gnu_tree' for more info. */
130 static GTY((length ("max_gnat_nodes"))) tree
*associate_gnat_to_gnu
;
132 #define GET_GNU_TREE(GNAT_ENTITY) \
133 associate_gnat_to_gnu[(GNAT_ENTITY) - First_Node_Id]
135 #define SET_GNU_TREE(GNAT_ENTITY,VAL) \
136 associate_gnat_to_gnu[(GNAT_ENTITY) - First_Node_Id] = (VAL)
138 #define PRESENT_GNU_TREE(GNAT_ENTITY) \
139 (associate_gnat_to_gnu[(GNAT_ENTITY) - First_Node_Id] != NULL_TREE)
141 /* Associates a GNAT entity to a GCC tree node used as a dummy, if any. */
142 static GTY((length ("max_gnat_nodes"))) tree
*dummy_node_table
;
144 #define GET_DUMMY_NODE(GNAT_ENTITY) \
145 dummy_node_table[(GNAT_ENTITY) - First_Node_Id]
147 #define SET_DUMMY_NODE(GNAT_ENTITY,VAL) \
148 dummy_node_table[(GNAT_ENTITY) - First_Node_Id] = (VAL)
150 #define PRESENT_DUMMY_NODE(GNAT_ENTITY) \
151 (dummy_node_table[(GNAT_ENTITY) - First_Node_Id] != NULL_TREE)
153 /* This variable keeps a table for types for each precision so that we only
154 allocate each of them once. Signed and unsigned types are kept separate.
156 Note that these types are only used when fold-const requests something
157 special. Perhaps we should NOT share these types; we'll see how it
159 static GTY(()) tree signed_and_unsigned_types
[2 * MAX_BITS_PER_WORD
+ 1][2];
161 /* Likewise for float types, but record these by mode. */
162 static GTY(()) tree float_types
[NUM_MACHINE_MODES
];
164 /* For each binding contour we allocate a binding_level structure to indicate
165 the binding depth. */
167 struct GTY((chain_next ("%h.chain"))) gnat_binding_level
{
168 /* The binding level containing this one (the enclosing binding level). */
169 struct gnat_binding_level
*chain
;
170 /* The BLOCK node for this level. */
172 /* If nonzero, the setjmp buffer that needs to be updated for any
173 variable-sized definition within this context. */
177 /* The binding level currently in effect. */
178 static GTY(()) struct gnat_binding_level
*current_binding_level
;
180 /* A chain of gnat_binding_level structures awaiting reuse. */
181 static GTY((deletable
)) struct gnat_binding_level
*free_binding_level
;
183 /* An array of global declarations. */
184 static GTY(()) VEC(tree
,gc
) *global_decls
;
186 /* An array of builtin function declarations. */
187 static GTY(()) VEC(tree
,gc
) *builtin_decls
;
189 /* An array of global renaming pointers. */
190 static GTY(()) VEC(tree
,gc
) *global_renaming_pointers
;
192 /* A chain of unused BLOCK nodes. */
193 static GTY((deletable
)) tree free_block_chain
;
195 static tree
merge_sizes (tree
, tree
, tree
, bool, bool);
196 static tree
compute_related_constant (tree
, tree
);
197 static tree
split_plus (tree
, tree
*);
198 static tree
float_type_for_precision (int, enum machine_mode
);
199 static tree
convert_to_fat_pointer (tree
, tree
);
200 static tree
convert_to_thin_pointer (tree
, tree
);
201 static tree
make_descriptor_field (const char *,tree
, tree
, tree
, tree
);
202 static bool potential_alignment_gap (tree
, tree
, tree
);
203 static void process_attributes (tree
, struct attrib
*);
205 /* Initialize the association of GNAT nodes to GCC trees. */
208 init_gnat_to_gnu (void)
210 associate_gnat_to_gnu
= ggc_alloc_cleared_vec_tree (max_gnat_nodes
);
213 /* GNAT_ENTITY is a GNAT tree node for an entity. GNU_DECL is the GCC tree
214 which is to be associated with GNAT_ENTITY. Such GCC tree node is always
215 a ..._DECL node. If NO_CHECK is true, the latter check is suppressed.
217 If GNU_DECL is zero, a previous association is to be reset. */
220 save_gnu_tree (Entity_Id gnat_entity
, tree gnu_decl
, bool no_check
)
222 /* Check that GNAT_ENTITY is not already defined and that it is being set
223 to something which is a decl. Raise gigi 401 if not. Usually, this
224 means GNAT_ENTITY is defined twice, but occasionally is due to some
226 gcc_assert (!(gnu_decl
227 && (PRESENT_GNU_TREE (gnat_entity
)
228 || (!no_check
&& !DECL_P (gnu_decl
)))));
230 SET_GNU_TREE (gnat_entity
, gnu_decl
);
233 /* GNAT_ENTITY is a GNAT tree node for a defining identifier.
234 Return the ..._DECL node that was associated with it. If there is no tree
235 node associated with GNAT_ENTITY, abort.
237 In some cases, such as delayed elaboration or expressions that need to
238 be elaborated only once, GNAT_ENTITY is really not an entity. */
241 get_gnu_tree (Entity_Id gnat_entity
)
243 gcc_assert (PRESENT_GNU_TREE (gnat_entity
));
244 return GET_GNU_TREE (gnat_entity
);
247 /* Return nonzero if a GCC tree has been associated with GNAT_ENTITY. */
250 present_gnu_tree (Entity_Id gnat_entity
)
252 return PRESENT_GNU_TREE (gnat_entity
);
255 /* Initialize the association of GNAT nodes to GCC trees as dummies. */
258 init_dummy_type (void)
260 dummy_node_table
= ggc_alloc_cleared_vec_tree (max_gnat_nodes
);
263 /* Make a dummy type corresponding to GNAT_TYPE. */
266 make_dummy_type (Entity_Id gnat_type
)
268 Entity_Id gnat_underlying
= Gigi_Equivalent_Type (gnat_type
);
271 /* If there is an equivalent type, get its underlying type. */
272 if (Present (gnat_underlying
))
273 gnat_underlying
= Underlying_Type (gnat_underlying
);
275 /* If there was no equivalent type (can only happen when just annotating
276 types) or underlying type, go back to the original type. */
277 if (No (gnat_underlying
))
278 gnat_underlying
= gnat_type
;
280 /* If it there already a dummy type, use that one. Else make one. */
281 if (PRESENT_DUMMY_NODE (gnat_underlying
))
282 return GET_DUMMY_NODE (gnat_underlying
);
284 /* If this is a record, make a RECORD_TYPE or UNION_TYPE; else make
286 gnu_type
= make_node (Is_Record_Type (gnat_underlying
)
287 ? tree_code_for_record_type (gnat_underlying
)
289 TYPE_NAME (gnu_type
) = get_entity_name (gnat_type
);
290 TYPE_DUMMY_P (gnu_type
) = 1;
291 TYPE_STUB_DECL (gnu_type
)
292 = create_type_stub_decl (TYPE_NAME (gnu_type
), gnu_type
);
293 if (Is_By_Reference_Type (gnat_type
))
294 TREE_ADDRESSABLE (gnu_type
) = 1;
296 SET_DUMMY_NODE (gnat_underlying
, gnu_type
);
301 /* Return nonzero if we are currently in the global binding level. */
304 global_bindings_p (void)
306 return ((force_global
|| !current_function_decl
) ? -1 : 0);
309 /* Enter a new binding level. */
312 gnat_pushlevel (void)
314 struct gnat_binding_level
*newlevel
= NULL
;
316 /* Reuse a struct for this binding level, if there is one. */
317 if (free_binding_level
)
319 newlevel
= free_binding_level
;
320 free_binding_level
= free_binding_level
->chain
;
323 newlevel
= ggc_alloc_gnat_binding_level ();
325 /* Use a free BLOCK, if any; otherwise, allocate one. */
326 if (free_block_chain
)
328 newlevel
->block
= free_block_chain
;
329 free_block_chain
= BLOCK_CHAIN (free_block_chain
);
330 BLOCK_CHAIN (newlevel
->block
) = NULL_TREE
;
333 newlevel
->block
= make_node (BLOCK
);
335 /* Point the BLOCK we just made to its parent. */
336 if (current_binding_level
)
337 BLOCK_SUPERCONTEXT (newlevel
->block
) = current_binding_level
->block
;
339 BLOCK_VARS (newlevel
->block
) = NULL_TREE
;
340 BLOCK_SUBBLOCKS (newlevel
->block
) = NULL_TREE
;
341 TREE_USED (newlevel
->block
) = 1;
343 /* Add this level to the front of the chain (stack) of active levels. */
344 newlevel
->chain
= current_binding_level
;
345 newlevel
->jmpbuf_decl
= NULL_TREE
;
346 current_binding_level
= newlevel
;
349 /* Set SUPERCONTEXT of the BLOCK for the current binding level to FNDECL
350 and point FNDECL to this BLOCK. */
353 set_current_block_context (tree fndecl
)
355 BLOCK_SUPERCONTEXT (current_binding_level
->block
) = fndecl
;
356 DECL_INITIAL (fndecl
) = current_binding_level
->block
;
357 set_block_for_group (current_binding_level
->block
);
360 /* Set the jmpbuf_decl for the current binding level to DECL. */
363 set_block_jmpbuf_decl (tree decl
)
365 current_binding_level
->jmpbuf_decl
= decl
;
368 /* Get the jmpbuf_decl, if any, for the current binding level. */
371 get_block_jmpbuf_decl (void)
373 return current_binding_level
->jmpbuf_decl
;
376 /* Exit a binding level. Set any BLOCK into the current code group. */
381 struct gnat_binding_level
*level
= current_binding_level
;
382 tree block
= level
->block
;
384 BLOCK_VARS (block
) = nreverse (BLOCK_VARS (block
));
385 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
387 /* If this is a function-level BLOCK don't do anything. Otherwise, if there
388 are no variables free the block and merge its subblocks into those of its
389 parent block. Otherwise, add it to the list of its parent. */
390 if (TREE_CODE (BLOCK_SUPERCONTEXT (block
)) == FUNCTION_DECL
)
392 else if (BLOCK_VARS (block
) == NULL_TREE
)
394 BLOCK_SUBBLOCKS (level
->chain
->block
)
395 = chainon (BLOCK_SUBBLOCKS (block
),
396 BLOCK_SUBBLOCKS (level
->chain
->block
));
397 BLOCK_CHAIN (block
) = free_block_chain
;
398 free_block_chain
= block
;
402 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (level
->chain
->block
);
403 BLOCK_SUBBLOCKS (level
->chain
->block
) = block
;
404 TREE_USED (block
) = 1;
405 set_block_for_group (block
);
408 /* Free this binding structure. */
409 current_binding_level
= level
->chain
;
410 level
->chain
= free_binding_level
;
411 free_binding_level
= level
;
415 /* Records a ..._DECL node DECL as belonging to the current lexical scope
416 and uses GNAT_NODE for location information and propagating flags. */
419 gnat_pushdecl (tree decl
, Node_Id gnat_node
)
421 /* If this decl is public external or at toplevel, there is no context.
422 But PARM_DECLs always go in the level of its function. */
423 if (TREE_CODE (decl
) != PARM_DECL
424 && ((DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
425 || global_bindings_p ()))
426 DECL_CONTEXT (decl
) = 0;
429 DECL_CONTEXT (decl
) = current_function_decl
;
431 /* Functions imported in another function are not really nested.
432 For really nested functions mark them initially as needing
433 a static chain for uses of that flag before unnesting;
434 lower_nested_functions will then recompute it. */
435 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !TREE_PUBLIC (decl
))
436 DECL_STATIC_CHAIN (decl
) = 1;
439 TREE_NO_WARNING (decl
) = (gnat_node
== Empty
|| Warnings_Off (gnat_node
));
441 /* Set the location of DECL and emit a declaration for it. */
442 if (Present (gnat_node
))
443 Sloc_to_locus (Sloc (gnat_node
), &DECL_SOURCE_LOCATION (decl
));
444 add_decl_expr (decl
, gnat_node
);
446 /* Put the declaration on the list. The list of declarations is in reverse
447 order. The list will be reversed later. Put global variables in the
448 globals list and builtin functions in a dedicated list to speed up
449 further lookups. Don't put TYPE_DECLs for UNCONSTRAINED_ARRAY_TYPE into
450 the list, as they will cause trouble with the debugger and aren't needed
452 if (TREE_CODE (decl
) != TYPE_DECL
453 || TREE_CODE (TREE_TYPE (decl
)) != UNCONSTRAINED_ARRAY_TYPE
)
455 if (global_bindings_p ())
457 VEC_safe_push (tree
, gc
, global_decls
, decl
);
459 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
460 VEC_safe_push (tree
, gc
, builtin_decls
, decl
);
464 DECL_CHAIN (decl
) = BLOCK_VARS (current_binding_level
->block
);
465 BLOCK_VARS (current_binding_level
->block
) = decl
;
469 /* For the declaration of a type, set its name if it either is not already
470 set or if the previous type name was not derived from a source name.
471 We'd rather have the type named with a real name and all the pointer
472 types to the same object have the same POINTER_TYPE node. Code in the
473 equivalent function of c-decl.c makes a copy of the type node here, but
474 that may cause us trouble with incomplete types. We make an exception
475 for fat pointer types because the compiler automatically builds them
476 for unconstrained array types and the debugger uses them to represent
477 both these and pointers to these. */
478 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_NAME (decl
))
480 tree t
= TREE_TYPE (decl
);
482 if (!(TYPE_NAME (t
) && TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
))
484 else if (TYPE_IS_FAT_POINTER_P (t
))
486 tree tt
= build_variant_type_copy (t
);
487 TYPE_NAME (tt
) = decl
;
488 TREE_USED (tt
) = TREE_USED (t
);
489 TREE_TYPE (decl
) = tt
;
490 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
491 DECL_ORIGINAL_TYPE (decl
) = DECL_ORIGINAL_TYPE (TYPE_NAME (t
));
493 DECL_ORIGINAL_TYPE (decl
) = t
;
495 DECL_ARTIFICIAL (decl
) = 0;
497 else if (DECL_ARTIFICIAL (TYPE_NAME (t
)) && !DECL_ARTIFICIAL (decl
))
502 /* Propagate the name to all the variants. This is needed for
503 the type qualifiers machinery to work properly. */
505 for (t
= TYPE_MAIN_VARIANT (t
); t
; t
= TYPE_NEXT_VARIANT (t
))
506 TYPE_NAME (t
) = decl
;
510 /* Record TYPE as a builtin type for Ada. NAME is the name of the type. */
513 record_builtin_type (const char *name
, tree type
)
515 tree type_decl
= build_decl (input_location
,
516 TYPE_DECL
, get_identifier (name
), type
);
518 gnat_pushdecl (type_decl
, Empty
);
520 if (debug_hooks
->type_decl
)
521 debug_hooks
->type_decl (type_decl
, false);
524 /* Given a record type RECORD_TYPE and a list of FIELD_DECL nodes FIELD_LIST,
525 finish constructing the record or union type. If REP_LEVEL is zero, this
526 record has no representation clause and so will be entirely laid out here.
527 If REP_LEVEL is one, this record has a representation clause and has been
528 laid out already; only set the sizes and alignment. If REP_LEVEL is two,
529 this record is derived from a parent record and thus inherits its layout;
530 only make a pass on the fields to finalize them. DEBUG_INFO_P is true if
531 we need to write debug information about this type. */
534 finish_record_type (tree record_type
, tree field_list
, int rep_level
,
537 enum tree_code code
= TREE_CODE (record_type
);
538 tree name
= TYPE_NAME (record_type
);
539 tree ada_size
= bitsize_zero_node
;
540 tree size
= bitsize_zero_node
;
541 bool had_size
= TYPE_SIZE (record_type
) != 0;
542 bool had_size_unit
= TYPE_SIZE_UNIT (record_type
) != 0;
543 bool had_align
= TYPE_ALIGN (record_type
) != 0;
546 TYPE_FIELDS (record_type
) = field_list
;
548 /* Always attach the TYPE_STUB_DECL for a record type. It is required to
549 generate debug info and have a parallel type. */
550 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
551 name
= DECL_NAME (name
);
552 TYPE_STUB_DECL (record_type
) = create_type_stub_decl (name
, record_type
);
554 /* Globally initialize the record first. If this is a rep'ed record,
555 that just means some initializations; otherwise, layout the record. */
558 TYPE_ALIGN (record_type
) = MAX (BITS_PER_UNIT
, TYPE_ALIGN (record_type
));
561 TYPE_SIZE_UNIT (record_type
) = size_zero_node
;
564 TYPE_SIZE (record_type
) = bitsize_zero_node
;
566 /* For all-repped records with a size specified, lay the QUAL_UNION_TYPE
567 out just like a UNION_TYPE, since the size will be fixed. */
568 else if (code
== QUAL_UNION_TYPE
)
573 /* Ensure there isn't a size already set. There can be in an error
574 case where there is a rep clause but all fields have errors and
575 no longer have a position. */
576 TYPE_SIZE (record_type
) = 0;
577 layout_type (record_type
);
580 /* At this point, the position and size of each field is known. It was
581 either set before entry by a rep clause, or by laying out the type above.
583 We now run a pass over the fields (in reverse order for QUAL_UNION_TYPEs)
584 to compute the Ada size; the GCC size and alignment (for rep'ed records
585 that are not padding types); and the mode (for rep'ed records). We also
586 clear the DECL_BIT_FIELD indication for the cases we know have not been
587 handled yet, and adjust DECL_NONADDRESSABLE_P accordingly. */
589 if (code
== QUAL_UNION_TYPE
)
590 field_list
= nreverse (field_list
);
592 for (field
= field_list
; field
; field
= DECL_CHAIN (field
))
594 tree type
= TREE_TYPE (field
);
595 tree pos
= bit_position (field
);
596 tree this_size
= DECL_SIZE (field
);
599 if ((TREE_CODE (type
) == RECORD_TYPE
600 || TREE_CODE (type
) == UNION_TYPE
601 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
602 && !TYPE_FAT_POINTER_P (type
)
603 && !TYPE_CONTAINS_TEMPLATE_P (type
)
604 && TYPE_ADA_SIZE (type
))
605 this_ada_size
= TYPE_ADA_SIZE (type
);
607 this_ada_size
= this_size
;
609 /* Clear DECL_BIT_FIELD for the cases layout_decl does not handle. */
610 if (DECL_BIT_FIELD (field
)
611 && operand_equal_p (this_size
, TYPE_SIZE (type
), 0))
613 unsigned int align
= TYPE_ALIGN (type
);
615 /* In the general case, type alignment is required. */
616 if (value_factor_p (pos
, align
))
618 /* The enclosing record type must be sufficiently aligned.
619 Otherwise, if no alignment was specified for it and it
620 has been laid out already, bump its alignment to the
621 desired one if this is compatible with its size. */
622 if (TYPE_ALIGN (record_type
) >= align
)
624 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
), align
);
625 DECL_BIT_FIELD (field
) = 0;
629 && value_factor_p (TYPE_SIZE (record_type
), align
))
631 TYPE_ALIGN (record_type
) = align
;
632 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
), align
);
633 DECL_BIT_FIELD (field
) = 0;
637 /* In the non-strict alignment case, only byte alignment is. */
638 if (!STRICT_ALIGNMENT
639 && DECL_BIT_FIELD (field
)
640 && value_factor_p (pos
, BITS_PER_UNIT
))
641 DECL_BIT_FIELD (field
) = 0;
644 /* If we still have DECL_BIT_FIELD set at this point, we know that the
645 field is technically not addressable. Except that it can actually
646 be addressed if it is BLKmode and happens to be properly aligned. */
647 if (DECL_BIT_FIELD (field
)
648 && !(DECL_MODE (field
) == BLKmode
649 && value_factor_p (pos
, BITS_PER_UNIT
)))
650 DECL_NONADDRESSABLE_P (field
) = 1;
652 /* A type must be as aligned as its most aligned field that is not
653 a bit-field. But this is already enforced by layout_type. */
654 if (rep_level
> 0 && !DECL_BIT_FIELD (field
))
655 TYPE_ALIGN (record_type
)
656 = MAX (TYPE_ALIGN (record_type
), DECL_ALIGN (field
));
661 ada_size
= size_binop (MAX_EXPR
, ada_size
, this_ada_size
);
662 size
= size_binop (MAX_EXPR
, size
, this_size
);
665 case QUAL_UNION_TYPE
:
667 = fold_build3 (COND_EXPR
, bitsizetype
, DECL_QUALIFIER (field
),
668 this_ada_size
, ada_size
);
669 size
= fold_build3 (COND_EXPR
, bitsizetype
, DECL_QUALIFIER (field
),
674 /* Since we know here that all fields are sorted in order of
675 increasing bit position, the size of the record is one
676 higher than the ending bit of the last field processed
677 unless we have a rep clause, since in that case we might
678 have a field outside a QUAL_UNION_TYPE that has a higher ending
679 position. So use a MAX in that case. Also, if this field is a
680 QUAL_UNION_TYPE, we need to take into account the previous size in
681 the case of empty variants. */
683 = merge_sizes (ada_size
, pos
, this_ada_size
,
684 TREE_CODE (type
) == QUAL_UNION_TYPE
, rep_level
> 0);
686 = merge_sizes (size
, pos
, this_size
,
687 TREE_CODE (type
) == QUAL_UNION_TYPE
, rep_level
> 0);
695 if (code
== QUAL_UNION_TYPE
)
696 nreverse (field_list
);
700 /* If this is a padding record, we never want to make the size smaller
701 than what was specified in it, if any. */
702 if (TYPE_IS_PADDING_P (record_type
) && TYPE_SIZE (record_type
))
703 size
= TYPE_SIZE (record_type
);
705 /* Now set any of the values we've just computed that apply. */
706 if (!TYPE_FAT_POINTER_P (record_type
)
707 && !TYPE_CONTAINS_TEMPLATE_P (record_type
))
708 SET_TYPE_ADA_SIZE (record_type
, ada_size
);
712 tree size_unit
= had_size_unit
713 ? TYPE_SIZE_UNIT (record_type
)
715 size_binop (CEIL_DIV_EXPR
, size
,
717 unsigned int align
= TYPE_ALIGN (record_type
);
719 TYPE_SIZE (record_type
) = variable_size (round_up (size
, align
));
720 TYPE_SIZE_UNIT (record_type
)
721 = variable_size (round_up (size_unit
, align
/ BITS_PER_UNIT
));
723 compute_record_mode (record_type
);
728 rest_of_record_type_compilation (record_type
);
731 /* Wrap up compilation of RECORD_TYPE, i.e. output all the debug information
732 associated with it. It need not be invoked directly in most cases since
733 finish_record_type takes care of doing so, but this can be necessary if
734 a parallel type is to be attached to the record type. */
737 rest_of_record_type_compilation (tree record_type
)
739 tree field_list
= TYPE_FIELDS (record_type
);
741 enum tree_code code
= TREE_CODE (record_type
);
742 bool var_size
= false;
744 for (field
= field_list
; field
; field
= DECL_CHAIN (field
))
746 /* We need to make an XVE/XVU record if any field has variable size,
747 whether or not the record does. For example, if we have a union,
748 it may be that all fields, rounded up to the alignment, have the
749 same size, in which case we'll use that size. But the debug
750 output routines (except Dwarf2) won't be able to output the fields,
751 so we need to make the special record. */
752 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
753 /* If a field has a non-constant qualifier, the record will have
754 variable size too. */
755 || (code
== QUAL_UNION_TYPE
756 && TREE_CODE (DECL_QUALIFIER (field
)) != INTEGER_CST
))
763 /* If this record is of variable size, rename it so that the
764 debugger knows it is and make a new, parallel, record
765 that tells the debugger how the record is laid out. See
766 exp_dbug.ads. But don't do this for records that are padding
767 since they confuse GDB. */
768 if (var_size
&& !TYPE_IS_PADDING_P (record_type
))
771 = make_node (TREE_CODE (record_type
) == QUAL_UNION_TYPE
772 ? UNION_TYPE
: TREE_CODE (record_type
));
773 tree orig_name
= TYPE_NAME (record_type
), new_name
;
774 tree last_pos
= bitsize_zero_node
;
775 tree old_field
, prev_old_field
= NULL_TREE
;
777 if (TREE_CODE (orig_name
) == TYPE_DECL
)
778 orig_name
= DECL_NAME (orig_name
);
781 = concat_name (orig_name
, TREE_CODE (record_type
) == QUAL_UNION_TYPE
783 TYPE_NAME (new_record_type
) = new_name
;
784 TYPE_ALIGN (new_record_type
) = BIGGEST_ALIGNMENT
;
785 TYPE_STUB_DECL (new_record_type
)
786 = create_type_stub_decl (new_name
, new_record_type
);
787 DECL_IGNORED_P (TYPE_STUB_DECL (new_record_type
))
788 = DECL_IGNORED_P (TYPE_STUB_DECL (record_type
));
789 TYPE_SIZE (new_record_type
) = size_int (TYPE_ALIGN (record_type
));
790 TYPE_SIZE_UNIT (new_record_type
)
791 = size_int (TYPE_ALIGN (record_type
) / BITS_PER_UNIT
);
793 add_parallel_type (TYPE_STUB_DECL (record_type
), new_record_type
);
795 /* Now scan all the fields, replacing each field with a new
796 field corresponding to the new encoding. */
797 for (old_field
= TYPE_FIELDS (record_type
); old_field
;
798 old_field
= DECL_CHAIN (old_field
))
800 tree field_type
= TREE_TYPE (old_field
);
801 tree field_name
= DECL_NAME (old_field
);
803 tree curpos
= bit_position (old_field
);
805 unsigned int align
= 0;
808 /* See how the position was modified from the last position.
810 There are two basic cases we support: a value was added
811 to the last position or the last position was rounded to
812 a boundary and they something was added. Check for the
813 first case first. If not, see if there is any evidence
814 of rounding. If so, round the last position and try
817 If this is a union, the position can be taken as zero. */
819 /* Some computations depend on the shape of the position expression,
820 so strip conversions to make sure it's exposed. */
821 curpos
= remove_conversions (curpos
, true);
823 if (TREE_CODE (new_record_type
) == UNION_TYPE
)
824 pos
= bitsize_zero_node
, align
= 0;
826 pos
= compute_related_constant (curpos
, last_pos
);
828 if (!pos
&& TREE_CODE (curpos
) == MULT_EXPR
829 && host_integerp (TREE_OPERAND (curpos
, 1), 1))
831 tree offset
= TREE_OPERAND (curpos
, 0);
832 align
= tree_low_cst (TREE_OPERAND (curpos
, 1), 1);
834 /* An offset which is a bitwise AND with a negative power of 2
835 means an alignment corresponding to this power of 2. Note
836 that, as sizetype is sign-extended but nonetheless unsigned,
837 we don't directly use tree_int_cst_sgn. */
838 offset
= remove_conversions (offset
, true);
839 if (TREE_CODE (offset
) == BIT_AND_EXPR
840 && host_integerp (TREE_OPERAND (offset
, 1), 0)
841 && TREE_INT_CST_HIGH (TREE_OPERAND (offset
, 1)) < 0)
844 = - tree_low_cst (TREE_OPERAND (offset
, 1), 0);
845 if (exact_log2 (pow
) > 0)
849 pos
= compute_related_constant (curpos
,
850 round_up (last_pos
, align
));
852 else if (!pos
&& TREE_CODE (curpos
) == PLUS_EXPR
853 && TREE_CODE (TREE_OPERAND (curpos
, 1)) == INTEGER_CST
854 && TREE_CODE (TREE_OPERAND (curpos
, 0)) == MULT_EXPR
855 && host_integerp (TREE_OPERAND
856 (TREE_OPERAND (curpos
, 0), 1),
861 (TREE_OPERAND (TREE_OPERAND (curpos
, 0), 1), 1);
862 pos
= compute_related_constant (curpos
,
863 round_up (last_pos
, align
));
865 else if (potential_alignment_gap (prev_old_field
, old_field
,
868 align
= TYPE_ALIGN (field_type
);
869 pos
= compute_related_constant (curpos
,
870 round_up (last_pos
, align
));
873 /* If we can't compute a position, set it to zero.
875 ??? We really should abort here, but it's too much work
876 to get this correct for all cases. */
879 pos
= bitsize_zero_node
;
881 /* See if this type is variable-sized and make a pointer type
882 and indicate the indirection if so. Beware that the debug
883 back-end may adjust the position computed above according
884 to the alignment of the field type, i.e. the pointer type
885 in this case, if we don't preventively counter that. */
886 if (TREE_CODE (DECL_SIZE (old_field
)) != INTEGER_CST
)
888 field_type
= build_pointer_type (field_type
);
889 if (align
!= 0 && TYPE_ALIGN (field_type
) > align
)
891 field_type
= copy_node (field_type
);
892 TYPE_ALIGN (field_type
) = align
;
897 /* Make a new field name, if necessary. */
898 if (var
|| align
!= 0)
903 sprintf (suffix
, "XV%c%u", var
? 'L' : 'A',
904 align
/ BITS_PER_UNIT
);
906 strcpy (suffix
, "XVL");
908 field_name
= concat_name (field_name
, suffix
);
912 = create_field_decl (field_name
, field_type
, new_record_type
,
913 DECL_SIZE (old_field
), pos
, 0, 0);
914 DECL_CHAIN (new_field
) = TYPE_FIELDS (new_record_type
);
915 TYPE_FIELDS (new_record_type
) = new_field
;
917 /* If old_field is a QUAL_UNION_TYPE, take its size as being
918 zero. The only time it's not the last field of the record
919 is when there are other components at fixed positions after
920 it (meaning there was a rep clause for every field) and we
921 want to be able to encode them. */
922 last_pos
= size_binop (PLUS_EXPR
, bit_position (old_field
),
923 (TREE_CODE (TREE_TYPE (old_field
))
926 : DECL_SIZE (old_field
));
927 prev_old_field
= old_field
;
930 TYPE_FIELDS (new_record_type
)
931 = nreverse (TYPE_FIELDS (new_record_type
));
933 rest_of_type_decl_compilation (TYPE_STUB_DECL (new_record_type
));
936 rest_of_type_decl_compilation (TYPE_STUB_DECL (record_type
));
939 /* Append PARALLEL_TYPE on the chain of parallel types for decl. */
942 add_parallel_type (tree decl
, tree parallel_type
)
946 while (DECL_PARALLEL_TYPE (d
))
947 d
= TYPE_STUB_DECL (DECL_PARALLEL_TYPE (d
));
949 SET_DECL_PARALLEL_TYPE (d
, parallel_type
);
952 /* Return the parallel type associated to a type, if any. */
955 get_parallel_type (tree type
)
957 if (TYPE_STUB_DECL (type
))
958 return DECL_PARALLEL_TYPE (TYPE_STUB_DECL (type
));
963 /* Utility function of above to merge LAST_SIZE, the previous size of a record
964 with FIRST_BIT and SIZE that describe a field. SPECIAL is true if this
965 represents a QUAL_UNION_TYPE in which case we must look for COND_EXPRs and
966 replace a value of zero with the old size. If HAS_REP is true, we take the
967 MAX of the end position of this field with LAST_SIZE. In all other cases,
968 we use FIRST_BIT plus SIZE. Return an expression for the size. */
971 merge_sizes (tree last_size
, tree first_bit
, tree size
, bool special
,
974 tree type
= TREE_TYPE (last_size
);
977 if (!special
|| TREE_CODE (size
) != COND_EXPR
)
979 new_size
= size_binop (PLUS_EXPR
, first_bit
, size
);
981 new_size
= size_binop (MAX_EXPR
, last_size
, new_size
);
985 new_size
= fold_build3 (COND_EXPR
, type
, TREE_OPERAND (size
, 0),
986 integer_zerop (TREE_OPERAND (size
, 1))
987 ? last_size
: merge_sizes (last_size
, first_bit
,
988 TREE_OPERAND (size
, 1),
990 integer_zerop (TREE_OPERAND (size
, 2))
991 ? last_size
: merge_sizes (last_size
, first_bit
,
992 TREE_OPERAND (size
, 2),
995 /* We don't need any NON_VALUE_EXPRs and they can confuse us (especially
996 when fed through substitute_in_expr) into thinking that a constant
997 size is not constant. */
998 while (TREE_CODE (new_size
) == NON_LVALUE_EXPR
)
999 new_size
= TREE_OPERAND (new_size
, 0);
1004 /* Utility function of above to see if OP0 and OP1, both of SIZETYPE, are
1005 related by the addition of a constant. Return that constant if so. */
1008 compute_related_constant (tree op0
, tree op1
)
1010 tree op0_var
, op1_var
;
1011 tree op0_con
= split_plus (op0
, &op0_var
);
1012 tree op1_con
= split_plus (op1
, &op1_var
);
1013 tree result
= size_binop (MINUS_EXPR
, op0_con
, op1_con
);
1015 if (operand_equal_p (op0_var
, op1_var
, 0))
1017 else if (operand_equal_p (op0
, size_binop (PLUS_EXPR
, op1_var
, result
), 0))
1023 /* Utility function of above to split a tree OP which may be a sum, into a
1024 constant part, which is returned, and a variable part, which is stored
1025 in *PVAR. *PVAR may be bitsize_zero_node. All operations must be of
1029 split_plus (tree in
, tree
*pvar
)
1031 /* Strip NOPS in order to ease the tree traversal and maximize the
1032 potential for constant or plus/minus discovery. We need to be careful
1033 to always return and set *pvar to bitsizetype trees, but it's worth
1037 *pvar
= convert (bitsizetype
, in
);
1039 if (TREE_CODE (in
) == INTEGER_CST
)
1041 *pvar
= bitsize_zero_node
;
1042 return convert (bitsizetype
, in
);
1044 else if (TREE_CODE (in
) == PLUS_EXPR
|| TREE_CODE (in
) == MINUS_EXPR
)
1046 tree lhs_var
, rhs_var
;
1047 tree lhs_con
= split_plus (TREE_OPERAND (in
, 0), &lhs_var
);
1048 tree rhs_con
= split_plus (TREE_OPERAND (in
, 1), &rhs_var
);
1050 if (lhs_var
== TREE_OPERAND (in
, 0)
1051 && rhs_var
== TREE_OPERAND (in
, 1))
1052 return bitsize_zero_node
;
1054 *pvar
= size_binop (TREE_CODE (in
), lhs_var
, rhs_var
);
1055 return size_binop (TREE_CODE (in
), lhs_con
, rhs_con
);
1058 return bitsize_zero_node
;
1061 /* Return a FUNCTION_TYPE node. RETURN_TYPE is the type returned by the
1062 subprogram. If it is VOID_TYPE, then we are dealing with a procedure,
1063 otherwise we are dealing with a function. PARAM_DECL_LIST is a list of
1064 PARM_DECL nodes that are the subprogram parameters. CICO_LIST is the
1065 copy-in/copy-out list to be stored into the TYPE_CICO_LIST field.
1066 RETURN_UNCONSTRAINED_P is true if the function returns an unconstrained
1067 object. RETURN_BY_DIRECT_REF_P is true if the function returns by direct
1068 reference. RETURN_BY_INVISI_REF_P is true if the function returns by
1069 invisible reference. */
1072 create_subprog_type (tree return_type
, tree param_decl_list
, tree cico_list
,
1073 bool return_unconstrained_p
, bool return_by_direct_ref_p
,
1074 bool return_by_invisi_ref_p
)
1076 /* A chain of TREE_LIST nodes whose TREE_VALUEs are the data type nodes of
1077 the subprogram formal parameters. This list is generated by traversing
1078 the input list of PARM_DECL nodes. */
1079 tree param_type_list
= NULL_TREE
;
1082 for (t
= param_decl_list
; t
; t
= DECL_CHAIN (t
))
1083 param_type_list
= tree_cons (NULL_TREE
, TREE_TYPE (t
), param_type_list
);
1085 /* The list of the function parameter types has to be terminated by the void
1086 type to signal to the back-end that we are not dealing with a variable
1087 parameter subprogram, but that it has a fixed number of parameters. */
1088 param_type_list
= tree_cons (NULL_TREE
, void_type_node
, param_type_list
);
1090 /* The list of argument types has been created in reverse so reverse it. */
1091 param_type_list
= nreverse (param_type_list
);
1093 type
= build_function_type (return_type
, param_type_list
);
1095 /* TYPE may have been shared since GCC hashes types. If it has a different
1096 CICO_LIST, make a copy. Likewise for the various flags. */
1097 if (TYPE_CI_CO_LIST (type
) != cico_list
1098 || TYPE_RETURN_UNCONSTRAINED_P (type
) != return_unconstrained_p
1099 || TYPE_RETURN_BY_DIRECT_REF_P (type
) != return_by_direct_ref_p
1100 || TREE_ADDRESSABLE (type
) != return_by_invisi_ref_p
)
1102 type
= copy_type (type
);
1103 TYPE_CI_CO_LIST (type
) = cico_list
;
1104 TYPE_RETURN_UNCONSTRAINED_P (type
) = return_unconstrained_p
;
1105 TYPE_RETURN_BY_DIRECT_REF_P (type
) = return_by_direct_ref_p
;
1106 TREE_ADDRESSABLE (type
) = return_by_invisi_ref_p
;
1112 /* Return a copy of TYPE but safe to modify in any way. */
1115 copy_type (tree type
)
1117 tree new_type
= copy_node (type
);
1119 /* Unshare the language-specific data. */
1120 if (TYPE_LANG_SPECIFIC (type
))
1122 TYPE_LANG_SPECIFIC (new_type
) = NULL
;
1123 SET_TYPE_LANG_SPECIFIC (new_type
, GET_TYPE_LANG_SPECIFIC (type
));
1126 /* And the contents of the language-specific slot if needed. */
1127 if ((INTEGRAL_TYPE_P (type
) || TREE_CODE (type
) == REAL_TYPE
)
1128 && TYPE_RM_VALUES (type
))
1130 TYPE_RM_VALUES (new_type
) = NULL_TREE
;
1131 SET_TYPE_RM_SIZE (new_type
, TYPE_RM_SIZE (type
));
1132 SET_TYPE_RM_MIN_VALUE (new_type
, TYPE_RM_MIN_VALUE (type
));
1133 SET_TYPE_RM_MAX_VALUE (new_type
, TYPE_RM_MAX_VALUE (type
));
1136 /* copy_node clears this field instead of copying it, because it is
1137 aliased with TREE_CHAIN. */
1138 TYPE_STUB_DECL (new_type
) = TYPE_STUB_DECL (type
);
1140 TYPE_POINTER_TO (new_type
) = 0;
1141 TYPE_REFERENCE_TO (new_type
) = 0;
1142 TYPE_MAIN_VARIANT (new_type
) = new_type
;
1143 TYPE_NEXT_VARIANT (new_type
) = 0;
1148 /* Return a subtype of sizetype with range MIN to MAX and whose
1149 TYPE_INDEX_TYPE is INDEX. GNAT_NODE is used for the position
1150 of the associated TYPE_DECL. */
1153 create_index_type (tree min
, tree max
, tree index
, Node_Id gnat_node
)
1155 /* First build a type for the desired range. */
1156 tree type
= build_index_2_type (min
, max
);
1158 /* If this type has the TYPE_INDEX_TYPE we want, return it. */
1159 if (TYPE_INDEX_TYPE (type
) == index
)
1162 /* Otherwise, if TYPE_INDEX_TYPE is set, make a copy. Note that we have
1163 no way of sharing these types, but that's only a small hole. */
1164 if (TYPE_INDEX_TYPE (type
))
1165 type
= copy_type (type
);
1167 SET_TYPE_INDEX_TYPE (type
, index
);
1168 create_type_decl (NULL_TREE
, type
, NULL
, true, false, gnat_node
);
1173 /* Return a subtype of TYPE with range MIN to MAX. If TYPE is NULL,
1174 sizetype is used. */
1177 create_range_type (tree type
, tree min
, tree max
)
1181 if (type
== NULL_TREE
)
1184 /* First build a type with the base range. */
1186 = build_range_type (type
, TYPE_MIN_VALUE (type
), TYPE_MAX_VALUE (type
));
1188 min
= convert (type
, min
);
1189 max
= convert (type
, max
);
1191 /* If this type has the TYPE_RM_{MIN,MAX}_VALUE we want, return it. */
1192 if (TYPE_RM_MIN_VALUE (range_type
)
1193 && TYPE_RM_MAX_VALUE (range_type
)
1194 && operand_equal_p (TYPE_RM_MIN_VALUE (range_type
), min
, 0)
1195 && operand_equal_p (TYPE_RM_MAX_VALUE (range_type
), max
, 0))
1198 /* Otherwise, if TYPE_RM_{MIN,MAX}_VALUE is set, make a copy. */
1199 if (TYPE_RM_MIN_VALUE (range_type
) || TYPE_RM_MAX_VALUE (range_type
))
1200 range_type
= copy_type (range_type
);
1202 /* Then set the actual range. */
1203 SET_TYPE_RM_MIN_VALUE (range_type
, min
);
1204 SET_TYPE_RM_MAX_VALUE (range_type
, max
);
1209 /* Return a TYPE_DECL node suitable for the TYPE_STUB_DECL field of a type.
1210 TYPE_NAME gives the name of the type and TYPE is a ..._TYPE node giving
1214 create_type_stub_decl (tree type_name
, tree type
)
1216 /* Using a named TYPE_DECL ensures that a type name marker is emitted in
1217 STABS while setting DECL_ARTIFICIAL ensures that no DW_TAG_typedef is
1218 emitted in DWARF. */
1219 tree type_decl
= build_decl (input_location
,
1220 TYPE_DECL
, type_name
, type
);
1221 DECL_ARTIFICIAL (type_decl
) = 1;
1225 /* Return a TYPE_DECL node. TYPE_NAME gives the name of the type and TYPE
1226 is a ..._TYPE node giving its data type. ARTIFICIAL_P is true if this
1227 is a declaration that was generated by the compiler. DEBUG_INFO_P is
1228 true if we need to write debug information about this type. GNAT_NODE
1229 is used for the position of the decl. */
1232 create_type_decl (tree type_name
, tree type
, struct attrib
*attr_list
,
1233 bool artificial_p
, bool debug_info_p
, Node_Id gnat_node
)
1235 enum tree_code code
= TREE_CODE (type
);
1236 bool named
= TYPE_NAME (type
) && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
;
1239 /* Only the builtin TYPE_STUB_DECL should be used for dummy types. */
1240 gcc_assert (!TYPE_IS_DUMMY_P (type
));
1242 /* If the type hasn't been named yet, we're naming it; preserve an existing
1243 TYPE_STUB_DECL that has been attached to it for some purpose. */
1244 if (!named
&& TYPE_STUB_DECL (type
))
1246 type_decl
= TYPE_STUB_DECL (type
);
1247 DECL_NAME (type_decl
) = type_name
;
1250 type_decl
= build_decl (input_location
,
1251 TYPE_DECL
, type_name
, type
);
1253 DECL_ARTIFICIAL (type_decl
) = artificial_p
;
1255 /* Add this decl to the current binding level. */
1256 gnat_pushdecl (type_decl
, gnat_node
);
1258 process_attributes (type_decl
, attr_list
);
1260 /* If we're naming the type, equate the TYPE_STUB_DECL to the name.
1261 This causes the name to be also viewed as a "tag" by the debug
1262 back-end, with the advantage that no DW_TAG_typedef is emitted
1263 for artificial "tagged" types in DWARF. */
1265 TYPE_STUB_DECL (type
) = type_decl
;
1267 /* Pass the type declaration to the debug back-end unless this is an
1268 UNCONSTRAINED_ARRAY_TYPE that the back-end does not support, or a
1269 type for which debugging information was not requested, or else an
1270 ENUMERAL_TYPE or RECORD_TYPE (except for fat pointers) which are
1271 handled separately. And do not pass dummy types either. */
1272 if (code
== UNCONSTRAINED_ARRAY_TYPE
|| !debug_info_p
)
1273 DECL_IGNORED_P (type_decl
) = 1;
1274 else if (code
!= ENUMERAL_TYPE
1275 && (code
!= RECORD_TYPE
|| TYPE_FAT_POINTER_P (type
))
1276 && !((code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
1277 && TYPE_IS_DUMMY_P (TREE_TYPE (type
)))
1278 && !(code
== RECORD_TYPE
1280 (TREE_TYPE (TREE_TYPE (TYPE_FIELDS (type
))))))
1281 rest_of_type_decl_compilation (type_decl
);
1286 /* Return a VAR_DECL or CONST_DECL node.
1288 VAR_NAME gives the name of the variable. ASM_NAME is its assembler name
1289 (if provided). TYPE is its data type (a GCC ..._TYPE node). VAR_INIT is
1290 the GCC tree for an optional initial expression; NULL_TREE if none.
1292 CONST_FLAG is true if this variable is constant, in which case we might
1293 return a CONST_DECL node unless CONST_DECL_ALLOWED_P is false.
1295 PUBLIC_FLAG is true if this is for a reference to a public entity or for a
1296 definition to be made visible outside of the current compilation unit, for
1297 instance variable definitions in a package specification.
1299 EXTERN_FLAG is true when processing an external variable declaration (as
1300 opposed to a definition: no storage is to be allocated for the variable).
1302 STATIC_FLAG is only relevant when not at top level. In that case
1303 it indicates whether to always allocate storage to the variable.
1305 GNAT_NODE is used for the position of the decl. */
1308 create_var_decl_1 (tree var_name
, tree asm_name
, tree type
, tree var_init
,
1309 bool const_flag
, bool public_flag
, bool extern_flag
,
1310 bool static_flag
, bool const_decl_allowed_p
,
1311 struct attrib
*attr_list
, Node_Id gnat_node
)
1315 && gnat_types_compatible_p (type
, TREE_TYPE (var_init
))
1316 && (global_bindings_p () || static_flag
1317 ? initializer_constant_valid_p (var_init
, TREE_TYPE (var_init
)) != 0
1318 : TREE_CONSTANT (var_init
)));
1320 /* Whether we will make TREE_CONSTANT the DECL we produce here, in which
1321 case the initializer may be used in-lieu of the DECL node (as done in
1322 Identifier_to_gnu). This is useful to prevent the need of elaboration
1323 code when an identifier for which such a decl is made is in turn used as
1324 an initializer. We used to rely on CONST vs VAR_DECL for this purpose,
1325 but extra constraints apply to this choice (see below) and are not
1326 relevant to the distinction we wish to make. */
1327 bool constant_p
= const_flag
&& init_const
;
1329 /* The actual DECL node. CONST_DECL was initially intended for enumerals
1330 and may be used for scalars in general but not for aggregates. */
1332 = build_decl (input_location
,
1333 (constant_p
&& const_decl_allowed_p
1334 && !AGGREGATE_TYPE_P (type
)) ? CONST_DECL
: VAR_DECL
,
1337 /* If this is external, throw away any initializations (they will be done
1338 elsewhere) unless this is a constant for which we would like to remain
1339 able to get the initializer. If we are defining a global here, leave a
1340 constant initialization and save any variable elaborations for the
1341 elaboration routine. If we are just annotating types, throw away the
1342 initialization if it isn't a constant. */
1343 if ((extern_flag
&& !constant_p
)
1344 || (type_annotate_only
&& var_init
&& !TREE_CONSTANT (var_init
)))
1345 var_init
= NULL_TREE
;
1347 /* At the global level, an initializer requiring code to be generated
1348 produces elaboration statements. Check that such statements are allowed,
1349 that is, not violating a No_Elaboration_Code restriction. */
1350 if (global_bindings_p () && var_init
!= 0 && !init_const
)
1351 Check_Elaboration_Code_Allowed (gnat_node
);
1353 DECL_INITIAL (var_decl
) = var_init
;
1354 TREE_READONLY (var_decl
) = const_flag
;
1355 DECL_EXTERNAL (var_decl
) = extern_flag
;
1356 TREE_PUBLIC (var_decl
) = public_flag
|| extern_flag
;
1357 TREE_CONSTANT (var_decl
) = constant_p
;
1358 TREE_THIS_VOLATILE (var_decl
) = TREE_SIDE_EFFECTS (var_decl
)
1359 = TYPE_VOLATILE (type
);
1361 /* Ada doesn't feature Fortran-like COMMON variables so we shouldn't
1362 try to fiddle with DECL_COMMON. However, on platforms that don't
1363 support global BSS sections, uninitialized global variables would
1364 go in DATA instead, thus increasing the size of the executable. */
1366 && TREE_CODE (var_decl
) == VAR_DECL
1367 && TREE_PUBLIC (var_decl
)
1368 && !have_global_bss_p ())
1369 DECL_COMMON (var_decl
) = 1;
1371 /* If it's public and not external, always allocate storage for it.
1372 At the global binding level we need to allocate static storage for the
1373 variable if and only if it's not external. If we are not at the top level
1374 we allocate automatic storage unless requested not to. */
1375 TREE_STATIC (var_decl
)
1376 = !extern_flag
&& (public_flag
|| static_flag
|| global_bindings_p ());
1378 /* For an external constant whose initializer is not absolute, do not emit
1379 debug info. In DWARF this would mean a global relocation in a read-only
1380 section which runs afoul of the PE-COFF run-time relocation mechanism. */
1383 && initializer_constant_valid_p (var_init
, TREE_TYPE (var_init
))
1384 != null_pointer_node
)
1385 DECL_IGNORED_P (var_decl
) = 1;
1387 /* Add this decl to the current binding level. */
1388 gnat_pushdecl (var_decl
, gnat_node
);
1390 if (TREE_SIDE_EFFECTS (var_decl
))
1391 TREE_ADDRESSABLE (var_decl
) = 1;
1393 if (TREE_CODE (var_decl
) == VAR_DECL
)
1396 SET_DECL_ASSEMBLER_NAME (var_decl
, asm_name
);
1397 process_attributes (var_decl
, attr_list
);
1398 if (global_bindings_p ())
1399 rest_of_decl_compilation (var_decl
, true, 0);
1402 expand_decl (var_decl
);
1407 /* Return true if TYPE, an aggregate type, contains (or is) an array. */
1410 aggregate_type_contains_array_p (tree type
)
1412 switch (TREE_CODE (type
))
1416 case QUAL_UNION_TYPE
:
1419 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
1420 if (AGGREGATE_TYPE_P (TREE_TYPE (field
))
1421 && aggregate_type_contains_array_p (TREE_TYPE (field
)))
1434 /* Return a FIELD_DECL node. FIELD_NAME is the field's name, FIELD_TYPE is
1435 its type and RECORD_TYPE is the type of the enclosing record. If SIZE is
1436 nonzero, it is the specified size of the field. If POS is nonzero, it is
1437 the bit position. PACKED is 1 if the enclosing record is packed, -1 if it
1438 has Component_Alignment of Storage_Unit. If ADDRESSABLE is nonzero, it
1439 means we are allowed to take the address of the field; if it is negative,
1440 we should not make a bitfield, which is used by make_aligning_type. */
1443 create_field_decl (tree field_name
, tree field_type
, tree record_type
,
1444 tree size
, tree pos
, int packed
, int addressable
)
1446 tree field_decl
= build_decl (input_location
,
1447 FIELD_DECL
, field_name
, field_type
);
1449 DECL_CONTEXT (field_decl
) = record_type
;
1450 TREE_READONLY (field_decl
) = TYPE_READONLY (field_type
);
1452 /* If FIELD_TYPE is BLKmode, we must ensure this is aligned to at least a
1453 byte boundary since GCC cannot handle less-aligned BLKmode bitfields.
1454 Likewise for an aggregate without specified position that contains an
1455 array, because in this case slices of variable length of this array
1456 must be handled by GCC and variable-sized objects need to be aligned
1457 to at least a byte boundary. */
1458 if (packed
&& (TYPE_MODE (field_type
) == BLKmode
1460 && AGGREGATE_TYPE_P (field_type
)
1461 && aggregate_type_contains_array_p (field_type
))))
1462 DECL_ALIGN (field_decl
) = BITS_PER_UNIT
;
1464 /* If a size is specified, use it. Otherwise, if the record type is packed
1465 compute a size to use, which may differ from the object's natural size.
1466 We always set a size in this case to trigger the checks for bitfield
1467 creation below, which is typically required when no position has been
1470 size
= convert (bitsizetype
, size
);
1471 else if (packed
== 1)
1473 size
= rm_size (field_type
);
1474 if (TYPE_MODE (field_type
) == BLKmode
)
1475 size
= round_up (size
, BITS_PER_UNIT
);
1478 /* If we may, according to ADDRESSABLE, make a bitfield if a size is
1479 specified for two reasons: first if the size differs from the natural
1480 size. Second, if the alignment is insufficient. There are a number of
1481 ways the latter can be true.
1483 We never make a bitfield if the type of the field has a nonconstant size,
1484 because no such entity requiring bitfield operations should reach here.
1486 We do *preventively* make a bitfield when there might be the need for it
1487 but we don't have all the necessary information to decide, as is the case
1488 of a field with no specified position in a packed record.
1490 We also don't look at STRICT_ALIGNMENT here, and rely on later processing
1491 in layout_decl or finish_record_type to clear the bit_field indication if
1492 it is in fact not needed. */
1493 if (addressable
>= 0
1495 && TREE_CODE (size
) == INTEGER_CST
1496 && TREE_CODE (TYPE_SIZE (field_type
)) == INTEGER_CST
1497 && (!tree_int_cst_equal (size
, TYPE_SIZE (field_type
))
1498 || (pos
&& !value_factor_p (pos
, TYPE_ALIGN (field_type
)))
1500 || (TYPE_ALIGN (record_type
) != 0
1501 && TYPE_ALIGN (record_type
) < TYPE_ALIGN (field_type
))))
1503 DECL_BIT_FIELD (field_decl
) = 1;
1504 DECL_SIZE (field_decl
) = size
;
1505 if (!packed
&& !pos
)
1507 if (TYPE_ALIGN (record_type
) != 0
1508 && TYPE_ALIGN (record_type
) < TYPE_ALIGN (field_type
))
1509 DECL_ALIGN (field_decl
) = TYPE_ALIGN (record_type
);
1511 DECL_ALIGN (field_decl
) = TYPE_ALIGN (field_type
);
1515 DECL_PACKED (field_decl
) = pos
? DECL_BIT_FIELD (field_decl
) : packed
;
1517 /* Bump the alignment if need be, either for bitfield/packing purposes or
1518 to satisfy the type requirements if no such consideration applies. When
1519 we get the alignment from the type, indicate if this is from an explicit
1520 user request, which prevents stor-layout from lowering it later on. */
1522 unsigned int bit_align
1523 = (DECL_BIT_FIELD (field_decl
) ? 1
1524 : packed
&& TYPE_MODE (field_type
) != BLKmode
? BITS_PER_UNIT
: 0);
1526 if (bit_align
> DECL_ALIGN (field_decl
))
1527 DECL_ALIGN (field_decl
) = bit_align
;
1528 else if (!bit_align
&& TYPE_ALIGN (field_type
) > DECL_ALIGN (field_decl
))
1530 DECL_ALIGN (field_decl
) = TYPE_ALIGN (field_type
);
1531 DECL_USER_ALIGN (field_decl
) = TYPE_USER_ALIGN (field_type
);
1537 /* We need to pass in the alignment the DECL is known to have.
1538 This is the lowest-order bit set in POS, but no more than
1539 the alignment of the record, if one is specified. Note
1540 that an alignment of 0 is taken as infinite. */
1541 unsigned int known_align
;
1543 if (host_integerp (pos
, 1))
1544 known_align
= tree_low_cst (pos
, 1) & - tree_low_cst (pos
, 1);
1546 known_align
= BITS_PER_UNIT
;
1548 if (TYPE_ALIGN (record_type
)
1549 && (known_align
== 0 || known_align
> TYPE_ALIGN (record_type
)))
1550 known_align
= TYPE_ALIGN (record_type
);
1552 layout_decl (field_decl
, known_align
);
1553 SET_DECL_OFFSET_ALIGN (field_decl
,
1554 host_integerp (pos
, 1) ? BIGGEST_ALIGNMENT
1556 pos_from_bit (&DECL_FIELD_OFFSET (field_decl
),
1557 &DECL_FIELD_BIT_OFFSET (field_decl
),
1558 DECL_OFFSET_ALIGN (field_decl
), pos
);
1561 /* In addition to what our caller says, claim the field is addressable if we
1562 know that its type is not suitable.
1564 The field may also be "technically" nonaddressable, meaning that even if
1565 we attempt to take the field's address we will actually get the address
1566 of a copy. This is the case for true bitfields, but the DECL_BIT_FIELD
1567 value we have at this point is not accurate enough, so we don't account
1568 for this here and let finish_record_type decide. */
1569 if (!addressable
&& !type_for_nonaliased_component_p (field_type
))
1572 DECL_NONADDRESSABLE_P (field_decl
) = !addressable
;
1577 /* Return a PARM_DECL node. PARAM_NAME is the name of the parameter and
1578 PARAM_TYPE is its type. READONLY is true if the parameter is readonly
1579 (either an In parameter or an address of a pass-by-ref parameter). */
1582 create_param_decl (tree param_name
, tree param_type
, bool readonly
)
1584 tree param_decl
= build_decl (input_location
,
1585 PARM_DECL
, param_name
, param_type
);
1587 /* Honor TARGET_PROMOTE_PROTOTYPES like the C compiler, as not doing so
1588 can lead to various ABI violations. */
1589 if (targetm
.calls
.promote_prototypes (NULL_TREE
)
1590 && INTEGRAL_TYPE_P (param_type
)
1591 && TYPE_PRECISION (param_type
) < TYPE_PRECISION (integer_type_node
))
1593 /* We have to be careful about biased types here. Make a subtype
1594 of integer_type_node with the proper biasing. */
1595 if (TREE_CODE (param_type
) == INTEGER_TYPE
1596 && TYPE_BIASED_REPRESENTATION_P (param_type
))
1599 = make_unsigned_type (TYPE_PRECISION (integer_type_node
));
1600 TREE_TYPE (subtype
) = integer_type_node
;
1601 TYPE_BIASED_REPRESENTATION_P (subtype
) = 1;
1602 SET_TYPE_RM_MIN_VALUE (subtype
, TYPE_MIN_VALUE (param_type
));
1603 SET_TYPE_RM_MAX_VALUE (subtype
, TYPE_MAX_VALUE (param_type
));
1604 param_type
= subtype
;
1607 param_type
= integer_type_node
;
1610 DECL_ARG_TYPE (param_decl
) = param_type
;
1611 TREE_READONLY (param_decl
) = readonly
;
1615 /* Given a DECL and ATTR_LIST, process the listed attributes. */
1618 process_attributes (tree decl
, struct attrib
*attr_list
)
1620 for (; attr_list
; attr_list
= attr_list
->next
)
1621 switch (attr_list
->type
)
1623 case ATTR_MACHINE_ATTRIBUTE
:
1624 input_location
= DECL_SOURCE_LOCATION (decl
);
1625 decl_attributes (&decl
, tree_cons (attr_list
->name
, attr_list
->args
,
1627 ATTR_FLAG_TYPE_IN_PLACE
);
1630 case ATTR_LINK_ALIAS
:
1631 if (! DECL_EXTERNAL (decl
))
1633 TREE_STATIC (decl
) = 1;
1634 assemble_alias (decl
, attr_list
->name
);
1638 case ATTR_WEAK_EXTERNAL
:
1640 declare_weak (decl
);
1642 post_error ("?weak declarations not supported on this target",
1643 attr_list
->error_point
);
1646 case ATTR_LINK_SECTION
:
1647 if (targetm
.have_named_sections
)
1649 DECL_SECTION_NAME (decl
)
1650 = build_string (IDENTIFIER_LENGTH (attr_list
->name
),
1651 IDENTIFIER_POINTER (attr_list
->name
));
1652 DECL_COMMON (decl
) = 0;
1655 post_error ("?section attributes are not supported for this target",
1656 attr_list
->error_point
);
1659 case ATTR_LINK_CONSTRUCTOR
:
1660 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
1661 TREE_USED (decl
) = 1;
1664 case ATTR_LINK_DESTRUCTOR
:
1665 DECL_STATIC_DESTRUCTOR (decl
) = 1;
1666 TREE_USED (decl
) = 1;
1669 case ATTR_THREAD_LOCAL_STORAGE
:
1670 DECL_TLS_MODEL (decl
) = decl_default_tls_model (decl
);
1671 DECL_COMMON (decl
) = 0;
1676 /* Record DECL as a global renaming pointer. */
1679 record_global_renaming_pointer (tree decl
)
1681 gcc_assert (DECL_RENAMED_OBJECT (decl
));
1682 VEC_safe_push (tree
, gc
, global_renaming_pointers
, decl
);
1685 /* Invalidate the global renaming pointers. */
1688 invalidate_global_renaming_pointers (void)
1693 FOR_EACH_VEC_ELT (tree
, global_renaming_pointers
, i
, iter
)
1694 SET_DECL_RENAMED_OBJECT (iter
, NULL_TREE
);
1696 VEC_free (tree
, gc
, global_renaming_pointers
);
1699 /* Return true if VALUE is a known to be a multiple of FACTOR, which must be
1703 value_factor_p (tree value
, HOST_WIDE_INT factor
)
1705 if (host_integerp (value
, 1))
1706 return tree_low_cst (value
, 1) % factor
== 0;
1708 if (TREE_CODE (value
) == MULT_EXPR
)
1709 return (value_factor_p (TREE_OPERAND (value
, 0), factor
)
1710 || value_factor_p (TREE_OPERAND (value
, 1), factor
));
1715 /* Given 2 consecutive field decls PREV_FIELD and CURR_FIELD, return true
1716 unless we can prove these 2 fields are laid out in such a way that no gap
1717 exist between the end of PREV_FIELD and the beginning of CURR_FIELD. OFFSET
1718 is the distance in bits between the end of PREV_FIELD and the starting
1719 position of CURR_FIELD. It is ignored if null. */
1722 potential_alignment_gap (tree prev_field
, tree curr_field
, tree offset
)
1724 /* If this is the first field of the record, there cannot be any gap */
1728 /* If the previous field is a union type, then return False: The only
1729 time when such a field is not the last field of the record is when
1730 there are other components at fixed positions after it (meaning there
1731 was a rep clause for every field), in which case we don't want the
1732 alignment constraint to override them. */
1733 if (TREE_CODE (TREE_TYPE (prev_field
)) == QUAL_UNION_TYPE
)
1736 /* If the distance between the end of prev_field and the beginning of
1737 curr_field is constant, then there is a gap if the value of this
1738 constant is not null. */
1739 if (offset
&& host_integerp (offset
, 1))
1740 return !integer_zerop (offset
);
1742 /* If the size and position of the previous field are constant,
1743 then check the sum of this size and position. There will be a gap
1744 iff it is not multiple of the current field alignment. */
1745 if (host_integerp (DECL_SIZE (prev_field
), 1)
1746 && host_integerp (bit_position (prev_field
), 1))
1747 return ((tree_low_cst (bit_position (prev_field
), 1)
1748 + tree_low_cst (DECL_SIZE (prev_field
), 1))
1749 % DECL_ALIGN (curr_field
) != 0);
1751 /* If both the position and size of the previous field are multiples
1752 of the current field alignment, there cannot be any gap. */
1753 if (value_factor_p (bit_position (prev_field
), DECL_ALIGN (curr_field
))
1754 && value_factor_p (DECL_SIZE (prev_field
), DECL_ALIGN (curr_field
)))
1757 /* Fallback, return that there may be a potential gap */
1761 /* Returns a LABEL_DECL node for LABEL_NAME. */
1764 create_label_decl (tree label_name
)
1766 tree label_decl
= build_decl (input_location
,
1767 LABEL_DECL
, label_name
, void_type_node
);
1769 DECL_CONTEXT (label_decl
) = current_function_decl
;
1770 DECL_MODE (label_decl
) = VOIDmode
;
1771 DECL_SOURCE_LOCATION (label_decl
) = input_location
;
1776 /* Returns a FUNCTION_DECL node. SUBPROG_NAME is the name of the subprogram,
1777 ASM_NAME is its assembler name, SUBPROG_TYPE is its type (a FUNCTION_TYPE
1778 node), PARAM_DECL_LIST is the list of the subprogram arguments (a list of
1779 PARM_DECL nodes chained through the TREE_CHAIN field).
1781 INLINE_FLAG, PUBLIC_FLAG, EXTERN_FLAG, and ATTR_LIST are used to set the
1782 appropriate fields in the FUNCTION_DECL. GNAT_NODE gives the location. */
1785 create_subprog_decl (tree subprog_name
, tree asm_name
,
1786 tree subprog_type
, tree param_decl_list
, bool inline_flag
,
1787 bool public_flag
, bool extern_flag
,
1788 struct attrib
*attr_list
, Node_Id gnat_node
)
1790 tree subprog_decl
= build_decl (input_location
, FUNCTION_DECL
, subprog_name
,
1792 tree result_decl
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
1793 TREE_TYPE (subprog_type
));
1795 /* If this is a non-inline function nested inside an inlined external
1796 function, we cannot honor both requests without cloning the nested
1797 function in the current unit since it is private to the other unit.
1798 We could inline the nested function as well but it's probably better
1799 to err on the side of too little inlining. */
1801 && current_function_decl
1802 && DECL_DECLARED_INLINE_P (current_function_decl
)
1803 && DECL_EXTERNAL (current_function_decl
))
1804 DECL_DECLARED_INLINE_P (current_function_decl
) = 0;
1806 DECL_EXTERNAL (subprog_decl
) = extern_flag
;
1807 TREE_PUBLIC (subprog_decl
) = public_flag
;
1808 TREE_STATIC (subprog_decl
) = 1;
1809 TREE_READONLY (subprog_decl
) = TYPE_READONLY (subprog_type
);
1810 TREE_THIS_VOLATILE (subprog_decl
) = TYPE_VOLATILE (subprog_type
);
1811 TREE_SIDE_EFFECTS (subprog_decl
) = TYPE_VOLATILE (subprog_type
);
1812 DECL_DECLARED_INLINE_P (subprog_decl
) = inline_flag
;
1813 DECL_ARGUMENTS (subprog_decl
) = param_decl_list
;
1815 DECL_ARTIFICIAL (result_decl
) = 1;
1816 DECL_IGNORED_P (result_decl
) = 1;
1817 DECL_BY_REFERENCE (result_decl
) = TREE_ADDRESSABLE (subprog_type
);
1818 DECL_RESULT (subprog_decl
) = result_decl
;
1822 SET_DECL_ASSEMBLER_NAME (subprog_decl
, asm_name
);
1824 /* The expand_main_function circuitry expects "main_identifier_node" to
1825 designate the DECL_NAME of the 'main' entry point, in turn expected
1826 to be declared as the "main" function literally by default. Ada
1827 program entry points are typically declared with a different name
1828 within the binder generated file, exported as 'main' to satisfy the
1829 system expectations. Force main_identifier_node in this case. */
1830 if (asm_name
== main_identifier_node
)
1831 DECL_NAME (subprog_decl
) = main_identifier_node
;
1834 /* Add this decl to the current binding level. */
1835 gnat_pushdecl (subprog_decl
, gnat_node
);
1837 process_attributes (subprog_decl
, attr_list
);
1839 /* Output the assembler code and/or RTL for the declaration. */
1840 rest_of_decl_compilation (subprog_decl
, global_bindings_p (), 0);
1842 return subprog_decl
;
1845 /* Set up the framework for generating code for SUBPROG_DECL, a subprogram
1846 body. This routine needs to be invoked before processing the declarations
1847 appearing in the subprogram. */
1850 begin_subprog_body (tree subprog_decl
)
1854 announce_function (subprog_decl
);
1856 current_function_decl
= subprog_decl
;
1858 /* Enter a new binding level and show that all the parameters belong to
1862 for (param_decl
= DECL_ARGUMENTS (subprog_decl
); param_decl
;
1863 param_decl
= DECL_CHAIN (param_decl
))
1864 DECL_CONTEXT (param_decl
) = subprog_decl
;
1866 make_decl_rtl (subprog_decl
);
1868 /* We handle pending sizes via the elaboration of types, so we don't need to
1869 save them. This causes them to be marked as part of the outer function
1870 and then discarded. */
1871 get_pending_sizes ();
1874 /* Finish the definition of the current subprogram BODY and finalize it. */
1877 end_subprog_body (tree body
)
1879 tree fndecl
= current_function_decl
;
1881 /* Mark the BLOCK for this level as being for this function and pop the
1882 level. Since the vars in it are the parameters, clear them. */
1883 BLOCK_VARS (current_binding_level
->block
) = NULL_TREE
;
1884 BLOCK_SUPERCONTEXT (current_binding_level
->block
) = fndecl
;
1885 DECL_INITIAL (fndecl
) = current_binding_level
->block
;
1888 /* We handle pending sizes via the elaboration of types, so we don't
1889 need to save them. */
1890 get_pending_sizes ();
1892 /* Mark the RESULT_DECL as being in this subprogram. */
1893 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
1895 DECL_SAVED_TREE (fndecl
) = body
;
1897 current_function_decl
= DECL_CONTEXT (fndecl
);
1899 /* We cannot track the location of errors past this point. */
1900 error_gnat_node
= Empty
;
1902 /* If we're only annotating types, don't actually compile this function. */
1903 if (type_annotate_only
)
1906 /* Dump functions before gimplification. */
1907 dump_function (TDI_original
, fndecl
);
1909 /* ??? This special handling of nested functions is probably obsolete. */
1910 if (!DECL_CONTEXT (fndecl
))
1911 cgraph_finalize_function (fndecl
, false);
1913 /* Register this function with cgraph just far enough to get it
1914 added to our parent's nested function list. */
1915 (void) cgraph_node (fndecl
);
1919 gnat_builtin_function (tree decl
)
1921 gnat_pushdecl (decl
, Empty
);
1925 /* Return an integer type with the number of bits of precision given by
1926 PRECISION. UNSIGNEDP is nonzero if the type is unsigned; otherwise
1927 it is a signed type. */
1930 gnat_type_for_size (unsigned precision
, int unsignedp
)
1935 if (precision
<= 2 * MAX_BITS_PER_WORD
1936 && signed_and_unsigned_types
[precision
][unsignedp
])
1937 return signed_and_unsigned_types
[precision
][unsignedp
];
1940 t
= make_unsigned_type (precision
);
1942 t
= make_signed_type (precision
);
1944 if (precision
<= 2 * MAX_BITS_PER_WORD
)
1945 signed_and_unsigned_types
[precision
][unsignedp
] = t
;
1949 sprintf (type_name
, "%sSIGNED_%d", unsignedp
? "UN" : "", precision
);
1950 TYPE_NAME (t
) = get_identifier (type_name
);
1956 /* Likewise for floating-point types. */
1959 float_type_for_precision (int precision
, enum machine_mode mode
)
1964 if (float_types
[(int) mode
])
1965 return float_types
[(int) mode
];
1967 float_types
[(int) mode
] = t
= make_node (REAL_TYPE
);
1968 TYPE_PRECISION (t
) = precision
;
1971 gcc_assert (TYPE_MODE (t
) == mode
);
1974 sprintf (type_name
, "FLOAT_%d", precision
);
1975 TYPE_NAME (t
) = get_identifier (type_name
);
1981 /* Return a data type that has machine mode MODE. UNSIGNEDP selects
1982 an unsigned type; otherwise a signed type is returned. */
1985 gnat_type_for_mode (enum machine_mode mode
, int unsignedp
)
1987 if (mode
== BLKmode
)
1990 if (mode
== VOIDmode
)
1991 return void_type_node
;
1993 if (COMPLEX_MODE_P (mode
))
1996 if (SCALAR_FLOAT_MODE_P (mode
))
1997 return float_type_for_precision (GET_MODE_PRECISION (mode
), mode
);
1999 if (SCALAR_INT_MODE_P (mode
))
2000 return gnat_type_for_size (GET_MODE_BITSIZE (mode
), unsignedp
);
2002 if (VECTOR_MODE_P (mode
))
2004 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2005 tree inner_type
= gnat_type_for_mode (inner_mode
, unsignedp
);
2007 return build_vector_type_for_mode (inner_type
, mode
);
2013 /* Return the unsigned version of a TYPE_NODE, a scalar type. */
2016 gnat_unsigned_type (tree type_node
)
2018 tree type
= gnat_type_for_size (TYPE_PRECISION (type_node
), 1);
2020 if (TREE_CODE (type_node
) == INTEGER_TYPE
&& TYPE_MODULAR_P (type_node
))
2022 type
= copy_node (type
);
2023 TREE_TYPE (type
) = type_node
;
2025 else if (TREE_TYPE (type_node
)
2026 && TREE_CODE (TREE_TYPE (type_node
)) == INTEGER_TYPE
2027 && TYPE_MODULAR_P (TREE_TYPE (type_node
)))
2029 type
= copy_node (type
);
2030 TREE_TYPE (type
) = TREE_TYPE (type_node
);
2036 /* Return the signed version of a TYPE_NODE, a scalar type. */
2039 gnat_signed_type (tree type_node
)
2041 tree type
= gnat_type_for_size (TYPE_PRECISION (type_node
), 0);
2043 if (TREE_CODE (type_node
) == INTEGER_TYPE
&& TYPE_MODULAR_P (type_node
))
2045 type
= copy_node (type
);
2046 TREE_TYPE (type
) = type_node
;
2048 else if (TREE_TYPE (type_node
)
2049 && TREE_CODE (TREE_TYPE (type_node
)) == INTEGER_TYPE
2050 && TYPE_MODULAR_P (TREE_TYPE (type_node
)))
2052 type
= copy_node (type
);
2053 TREE_TYPE (type
) = TREE_TYPE (type_node
);
2059 /* Return 1 if the types T1 and T2 are compatible, i.e. if they can be
2060 transparently converted to each other. */
2063 gnat_types_compatible_p (tree t1
, tree t2
)
2065 enum tree_code code
;
2067 /* This is the default criterion. */
2068 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
2071 /* We only check structural equivalence here. */
2072 if ((code
= TREE_CODE (t1
)) != TREE_CODE (t2
))
2075 /* Vector types are also compatible if they have the same number of subparts
2076 and the same form of (scalar) element type. */
2077 if (code
== VECTOR_TYPE
2078 && TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
2079 && TREE_CODE (TREE_TYPE (t1
)) == TREE_CODE (TREE_TYPE (t2
))
2080 && TYPE_PRECISION (TREE_TYPE (t1
)) == TYPE_PRECISION (TREE_TYPE (t2
)))
2083 /* Array types are also compatible if they are constrained and have the same
2084 domain(s) and the same component type. */
2085 if (code
== ARRAY_TYPE
2086 && (TYPE_DOMAIN (t1
) == TYPE_DOMAIN (t2
)
2087 || (TYPE_DOMAIN (t1
)
2089 && tree_int_cst_equal (TYPE_MIN_VALUE (TYPE_DOMAIN (t1
)),
2090 TYPE_MIN_VALUE (TYPE_DOMAIN (t2
)))
2091 && tree_int_cst_equal (TYPE_MAX_VALUE (TYPE_DOMAIN (t1
)),
2092 TYPE_MAX_VALUE (TYPE_DOMAIN (t2
)))))
2093 && (TREE_TYPE (t1
) == TREE_TYPE (t2
)
2094 || (TREE_CODE (TREE_TYPE (t1
)) == ARRAY_TYPE
2095 && gnat_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))))
2098 /* Padding record types are also compatible if they pad the same
2099 type and have the same constant size. */
2100 if (code
== RECORD_TYPE
2101 && TYPE_PADDING_P (t1
) && TYPE_PADDING_P (t2
)
2102 && TREE_TYPE (TYPE_FIELDS (t1
)) == TREE_TYPE (TYPE_FIELDS (t2
))
2103 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2109 /* EXP is an expression for the size of an object. If this size contains
2110 discriminant references, replace them with the maximum (if MAX_P) or
2111 minimum (if !MAX_P) possible value of the discriminant. */
2114 max_size (tree exp
, bool max_p
)
2116 enum tree_code code
= TREE_CODE (exp
);
2117 tree type
= TREE_TYPE (exp
);
2119 switch (TREE_CODE_CLASS (code
))
2121 case tcc_declaration
:
2126 if (code
== CALL_EXPR
)
2131 t
= maybe_inline_call_in_expr (exp
);
2133 return max_size (t
, max_p
);
2135 n
= call_expr_nargs (exp
);
2137 argarray
= XALLOCAVEC (tree
, n
);
2138 for (i
= 0; i
< n
; i
++)
2139 argarray
[i
] = max_size (CALL_EXPR_ARG (exp
, i
), max_p
);
2140 return build_call_array (type
, CALL_EXPR_FN (exp
), n
, argarray
);
2145 /* If this contains a PLACEHOLDER_EXPR, it is the thing we want to
2146 modify. Otherwise, we treat it like a variable. */
2147 if (!CONTAINS_PLACEHOLDER_P (exp
))
2150 type
= TREE_TYPE (TREE_OPERAND (exp
, 1));
2152 max_size (max_p
? TYPE_MAX_VALUE (type
) : TYPE_MIN_VALUE (type
), true);
2154 case tcc_comparison
:
2155 return max_p
? size_one_node
: size_zero_node
;
2159 case tcc_expression
:
2160 switch (TREE_CODE_LENGTH (code
))
2163 if (code
== NON_LVALUE_EXPR
)
2164 return max_size (TREE_OPERAND (exp
, 0), max_p
);
2167 fold_build1 (code
, type
,
2168 max_size (TREE_OPERAND (exp
, 0),
2169 code
== NEGATE_EXPR
? !max_p
: max_p
));
2172 if (code
== COMPOUND_EXPR
)
2173 return max_size (TREE_OPERAND (exp
, 1), max_p
);
2176 tree lhs
= max_size (TREE_OPERAND (exp
, 0), max_p
);
2177 tree rhs
= max_size (TREE_OPERAND (exp
, 1),
2178 code
== MINUS_EXPR
? !max_p
: max_p
);
2180 /* Special-case wanting the maximum value of a MIN_EXPR.
2181 In that case, if one side overflows, return the other.
2182 sizetype is signed, but we know sizes are non-negative.
2183 Likewise, handle a MINUS_EXPR or PLUS_EXPR with the LHS
2184 overflowing and the RHS a variable. */
2187 && TREE_CODE (rhs
) == INTEGER_CST
2188 && TREE_OVERFLOW (rhs
))
2192 && TREE_CODE (lhs
) == INTEGER_CST
2193 && TREE_OVERFLOW (lhs
))
2195 else if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
)
2196 && TREE_CODE (lhs
) == INTEGER_CST
2197 && TREE_OVERFLOW (lhs
)
2198 && !TREE_CONSTANT (rhs
))
2201 return fold_build2 (code
, type
, lhs
, rhs
);
2205 if (code
== SAVE_EXPR
)
2207 else if (code
== COND_EXPR
)
2208 return fold_build2 (max_p
? MAX_EXPR
: MIN_EXPR
, type
,
2209 max_size (TREE_OPERAND (exp
, 1), max_p
),
2210 max_size (TREE_OPERAND (exp
, 2), max_p
));
2213 /* Other tree classes cannot happen. */
2221 /* Build a template of type TEMPLATE_TYPE from the array bounds of ARRAY_TYPE.
2222 EXPR is an expression that we can use to locate any PLACEHOLDER_EXPRs.
2223 Return a constructor for the template. */
2226 build_template (tree template_type
, tree array_type
, tree expr
)
2228 VEC(constructor_elt
,gc
) *template_elts
= NULL
;
2229 tree bound_list
= NULL_TREE
;
2232 while (TREE_CODE (array_type
) == RECORD_TYPE
2233 && (TYPE_PADDING_P (array_type
)
2234 || TYPE_JUSTIFIED_MODULAR_P (array_type
)))
2235 array_type
= TREE_TYPE (TYPE_FIELDS (array_type
));
2237 if (TREE_CODE (array_type
) == ARRAY_TYPE
2238 || (TREE_CODE (array_type
) == INTEGER_TYPE
2239 && TYPE_HAS_ACTUAL_BOUNDS_P (array_type
)))
2240 bound_list
= TYPE_ACTUAL_BOUNDS (array_type
);
2242 /* First make the list for a CONSTRUCTOR for the template. Go down the
2243 field list of the template instead of the type chain because this
2244 array might be an Ada array of arrays and we can't tell where the
2245 nested arrays stop being the underlying object. */
2247 for (field
= TYPE_FIELDS (template_type
); field
;
2249 ? (bound_list
= TREE_CHAIN (bound_list
))
2250 : (array_type
= TREE_TYPE (array_type
))),
2251 field
= DECL_CHAIN (DECL_CHAIN (field
)))
2253 tree bounds
, min
, max
;
2255 /* If we have a bound list, get the bounds from there. Likewise
2256 for an ARRAY_TYPE. Otherwise, if expr is a PARM_DECL with
2257 DECL_BY_COMPONENT_PTR_P, use the bounds of the field in the template.
2258 This will give us a maximum range. */
2260 bounds
= TREE_VALUE (bound_list
);
2261 else if (TREE_CODE (array_type
) == ARRAY_TYPE
)
2262 bounds
= TYPE_INDEX_TYPE (TYPE_DOMAIN (array_type
));
2263 else if (expr
&& TREE_CODE (expr
) == PARM_DECL
2264 && DECL_BY_COMPONENT_PTR_P (expr
))
2265 bounds
= TREE_TYPE (field
);
2269 min
= convert (TREE_TYPE (field
), TYPE_MIN_VALUE (bounds
));
2270 max
= convert (TREE_TYPE (DECL_CHAIN (field
)), TYPE_MAX_VALUE (bounds
));
2272 /* If either MIN or MAX involve a PLACEHOLDER_EXPR, we must
2273 substitute it from OBJECT. */
2274 min
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (min
, expr
);
2275 max
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (max
, expr
);
2277 CONSTRUCTOR_APPEND_ELT (template_elts
, field
, min
);
2278 CONSTRUCTOR_APPEND_ELT (template_elts
, DECL_CHAIN (field
), max
);
2281 return gnat_build_constructor (template_type
, template_elts
);
2284 /* Build a 32-bit VMS descriptor from a Mechanism_Type, which must specify a
2285 descriptor type, and the GCC type of an object. Each FIELD_DECL in the
2286 type contains in its DECL_INITIAL the expression to use when a constructor
2287 is made for the type. GNAT_ENTITY is an entity used to print out an error
2288 message if the mechanism cannot be applied to an object of that type and
2289 also for the name. */
2292 build_vms_descriptor32 (tree type
, Mechanism_Type mech
, Entity_Id gnat_entity
)
2294 tree record_type
= make_node (RECORD_TYPE
);
2295 tree pointer32_type
;
2296 tree field_list
= NULL_TREE
;
2305 /* If TYPE is an unconstrained array, use the underlying array type. */
2306 if (TREE_CODE (type
) == UNCONSTRAINED_ARRAY_TYPE
)
2307 type
= TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (type
))));
2309 /* If this is an array, compute the number of dimensions in the array,
2310 get the index types, and point to the inner type. */
2311 if (TREE_CODE (type
) != ARRAY_TYPE
)
2314 for (ndim
= 1, inner_type
= type
;
2315 TREE_CODE (TREE_TYPE (inner_type
)) == ARRAY_TYPE
2316 && TYPE_MULTI_ARRAY_P (TREE_TYPE (inner_type
));
2317 ndim
++, inner_type
= TREE_TYPE (inner_type
))
2320 idx_arr
= XALLOCAVEC (tree
, ndim
);
2322 if (mech
!= By_Descriptor_NCA
&& mech
!= By_Short_Descriptor_NCA
2323 && TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_CONVENTION_FORTRAN_P (type
))
2324 for (i
= ndim
- 1, inner_type
= type
;
2326 i
--, inner_type
= TREE_TYPE (inner_type
))
2327 idx_arr
[i
] = TYPE_DOMAIN (inner_type
);
2329 for (i
= 0, inner_type
= type
;
2331 i
++, inner_type
= TREE_TYPE (inner_type
))
2332 idx_arr
[i
] = TYPE_DOMAIN (inner_type
);
2334 /* Now get the DTYPE value. */
2335 switch (TREE_CODE (type
))
2340 if (TYPE_VAX_FLOATING_POINT_P (type
))
2341 switch (tree_low_cst (TYPE_DIGITS_VALUE (type
), 1))
2354 switch (GET_MODE_BITSIZE (TYPE_MODE (type
)))
2357 dtype
= TYPE_UNSIGNED (type
) ? 2 : 6;
2360 dtype
= TYPE_UNSIGNED (type
) ? 3 : 7;
2363 dtype
= TYPE_UNSIGNED (type
) ? 4 : 8;
2366 dtype
= TYPE_UNSIGNED (type
) ? 5 : 9;
2369 dtype
= TYPE_UNSIGNED (type
) ? 25 : 26;
2375 dtype
= GET_MODE_BITSIZE (TYPE_MODE (type
)) == 32 ? 52 : 53;
2379 if (TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
2380 && TYPE_VAX_FLOATING_POINT_P (type
))
2381 switch (tree_low_cst (TYPE_DIGITS_VALUE (type
), 1))
2393 dtype
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))) == 32 ? 54: 55;
2404 /* Get the CLASS value. */
2407 case By_Descriptor_A
:
2408 case By_Short_Descriptor_A
:
2411 case By_Descriptor_NCA
:
2412 case By_Short_Descriptor_NCA
:
2415 case By_Descriptor_SB
:
2416 case By_Short_Descriptor_SB
:
2420 case By_Short_Descriptor
:
2421 case By_Descriptor_S
:
2422 case By_Short_Descriptor_S
:
2428 /* Make the type for a descriptor for VMS. The first four fields are the
2429 same for all types. */
2431 = make_descriptor_field ("LENGTH", gnat_type_for_size (16, 1), record_type
,
2432 size_in_bytes ((mech
== By_Descriptor_A
2433 || mech
== By_Short_Descriptor_A
)
2434 ? inner_type
: type
),
2437 = make_descriptor_field ("DTYPE", gnat_type_for_size (8, 1), record_type
,
2438 size_int (dtype
), field_list
);
2440 = make_descriptor_field ("CLASS", gnat_type_for_size (8, 1), record_type
,
2441 size_int (klass
), field_list
);
2443 /* Of course this will crash at run time if the address space is not
2444 within the low 32 bits, but there is nothing else we can do. */
2445 pointer32_type
= build_pointer_type_for_mode (type
, SImode
, false);
2448 = make_descriptor_field ("POINTER", pointer32_type
, record_type
,
2449 build_unary_op (ADDR_EXPR
,
2451 build0 (PLACEHOLDER_EXPR
, type
)),
2457 case By_Short_Descriptor
:
2458 case By_Descriptor_S
:
2459 case By_Short_Descriptor_S
:
2462 case By_Descriptor_SB
:
2463 case By_Short_Descriptor_SB
:
2465 = make_descriptor_field ("SB_L1", gnat_type_for_size (32, 1),
2467 (TREE_CODE (type
) == ARRAY_TYPE
2468 ? TYPE_MIN_VALUE (TYPE_DOMAIN (type
))
2472 = make_descriptor_field ("SB_U1", gnat_type_for_size (32, 1),
2474 (TREE_CODE (type
) == ARRAY_TYPE
2475 ? TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
2480 case By_Descriptor_A
:
2481 case By_Short_Descriptor_A
:
2482 case By_Descriptor_NCA
:
2483 case By_Short_Descriptor_NCA
:
2485 = make_descriptor_field ("SCALE", gnat_type_for_size (8, 1),
2486 record_type
, size_zero_node
, field_list
);
2489 = make_descriptor_field ("DIGITS", gnat_type_for_size (8, 1),
2490 record_type
, size_zero_node
, field_list
);
2494 = make_descriptor_field ("AFLAGS", gnat_type_for_size (8, 1),
2496 size_int ((mech
== By_Descriptor_NCA
2497 || mech
== By_Short_Descriptor_NCA
)
2499 /* Set FL_COLUMN, FL_COEFF, and
2501 : (TREE_CODE (type
) == ARRAY_TYPE
2502 && TYPE_CONVENTION_FORTRAN_P
2508 = make_descriptor_field ("DIMCT", gnat_type_for_size (8, 1),
2509 record_type
, size_int (ndim
), field_list
);
2512 = make_descriptor_field ("ARSIZE", gnat_type_for_size (32, 1),
2513 record_type
, size_in_bytes (type
),
2516 /* Now build a pointer to the 0,0,0... element. */
2517 tem
= build0 (PLACEHOLDER_EXPR
, type
);
2518 for (i
= 0, inner_type
= type
; i
< ndim
;
2519 i
++, inner_type
= TREE_TYPE (inner_type
))
2520 tem
= build4 (ARRAY_REF
, TREE_TYPE (inner_type
), tem
,
2521 convert (TYPE_DOMAIN (inner_type
), size_zero_node
),
2522 NULL_TREE
, NULL_TREE
);
2525 = make_descriptor_field ("A0", pointer32_type
, record_type
,
2526 build1 (ADDR_EXPR
, pointer32_type
, tem
),
2529 /* Next come the addressing coefficients. */
2530 tem
= size_one_node
;
2531 for (i
= 0; i
< ndim
; i
++)
2535 = size_binop (MULT_EXPR
, tem
,
2536 size_binop (PLUS_EXPR
,
2537 size_binop (MINUS_EXPR
,
2538 TYPE_MAX_VALUE (idx_arr
[i
]),
2539 TYPE_MIN_VALUE (idx_arr
[i
])),
2542 fname
[0] = ((mech
== By_Descriptor_NCA
||
2543 mech
== By_Short_Descriptor_NCA
) ? 'S' : 'M');
2544 fname
[1] = '0' + i
, fname
[2] = 0;
2546 = make_descriptor_field (fname
, gnat_type_for_size (32, 1),
2547 record_type
, idx_length
, field_list
);
2549 if (mech
== By_Descriptor_NCA
|| mech
== By_Short_Descriptor_NCA
)
2553 /* Finally here are the bounds. */
2554 for (i
= 0; i
< ndim
; i
++)
2558 fname
[0] = 'L', fname
[1] = '0' + i
, fname
[2] = 0;
2560 = make_descriptor_field (fname
, gnat_type_for_size (32, 1),
2561 record_type
, TYPE_MIN_VALUE (idx_arr
[i
]),
2566 = make_descriptor_field (fname
, gnat_type_for_size (32, 1),
2567 record_type
, TYPE_MAX_VALUE (idx_arr
[i
]),
2573 post_error ("unsupported descriptor type for &", gnat_entity
);
2576 TYPE_NAME (record_type
) = create_concat_name (gnat_entity
, "DESC");
2577 finish_record_type (record_type
, nreverse (field_list
), 0, false);
2581 /* Build a 64-bit VMS descriptor from a Mechanism_Type, which must specify a
2582 descriptor type, and the GCC type of an object. Each FIELD_DECL in the
2583 type contains in its DECL_INITIAL the expression to use when a constructor
2584 is made for the type. GNAT_ENTITY is an entity used to print out an error
2585 message if the mechanism cannot be applied to an object of that type and
2586 also for the name. */
2589 build_vms_descriptor (tree type
, Mechanism_Type mech
, Entity_Id gnat_entity
)
2591 tree record64_type
= make_node (RECORD_TYPE
);
2592 tree pointer64_type
;
2593 tree field_list64
= NULL_TREE
;
2602 /* If TYPE is an unconstrained array, use the underlying array type. */
2603 if (TREE_CODE (type
) == UNCONSTRAINED_ARRAY_TYPE
)
2604 type
= TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (type
))));
2606 /* If this is an array, compute the number of dimensions in the array,
2607 get the index types, and point to the inner type. */
2608 if (TREE_CODE (type
) != ARRAY_TYPE
)
2611 for (ndim
= 1, inner_type
= type
;
2612 TREE_CODE (TREE_TYPE (inner_type
)) == ARRAY_TYPE
2613 && TYPE_MULTI_ARRAY_P (TREE_TYPE (inner_type
));
2614 ndim
++, inner_type
= TREE_TYPE (inner_type
))
2617 idx_arr
= XALLOCAVEC (tree
, ndim
);
2619 if (mech
!= By_Descriptor_NCA
2620 && TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_CONVENTION_FORTRAN_P (type
))
2621 for (i
= ndim
- 1, inner_type
= type
;
2623 i
--, inner_type
= TREE_TYPE (inner_type
))
2624 idx_arr
[i
] = TYPE_DOMAIN (inner_type
);
2626 for (i
= 0, inner_type
= type
;
2628 i
++, inner_type
= TREE_TYPE (inner_type
))
2629 idx_arr
[i
] = TYPE_DOMAIN (inner_type
);
2631 /* Now get the DTYPE value. */
2632 switch (TREE_CODE (type
))
2637 if (TYPE_VAX_FLOATING_POINT_P (type
))
2638 switch (tree_low_cst (TYPE_DIGITS_VALUE (type
), 1))
2651 switch (GET_MODE_BITSIZE (TYPE_MODE (type
)))
2654 dtype
= TYPE_UNSIGNED (type
) ? 2 : 6;
2657 dtype
= TYPE_UNSIGNED (type
) ? 3 : 7;
2660 dtype
= TYPE_UNSIGNED (type
) ? 4 : 8;
2663 dtype
= TYPE_UNSIGNED (type
) ? 5 : 9;
2666 dtype
= TYPE_UNSIGNED (type
) ? 25 : 26;
2672 dtype
= GET_MODE_BITSIZE (TYPE_MODE (type
)) == 32 ? 52 : 53;
2676 if (TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
2677 && TYPE_VAX_FLOATING_POINT_P (type
))
2678 switch (tree_low_cst (TYPE_DIGITS_VALUE (type
), 1))
2690 dtype
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))) == 32 ? 54: 55;
2701 /* Get the CLASS value. */
2704 case By_Descriptor_A
:
2707 case By_Descriptor_NCA
:
2710 case By_Descriptor_SB
:
2714 case By_Descriptor_S
:
2720 /* Make the type for a 64-bit descriptor for VMS. The first six fields
2721 are the same for all types. */
2723 = make_descriptor_field ("MBO", gnat_type_for_size (16, 1),
2724 record64_type
, size_int (1), field_list64
);
2726 = make_descriptor_field ("DTYPE", gnat_type_for_size (8, 1),
2727 record64_type
, size_int (dtype
), field_list64
);
2729 = make_descriptor_field ("CLASS", gnat_type_for_size (8, 1),
2730 record64_type
, size_int (klass
), field_list64
);
2732 = make_descriptor_field ("MBMO", gnat_type_for_size (32, 1),
2733 record64_type
, ssize_int (-1), field_list64
);
2735 = make_descriptor_field ("LENGTH", gnat_type_for_size (64, 1),
2737 size_in_bytes (mech
== By_Descriptor_A
2738 ? inner_type
: type
),
2741 pointer64_type
= build_pointer_type_for_mode (type
, DImode
, false);
2744 = make_descriptor_field ("POINTER", pointer64_type
, record64_type
,
2745 build_unary_op (ADDR_EXPR
, pointer64_type
,
2746 build0 (PLACEHOLDER_EXPR
, type
)),
2752 case By_Descriptor_S
:
2755 case By_Descriptor_SB
:
2757 = make_descriptor_field ("SB_L1", gnat_type_for_size (64, 1),
2759 (TREE_CODE (type
) == ARRAY_TYPE
2760 ? TYPE_MIN_VALUE (TYPE_DOMAIN (type
))
2764 = make_descriptor_field ("SB_U1", gnat_type_for_size (64, 1),
2766 (TREE_CODE (type
) == ARRAY_TYPE
2767 ? TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
2772 case By_Descriptor_A
:
2773 case By_Descriptor_NCA
:
2775 = make_descriptor_field ("SCALE", gnat_type_for_size (8, 1),
2776 record64_type
, size_zero_node
, field_list64
);
2779 = make_descriptor_field ("DIGITS", gnat_type_for_size (8, 1),
2780 record64_type
, size_zero_node
, field_list64
);
2782 dtype
= (mech
== By_Descriptor_NCA
2784 /* Set FL_COLUMN, FL_COEFF, and
2786 : (TREE_CODE (type
) == ARRAY_TYPE
2787 && TYPE_CONVENTION_FORTRAN_P (type
)
2790 = make_descriptor_field ("AFLAGS", gnat_type_for_size (8, 1),
2791 record64_type
, size_int (dtype
),
2795 = make_descriptor_field ("DIMCT", gnat_type_for_size (8, 1),
2796 record64_type
, size_int (ndim
), field_list64
);
2799 = make_descriptor_field ("MBZ", gnat_type_for_size (32, 1),
2800 record64_type
, size_int (0), field_list64
);
2802 = make_descriptor_field ("ARSIZE", gnat_type_for_size (64, 1),
2803 record64_type
, size_in_bytes (type
),
2806 /* Now build a pointer to the 0,0,0... element. */
2807 tem
= build0 (PLACEHOLDER_EXPR
, type
);
2808 for (i
= 0, inner_type
= type
; i
< ndim
;
2809 i
++, inner_type
= TREE_TYPE (inner_type
))
2810 tem
= build4 (ARRAY_REF
, TREE_TYPE (inner_type
), tem
,
2811 convert (TYPE_DOMAIN (inner_type
), size_zero_node
),
2812 NULL_TREE
, NULL_TREE
);
2815 = make_descriptor_field ("A0", pointer64_type
, record64_type
,
2816 build1 (ADDR_EXPR
, pointer64_type
, tem
),
2819 /* Next come the addressing coefficients. */
2820 tem
= size_one_node
;
2821 for (i
= 0; i
< ndim
; i
++)
2825 = size_binop (MULT_EXPR
, tem
,
2826 size_binop (PLUS_EXPR
,
2827 size_binop (MINUS_EXPR
,
2828 TYPE_MAX_VALUE (idx_arr
[i
]),
2829 TYPE_MIN_VALUE (idx_arr
[i
])),
2832 fname
[0] = (mech
== By_Descriptor_NCA
? 'S' : 'M');
2833 fname
[1] = '0' + i
, fname
[2] = 0;
2835 = make_descriptor_field (fname
, gnat_type_for_size (64, 1),
2836 record64_type
, idx_length
, field_list64
);
2838 if (mech
== By_Descriptor_NCA
)
2842 /* Finally here are the bounds. */
2843 for (i
= 0; i
< ndim
; i
++)
2847 fname
[0] = 'L', fname
[1] = '0' + i
, fname
[2] = 0;
2849 = make_descriptor_field (fname
, gnat_type_for_size (64, 1),
2851 TYPE_MIN_VALUE (idx_arr
[i
]), field_list64
);
2855 = make_descriptor_field (fname
, gnat_type_for_size (64, 1),
2857 TYPE_MAX_VALUE (idx_arr
[i
]), field_list64
);
2862 post_error ("unsupported descriptor type for &", gnat_entity
);
2865 TYPE_NAME (record64_type
) = create_concat_name (gnat_entity
, "DESC64");
2866 finish_record_type (record64_type
, nreverse (field_list64
), 0, false);
2867 return record64_type
;
2870 /* Utility routine for above code to make a field. FIELD_LIST is the
2871 list of decls being built; the new decl is chained on to the front of
2875 make_descriptor_field (const char *name
, tree type
,
2876 tree rec_type
, tree initial
, tree field_list
)
2879 = create_field_decl (get_identifier (name
), type
, rec_type
, NULL_TREE
,
2882 DECL_INITIAL (field
) = initial
;
2883 DECL_CHAIN (field
) = field_list
;
2887 /* Convert GNU_EXPR, a pointer to a 64bit VMS descriptor, to GNU_TYPE, a
2888 regular pointer or fat pointer type. GNAT_SUBPROG is the subprogram to
2889 which the VMS descriptor is passed. */
2892 convert_vms_descriptor64 (tree gnu_type
, tree gnu_expr
, Entity_Id gnat_subprog
)
2894 tree desc_type
= TREE_TYPE (TREE_TYPE (gnu_expr
));
2895 tree desc
= build1 (INDIRECT_REF
, desc_type
, gnu_expr
);
2896 /* The CLASS field is the 3rd field in the descriptor. */
2897 tree klass
= DECL_CHAIN (DECL_CHAIN (TYPE_FIELDS (desc_type
)));
2898 /* The POINTER field is the 6th field in the descriptor. */
2899 tree pointer
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (klass
)));
2901 /* Retrieve the value of the POINTER field. */
2903 = build3 (COMPONENT_REF
, TREE_TYPE (pointer
), desc
, pointer
, NULL_TREE
);
2905 if (POINTER_TYPE_P (gnu_type
))
2906 return convert (gnu_type
, gnu_expr64
);
2908 else if (TYPE_IS_FAT_POINTER_P (gnu_type
))
2910 tree p_array_type
= TREE_TYPE (TYPE_FIELDS (gnu_type
));
2911 tree p_bounds_type
= TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type
)));
2912 tree template_type
= TREE_TYPE (p_bounds_type
);
2913 tree min_field
= TYPE_FIELDS (template_type
);
2914 tree max_field
= TREE_CHAIN (TYPE_FIELDS (template_type
));
2915 tree template_tree
, template_addr
, aflags
, dimct
, t
, u
;
2916 /* See the head comment of build_vms_descriptor. */
2917 int iklass
= TREE_INT_CST_LOW (DECL_INITIAL (klass
));
2918 tree lfield
, ufield
;
2919 VEC(constructor_elt
,gc
) *v
;
2921 /* Convert POINTER to the pointer-to-array type. */
2922 gnu_expr64
= convert (p_array_type
, gnu_expr64
);
2926 case 1: /* Class S */
2927 case 15: /* Class SB */
2928 /* Build {1, LENGTH} template; LENGTH64 is the 5th field. */
2929 v
= VEC_alloc (constructor_elt
, gc
, 2);
2930 t
= DECL_CHAIN (DECL_CHAIN (klass
));
2931 t
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
2932 CONSTRUCTOR_APPEND_ELT (v
, min_field
,
2933 convert (TREE_TYPE (min_field
),
2935 CONSTRUCTOR_APPEND_ELT (v
, max_field
,
2936 convert (TREE_TYPE (max_field
), t
));
2937 template_tree
= gnat_build_constructor (template_type
, v
);
2938 template_addr
= build_unary_op (ADDR_EXPR
, NULL_TREE
, template_tree
);
2940 /* For class S, we are done. */
2944 /* Test that we really have a SB descriptor, like DEC Ada. */
2945 t
= build3 (COMPONENT_REF
, TREE_TYPE (klass
), desc
, klass
, NULL
);
2946 u
= convert (TREE_TYPE (klass
), DECL_INITIAL (klass
));
2947 u
= build_binary_op (EQ_EXPR
, boolean_type_node
, t
, u
);
2948 /* If so, there is already a template in the descriptor and
2949 it is located right after the POINTER field. The fields are
2950 64bits so they must be repacked. */
2951 t
= TREE_CHAIN (pointer
);
2952 lfield
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
2953 lfield
= convert (TREE_TYPE (TYPE_FIELDS (template_type
)), lfield
);
2956 ufield
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
2958 (TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (template_type
))), ufield
);
2960 /* Build the template in the form of a constructor. */
2961 v
= VEC_alloc (constructor_elt
, gc
, 2);
2962 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (template_type
), lfield
);
2963 CONSTRUCTOR_APPEND_ELT (v
, TREE_CHAIN (TYPE_FIELDS (template_type
)),
2965 template_tree
= gnat_build_constructor (template_type
, v
);
2967 /* Otherwise use the {1, LENGTH} template we build above. */
2968 template_addr
= build3 (COND_EXPR
, p_bounds_type
, u
,
2969 build_unary_op (ADDR_EXPR
, p_bounds_type
,
2974 case 4: /* Class A */
2975 /* The AFLAGS field is the 3rd field after the pointer in the
2977 t
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (pointer
)));
2978 aflags
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
2979 /* The DIMCT field is the next field in the descriptor after
2982 dimct
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
2983 /* Raise CONSTRAINT_ERROR if either more than 1 dimension
2984 or FL_COEFF or FL_BOUNDS not set. */
2985 u
= build_int_cst (TREE_TYPE (aflags
), 192);
2986 u
= build_binary_op (TRUTH_OR_EXPR
, boolean_type_node
,
2987 build_binary_op (NE_EXPR
, boolean_type_node
,
2989 convert (TREE_TYPE (dimct
),
2991 build_binary_op (NE_EXPR
, boolean_type_node
,
2992 build2 (BIT_AND_EXPR
,
2996 /* There is already a template in the descriptor and it is located
2997 in block 3. The fields are 64bits so they must be repacked. */
2998 t
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (DECL_CHAIN
3000 lfield
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3001 lfield
= convert (TREE_TYPE (TYPE_FIELDS (template_type
)), lfield
);
3004 ufield
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3006 (TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (template_type
))), ufield
);
3008 /* Build the template in the form of a constructor. */
3009 v
= VEC_alloc (constructor_elt
, gc
, 2);
3010 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (template_type
), lfield
);
3011 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (template_type
)),
3013 template_tree
= gnat_build_constructor (template_type
, v
);
3014 template_tree
= build3 (COND_EXPR
, template_type
, u
,
3015 build_call_raise (CE_Length_Check_Failed
, Empty
,
3016 N_Raise_Constraint_Error
),
3019 = build_unary_op (ADDR_EXPR
, p_bounds_type
, template_tree
);
3022 case 10: /* Class NCA */
3024 post_error ("unsupported descriptor type for &", gnat_subprog
);
3025 template_addr
= integer_zero_node
;
3029 /* Build the fat pointer in the form of a constructor. */
3030 v
= VEC_alloc (constructor_elt
, gc
, 2);
3031 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (gnu_type
), gnu_expr64
);
3032 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (gnu_type
)),
3034 return gnat_build_constructor (gnu_type
, v
);
3041 /* Convert GNU_EXPR, a pointer to a 32bit VMS descriptor, to GNU_TYPE, a
3042 regular pointer or fat pointer type. GNAT_SUBPROG is the subprogram to
3043 which the VMS descriptor is passed. */
3046 convert_vms_descriptor32 (tree gnu_type
, tree gnu_expr
, Entity_Id gnat_subprog
)
3048 tree desc_type
= TREE_TYPE (TREE_TYPE (gnu_expr
));
3049 tree desc
= build1 (INDIRECT_REF
, desc_type
, gnu_expr
);
3050 /* The CLASS field is the 3rd field in the descriptor. */
3051 tree klass
= DECL_CHAIN (DECL_CHAIN (TYPE_FIELDS (desc_type
)));
3052 /* The POINTER field is the 4th field in the descriptor. */
3053 tree pointer
= DECL_CHAIN (klass
);
3055 /* Retrieve the value of the POINTER field. */
3057 = build3 (COMPONENT_REF
, TREE_TYPE (pointer
), desc
, pointer
, NULL_TREE
);
3059 if (POINTER_TYPE_P (gnu_type
))
3060 return convert (gnu_type
, gnu_expr32
);
3062 else if (TYPE_IS_FAT_POINTER_P (gnu_type
))
3064 tree p_array_type
= TREE_TYPE (TYPE_FIELDS (gnu_type
));
3065 tree p_bounds_type
= TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type
)));
3066 tree template_type
= TREE_TYPE (p_bounds_type
);
3067 tree min_field
= TYPE_FIELDS (template_type
);
3068 tree max_field
= TREE_CHAIN (TYPE_FIELDS (template_type
));
3069 tree template_tree
, template_addr
, aflags
, dimct
, t
, u
;
3070 /* See the head comment of build_vms_descriptor. */
3071 int iklass
= TREE_INT_CST_LOW (DECL_INITIAL (klass
));
3072 VEC(constructor_elt
,gc
) *v
;
3074 /* Convert POINTER to the pointer-to-array type. */
3075 gnu_expr32
= convert (p_array_type
, gnu_expr32
);
3079 case 1: /* Class S */
3080 case 15: /* Class SB */
3081 /* Build {1, LENGTH} template; LENGTH is the 1st field. */
3082 v
= VEC_alloc (constructor_elt
, gc
, 2);
3083 t
= TYPE_FIELDS (desc_type
);
3084 t
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3085 CONSTRUCTOR_APPEND_ELT (v
, min_field
,
3086 convert (TREE_TYPE (min_field
),
3088 CONSTRUCTOR_APPEND_ELT (v
, max_field
,
3089 convert (TREE_TYPE (max_field
), t
));
3090 template_tree
= gnat_build_constructor (template_type
, v
);
3091 template_addr
= build_unary_op (ADDR_EXPR
, NULL_TREE
, template_tree
);
3093 /* For class S, we are done. */
3097 /* Test that we really have a SB descriptor, like DEC Ada. */
3098 t
= build3 (COMPONENT_REF
, TREE_TYPE (klass
), desc
, klass
, NULL
);
3099 u
= convert (TREE_TYPE (klass
), DECL_INITIAL (klass
));
3100 u
= build_binary_op (EQ_EXPR
, boolean_type_node
, t
, u
);
3101 /* If so, there is already a template in the descriptor and
3102 it is located right after the POINTER field. */
3103 t
= TREE_CHAIN (pointer
);
3105 = build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3106 /* Otherwise use the {1, LENGTH} template we build above. */
3107 template_addr
= build3 (COND_EXPR
, p_bounds_type
, u
,
3108 build_unary_op (ADDR_EXPR
, p_bounds_type
,
3113 case 4: /* Class A */
3114 /* The AFLAGS field is the 7th field in the descriptor. */
3115 t
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (pointer
)));
3116 aflags
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3117 /* The DIMCT field is the 8th field in the descriptor. */
3119 dimct
= build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3120 /* Raise CONSTRAINT_ERROR if either more than 1 dimension
3121 or FL_COEFF or FL_BOUNDS not set. */
3122 u
= build_int_cst (TREE_TYPE (aflags
), 192);
3123 u
= build_binary_op (TRUTH_OR_EXPR
, boolean_type_node
,
3124 build_binary_op (NE_EXPR
, boolean_type_node
,
3126 convert (TREE_TYPE (dimct
),
3128 build_binary_op (NE_EXPR
, boolean_type_node
,
3129 build2 (BIT_AND_EXPR
,
3133 /* There is already a template in the descriptor and it is
3134 located at the start of block 3 (12th field). */
3135 t
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (t
))));
3137 = build3 (COMPONENT_REF
, TREE_TYPE (t
), desc
, t
, NULL_TREE
);
3138 template_tree
= build3 (COND_EXPR
, TREE_TYPE (t
), u
,
3139 build_call_raise (CE_Length_Check_Failed
, Empty
,
3140 N_Raise_Constraint_Error
),
3143 = build_unary_op (ADDR_EXPR
, p_bounds_type
, template_tree
);
3146 case 10: /* Class NCA */
3148 post_error ("unsupported descriptor type for &", gnat_subprog
);
3149 template_addr
= integer_zero_node
;
3153 /* Build the fat pointer in the form of a constructor. */
3154 v
= VEC_alloc (constructor_elt
, gc
, 2);
3155 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (gnu_type
), gnu_expr32
);
3156 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (gnu_type
)),
3159 return gnat_build_constructor (gnu_type
, v
);
3166 /* Convert GNU_EXPR, a pointer to a VMS descriptor, to GNU_TYPE, a regular
3167 pointer or fat pointer type. GNU_EXPR_ALT_TYPE is the alternate (32-bit)
3168 pointer type of GNU_EXPR. GNAT_SUBPROG is the subprogram to which the
3169 VMS descriptor is passed. */
3172 convert_vms_descriptor (tree gnu_type
, tree gnu_expr
, tree gnu_expr_alt_type
,
3173 Entity_Id gnat_subprog
)
3175 tree desc_type
= TREE_TYPE (TREE_TYPE (gnu_expr
));
3176 tree desc
= build1 (INDIRECT_REF
, desc_type
, gnu_expr
);
3177 tree mbo
= TYPE_FIELDS (desc_type
);
3178 const char *mbostr
= IDENTIFIER_POINTER (DECL_NAME (mbo
));
3179 tree mbmo
= DECL_CHAIN (DECL_CHAIN (DECL_CHAIN (mbo
)));
3180 tree is64bit
, gnu_expr32
, gnu_expr64
;
3182 /* If the field name is not MBO, it must be 32-bit and no alternate.
3183 Otherwise primary must be 64-bit and alternate 32-bit. */
3184 if (strcmp (mbostr
, "MBO") != 0)
3185 return convert_vms_descriptor32 (gnu_type
, gnu_expr
, gnat_subprog
);
3187 /* Build the test for 64-bit descriptor. */
3188 mbo
= build3 (COMPONENT_REF
, TREE_TYPE (mbo
), desc
, mbo
, NULL_TREE
);
3189 mbmo
= build3 (COMPONENT_REF
, TREE_TYPE (mbmo
), desc
, mbmo
, NULL_TREE
);
3191 = build_binary_op (TRUTH_ANDIF_EXPR
, boolean_type_node
,
3192 build_binary_op (EQ_EXPR
, boolean_type_node
,
3193 convert (integer_type_node
, mbo
),
3195 build_binary_op (EQ_EXPR
, boolean_type_node
,
3196 convert (integer_type_node
, mbmo
),
3197 integer_minus_one_node
));
3199 /* Build the 2 possible end results. */
3200 gnu_expr64
= convert_vms_descriptor64 (gnu_type
, gnu_expr
, gnat_subprog
);
3201 gnu_expr
= fold_convert (gnu_expr_alt_type
, gnu_expr
);
3202 gnu_expr32
= convert_vms_descriptor32 (gnu_type
, gnu_expr
, gnat_subprog
);
3204 return build3 (COND_EXPR
, gnu_type
, is64bit
, gnu_expr64
, gnu_expr32
);
3207 /* Build a stub for the subprogram specified by the GCC tree GNU_SUBPROG
3208 and the GNAT node GNAT_SUBPROG. */
3211 build_function_stub (tree gnu_subprog
, Entity_Id gnat_subprog
)
3213 tree gnu_subprog_type
, gnu_subprog_addr
, gnu_subprog_call
;
3214 tree gnu_stub_param
, gnu_arg_types
, gnu_param
;
3215 tree gnu_stub_decl
= DECL_FUNCTION_STUB (gnu_subprog
);
3217 VEC(tree
,gc
) *gnu_param_vec
= NULL
;
3219 gnu_subprog_type
= TREE_TYPE (gnu_subprog
);
3221 begin_subprog_body (gnu_stub_decl
);
3224 start_stmt_group ();
3226 /* Loop over the parameters of the stub and translate any of them
3227 passed by descriptor into a by reference one. */
3228 for (gnu_stub_param
= DECL_ARGUMENTS (gnu_stub_decl
),
3229 gnu_arg_types
= TYPE_ARG_TYPES (gnu_subprog_type
);
3231 gnu_stub_param
= TREE_CHAIN (gnu_stub_param
),
3232 gnu_arg_types
= TREE_CHAIN (gnu_arg_types
))
3234 if (DECL_BY_DESCRIPTOR_P (gnu_stub_param
))
3236 = convert_vms_descriptor (TREE_VALUE (gnu_arg_types
),
3238 DECL_PARM_ALT_TYPE (gnu_stub_param
),
3241 gnu_param
= gnu_stub_param
;
3243 VEC_safe_push (tree
, gc
, gnu_param_vec
, gnu_param
);
3246 gnu_body
= end_stmt_group ();
3248 /* Invoke the internal subprogram. */
3249 gnu_subprog_addr
= build1 (ADDR_EXPR
, build_pointer_type (gnu_subprog_type
),
3251 gnu_subprog_call
= build_call_vec (TREE_TYPE (gnu_subprog_type
),
3252 gnu_subprog_addr
, gnu_param_vec
);
3254 /* Propagate the return value, if any. */
3255 if (VOID_TYPE_P (TREE_TYPE (gnu_subprog_type
)))
3256 append_to_statement_list (gnu_subprog_call
, &gnu_body
);
3258 append_to_statement_list (build_return_expr (DECL_RESULT (gnu_stub_decl
),
3264 allocate_struct_function (gnu_stub_decl
, false);
3265 end_subprog_body (gnu_body
);
3268 /* Build a type to be used to represent an aliased object whose nominal type
3269 is an unconstrained array. This consists of a RECORD_TYPE containing a
3270 field of TEMPLATE_TYPE and a field of OBJECT_TYPE, which is an ARRAY_TYPE.
3271 If ARRAY_TYPE is that of an unconstrained array, this is used to represent
3272 an arbitrary unconstrained object. Use NAME as the name of the record.
3273 DEBUG_INFO_P is true if we need to write debug information for the type. */
3276 build_unc_object_type (tree template_type
, tree object_type
, tree name
,
3279 tree type
= make_node (RECORD_TYPE
);
3281 = create_field_decl (get_identifier ("BOUNDS"), template_type
, type
,
3282 NULL_TREE
, NULL_TREE
, 0, 1);
3284 = create_field_decl (get_identifier ("ARRAY"), object_type
, type
,
3285 NULL_TREE
, NULL_TREE
, 0, 1);
3287 TYPE_NAME (type
) = name
;
3288 TYPE_CONTAINS_TEMPLATE_P (type
) = 1;
3289 DECL_CHAIN (template_field
) = array_field
;
3290 finish_record_type (type
, template_field
, 0, true);
3292 /* Declare it now since it will never be declared otherwise. This is
3293 necessary to ensure that its subtrees are properly marked. */
3294 create_type_decl (name
, type
, NULL
, true, debug_info_p
, Empty
);
3299 /* Same, taking a thin or fat pointer type instead of a template type. */
3302 build_unc_object_type_from_ptr (tree thin_fat_ptr_type
, tree object_type
,
3303 tree name
, bool debug_info_p
)
3307 gcc_assert (TYPE_IS_FAT_OR_THIN_POINTER_P (thin_fat_ptr_type
));
3310 = (TYPE_IS_FAT_POINTER_P (thin_fat_ptr_type
)
3311 ? TREE_TYPE (TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (thin_fat_ptr_type
))))
3312 : TREE_TYPE (TYPE_FIELDS (TREE_TYPE (thin_fat_ptr_type
))));
3315 build_unc_object_type (template_type
, object_type
, name
, debug_info_p
);
3318 /* Shift the component offsets within an unconstrained object TYPE to make it
3319 suitable for use as a designated type for thin pointers. */
3322 shift_unc_components_for_thin_pointers (tree type
)
3324 /* Thin pointer values designate the ARRAY data of an unconstrained object,
3325 allocated past the BOUNDS template. The designated type is adjusted to
3326 have ARRAY at position zero and the template at a negative offset, so
3327 that COMPONENT_REFs on (*thin_ptr) designate the proper location. */
3329 tree bounds_field
= TYPE_FIELDS (type
);
3330 tree array_field
= DECL_CHAIN (TYPE_FIELDS (type
));
3332 DECL_FIELD_OFFSET (bounds_field
)
3333 = size_binop (MINUS_EXPR
, size_zero_node
, byte_position (array_field
));
3335 DECL_FIELD_OFFSET (array_field
) = size_zero_node
;
3336 DECL_FIELD_BIT_OFFSET (array_field
) = bitsize_zero_node
;
3339 /* Update anything previously pointing to OLD_TYPE to point to NEW_TYPE.
3340 In the normal case this is just two adjustments, but we have more to
3341 do if NEW_TYPE is an UNCONSTRAINED_ARRAY_TYPE. */
3344 update_pointer_to (tree old_type
, tree new_type
)
3346 tree ptr
= TYPE_POINTER_TO (old_type
);
3347 tree ref
= TYPE_REFERENCE_TO (old_type
);
3350 /* If this is the main variant, process all the other variants first. */
3351 if (TYPE_MAIN_VARIANT (old_type
) == old_type
)
3352 for (t
= TYPE_NEXT_VARIANT (old_type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3353 update_pointer_to (t
, new_type
);
3355 /* If no pointers and no references, we are done. */
3359 /* Merge the old type qualifiers in the new type.
3361 Each old variant has qualifiers for specific reasons, and the new
3362 designated type as well. Each set of qualifiers represents useful
3363 information grabbed at some point, and merging the two simply unifies
3364 these inputs into the final type description.
3366 Consider for instance a volatile type frozen after an access to constant
3367 type designating it; after the designated type's freeze, we get here with
3368 a volatile NEW_TYPE and a dummy OLD_TYPE with a readonly variant, created
3369 when the access type was processed. We will make a volatile and readonly
3370 designated type, because that's what it really is.
3372 We might also get here for a non-dummy OLD_TYPE variant with different
3373 qualifiers than those of NEW_TYPE, for instance in some cases of pointers
3374 to private record type elaboration (see the comments around the call to
3375 this routine in gnat_to_gnu_entity <E_Access_Type>). We have to merge
3376 the qualifiers in those cases too, to avoid accidentally discarding the
3377 initial set, and will often end up with OLD_TYPE == NEW_TYPE then. */
3379 = build_qualified_type (new_type
,
3380 TYPE_QUALS (old_type
) | TYPE_QUALS (new_type
));
3382 /* If old type and new type are identical, there is nothing to do. */
3383 if (old_type
== new_type
)
3386 /* Otherwise, first handle the simple case. */
3387 if (TREE_CODE (new_type
) != UNCONSTRAINED_ARRAY_TYPE
)
3389 tree new_ptr
, new_ref
;
3391 /* If pointer or reference already points to new type, nothing to do.
3392 This can happen as update_pointer_to can be invoked multiple times
3393 on the same couple of types because of the type variants. */
3394 if ((ptr
&& TREE_TYPE (ptr
) == new_type
)
3395 || (ref
&& TREE_TYPE (ref
) == new_type
))
3398 /* Chain PTR and its variants at the end. */
3399 new_ptr
= TYPE_POINTER_TO (new_type
);
3402 while (TYPE_NEXT_PTR_TO (new_ptr
))
3403 new_ptr
= TYPE_NEXT_PTR_TO (new_ptr
);
3404 TYPE_NEXT_PTR_TO (new_ptr
) = ptr
;
3407 TYPE_POINTER_TO (new_type
) = ptr
;
3409 /* Now adjust them. */
3410 for (; ptr
; ptr
= TYPE_NEXT_PTR_TO (ptr
))
3411 for (t
= TYPE_MAIN_VARIANT (ptr
); t
; t
= TYPE_NEXT_VARIANT (t
))
3412 TREE_TYPE (t
) = new_type
;
3414 /* Chain REF and its variants at the end. */
3415 new_ref
= TYPE_REFERENCE_TO (new_type
);
3418 while (TYPE_NEXT_REF_TO (new_ref
))
3419 new_ref
= TYPE_NEXT_REF_TO (new_ref
);
3420 TYPE_NEXT_REF_TO (new_ref
) = ref
;
3423 TYPE_REFERENCE_TO (new_type
) = ref
;
3425 /* Now adjust them. */
3426 for (; ref
; ref
= TYPE_NEXT_REF_TO (ref
))
3427 for (t
= TYPE_MAIN_VARIANT (ref
); t
; t
= TYPE_NEXT_VARIANT (t
))
3428 TREE_TYPE (t
) = new_type
;
3431 /* Now deal with the unconstrained array case. In this case the pointer
3432 is actually a record where both fields are pointers to dummy nodes.
3433 Turn them into pointers to the correct types using update_pointer_to. */
3436 tree new_ptr
= TYPE_MAIN_VARIANT (TYPE_POINTER_TO (new_type
));
3437 tree new_obj_rec
= TYPE_OBJECT_RECORD_TYPE (new_type
);
3438 tree array_field
, bounds_field
, new_ref
, last
= NULL_TREE
;
3440 gcc_assert (TYPE_IS_FAT_POINTER_P (ptr
));
3442 /* If PTR already points to new type, nothing to do. This can happen
3443 since update_pointer_to can be invoked multiple times on the same
3444 couple of types because of the type variants. */
3445 if (TYPE_UNCONSTRAINED_ARRAY (ptr
) == new_type
)
3448 array_field
= TYPE_FIELDS (ptr
);
3449 bounds_field
= DECL_CHAIN (array_field
);
3451 /* Make pointers to the dummy template point to the real template. */
3453 (TREE_TYPE (TREE_TYPE (bounds_field
)),
3454 TREE_TYPE (TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (new_ptr
)))));
3456 /* The references to the template bounds present in the array type use
3457 the bounds field of NEW_PTR through a PLACEHOLDER_EXPR. Since we
3458 are going to merge PTR in NEW_PTR, we must rework these references
3459 to use the bounds field of PTR instead. */
3460 new_ref
= build3 (COMPONENT_REF
, TREE_TYPE (bounds_field
),
3461 build0 (PLACEHOLDER_EXPR
, new_ptr
),
3462 bounds_field
, NULL_TREE
);
3464 /* Create the new array for the new PLACEHOLDER_EXPR and make pointers
3465 to the dummy array point to it. */
3467 (TREE_TYPE (TREE_TYPE (array_field
)),
3468 substitute_in_type (TREE_TYPE (TREE_TYPE (TYPE_FIELDS (new_ptr
))),
3469 DECL_CHAIN (TYPE_FIELDS (new_ptr
)), new_ref
));
3471 /* Merge PTR in NEW_PTR. */
3472 DECL_FIELD_CONTEXT (array_field
) = new_ptr
;
3473 DECL_FIELD_CONTEXT (bounds_field
) = new_ptr
;
3474 for (t
= new_ptr
; t
; last
= t
, t
= TYPE_NEXT_VARIANT (t
))
3475 TYPE_FIELDS (t
) = TYPE_FIELDS (ptr
);
3476 TYPE_ALIAS_SET (new_ptr
) = TYPE_ALIAS_SET (ptr
);
3478 /* Chain PTR and its variants at the end. */
3479 TYPE_NEXT_VARIANT (last
) = TYPE_MAIN_VARIANT (ptr
);
3481 /* Now adjust them. */
3482 for (t
= TYPE_MAIN_VARIANT (ptr
); t
; t
= TYPE_NEXT_VARIANT (t
))
3484 TYPE_MAIN_VARIANT (t
) = new_ptr
;
3485 SET_TYPE_UNCONSTRAINED_ARRAY (t
, new_type
);
3488 /* And show the original pointer NEW_PTR to the debugger. This is the
3489 counterpart of the equivalent processing in gnat_pushdecl when the
3490 unconstrained array type is frozen after access types to it. */
3491 if (TYPE_NAME (ptr
) && TREE_CODE (TYPE_NAME (ptr
)) == TYPE_DECL
)
3493 DECL_ORIGINAL_TYPE (TYPE_NAME (ptr
)) = new_ptr
;
3494 DECL_ARTIFICIAL (TYPE_NAME (ptr
)) = 0;
3497 /* Now handle updating the allocation record, what the thin pointer
3498 points to. Update all pointers from the old record into the new
3499 one, update the type of the array field, and recompute the size. */
3500 update_pointer_to (TYPE_OBJECT_RECORD_TYPE (old_type
), new_obj_rec
);
3501 TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (new_obj_rec
)))
3502 = TREE_TYPE (TREE_TYPE (array_field
));
3504 /* The size recomputation needs to account for alignment constraints, so
3505 we let layout_type work it out. This will reset the field offsets to
3506 what they would be in a regular record, so we shift them back to what
3507 we want them to be for a thin pointer designated type afterwards. */
3508 DECL_SIZE (TYPE_FIELDS (new_obj_rec
)) = NULL_TREE
;
3509 DECL_SIZE (DECL_CHAIN (TYPE_FIELDS (new_obj_rec
))) = NULL_TREE
;
3510 TYPE_SIZE (new_obj_rec
) = NULL_TREE
;
3511 layout_type (new_obj_rec
);
3512 shift_unc_components_for_thin_pointers (new_obj_rec
);
3514 /* We are done, at last. */
3515 rest_of_record_type_compilation (ptr
);
3519 /* Convert EXPR, a pointer to a constrained array, into a pointer to an
3520 unconstrained one. This involves making or finding a template. */
3523 convert_to_fat_pointer (tree type
, tree expr
)
3525 tree template_type
= TREE_TYPE (TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (type
))));
3526 tree p_array_type
= TREE_TYPE (TYPE_FIELDS (type
));
3527 tree etype
= TREE_TYPE (expr
);
3529 VEC(constructor_elt
,gc
) *v
= VEC_alloc (constructor_elt
, gc
, 2);
3531 /* If EXPR is null, make a fat pointer that contains null pointers to the
3532 template and array. */
3533 if (integer_zerop (expr
))
3535 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (type
),
3536 convert (p_array_type
, expr
));
3537 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (type
)),
3538 convert (build_pointer_type (template_type
),
3540 return gnat_build_constructor (type
, v
);
3543 /* If EXPR is a thin pointer, make template and data from the record.. */
3544 else if (TYPE_IS_THIN_POINTER_P (etype
))
3546 tree fields
= TYPE_FIELDS (TREE_TYPE (etype
));
3548 expr
= gnat_protect_expr (expr
);
3549 if (TREE_CODE (expr
) == ADDR_EXPR
)
3550 expr
= TREE_OPERAND (expr
, 0);
3552 expr
= build1 (INDIRECT_REF
, TREE_TYPE (etype
), expr
);
3554 template_tree
= build_component_ref (expr
, NULL_TREE
, fields
, false);
3555 expr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
3556 build_component_ref (expr
, NULL_TREE
,
3557 DECL_CHAIN (fields
), false));
3560 /* Otherwise, build the constructor for the template. */
3562 template_tree
= build_template (template_type
, TREE_TYPE (etype
), expr
);
3564 /* The final result is a constructor for the fat pointer.
3566 If EXPR is an argument of a foreign convention subprogram, the type it
3567 points to is directly the component type. In this case, the expression
3568 type may not match the corresponding FIELD_DECL type at this point, so we
3569 call "convert" here to fix that up if necessary. This type consistency is
3570 required, for instance because it ensures that possible later folding of
3571 COMPONENT_REFs against this constructor always yields something of the
3572 same type as the initial reference.
3574 Note that the call to "build_template" above is still fine because it
3575 will only refer to the provided TEMPLATE_TYPE in this case. */
3576 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (type
),
3577 convert (p_array_type
, expr
));
3578 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (type
)),
3579 build_unary_op (ADDR_EXPR
, NULL_TREE
,
3581 return gnat_build_constructor (type
, v
);
3584 /* Convert to a thin pointer type, TYPE. The only thing we know how to convert
3585 is something that is a fat pointer, so convert to it first if it EXPR
3586 is not already a fat pointer. */
3589 convert_to_thin_pointer (tree type
, tree expr
)
3591 if (!TYPE_IS_FAT_POINTER_P (TREE_TYPE (expr
)))
3593 = convert_to_fat_pointer
3594 (TREE_TYPE (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type
))), expr
);
3596 /* We get the pointer to the data and use a NOP_EXPR to make it the
3598 expr
= build_component_ref (expr
, NULL_TREE
, TYPE_FIELDS (TREE_TYPE (expr
)),
3600 expr
= build1 (NOP_EXPR
, type
, expr
);
3605 /* Create an expression whose value is that of EXPR,
3606 converted to type TYPE. The TREE_TYPE of the value
3607 is always TYPE. This function implements all reasonable
3608 conversions; callers should filter out those that are
3609 not permitted by the language being compiled. */
3612 convert (tree type
, tree expr
)
3614 tree etype
= TREE_TYPE (expr
);
3615 enum tree_code ecode
= TREE_CODE (etype
);
3616 enum tree_code code
= TREE_CODE (type
);
3618 /* If the expression is already of the right type, we are done. */
3622 /* If both input and output have padding and are of variable size, do this
3623 as an unchecked conversion. Likewise if one is a mere variant of the
3624 other, so we avoid a pointless unpad/repad sequence. */
3625 else if (code
== RECORD_TYPE
&& ecode
== RECORD_TYPE
3626 && TYPE_PADDING_P (type
) && TYPE_PADDING_P (etype
)
3627 && (!TREE_CONSTANT (TYPE_SIZE (type
))
3628 || !TREE_CONSTANT (TYPE_SIZE (etype
))
3629 || gnat_types_compatible_p (type
, etype
)
3630 || TYPE_NAME (TREE_TYPE (TYPE_FIELDS (type
)))
3631 == TYPE_NAME (TREE_TYPE (TYPE_FIELDS (etype
)))))
3634 /* If the output type has padding, convert to the inner type and make a
3635 constructor to build the record, unless a variable size is involved. */
3636 else if (code
== RECORD_TYPE
&& TYPE_PADDING_P (type
))
3638 VEC(constructor_elt
,gc
) *v
;
3640 /* If we previously converted from another type and our type is
3641 of variable size, remove the conversion to avoid the need for
3642 variable-sized temporaries. Likewise for a conversion between
3643 original and packable version. */
3644 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
3645 && (!TREE_CONSTANT (TYPE_SIZE (type
))
3646 || (ecode
== RECORD_TYPE
3647 && TYPE_NAME (etype
)
3648 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (expr
, 0))))))
3649 expr
= TREE_OPERAND (expr
, 0);
3651 /* If we are just removing the padding from expr, convert the original
3652 object if we have variable size in order to avoid the need for some
3653 variable-sized temporaries. Likewise if the padding is a variant
3654 of the other, so we avoid a pointless unpad/repad sequence. */
3655 if (TREE_CODE (expr
) == COMPONENT_REF
3656 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (expr
, 0)))
3657 && (!TREE_CONSTANT (TYPE_SIZE (type
))
3658 || gnat_types_compatible_p (type
,
3659 TREE_TYPE (TREE_OPERAND (expr
, 0)))
3660 || (ecode
== RECORD_TYPE
3661 && TYPE_NAME (etype
)
3662 == TYPE_NAME (TREE_TYPE (TYPE_FIELDS (type
))))))
3663 return convert (type
, TREE_OPERAND (expr
, 0));
3665 /* If the inner type is of self-referential size and the expression type
3666 is a record, do this as an unchecked conversion. But first pad the
3667 expression if possible to have the same size on both sides. */
3668 if (ecode
== RECORD_TYPE
3669 && CONTAINS_PLACEHOLDER_P (DECL_SIZE (TYPE_FIELDS (type
))))
3671 if (TREE_CODE (TYPE_SIZE (etype
)) == INTEGER_CST
)
3672 expr
= convert (maybe_pad_type (etype
, TYPE_SIZE (type
), 0, Empty
,
3673 false, false, false, true),
3675 return unchecked_convert (type
, expr
, false);
3678 /* If we are converting between array types with variable size, do the
3679 final conversion as an unchecked conversion, again to avoid the need
3680 for some variable-sized temporaries. If valid, this conversion is
3681 very likely purely technical and without real effects. */
3682 if (ecode
== ARRAY_TYPE
3683 && TREE_CODE (TREE_TYPE (TYPE_FIELDS (type
))) == ARRAY_TYPE
3684 && !TREE_CONSTANT (TYPE_SIZE (etype
))
3685 && !TREE_CONSTANT (TYPE_SIZE (type
)))
3686 return unchecked_convert (type
,
3687 convert (TREE_TYPE (TYPE_FIELDS (type
)),
3691 v
= VEC_alloc (constructor_elt
, gc
, 1);
3692 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (type
),
3693 convert (TREE_TYPE (TYPE_FIELDS (type
)), expr
));
3694 return gnat_build_constructor (type
, v
);
3697 /* If the input type has padding, remove it and convert to the output type.
3698 The conditions ordering is arranged to ensure that the output type is not
3699 a padding type here, as it is not clear whether the conversion would
3700 always be correct if this was to happen. */
3701 else if (ecode
== RECORD_TYPE
&& TYPE_PADDING_P (etype
))
3705 /* If we have just converted to this padded type, just get the
3706 inner expression. */
3707 if (TREE_CODE (expr
) == CONSTRUCTOR
3708 && !VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (expr
))
3709 && VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (expr
), 0)->index
3710 == TYPE_FIELDS (etype
))
3712 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (expr
), 0)->value
;
3714 /* Otherwise, build an explicit component reference. */
3717 = build_component_ref (expr
, NULL_TREE
, TYPE_FIELDS (etype
), false);
3719 return convert (type
, unpadded
);
3722 /* If the input is a biased type, adjust first. */
3723 if (ecode
== INTEGER_TYPE
&& TYPE_BIASED_REPRESENTATION_P (etype
))
3724 return convert (type
, fold_build2 (PLUS_EXPR
, TREE_TYPE (etype
),
3725 fold_convert (TREE_TYPE (etype
),
3727 TYPE_MIN_VALUE (etype
)));
3729 /* If the input is a justified modular type, we need to extract the actual
3730 object before converting it to any other type with the exceptions of an
3731 unconstrained array or of a mere type variant. It is useful to avoid the
3732 extraction and conversion in the type variant case because it could end
3733 up replacing a VAR_DECL expr by a constructor and we might be about the
3734 take the address of the result. */
3735 if (ecode
== RECORD_TYPE
&& TYPE_JUSTIFIED_MODULAR_P (etype
)
3736 && code
!= UNCONSTRAINED_ARRAY_TYPE
3737 && TYPE_MAIN_VARIANT (type
) != TYPE_MAIN_VARIANT (etype
))
3738 return convert (type
, build_component_ref (expr
, NULL_TREE
,
3739 TYPE_FIELDS (etype
), false));
3741 /* If converting to a type that contains a template, convert to the data
3742 type and then build the template. */
3743 if (code
== RECORD_TYPE
&& TYPE_CONTAINS_TEMPLATE_P (type
))
3745 tree obj_type
= TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (type
)));
3746 VEC(constructor_elt
,gc
) *v
= VEC_alloc (constructor_elt
, gc
, 2);
3748 /* If the source already has a template, get a reference to the
3749 associated array only, as we are going to rebuild a template
3750 for the target type anyway. */
3751 expr
= maybe_unconstrained_array (expr
);
3753 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (type
),
3754 build_template (TREE_TYPE (TYPE_FIELDS (type
)),
3755 obj_type
, NULL_TREE
));
3756 CONSTRUCTOR_APPEND_ELT (v
, DECL_CHAIN (TYPE_FIELDS (type
)),
3757 convert (obj_type
, expr
));
3758 return gnat_build_constructor (type
, v
);
3761 /* There are some special cases of expressions that we process
3763 switch (TREE_CODE (expr
))
3769 /* Just set its type here. For TRANSFORM_EXPR, we will do the actual
3770 conversion in gnat_expand_expr. NULL_EXPR does not represent
3771 and actual value, so no conversion is needed. */
3772 expr
= copy_node (expr
);
3773 TREE_TYPE (expr
) = type
;
3777 /* If we are converting a STRING_CST to another constrained array type,
3778 just make a new one in the proper type. */
3779 if (code
== ecode
&& AGGREGATE_TYPE_P (etype
)
3780 && !(TREE_CODE (TYPE_SIZE (etype
)) == INTEGER_CST
3781 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
3783 expr
= copy_node (expr
);
3784 TREE_TYPE (expr
) = type
;
3790 /* If we are converting a VECTOR_CST to a mere variant type, just make
3791 a new one in the proper type. */
3792 if (code
== ecode
&& gnat_types_compatible_p (type
, etype
))
3794 expr
= copy_node (expr
);
3795 TREE_TYPE (expr
) = type
;
3800 /* If we are converting a CONSTRUCTOR to a mere variant type, just make
3801 a new one in the proper type. */
3802 if (code
== ecode
&& gnat_types_compatible_p (type
, etype
))
3804 expr
= copy_node (expr
);
3805 TREE_TYPE (expr
) = type
;
3809 /* Likewise for a conversion between original and packable version, or
3810 conversion between types of the same size and with the same list of
3811 fields, but we have to work harder to preserve type consistency. */
3813 && code
== RECORD_TYPE
3814 && (TYPE_NAME (type
) == TYPE_NAME (etype
)
3815 || tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (etype
))))
3818 VEC(constructor_elt
,gc
) *e
= CONSTRUCTOR_ELTS (expr
);
3819 unsigned HOST_WIDE_INT len
= VEC_length (constructor_elt
, e
);
3820 VEC(constructor_elt
,gc
) *v
= VEC_alloc (constructor_elt
, gc
, len
);
3821 tree efield
= TYPE_FIELDS (etype
), field
= TYPE_FIELDS (type
);
3822 unsigned HOST_WIDE_INT idx
;
3825 /* Whether we need to clear TREE_CONSTANT et al. on the output
3826 constructor when we convert in place. */
3827 bool clear_constant
= false;
3829 FOR_EACH_CONSTRUCTOR_ELT(e
, idx
, index
, value
)
3831 constructor_elt
*elt
;
3832 /* We expect only simple constructors. */
3833 if (!SAME_FIELD_P (index
, efield
))
3835 /* The field must be the same. */
3836 if (!SAME_FIELD_P (efield
, field
))
3838 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
3840 elt
->value
= convert (TREE_TYPE (field
), value
);
3842 /* If packing has made this field a bitfield and the input
3843 value couldn't be emitted statically any more, we need to
3844 clear TREE_CONSTANT on our output. */
3846 && TREE_CONSTANT (expr
)
3847 && !CONSTRUCTOR_BITFIELD_P (efield
)
3848 && CONSTRUCTOR_BITFIELD_P (field
)
3849 && !initializer_constant_valid_for_bitfield_p (value
))
3850 clear_constant
= true;
3852 efield
= DECL_CHAIN (efield
);
3853 field
= DECL_CHAIN (field
);
3856 /* If we have been able to match and convert all the input fields
3857 to their output type, convert in place now. We'll fallback to a
3858 view conversion downstream otherwise. */
3861 expr
= copy_node (expr
);
3862 TREE_TYPE (expr
) = type
;
3863 CONSTRUCTOR_ELTS (expr
) = v
;
3865 TREE_CONSTANT (expr
) = TREE_STATIC (expr
) = 0;
3870 /* Likewise for a conversion between array type and vector type with a
3871 compatible representative array. */
3872 else if (code
== VECTOR_TYPE
3873 && ecode
== ARRAY_TYPE
3874 && gnat_types_compatible_p (TYPE_REPRESENTATIVE_ARRAY (type
),
3877 VEC(constructor_elt
,gc
) *e
= CONSTRUCTOR_ELTS (expr
);
3878 unsigned HOST_WIDE_INT len
= VEC_length (constructor_elt
, e
);
3879 VEC(constructor_elt
,gc
) *v
;
3880 unsigned HOST_WIDE_INT ix
;
3883 /* Build a VECTOR_CST from a *constant* array constructor. */
3884 if (TREE_CONSTANT (expr
))
3886 bool constant_p
= true;
3888 /* Iterate through elements and check if all constructor
3889 elements are *_CSTs. */
3890 FOR_EACH_CONSTRUCTOR_VALUE (e
, ix
, value
)
3891 if (!CONSTANT_CLASS_P (value
))
3898 return build_vector_from_ctor (type
,
3899 CONSTRUCTOR_ELTS (expr
));
3902 /* Otherwise, build a regular vector constructor. */
3903 v
= VEC_alloc (constructor_elt
, gc
, len
);
3904 FOR_EACH_CONSTRUCTOR_VALUE (e
, ix
, value
)
3906 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
3907 elt
->index
= NULL_TREE
;
3910 expr
= copy_node (expr
);
3911 TREE_TYPE (expr
) = type
;
3912 CONSTRUCTOR_ELTS (expr
) = v
;
3917 case UNCONSTRAINED_ARRAY_REF
:
3918 /* Convert this to the type of the inner array by getting the address of
3919 the array from the template. */
3920 expr
= TREE_OPERAND (expr
, 0);
3921 expr
= build_unary_op (INDIRECT_REF
, NULL_TREE
,
3922 build_component_ref (expr
, NULL_TREE
,
3926 etype
= TREE_TYPE (expr
);
3927 ecode
= TREE_CODE (etype
);
3930 case VIEW_CONVERT_EXPR
:
3932 /* GCC 4.x is very sensitive to type consistency overall, and view
3933 conversions thus are very frequent. Even though just "convert"ing
3934 the inner operand to the output type is fine in most cases, it
3935 might expose unexpected input/output type mismatches in special
3936 circumstances so we avoid such recursive calls when we can. */
3937 tree op0
= TREE_OPERAND (expr
, 0);
3939 /* If we are converting back to the original type, we can just
3940 lift the input conversion. This is a common occurrence with
3941 switches back-and-forth amongst type variants. */
3942 if (type
== TREE_TYPE (op0
))
3945 /* Otherwise, if we're converting between two aggregate or vector
3946 types, we might be allowed to substitute the VIEW_CONVERT_EXPR
3947 target type in place or to just convert the inner expression. */
3948 if ((AGGREGATE_TYPE_P (type
) && AGGREGATE_TYPE_P (etype
))
3949 || (VECTOR_TYPE_P (type
) && VECTOR_TYPE_P (etype
)))
3951 /* If we are converting between mere variants, we can just
3952 substitute the VIEW_CONVERT_EXPR in place. */
3953 if (gnat_types_compatible_p (type
, etype
))
3954 return build1 (VIEW_CONVERT_EXPR
, type
, op0
);
3956 /* Otherwise, we may just bypass the input view conversion unless
3957 one of the types is a fat pointer, which is handled by
3958 specialized code below which relies on exact type matching. */
3959 else if (!TYPE_IS_FAT_POINTER_P (type
)
3960 && !TYPE_IS_FAT_POINTER_P (etype
))
3961 return convert (type
, op0
);
3970 /* Check for converting to a pointer to an unconstrained array. */
3971 if (TYPE_IS_FAT_POINTER_P (type
) && !TYPE_IS_FAT_POINTER_P (etype
))
3972 return convert_to_fat_pointer (type
, expr
);
3974 /* If we are converting between two aggregate or vector types that are mere
3975 variants, just make a VIEW_CONVERT_EXPR. Likewise when we are converting
3976 to a vector type from its representative array type. */
3977 else if ((code
== ecode
3978 && (AGGREGATE_TYPE_P (type
) || VECTOR_TYPE_P (type
))
3979 && gnat_types_compatible_p (type
, etype
))
3980 || (code
== VECTOR_TYPE
3981 && ecode
== ARRAY_TYPE
3982 && gnat_types_compatible_p (TYPE_REPRESENTATIVE_ARRAY (type
),
3984 return build1 (VIEW_CONVERT_EXPR
, type
, expr
);
3986 /* If we are converting between tagged types, try to upcast properly. */
3987 else if (ecode
== RECORD_TYPE
&& code
== RECORD_TYPE
3988 && TYPE_ALIGN_OK (etype
) && TYPE_ALIGN_OK (type
))
3990 tree child_etype
= etype
;
3992 tree field
= TYPE_FIELDS (child_etype
);
3993 if (DECL_NAME (field
) == parent_name_id
&& TREE_TYPE (field
) == type
)
3994 return build_component_ref (expr
, NULL_TREE
, field
, false);
3995 child_etype
= TREE_TYPE (field
);
3996 } while (TREE_CODE (child_etype
) == RECORD_TYPE
);
3999 /* In all other cases of related types, make a NOP_EXPR. */
4000 else if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (etype
))
4001 return fold_convert (type
, expr
);
4006 return fold_build1 (CONVERT_EXPR
, type
, expr
);
4009 if (TYPE_HAS_ACTUAL_BOUNDS_P (type
)
4010 && (ecode
== ARRAY_TYPE
|| ecode
== UNCONSTRAINED_ARRAY_TYPE
4011 || (ecode
== RECORD_TYPE
&& TYPE_CONTAINS_TEMPLATE_P (etype
))))
4012 return unchecked_convert (type
, expr
, false);
4013 else if (TYPE_BIASED_REPRESENTATION_P (type
))
4014 return fold_convert (type
,
4015 fold_build2 (MINUS_EXPR
, TREE_TYPE (type
),
4016 convert (TREE_TYPE (type
), expr
),
4017 TYPE_MIN_VALUE (type
)));
4019 /* ... fall through ... */
4023 /* If we are converting an additive expression to an integer type
4024 with lower precision, be wary of the optimization that can be
4025 applied by convert_to_integer. There are 2 problematic cases:
4026 - if the first operand was originally of a biased type,
4027 because we could be recursively called to convert it
4028 to an intermediate type and thus rematerialize the
4029 additive operator endlessly,
4030 - if the expression contains a placeholder, because an
4031 intermediate conversion that changes the sign could
4032 be inserted and thus introduce an artificial overflow
4033 at compile time when the placeholder is substituted. */
4034 if (code
== INTEGER_TYPE
4035 && ecode
== INTEGER_TYPE
4036 && TYPE_PRECISION (type
) < TYPE_PRECISION (etype
)
4037 && (TREE_CODE (expr
) == PLUS_EXPR
|| TREE_CODE (expr
) == MINUS_EXPR
))
4039 tree op0
= get_unwidened (TREE_OPERAND (expr
, 0), type
);
4041 if ((TREE_CODE (TREE_TYPE (op0
)) == INTEGER_TYPE
4042 && TYPE_BIASED_REPRESENTATION_P (TREE_TYPE (op0
)))
4043 || CONTAINS_PLACEHOLDER_P (expr
))
4044 return build1 (NOP_EXPR
, type
, expr
);
4047 return fold (convert_to_integer (type
, expr
));
4050 case REFERENCE_TYPE
:
4051 /* If converting between two pointers to records denoting
4052 both a template and type, adjust if needed to account
4053 for any differing offsets, since one might be negative. */
4054 if (TYPE_IS_THIN_POINTER_P (etype
) && TYPE_IS_THIN_POINTER_P (type
))
4057 = size_diffop (bit_position (TYPE_FIELDS (TREE_TYPE (etype
))),
4058 bit_position (TYPE_FIELDS (TREE_TYPE (type
))));
4060 = size_binop (CEIL_DIV_EXPR
, bit_diff
, sbitsize_unit_node
);
4061 expr
= build1 (NOP_EXPR
, type
, expr
);
4062 TREE_CONSTANT (expr
) = TREE_CONSTANT (TREE_OPERAND (expr
, 0));
4063 if (integer_zerop (byte_diff
))
4066 return build_binary_op (POINTER_PLUS_EXPR
, type
, expr
,
4067 fold (convert (sizetype
, byte_diff
)));
4070 /* If converting to a thin pointer, handle specially. */
4071 if (TYPE_IS_THIN_POINTER_P (type
)
4072 && TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (type
)))
4073 return convert_to_thin_pointer (type
, expr
);
4075 /* If converting fat pointer to normal pointer, get the pointer to the
4076 array and then convert it. */
4077 else if (TYPE_IS_FAT_POINTER_P (etype
))
4079 = build_component_ref (expr
, NULL_TREE
, TYPE_FIELDS (etype
), false);
4081 return fold (convert_to_pointer (type
, expr
));
4084 return fold (convert_to_real (type
, expr
));
4087 if (TYPE_JUSTIFIED_MODULAR_P (type
) && !AGGREGATE_TYPE_P (etype
))
4089 VEC(constructor_elt
,gc
) *v
= VEC_alloc (constructor_elt
, gc
, 1);
4091 CONSTRUCTOR_APPEND_ELT (v
, TYPE_FIELDS (type
),
4092 convert (TREE_TYPE (TYPE_FIELDS (type
)),
4094 return gnat_build_constructor (type
, v
);
4097 /* ... fall through ... */
4100 /* In these cases, assume the front-end has validated the conversion.
4101 If the conversion is valid, it will be a bit-wise conversion, so
4102 it can be viewed as an unchecked conversion. */
4103 return unchecked_convert (type
, expr
, false);
4106 /* This is a either a conversion between a tagged type and some
4107 subtype, which we have to mark as a UNION_TYPE because of
4108 overlapping fields or a conversion of an Unchecked_Union. */
4109 return unchecked_convert (type
, expr
, false);
4111 case UNCONSTRAINED_ARRAY_TYPE
:
4112 /* If the input is a VECTOR_TYPE, convert to the representative
4113 array type first. */
4114 if (ecode
== VECTOR_TYPE
)
4116 expr
= convert (TYPE_REPRESENTATIVE_ARRAY (etype
), expr
);
4117 etype
= TREE_TYPE (expr
);
4118 ecode
= TREE_CODE (etype
);
4121 /* If EXPR is a constrained array, take its address, convert it to a
4122 fat pointer, and then dereference it. Likewise if EXPR is a
4123 record containing both a template and a constrained array.
4124 Note that a record representing a justified modular type
4125 always represents a packed constrained array. */
4126 if (ecode
== ARRAY_TYPE
4127 || (ecode
== INTEGER_TYPE
&& TYPE_HAS_ACTUAL_BOUNDS_P (etype
))
4128 || (ecode
== RECORD_TYPE
&& TYPE_CONTAINS_TEMPLATE_P (etype
))
4129 || (ecode
== RECORD_TYPE
&& TYPE_JUSTIFIED_MODULAR_P (etype
)))
4132 (INDIRECT_REF
, NULL_TREE
,
4133 convert_to_fat_pointer (TREE_TYPE (type
),
4134 build_unary_op (ADDR_EXPR
,
4137 /* Do something very similar for converting one unconstrained
4138 array to another. */
4139 else if (ecode
== UNCONSTRAINED_ARRAY_TYPE
)
4141 build_unary_op (INDIRECT_REF
, NULL_TREE
,
4142 convert (TREE_TYPE (type
),
4143 build_unary_op (ADDR_EXPR
,
4149 return fold (convert_to_complex (type
, expr
));
4156 /* Remove all conversions that are done in EXP. This includes converting
4157 from a padded type or to a justified modular type. If TRUE_ADDRESS
4158 is true, always return the address of the containing object even if
4159 the address is not bit-aligned. */
4162 remove_conversions (tree exp
, bool true_address
)
4164 switch (TREE_CODE (exp
))
4168 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4169 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (exp
)))
4171 remove_conversions (VEC_index (constructor_elt
,
4172 CONSTRUCTOR_ELTS (exp
), 0)->value
,
4177 if (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (exp
, 0))))
4178 return remove_conversions (TREE_OPERAND (exp
, 0), true_address
);
4181 case VIEW_CONVERT_EXPR
: case NON_LVALUE_EXPR
:
4183 return remove_conversions (TREE_OPERAND (exp
, 0), true_address
);
4192 /* If EXP's type is an UNCONSTRAINED_ARRAY_TYPE, return an expression that
4193 refers to the underlying array. If it has TYPE_CONTAINS_TEMPLATE_P,
4194 likewise return an expression pointing to the underlying array. */
4197 maybe_unconstrained_array (tree exp
)
4199 enum tree_code code
= TREE_CODE (exp
);
4202 switch (TREE_CODE (TREE_TYPE (exp
)))
4204 case UNCONSTRAINED_ARRAY_TYPE
:
4205 if (code
== UNCONSTRAINED_ARRAY_REF
)
4207 new_exp
= TREE_OPERAND (exp
, 0);
4209 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
4210 build_component_ref (new_exp
, NULL_TREE
,
4212 (TREE_TYPE (new_exp
)),
4214 TREE_READONLY (new_exp
) = TREE_READONLY (exp
);
4218 else if (code
== NULL_EXPR
)
4219 return build1 (NULL_EXPR
,
4220 TREE_TYPE (TREE_TYPE (TYPE_FIELDS
4221 (TREE_TYPE (TREE_TYPE (exp
))))),
4222 TREE_OPERAND (exp
, 0));
4225 /* If this is a padded type, convert to the unpadded type and see if
4226 it contains a template. */
4227 if (TYPE_PADDING_P (TREE_TYPE (exp
)))
4229 new_exp
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp
))), exp
);
4230 if (TREE_CODE (TREE_TYPE (new_exp
)) == RECORD_TYPE
4231 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (new_exp
)))
4233 build_component_ref (new_exp
, NULL_TREE
,
4235 (TYPE_FIELDS (TREE_TYPE (new_exp
))),
4238 else if (TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (exp
)))
4240 build_component_ref (exp
, NULL_TREE
,
4241 DECL_CHAIN (TYPE_FIELDS (TREE_TYPE (exp
))),
4252 /* If EXP's type is a VECTOR_TYPE, return EXP converted to the associated
4253 TYPE_REPRESENTATIVE_ARRAY. */
4256 maybe_vector_array (tree exp
)
4258 tree etype
= TREE_TYPE (exp
);
4260 if (VECTOR_TYPE_P (etype
))
4261 exp
= convert (TYPE_REPRESENTATIVE_ARRAY (etype
), exp
);
4266 /* Return true if EXPR is an expression that can be folded as an operand
4267 of a VIEW_CONVERT_EXPR. See ada-tree.h for a complete rationale. */
4270 can_fold_for_view_convert_p (tree expr
)
4274 /* The folder will fold NOP_EXPRs between integral types with the same
4275 precision (in the middle-end's sense). We cannot allow it if the
4276 types don't have the same precision in the Ada sense as well. */
4277 if (TREE_CODE (expr
) != NOP_EXPR
)
4280 t1
= TREE_TYPE (expr
);
4281 t2
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4283 /* Defer to the folder for non-integral conversions. */
4284 if (!(INTEGRAL_TYPE_P (t1
) && INTEGRAL_TYPE_P (t2
)))
4287 /* Only fold conversions that preserve both precisions. */
4288 if (TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
)
4289 && operand_equal_p (rm_size (t1
), rm_size (t2
), 0))
4295 /* Return an expression that does an unchecked conversion of EXPR to TYPE.
4296 If NOTRUNC_P is true, truncation operations should be suppressed.
4298 Special care is required with (source or target) integral types whose
4299 precision is not equal to their size, to make sure we fetch or assign
4300 the value bits whose location might depend on the endianness, e.g.
4302 Rmsize : constant := 8;
4303 subtype Int is Integer range 0 .. 2 ** Rmsize - 1;
4305 type Bit_Array is array (1 .. Rmsize) of Boolean;
4306 pragma Pack (Bit_Array);
4308 function To_Bit_Array is new Unchecked_Conversion (Int, Bit_Array);
4310 Value : Int := 2#1000_0001#;
4311 Vbits : Bit_Array := To_Bit_Array (Value);
4313 we expect the 8 bits at Vbits'Address to always contain Value, while
4314 their original location depends on the endianness, at Value'Address
4315 on a little-endian architecture but not on a big-endian one. */
4318 unchecked_convert (tree type
, tree expr
, bool notrunc_p
)
4320 tree etype
= TREE_TYPE (expr
);
4321 enum tree_code ecode
= TREE_CODE (etype
);
4322 enum tree_code code
= TREE_CODE (type
);
4325 /* If the expression is already of the right type, we are done. */
4329 /* If both types types are integral just do a normal conversion.
4330 Likewise for a conversion to an unconstrained array. */
4331 if ((((INTEGRAL_TYPE_P (type
)
4332 && !(code
== INTEGER_TYPE
&& TYPE_VAX_FLOATING_POINT_P (type
)))
4333 || (POINTER_TYPE_P (type
) && ! TYPE_IS_THIN_POINTER_P (type
))
4334 || (code
== RECORD_TYPE
&& TYPE_JUSTIFIED_MODULAR_P (type
)))
4335 && ((INTEGRAL_TYPE_P (etype
)
4336 && !(ecode
== INTEGER_TYPE
&& TYPE_VAX_FLOATING_POINT_P (etype
)))
4337 || (POINTER_TYPE_P (etype
) && !TYPE_IS_THIN_POINTER_P (etype
))
4338 || (ecode
== RECORD_TYPE
&& TYPE_JUSTIFIED_MODULAR_P (etype
))))
4339 || code
== UNCONSTRAINED_ARRAY_TYPE
)
4341 if (ecode
== INTEGER_TYPE
&& TYPE_BIASED_REPRESENTATION_P (etype
))
4343 tree ntype
= copy_type (etype
);
4344 TYPE_BIASED_REPRESENTATION_P (ntype
) = 0;
4345 TYPE_MAIN_VARIANT (ntype
) = ntype
;
4346 expr
= build1 (NOP_EXPR
, ntype
, expr
);
4349 if (code
== INTEGER_TYPE
&& TYPE_BIASED_REPRESENTATION_P (type
))
4351 tree rtype
= copy_type (type
);
4352 TYPE_BIASED_REPRESENTATION_P (rtype
) = 0;
4353 TYPE_MAIN_VARIANT (rtype
) = rtype
;
4354 expr
= convert (rtype
, expr
);
4355 expr
= build1 (NOP_EXPR
, type
, expr
);
4358 expr
= convert (type
, expr
);
4361 /* If we are converting to an integral type whose precision is not equal
4362 to its size, first unchecked convert to a record that contains an
4363 object of the output type. Then extract the field. */
4364 else if (INTEGRAL_TYPE_P (type
)
4365 && TYPE_RM_SIZE (type
)
4366 && 0 != compare_tree_int (TYPE_RM_SIZE (type
),
4367 GET_MODE_BITSIZE (TYPE_MODE (type
))))
4369 tree rec_type
= make_node (RECORD_TYPE
);
4370 tree field
= create_field_decl (get_identifier ("OBJ"), type
, rec_type
,
4371 NULL_TREE
, NULL_TREE
, 1, 0);
4373 TYPE_FIELDS (rec_type
) = field
;
4374 layout_type (rec_type
);
4376 expr
= unchecked_convert (rec_type
, expr
, notrunc_p
);
4377 expr
= build_component_ref (expr
, NULL_TREE
, field
, false);
4380 /* Similarly if we are converting from an integral type whose precision
4381 is not equal to its size. */
4382 else if (INTEGRAL_TYPE_P (etype
)
4383 && TYPE_RM_SIZE (etype
)
4384 && 0 != compare_tree_int (TYPE_RM_SIZE (etype
),
4385 GET_MODE_BITSIZE (TYPE_MODE (etype
))))
4387 tree rec_type
= make_node (RECORD_TYPE
);
4388 tree field
= create_field_decl (get_identifier ("OBJ"), etype
, rec_type
,
4389 NULL_TREE
, NULL_TREE
, 1, 0);
4390 VEC(constructor_elt
,gc
) *v
= VEC_alloc (constructor_elt
, gc
, 1);
4392 TYPE_FIELDS (rec_type
) = field
;
4393 layout_type (rec_type
);
4395 CONSTRUCTOR_APPEND_ELT (v
, field
, expr
);
4396 expr
= gnat_build_constructor (rec_type
, v
);
4397 expr
= unchecked_convert (type
, expr
, notrunc_p
);
4400 /* If we are converting from a scalar type to a type with a different size,
4401 we need to pad to have the same size on both sides.
4403 ??? We cannot do it unconditionally because unchecked conversions are
4404 used liberally by the front-end to implement polymorphism, e.g. in:
4406 S191s : constant ada__tags__addr_ptr := ada__tags__addr_ptr!(S190s);
4407 return p___size__4 (p__object!(S191s.all));
4409 so we skip all expressions that are references. */
4410 else if (!REFERENCE_CLASS_P (expr
)
4411 && !AGGREGATE_TYPE_P (etype
)
4412 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4413 && (c
= tree_int_cst_compare (TYPE_SIZE (etype
), TYPE_SIZE (type
))))
4417 expr
= convert (maybe_pad_type (etype
, TYPE_SIZE (type
), 0, Empty
,
4418 false, false, false, true),
4420 expr
= unchecked_convert (type
, expr
, notrunc_p
);
4424 tree rec_type
= maybe_pad_type (type
, TYPE_SIZE (etype
), 0, Empty
,
4425 false, false, false, true);
4426 expr
= unchecked_convert (rec_type
, expr
, notrunc_p
);
4427 expr
= build_component_ref (expr
, NULL_TREE
, TYPE_FIELDS (rec_type
),
4432 /* We have a special case when we are converting between two unconstrained
4433 array types. In that case, take the address, convert the fat pointer
4434 types, and dereference. */
4435 else if (ecode
== code
&& code
== UNCONSTRAINED_ARRAY_TYPE
)
4436 expr
= build_unary_op (INDIRECT_REF
, NULL_TREE
,
4437 build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (type
),
4438 build_unary_op (ADDR_EXPR
, NULL_TREE
,
4441 /* Another special case is when we are converting to a vector type from its
4442 representative array type; this a regular conversion. */
4443 else if (code
== VECTOR_TYPE
4444 && ecode
== ARRAY_TYPE
4445 && gnat_types_compatible_p (TYPE_REPRESENTATIVE_ARRAY (type
),
4447 expr
= convert (type
, expr
);
4451 expr
= maybe_unconstrained_array (expr
);
4452 etype
= TREE_TYPE (expr
);
4453 ecode
= TREE_CODE (etype
);
4454 if (can_fold_for_view_convert_p (expr
))
4455 expr
= fold_build1 (VIEW_CONVERT_EXPR
, type
, expr
);
4457 expr
= build1 (VIEW_CONVERT_EXPR
, type
, expr
);
4460 /* If the result is an integral type whose precision is not equal to its
4461 size, sign- or zero-extend the result. We need not do this if the input
4462 is an integral type of the same precision and signedness or if the output
4463 is a biased type or if both the input and output are unsigned. */
4465 && INTEGRAL_TYPE_P (type
) && TYPE_RM_SIZE (type
)
4466 && !(code
== INTEGER_TYPE
&& TYPE_BIASED_REPRESENTATION_P (type
))
4467 && 0 != compare_tree_int (TYPE_RM_SIZE (type
),
4468 GET_MODE_BITSIZE (TYPE_MODE (type
)))
4469 && !(INTEGRAL_TYPE_P (etype
)
4470 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (etype
)
4471 && operand_equal_p (TYPE_RM_SIZE (type
),
4472 (TYPE_RM_SIZE (etype
) != 0
4473 ? TYPE_RM_SIZE (etype
) : TYPE_SIZE (etype
)),
4475 && !(TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (etype
)))
4478 = gnat_type_for_mode (TYPE_MODE (type
), TYPE_UNSIGNED (type
));
4480 = convert (base_type
,
4481 size_binop (MINUS_EXPR
,
4483 (GET_MODE_BITSIZE (TYPE_MODE (type
))),
4484 TYPE_RM_SIZE (type
)));
4487 build_binary_op (RSHIFT_EXPR
, base_type
,
4488 build_binary_op (LSHIFT_EXPR
, base_type
,
4489 convert (base_type
, expr
),
4494 /* An unchecked conversion should never raise Constraint_Error. The code
4495 below assumes that GCC's conversion routines overflow the same way that
4496 the underlying hardware does. This is probably true. In the rare case
4497 when it is false, we can rely on the fact that such conversions are
4498 erroneous anyway. */
4499 if (TREE_CODE (expr
) == INTEGER_CST
)
4500 TREE_OVERFLOW (expr
) = 0;
4502 /* If the sizes of the types differ and this is an VIEW_CONVERT_EXPR,
4503 show no longer constant. */
4504 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
4505 && !operand_equal_p (TYPE_SIZE_UNIT (type
), TYPE_SIZE_UNIT (etype
),
4507 TREE_CONSTANT (expr
) = 0;
4512 /* Return the appropriate GCC tree code for the specified GNAT_TYPE,
4513 the latter being a record type as predicated by Is_Record_Type. */
4516 tree_code_for_record_type (Entity_Id gnat_type
)
4518 Node_Id component_list
4519 = Component_List (Type_Definition
4521 (Implementation_Base_Type (gnat_type
))));
4524 /* Make this a UNION_TYPE unless it's either not an Unchecked_Union or
4525 we have a non-discriminant field outside a variant. In either case,
4526 it's a RECORD_TYPE. */
4528 if (!Is_Unchecked_Union (gnat_type
))
4531 for (component
= First_Non_Pragma (Component_Items (component_list
));
4532 Present (component
);
4533 component
= Next_Non_Pragma (component
))
4534 if (Ekind (Defining_Entity (component
)) == E_Component
)
4540 /* Return true if GNAT_TYPE is a "double" floating-point type, i.e. whose
4541 size is equal to 64 bits, or an array of such a type. Set ALIGN_CLAUSE
4542 according to the presence of an alignment clause on the type or, if it
4543 is an array, on the component type. */
4546 is_double_float_or_array (Entity_Id gnat_type
, bool *align_clause
)
4548 gnat_type
= Underlying_Type (gnat_type
);
4550 *align_clause
= Present (Alignment_Clause (gnat_type
));
4552 if (Is_Array_Type (gnat_type
))
4554 gnat_type
= Underlying_Type (Component_Type (gnat_type
));
4555 if (Present (Alignment_Clause (gnat_type
)))
4556 *align_clause
= true;
4559 if (!Is_Floating_Point_Type (gnat_type
))
4562 if (UI_To_Int (Esize (gnat_type
)) != 64)
4568 /* Return true if GNAT_TYPE is a "double" or larger scalar type, i.e. whose
4569 size is greater or equal to 64 bits, or an array of such a type. Set
4570 ALIGN_CLAUSE according to the presence of an alignment clause on the
4571 type or, if it is an array, on the component type. */
4574 is_double_scalar_or_array (Entity_Id gnat_type
, bool *align_clause
)
4576 gnat_type
= Underlying_Type (gnat_type
);
4578 *align_clause
= Present (Alignment_Clause (gnat_type
));
4580 if (Is_Array_Type (gnat_type
))
4582 gnat_type
= Underlying_Type (Component_Type (gnat_type
));
4583 if (Present (Alignment_Clause (gnat_type
)))
4584 *align_clause
= true;
4587 if (!Is_Scalar_Type (gnat_type
))
4590 if (UI_To_Int (Esize (gnat_type
)) < 64)
4596 /* Return true if GNU_TYPE is suitable as the type of a non-aliased
4597 component of an aggregate type. */
4600 type_for_nonaliased_component_p (tree gnu_type
)
4602 /* If the type is passed by reference, we may have pointers to the
4603 component so it cannot be made non-aliased. */
4604 if (must_pass_by_ref (gnu_type
) || default_pass_by_ref (gnu_type
))
4607 /* We used to say that any component of aggregate type is aliased
4608 because the front-end may take 'Reference of it. The front-end
4609 has been enhanced in the meantime so as to use a renaming instead
4610 in most cases, but the back-end can probably take the address of
4611 such a component too so we go for the conservative stance.
4613 For instance, we might need the address of any array type, even
4614 if normally passed by copy, to construct a fat pointer if the
4615 component is used as an actual for an unconstrained formal.
4617 Likewise for record types: even if a specific record subtype is
4618 passed by copy, the parent type might be passed by ref (e.g. if
4619 it's of variable size) and we might take the address of a child
4620 component to pass to a parent formal. We have no way to check
4621 for such conditions here. */
4622 if (AGGREGATE_TYPE_P (gnu_type
))
4628 /* Perform final processing on global variables. */
4631 gnat_write_global_declarations (void)
4633 /* Proceed to optimize and emit assembly.
4634 FIXME: shouldn't be the front end's responsibility to call this. */
4635 cgraph_finalize_compilation_unit ();
4637 /* Emit debug info for all global declarations. */
4638 emit_debug_global_declarations (VEC_address (tree
, global_decls
),
4639 VEC_length (tree
, global_decls
));
4642 /* ************************************************************************
4643 * * GCC builtins support *
4644 * ************************************************************************ */
4646 /* The general scheme is fairly simple:
4648 For each builtin function/type to be declared, gnat_install_builtins calls
4649 internal facilities which eventually get to gnat_push_decl, which in turn
4650 tracks the so declared builtin function decls in the 'builtin_decls' global
4651 datastructure. When an Intrinsic subprogram declaration is processed, we
4652 search this global datastructure to retrieve the associated BUILT_IN DECL
4655 /* Search the chain of currently available builtin declarations for a node
4656 corresponding to function NAME (an IDENTIFIER_NODE). Return the first node
4657 found, if any, or NULL_TREE otherwise. */
4659 builtin_decl_for (tree name
)
4664 FOR_EACH_VEC_ELT (tree
, builtin_decls
, i
, decl
)
4665 if (DECL_NAME (decl
) == name
)
4671 /* The code below eventually exposes gnat_install_builtins, which declares
4672 the builtin types and functions we might need, either internally or as
4673 user accessible facilities.
4675 ??? This is a first implementation shot, still in rough shape. It is
4676 heavily inspired from the "C" family implementation, with chunks copied
4677 verbatim from there.
4679 Two obvious TODO candidates are
4680 o Use a more efficient name/decl mapping scheme
4681 o Devise a middle-end infrastructure to avoid having to copy
4682 pieces between front-ends. */
4684 /* ----------------------------------------------------------------------- *
4685 * BUILTIN ELEMENTARY TYPES *
4686 * ----------------------------------------------------------------------- */
4688 /* Standard data types to be used in builtin argument declarations. */
4692 CTI_SIGNED_SIZE_TYPE
, /* For format checking only. */
4694 CTI_CONST_STRING_TYPE
,
4699 static tree c_global_trees
[CTI_MAX
];
4701 #define signed_size_type_node c_global_trees[CTI_SIGNED_SIZE_TYPE]
4702 #define string_type_node c_global_trees[CTI_STRING_TYPE]
4703 #define const_string_type_node c_global_trees[CTI_CONST_STRING_TYPE]
4705 /* ??? In addition some attribute handlers, we currently don't support a
4706 (small) number of builtin-types, which in turns inhibits support for a
4707 number of builtin functions. */
4708 #define wint_type_node void_type_node
4709 #define intmax_type_node void_type_node
4710 #define uintmax_type_node void_type_node
4712 /* Build the void_list_node (void_type_node having been created). */
4715 build_void_list_node (void)
4717 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
4721 /* Used to help initialize the builtin-types.def table. When a type of
4722 the correct size doesn't exist, use error_mark_node instead of NULL.
4723 The later results in segfaults even when a decl using the type doesn't
4727 builtin_type_for_size (int size
, bool unsignedp
)
4729 tree type
= gnat_type_for_size (size
, unsignedp
);
4730 return type
? type
: error_mark_node
;
4733 /* Build/push the elementary type decls that builtin functions/types
4737 install_builtin_elementary_types (void)
4739 signed_size_type_node
= gnat_signed_type (size_type_node
);
4740 pid_type_node
= integer_type_node
;
4741 void_list_node
= build_void_list_node ();
4743 string_type_node
= build_pointer_type (char_type_node
);
4744 const_string_type_node
4745 = build_pointer_type (build_qualified_type
4746 (char_type_node
, TYPE_QUAL_CONST
));
4749 /* ----------------------------------------------------------------------- *
4750 * BUILTIN FUNCTION TYPES *
4751 * ----------------------------------------------------------------------- */
4753 /* Now, builtin function types per se. */
4757 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4758 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4759 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4760 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4761 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4762 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4763 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4764 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4765 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4766 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4767 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4768 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4769 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4770 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4771 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4773 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4774 #include "builtin-types.def"
4775 #undef DEF_PRIMITIVE_TYPE
4776 #undef DEF_FUNCTION_TYPE_0
4777 #undef DEF_FUNCTION_TYPE_1
4778 #undef DEF_FUNCTION_TYPE_2
4779 #undef DEF_FUNCTION_TYPE_3
4780 #undef DEF_FUNCTION_TYPE_4
4781 #undef DEF_FUNCTION_TYPE_5
4782 #undef DEF_FUNCTION_TYPE_6
4783 #undef DEF_FUNCTION_TYPE_7
4784 #undef DEF_FUNCTION_TYPE_VAR_0
4785 #undef DEF_FUNCTION_TYPE_VAR_1
4786 #undef DEF_FUNCTION_TYPE_VAR_2
4787 #undef DEF_FUNCTION_TYPE_VAR_3
4788 #undef DEF_FUNCTION_TYPE_VAR_4
4789 #undef DEF_FUNCTION_TYPE_VAR_5
4790 #undef DEF_POINTER_TYPE
4794 typedef enum c_builtin_type builtin_type
;
4796 /* A temporary array used in communication with def_fn_type. */
4797 static GTY(()) tree builtin_types
[(int) BT_LAST
+ 1];
4799 /* A helper function for install_builtin_types. Build function type
4800 for DEF with return type RET and N arguments. If VAR is true, then the
4801 function should be variadic after those N arguments.
4803 Takes special care not to ICE if any of the types involved are
4804 error_mark_node, which indicates that said type is not in fact available
4805 (see builtin_type_for_size). In which case the function type as a whole
4806 should be error_mark_node. */
4809 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
4811 tree args
= NULL
, t
;
4816 for (i
= 0; i
< n
; ++i
)
4818 builtin_type a
= (builtin_type
) va_arg (list
, int);
4819 t
= builtin_types
[a
];
4820 if (t
== error_mark_node
)
4822 args
= tree_cons (NULL_TREE
, t
, args
);
4826 args
= nreverse (args
);
4828 args
= chainon (args
, void_list_node
);
4830 t
= builtin_types
[ret
];
4831 if (t
== error_mark_node
)
4833 t
= build_function_type (t
, args
);
4836 builtin_types
[def
] = t
;
4839 /* Build the builtin function types and install them in the builtin_types
4840 array for later use in builtin function decls. */
4843 install_builtin_function_types (void)
4845 tree va_list_ref_type_node
;
4846 tree va_list_arg_type_node
;
4848 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4850 va_list_arg_type_node
= va_list_ref_type_node
=
4851 build_pointer_type (TREE_TYPE (va_list_type_node
));
4855 va_list_arg_type_node
= va_list_type_node
;
4856 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4859 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4860 builtin_types[ENUM] = VALUE;
4861 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4862 def_fn_type (ENUM, RETURN, 0, 0);
4863 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4864 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4865 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4866 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4867 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4868 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4869 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4870 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4871 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4872 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4873 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4875 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4876 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4878 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4879 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4880 def_fn_type (ENUM, RETURN, 1, 0);
4881 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4882 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4883 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4884 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4885 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4886 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4887 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4888 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4889 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4890 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4891 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4892 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4894 #include "builtin-types.def"
4896 #undef DEF_PRIMITIVE_TYPE
4897 #undef DEF_FUNCTION_TYPE_1
4898 #undef DEF_FUNCTION_TYPE_2
4899 #undef DEF_FUNCTION_TYPE_3
4900 #undef DEF_FUNCTION_TYPE_4
4901 #undef DEF_FUNCTION_TYPE_5
4902 #undef DEF_FUNCTION_TYPE_6
4903 #undef DEF_FUNCTION_TYPE_VAR_0
4904 #undef DEF_FUNCTION_TYPE_VAR_1
4905 #undef DEF_FUNCTION_TYPE_VAR_2
4906 #undef DEF_FUNCTION_TYPE_VAR_3
4907 #undef DEF_FUNCTION_TYPE_VAR_4
4908 #undef DEF_FUNCTION_TYPE_VAR_5
4909 #undef DEF_POINTER_TYPE
4910 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4913 /* ----------------------------------------------------------------------- *
4914 * BUILTIN ATTRIBUTES *
4915 * ----------------------------------------------------------------------- */
4917 enum built_in_attribute
4919 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4920 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4921 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4922 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4923 #include "builtin-attrs.def"
4924 #undef DEF_ATTR_NULL_TREE
4926 #undef DEF_ATTR_IDENT
4927 #undef DEF_ATTR_TREE_LIST
4931 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
4934 install_builtin_attributes (void)
4936 /* Fill in the built_in_attributes array. */
4937 #define DEF_ATTR_NULL_TREE(ENUM) \
4938 built_in_attributes[(int) ENUM] = NULL_TREE;
4939 #define DEF_ATTR_INT(ENUM, VALUE) \
4940 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4941 #define DEF_ATTR_IDENT(ENUM, STRING) \
4942 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4943 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4944 built_in_attributes[(int) ENUM] \
4945 = tree_cons (built_in_attributes[(int) PURPOSE], \
4946 built_in_attributes[(int) VALUE], \
4947 built_in_attributes[(int) CHAIN]);
4948 #include "builtin-attrs.def"
4949 #undef DEF_ATTR_NULL_TREE
4951 #undef DEF_ATTR_IDENT
4952 #undef DEF_ATTR_TREE_LIST
4955 /* Handle a "const" attribute; arguments as in
4956 struct attribute_spec.handler. */
4959 handle_const_attribute (tree
*node
, tree
ARG_UNUSED (name
),
4960 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
4963 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4964 TREE_READONLY (*node
) = 1;
4966 *no_add_attrs
= true;
4971 /* Handle a "nothrow" attribute; arguments as in
4972 struct attribute_spec.handler. */
4975 handle_nothrow_attribute (tree
*node
, tree
ARG_UNUSED (name
),
4976 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
4979 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4980 TREE_NOTHROW (*node
) = 1;
4982 *no_add_attrs
= true;
4987 /* Handle a "pure" attribute; arguments as in
4988 struct attribute_spec.handler. */
4991 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4992 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4994 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4995 DECL_PURE_P (*node
) = 1;
4996 /* ??? TODO: Support types. */
4999 warning (OPT_Wattributes
, "%qs attribute ignored",
5000 IDENTIFIER_POINTER (name
));
5001 *no_add_attrs
= true;
5007 /* Handle a "no vops" attribute; arguments as in
5008 struct attribute_spec.handler. */
5011 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5012 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5013 bool *ARG_UNUSED (no_add_attrs
))
5015 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5016 DECL_IS_NOVOPS (*node
) = 1;
5020 /* Helper for nonnull attribute handling; fetch the operand number
5021 from the attribute argument list. */
5024 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5026 /* Verify the arg number is a constant. */
5027 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5028 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5031 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5035 /* Handle the "nonnull" attribute. */
5037 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5038 tree args
, int ARG_UNUSED (flags
),
5042 unsigned HOST_WIDE_INT attr_arg_num
;
5044 /* If no arguments are specified, all pointer arguments should be
5045 non-null. Verify a full prototype is given so that the arguments
5046 will have the correct types when we actually check them later. */
5049 if (!TYPE_ARG_TYPES (type
))
5051 error ("nonnull attribute without arguments on a non-prototype");
5052 *no_add_attrs
= true;
5057 /* Argument list specified. Verify that each argument number references
5058 a pointer argument. */
5059 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5062 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5064 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5066 error ("nonnull argument has invalid operand number (argument %lu)",
5067 (unsigned long) attr_arg_num
);
5068 *no_add_attrs
= true;
5072 argument
= TYPE_ARG_TYPES (type
);
5075 for (ck_num
= 1; ; ck_num
++)
5077 if (!argument
|| ck_num
== arg_num
)
5079 argument
= TREE_CHAIN (argument
);
5083 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5085 error ("nonnull argument with out-of-range operand number "
5086 "(argument %lu, operand %lu)",
5087 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5088 *no_add_attrs
= true;
5092 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5094 error ("nonnull argument references non-pointer operand "
5095 "(argument %lu, operand %lu)",
5096 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5097 *no_add_attrs
= true;
5106 /* Handle a "sentinel" attribute. */
5109 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
5110 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5112 tree params
= TYPE_ARG_TYPES (*node
);
5116 warning (OPT_Wattributes
,
5117 "%qs attribute requires prototypes with named arguments",
5118 IDENTIFIER_POINTER (name
));
5119 *no_add_attrs
= true;
5123 while (TREE_CHAIN (params
))
5124 params
= TREE_CHAIN (params
);
5126 if (VOID_TYPE_P (TREE_VALUE (params
)))
5128 warning (OPT_Wattributes
,
5129 "%qs attribute only applies to variadic functions",
5130 IDENTIFIER_POINTER (name
));
5131 *no_add_attrs
= true;
5137 tree position
= TREE_VALUE (args
);
5139 if (TREE_CODE (position
) != INTEGER_CST
)
5141 warning (0, "requested position is not an integer constant");
5142 *no_add_attrs
= true;
5146 if (tree_int_cst_lt (position
, integer_zero_node
))
5148 warning (0, "requested position is less than zero");
5149 *no_add_attrs
= true;
5157 /* Handle a "noreturn" attribute; arguments as in
5158 struct attribute_spec.handler. */
5161 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5162 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5164 tree type
= TREE_TYPE (*node
);
5166 /* See FIXME comment in c_common_attribute_table. */
5167 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5168 TREE_THIS_VOLATILE (*node
) = 1;
5169 else if (TREE_CODE (type
) == POINTER_TYPE
5170 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5172 = build_pointer_type
5173 (build_type_variant (TREE_TYPE (type
),
5174 TYPE_READONLY (TREE_TYPE (type
)), 1));
5177 warning (OPT_Wattributes
, "%qs attribute ignored",
5178 IDENTIFIER_POINTER (name
));
5179 *no_add_attrs
= true;
5185 /* Handle a "malloc" attribute; arguments as in
5186 struct attribute_spec.handler. */
5189 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5190 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5192 if (TREE_CODE (*node
) == FUNCTION_DECL
5193 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
5194 DECL_IS_MALLOC (*node
) = 1;
5197 warning (OPT_Wattributes
, "%qs attribute ignored",
5198 IDENTIFIER_POINTER (name
));
5199 *no_add_attrs
= true;
5205 /* Fake handler for attributes we don't properly support. */
5208 fake_attribute_handler (tree
* ARG_UNUSED (node
),
5209 tree
ARG_UNUSED (name
),
5210 tree
ARG_UNUSED (args
),
5211 int ARG_UNUSED (flags
),
5212 bool * ARG_UNUSED (no_add_attrs
))
5217 /* Handle a "type_generic" attribute. */
5220 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5221 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5222 bool * ARG_UNUSED (no_add_attrs
))
5226 /* Ensure we have a function type. */
5227 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
5229 params
= TYPE_ARG_TYPES (*node
);
5230 while (params
&& ! VOID_TYPE_P (TREE_VALUE (params
)))
5231 params
= TREE_CHAIN (params
);
5233 /* Ensure we have a variadic function. */
5234 gcc_assert (!params
);
5239 /* Handle a "vector_size" attribute; arguments as in
5240 struct attribute_spec.handler. */
5243 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5244 int ARG_UNUSED (flags
),
5247 unsigned HOST_WIDE_INT vecsize
, nunits
;
5248 enum machine_mode orig_mode
;
5249 tree type
= *node
, new_type
, size
;
5251 *no_add_attrs
= true;
5253 size
= TREE_VALUE (args
);
5255 if (!host_integerp (size
, 1))
5257 warning (OPT_Wattributes
, "%qs attribute ignored",
5258 IDENTIFIER_POINTER (name
));
5262 /* Get the vector size (in bytes). */
5263 vecsize
= tree_low_cst (size
, 1);
5265 /* We need to provide for vector pointers, vector arrays, and
5266 functions returning vectors. For example:
5268 __attribute__((vector_size(16))) short *foo;
5270 In this case, the mode is SI, but the type being modified is
5271 HI, so we need to look further. */
5273 while (POINTER_TYPE_P (type
)
5274 || TREE_CODE (type
) == FUNCTION_TYPE
5275 || TREE_CODE (type
) == METHOD_TYPE
5276 || TREE_CODE (type
) == ARRAY_TYPE
5277 || TREE_CODE (type
) == OFFSET_TYPE
)
5278 type
= TREE_TYPE (type
);
5280 /* Get the mode of the type being modified. */
5281 orig_mode
= TYPE_MODE (type
);
5283 if ((!INTEGRAL_TYPE_P (type
)
5284 && !SCALAR_FLOAT_TYPE_P (type
)
5285 && !FIXED_POINT_TYPE_P (type
))
5286 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
5287 && GET_MODE_CLASS (orig_mode
) != MODE_INT
5288 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
5289 || !host_integerp (TYPE_SIZE_UNIT (type
), 1)
5290 || TREE_CODE (type
) == BOOLEAN_TYPE
)
5292 error ("invalid vector type for attribute %qs",
5293 IDENTIFIER_POINTER (name
));
5297 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
5299 error ("vector size not an integral multiple of component size");
5305 error ("zero vector size");
5309 /* Calculate how many units fit in the vector. */
5310 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5311 if (nunits
& (nunits
- 1))
5313 error ("number of components of the vector not a power of two");
5317 new_type
= build_vector_type (type
, nunits
);
5319 /* Build back pointers if needed. */
5320 *node
= reconstruct_complex_type (*node
, new_type
);
5325 /* Handle a "vector_type" attribute; arguments as in
5326 struct attribute_spec.handler. */
5329 handle_vector_type_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5330 int ARG_UNUSED (flags
),
5333 /* Vector representative type and size. */
5334 tree rep_type
= *node
;
5335 tree rep_size
= TYPE_SIZE_UNIT (rep_type
);
5338 /* Vector size in bytes and number of units. */
5339 unsigned HOST_WIDE_INT vec_bytes
, vec_units
;
5341 /* Vector element type and mode. */
5343 enum machine_mode elem_mode
;
5345 *no_add_attrs
= true;
5347 /* Get the representative array type, possibly nested within a
5348 padding record e.g. for alignment purposes. */
5350 if (TYPE_IS_PADDING_P (rep_type
))
5351 rep_type
= TREE_TYPE (TYPE_FIELDS (rep_type
));
5353 if (TREE_CODE (rep_type
) != ARRAY_TYPE
)
5355 error ("attribute %qs applies to array types only",
5356 IDENTIFIER_POINTER (name
));
5360 /* Silently punt on variable sizes. We can't make vector types for them,
5361 need to ignore them on front-end generated subtypes of unconstrained
5362 bases, and this attribute is for binding implementors, not end-users, so
5363 we should never get there from legitimate explicit uses. */
5365 if (!host_integerp (rep_size
, 1))
5368 /* Get the element type/mode and check this is something we know
5369 how to make vectors of. */
5371 elem_type
= TREE_TYPE (rep_type
);
5372 elem_mode
= TYPE_MODE (elem_type
);
5374 if ((!INTEGRAL_TYPE_P (elem_type
)
5375 && !SCALAR_FLOAT_TYPE_P (elem_type
)
5376 && !FIXED_POINT_TYPE_P (elem_type
))
5377 || (!SCALAR_FLOAT_MODE_P (elem_mode
)
5378 && GET_MODE_CLASS (elem_mode
) != MODE_INT
5379 && !ALL_SCALAR_FIXED_POINT_MODE_P (elem_mode
))
5380 || !host_integerp (TYPE_SIZE_UNIT (elem_type
), 1))
5382 error ("invalid element type for attribute %qs",
5383 IDENTIFIER_POINTER (name
));
5387 /* Sanity check the vector size and element type consistency. */
5389 vec_bytes
= tree_low_cst (rep_size
, 1);
5391 if (vec_bytes
% tree_low_cst (TYPE_SIZE_UNIT (elem_type
), 1))
5393 error ("vector size not an integral multiple of component size");
5399 error ("zero vector size");
5403 vec_units
= vec_bytes
/ tree_low_cst (TYPE_SIZE_UNIT (elem_type
), 1);
5404 if (vec_units
& (vec_units
- 1))
5406 error ("number of components of the vector not a power of two");
5410 /* Build the vector type and replace. */
5412 *node
= build_vector_type (elem_type
, vec_units
);
5413 rep_name
= TYPE_NAME (rep_type
);
5414 if (TREE_CODE (rep_name
) == TYPE_DECL
)
5415 rep_name
= DECL_NAME (rep_name
);
5416 TYPE_NAME (*node
) = rep_name
;
5417 TYPE_REPRESENTATIVE_ARRAY (*node
) = rep_type
;
5422 /* ----------------------------------------------------------------------- *
5423 * BUILTIN FUNCTIONS *
5424 * ----------------------------------------------------------------------- */
5426 /* Worker for DEF_BUILTIN. Possibly define a builtin function with one or two
5427 names. Does not declare a non-__builtin_ function if flag_no_builtin, or
5428 if nonansi_p and flag_no_nonansi_builtin. */
5431 def_builtin_1 (enum built_in_function fncode
,
5433 enum built_in_class fnclass
,
5434 tree fntype
, tree libtype
,
5435 bool both_p
, bool fallback_p
,
5436 bool nonansi_p ATTRIBUTE_UNUSED
,
5437 tree fnattrs
, bool implicit_p
)
5440 const char *libname
;
5442 /* Preserve an already installed decl. It most likely was setup in advance
5443 (e.g. as part of the internal builtins) for specific reasons. */
5444 if (built_in_decls
[(int) fncode
] != NULL_TREE
)
5447 gcc_assert ((!both_p
&& !fallback_p
)
5448 || !strncmp (name
, "__builtin_",
5449 strlen ("__builtin_")));
5451 libname
= name
+ strlen ("__builtin_");
5452 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
5453 (fallback_p
? libname
: NULL
),
5456 /* ??? This is normally further controlled by command-line options
5457 like -fno-builtin, but we don't have them for Ada. */
5458 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
5461 built_in_decls
[(int) fncode
] = decl
;
5463 implicit_built_in_decls
[(int) fncode
] = decl
;
5466 static int flag_isoc94
= 0;
5467 static int flag_isoc99
= 0;
5469 /* Install what the common builtins.def offers. */
5472 install_builtin_functions (void)
5474 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5475 NONANSI_P, ATTRS, IMPLICIT, COND) \
5477 def_builtin_1 (ENUM, NAME, CLASS, \
5478 builtin_types[(int) TYPE], \
5479 builtin_types[(int) LIBTYPE], \
5480 BOTH_P, FALLBACK_P, NONANSI_P, \
5481 built_in_attributes[(int) ATTRS], IMPLICIT);
5482 #include "builtins.def"
5486 /* ----------------------------------------------------------------------- *
5487 * BUILTIN FUNCTIONS *
5488 * ----------------------------------------------------------------------- */
5490 /* Install the builtin functions we might need. */
5493 gnat_install_builtins (void)
5495 install_builtin_elementary_types ();
5496 install_builtin_function_types ();
5497 install_builtin_attributes ();
5499 /* Install builtins used by generic middle-end pieces first. Some of these
5500 know about internal specificities and control attributes accordingly, for
5501 instance __builtin_alloca vs no-throw and -fstack-check. We will ignore
5502 the generic definition from builtins.def. */
5503 build_common_builtin_nodes ();
5505 /* Now, install the target specific builtins, such as the AltiVec family on
5506 ppc, and the common set as exposed by builtins.def. */
5507 targetm
.init_builtins ();
5508 install_builtin_functions ();
5511 #include "gt-ada-utils.h"
5512 #include "gtype-ada.h"