1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2012, 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 distributed with GNAT; see 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"
34 #include "libfuncs.h" /* For set_stack_check_libfunc. */
35 #include "tree-iterator.h"
41 #include "adadecode.h"
58 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
59 for fear of running out of stack space. If we need more, we use xmalloc
61 #define ALLOCA_THRESHOLD 1000
63 /* Let code below know whether we are targetting VMS without need of
64 intrusive preprocessor directives. */
65 #ifndef TARGET_ABI_OPEN_VMS
66 #define TARGET_ABI_OPEN_VMS 0
69 /* In configurations where blocks have no end_locus attached, just
70 sink assignments into a dummy global. */
71 #ifndef BLOCK_SOURCE_END_LOCATION
72 static location_t block_end_locus_sink;
73 #define BLOCK_SOURCE_END_LOCATION(BLOCK) block_end_locus_sink
76 /* For efficient float-to-int rounding, it is necessary to know whether
77 floating-point arithmetic may use wider intermediate results. When
78 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
79 that arithmetic does not widen if double precision is emulated. */
80 #ifndef FP_ARITH_MAY_WIDEN
81 #if defined(HAVE_extendsfdf2)
82 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
84 #define FP_ARITH_MAY_WIDEN 0
88 /* Pointers to front-end tables accessed through macros. */
89 struct Node *Nodes_Ptr;
90 Node_Id *Next_Node_Ptr;
91 Node_Id *Prev_Node_Ptr;
92 struct Elist_Header *Elists_Ptr;
93 struct Elmt_Item *Elmts_Ptr;
94 struct String_Entry *Strings_Ptr;
95 Char_Code *String_Chars_Ptr;
96 struct List_Header *List_Headers_Ptr;
98 /* Highest number in the front-end node table. */
101 /* Current node being treated, in case abort called. */
102 Node_Id error_gnat_node;
104 /* True when gigi is being called on an analyzed but unexpanded
105 tree, and the only purpose of the call is to properly annotate
106 types with representation information. */
107 bool type_annotate_only;
109 /* Current filename without path. */
110 const char *ref_filename;
112 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
113 of unconstrained array IN parameters to avoid emitting a great deal of
114 redundant instructions to recompute them each time. */
115 struct GTY (()) parm_attr_d {
116 int id; /* GTY doesn't like Entity_Id. */
123 typedef struct parm_attr_d *parm_attr;
125 DEF_VEC_P(parm_attr);
126 DEF_VEC_ALLOC_P(parm_attr,gc);
128 struct GTY(()) language_function {
129 VEC(parm_attr,gc) *parm_attr_cache;
130 bitmap named_ret_val;
131 VEC(tree,gc) *other_ret_val;
135 #define f_parm_attr_cache \
136 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
138 #define f_named_ret_val \
139 DECL_STRUCT_FUNCTION (current_function_decl)->language->named_ret_val
141 #define f_other_ret_val \
142 DECL_STRUCT_FUNCTION (current_function_decl)->language->other_ret_val
145 DECL_STRUCT_FUNCTION (current_function_decl)->language->gnat_ret
147 /* A structure used to gather together information about a statement group.
148 We use this to gather related statements, for example the "then" part
149 of a IF. In the case where it represents a lexical scope, we may also
150 have a BLOCK node corresponding to it and/or cleanups. */
152 struct GTY((chain_next ("%h.previous"))) stmt_group {
153 struct stmt_group *previous; /* Previous code group. */
154 tree stmt_list; /* List of statements for this code group. */
155 tree block; /* BLOCK for this code group, if any. */
156 tree cleanups; /* Cleanups for this code group, if any. */
159 static GTY(()) struct stmt_group *current_stmt_group;
161 /* List of unused struct stmt_group nodes. */
162 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
164 /* A structure used to record information on elaboration procedures
165 we've made and need to process.
167 ??? gnat_node should be Node_Id, but gengtype gets confused. */
169 struct GTY((chain_next ("%h.next"))) elab_info {
170 struct elab_info *next; /* Pointer to next in chain. */
171 tree elab_proc; /* Elaboration procedure. */
172 int gnat_node; /* The N_Compilation_Unit. */
175 static GTY(()) struct elab_info *elab_info_list;
177 /* Stack of exception pointer variables. Each entry is the VAR_DECL
178 that stores the address of the raised exception. Nonzero means we
179 are in an exception handler. Not used in the zero-cost case. */
180 static GTY(()) VEC(tree,gc) *gnu_except_ptr_stack;
182 /* In ZCX case, current exception pointer. Used to re-raise it. */
183 static GTY(()) tree gnu_incoming_exc_ptr;
185 /* Stack for storing the current elaboration procedure decl. */
186 static GTY(()) VEC(tree,gc) *gnu_elab_proc_stack;
188 /* Stack of labels to be used as a goto target instead of a return in
189 some functions. See processing for N_Subprogram_Body. */
190 static GTY(()) VEC(tree,gc) *gnu_return_label_stack;
192 /* Stack of variable for the return value of a function with copy-in/copy-out
193 parameters. See processing for N_Subprogram_Body. */
194 static GTY(()) VEC(tree,gc) *gnu_return_var_stack;
196 /* Structure used to record information for a range check. */
197 struct GTY(()) range_check_info_d {
204 typedef struct range_check_info_d *range_check_info;
206 DEF_VEC_P(range_check_info);
207 DEF_VEC_ALLOC_P(range_check_info,gc);
209 /* Structure used to record information for a loop. */
210 struct GTY(()) loop_info_d {
213 VEC(range_check_info,gc) *checks;
216 typedef struct loop_info_d *loop_info;
218 DEF_VEC_P(loop_info);
219 DEF_VEC_ALLOC_P(loop_info,gc);
221 /* Stack of loop_info structures associated with LOOP_STMT nodes. */
222 static GTY(()) VEC(loop_info,gc) *gnu_loop_stack;
224 /* The stacks for N_{Push,Pop}_*_Label. */
225 static GTY(()) VEC(tree,gc) *gnu_constraint_error_label_stack;
226 static GTY(()) VEC(tree,gc) *gnu_storage_error_label_stack;
227 static GTY(()) VEC(tree,gc) *gnu_program_error_label_stack;
229 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
230 static enum tree_code gnu_codes[Number_Node_Kinds];
232 static void init_code_table (void);
233 static void Compilation_Unit_to_gnu (Node_Id);
234 static void record_code_position (Node_Id);
235 static void insert_code_for (Node_Id);
236 static void add_cleanup (tree, Node_Id);
237 static void add_stmt_list (List_Id);
238 static void push_exception_label_stack (VEC(tree,gc) **, Entity_Id);
239 static tree build_stmt_group (List_Id, bool);
240 static enum gimplify_status gnat_gimplify_stmt (tree *);
241 static void elaborate_all_entities (Node_Id);
242 static void process_freeze_entity (Node_Id);
243 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
244 static tree emit_range_check (tree, Node_Id, Node_Id);
245 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
246 static tree emit_check (tree, tree, int, Node_Id);
247 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
248 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
249 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
250 static bool addressable_p (tree, tree);
251 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
252 static tree extract_values (tree, tree);
253 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
254 static tree maybe_implicit_deref (tree);
255 static void set_expr_location_from_node (tree, Node_Id);
256 static bool set_end_locus_from_node (tree, Node_Id);
257 static void set_gnu_expr_location_from_node (tree, Node_Id);
258 static int lvalue_required_p (Node_Id, tree, bool, bool, bool);
259 static tree build_raise_check (int, enum exception_info_kind);
260 static tree create_init_temporary (const char *, tree, tree *, Node_Id);
262 /* Hooks for debug info back-ends, only supported and used in a restricted set
263 of configurations. */
264 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
265 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
267 /* This is the main program of the back-end. It sets up all the table
268 structures and then generates code. */
271 gigi (Node_Id gnat_root, int max_gnat_node, int number_name ATTRIBUTE_UNUSED,
272 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
273 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
274 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
275 struct List_Header *list_headers_ptr, Nat number_file,
276 struct File_Info_Type *file_info_ptr,
277 Entity_Id standard_boolean, Entity_Id standard_integer,
278 Entity_Id standard_character, Entity_Id standard_long_long_float,
279 Entity_Id standard_exception_type, Int gigi_operating_mode)
281 Entity_Id gnat_literal;
282 tree long_long_float_type, exception_type, t, ftype;
283 tree int64_type = gnat_type_for_size (64, 0);
284 struct elab_info *info;
287 max_gnat_nodes = max_gnat_node;
289 Nodes_Ptr = nodes_ptr;
290 Next_Node_Ptr = next_node_ptr;
291 Prev_Node_Ptr = prev_node_ptr;
292 Elists_Ptr = elists_ptr;
293 Elmts_Ptr = elmts_ptr;
294 Strings_Ptr = strings_ptr;
295 String_Chars_Ptr = string_chars_ptr;
296 List_Headers_Ptr = list_headers_ptr;
298 type_annotate_only = (gigi_operating_mode == 1);
300 for (i = 0; i < number_file; i++)
302 /* Use the identifier table to make a permanent copy of the filename as
303 the name table gets reallocated after Gigi returns but before all the
304 debugging information is output. The __gnat_to_canonical_file_spec
305 call translates filenames from pragmas Source_Reference that contain
306 host style syntax not understood by gdb. */
310 (__gnat_to_canonical_file_spec
311 (Get_Name_String (file_info_ptr[i].File_Name))));
313 /* We rely on the order isomorphism between files and line maps. */
314 gcc_assert ((int) LINEMAPS_ORDINARY_USED (line_table) == i);
316 /* We create the line map for a source file at once, with a fixed number
317 of columns chosen to avoid jumping over the next power of 2. */
318 linemap_add (line_table, LC_ENTER, 0, filename, 1);
319 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
320 linemap_position_for_column (line_table, 252 - 1);
321 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
324 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
326 /* Declare the name of the compilation unit as the first global
327 name in order to make the middle-end fully deterministic. */
328 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
329 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
331 /* Initialize ourselves. */
336 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
338 if (type_annotate_only)
340 TYPE_SIZE (void_type_node) = bitsize_zero_node;
341 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
344 /* Enable GNAT stack checking method if needed */
345 if (!Stack_Check_Probes_On_Target)
346 set_stack_check_libfunc ("_gnat_stack_check");
348 /* Retrieve alignment settings. */
349 double_float_alignment = get_target_double_float_alignment ();
350 double_scalar_alignment = get_target_double_scalar_alignment ();
352 /* Record the builtin types. Define `integer' and `character' first so that
353 dbx will output them first. */
354 record_builtin_type ("integer", integer_type_node, false);
355 record_builtin_type ("character", unsigned_char_type_node, false);
356 record_builtin_type ("boolean", boolean_type_node, false);
357 record_builtin_type ("void", void_type_node, false);
359 /* Save the type we made for integer as the type for Standard.Integer. */
360 save_gnu_tree (Base_Type (standard_integer),
361 TYPE_NAME (integer_type_node),
364 /* Likewise for character as the type for Standard.Character. */
365 save_gnu_tree (Base_Type (standard_character),
366 TYPE_NAME (unsigned_char_type_node),
369 /* Likewise for boolean as the type for Standard.Boolean. */
370 save_gnu_tree (Base_Type (standard_boolean),
371 TYPE_NAME (boolean_type_node),
373 gnat_literal = First_Literal (Base_Type (standard_boolean));
374 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
375 gcc_assert (t == boolean_false_node);
376 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
377 boolean_type_node, t, true, false, false, false,
379 DECL_IGNORED_P (t) = 1;
380 save_gnu_tree (gnat_literal, t, false);
381 gnat_literal = Next_Literal (gnat_literal);
382 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
383 gcc_assert (t == boolean_true_node);
384 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
385 boolean_type_node, t, true, false, false, false,
387 DECL_IGNORED_P (t) = 1;
388 save_gnu_tree (gnat_literal, t, false);
390 void_ftype = build_function_type_list (void_type_node, NULL_TREE);
391 ptr_void_ftype = build_pointer_type (void_ftype);
393 /* Now declare run-time functions. */
394 ftype = build_function_type_list (ptr_void_type_node, sizetype, NULL_TREE);
396 /* malloc is a function declaration tree for a function to allocate
399 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
400 ftype, NULL_TREE, false, true, true, true, NULL,
402 DECL_IS_MALLOC (malloc_decl) = 1;
404 /* malloc32 is a function declaration tree for a function to allocate
405 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
407 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
408 ftype, NULL_TREE, false, true, true, true, NULL,
410 DECL_IS_MALLOC (malloc32_decl) = 1;
412 /* free is a function declaration tree for a function to free memory. */
414 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
415 build_function_type_list (void_type_node,
418 NULL_TREE, false, true, true, true, NULL, Empty);
420 /* This is used for 64-bit multiplication with overflow checking. */
422 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
423 build_function_type_list (int64_type, int64_type,
424 int64_type, NULL_TREE),
425 NULL_TREE, false, true, true, true, NULL, Empty);
427 /* Name of the _Parent field in tagged record types. */
428 parent_name_id = get_identifier (Get_Name_String (Name_uParent));
430 /* Name of the Exception_Data type defined in System.Standard_Library. */
431 exception_data_name_id
432 = get_identifier ("system__standard_library__exception_data");
434 /* Make the types and functions used for exception processing. */
436 = build_array_type (gnat_type_for_mode (Pmode, 0),
437 build_index_type (size_int (5)));
438 record_builtin_type ("JMPBUF_T", jmpbuf_type, true);
439 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
441 /* Functions to get and set the jumpbuf pointer for the current thread. */
443 = create_subprog_decl
444 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
445 NULL_TREE, build_function_type_list (jmpbuf_ptr_type, NULL_TREE),
446 NULL_TREE, false, true, true, true, NULL, Empty);
447 DECL_IGNORED_P (get_jmpbuf_decl) = 1;
450 = create_subprog_decl
451 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
452 NULL_TREE, build_function_type_list (void_type_node, jmpbuf_ptr_type,
454 NULL_TREE, false, true, true, true, NULL, Empty);
455 DECL_IGNORED_P (set_jmpbuf_decl) = 1;
457 /* setjmp returns an integer and has one operand, which is a pointer to
460 = create_subprog_decl
461 (get_identifier ("__builtin_setjmp"), NULL_TREE,
462 build_function_type_list (integer_type_node, jmpbuf_ptr_type,
464 NULL_TREE, false, true, true, true, NULL, Empty);
465 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
466 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
468 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
470 update_setjmp_buf_decl
471 = create_subprog_decl
472 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
473 build_function_type_list (void_type_node, jmpbuf_ptr_type, NULL_TREE),
474 NULL_TREE, false, true, true, true, NULL, Empty);
475 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
476 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
478 /* Hooks to call when entering/leaving an exception handler. */
480 = build_function_type_list (void_type_node, ptr_void_type_node, NULL_TREE);
483 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
484 ftype, NULL_TREE, false, true, true, true, NULL,
486 DECL_IGNORED_P (begin_handler_decl) = 1;
489 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
490 ftype, NULL_TREE, false, true, true, true, NULL,
492 DECL_IGNORED_P (end_handler_decl) = 1;
495 = create_subprog_decl (get_identifier ("__gnat_reraise_zcx"), NULL_TREE,
496 ftype, NULL_TREE, false, true, true, true, NULL,
498 DECL_IGNORED_P (reraise_zcx_decl) = 1;
500 /* If in no exception handlers mode, all raise statements are redirected to
501 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
502 this procedure will never be called in this mode. */
503 if (No_Exception_Handlers_Set ())
506 = create_subprog_decl
507 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
508 build_function_type_list (void_type_node,
510 (unsigned_char_type_node),
511 integer_type_node, NULL_TREE),
512 NULL_TREE, false, true, true, true, NULL, Empty);
513 TREE_THIS_VOLATILE (decl) = 1;
514 TREE_SIDE_EFFECTS (decl) = 1;
516 = build_qualified_type (TREE_TYPE (decl), TYPE_QUAL_VOLATILE);
517 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
518 gnat_raise_decls[i] = decl;
522 /* Otherwise, make one decl for each exception reason. */
523 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
524 gnat_raise_decls[i] = build_raise_check (i, exception_simple);
525 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls_ext); i++)
526 gnat_raise_decls_ext[i]
527 = build_raise_check (i,
528 i == CE_Index_Check_Failed
529 || i == CE_Range_Check_Failed
530 || i == CE_Invalid_Data
531 ? exception_range : exception_column);
534 /* Set the types that GCC and Gigi use from the front end. */
536 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
537 except_type_node = TREE_TYPE (exception_type);
539 /* Make other functions used for exception processing. */
541 = create_subprog_decl
542 (get_identifier ("system__soft_links__get_gnat_exception"), NULL_TREE,
543 build_function_type_list (build_pointer_type (except_type_node),
545 NULL_TREE, false, true, true, true, NULL, Empty);
548 = create_subprog_decl
549 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
550 build_function_type_list (void_type_node,
551 build_pointer_type (except_type_node),
553 NULL_TREE, false, true, true, true, NULL, Empty);
555 /* Indicate that it never returns. */
556 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
557 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
558 TREE_TYPE (raise_nodefer_decl)
559 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
562 /* Build the special descriptor type and its null node if needed. */
563 if (TARGET_VTABLE_USES_DESCRIPTORS)
565 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
566 tree field_list = NULL_TREE;
568 VEC(constructor_elt,gc) *null_vec = NULL;
569 constructor_elt *elt;
571 fdesc_type_node = make_node (RECORD_TYPE);
572 VEC_safe_grow (constructor_elt, gc, null_vec,
573 TARGET_VTABLE_USES_DESCRIPTORS);
574 elt = (VEC_address (constructor_elt,null_vec)
575 + TARGET_VTABLE_USES_DESCRIPTORS - 1);
577 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
580 = create_field_decl (NULL_TREE, ptr_void_ftype, fdesc_type_node,
581 NULL_TREE, NULL_TREE, 0, 1);
582 DECL_CHAIN (field) = field_list;
585 elt->value = null_node;
589 finish_record_type (fdesc_type_node, nreverse (field_list), 0, false);
590 record_builtin_type ("descriptor", fdesc_type_node, true);
591 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_vec);
595 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
597 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
599 /* In this case, the builtin floating point types are VAX float,
600 so make up a type for use. */
601 longest_float_type_node = make_node (REAL_TYPE);
602 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
603 layout_type (longest_float_type_node);
604 record_builtin_type ("longest float type", longest_float_type_node,
608 longest_float_type_node = TREE_TYPE (long_long_float_type);
610 /* Dummy objects to materialize "others" and "all others" in the exception
611 tables. These are exported by a-exexpr-gcc.adb, so see this unit for
614 = create_var_decl (get_identifier ("OTHERS"),
615 get_identifier ("__gnat_others_value"),
616 integer_type_node, NULL_TREE, true, false, true, false,
620 = create_var_decl (get_identifier ("ALL_OTHERS"),
621 get_identifier ("__gnat_all_others_value"),
622 integer_type_node, NULL_TREE, true, false, true, false,
625 main_identifier_node = get_identifier ("main");
627 /* Install the builtins we might need, either internally or as
628 user available facilities for Intrinsic imports. */
629 gnat_install_builtins ();
631 VEC_safe_push (tree, gc, gnu_except_ptr_stack, NULL_TREE);
632 VEC_safe_push (tree, gc, gnu_constraint_error_label_stack, NULL_TREE);
633 VEC_safe_push (tree, gc, gnu_storage_error_label_stack, NULL_TREE);
634 VEC_safe_push (tree, gc, gnu_program_error_label_stack, NULL_TREE);
636 /* Process any Pragma Ident for the main unit. */
637 #ifdef ASM_OUTPUT_IDENT
638 if (Present (Ident_String (Main_Unit)))
641 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
644 /* If we are using the GCC exception mechanism, let GCC know. */
645 if (Exception_Mechanism == Back_End_Exceptions)
648 /* Now translate the compilation unit proper. */
649 Compilation_Unit_to_gnu (gnat_root);
651 /* Finally see if we have any elaboration procedures to deal with. */
652 for (info = elab_info_list; info; info = info->next)
654 tree gnu_body = DECL_SAVED_TREE (info->elab_proc), gnu_stmts;
656 /* We should have a BIND_EXPR but it may not have any statements in it.
657 If it doesn't have any, we have nothing to do except for setting the
658 flag on the GNAT node. Otherwise, process the function as others. */
659 gnu_stmts = gnu_body;
660 if (TREE_CODE (gnu_stmts) == BIND_EXPR)
661 gnu_stmts = BIND_EXPR_BODY (gnu_stmts);
662 if (!gnu_stmts || !STATEMENT_LIST_HEAD (gnu_stmts))
663 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
666 begin_subprog_body (info->elab_proc);
667 end_subprog_body (gnu_body);
668 rest_of_subprog_body_compilation (info->elab_proc);
672 /* We cannot track the location of errors past this point. */
673 error_gnat_node = Empty;
676 /* Return a subprogram decl corresponding to __gnat_rcheck_xx for the given
677 CHECK if KIND is EXCEPTION_SIMPLE, or else to __gnat_rcheck_xx_ext. */
680 build_raise_check (int check, enum exception_info_kind kind)
685 if (kind == exception_simple)
687 sprintf (name, "__gnat_rcheck_%.2d", check);
689 = build_function_type_list (void_type_node,
691 (unsigned_char_type_node),
692 integer_type_node, NULL_TREE);
696 tree t = (kind == exception_column ? NULL_TREE : integer_type_node);
697 sprintf (name, "__gnat_rcheck_%.2d_ext", check);
699 = build_function_type_list (void_type_node,
701 (unsigned_char_type_node),
702 integer_type_node, integer_type_node,
707 = create_subprog_decl (get_identifier (name), NULL_TREE, ftype, NULL_TREE,
708 false, true, true, true, NULL, Empty);
710 /* Indicate that it never returns. */
711 TREE_THIS_VOLATILE (result) = 1;
712 TREE_SIDE_EFFECTS (result) = 1;
714 = build_qualified_type (TREE_TYPE (result), TYPE_QUAL_VOLATILE);
719 /* Return a positive value if an lvalue is required for GNAT_NODE, which is
720 an N_Attribute_Reference. */
723 lvalue_required_for_attribute_p (Node_Id gnat_node)
725 switch (Get_Attribute_Id (Attribute_Name (gnat_node)))
733 case Attr_Range_Length:
735 case Attr_Object_Size:
736 case Attr_Value_Size:
737 case Attr_Component_Size:
738 case Attr_Max_Size_In_Storage_Elements:
741 case Attr_Null_Parameter:
742 case Attr_Passed_By_Reference:
743 case Attr_Mechanism_Code:
748 case Attr_Unchecked_Access:
749 case Attr_Unrestricted_Access:
750 case Attr_Code_Address:
751 case Attr_Pool_Address:
754 case Attr_Bit_Position:
760 case Attr_Asm_Output:
766 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
767 is the type that will be used for GNAT_NODE in the translated GNU tree.
768 CONSTANT indicates whether the underlying object represented by GNAT_NODE
769 is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates
770 whether its value is the address of a constant and ALIASED whether it is
771 aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored.
773 The function climbs up the GNAT tree starting from the node and returns 1
774 upon encountering a node that effectively requires an lvalue downstream.
775 It returns int instead of bool to facilitate usage in non-purely binary
779 lvalue_required_p (Node_Id gnat_node, tree gnu_type, bool constant,
780 bool address_of_constant, bool aliased)
782 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
784 switch (Nkind (gnat_parent))
789 case N_Attribute_Reference:
790 return lvalue_required_for_attribute_p (gnat_parent);
792 case N_Parameter_Association:
793 case N_Function_Call:
794 case N_Procedure_Call_Statement:
795 /* If the parameter is by reference, an lvalue is required. */
797 || must_pass_by_ref (gnu_type)
798 || default_pass_by_ref (gnu_type));
800 case N_Indexed_Component:
801 /* Only the array expression can require an lvalue. */
802 if (Prefix (gnat_parent) != gnat_node)
805 /* ??? Consider that referencing an indexed component with a
806 non-constant index forces the whole aggregate to memory.
807 Note that N_Integer_Literal is conservative, any static
808 expression in the RM sense could probably be accepted. */
809 for (gnat_temp = First (Expressions (gnat_parent));
811 gnat_temp = Next (gnat_temp))
812 if (Nkind (gnat_temp) != N_Integer_Literal)
815 /* ... fall through ... */
818 /* Only the array expression can require an lvalue. */
819 if (Prefix (gnat_parent) != gnat_node)
822 aliased |= Has_Aliased_Components (Etype (gnat_node));
823 return lvalue_required_p (gnat_parent, gnu_type, constant,
824 address_of_constant, aliased);
826 case N_Selected_Component:
827 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
828 return lvalue_required_p (gnat_parent, gnu_type, constant,
829 address_of_constant, aliased);
831 case N_Object_Renaming_Declaration:
832 /* We need to make a real renaming only if the constant object is
833 aliased or if we may use a renaming pointer; otherwise we can
834 optimize and return the rvalue. We make an exception if the object
835 is an identifier since in this case the rvalue can be propagated
836 attached to the CONST_DECL. */
839 /* This should match the constant case of the renaming code. */
841 (Underlying_Type (Etype (Name (gnat_parent))))
842 || Nkind (Name (gnat_parent)) == N_Identifier);
844 case N_Object_Declaration:
845 /* We cannot use a constructor if this is an atomic object because
846 the actual assignment might end up being done component-wise. */
848 ||(Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
849 && Is_Atomic (Defining_Entity (gnat_parent)))
850 /* We don't use a constructor if this is a class-wide object
851 because the effective type of the object is the equivalent
852 type of the class-wide subtype and it smashes most of the
853 data into an array of bytes to which we cannot convert. */
854 || Ekind ((Etype (Defining_Entity (gnat_parent))))
855 == E_Class_Wide_Subtype);
857 case N_Assignment_Statement:
858 /* We cannot use a constructor if the LHS is an atomic object because
859 the actual assignment might end up being done component-wise. */
861 || Name (gnat_parent) == gnat_node
862 || (Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
863 && Is_Atomic (Entity (Name (gnat_parent)))));
865 case N_Unchecked_Type_Conversion:
869 /* ... fall through ... */
871 case N_Type_Conversion:
872 case N_Qualified_Expression:
873 /* We must look through all conversions because we may need to bypass
874 an intermediate conversion that is meant to be purely formal. */
875 return lvalue_required_p (gnat_parent,
876 get_unpadded_type (Etype (gnat_parent)),
877 constant, address_of_constant, aliased);
880 /* We should only reach here through the N_Qualified_Expression case.
881 Force an lvalue for composite types since a block-copy to the newly
882 allocated area of memory is made. */
883 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)));
885 case N_Explicit_Dereference:
886 /* We look through dereferences for address of constant because we need
887 to handle the special cases listed above. */
888 if (constant && address_of_constant)
889 return lvalue_required_p (gnat_parent,
890 get_unpadded_type (Etype (gnat_parent)),
893 /* ... fall through ... */
902 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
903 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
904 to where we should place the result type. */
907 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
909 Node_Id gnat_temp, gnat_temp_type;
910 tree gnu_result, gnu_result_type;
912 /* Whether we should require an lvalue for GNAT_NODE. Needed in
913 specific circumstances only, so evaluated lazily. < 0 means
914 unknown, > 0 means known true, 0 means known false. */
915 int require_lvalue = -1;
917 /* If GNAT_NODE is a constant, whether we should use the initialization
918 value instead of the constant entity, typically for scalars with an
919 address clause when the parent doesn't require an lvalue. */
920 bool use_constant_initializer = false;
922 /* If the Etype of this node does not equal the Etype of the Entity,
923 something is wrong with the entity map, probably in generic
924 instantiation. However, this does not apply to types. Since we sometime
925 have strange Ekind's, just do this test for objects. Also, if the Etype of
926 the Entity is private, the Etype of the N_Identifier is allowed to be the
927 full type and also we consider a packed array type to be the same as the
928 original type. Similarly, a class-wide type is equivalent to a subtype of
929 itself. Finally, if the types are Itypes, one may be a copy of the other,
930 which is also legal. */
931 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
932 ? gnat_node : Entity (gnat_node));
933 gnat_temp_type = Etype (gnat_temp);
935 gcc_assert (Etype (gnat_node) == gnat_temp_type
936 || (Is_Packed (gnat_temp_type)
937 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
938 || (Is_Class_Wide_Type (Etype (gnat_node)))
939 || (IN (Ekind (gnat_temp_type), Private_Kind)
940 && Present (Full_View (gnat_temp_type))
941 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
942 || (Is_Packed (Full_View (gnat_temp_type))
943 && (Etype (gnat_node)
944 == Packed_Array_Type (Full_View
945 (gnat_temp_type))))))
946 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
947 || !(Ekind (gnat_temp) == E_Variable
948 || Ekind (gnat_temp) == E_Component
949 || Ekind (gnat_temp) == E_Constant
950 || Ekind (gnat_temp) == E_Loop_Parameter
951 || IN (Ekind (gnat_temp), Formal_Kind)));
953 /* If this is a reference to a deferred constant whose partial view is an
954 unconstrained private type, the proper type is on the full view of the
955 constant, not on the full view of the type, which may be unconstrained.
957 This may be a reference to a type, for example in the prefix of the
958 attribute Position, generated for dispatching code (see Make_DT in
959 exp_disp,adb). In that case we need the type itself, not is parent,
960 in particular if it is a derived type */
961 if (Ekind (gnat_temp) == E_Constant
962 && Is_Private_Type (gnat_temp_type)
963 && (Has_Unknown_Discriminants (gnat_temp_type)
964 || (Present (Full_View (gnat_temp_type))
965 && Has_Discriminants (Full_View (gnat_temp_type))))
966 && Present (Full_View (gnat_temp)))
968 gnat_temp = Full_View (gnat_temp);
969 gnat_temp_type = Etype (gnat_temp);
973 /* We want to use the Actual_Subtype if it has already been elaborated,
974 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
976 if ((Ekind (gnat_temp) == E_Constant
977 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
978 && !(Is_Array_Type (Etype (gnat_temp))
979 && Present (Packed_Array_Type (Etype (gnat_temp))))
980 && Present (Actual_Subtype (gnat_temp))
981 && present_gnu_tree (Actual_Subtype (gnat_temp)))
982 gnat_temp_type = Actual_Subtype (gnat_temp);
984 gnat_temp_type = Etype (gnat_node);
987 /* Expand the type of this identifier first, in case it is an enumeral
988 literal, which only get made when the type is expanded. There is no
989 order-of-elaboration issue here. */
990 gnu_result_type = get_unpadded_type (gnat_temp_type);
992 /* If this is a non-imported scalar constant with an address clause,
993 retrieve the value instead of a pointer to be dereferenced unless
994 an lvalue is required. This is generally more efficient and actually
995 required if this is a static expression because it might be used
996 in a context where a dereference is inappropriate, such as a case
997 statement alternative or a record discriminant. There is no possible
998 volatile-ness short-circuit here since Volatile constants must be
1000 if (Ekind (gnat_temp) == E_Constant
1001 && Is_Scalar_Type (gnat_temp_type)
1002 && !Is_Imported (gnat_temp)
1003 && Present (Address_Clause (gnat_temp)))
1005 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
1006 false, Is_Aliased (gnat_temp));
1007 use_constant_initializer = !require_lvalue;
1010 if (use_constant_initializer)
1012 /* If this is a deferred constant, the initializer is attached to
1014 if (Present (Full_View (gnat_temp)))
1015 gnat_temp = Full_View (gnat_temp);
1017 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
1020 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
1022 /* Some objects (such as parameters passed by reference, globals of
1023 variable size, and renamed objects) actually represent the address
1024 of the object. In that case, we must do the dereference. Likewise,
1025 deal with parameters to foreign convention subprograms. */
1026 if (DECL_P (gnu_result)
1027 && (DECL_BY_REF_P (gnu_result)
1028 || (TREE_CODE (gnu_result) == PARM_DECL
1029 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
1031 const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result);
1033 /* First do the first dereference if needed. */
1034 if (TREE_CODE (gnu_result) == PARM_DECL
1035 && DECL_BY_DOUBLE_REF_P (gnu_result))
1037 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
1038 if (TREE_CODE (gnu_result) == INDIRECT_REF)
1039 TREE_THIS_NOTRAP (gnu_result) = 1;
1041 /* The first reference, in case of a double reference, always points
1042 to read-only, see gnat_to_gnu_param for the rationale. */
1043 TREE_READONLY (gnu_result) = 1;
1046 /* If it's a PARM_DECL to foreign convention subprogram, convert it. */
1047 if (TREE_CODE (gnu_result) == PARM_DECL
1048 && DECL_BY_COMPONENT_PTR_P (gnu_result))
1050 = convert (build_pointer_type (gnu_result_type), gnu_result);
1052 /* If it's a CONST_DECL, return the underlying constant like below. */
1053 else if (TREE_CODE (gnu_result) == CONST_DECL)
1054 gnu_result = DECL_INITIAL (gnu_result);
1056 /* If it's a renaming pointer and we are at the right binding level,
1057 we can reference the renamed object directly, since the renamed
1058 expression has been protected against multiple evaluations. */
1059 if (TREE_CODE (gnu_result) == VAR_DECL
1060 && !DECL_LOOP_PARM_P (gnu_result)
1061 && DECL_RENAMED_OBJECT (gnu_result)
1062 && (!DECL_RENAMING_GLOBAL_P (gnu_result) || global_bindings_p ()))
1063 gnu_result = DECL_RENAMED_OBJECT (gnu_result);
1065 /* Otherwise, do the final dereference. */
1068 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
1070 if ((TREE_CODE (gnu_result) == INDIRECT_REF
1071 || TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
1072 && No (Address_Clause (gnat_temp)))
1073 TREE_THIS_NOTRAP (gnu_result) = 1;
1076 TREE_READONLY (gnu_result) = 1;
1080 /* If we have a constant declaration and its initializer, try to return the
1081 latter to avoid the need to call fold in lots of places and the need for
1082 elaboration code if this identifier is used as an initializer itself.
1083 Don't do it for aggregate types that contain a placeholder since their
1084 initializers cannot be manipulated easily. */
1085 if (TREE_CONSTANT (gnu_result)
1086 && DECL_P (gnu_result)
1087 && DECL_INITIAL (gnu_result)
1088 && !(AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))
1089 && !TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_result))
1090 && type_contains_placeholder_p (TREE_TYPE (gnu_result))))
1092 bool constant_only = (TREE_CODE (gnu_result) == CONST_DECL
1093 && !DECL_CONST_CORRESPONDING_VAR (gnu_result));
1094 bool address_of_constant = (TREE_CODE (gnu_result) == CONST_DECL
1095 && DECL_CONST_ADDRESS_P (gnu_result));
1097 /* If there is a (corresponding) variable or this is the address of a
1098 constant, we only want to return the initializer if an lvalue isn't
1099 required. Evaluate this now if we have not already done so. */
1100 if ((!constant_only || address_of_constant) && require_lvalue < 0)
1102 = lvalue_required_p (gnat_node, gnu_result_type, true,
1103 address_of_constant, Is_Aliased (gnat_temp));
1105 /* ??? We need to unshare the initializer if the object is external
1106 as such objects are not marked for unsharing if we are not at the
1107 global level. This should be fixed in add_decl_expr. */
1108 if ((constant_only && !address_of_constant) || !require_lvalue)
1109 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
1112 /* The GNAT tree has the type of a function set to its result type, so we
1113 adjust here. Also use the type of the result if the Etype is a subtype
1114 that is nominally unconstrained. Likewise if this is a deferred constant
1115 of a discriminated type whose full view can be elaborated statically, to
1116 avoid problematic conversions to the nominal subtype. But remove any
1117 padding from the resulting type. */
1118 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
1119 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type)
1120 || (Ekind (gnat_temp) == E_Constant
1121 && Present (Full_View (gnat_temp))
1122 && Has_Discriminants (gnat_temp_type)
1123 && TREE_CODE (gnu_result) == CONSTRUCTOR))
1125 gnu_result_type = TREE_TYPE (gnu_result);
1126 if (TYPE_IS_PADDING_P (gnu_result_type))
1127 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
1130 *gnu_result_type_p = gnu_result_type;
1135 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1136 any statements we generate. */
1139 Pragma_to_gnu (Node_Id gnat_node)
1142 tree gnu_result = alloc_stmt_list ();
1144 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
1145 annotating types. */
1146 if (type_annotate_only
1147 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
1150 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
1152 case Pragma_Inspection_Point:
1153 /* Do nothing at top level: all such variables are already viewable. */
1154 if (global_bindings_p ())
1157 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
1158 Present (gnat_temp);
1159 gnat_temp = Next (gnat_temp))
1161 Node_Id gnat_expr = Expression (gnat_temp);
1162 tree gnu_expr = gnat_to_gnu (gnat_expr);
1164 enum machine_mode mode;
1165 tree asm_constraint = NULL_TREE;
1166 #ifdef ASM_COMMENT_START
1170 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1171 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1173 /* Use the value only if it fits into a normal register,
1174 otherwise use the address. */
1175 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1176 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1177 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1178 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1181 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1183 #ifdef ASM_COMMENT_START
1184 comment = concat (ASM_COMMENT_START,
1185 " inspection point: ",
1186 Get_Name_String (Chars (gnat_expr)),
1187 use_address ? " address" : "",
1190 asm_constraint = build_string (strlen (comment), comment);
1193 gnu_expr = build5 (ASM_EXPR, void_type_node,
1197 (build_tree_list (NULL_TREE,
1198 build_string (1, "g")),
1199 gnu_expr, NULL_TREE),
1200 NULL_TREE, NULL_TREE);
1201 ASM_VOLATILE_P (gnu_expr) = 1;
1202 set_expr_location_from_node (gnu_expr, gnat_node);
1203 append_to_statement_list (gnu_expr, &gnu_result);
1207 case Pragma_Optimize:
1208 switch (Chars (Expression
1209 (First (Pragma_Argument_Associations (gnat_node)))))
1211 case Name_Time: case Name_Space:
1213 post_error ("insufficient -O value?", gnat_node);
1218 post_error ("must specify -O0?", gnat_node);
1226 case Pragma_Reviewable:
1227 if (write_symbols == NO_DEBUG)
1228 post_error ("must specify -g?", gnat_node);
1235 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1236 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1237 where we should place the result type. ATTRIBUTE is the attribute ID. */
1240 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1242 tree gnu_prefix, gnu_type, gnu_expr;
1243 tree gnu_result_type, gnu_result = error_mark_node;
1244 bool prefix_unused = false;
1246 /* ??? If this is an access attribute for a public subprogram to be used in
1247 a dispatch table, do not translate its type as it's useless there and the
1248 parameter types might be incomplete types coming from a limited with. */
1249 if (Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
1250 && Is_Dispatch_Table_Entity (Etype (gnat_node))
1251 && Nkind (Prefix (gnat_node)) == N_Identifier
1252 && Is_Subprogram (Entity (Prefix (gnat_node)))
1253 && Is_Public (Entity (Prefix (gnat_node)))
1254 && !present_gnu_tree (Entity (Prefix (gnat_node))))
1255 gnu_prefix = get_minimal_subprog_decl (Entity (Prefix (gnat_node)));
1257 gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1258 gnu_type = TREE_TYPE (gnu_prefix);
1260 /* If the input is a NULL_EXPR, make a new one. */
1261 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1263 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1264 *gnu_result_type_p = gnu_result_type;
1265 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1272 /* These are just conversions since representation clauses for
1273 enumeration types are handled in the front-end. */
1275 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1276 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1277 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1278 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1279 checkp, checkp, true, gnat_node);
1285 /* These just add or subtract the constant 1 since representation
1286 clauses for enumeration types are handled in the front-end. */
1287 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1288 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1290 if (Do_Range_Check (First (Expressions (gnat_node))))
1292 gnu_expr = gnat_protect_expr (gnu_expr);
1295 (build_binary_op (EQ_EXPR, boolean_type_node,
1297 attribute == Attr_Pred
1298 ? TYPE_MIN_VALUE (gnu_result_type)
1299 : TYPE_MAX_VALUE (gnu_result_type)),
1300 gnu_expr, CE_Range_Check_Failed, gnat_node);
1304 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1305 gnu_result_type, gnu_expr,
1306 convert (gnu_result_type, integer_one_node));
1310 case Attr_Unrestricted_Access:
1311 /* Conversions don't change addresses but can cause us to miss the
1312 COMPONENT_REF case below, so strip them off. */
1313 gnu_prefix = remove_conversions (gnu_prefix,
1314 !Must_Be_Byte_Aligned (gnat_node));
1316 /* If we are taking 'Address of an unconstrained object, this is the
1317 pointer to the underlying array. */
1318 if (attribute == Attr_Address)
1319 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1321 /* If we are building a static dispatch table, we have to honor
1322 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1323 with the C++ ABI. We do it in the non-static case as well,
1324 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1325 else if (TARGET_VTABLE_USES_DESCRIPTORS
1326 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1329 /* Descriptors can only be built here for top-level functions. */
1330 bool build_descriptor = (global_bindings_p () != 0);
1332 VEC(constructor_elt,gc) *gnu_vec = NULL;
1333 constructor_elt *elt;
1335 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1337 /* If we're not going to build the descriptor, we have to retrieve
1338 the one which will be built by the linker (or by the compiler
1339 later if a static chain is requested). */
1340 if (!build_descriptor)
1342 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1343 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1345 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1348 VEC_safe_grow (constructor_elt, gc, gnu_vec,
1349 TARGET_VTABLE_USES_DESCRIPTORS);
1350 elt = (VEC_address (constructor_elt, gnu_vec)
1351 + TARGET_VTABLE_USES_DESCRIPTORS - 1);
1352 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1353 i < TARGET_VTABLE_USES_DESCRIPTORS;
1354 gnu_field = DECL_CHAIN (gnu_field), i++)
1356 if (build_descriptor)
1358 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1359 build_int_cst (NULL_TREE, i));
1360 TREE_CONSTANT (t) = 1;
1363 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1364 gnu_field, NULL_TREE);
1366 elt->index = gnu_field;
1371 gnu_result = gnat_build_constructor (gnu_result_type, gnu_vec);
1375 /* ... fall through ... */
1378 case Attr_Unchecked_Access:
1379 case Attr_Code_Address:
1380 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1382 = build_unary_op (((attribute == Attr_Address
1383 || attribute == Attr_Unrestricted_Access)
1384 && !Must_Be_Byte_Aligned (gnat_node))
1385 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1386 gnu_result_type, gnu_prefix);
1388 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1389 don't try to build a trampoline. */
1390 if (attribute == Attr_Code_Address)
1392 gnu_expr = remove_conversions (gnu_result, false);
1394 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1395 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1398 /* For 'Access, issue an error message if the prefix is a C++ method
1399 since it can use a special calling convention on some platforms,
1400 which cannot be propagated to the access type. */
1401 else if (attribute == Attr_Access
1402 && Nkind (Prefix (gnat_node)) == N_Identifier
1403 && is_cplusplus_method (Entity (Prefix (gnat_node))))
1404 post_error ("access to C++ constructor or member function not allowed",
1407 /* For other address attributes applied to a nested function,
1408 find an inner ADDR_EXPR and annotate it so that we can issue
1409 a useful warning with -Wtrampolines. */
1410 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1412 gnu_expr = remove_conversions (gnu_result, false);
1414 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1415 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1417 set_expr_location_from_node (gnu_expr, gnat_node);
1419 /* Check that we're not violating the No_Implicit_Dynamic_Code
1420 restriction. Be conservative if we don't know anything
1421 about the trampoline strategy for the target. */
1422 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1427 case Attr_Pool_Address:
1430 tree gnu_ptr = gnu_prefix;
1432 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1434 /* If this is an unconstrained array, we know the object has been
1435 allocated with the template in front of the object. So compute
1436 the template address. */
1437 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1439 = convert (build_pointer_type
1440 (TYPE_OBJECT_RECORD_TYPE
1441 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1444 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1445 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1446 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1448 tree gnu_char_ptr_type
1449 = build_pointer_type (unsigned_char_type_node);
1450 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1451 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1452 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1456 gnu_result = convert (gnu_result_type, gnu_ptr);
1461 case Attr_Object_Size:
1462 case Attr_Value_Size:
1463 case Attr_Max_Size_In_Storage_Elements:
1464 gnu_expr = gnu_prefix;
1466 /* Remove NOPs and conversions between original and packable version
1467 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1468 to see if a COMPONENT_REF was involved. */
1469 while (TREE_CODE (gnu_expr) == NOP_EXPR
1470 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1471 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1472 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1474 && TYPE_NAME (TREE_TYPE (gnu_expr))
1475 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1476 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1478 gnu_prefix = remove_conversions (gnu_prefix, true);
1479 prefix_unused = true;
1480 gnu_type = TREE_TYPE (gnu_prefix);
1482 /* Replace an unconstrained array type with the type of the underlying
1483 array. We can't do this with a call to maybe_unconstrained_array
1484 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1485 use the record type that will be used to allocate the object and its
1487 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1489 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1490 if (attribute != Attr_Max_Size_In_Storage_Elements)
1491 gnu_type = TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (gnu_type)));
1494 /* If we're looking for the size of a field, return the field size.
1495 Otherwise, if the prefix is an object, or if we're looking for
1496 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1497 GCC size of the type. Otherwise, it is the RM size of the type. */
1498 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1499 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1500 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1501 || attribute == Attr_Object_Size
1502 || attribute == Attr_Max_Size_In_Storage_Elements)
1504 /* If the prefix is an object of a padded type, the GCC size isn't
1505 relevant to the programmer. Normally what we want is the RM size,
1506 which was set from the specified size, but if it was not set, we
1507 want the size of the field. Using the MAX of those two produces
1508 the right result in all cases. Don't use the size of the field
1509 if it's self-referential, since that's never what's wanted. */
1510 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1511 && TYPE_IS_PADDING_P (gnu_type)
1512 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1514 gnu_result = rm_size (gnu_type);
1515 if (!CONTAINS_PLACEHOLDER_P
1516 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1518 = size_binop (MAX_EXPR, gnu_result,
1519 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1521 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1523 Node_Id gnat_deref = Prefix (gnat_node);
1524 Node_Id gnat_actual_subtype
1525 = Actual_Designated_Subtype (gnat_deref);
1527 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1529 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1530 && Present (gnat_actual_subtype))
1532 tree gnu_actual_obj_type
1533 = gnat_to_gnu_type (gnat_actual_subtype);
1535 = build_unc_object_type_from_ptr (gnu_ptr_type,
1536 gnu_actual_obj_type,
1537 get_identifier ("SIZE"),
1541 gnu_result = TYPE_SIZE (gnu_type);
1544 gnu_result = TYPE_SIZE (gnu_type);
1547 gnu_result = rm_size (gnu_type);
1549 /* Deal with a self-referential size by returning the maximum size for
1550 a type and by qualifying the size with the object otherwise. */
1551 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1553 if (TREE_CODE (gnu_prefix) == TYPE_DECL)
1554 gnu_result = max_size (gnu_result, true);
1556 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1559 /* If the type contains a template, subtract its size. */
1560 if (TREE_CODE (gnu_type) == RECORD_TYPE
1561 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1562 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1563 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1565 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1566 if (attribute == Attr_Max_Size_In_Storage_Elements)
1567 gnu_result = size_binop (CEIL_DIV_EXPR, gnu_result, bitsize_unit_node);
1569 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1572 case Attr_Alignment:
1576 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1577 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1578 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1580 gnu_type = TREE_TYPE (gnu_prefix);
1581 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1582 prefix_unused = true;
1584 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1585 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1588 Node_Id gnat_prefix = Prefix (gnat_node);
1589 Entity_Id gnat_type = Etype (gnat_prefix);
1590 unsigned int double_align;
1591 bool is_capped_double, align_clause;
1593 /* If the default alignment of "double" or larger scalar types is
1594 specifically capped and there is an alignment clause neither
1595 on the type nor on the prefix itself, return the cap. */
1596 if ((double_align = double_float_alignment) > 0)
1598 = is_double_float_or_array (gnat_type, &align_clause);
1599 else if ((double_align = double_scalar_alignment) > 0)
1601 = is_double_scalar_or_array (gnat_type, &align_clause);
1603 is_capped_double = align_clause = false;
1605 if (is_capped_double
1606 && Nkind (gnat_prefix) == N_Identifier
1607 && Present (Alignment_Clause (Entity (gnat_prefix))))
1608 align_clause = true;
1610 if (is_capped_double && !align_clause)
1611 align = double_align;
1613 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1616 gnu_result = size_int (align);
1622 case Attr_Range_Length:
1623 prefix_unused = true;
1625 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1627 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1629 if (attribute == Attr_First)
1630 gnu_result = TYPE_MIN_VALUE (gnu_type);
1631 else if (attribute == Attr_Last)
1632 gnu_result = TYPE_MAX_VALUE (gnu_type);
1636 (MAX_EXPR, get_base_type (gnu_result_type),
1638 (PLUS_EXPR, get_base_type (gnu_result_type),
1639 build_binary_op (MINUS_EXPR,
1640 get_base_type (gnu_result_type),
1641 convert (gnu_result_type,
1642 TYPE_MAX_VALUE (gnu_type)),
1643 convert (gnu_result_type,
1644 TYPE_MIN_VALUE (gnu_type))),
1645 convert (gnu_result_type, integer_one_node)),
1646 convert (gnu_result_type, integer_zero_node));
1651 /* ... fall through ... */
1655 int Dimension = (Present (Expressions (gnat_node))
1656 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1658 struct parm_attr_d *pa = NULL;
1659 Entity_Id gnat_param = Empty;
1661 /* Make sure any implicit dereference gets done. */
1662 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1663 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1665 /* We treat unconstrained array In parameters specially. */
1666 if (!Is_Constrained (Etype (Prefix (gnat_node))))
1668 Node_Id gnat_prefix = Prefix (gnat_node);
1670 /* This is the direct case. */
1671 if (Nkind (gnat_prefix) == N_Identifier
1672 && Ekind (Entity (gnat_prefix)) == E_In_Parameter)
1673 gnat_param = Entity (gnat_prefix);
1675 /* This is the indirect case. Note that we need to be sure that
1676 the access value cannot be null as we'll hoist the load. */
1677 if (Nkind (gnat_prefix) == N_Explicit_Dereference
1678 && Nkind (Prefix (gnat_prefix)) == N_Identifier
1679 && Ekind (Entity (Prefix (gnat_prefix))) == E_In_Parameter
1680 && Can_Never_Be_Null (Entity (Prefix (gnat_prefix))))
1681 gnat_param = Entity (Prefix (gnat_prefix));
1684 gnu_type = TREE_TYPE (gnu_prefix);
1685 prefix_unused = true;
1686 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1688 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1693 for (ndim = 1, gnu_type_temp = gnu_type;
1694 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1695 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1696 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1699 Dimension = ndim + 1 - Dimension;
1702 for (i = 1; i < Dimension; i++)
1703 gnu_type = TREE_TYPE (gnu_type);
1705 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1707 /* When not optimizing, look up the slot associated with the parameter
1708 and the dimension in the cache and create a new one on failure. */
1709 if (!optimize && Present (gnat_param))
1711 FOR_EACH_VEC_ELT (parm_attr, f_parm_attr_cache, i, pa)
1712 if (pa->id == gnat_param && pa->dim == Dimension)
1717 pa = ggc_alloc_cleared_parm_attr_d ();
1718 pa->id = gnat_param;
1719 pa->dim = Dimension;
1720 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1724 /* Return the cached expression or build a new one. */
1725 if (attribute == Attr_First)
1727 if (pa && pa->first)
1729 gnu_result = pa->first;
1734 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1737 else if (attribute == Attr_Last)
1741 gnu_result = pa->last;
1746 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1749 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1751 if (pa && pa->length)
1753 gnu_result = pa->length;
1758 /* We used to compute the length as max (hb - lb + 1, 0),
1759 which could overflow for some cases of empty arrays, e.g.
1760 when lb == index_type'first. We now compute the length as
1761 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1762 much rarer cases, for extremely large arrays we expect
1763 never to encounter in practice. In addition, the former
1764 computation required the use of potentially constraining
1765 signed arithmetic while the latter doesn't. Note that
1766 the comparison must be done in the original index type,
1767 to avoid any overflow during the conversion. */
1768 tree comp_type = get_base_type (gnu_result_type);
1769 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1770 tree lb = TYPE_MIN_VALUE (index_type);
1771 tree hb = TYPE_MAX_VALUE (index_type);
1773 = build_binary_op (PLUS_EXPR, comp_type,
1774 build_binary_op (MINUS_EXPR,
1776 convert (comp_type, hb),
1777 convert (comp_type, lb)),
1778 convert (comp_type, integer_one_node));
1780 = build_cond_expr (comp_type,
1781 build_binary_op (GE_EXPR,
1785 convert (comp_type, integer_zero_node));
1789 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1790 handling. Note that these attributes could not have been used on
1791 an unconstrained array type. */
1792 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1794 /* Cache the expression we have just computed. Since we want to do it
1795 at run time, we force the use of a SAVE_EXPR and let the gimplifier
1796 create the temporary in the outermost binding level. We will make
1797 sure in Subprogram_Body_to_gnu that it is evaluated on all possible
1798 paths by forcing its evaluation on entry of the function. */
1802 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1803 if (attribute == Attr_First)
1804 pa->first = gnu_result;
1805 else if (attribute == Attr_Last)
1806 pa->last = gnu_result;
1808 pa->length = gnu_result;
1811 /* Set the source location onto the predicate of the condition in the
1812 'Length case but do not do it if the expression is cached to avoid
1813 messing up the debug info. */
1814 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1815 && TREE_CODE (gnu_result) == COND_EXPR
1816 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1817 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1823 case Attr_Bit_Position:
1825 case Attr_First_Bit:
1829 HOST_WIDE_INT bitsize;
1830 HOST_WIDE_INT bitpos;
1832 tree gnu_field_bitpos;
1833 tree gnu_field_offset;
1835 enum machine_mode mode;
1836 int unsignedp, volatilep;
1838 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1839 gnu_prefix = remove_conversions (gnu_prefix, true);
1840 prefix_unused = true;
1842 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1843 the result is 0. Don't allow 'Bit on a bare component, though. */
1844 if (attribute == Attr_Bit
1845 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1846 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1848 gnu_result = integer_zero_node;
1853 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1854 || (attribute == Attr_Bit_Position
1855 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1857 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1858 &mode, &unsignedp, &volatilep, false);
1860 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1862 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1863 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1865 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1866 TREE_CODE (gnu_inner) == COMPONENT_REF
1867 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1868 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1871 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1872 bit_position (TREE_OPERAND (gnu_inner, 1)));
1874 = size_binop (PLUS_EXPR, gnu_field_offset,
1875 byte_position (TREE_OPERAND (gnu_inner, 1)));
1878 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1880 gnu_field_bitpos = bit_position (gnu_prefix);
1881 gnu_field_offset = byte_position (gnu_prefix);
1885 gnu_field_bitpos = bitsize_zero_node;
1886 gnu_field_offset = size_zero_node;
1892 gnu_result = gnu_field_offset;
1895 case Attr_First_Bit:
1897 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1901 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1902 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1903 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1904 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1908 case Attr_Bit_Position:
1909 gnu_result = gnu_field_bitpos;
1913 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1915 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1922 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1923 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1925 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1926 gnu_result = build_binary_op (attribute == Attr_Min
1927 ? MIN_EXPR : MAX_EXPR,
1928 gnu_result_type, gnu_lhs, gnu_rhs);
1932 case Attr_Passed_By_Reference:
1933 gnu_result = size_int (default_pass_by_ref (gnu_type)
1934 || must_pass_by_ref (gnu_type));
1935 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1938 case Attr_Component_Size:
1939 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1940 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1941 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1943 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1944 gnu_type = TREE_TYPE (gnu_prefix);
1946 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1947 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1949 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1950 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1951 gnu_type = TREE_TYPE (gnu_type);
1953 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1955 /* Note this size cannot be self-referential. */
1956 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1957 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1958 prefix_unused = true;
1961 case Attr_Descriptor_Size:
1962 gnu_type = TREE_TYPE (gnu_prefix);
1963 gcc_assert (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE);
1965 /* What we want is the offset of the ARRAY field in the record that the
1966 thin pointer designates, but the components have been shifted so this
1967 is actually the opposite of the offset of the BOUNDS field. */
1968 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1969 gnu_result = size_binop (MINUS_EXPR, bitsize_zero_node,
1970 bit_position (TYPE_FIELDS (gnu_type)));
1971 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1972 prefix_unused = true;
1975 case Attr_Null_Parameter:
1976 /* This is just a zero cast to the pointer type for our prefix and
1978 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1980 = build_unary_op (INDIRECT_REF, NULL_TREE,
1981 convert (build_pointer_type (gnu_result_type),
1982 integer_zero_node));
1983 TREE_PRIVATE (gnu_result) = 1;
1986 case Attr_Mechanism_Code:
1989 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1991 prefix_unused = true;
1992 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1993 if (Present (Expressions (gnat_node)))
1995 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1997 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1998 i--, gnat_obj = Next_Formal (gnat_obj))
2002 code = Mechanism (gnat_obj);
2003 if (code == Default)
2004 code = ((present_gnu_tree (gnat_obj)
2005 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
2006 || ((TREE_CODE (get_gnu_tree (gnat_obj))
2008 && (DECL_BY_COMPONENT_PTR_P
2009 (get_gnu_tree (gnat_obj))))))
2010 ? By_Reference : By_Copy);
2011 gnu_result = convert (gnu_result_type, size_int (- code));
2016 /* Say we have an unimplemented attribute. Then set the value to be
2017 returned to be a zero and hope that's something we can convert to
2018 the type of this attribute. */
2019 post_error ("unimplemented attribute", gnat_node);
2020 gnu_result_type = get_unpadded_type (Etype (gnat_node));
2021 gnu_result = integer_zero_node;
2025 /* If this is an attribute where the prefix was unused, force a use of it if
2026 it has a side-effect. But don't do it if the prefix is just an entity
2027 name. However, if an access check is needed, we must do it. See second
2028 example in AARM 11.6(5.e). */
2029 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
2030 && !Is_Entity_Name (Prefix (gnat_node)))
2031 gnu_result = build_compound_expr (TREE_TYPE (gnu_result), gnu_prefix,
2034 *gnu_result_type_p = gnu_result_type;
2038 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
2039 to a GCC tree, which is returned. */
2042 Case_Statement_to_gnu (Node_Id gnat_node)
2044 tree gnu_result, gnu_expr, gnu_label;
2046 location_t end_locus;
2047 bool may_fallthru = false;
2049 gnu_expr = gnat_to_gnu (Expression (gnat_node));
2050 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
2052 /* The range of values in a case statement is determined by the rules in
2053 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
2054 of the expression. One exception arises in the case of a simple name that
2055 is parenthesized. This still has the Etype of the name, but since it is
2056 not a name, para 7 does not apply, and we need to go to the base type.
2057 This is the only case where parenthesization affects the dynamic
2058 semantics (i.e. the range of possible values at run time that is covered
2059 by the others alternative).
2061 Another exception is if the subtype of the expression is non-static. In
2062 that case, we also have to use the base type. */
2063 if (Paren_Count (Expression (gnat_node)) != 0
2064 || !Is_OK_Static_Subtype (Underlying_Type
2065 (Etype (Expression (gnat_node)))))
2066 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
2068 /* We build a SWITCH_EXPR that contains the code with interspersed
2069 CASE_LABEL_EXPRs for each label. */
2070 if (!Sloc_to_locus (Sloc (gnat_node) + UI_To_Int (End_Span (gnat_node)),
2072 end_locus = input_location;
2073 gnu_label = create_artificial_label (end_locus);
2074 start_stmt_group ();
2076 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
2077 Present (gnat_when);
2078 gnat_when = Next_Non_Pragma (gnat_when))
2080 bool choices_added_p = false;
2081 Node_Id gnat_choice;
2083 /* First compile all the different case choices for the current WHEN
2085 for (gnat_choice = First (Discrete_Choices (gnat_when));
2086 Present (gnat_choice); gnat_choice = Next (gnat_choice))
2088 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
2090 switch (Nkind (gnat_choice))
2093 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
2094 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
2097 case N_Subtype_Indication:
2098 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
2099 (Constraint (gnat_choice))));
2100 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
2101 (Constraint (gnat_choice))));
2105 case N_Expanded_Name:
2106 /* This represents either a subtype range or a static value of
2107 some kind; Ekind says which. */
2108 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
2110 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
2112 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
2113 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
2117 /* ... fall through ... */
2119 case N_Character_Literal:
2120 case N_Integer_Literal:
2121 gnu_low = gnat_to_gnu (gnat_choice);
2124 case N_Others_Choice:
2131 /* If the case value is a subtype that raises Constraint_Error at
2132 run time because of a wrong bound, then gnu_low or gnu_high is
2133 not translated into an INTEGER_CST. In such a case, we need
2134 to ensure that the when statement is not added in the tree,
2135 otherwise it will crash the gimplifier. */
2136 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
2137 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
2139 add_stmt_with_node (build_case_label
2141 create_artificial_label (input_location)),
2143 choices_added_p = true;
2147 /* Push a binding level here in case variables are declared as we want
2148 them to be local to this set of statements instead of to the block
2149 containing the Case statement. */
2150 if (choices_added_p)
2152 tree group = build_stmt_group (Statements (gnat_when), true);
2153 bool group_may_fallthru = block_may_fallthru (group);
2155 if (group_may_fallthru)
2157 tree stmt = build1 (GOTO_EXPR, void_type_node, gnu_label);
2158 SET_EXPR_LOCATION (stmt, end_locus);
2160 may_fallthru = true;
2165 /* Now emit a definition of the label the cases branch to, if any. */
2167 add_stmt (build1 (LABEL_EXPR, void_type_node, gnu_label));
2168 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
2169 end_stmt_group (), NULL_TREE);
2174 /* Find out whether VAR is an iteration variable of an enclosing loop in the
2175 current function. If so, push a range_check_info structure onto the stack
2176 of this enclosing loop and return it. Otherwise, return NULL. */
2178 static struct range_check_info_d *
2179 push_range_check_info (tree var)
2181 struct loop_info_d *iter = NULL;
2184 if (VEC_empty (loop_info, gnu_loop_stack))
2187 var = remove_conversions (var, false);
2189 if (TREE_CODE (var) != VAR_DECL)
2192 if (decl_function_context (var) != current_function_decl)
2195 for (i = VEC_length (loop_info, gnu_loop_stack) - 1;
2196 VEC_iterate (loop_info, gnu_loop_stack, i, iter);
2198 if (var == iter->loop_var)
2203 struct range_check_info_d *rci = ggc_alloc_range_check_info_d ();
2204 VEC_safe_push (range_check_info, gc, iter->checks, rci);
2211 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2212 false, or the maximum value if MAX is true, of TYPE. */
2215 can_equal_min_or_max_val_p (tree val, tree type, bool max)
2217 tree min_or_max_val = (max ? TYPE_MAX_VALUE (type) : TYPE_MIN_VALUE (type));
2219 if (TREE_CODE (min_or_max_val) != INTEGER_CST)
2222 if (TREE_CODE (val) == NOP_EXPR)
2224 ? TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val, 0)))
2225 : TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val, 0))));
2227 if (TREE_CODE (val) != INTEGER_CST)
2230 return tree_int_cst_equal (val, min_or_max_val) == 1;
2233 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2234 If REVERSE is true, minimum value is taken as maximum value. */
2237 can_equal_min_val_p (tree val, tree type, bool reverse)
2239 return can_equal_min_or_max_val_p (val, type, reverse);
2242 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2243 If REVERSE is true, maximum value is taken as minimum value. */
2246 can_equal_max_val_p (tree val, tree type, bool reverse)
2248 return can_equal_min_or_max_val_p (val, type, !reverse);
2251 /* Return true if VAL1 can be lower than VAL2. */
2254 can_be_lower_p (tree val1, tree val2)
2256 if (TREE_CODE (val1) == NOP_EXPR)
2257 val1 = TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val1, 0)));
2259 if (TREE_CODE (val1) != INTEGER_CST)
2262 if (TREE_CODE (val2) == NOP_EXPR)
2263 val2 = TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val2, 0)));
2265 if (TREE_CODE (val2) != INTEGER_CST)
2268 return tree_int_cst_lt (val1, val2);
2271 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2272 to a GCC tree, which is returned. */
2275 Loop_Statement_to_gnu (Node_Id gnat_node)
2277 const Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
2278 struct loop_info_d *gnu_loop_info = ggc_alloc_cleared_loop_info_d ();
2279 tree gnu_loop_stmt = build4 (LOOP_STMT, void_type_node, NULL_TREE,
2280 NULL_TREE, NULL_TREE, NULL_TREE);
2281 tree gnu_loop_label = create_artificial_label (input_location);
2282 tree gnu_cond_expr = NULL_TREE, gnu_low = NULL_TREE, gnu_high = NULL_TREE;
2285 /* Push the loop_info structure associated with the LOOP_STMT. */
2286 VEC_safe_push (loop_info, gc, gnu_loop_stack, gnu_loop_info);
2288 /* Set location information for statement and end label. */
2289 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
2290 Sloc_to_locus (Sloc (End_Label (gnat_node)),
2291 &DECL_SOURCE_LOCATION (gnu_loop_label));
2292 LOOP_STMT_LABEL (gnu_loop_stmt) = gnu_loop_label;
2294 /* Save the label so that a corresponding N_Exit_Statement can find it. */
2295 gnu_loop_info->label = gnu_loop_label;
2297 /* Set the condition under which the loop must keep going.
2298 For the case "LOOP .... END LOOP;" the condition is always true. */
2299 if (No (gnat_iter_scheme))
2302 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2303 else if (Present (Condition (gnat_iter_scheme)))
2304 LOOP_STMT_COND (gnu_loop_stmt)
2305 = gnat_to_gnu (Condition (gnat_iter_scheme));
2307 /* Otherwise we have an iteration scheme and the condition is given by the
2308 bounds of the subtype of the iteration variable. */
2311 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2312 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2313 Entity_Id gnat_type = Etype (gnat_loop_var);
2314 tree gnu_type = get_unpadded_type (gnat_type);
2315 tree gnu_base_type = get_base_type (gnu_type);
2316 tree gnu_one_node = convert (gnu_base_type, integer_one_node);
2317 tree gnu_loop_var, gnu_loop_iv, gnu_first, gnu_last, gnu_stmt;
2318 enum tree_code update_code, test_code, shift_code;
2319 bool reverse = Reverse_Present (gnat_loop_spec), use_iv = false;
2321 gnu_low = TYPE_MIN_VALUE (gnu_type);
2322 gnu_high = TYPE_MAX_VALUE (gnu_type);
2324 /* We must disable modulo reduction for the iteration variable, if any,
2325 in order for the loop comparison to be effective. */
2328 gnu_first = gnu_high;
2330 update_code = MINUS_NOMOD_EXPR;
2331 test_code = GE_EXPR;
2332 shift_code = PLUS_NOMOD_EXPR;
2336 gnu_first = gnu_low;
2337 gnu_last = gnu_high;
2338 update_code = PLUS_NOMOD_EXPR;
2339 test_code = LE_EXPR;
2340 shift_code = MINUS_NOMOD_EXPR;
2343 /* We use two different strategies to translate the loop, depending on
2344 whether optimization is enabled.
2346 If it is, we generate the canonical loop form expected by the loop
2347 optimizer and the loop vectorizer, which is the do-while form:
2356 This avoids an implicit dependency on loop header copying and makes
2357 it possible to turn BOTTOM_COND into an inequality test.
2359 If optimization is disabled, loop header copying doesn't come into
2360 play and we try to generate the loop form with the fewer conditional
2361 branches. First, the default form, which is:
2369 It should catch most loops with constant ending point. Then, if we
2370 cannot, we try to generate the shifted form:
2378 which should catch loops with constant starting point. Otherwise, if
2379 we cannot, we generate the fallback form:
2388 which works in all cases. */
2392 /* We can use the do-while form directly if GNU_FIRST-1 doesn't
2394 if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse))
2397 /* Otherwise, use the do-while form with the help of a special
2398 induction variable in the unsigned version of the base type
2399 or the unsigned version of sizetype, whichever is the
2400 largest, in order to have wrap-around arithmetics for it. */
2403 if (TYPE_PRECISION (gnu_base_type) > TYPE_PRECISION (sizetype))
2404 gnu_base_type = gnat_unsigned_type (gnu_base_type);
2406 gnu_base_type = sizetype;
2408 gnu_first = convert (gnu_base_type, gnu_first);
2409 gnu_last = convert (gnu_base_type, gnu_last);
2410 gnu_one_node = convert (gnu_base_type, integer_one_node);
2415 = build_binary_op (shift_code, gnu_base_type, gnu_first,
2417 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2418 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2422 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
2423 if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2426 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
2428 else if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse)
2429 && !can_equal_min_val_p (gnu_last, gnu_base_type, reverse))
2432 = build_binary_op (shift_code, gnu_base_type, gnu_first,
2435 = build_binary_op (shift_code, gnu_base_type, gnu_last,
2437 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2440 /* Otherwise, use the fallback form. */
2442 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2445 /* If we use the BOTTOM_COND, we can turn the test into an inequality
2446 test but we may have to add ENTRY_COND to protect the empty loop. */
2447 if (LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt))
2449 test_code = NE_EXPR;
2450 if (can_be_lower_p (gnu_high, gnu_low))
2453 = build3 (COND_EXPR, void_type_node,
2454 build_binary_op (LE_EXPR, boolean_type_node,
2456 NULL_TREE, alloc_stmt_list ());
2457 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2461 /* Open a new nesting level that will surround the loop to declare the
2462 iteration variable. */
2463 start_stmt_group ();
2466 /* If we use the special induction variable, create it and set it to
2467 its initial value. Morever, the regular iteration variable cannot
2468 itself be initialized, lest the initial value wrapped around. */
2472 = create_init_temporary ("I", gnu_first, &gnu_stmt, gnat_loop_var);
2473 add_stmt (gnu_stmt);
2474 gnu_first = NULL_TREE;
2477 gnu_loop_iv = NULL_TREE;
2479 /* Declare the iteration variable and set it to its initial value. */
2480 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2481 if (DECL_BY_REF_P (gnu_loop_var))
2482 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2485 gcc_assert (DECL_LOOP_PARM_P (gnu_loop_var));
2486 SET_DECL_INDUCTION_VAR (gnu_loop_var, gnu_loop_iv);
2488 gnu_loop_info->loop_var = gnu_loop_var;
2490 /* Do all the arithmetics in the base type. */
2491 gnu_loop_var = convert (gnu_base_type, gnu_loop_var);
2493 /* Set either the top or bottom exit condition. */
2495 LOOP_STMT_COND (gnu_loop_stmt)
2496 = build_binary_op (test_code, boolean_type_node, gnu_loop_iv,
2499 LOOP_STMT_COND (gnu_loop_stmt)
2500 = build_binary_op (test_code, boolean_type_node, gnu_loop_var,
2503 /* Set either the top or bottom update statement and give it the source
2504 location of the iteration for better coverage info. */
2508 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_iv,
2509 build_binary_op (update_code, gnu_base_type,
2510 gnu_loop_iv, gnu_one_node));
2511 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2512 append_to_statement_list (gnu_stmt,
2513 &LOOP_STMT_UPDATE (gnu_loop_stmt));
2515 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2517 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2518 append_to_statement_list (gnu_stmt,
2519 &LOOP_STMT_UPDATE (gnu_loop_stmt));
2524 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2525 build_binary_op (update_code, gnu_base_type,
2526 gnu_loop_var, gnu_one_node));
2527 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2528 LOOP_STMT_UPDATE (gnu_loop_stmt) = gnu_stmt;
2532 /* If the loop was named, have the name point to this loop. In this case,
2533 the association is not a DECL node, but the end label of the loop. */
2534 if (Present (Identifier (gnat_node)))
2535 save_gnu_tree (Entity (Identifier (gnat_node)), gnu_loop_label, true);
2537 /* Make the loop body into its own block, so any allocated storage will be
2538 released every iteration. This is needed for stack allocation. */
2539 LOOP_STMT_BODY (gnu_loop_stmt)
2540 = build_stmt_group (Statements (gnat_node), true);
2541 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
2543 /* If we have an iteration scheme, then we are in a statement group. Add
2544 the LOOP_STMT to it, finish it and make it the "loop". */
2545 if (Present (gnat_iter_scheme) && No (Condition (gnat_iter_scheme)))
2547 struct range_check_info_d *rci;
2548 unsigned n_checks = VEC_length (range_check_info, gnu_loop_info->checks);
2551 /* First, if we have computed a small number of invariant conditions for
2552 range checks applied to the iteration variable, then initialize these
2553 conditions in front of the loop. Otherwise, leave them set to True.
2555 ??? The heuristics need to be improved, by taking into account the
2556 following datapoints:
2557 - loop unswitching is disabled for big loops. The cap is the
2558 parameter PARAM_MAX_UNSWITCH_INSNS (50).
2559 - loop unswitching can only be applied a small number of times
2560 to a given loop. The cap is PARAM_MAX_UNSWITCH_LEVEL (3).
2561 - the front-end quickly generates useless or redundant checks
2562 that can be entirely optimized away in the end. */
2563 if (1 <= n_checks && n_checks <= 4)
2565 VEC_iterate (range_check_info, gnu_loop_info->checks, i, rci);
2569 = build_binary_op (GE_EXPR, boolean_type_node,
2570 convert (rci->type, gnu_low),
2573 = build_binary_op (LE_EXPR, boolean_type_node,
2574 convert (rci->type, gnu_high),
2577 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
2580 TREE_OPERAND (rci->invariant_cond, 0)
2581 = build_unary_op (TRUTH_NOT_EXPR, boolean_type_node, range_ok);
2583 add_stmt_with_node_force (rci->invariant_cond, gnat_node);
2586 add_stmt (gnu_loop_stmt);
2588 gnu_loop_stmt = end_stmt_group ();
2591 /* If we have an outer COND_EXPR, that's our result and this loop is its
2592 "true" statement. Otherwise, the result is the LOOP_STMT. */
2595 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2596 gnu_result = gnu_cond_expr;
2597 recalculate_side_effects (gnu_cond_expr);
2600 gnu_result = gnu_loop_stmt;
2602 VEC_pop (loop_info, gnu_loop_stack);
2607 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2608 handler for the current function. */
2610 /* This is implemented by issuing a call to the appropriate VMS specific
2611 builtin. To avoid having VMS specific sections in the global gigi decls
2612 array, we maintain the decls of interest here. We can't declare them
2613 inside the function because we must mark them never to be GC'd, which we
2614 can only do at the global level. */
2616 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2617 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2620 establish_gnat_vms_condition_handler (void)
2622 tree establish_stmt;
2624 /* Elaborate the required decls on the first call. Check on the decl for
2625 the gnat condition handler to decide, as this is one we create so we are
2626 sure that it will be non null on subsequent calls. The builtin decl is
2627 looked up so remains null on targets where it is not implemented yet. */
2628 if (gnat_vms_condition_handler_decl == NULL_TREE)
2630 vms_builtin_establish_handler_decl
2632 (get_identifier ("__builtin_establish_vms_condition_handler"));
2634 gnat_vms_condition_handler_decl
2635 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2637 build_function_type_list (boolean_type_node,
2641 NULL_TREE, false, true, true, true, NULL,
2644 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2645 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2648 /* Do nothing if the establish builtin is not available, which might happen
2649 on targets where the facility is not implemented. */
2650 if (vms_builtin_establish_handler_decl == NULL_TREE)
2654 = build_call_n_expr (vms_builtin_establish_handler_decl, 1,
2656 (ADDR_EXPR, NULL_TREE,
2657 gnat_vms_condition_handler_decl));
2659 add_stmt (establish_stmt);
2662 /* This page implements a form of Named Return Value optimization modelled
2663 on the C++ optimization of the same name. The main difference is that
2664 we disregard any semantical considerations when applying it here, the
2665 counterpart being that we don't try to apply it to semantically loaded
2666 return types, i.e. types with the TYPE_BY_REFERENCE_P flag set.
2668 We consider a function body of the following GENERIC form:
2672 RETURN_EXPR [<retval> = ...]
2674 RETURN_EXPR [<retval> = R1]
2678 RETURN_EXPR [<retval> = ...]
2680 RETURN_EXPR [<retval> = Ri]
2683 and we try to fulfill a simple criterion that would make it possible to
2684 replace one or several Ri variables with the RESULT_DECL of the function.
2686 The first observation is that RETURN_EXPRs that don't directly reference
2687 any of the Ri variables on the RHS of their assignment are transparent wrt
2688 the optimization. This is because the Ri variables aren't addressable so
2689 any transformation applied to them doesn't affect the RHS; moreover, the
2690 assignment writes the full <retval> object so existing values are entirely
2693 This property can be extended to some forms of RETURN_EXPRs that reference
2694 the Ri variables, for example CONSTRUCTORs, but isn't true in the general
2695 case, in particular when function calls are involved.
2697 Therefore the algorithm is as follows:
2699 1. Collect the list of candidates for a Named Return Value (Ri variables
2700 on the RHS of assignments of RETURN_EXPRs) as well as the list of the
2701 other expressions on the RHS of such assignments.
2703 2. Prune the members of the first list (candidates) that are referenced
2704 by a member of the second list (expressions).
2706 3. Extract a set of candidates with non-overlapping live ranges from the
2707 first list. These are the Named Return Values.
2709 4. Adjust the relevant RETURN_EXPRs and replace the occurrences of the
2710 Named Return Values in the function with the RESULT_DECL.
2712 If the function returns an unconstrained type, things are a bit different
2713 because the anonymous return object is allocated on the secondary stack
2714 and RESULT_DECL is only a pointer to it. Each return object can be of a
2715 different size and is allocated separately so we need not care about the
2716 aforementioned overlapping issues. Therefore, we don't collect the other
2717 expressions and skip step #2 in the algorithm. */
2724 struct pointer_set_t *visited;
2727 /* Return true if T is a Named Return Value. */
2730 is_nrv_p (bitmap nrv, tree t)
2732 return TREE_CODE (t) == VAR_DECL && bitmap_bit_p (nrv, DECL_UID (t));
2735 /* Helper function for walk_tree, used by finalize_nrv below. */
2738 prune_nrv_r (tree *tp, int *walk_subtrees, void *data)
2740 struct nrv_data *dp = (struct nrv_data *)data;
2743 /* No need to walk into types or decls. */
2744 if (IS_TYPE_OR_DECL_P (t))
2747 if (is_nrv_p (dp->nrv, t))
2748 bitmap_clear_bit (dp->nrv, DECL_UID (t));
2753 /* Prune Named Return Values in BLOCK and return true if there is still a
2754 Named Return Value in BLOCK or one of its sub-blocks. */
2757 prune_nrv_in_block (bitmap nrv, tree block)
2759 bool has_nrv = false;
2762 /* First recurse on the sub-blocks. */
2763 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
2764 has_nrv |= prune_nrv_in_block (nrv, t);
2766 /* Then make sure to keep at most one NRV per block. */
2767 for (t = BLOCK_VARS (block); t; t = DECL_CHAIN (t))
2768 if (is_nrv_p (nrv, t))
2771 bitmap_clear_bit (nrv, DECL_UID (t));
2779 /* Helper function for walk_tree, used by finalize_nrv below. */
2782 finalize_nrv_r (tree *tp, int *walk_subtrees, void *data)
2784 struct nrv_data *dp = (struct nrv_data *)data;
2787 /* No need to walk into types. */
2791 /* Change RETURN_EXPRs of NRVs to just refer to the RESULT_DECL; this is a
2792 nop, but differs from using NULL_TREE in that it indicates that we care
2793 about the value of the RESULT_DECL. */
2794 else if (TREE_CODE (t) == RETURN_EXPR
2795 && TREE_CODE (TREE_OPERAND (t, 0)) == MODIFY_EXPR)
2797 tree ret_val = TREE_OPERAND (TREE_OPERAND (t, 0), 1), init_expr;
2799 /* If this is the temporary created for a return value with variable
2800 size in call_to_gnu, we replace the RHS with the init expression. */
2801 if (TREE_CODE (ret_val) == COMPOUND_EXPR
2802 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR
2803 && TREE_OPERAND (TREE_OPERAND (ret_val, 0), 0)
2804 == TREE_OPERAND (ret_val, 1))
2806 init_expr = TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1);
2807 ret_val = TREE_OPERAND (ret_val, 1);
2810 init_expr = NULL_TREE;
2812 /* Strip useless conversions around the return value. */
2813 if (gnat_useless_type_conversion (ret_val))
2814 ret_val = TREE_OPERAND (ret_val, 0);
2816 if (is_nrv_p (dp->nrv, ret_val))
2819 TREE_OPERAND (TREE_OPERAND (t, 0), 1) = init_expr;
2821 TREE_OPERAND (t, 0) = dp->result;
2825 /* Replace the DECL_EXPR of NRVs with an initialization of the RESULT_DECL,
2827 else if (TREE_CODE (t) == DECL_EXPR
2828 && is_nrv_p (dp->nrv, DECL_EXPR_DECL (t)))
2830 tree var = DECL_EXPR_DECL (t), init;
2832 if (DECL_INITIAL (var))
2834 init = build_binary_op (INIT_EXPR, NULL_TREE, dp->result,
2835 DECL_INITIAL (var));
2836 SET_EXPR_LOCATION (init, EXPR_LOCATION (t));
2837 DECL_INITIAL (var) = NULL_TREE;
2840 init = build_empty_stmt (EXPR_LOCATION (t));
2843 /* Identify the NRV to the RESULT_DECL for debugging purposes. */
2844 SET_DECL_VALUE_EXPR (var, dp->result);
2845 DECL_HAS_VALUE_EXPR_P (var) = 1;
2846 /* ??? Kludge to avoid an assertion failure during inlining. */
2847 DECL_SIZE (var) = bitsize_unit_node;
2848 DECL_SIZE_UNIT (var) = size_one_node;
2851 /* And replace all uses of NRVs with the RESULT_DECL. */
2852 else if (is_nrv_p (dp->nrv, t))
2853 *tp = convert (TREE_TYPE (t), dp->result);
2855 /* Avoid walking into the same tree more than once. Unfortunately, we
2856 can't just use walk_tree_without_duplicates because it would only
2857 call us for the first occurrence of NRVs in the function body. */
2858 if (pointer_set_insert (dp->visited, *tp))
2864 /* Likewise, but used when the function returns an unconstrained type. */
2867 finalize_nrv_unc_r (tree *tp, int *walk_subtrees, void *data)
2869 struct nrv_data *dp = (struct nrv_data *)data;
2872 /* No need to walk into types. */
2876 /* We need to see the DECL_EXPR of NRVs before any other references so we
2877 walk the body of BIND_EXPR before walking its variables. */
2878 else if (TREE_CODE (t) == BIND_EXPR)
2879 walk_tree (&BIND_EXPR_BODY (t), finalize_nrv_unc_r, data, NULL);
2881 /* Change RETURN_EXPRs of NRVs to assign to the RESULT_DECL only the final
2882 return value built by the allocator instead of the whole construct. */
2883 else if (TREE_CODE (t) == RETURN_EXPR
2884 && TREE_CODE (TREE_OPERAND (t, 0)) == MODIFY_EXPR)
2886 tree ret_val = TREE_OPERAND (TREE_OPERAND (t, 0), 1);
2888 /* This is the construct returned by the allocator. */
2889 if (TREE_CODE (ret_val) == COMPOUND_EXPR
2890 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR)
2892 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (ret_val)))
2894 = VEC_index (constructor_elt,
2896 (TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1)),
2899 ret_val = TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1);
2902 /* Strip useless conversions around the return value. */
2903 if (gnat_useless_type_conversion (ret_val)
2904 || TREE_CODE (ret_val) == VIEW_CONVERT_EXPR)
2905 ret_val = TREE_OPERAND (ret_val, 0);
2907 /* Strip unpadding around the return value. */
2908 if (TREE_CODE (ret_val) == COMPONENT_REF
2909 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (ret_val, 0))))
2910 ret_val = TREE_OPERAND (ret_val, 0);
2912 /* Assign the new return value to the RESULT_DECL. */
2913 if (is_nrv_p (dp->nrv, ret_val))
2914 TREE_OPERAND (TREE_OPERAND (t, 0), 1)
2915 = TREE_OPERAND (DECL_INITIAL (ret_val), 0);
2918 /* Adjust the DECL_EXPR of NRVs to call the allocator and save the result
2919 into a new variable. */
2920 else if (TREE_CODE (t) == DECL_EXPR
2921 && is_nrv_p (dp->nrv, DECL_EXPR_DECL (t)))
2923 tree saved_current_function_decl = current_function_decl;
2924 tree var = DECL_EXPR_DECL (t);
2925 tree alloc, p_array, new_var, new_ret;
2926 VEC(constructor_elt,gc) *v = VEC_alloc (constructor_elt, gc, 2);
2928 /* Create an artificial context to build the allocation. */
2929 current_function_decl = decl_function_context (var);
2930 start_stmt_group ();
2933 /* This will return a COMPOUND_EXPR with the allocation in the first
2934 arm and the final return value in the second arm. */
2935 alloc = build_allocator (TREE_TYPE (var), DECL_INITIAL (var),
2936 TREE_TYPE (dp->result),
2937 Procedure_To_Call (dp->gnat_ret),
2938 Storage_Pool (dp->gnat_ret),
2941 /* The new variable is built as a reference to the allocated space. */
2943 = build_decl (DECL_SOURCE_LOCATION (var), VAR_DECL, DECL_NAME (var),
2944 build_reference_type (TREE_TYPE (var)));
2945 DECL_BY_REFERENCE (new_var) = 1;
2947 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (alloc)))
2949 /* The new initial value is a COMPOUND_EXPR with the allocation in
2950 the first arm and the value of P_ARRAY in the second arm. */
2951 DECL_INITIAL (new_var)
2952 = build2 (COMPOUND_EXPR, TREE_TYPE (new_var),
2953 TREE_OPERAND (alloc, 0),
2954 VEC_index (constructor_elt,
2955 CONSTRUCTOR_ELTS (TREE_OPERAND (alloc, 1)),
2958 /* Build a modified CONSTRUCTOR that references NEW_VAR. */
2959 p_array = TYPE_FIELDS (TREE_TYPE (alloc));
2960 CONSTRUCTOR_APPEND_ELT (v, p_array,
2961 fold_convert (TREE_TYPE (p_array), new_var));
2962 CONSTRUCTOR_APPEND_ELT (v, DECL_CHAIN (p_array),
2963 VEC_index (constructor_elt,
2965 (TREE_OPERAND (alloc, 1)),
2967 new_ret = build_constructor (TREE_TYPE (alloc), v);
2971 /* The new initial value is just the allocation. */
2972 DECL_INITIAL (new_var) = alloc;
2973 new_ret = fold_convert (TREE_TYPE (alloc), new_var);
2976 gnat_pushdecl (new_var, Empty);
2978 /* Destroy the artificial context and insert the new statements. */
2980 *tp = end_stmt_group ();
2981 current_function_decl = saved_current_function_decl;
2983 /* Chain NEW_VAR immediately after VAR and ignore the latter. */
2984 DECL_CHAIN (new_var) = DECL_CHAIN (var);
2985 DECL_CHAIN (var) = new_var;
2986 DECL_IGNORED_P (var) = 1;
2988 /* Save the new return value and the dereference of NEW_VAR. */
2990 = build2 (COMPOUND_EXPR, TREE_TYPE (var), new_ret,
2991 build1 (INDIRECT_REF, TREE_TYPE (var), new_var));
2992 /* ??? Kludge to avoid messing up during inlining. */
2993 DECL_CONTEXT (var) = NULL_TREE;
2996 /* And replace all uses of NRVs with the dereference of NEW_VAR. */
2997 else if (is_nrv_p (dp->nrv, t))
2998 *tp = TREE_OPERAND (DECL_INITIAL (t), 1);
3000 /* Avoid walking into the same tree more than once. Unfortunately, we
3001 can't just use walk_tree_without_duplicates because it would only
3002 call us for the first occurrence of NRVs in the function body. */
3003 if (pointer_set_insert (dp->visited, *tp))
3009 /* Finalize the Named Return Value optimization for FNDECL. The NRV bitmap
3010 contains the candidates for Named Return Value and OTHER is a list of
3011 the other return values. GNAT_RET is a representative return node. */
3014 finalize_nrv (tree fndecl, bitmap nrv, VEC(tree,gc) *other, Node_Id gnat_ret)
3016 struct cgraph_node *node;
3017 struct nrv_data data;
3022 /* We shouldn't be applying the optimization to return types that we aren't
3023 allowed to manipulate freely. */
3024 gcc_assert (!TYPE_IS_BY_REFERENCE_P (TREE_TYPE (TREE_TYPE (fndecl))));
3026 /* Prune the candidates that are referenced by other return values. */
3028 data.result = NULL_TREE;
3029 data.visited = NULL;
3030 for (i = 0; VEC_iterate(tree, other, i, iter); i++)
3031 walk_tree_without_duplicates (&iter, prune_nrv_r, &data);
3032 if (bitmap_empty_p (nrv))
3035 /* Prune also the candidates that are referenced by nested functions. */
3036 node = cgraph_get_create_node (fndecl);
3037 for (node = node->nested; node; node = node->next_nested)
3038 walk_tree_without_duplicates (&DECL_SAVED_TREE (node->decl), prune_nrv_r,
3040 if (bitmap_empty_p (nrv))
3043 /* Extract a set of NRVs with non-overlapping live ranges. */
3044 if (!prune_nrv_in_block (nrv, DECL_INITIAL (fndecl)))
3047 /* Adjust the relevant RETURN_EXPRs and replace the occurrences of NRVs. */
3049 data.result = DECL_RESULT (fndecl);
3050 data.gnat_ret = gnat_ret;
3051 data.visited = pointer_set_create ();
3052 if (TYPE_RETURN_UNCONSTRAINED_P (TREE_TYPE (fndecl)))
3053 func = finalize_nrv_unc_r;
3055 func = finalize_nrv_r;
3056 walk_tree (&DECL_SAVED_TREE (fndecl), func, &data, NULL);
3057 pointer_set_destroy (data.visited);
3060 /* Return true if RET_VAL can be used as a Named Return Value for the
3061 anonymous return object RET_OBJ. */
3064 return_value_ok_for_nrv_p (tree ret_obj, tree ret_val)
3066 if (TREE_CODE (ret_val) != VAR_DECL)
3069 if (TREE_THIS_VOLATILE (ret_val))
3072 if (DECL_CONTEXT (ret_val) != current_function_decl)
3075 if (TREE_STATIC (ret_val))
3078 if (TREE_ADDRESSABLE (ret_val))
3081 if (ret_obj && DECL_ALIGN (ret_val) > DECL_ALIGN (ret_obj))
3087 /* Build a RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR around
3088 the assignment of RET_VAL to RET_OBJ. Otherwise build a bare RETURN_EXPR
3089 around RESULT_OBJ, which may be null in this case. */
3092 build_return_expr (tree ret_obj, tree ret_val)
3098 /* The gimplifier explicitly enforces the following invariant:
3107 As a consequence, type consistency dictates that we use the type
3108 of the RET_OBJ as the operation type. */
3109 tree operation_type = TREE_TYPE (ret_obj);
3111 /* Convert the right operand to the operation type. Note that it's the
3112 same transformation as in the MODIFY_EXPR case of build_binary_op,
3113 with the assumption that the type cannot involve a placeholder. */
3114 if (operation_type != TREE_TYPE (ret_val))
3115 ret_val = convert (operation_type, ret_val);
3117 result_expr = build2 (MODIFY_EXPR, void_type_node, ret_obj, ret_val);
3119 /* If the function returns an aggregate type, find out whether this is
3120 a candidate for Named Return Value. If so, record it. Otherwise,
3121 if this is an expression of some kind, record it elsewhere. */
3123 && AGGREGATE_TYPE_P (operation_type)
3124 && !TYPE_IS_FAT_POINTER_P (operation_type)
3125 && aggregate_value_p (operation_type, current_function_decl))
3127 /* Recognize the temporary created for a return value with variable
3128 size in call_to_gnu. We want to eliminate it if possible. */
3129 if (TREE_CODE (ret_val) == COMPOUND_EXPR
3130 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR
3131 && TREE_OPERAND (TREE_OPERAND (ret_val, 0), 0)
3132 == TREE_OPERAND (ret_val, 1))
3133 ret_val = TREE_OPERAND (ret_val, 1);
3135 /* Strip useless conversions around the return value. */
3136 if (gnat_useless_type_conversion (ret_val))
3137 ret_val = TREE_OPERAND (ret_val, 0);
3139 /* Now apply the test to the return value. */
3140 if (return_value_ok_for_nrv_p (ret_obj, ret_val))
3142 if (!f_named_ret_val)
3143 f_named_ret_val = BITMAP_GGC_ALLOC ();
3144 bitmap_set_bit (f_named_ret_val, DECL_UID (ret_val));
3147 /* Note that we need not care about CONSTRUCTORs here, as they are
3148 totally transparent given the read-compose-write semantics of
3149 assignments from CONSTRUCTORs. */
3150 else if (EXPR_P (ret_val))
3151 VEC_safe_push (tree, gc, f_other_ret_val, ret_val);
3155 result_expr = ret_obj;
3157 return build1 (RETURN_EXPR, void_type_node, result_expr);
3160 /* Build a stub for the subprogram specified by the GCC tree GNU_SUBPROG
3161 and the GNAT node GNAT_SUBPROG. */
3164 build_function_stub (tree gnu_subprog, Entity_Id gnat_subprog)
3166 tree gnu_subprog_type, gnu_subprog_addr, gnu_subprog_call;
3167 tree gnu_subprog_param, gnu_stub_param, gnu_param;
3168 tree gnu_stub_decl = DECL_FUNCTION_STUB (gnu_subprog);
3169 VEC(tree,gc) *gnu_param_vec = NULL;
3171 gnu_subprog_type = TREE_TYPE (gnu_subprog);
3173 /* Initialize the information structure for the function. */
3174 allocate_struct_function (gnu_stub_decl, false);
3177 begin_subprog_body (gnu_stub_decl);
3179 start_stmt_group ();
3182 /* Loop over the parameters of the stub and translate any of them
3183 passed by descriptor into a by reference one. */
3184 for (gnu_stub_param = DECL_ARGUMENTS (gnu_stub_decl),
3185 gnu_subprog_param = DECL_ARGUMENTS (gnu_subprog);
3187 gnu_stub_param = DECL_CHAIN (gnu_stub_param),
3188 gnu_subprog_param = DECL_CHAIN (gnu_subprog_param))
3190 if (DECL_BY_DESCRIPTOR_P (gnu_stub_param))
3192 gcc_assert (DECL_BY_REF_P (gnu_subprog_param));
3194 = convert_vms_descriptor (TREE_TYPE (gnu_subprog_param),
3196 DECL_PARM_ALT_TYPE (gnu_stub_param),
3197 DECL_BY_DOUBLE_REF_P (gnu_subprog_param),
3201 gnu_param = gnu_stub_param;
3203 VEC_safe_push (tree, gc, gnu_param_vec, gnu_param);
3206 /* Invoke the internal subprogram. */
3207 gnu_subprog_addr = build1 (ADDR_EXPR, build_pointer_type (gnu_subprog_type),
3209 gnu_subprog_call = build_call_vec (TREE_TYPE (gnu_subprog_type),
3210 gnu_subprog_addr, gnu_param_vec);
3212 /* Propagate the return value, if any. */
3213 if (VOID_TYPE_P (TREE_TYPE (gnu_subprog_type)))
3214 add_stmt (gnu_subprog_call);
3216 add_stmt (build_return_expr (DECL_RESULT (gnu_stub_decl),
3220 end_subprog_body (end_stmt_group ());
3221 rest_of_subprog_body_compilation (gnu_stub_decl);
3224 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
3225 don't return anything. */
3228 Subprogram_Body_to_gnu (Node_Id gnat_node)
3230 /* Defining identifier of a parameter to the subprogram. */
3231 Entity_Id gnat_param;
3232 /* The defining identifier for the subprogram body. Note that if a
3233 specification has appeared before for this body, then the identifier
3234 occurring in that specification will also be a defining identifier and all
3235 the calls to this subprogram will point to that specification. */
3236 Entity_Id gnat_subprog_id
3237 = (Present (Corresponding_Spec (gnat_node))
3238 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
3239 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
3240 tree gnu_subprog_decl;
3241 /* Its RESULT_DECL node. */
3242 tree gnu_result_decl;
3243 /* Its FUNCTION_TYPE node. */
3244 tree gnu_subprog_type;
3245 /* The TYPE_CI_CO_LIST of its FUNCTION_TYPE node, if any. */
3247 /* The entry in the CI_CO_LIST that represents a function return, if any. */
3248 tree gnu_return_var_elmt = NULL_TREE;
3250 struct language_function *gnu_subprog_language;
3251 VEC(parm_attr,gc) *cache;
3253 /* If this is a generic object or if it has been eliminated,
3255 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
3256 || Ekind (gnat_subprog_id) == E_Generic_Function
3257 || Is_Eliminated (gnat_subprog_id))
3260 /* If this subprogram acts as its own spec, define it. Otherwise, just get
3261 the already-elaborated tree node. However, if this subprogram had its
3262 elaboration deferred, we will already have made a tree node for it. So
3263 treat it as not being defined in that case. Such a subprogram cannot
3264 have an address clause or a freeze node, so this test is safe, though it
3265 does disable some otherwise-useful error checking. */
3267 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
3268 Acts_As_Spec (gnat_node)
3269 && !present_gnu_tree (gnat_subprog_id));
3270 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
3271 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
3272 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
3274 gnu_return_var_elmt = value_member (void_type_node, gnu_cico_list);
3276 /* If the function returns by invisible reference, make it explicit in the
3277 function body. See gnat_to_gnu_entity, E_Subprogram_Type case.
3278 Handle the explicit case here and the copy-in/copy-out case below. */
3279 if (TREE_ADDRESSABLE (gnu_subprog_type) && !gnu_return_var_elmt)
3281 TREE_TYPE (gnu_result_decl)
3282 = build_reference_type (TREE_TYPE (gnu_result_decl));
3283 relayout_decl (gnu_result_decl);
3286 /* Set the line number in the decl to correspond to that of the body so that
3287 the line number notes are written correctly. */
3288 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
3290 /* Initialize the information structure for the function. */
3291 allocate_struct_function (gnu_subprog_decl, false);
3292 gnu_subprog_language = ggc_alloc_cleared_language_function ();
3293 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language = gnu_subprog_language;
3296 begin_subprog_body (gnu_subprog_decl);
3298 /* If there are In Out or Out parameters, we need to ensure that the return
3299 statement properly copies them out. We do this by making a new block and
3300 converting any return into a goto to a label at the end of the block. */
3303 tree gnu_return_var = NULL_TREE;
3305 VEC_safe_push (tree, gc, gnu_return_label_stack,
3306 create_artificial_label (input_location));
3308 start_stmt_group ();
3311 /* If this is a function with In Out or Out parameters, we also need a
3312 variable for the return value to be placed. */
3313 if (gnu_return_var_elmt)
3315 tree gnu_return_type
3316 = TREE_TYPE (TREE_PURPOSE (gnu_return_var_elmt));
3318 /* If the function returns by invisible reference, make it
3319 explicit in the function body. See gnat_to_gnu_entity,
3320 E_Subprogram_Type case. */
3321 if (TREE_ADDRESSABLE (gnu_subprog_type))
3322 gnu_return_type = build_reference_type (gnu_return_type);
3325 = create_var_decl (get_identifier ("RETVAL"), NULL_TREE,
3326 gnu_return_type, NULL_TREE, false, false,
3327 false, false, NULL, gnat_subprog_id);
3328 TREE_VALUE (gnu_return_var_elmt) = gnu_return_var;
3331 VEC_safe_push (tree, gc, gnu_return_var_stack, gnu_return_var);
3333 /* See whether there are parameters for which we don't have a GCC tree
3334 yet. These must be Out parameters. Make a VAR_DECL for them and
3335 put it into TYPE_CI_CO_LIST, which must contain an empty entry too.
3336 We can match up the entries because TYPE_CI_CO_LIST is in the order
3337 of the parameters. */
3338 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
3339 Present (gnat_param);
3340 gnat_param = Next_Formal_With_Extras (gnat_param))
3341 if (!present_gnu_tree (gnat_param))
3343 tree gnu_cico_entry = gnu_cico_list;
3345 /* Skip any entries that have been already filled in; they must
3346 correspond to In Out parameters. */
3347 while (gnu_cico_entry && TREE_VALUE (gnu_cico_entry))
3348 gnu_cico_entry = TREE_CHAIN (gnu_cico_entry);
3350 /* Do any needed references for padded types. */
3351 TREE_VALUE (gnu_cico_entry)
3352 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_entry)),
3353 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
3357 VEC_safe_push (tree, gc, gnu_return_label_stack, NULL_TREE);
3359 /* Get a tree corresponding to the code for the subprogram. */
3360 start_stmt_group ();
3363 /* On VMS, establish our condition handler to possibly turn a condition into
3364 the corresponding exception if the subprogram has a foreign convention or
3367 To ensure proper execution of local finalizations on condition instances,
3368 we must turn a condition into the corresponding exception even if there
3369 is no applicable Ada handler, and need at least one condition handler per
3370 possible call chain involving GNAT code. OTOH, establishing the handler
3371 has a cost so we want to minimize the number of subprograms into which
3372 this happens. The foreign or exported condition is expected to satisfy
3373 all the constraints. */
3374 if (TARGET_ABI_OPEN_VMS
3375 && (Has_Foreign_Convention (gnat_subprog_id)
3376 || Is_Exported (gnat_subprog_id)))
3377 establish_gnat_vms_condition_handler ();
3379 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
3381 /* Generate the code of the subprogram itself. A return statement will be
3382 present and any Out parameters will be handled there. */
3383 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
3385 gnu_result = end_stmt_group ();
3387 /* If we populated the parameter attributes cache, we need to make sure that
3388 the cached expressions are evaluated on all the possible paths leading to
3389 their uses. So we force their evaluation on entry of the function. */
3390 cache = gnu_subprog_language->parm_attr_cache;
3393 struct parm_attr_d *pa;
3396 start_stmt_group ();
3398 FOR_EACH_VEC_ELT (parm_attr, cache, i, pa)
3401 add_stmt_with_node_force (pa->first, gnat_node);
3403 add_stmt_with_node_force (pa->last, gnat_node);
3405 add_stmt_with_node_force (pa->length, gnat_node);
3408 add_stmt (gnu_result);
3409 gnu_result = end_stmt_group ();
3411 gnu_subprog_language->parm_attr_cache = NULL;
3414 /* If we are dealing with a return from an Ada procedure with parameters
3415 passed by copy-in/copy-out, we need to return a record containing the
3416 final values of these parameters. If the list contains only one entry,
3417 return just that entry though.
3419 For a full description of the copy-in/copy-out parameter mechanism, see
3420 the part of the gnat_to_gnu_entity routine dealing with the translation
3423 We need to make a block that contains the definition of that label and
3424 the copying of the return value. It first contains the function, then
3425 the label and copy statement. */
3430 add_stmt (gnu_result);
3431 add_stmt (build1 (LABEL_EXPR, void_type_node,
3432 VEC_last (tree, gnu_return_label_stack)));
3434 if (list_length (gnu_cico_list) == 1)
3435 gnu_retval = TREE_VALUE (gnu_cico_list);
3437 gnu_retval = build_constructor_from_list (TREE_TYPE (gnu_subprog_type),
3440 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
3441 End_Label (Handled_Statement_Sequence (gnat_node)));
3443 gnu_result = end_stmt_group ();
3446 VEC_pop (tree, gnu_return_label_stack);
3448 /* Attempt setting the end_locus of our GCC body tree, typically a
3449 BIND_EXPR or STATEMENT_LIST, then the end_locus of our GCC subprogram
3450 declaration tree. */
3451 set_end_locus_from_node (gnu_result, gnat_node);
3452 set_end_locus_from_node (gnu_subprog_decl, gnat_node);
3454 end_subprog_body (gnu_result);
3456 /* Finally annotate the parameters and disconnect the trees for parameters
3457 that we have turned into variables since they are now unusable. */
3458 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
3459 Present (gnat_param);
3460 gnat_param = Next_Formal_With_Extras (gnat_param))
3462 tree gnu_param = get_gnu_tree (gnat_param);
3463 bool is_var_decl = (TREE_CODE (gnu_param) == VAR_DECL);
3465 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
3466 DECL_BY_REF_P (gnu_param),
3467 !is_var_decl && DECL_BY_DOUBLE_REF_P (gnu_param));
3470 save_gnu_tree (gnat_param, NULL_TREE, false);
3473 /* Disconnect the variable created for the return value. */
3474 if (gnu_return_var_elmt)
3475 TREE_VALUE (gnu_return_var_elmt) = void_type_node;
3477 /* If the function returns an aggregate type and we have candidates for
3478 a Named Return Value, finalize the optimization. */
3479 if (optimize && gnu_subprog_language->named_ret_val)
3481 finalize_nrv (gnu_subprog_decl,
3482 gnu_subprog_language->named_ret_val,
3483 gnu_subprog_language->other_ret_val,
3484 gnu_subprog_language->gnat_ret);
3485 gnu_subprog_language->named_ret_val = NULL;
3486 gnu_subprog_language->other_ret_val = NULL;
3489 rest_of_subprog_body_compilation (gnu_subprog_decl);
3491 /* If there is a stub associated with the function, build it now. */
3492 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
3493 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
3495 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
3498 /* Return true if GNAT_NODE requires atomic synchronization. */
3501 atomic_sync_required_p (Node_Id gnat_node)
3503 const Node_Id gnat_parent = Parent (gnat_node);
3505 unsigned char attr_id;
3507 /* First, scan the node to find the Atomic_Sync_Required flag. */
3508 kind = Nkind (gnat_node);
3509 if (kind == N_Type_Conversion || kind == N_Unchecked_Type_Conversion)
3511 gnat_node = Expression (gnat_node);
3512 kind = Nkind (gnat_node);
3517 case N_Expanded_Name:
3518 case N_Explicit_Dereference:
3520 case N_Indexed_Component:
3521 case N_Selected_Component:
3522 if (!Atomic_Sync_Required (gnat_node))
3530 /* Then, scan the parent to find out cases where the flag is irrelevant. */
3531 kind = Nkind (gnat_parent);
3534 case N_Attribute_Reference:
3535 attr_id = Get_Attribute_Id (Attribute_Name (gnat_parent));
3536 /* Do not mess up machine code insertions. */
3537 if (attr_id == Attr_Asm_Input || attr_id == Attr_Asm_Output)
3541 case N_Object_Renaming_Declaration:
3542 /* Do not generate a function call as a renamed object. */
3552 /* Create a temporary variable with PREFIX and TYPE, and return it. */
3555 create_temporary (const char *prefix, tree type)
3557 tree gnu_temp = create_var_decl (create_tmp_var_name (prefix), NULL_TREE,
3558 type, NULL_TREE, false, false, false, false,
3560 DECL_ARTIFICIAL (gnu_temp) = 1;
3561 DECL_IGNORED_P (gnu_temp) = 1;
3566 /* Create a temporary variable with PREFIX and initialize it with GNU_INIT.
3567 Put the initialization statement into GNU_INIT_STMT and annotate it with
3568 the SLOC of GNAT_NODE. Return the temporary variable. */
3571 create_init_temporary (const char *prefix, tree gnu_init, tree *gnu_init_stmt,
3574 tree gnu_temp = create_temporary (prefix, TREE_TYPE (gnu_init));
3576 *gnu_init_stmt = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_init);
3577 set_expr_location_from_node (*gnu_init_stmt, gnat_node);
3582 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
3583 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
3584 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
3585 If GNU_TARGET is non-null, this must be a function call on the RHS of a
3586 N_Assignment_Statement and the result is to be placed into that object.
3587 If, in addition, ATOMIC_SYNC is true, then the assignment to GNU_TARGET
3588 requires atomic synchronization. */
3591 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target,
3594 const bool function_call = (Nkind (gnat_node) == N_Function_Call);
3595 const bool returning_value = (function_call && !gnu_target);
3596 /* The GCC node corresponding to the GNAT subprogram name. This can either
3597 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
3598 or an indirect reference expression (an INDIRECT_REF node) pointing to a
3600 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
3601 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
3602 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
3603 /* The return type of the FUNCTION_TYPE. */
3604 tree gnu_result_type = TREE_TYPE (gnu_subprog_type);
3605 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
3606 VEC(tree,gc) *gnu_actual_vec = NULL;
3607 tree gnu_name_list = NULL_TREE;
3608 tree gnu_stmt_list = NULL_TREE;
3609 tree gnu_after_list = NULL_TREE;
3610 tree gnu_retval = NULL_TREE;
3611 tree gnu_call, gnu_result;
3612 bool went_into_elab_proc = false;
3613 bool pushed_binding_level = false;
3614 Entity_Id gnat_formal;
3615 Node_Id gnat_actual;
3617 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
3619 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
3620 all our args first. */
3621 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
3623 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
3624 gnat_node, N_Raise_Program_Error);
3626 for (gnat_actual = First_Actual (gnat_node);
3627 Present (gnat_actual);
3628 gnat_actual = Next_Actual (gnat_actual))
3629 add_stmt (gnat_to_gnu (gnat_actual));
3631 if (returning_value)
3633 *gnu_result_type_p = gnu_result_type;
3634 return build1 (NULL_EXPR, gnu_result_type, call_expr);
3640 /* The only way we can be making a call via an access type is if Name is an
3641 explicit dereference. In that case, get the list of formal args from the
3642 type the access type is pointing to. Otherwise, get the formals from the
3643 entity being called. */
3644 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
3645 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
3646 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
3647 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
3648 gnat_formal = Empty;
3650 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
3652 /* The lifetime of the temporaries created for the call ends right after the
3653 return value is copied, so we can give them the scope of the elaboration
3654 routine at top level. */
3655 if (!current_function_decl)
3657 current_function_decl = get_elaboration_procedure ();
3658 went_into_elab_proc = true;
3661 /* First, create the temporary for the return value when:
3663 1. There is no target and the function has copy-in/copy-out parameters,
3664 because we need to preserve the return value before copying back the
3667 2. There is no target and this is not an object declaration, and the
3668 return type has variable size, because in these cases the gimplifier
3669 cannot create the temporary.
3671 3. There is a target and it is a slice or an array with fixed size,
3672 and the return type has variable size, because the gimplifier
3673 doesn't handle these cases.
3675 This must be done before we push a binding level around the call, since
3676 we will pop it before copying the return value. */
3678 && ((!gnu_target && TYPE_CI_CO_LIST (gnu_subprog_type))
3680 && Nkind (Parent (gnat_node)) != N_Object_Declaration
3681 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST)
3683 && (TREE_CODE (gnu_target) == ARRAY_RANGE_REF
3684 || (TREE_CODE (TREE_TYPE (gnu_target)) == ARRAY_TYPE
3685 && TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_target)))
3687 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST)))
3688 gnu_retval = create_temporary ("R", gnu_result_type);
3690 /* Create the list of the actual parameters as GCC expects it, namely a
3691 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
3692 is an expression and the TREE_PURPOSE field is null. But skip Out
3693 parameters not passed by reference and that need not be copied in. */
3694 for (gnat_actual = First_Actual (gnat_node);
3695 Present (gnat_actual);
3696 gnat_formal = Next_Formal_With_Extras (gnat_formal),
3697 gnat_actual = Next_Actual (gnat_actual))
3699 tree gnu_formal = present_gnu_tree (gnat_formal)
3700 ? get_gnu_tree (gnat_formal) : NULL_TREE;
3701 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
3702 const bool is_true_formal_parm
3703 = gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL;
3704 const bool is_by_ref_formal_parm
3705 = is_true_formal_parm
3706 && (DECL_BY_REF_P (gnu_formal)
3707 || DECL_BY_COMPONENT_PTR_P (gnu_formal)
3708 || DECL_BY_DESCRIPTOR_P (gnu_formal));
3709 /* In the Out or In Out case, we must suppress conversions that yield
3710 an lvalue but can nevertheless cause the creation of a temporary,
3711 because we need the real object in this case, either to pass its
3712 address if it's passed by reference or as target of the back copy
3713 done after the call if it uses the copy-in/copy-out mechanism.
3714 We do it in the In case too, except for an unchecked conversion
3715 because it alone can cause the actual to be misaligned and the
3716 addressability test is applied to the real object. */
3717 const bool suppress_type_conversion
3718 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
3719 && Ekind (gnat_formal) != E_In_Parameter)
3720 || (Nkind (gnat_actual) == N_Type_Conversion
3721 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
3722 Node_Id gnat_name = suppress_type_conversion
3723 ? Expression (gnat_actual) : gnat_actual;
3724 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
3727 /* If it's possible we may need to use this expression twice, make sure
3728 that any side-effects are handled via SAVE_EXPRs; likewise if we need
3729 to force side-effects before the call.
3730 ??? This is more conservative than we need since we don't need to do
3731 this for pass-by-ref with no conversion. */
3732 if (Ekind (gnat_formal) != E_In_Parameter)
3733 gnu_name = gnat_stabilize_reference (gnu_name, true, NULL);
3735 /* If we are passing a non-addressable parameter by reference, pass the
3736 address of a copy. In the Out or In Out case, set up to copy back
3737 out after the call. */
3738 if (is_by_ref_formal_parm
3739 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
3740 && !addressable_p (gnu_name, gnu_name_type))
3742 bool in_param = (Ekind (gnat_formal) == E_In_Parameter);
3743 tree gnu_orig = gnu_name, gnu_temp, gnu_stmt;
3745 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
3746 but sort of an instantiation for them. */
3747 if (TREE_CODE (gnu_name) == CONSTRUCTOR)
3750 /* If the type is passed by reference, a copy is not allowed. */
3751 else if (TYPE_IS_BY_REFERENCE_P (gnu_formal_type))
3752 post_error ("misaligned actual cannot be passed by reference",
3755 /* For users of Starlet we issue a warning because the interface
3756 apparently assumes that by-ref parameters outlive the procedure
3757 invocation. The code still will not work as intended, but we
3758 cannot do much better since low-level parts of the back-end
3759 would allocate temporaries at will because of the misalignment
3760 if we did not do so here. */
3761 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
3764 ("?possible violation of implicit assumption", gnat_actual);
3766 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
3767 Entity (Name (gnat_node)));
3768 post_error_ne ("?because of misalignment of &", gnat_actual,
3772 /* If the actual type of the object is already the nominal type,
3773 we have nothing to do, except if the size is self-referential
3774 in which case we'll remove the unpadding below. */
3775 if (TREE_TYPE (gnu_name) == gnu_name_type
3776 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
3779 /* Otherwise remove the unpadding from all the objects. */
3780 else if (TREE_CODE (gnu_name) == COMPONENT_REF
3781 && TYPE_IS_PADDING_P
3782 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
3783 gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0);
3785 /* Otherwise convert to the nominal type of the object if needed.
3786 There are several cases in which we need to make the temporary
3787 using this type instead of the actual type of the object when
3788 they are distinct, because the expectations of the callee would
3789 otherwise not be met:
3790 - if it's a justified modular type,
3791 - if the actual type is a smaller form of it,
3792 - if it's a smaller form of the actual type. */
3793 else if ((TREE_CODE (gnu_name_type) == RECORD_TYPE
3794 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
3795 || smaller_form_type_p (TREE_TYPE (gnu_name),
3797 || (INTEGRAL_TYPE_P (gnu_name_type)
3798 && smaller_form_type_p (gnu_name_type,
3799 TREE_TYPE (gnu_name))))
3800 gnu_name = convert (gnu_name_type, gnu_name);
3802 /* If this is an In Out or Out parameter and we're returning a value,
3803 we need to create a temporary for the return value because we must
3804 preserve it before copying back at the very end. */
3805 if (!in_param && returning_value && !gnu_retval)
3806 gnu_retval = create_temporary ("R", gnu_result_type);
3808 /* If we haven't pushed a binding level, push a new one. This will
3809 narrow the lifetime of the temporary we are about to make as much
3810 as possible. The drawback is that we'd need to create a temporary
3811 for the return value, if any (see comment before the loop). So do
3812 it only when this temporary was already created just above. */
3813 if (!pushed_binding_level && !(in_param && returning_value))
3815 start_stmt_group ();
3817 pushed_binding_level = true;
3820 /* Create an explicit temporary holding the copy. */
3822 = create_init_temporary ("A", gnu_name, &gnu_stmt, gnat_actual);
3824 /* But initialize it on the fly like for an implicit temporary as
3825 we aren't necessarily having a statement list. */
3826 gnu_name = build_compound_expr (TREE_TYPE (gnu_name), gnu_stmt,
3829 /* Set up to move the copy back to the original if needed. */
3832 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig,
3834 set_expr_location_from_node (gnu_stmt, gnat_node);
3835 append_to_statement_list (gnu_stmt, &gnu_after_list);
3839 /* Start from the real object and build the actual. */
3840 gnu_actual = gnu_name;
3842 /* If this is an atomic access of an In or In Out parameter for which
3843 synchronization is required, build the atomic load. */
3844 if (is_true_formal_parm
3845 && !is_by_ref_formal_parm
3846 && Ekind (gnat_formal) != E_Out_Parameter
3847 && atomic_sync_required_p (gnat_actual))
3848 gnu_actual = build_atomic_load (gnu_actual);
3850 /* If this was a procedure call, we may not have removed any padding.
3851 So do it here for the part we will use as an input, if any. */
3852 if (Ekind (gnat_formal) != E_Out_Parameter
3853 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
3855 = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual);
3857 /* Put back the conversion we suppressed above in the computation of the
3858 real object. And even if we didn't suppress any conversion there, we
3859 may have suppressed a conversion to the Etype of the actual earlier,
3860 since the parent is a procedure call, so put it back here. */
3861 if (suppress_type_conversion
3862 && Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
3864 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
3865 gnu_actual, No_Truncation (gnat_actual));
3868 = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual);
3870 /* Make sure that the actual is in range of the formal's type. */
3871 if (Ekind (gnat_formal) != E_Out_Parameter
3872 && Do_Range_Check (gnat_actual))
3874 = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual);
3876 /* Unless this is an In parameter, we must remove any justified modular
3877 building from GNU_NAME to get an lvalue. */
3878 if (Ekind (gnat_formal) != E_In_Parameter
3879 && TREE_CODE (gnu_name) == CONSTRUCTOR
3880 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
3881 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
3883 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name);
3885 /* If we have not saved a GCC object for the formal, it means it is an
3886 Out parameter not passed by reference and that need not be copied in.
3887 Otherwise, first see if the parameter is passed by reference. */
3888 if (is_true_formal_parm && DECL_BY_REF_P (gnu_formal))
3890 if (Ekind (gnat_formal) != E_In_Parameter)
3892 /* In Out or Out parameters passed by reference don't use the
3893 copy-in/copy-out mechanism so the address of the real object
3894 must be passed to the function. */
3895 gnu_actual = gnu_name;
3897 /* If we have a padded type, be sure we've removed padding. */
3898 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
3899 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
3902 /* If we have the constructed subtype of an aliased object
3903 with an unconstrained nominal subtype, the type of the
3904 actual includes the template, although it is formally
3905 constrained. So we need to convert it back to the real
3906 constructed subtype to retrieve the constrained part
3907 and takes its address. */
3908 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
3909 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
3910 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
3911 && Is_Array_Type (Etype (gnat_actual)))
3912 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
3916 /* There is no need to convert the actual to the formal's type before
3917 taking its address. The only exception is for unconstrained array
3918 types because of the way we build fat pointers. */
3919 if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE)
3921 /* Put back a view conversion for In Out or Out parameters. */
3922 if (Ekind (gnat_formal) != E_In_Parameter)
3923 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
3925 gnu_actual = convert (gnu_formal_type, gnu_actual);
3928 /* The symmetry of the paths to the type of an entity is broken here
3929 since arguments don't know that they will be passed by ref. */
3930 gnu_formal_type = TREE_TYPE (gnu_formal);
3932 if (DECL_BY_DOUBLE_REF_P (gnu_formal))
3934 = build_unary_op (ADDR_EXPR, TREE_TYPE (gnu_formal_type),
3937 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
3939 else if (is_true_formal_parm && DECL_BY_COMPONENT_PTR_P (gnu_formal))
3941 gnu_formal_type = TREE_TYPE (gnu_formal);
3942 gnu_actual = maybe_implicit_deref (gnu_actual);
3943 gnu_actual = maybe_unconstrained_array (gnu_actual);
3945 if (TYPE_IS_PADDING_P (gnu_formal_type))
3947 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
3948 gnu_actual = convert (gnu_formal_type, gnu_actual);
3951 /* Take the address of the object and convert to the proper pointer
3952 type. We'd like to actually compute the address of the beginning
3953 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
3954 possibility that the ARRAY_REF might return a constant and we'd be
3955 getting the wrong address. Neither approach is exactly correct,
3956 but this is the most likely to work in all cases. */
3957 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
3959 else if (is_true_formal_parm && DECL_BY_DESCRIPTOR_P (gnu_formal))
3961 gnu_actual = convert (gnu_formal_type, gnu_actual);
3963 /* If this is 'Null_Parameter, pass a zero descriptor. */
3964 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
3965 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
3966 && TREE_PRIVATE (gnu_actual))
3968 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
3970 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
3972 (TREE_TYPE (TREE_TYPE (gnu_formal)),
3973 gnu_actual, gnat_actual));
3979 if (Ekind (gnat_formal) != E_In_Parameter)
3980 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
3982 if (!is_true_formal_parm)
3984 /* Make sure side-effects are evaluated before the call. */
3985 if (TREE_SIDE_EFFECTS (gnu_name))
3986 append_to_statement_list (gnu_name, &gnu_stmt_list);
3990 gnu_actual = convert (gnu_formal_type, gnu_actual);
3992 /* If this is 'Null_Parameter, pass a zero even though we are
3993 dereferencing it. */
3994 if (TREE_CODE (gnu_actual) == INDIRECT_REF
3995 && TREE_PRIVATE (gnu_actual)
3996 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
3997 && TREE_CODE (gnu_size) == INTEGER_CST
3998 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
4000 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
4001 convert (gnat_type_for_size
4002 (TREE_INT_CST_LOW (gnu_size), 1),
4006 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
4009 VEC_safe_push (tree, gc, gnu_actual_vec, gnu_actual);
4013 = build_call_vec (gnu_result_type, gnu_subprog_addr, gnu_actual_vec);
4014 set_expr_location_from_node (gnu_call, gnat_node);
4016 /* If we have created a temporary for the return value, initialize it. */
4020 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_retval, gnu_call);
4021 set_expr_location_from_node (gnu_stmt, gnat_node);
4022 append_to_statement_list (gnu_stmt, &gnu_stmt_list);
4023 gnu_call = gnu_retval;
4026 /* If this is a subprogram with copy-in/copy-out parameters, we need to
4027 unpack the valued returned from the function into the In Out or Out
4028 parameters. We deal with the function return (if this is an Ada
4030 if (TYPE_CI_CO_LIST (gnu_subprog_type))
4032 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
4033 copy-out parameters. */
4034 tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
4035 const int length = list_length (gnu_cico_list);
4037 /* The call sequence must contain one and only one call, even though the
4038 function is pure. Save the result into a temporary if needed. */
4044 /* If we haven't pushed a binding level, push a new one. This
4045 will narrow the lifetime of the temporary we are about to
4046 make as much as possible. */
4047 if (!pushed_binding_level)
4049 start_stmt_group ();
4051 pushed_binding_level = true;
4054 = create_init_temporary ("P", gnu_call, &gnu_stmt, gnat_node);
4055 append_to_statement_list (gnu_stmt, &gnu_stmt_list);
4058 gnu_name_list = nreverse (gnu_name_list);
4061 /* The first entry is for the actual return value if this is a
4062 function, so skip it. */
4063 if (TREE_VALUE (gnu_cico_list) == void_type_node)
4064 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
4066 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
4067 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
4069 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
4071 for (gnat_actual = First_Actual (gnat_node);
4072 Present (gnat_actual);
4073 gnat_formal = Next_Formal_With_Extras (gnat_formal),
4074 gnat_actual = Next_Actual (gnat_actual))
4075 /* If we are dealing with a copy-in/copy-out parameter, we must
4076 retrieve its value from the record returned in the call. */
4077 if (!(present_gnu_tree (gnat_formal)
4078 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
4079 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
4080 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
4081 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
4082 || (DECL_BY_DESCRIPTOR_P
4083 (get_gnu_tree (gnat_formal))))))))
4084 && Ekind (gnat_formal) != E_In_Parameter)
4086 /* Get the value to assign to this Out or In Out parameter. It is
4087 either the result of the function if there is only a single such
4088 parameter or the appropriate field from the record returned. */
4092 : build_component_ref (gnu_call, NULL_TREE,
4093 TREE_PURPOSE (gnu_cico_list), false);
4095 /* If the actual is a conversion, get the inner expression, which
4096 will be the real destination, and convert the result to the
4097 type of the actual parameter. */
4099 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
4101 /* If the result is a padded type, remove the padding. */
4102 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
4104 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
4107 /* If the actual is a type conversion, the real target object is
4108 denoted by the inner Expression and we need to convert the
4109 result to the associated type.
4110 We also need to convert our gnu assignment target to this type
4111 if the corresponding GNU_NAME was constructed from the GNAT
4112 conversion node and not from the inner Expression. */
4113 if (Nkind (gnat_actual) == N_Type_Conversion)
4116 = convert_with_check
4117 (Etype (Expression (gnat_actual)), gnu_result,
4118 Do_Overflow_Check (gnat_actual),
4119 Do_Range_Check (Expression (gnat_actual)),
4120 Float_Truncate (gnat_actual), gnat_actual);
4122 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
4123 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
4126 /* Unchecked conversions as actuals for Out parameters are not
4127 allowed in user code because they are not variables, but do
4128 occur in front-end expansions. The associated GNU_NAME is
4129 always obtained from the inner expression in such cases. */
4130 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
4131 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
4133 No_Truncation (gnat_actual));
4136 if (Do_Range_Check (gnat_actual))
4138 = emit_range_check (gnu_result, Etype (gnat_actual),
4141 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
4142 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
4143 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
4146 if (atomic_sync_required_p (gnat_actual))
4147 gnu_result = build_atomic_store (gnu_actual, gnu_result);
4149 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4150 gnu_actual, gnu_result);
4151 set_expr_location_from_node (gnu_result, gnat_node);
4152 append_to_statement_list (gnu_result, &gnu_stmt_list);
4153 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
4154 gnu_name_list = TREE_CHAIN (gnu_name_list);
4158 /* If this is a function call, the result is the call expression unless a
4159 target is specified, in which case we copy the result into the target
4160 and return the assignment statement. */
4163 /* If this is a function with copy-in/copy-out parameters, extract the
4164 return value from it and update the return type. */
4165 if (TYPE_CI_CO_LIST (gnu_subprog_type))
4167 tree gnu_elmt = value_member (void_type_node,
4168 TYPE_CI_CO_LIST (gnu_subprog_type));
4169 gnu_call = build_component_ref (gnu_call, NULL_TREE,
4170 TREE_PURPOSE (gnu_elmt), false);
4171 gnu_result_type = TREE_TYPE (gnu_call);
4174 /* If the function returns an unconstrained array or by direct reference,
4175 we have to dereference the pointer. */
4176 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
4177 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
4178 gnu_call = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_call);
4182 Node_Id gnat_parent = Parent (gnat_node);
4183 enum tree_code op_code;
4185 /* If range check is needed, emit code to generate it. */
4186 if (Do_Range_Check (gnat_node))
4188 = emit_range_check (gnu_call, Etype (Name (gnat_parent)),
4191 /* ??? If the return type has variable size, then force the return
4192 slot optimization as we would not be able to create a temporary.
4193 Likewise if it was unconstrained as we would copy too much data.
4194 That's what has been done historically. */
4195 if (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
4196 || (TYPE_IS_PADDING_P (gnu_result_type)
4197 && CONTAINS_PLACEHOLDER_P
4198 (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS (gnu_result_type))))))
4199 op_code = INIT_EXPR;
4201 op_code = MODIFY_EXPR;
4204 gnu_call = build_atomic_store (gnu_target, gnu_call);
4207 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_call);
4208 set_expr_location_from_node (gnu_call, gnat_parent);
4209 append_to_statement_list (gnu_call, &gnu_stmt_list);
4212 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
4215 /* Otherwise, if this is a procedure call statement without copy-in/copy-out
4216 parameters, the result is just the call statement. */
4217 else if (!TYPE_CI_CO_LIST (gnu_subprog_type))
4218 append_to_statement_list (gnu_call, &gnu_stmt_list);
4220 /* Finally, add the copy back statements, if any. */
4221 append_to_statement_list (gnu_after_list, &gnu_stmt_list);
4223 if (went_into_elab_proc)
4224 current_function_decl = NULL_TREE;
4226 /* If we have pushed a binding level, pop it and finish up the enclosing
4228 if (pushed_binding_level)
4230 add_stmt (gnu_stmt_list);
4232 gnu_result = end_stmt_group ();
4235 /* Otherwise, retrieve the statement list, if any. */
4236 else if (gnu_stmt_list)
4237 gnu_result = gnu_stmt_list;
4239 /* Otherwise, just return the call expression. */
4243 /* If we nevertheless need a value, make a COMPOUND_EXPR to return it.
4244 But first simplify if we have only one statement in the list. */
4245 if (returning_value)
4247 tree first = expr_first (gnu_result), last = expr_last (gnu_result);
4251 = build_compound_expr (TREE_TYPE (gnu_call), gnu_result, gnu_call);
4257 /* Subroutine of gnat_to_gnu to translate gnat_node, an
4258 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
4261 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
4263 tree gnu_jmpsave_decl = NULL_TREE;
4264 tree gnu_jmpbuf_decl = NULL_TREE;
4265 /* If just annotating, ignore all EH and cleanups. */
4266 bool gcc_zcx = (!type_annotate_only
4267 && Present (Exception_Handlers (gnat_node))
4268 && Exception_Mechanism == Back_End_Exceptions);
4270 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
4271 && Exception_Mechanism == Setjmp_Longjmp);
4272 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
4273 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
4274 tree gnu_inner_block; /* The statement(s) for the block itself. */
4279 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
4280 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
4281 add_cleanup, and when we leave the binding, end_stmt_group will create
4282 the TRY_FINALLY_EXPR.
4284 ??? The region level calls down there have been specifically put in place
4285 for a ZCX context and currently the order in which things are emitted
4286 (region/handlers) is different from the SJLJ case. Instead of putting
4287 other calls with different conditions at other places for the SJLJ case,
4288 it seems cleaner to reorder things for the SJLJ case and generalize the
4289 condition to make it not ZCX specific.
4291 If there are any exceptions or cleanup processing involved, we need an
4292 outer statement group (for Setjmp_Longjmp) and binding level. */
4293 if (binding_for_block)
4295 start_stmt_group ();
4299 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
4300 area for address of previous buffer. Do this first since we need to have
4301 the setjmp buf known for any decls in this block. */
4305 = create_var_decl (get_identifier ("JMPBUF_SAVE"), NULL_TREE,
4307 build_call_n_expr (get_jmpbuf_decl, 0),
4308 false, false, false, false, NULL, gnat_node);
4309 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
4311 /* The __builtin_setjmp receivers will immediately reinstall it. Now
4312 because of the unstructured form of EH used by setjmp_longjmp, there
4313 might be forward edges going to __builtin_setjmp receivers on which
4314 it is uninitialized, although they will never be actually taken. */
4315 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
4317 = create_var_decl (get_identifier ("JMP_BUF"), NULL_TREE,
4320 false, false, false, false, NULL, gnat_node);
4321 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
4323 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
4325 /* When we exit this block, restore the saved value. */
4326 add_cleanup (build_call_n_expr (set_jmpbuf_decl, 1, gnu_jmpsave_decl),
4327 End_Label (gnat_node));
4330 /* If we are to call a function when exiting this block, add a cleanup
4331 to the binding level we made above. Note that add_cleanup is FIFO
4332 so we must register this cleanup after the EH cleanup just above. */
4334 add_cleanup (build_call_n_expr (gnat_to_gnu (At_End_Proc (gnat_node)), 0),
4335 End_Label (gnat_node));
4337 /* Now build the tree for the declarations and statements inside this block.
4338 If this is SJLJ, set our jmp_buf as the current buffer. */
4339 start_stmt_group ();
4342 add_stmt (build_call_n_expr (set_jmpbuf_decl, 1,
4343 build_unary_op (ADDR_EXPR, NULL_TREE,
4346 if (Present (First_Real_Statement (gnat_node)))
4347 process_decls (Statements (gnat_node), Empty,
4348 First_Real_Statement (gnat_node), true, true);
4350 /* Generate code for each statement in the block. */
4351 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
4352 ? First_Real_Statement (gnat_node)
4353 : First (Statements (gnat_node)));
4354 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4355 add_stmt (gnat_to_gnu (gnat_temp));
4356 gnu_inner_block = end_stmt_group ();
4358 /* Now generate code for the two exception models, if either is relevant for
4362 tree *gnu_else_ptr = 0;
4365 /* Make a binding level for the exception handling declarations and code
4366 and set up gnu_except_ptr_stack for the handlers to use. */
4367 start_stmt_group ();
4370 VEC_safe_push (tree, gc, gnu_except_ptr_stack,
4371 create_var_decl (get_identifier ("EXCEPT_PTR"), NULL_TREE,
4372 build_pointer_type (except_type_node),
4373 build_call_n_expr (get_excptr_decl, 0),
4374 false, false, false, false,
4377 /* Generate code for each handler. The N_Exception_Handler case does the
4378 real work and returns a COND_EXPR for each handler, which we chain
4380 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
4381 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
4383 gnu_expr = gnat_to_gnu (gnat_temp);
4385 /* If this is the first one, set it as the outer one. Otherwise,
4386 point the "else" part of the previous handler to us. Then point
4387 to our "else" part. */
4389 add_stmt (gnu_expr);
4391 *gnu_else_ptr = gnu_expr;
4393 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4396 /* If none of the exception handlers did anything, re-raise but do not
4398 gnu_expr = build_call_n_expr (raise_nodefer_decl, 1,
4399 VEC_last (tree, gnu_except_ptr_stack));
4400 set_expr_location_from_node
4402 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
4405 *gnu_else_ptr = gnu_expr;
4407 add_stmt (gnu_expr);
4409 /* End the binding level dedicated to the exception handlers and get the
4410 whole statement group. */
4411 VEC_pop (tree, gnu_except_ptr_stack);
4413 gnu_handler = end_stmt_group ();
4415 /* If the setjmp returns 1, we restore our incoming longjmp value and
4416 then check the handlers. */
4417 start_stmt_group ();
4418 add_stmt_with_node (build_call_n_expr (set_jmpbuf_decl, 1,
4421 add_stmt (gnu_handler);
4422 gnu_handler = end_stmt_group ();
4424 /* This block is now "if (setjmp) ... <handlers> else <block>". */
4425 gnu_result = build3 (COND_EXPR, void_type_node,
4428 build_unary_op (ADDR_EXPR, NULL_TREE,
4430 gnu_handler, gnu_inner_block);
4436 /* First make a block containing the handlers. */
4437 start_stmt_group ();
4438 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
4439 Present (gnat_temp);
4440 gnat_temp = Next_Non_Pragma (gnat_temp))
4441 add_stmt (gnat_to_gnu (gnat_temp));
4442 gnu_handlers = end_stmt_group ();
4444 /* Now make the TRY_CATCH_EXPR for the block. */
4445 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
4446 gnu_inner_block, gnu_handlers);
4449 gnu_result = gnu_inner_block;
4451 /* Now close our outer block, if we had to make one. */
4452 if (binding_for_block)
4454 add_stmt (gnu_result);
4456 gnu_result = end_stmt_group ();
4462 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4463 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
4464 exception handling. */
4467 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
4469 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
4470 an "if" statement to select the proper exceptions. For "Others", exclude
4471 exceptions where Handled_By_Others is nonzero unless the All_Others flag
4472 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
4473 tree gnu_choice = boolean_false_node;
4474 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
4477 for (gnat_temp = First (Exception_Choices (gnat_node));
4478 gnat_temp; gnat_temp = Next (gnat_temp))
4482 if (Nkind (gnat_temp) == N_Others_Choice)
4484 if (All_Others (gnat_temp))
4485 this_choice = boolean_true_node;
4489 (EQ_EXPR, boolean_type_node,
4494 (INDIRECT_REF, NULL_TREE,
4495 VEC_last (tree, gnu_except_ptr_stack)),
4496 get_identifier ("not_handled_by_others"), NULL_TREE,
4501 else if (Nkind (gnat_temp) == N_Identifier
4502 || Nkind (gnat_temp) == N_Expanded_Name)
4504 Entity_Id gnat_ex_id = Entity (gnat_temp);
4507 /* Exception may be a renaming. Recover original exception which is
4508 the one elaborated and registered. */
4509 if (Present (Renamed_Object (gnat_ex_id)))
4510 gnat_ex_id = Renamed_Object (gnat_ex_id);
4512 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
4516 (EQ_EXPR, boolean_type_node,
4517 VEC_last (tree, gnu_except_ptr_stack),
4518 convert (TREE_TYPE (VEC_last (tree, gnu_except_ptr_stack)),
4519 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
4521 /* If this is the distinguished exception "Non_Ada_Error" (and we are
4522 in VMS mode), also allow a non-Ada exception (a VMS condition) t
4524 if (Is_Non_Ada_Error (Entity (gnat_temp)))
4527 = build_component_ref
4528 (build_unary_op (INDIRECT_REF, NULL_TREE,
4529 VEC_last (tree, gnu_except_ptr_stack)),
4530 get_identifier ("lang"), NULL_TREE, false);
4534 (TRUTH_ORIF_EXPR, boolean_type_node,
4535 build_binary_op (EQ_EXPR, boolean_type_node, gnu_comp,
4536 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
4543 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
4544 gnu_choice, this_choice);
4547 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
4550 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4551 to a GCC tree, which is returned. This is the variant for ZCX. */
4554 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
4556 tree gnu_etypes_list = NULL_TREE;
4559 tree gnu_current_exc_ptr;
4560 tree prev_gnu_incoming_exc_ptr;
4563 /* We build a TREE_LIST of nodes representing what exception types this
4564 handler can catch, with special cases for others and all others cases.
4566 Each exception type is actually identified by a pointer to the exception
4567 id, or to a dummy object for "others" and "all others". */
4568 for (gnat_temp = First (Exception_Choices (gnat_node));
4569 gnat_temp; gnat_temp = Next (gnat_temp))
4571 if (Nkind (gnat_temp) == N_Others_Choice)
4574 = All_Others (gnat_temp) ? all_others_decl : others_decl;
4577 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
4579 else if (Nkind (gnat_temp) == N_Identifier
4580 || Nkind (gnat_temp) == N_Expanded_Name)
4582 Entity_Id gnat_ex_id = Entity (gnat_temp);
4584 /* Exception may be a renaming. Recover original exception which is
4585 the one elaborated and registered. */
4586 if (Present (Renamed_Object (gnat_ex_id)))
4587 gnat_ex_id = Renamed_Object (gnat_ex_id);
4589 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
4590 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
4592 /* The Non_Ada_Error case for VMS exceptions is handled
4593 by the personality routine. */
4598 /* The GCC interface expects NULL to be passed for catch all handlers, so
4599 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
4600 is integer_zero_node. It would not work, however, because GCC's
4601 notion of "catch all" is stronger than our notion of "others". Until
4602 we correctly use the cleanup interface as well, doing that would
4603 prevent the "all others" handlers from being seen, because nothing
4604 can be caught beyond a catch all from GCC's point of view. */
4605 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
4608 start_stmt_group ();
4611 /* Expand a call to the begin_handler hook at the beginning of the handler,
4612 and arrange for a call to the end_handler hook to occur on every possible
4615 The hooks expect a pointer to the low level occurrence. This is required
4616 for our stack management scheme because a raise inside the handler pushes
4617 a new occurrence on top of the stack, which means that this top does not
4618 necessarily match the occurrence this handler was dealing with.
4620 __builtin_eh_pointer references the exception occurrence being
4621 propagated. Upon handler entry, this is the exception for which the
4622 handler is triggered. This might not be the case upon handler exit,
4623 however, as we might have a new occurrence propagated by the handler's
4624 body, and the end_handler hook called as a cleanup in this context.
4626 We use a local variable to retrieve the incoming value at handler entry
4627 time, and reuse it to feed the end_handler hook's argument at exit. */
4630 = build_call_expr (builtin_decl_explicit (BUILT_IN_EH_POINTER),
4631 1, integer_zero_node);
4632 prev_gnu_incoming_exc_ptr = gnu_incoming_exc_ptr;
4633 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
4634 ptr_type_node, gnu_current_exc_ptr,
4635 false, false, false, false,
4638 add_stmt_with_node (build_call_n_expr (begin_handler_decl, 1,
4639 gnu_incoming_exc_ptr),
4641 /* ??? We don't seem to have an End_Label at hand to set the location. */
4642 add_cleanup (build_call_n_expr (end_handler_decl, 1, gnu_incoming_exc_ptr),
4644 add_stmt_list (Statements (gnat_node));
4647 gnu_incoming_exc_ptr = prev_gnu_incoming_exc_ptr;
4649 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
4653 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
4656 Compilation_Unit_to_gnu (Node_Id gnat_node)
4658 const Node_Id gnat_unit = Unit (gnat_node);
4659 const bool body_p = (Nkind (gnat_unit) == N_Package_Body
4660 || Nkind (gnat_unit) == N_Subprogram_Body);
4661 const Entity_Id gnat_unit_entity = Defining_Entity (gnat_unit);
4662 /* Make the decl for the elaboration procedure. */
4663 tree gnu_elab_proc_decl
4664 = create_subprog_decl
4665 (create_concat_name (gnat_unit_entity, body_p ? "elabb" : "elabs"),
4666 NULL_TREE, void_ftype, NULL_TREE, false, true, false, true, NULL,
4668 struct elab_info *info;
4670 VEC_safe_push (tree, gc, gnu_elab_proc_stack, gnu_elab_proc_decl);
4671 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
4673 /* Initialize the information structure for the function. */
4674 allocate_struct_function (gnu_elab_proc_decl, false);
4677 current_function_decl = NULL_TREE;
4679 start_stmt_group ();
4682 /* For a body, first process the spec if there is one. */
4683 if (Nkind (gnat_unit) == N_Package_Body
4684 || (Nkind (gnat_unit) == N_Subprogram_Body && !Acts_As_Spec (gnat_node)))
4685 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
4687 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
4689 elaborate_all_entities (gnat_node);
4691 if (Nkind (gnat_unit) == N_Subprogram_Declaration
4692 || Nkind (gnat_unit) == N_Generic_Package_Declaration
4693 || Nkind (gnat_unit) == N_Generic_Subprogram_Declaration)
4697 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
4699 add_stmt (gnat_to_gnu (gnat_unit));
4701 /* If we can inline, generate code for all the inlined subprograms. */
4704 Entity_Id gnat_entity;
4706 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
4707 Present (gnat_entity);
4708 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
4710 Node_Id gnat_body = Parent (Declaration_Node (gnat_entity));
4712 if (Nkind (gnat_body) != N_Subprogram_Body)
4714 /* ??? This really should always be present. */
4715 if (No (Corresponding_Body (gnat_body)))
4718 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
4721 if (Present (gnat_body))
4723 /* Define the entity first so we set DECL_EXTERNAL. */
4724 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
4725 add_stmt (gnat_to_gnu (gnat_body));
4730 /* Process any pragmas and actions following the unit. */
4731 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
4732 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
4733 finalize_from_with_types ();
4735 /* Save away what we've made so far and record this potential elaboration
4737 info = ggc_alloc_elab_info ();
4738 set_current_block_context (gnu_elab_proc_decl);
4740 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
4742 set_end_locus_from_node (gnu_elab_proc_decl, gnat_unit);
4744 info->next = elab_info_list;
4745 info->elab_proc = gnu_elab_proc_decl;
4746 info->gnat_node = gnat_node;
4747 elab_info_list = info;
4749 /* Generate elaboration code for this unit, if necessary, and say whether
4751 VEC_pop (tree, gnu_elab_proc_stack);
4753 /* Invalidate the global renaming pointers. This is necessary because
4754 stabilization of the renamed entities may create SAVE_EXPRs which
4755 have been tied to a specific elaboration routine just above. */
4756 invalidate_global_renaming_pointers ();
4759 /* Return true if GNAT_NODE is on the LHS of an assignment or an actual
4760 parameter of a call. */
4763 lhs_or_actual_p (Node_Id gnat_node)
4765 Node_Id gnat_parent = Parent (gnat_node);
4766 Node_Kind kind = Nkind (gnat_parent);
4768 if (kind == N_Assignment_Statement && Name (gnat_parent) == gnat_node)
4771 if ((kind == N_Procedure_Call_Statement || kind == N_Function_Call)
4772 && Name (gnat_parent) != gnat_node)
4775 if (kind == N_Parameter_Association)
4781 /* Return true if either GNAT_NODE or a view of GNAT_NODE is on the LHS
4782 of an assignment or an actual parameter of a call. */
4785 present_in_lhs_or_actual_p (Node_Id gnat_node)
4789 if (lhs_or_actual_p (gnat_node))
4792 kind = Nkind (Parent (gnat_node));
4794 if ((kind == N_Type_Conversion || kind == N_Unchecked_Type_Conversion)
4795 && lhs_or_actual_p (Parent (gnat_node)))
4801 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
4802 as gigi is concerned. This is used to avoid conversions on the LHS. */
4805 unchecked_conversion_nop (Node_Id gnat_node)
4807 Entity_Id from_type, to_type;
4809 /* The conversion must be on the LHS of an assignment or an actual parameter
4810 of a call. Otherwise, even if the conversion was essentially a no-op, it
4811 could de facto ensure type consistency and this should be preserved. */
4812 if (!lhs_or_actual_p (gnat_node))
4815 from_type = Etype (Expression (gnat_node));
4817 /* We're interested in artificial conversions generated by the front-end
4818 to make private types explicit, e.g. in Expand_Assign_Array. */
4819 if (!Is_Private_Type (from_type))
4822 from_type = Underlying_Type (from_type);
4823 to_type = Etype (gnat_node);
4825 /* The direct conversion to the underlying type is a no-op. */
4826 if (to_type == from_type)
4829 /* For an array subtype, the conversion to the PAT is a no-op. */
4830 if (Ekind (from_type) == E_Array_Subtype
4831 && to_type == Packed_Array_Type (from_type))
4834 /* For a record subtype, the conversion to the type is a no-op. */
4835 if (Ekind (from_type) == E_Record_Subtype
4836 && to_type == Etype (from_type))
4842 /* This function is the driver of the GNAT to GCC tree transformation process.
4843 It is the entry point of the tree transformer. GNAT_NODE is the root of
4844 some GNAT tree. Return the root of the corresponding GCC tree. If this
4845 is an expression, return the GCC equivalent of the expression. If this
4846 is a statement, return the statement or add it to the current statement
4847 group, in which case anything returned is to be interpreted as occurring
4848 after anything added. */
4851 gnat_to_gnu (Node_Id gnat_node)
4853 const Node_Kind kind = Nkind (gnat_node);
4854 bool went_into_elab_proc = false;
4855 tree gnu_result = error_mark_node; /* Default to no value. */
4856 tree gnu_result_type = void_type_node;
4857 tree gnu_expr, gnu_lhs, gnu_rhs;
4860 /* Save node number for error message and set location information. */
4861 error_gnat_node = gnat_node;
4862 Sloc_to_locus (Sloc (gnat_node), &input_location);
4864 /* If this node is a statement and we are only annotating types, return an
4865 empty statement list. */
4866 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
4867 return alloc_stmt_list ();
4869 /* If this node is a non-static subexpression and we are only annotating
4870 types, make this into a NULL_EXPR. */
4871 if (type_annotate_only
4872 && IN (kind, N_Subexpr)
4873 && kind != N_Identifier
4874 && !Compile_Time_Known_Value (gnat_node))
4875 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
4876 build_call_raise (CE_Range_Check_Failed, gnat_node,
4877 N_Raise_Constraint_Error));
4879 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
4880 && kind != N_Null_Statement)
4881 || kind == N_Procedure_Call_Statement
4883 || kind == N_Implicit_Label_Declaration
4884 || kind == N_Handled_Sequence_Of_Statements
4885 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
4887 tree current_elab_proc = get_elaboration_procedure ();
4889 /* If this is a statement and we are at top level, it must be part of
4890 the elaboration procedure, so mark us as being in that procedure. */
4891 if (!current_function_decl)
4893 current_function_decl = current_elab_proc;
4894 went_into_elab_proc = true;
4897 /* If we are in the elaboration procedure, check if we are violating a
4898 No_Elaboration_Code restriction by having a statement there. Don't
4899 check for a possible No_Elaboration_Code restriction violation on
4900 N_Handled_Sequence_Of_Statements, as we want to signal an error on
4901 every nested real statement instead. This also avoids triggering
4902 spurious errors on dummy (empty) sequences created by the front-end
4903 for package bodies in some cases. */
4904 if (current_function_decl == current_elab_proc
4905 && kind != N_Handled_Sequence_Of_Statements)
4906 Check_Elaboration_Code_Allowed (gnat_node);
4911 /********************************/
4912 /* Chapter 2: Lexical Elements */
4913 /********************************/
4916 case N_Expanded_Name:
4917 case N_Operator_Symbol:
4918 case N_Defining_Identifier:
4919 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
4921 /* If this is an atomic access on the RHS for which synchronization is
4922 required, build the atomic load. */
4923 if (atomic_sync_required_p (gnat_node)
4924 && !present_in_lhs_or_actual_p (gnat_node))
4925 gnu_result = build_atomic_load (gnu_result);
4928 case N_Integer_Literal:
4932 /* Get the type of the result, looking inside any padding and
4933 justified modular types. Then get the value in that type. */
4934 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4936 if (TREE_CODE (gnu_type) == RECORD_TYPE
4937 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
4938 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
4940 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
4942 /* If the result overflows (meaning it doesn't fit in its base type),
4943 abort. We would like to check that the value is within the range
4944 of the subtype, but that causes problems with subtypes whose usage
4945 will raise Constraint_Error and with biased representation, so
4947 gcc_assert (!TREE_OVERFLOW (gnu_result));
4951 case N_Character_Literal:
4952 /* If a Entity is present, it means that this was one of the
4953 literals in a user-defined character type. In that case,
4954 just return the value in the CONST_DECL. Otherwise, use the
4955 character code. In that case, the base type should be an
4956 INTEGER_TYPE, but we won't bother checking for that. */
4957 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4958 if (Present (Entity (gnat_node)))
4959 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
4962 = build_int_cst_type
4963 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
4966 case N_Real_Literal:
4967 /* If this is of a fixed-point type, the value we want is the
4968 value of the corresponding integer. */
4969 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
4971 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4972 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
4974 gcc_assert (!TREE_OVERFLOW (gnu_result));
4977 /* We should never see a Vax_Float type literal, since the front end
4978 is supposed to transform these using appropriate conversions. */
4979 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
4984 Ureal ur_realval = Realval (gnat_node);
4986 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4988 /* If the real value is zero, so is the result. Otherwise,
4989 convert it to a machine number if it isn't already. That
4990 forces BASE to 0 or 2 and simplifies the rest of our logic. */
4991 if (UR_Is_Zero (ur_realval))
4992 gnu_result = convert (gnu_result_type, integer_zero_node);
4995 if (!Is_Machine_Number (gnat_node))
4997 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
4998 ur_realval, Round_Even, gnat_node);
5001 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
5003 /* If we have a base of zero, divide by the denominator.
5004 Otherwise, the base must be 2 and we scale the value, which
5005 we know can fit in the mantissa of the type (hence the use
5006 of that type above). */
5007 if (No (Rbase (ur_realval)))
5009 = build_binary_op (RDIV_EXPR,
5010 get_base_type (gnu_result_type),
5012 UI_To_gnu (Denominator (ur_realval),
5016 REAL_VALUE_TYPE tmp;
5018 gcc_assert (Rbase (ur_realval) == 2);
5019 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
5020 - UI_To_Int (Denominator (ur_realval)));
5021 gnu_result = build_real (gnu_result_type, tmp);
5025 /* Now see if we need to negate the result. Do it this way to
5026 properly handle -0. */
5027 if (UR_Is_Negative (Realval (gnat_node)))
5029 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
5035 case N_String_Literal:
5036 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5037 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
5039 String_Id gnat_string = Strval (gnat_node);
5040 int length = String_Length (gnat_string);
5043 if (length >= ALLOCA_THRESHOLD)
5044 string = XNEWVEC (char, length + 1);
5046 string = (char *) alloca (length + 1);
5048 /* Build the string with the characters in the literal. Note
5049 that Ada strings are 1-origin. */
5050 for (i = 0; i < length; i++)
5051 string[i] = Get_String_Char (gnat_string, i + 1);
5053 /* Put a null at the end of the string in case it's in a context
5054 where GCC will want to treat it as a C string. */
5057 gnu_result = build_string (length, string);
5059 /* Strings in GCC don't normally have types, but we want
5060 this to not be converted to the array type. */
5061 TREE_TYPE (gnu_result) = gnu_result_type;
5063 if (length >= ALLOCA_THRESHOLD)
5068 /* Build a list consisting of each character, then make
5070 String_Id gnat_string = Strval (gnat_node);
5071 int length = String_Length (gnat_string);
5073 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
5074 VEC(constructor_elt,gc) *gnu_vec
5075 = VEC_alloc (constructor_elt, gc, length);
5077 for (i = 0; i < length; i++)
5079 tree t = build_int_cst (TREE_TYPE (gnu_result_type),
5080 Get_String_Char (gnat_string, i + 1));
5082 CONSTRUCTOR_APPEND_ELT (gnu_vec, gnu_idx, t);
5083 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node);
5086 gnu_result = gnat_build_constructor (gnu_result_type, gnu_vec);
5091 gnu_result = Pragma_to_gnu (gnat_node);
5094 /**************************************/
5095 /* Chapter 3: Declarations and Types */
5096 /**************************************/
5098 case N_Subtype_Declaration:
5099 case N_Full_Type_Declaration:
5100 case N_Incomplete_Type_Declaration:
5101 case N_Private_Type_Declaration:
5102 case N_Private_Extension_Declaration:
5103 case N_Task_Type_Declaration:
5104 process_type (Defining_Entity (gnat_node));
5105 gnu_result = alloc_stmt_list ();
5108 case N_Object_Declaration:
5109 case N_Exception_Declaration:
5110 gnat_temp = Defining_Entity (gnat_node);
5111 gnu_result = alloc_stmt_list ();
5113 /* If we are just annotating types and this object has an unconstrained
5114 or task type, don't elaborate it. */
5115 if (type_annotate_only
5116 && (((Is_Array_Type (Etype (gnat_temp))
5117 || Is_Record_Type (Etype (gnat_temp)))
5118 && !Is_Constrained (Etype (gnat_temp)))
5119 || Is_Concurrent_Type (Etype (gnat_temp))))
5122 if (Present (Expression (gnat_node))
5123 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
5124 && (!type_annotate_only
5125 || Compile_Time_Known_Value (Expression (gnat_node))))
5127 gnu_expr = gnat_to_gnu (Expression (gnat_node));
5128 if (Do_Range_Check (Expression (gnat_node)))
5130 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
5132 /* If this object has its elaboration delayed, we must force
5133 evaluation of GNU_EXPR right now and save it for when the object
5135 if (Present (Freeze_Node (gnat_temp)))
5137 if (TREE_CONSTANT (gnu_expr))
5139 else if (global_bindings_p ())
5141 = create_var_decl (create_concat_name (gnat_temp, "init"),
5142 NULL_TREE, TREE_TYPE (gnu_expr), gnu_expr,
5143 false, false, false, false,
5146 gnu_expr = gnat_save_expr (gnu_expr);
5148 save_gnu_tree (gnat_node, gnu_expr, true);
5152 gnu_expr = NULL_TREE;
5154 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
5155 gnu_expr = NULL_TREE;
5157 /* If this is a deferred constant with an address clause, we ignore the
5158 full view since the clause is on the partial view and we cannot have
5159 2 different GCC trees for the object. The only bits of the full view
5160 we will use is the initializer, but it will be directly fetched. */
5161 if (Ekind(gnat_temp) == E_Constant
5162 && Present (Address_Clause (gnat_temp))
5163 && Present (Full_View (gnat_temp)))
5164 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
5166 if (No (Freeze_Node (gnat_temp)))
5167 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
5170 case N_Object_Renaming_Declaration:
5171 gnat_temp = Defining_Entity (gnat_node);
5173 /* Don't do anything if this renaming is handled by the front end or if
5174 we are just annotating types and this object has a composite or task
5175 type, don't elaborate it. We return the result in case it has any
5176 SAVE_EXPRs in it that need to be evaluated here. */
5177 if (!Is_Renaming_Of_Object (gnat_temp)
5178 && ! (type_annotate_only
5179 && (Is_Array_Type (Etype (gnat_temp))
5180 || Is_Record_Type (Etype (gnat_temp))
5181 || Is_Concurrent_Type (Etype (gnat_temp)))))
5183 = gnat_to_gnu_entity (gnat_temp,
5184 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
5186 gnu_result = alloc_stmt_list ();
5189 case N_Implicit_Label_Declaration:
5190 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
5191 gnu_result = alloc_stmt_list ();
5194 case N_Exception_Renaming_Declaration:
5195 case N_Number_Declaration:
5196 case N_Package_Renaming_Declaration:
5197 case N_Subprogram_Renaming_Declaration:
5198 /* These are fully handled in the front end. */
5199 gnu_result = alloc_stmt_list ();
5202 /*************************************/
5203 /* Chapter 4: Names and Expressions */
5204 /*************************************/
5206 case N_Explicit_Dereference:
5207 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5208 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5209 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
5211 /* If this is an atomic access on the RHS for which synchronization is
5212 required, build the atomic load. */
5213 if (atomic_sync_required_p (gnat_node)
5214 && !present_in_lhs_or_actual_p (gnat_node))
5215 gnu_result = build_atomic_load (gnu_result);
5218 case N_Indexed_Component:
5220 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
5224 Node_Id *gnat_expr_array;
5226 gnu_array_object = maybe_implicit_deref (gnu_array_object);
5228 /* Convert vector inputs to their representative array type, to fit
5229 what the code below expects. */
5230 if (VECTOR_TYPE_P (TREE_TYPE (gnu_array_object)))
5232 if (present_in_lhs_or_actual_p (gnat_node))
5233 gnat_mark_addressable (gnu_array_object);
5234 gnu_array_object = maybe_vector_array (gnu_array_object);
5237 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
5239 /* If we got a padded type, remove it too. */
5240 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
5242 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
5245 gnu_result = gnu_array_object;
5247 /* First compute the number of dimensions of the array, then
5248 fill the expression array, the order depending on whether
5249 this is a Convention_Fortran array or not. */
5250 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
5251 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
5252 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
5253 ndim++, gnu_type = TREE_TYPE (gnu_type))
5256 gnat_expr_array = XALLOCAVEC (Node_Id, ndim);
5258 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
5259 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
5261 i--, gnat_temp = Next (gnat_temp))
5262 gnat_expr_array[i] = gnat_temp;
5264 for (i = 0, gnat_temp = First (Expressions (gnat_node));
5266 i++, gnat_temp = Next (gnat_temp))
5267 gnat_expr_array[i] = gnat_temp;
5269 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
5270 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
5272 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
5273 gnat_temp = gnat_expr_array[i];
5274 gnu_expr = gnat_to_gnu (gnat_temp);
5276 if (Do_Range_Check (gnat_temp))
5279 (gnu_array_object, gnu_expr,
5280 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
5281 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
5284 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
5285 gnu_result, gnu_expr);
5288 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5290 /* If this is an atomic access on the RHS for which synchronization is
5291 required, build the atomic load. */
5292 if (atomic_sync_required_p (gnat_node)
5293 && !present_in_lhs_or_actual_p (gnat_node))
5294 gnu_result = build_atomic_load (gnu_result);
5300 Node_Id gnat_range_node = Discrete_Range (gnat_node);
5303 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5304 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5306 /* Do any implicit dereferences of the prefix and do any needed
5308 gnu_result = maybe_implicit_deref (gnu_result);
5309 gnu_result = maybe_unconstrained_array (gnu_result);
5310 gnu_type = TREE_TYPE (gnu_result);
5311 if (Do_Range_Check (gnat_range_node))
5313 /* Get the bounds of the slice. */
5315 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
5316 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
5317 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
5318 /* Get the permitted bounds. */
5319 tree gnu_base_index_type
5320 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
5321 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5322 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
5323 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5324 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
5325 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
5327 gnu_min_expr = gnat_protect_expr (gnu_min_expr);
5328 gnu_max_expr = gnat_protect_expr (gnu_max_expr);
5330 /* Derive a good type to convert everything to. */
5331 gnu_expr_type = get_base_type (gnu_index_type);
5333 /* Test whether the minimum slice value is too small. */
5334 gnu_expr_l = build_binary_op (LT_EXPR, boolean_type_node,
5335 convert (gnu_expr_type,
5337 convert (gnu_expr_type,
5338 gnu_base_min_expr));
5340 /* Test whether the maximum slice value is too large. */
5341 gnu_expr_h = build_binary_op (GT_EXPR, boolean_type_node,
5342 convert (gnu_expr_type,
5344 convert (gnu_expr_type,
5345 gnu_base_max_expr));
5347 /* Build a slice index check that returns the low bound,
5348 assuming the slice is not empty. */
5349 gnu_expr = emit_check
5350 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
5351 gnu_expr_l, gnu_expr_h),
5352 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
5354 /* Build a conditional expression that does the index checks and
5355 returns the low bound if the slice is not empty (max >= min),
5356 and returns the naked low bound otherwise (max < min), unless
5357 it is non-constant and the high bound is; this prevents VRP
5358 from inferring bogus ranges on the unlikely path. */
5359 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
5360 build_binary_op (GE_EXPR, gnu_expr_type,
5361 convert (gnu_expr_type,
5363 convert (gnu_expr_type,
5366 TREE_CODE (gnu_min_expr) != INTEGER_CST
5367 && TREE_CODE (gnu_max_expr) == INTEGER_CST
5368 ? gnu_max_expr : gnu_min_expr);
5371 /* Simply return the naked low bound. */
5372 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
5374 /* If this is a slice with non-constant size of an array with constant
5375 size, set the maximum size for the allocation of temporaries. */
5376 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
5377 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
5378 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
5380 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
5381 gnu_result, gnu_expr);
5385 case N_Selected_Component:
5387 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
5388 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
5389 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
5392 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
5393 || IN (Ekind (gnat_pref_type), Access_Kind))
5395 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
5396 gnat_pref_type = Underlying_Type (gnat_pref_type);
5397 else if (IN (Ekind (gnat_pref_type), Access_Kind))
5398 gnat_pref_type = Designated_Type (gnat_pref_type);
5401 gnu_prefix = maybe_implicit_deref (gnu_prefix);
5403 /* For discriminant references in tagged types always substitute the
5404 corresponding discriminant as the actual selected component. */
5405 if (Is_Tagged_Type (gnat_pref_type))
5406 while (Present (Corresponding_Discriminant (gnat_field)))
5407 gnat_field = Corresponding_Discriminant (gnat_field);
5409 /* For discriminant references of untagged types always substitute the
5410 corresponding stored discriminant. */
5411 else if (Present (Corresponding_Discriminant (gnat_field)))
5412 gnat_field = Original_Record_Component (gnat_field);
5414 /* Handle extracting the real or imaginary part of a complex.
5415 The real part is the first field and the imaginary the last. */
5416 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
5417 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
5418 ? REALPART_EXPR : IMAGPART_EXPR,
5419 NULL_TREE, gnu_prefix);
5422 gnu_field = gnat_to_gnu_field_decl (gnat_field);
5424 /* If there are discriminants, the prefix might be evaluated more
5425 than once, which is a problem if it has side-effects. */
5426 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
5427 ? Designated_Type (Etype
5428 (Prefix (gnat_node)))
5429 : Etype (Prefix (gnat_node))))
5430 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL);
5433 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
5434 (Nkind (Parent (gnat_node))
5435 == N_Attribute_Reference)
5436 && lvalue_required_for_attribute_p
5437 (Parent (gnat_node)));
5440 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5442 /* If this is an atomic access on the RHS for which synchronization is
5443 required, build the atomic load. */
5444 if (atomic_sync_required_p (gnat_node)
5445 && !present_in_lhs_or_actual_p (gnat_node))
5446 gnu_result = build_atomic_load (gnu_result);
5450 case N_Attribute_Reference:
5452 /* The attribute designator. */
5453 const int attr = Get_Attribute_Id (Attribute_Name (gnat_node));
5455 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
5456 is a unit, not an object with a GCC equivalent. */
5457 if (attr == Attr_Elab_Spec || attr == Attr_Elab_Body)
5459 create_subprog_decl (create_concat_name
5460 (Entity (Prefix (gnat_node)),
5461 attr == Attr_Elab_Body ? "elabb" : "elabs"),
5462 NULL_TREE, void_ftype, NULL_TREE, false,
5463 true, true, true, NULL, gnat_node);
5465 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attr);
5470 /* Like 'Access as far as we are concerned. */
5471 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5472 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
5473 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5477 case N_Extension_Aggregate:
5481 /* ??? It is wrong to evaluate the type now, but there doesn't
5482 seem to be any other practical way of doing it. */
5484 gcc_assert (!Expansion_Delayed (gnat_node));
5486 gnu_aggr_type = gnu_result_type
5487 = get_unpadded_type (Etype (gnat_node));
5489 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
5490 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
5492 = TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (gnu_result_type)));
5493 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
5494 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
5496 if (Null_Record_Present (gnat_node))
5497 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL);
5499 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
5500 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
5502 = assoc_to_constructor (Etype (gnat_node),
5503 First (Component_Associations (gnat_node)),
5505 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
5506 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
5508 Component_Type (Etype (gnat_node)));
5509 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
5512 (COMPLEX_EXPR, gnu_aggr_type,
5513 gnat_to_gnu (Expression (First
5514 (Component_Associations (gnat_node)))),
5515 gnat_to_gnu (Expression
5517 (First (Component_Associations (gnat_node))))));
5521 gnu_result = convert (gnu_result_type, gnu_result);
5526 if (TARGET_VTABLE_USES_DESCRIPTORS
5527 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
5528 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
5529 gnu_result = null_fdesc_node;
5531 gnu_result = null_pointer_node;
5532 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5535 case N_Type_Conversion:
5536 case N_Qualified_Expression:
5537 /* Get the operand expression. */
5538 gnu_result = gnat_to_gnu (Expression (gnat_node));
5539 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5541 /* If this is a qualified expression for a tagged type, we mark the type
5542 as used. Because of polymorphism, this might be the only reference to
5543 the tagged type in the program while objects have it as dynamic type.
5544 The debugger needs to see it to display these objects properly. */
5545 if (kind == N_Qualified_Expression && Is_Tagged_Type (Etype (gnat_node)))
5546 used_types_insert (gnu_result_type);
5549 = convert_with_check (Etype (gnat_node), gnu_result,
5550 Do_Overflow_Check (gnat_node),
5551 Do_Range_Check (Expression (gnat_node)),
5552 kind == N_Type_Conversion
5553 && Float_Truncate (gnat_node), gnat_node);
5556 case N_Unchecked_Type_Conversion:
5557 gnu_result = gnat_to_gnu (Expression (gnat_node));
5559 /* Skip further processing if the conversion is deemed a no-op. */
5560 if (unchecked_conversion_nop (gnat_node))
5562 gnu_result_type = TREE_TYPE (gnu_result);
5566 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5568 /* If the result is a pointer type, see if we are improperly
5569 converting to a stricter alignment. */
5570 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
5571 && IN (Ekind (Etype (gnat_node)), Access_Kind))
5573 unsigned int align = known_alignment (gnu_result);
5574 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
5575 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
5577 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
5578 post_error_ne_tree_2
5579 ("?source alignment (^) '< alignment of & (^)",
5580 gnat_node, Designated_Type (Etype (gnat_node)),
5581 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
5584 /* If we are converting a descriptor to a function pointer, first
5585 build the pointer. */
5586 if (TARGET_VTABLE_USES_DESCRIPTORS
5587 && TREE_TYPE (gnu_result) == fdesc_type_node
5588 && POINTER_TYPE_P (gnu_result_type))
5589 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
5591 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
5592 No_Truncation (gnat_node));
5598 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
5599 Node_Id gnat_range = Right_Opnd (gnat_node);
5600 tree gnu_low, gnu_high;
5602 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
5604 if (Nkind (gnat_range) == N_Range)
5606 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
5607 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
5609 else if (Nkind (gnat_range) == N_Identifier
5610 || Nkind (gnat_range) == N_Expanded_Name)
5612 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
5614 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
5615 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
5620 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5622 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
5623 ensure that GNU_OBJ is evaluated only once and perform a full range
5625 if (operand_equal_p (gnu_low, gnu_high, 0))
5627 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
5631 gnu_obj = gnat_protect_expr (gnu_obj);
5632 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
5634 set_expr_location_from_node (t1, gnat_node);
5635 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
5637 set_expr_location_from_node (t2, gnat_node);
5639 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
5642 if (kind == N_Not_In)
5644 = invert_truthvalue_loc (EXPR_LOCATION (gnu_result), gnu_result);
5649 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5650 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5651 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5652 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
5654 : (Rounded_Result (gnat_node)
5655 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
5656 gnu_result_type, gnu_lhs, gnu_rhs);
5659 case N_Op_Or: case N_Op_And: case N_Op_Xor:
5660 /* These can either be operations on booleans or on modular types.
5661 Fall through for boolean types since that's the way GNU_CODES is
5663 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
5664 Modular_Integer_Kind))
5667 = (kind == N_Op_Or ? BIT_IOR_EXPR
5668 : kind == N_Op_And ? BIT_AND_EXPR
5671 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5672 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5673 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5674 gnu_result = build_binary_op (code, gnu_result_type,
5679 /* ... fall through ... */
5681 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
5682 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
5683 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
5684 case N_Op_Mod: case N_Op_Rem:
5685 case N_Op_Rotate_Left:
5686 case N_Op_Rotate_Right:
5687 case N_Op_Shift_Left:
5688 case N_Op_Shift_Right:
5689 case N_Op_Shift_Right_Arithmetic:
5690 case N_And_Then: case N_Or_Else:
5692 enum tree_code code = gnu_codes[kind];
5693 bool ignore_lhs_overflow = false;
5694 location_t saved_location = input_location;
5697 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5698 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5699 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
5701 /* Pending generic support for efficient vector logical operations in
5702 GCC, convert vectors to their representative array type view and
5704 gnu_lhs = maybe_vector_array (gnu_lhs);
5705 gnu_rhs = maybe_vector_array (gnu_rhs);
5707 /* If this is a comparison operator, convert any references to
5708 an unconstrained array value into a reference to the
5710 if (TREE_CODE_CLASS (code) == tcc_comparison)
5712 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
5713 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
5716 /* If the result type is a private type, its full view may be a
5717 numeric subtype. The representation we need is that of its base
5718 type, given that it is the result of an arithmetic operation. */
5719 else if (Is_Private_Type (Etype (gnat_node)))
5720 gnu_type = gnu_result_type
5721 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
5723 /* If this is a shift whose count is not guaranteed to be correct,
5724 we need to adjust the shift count. */
5725 if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
5727 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
5729 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
5731 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
5732 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
5733 gnu_rhs, gnu_max_shift);
5734 else if (kind == N_Op_Shift_Right_Arithmetic)
5737 (MIN_EXPR, gnu_count_type,
5738 build_binary_op (MINUS_EXPR,
5741 convert (gnu_count_type,
5746 /* For right shifts, the type says what kind of shift to do,
5747 so we may need to choose a different type. In this case,
5748 we have to ignore integer overflow lest it propagates all
5749 the way down and causes a CE to be explicitly raised. */
5750 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
5752 gnu_type = gnat_unsigned_type (gnu_type);
5753 ignore_lhs_overflow = true;
5755 else if (kind == N_Op_Shift_Right_Arithmetic
5756 && TYPE_UNSIGNED (gnu_type))
5758 gnu_type = gnat_signed_type (gnu_type);
5759 ignore_lhs_overflow = true;
5762 if (gnu_type != gnu_result_type)
5764 tree gnu_old_lhs = gnu_lhs;
5765 gnu_lhs = convert (gnu_type, gnu_lhs);
5766 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
5767 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
5768 gnu_rhs = convert (gnu_type, gnu_rhs);
5771 /* Instead of expanding overflow checks for addition, subtraction
5772 and multiplication itself, the front end will leave this to
5773 the back end when Backend_Overflow_Checks_On_Target is set.
5774 As the GCC back end itself does not know yet how to properly
5775 do overflow checking, do it here. The goal is to push
5776 the expansions further into the back end over time. */
5777 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
5778 && (kind == N_Op_Add
5779 || kind == N_Op_Subtract
5780 || kind == N_Op_Multiply)
5781 && !TYPE_UNSIGNED (gnu_type)
5782 && !FLOAT_TYPE_P (gnu_type))
5783 gnu_result = build_binary_op_trapv (code, gnu_type,
5784 gnu_lhs, gnu_rhs, gnat_node);
5787 /* Some operations, e.g. comparisons of arrays, generate complex
5788 trees that need to be annotated while they are being built. */
5789 input_location = saved_location;
5790 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
5793 /* If this is a logical shift with the shift count not verified,
5794 we must return zero if it is too large. We cannot compensate
5795 above in this case. */
5796 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
5797 && !Shift_Count_OK (gnat_node))
5801 build_binary_op (GE_EXPR, boolean_type_node,
5803 convert (TREE_TYPE (gnu_rhs),
5804 TYPE_SIZE (gnu_type))),
5805 convert (gnu_type, integer_zero_node),
5810 case N_Conditional_Expression:
5812 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
5813 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
5815 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
5817 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5819 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
5824 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
5825 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5829 /* This case can apply to a boolean or a modular type.
5830 Fall through for a boolean operand since GNU_CODES is set
5831 up to handle this. */
5832 if (Is_Modular_Integer_Type (Etype (gnat_node))
5833 || (Ekind (Etype (gnat_node)) == E_Private_Type
5834 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
5836 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
5837 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5838 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
5843 /* ... fall through ... */
5845 case N_Op_Minus: case N_Op_Abs:
5846 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
5848 if (Ekind (Etype (gnat_node)) != E_Private_Type)
5849 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5851 gnu_result_type = get_unpadded_type (Base_Type
5852 (Full_View (Etype (gnat_node))));
5854 if (Do_Overflow_Check (gnat_node)
5855 && !TYPE_UNSIGNED (gnu_result_type)
5856 && !FLOAT_TYPE_P (gnu_result_type))
5858 = build_unary_op_trapv (gnu_codes[kind],
5859 gnu_result_type, gnu_expr, gnat_node);
5861 gnu_result = build_unary_op (gnu_codes[kind],
5862 gnu_result_type, gnu_expr);
5869 bool ignore_init_type = false;
5871 gnat_temp = Expression (gnat_node);
5873 /* The Expression operand can either be an N_Identifier or
5874 Expanded_Name, which must represent a type, or a
5875 N_Qualified_Expression, which contains both the object type and an
5876 initial value for the object. */
5877 if (Nkind (gnat_temp) == N_Identifier
5878 || Nkind (gnat_temp) == N_Expanded_Name)
5879 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
5880 else if (Nkind (gnat_temp) == N_Qualified_Expression)
5882 Entity_Id gnat_desig_type
5883 = Designated_Type (Underlying_Type (Etype (gnat_node)));
5885 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
5886 gnu_init = gnat_to_gnu (Expression (gnat_temp));
5888 gnu_init = maybe_unconstrained_array (gnu_init);
5889 if (Do_Range_Check (Expression (gnat_temp)))
5891 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
5893 if (Is_Elementary_Type (gnat_desig_type)
5894 || Is_Constrained (gnat_desig_type))
5895 gnu_type = gnat_to_gnu_type (gnat_desig_type);
5898 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
5899 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
5900 gnu_type = TREE_TYPE (gnu_init);
5903 /* See the N_Qualified_Expression case for the rationale. */
5904 if (Is_Tagged_Type (gnat_desig_type))
5905 used_types_insert (gnu_type);
5907 gnu_init = convert (gnu_type, gnu_init);
5912 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5913 return build_allocator (gnu_type, gnu_init, gnu_result_type,
5914 Procedure_To_Call (gnat_node),
5915 Storage_Pool (gnat_node), gnat_node,
5920 /**************************/
5921 /* Chapter 5: Statements */
5922 /**************************/
5925 gnu_result = build1 (LABEL_EXPR, void_type_node,
5926 gnat_to_gnu (Identifier (gnat_node)));
5929 case N_Null_Statement:
5930 /* When not optimizing, turn null statements from source into gotos to
5931 the next statement that the middle-end knows how to preserve. */
5932 if (!optimize && Comes_From_Source (gnat_node))
5934 tree stmt, label = create_label_decl (NULL_TREE, gnat_node);
5935 DECL_IGNORED_P (label) = 1;
5936 start_stmt_group ();
5937 stmt = build1 (GOTO_EXPR, void_type_node, label);
5938 set_expr_location_from_node (stmt, gnat_node);
5940 stmt = build1 (LABEL_EXPR, void_type_node, label);
5941 set_expr_location_from_node (stmt, gnat_node);
5943 gnu_result = end_stmt_group ();
5946 gnu_result = alloc_stmt_list ();
5949 case N_Assignment_Statement:
5950 /* Get the LHS and RHS of the statement and convert any reference to an
5951 unconstrained array into a reference to the underlying array. */
5952 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
5954 /* If the type has a size that overflows, convert this into raise of
5955 Storage_Error: execution shouldn't have gotten here anyway. */
5956 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
5957 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
5958 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
5959 N_Raise_Storage_Error);
5960 else if (Nkind (Expression (gnat_node)) == N_Function_Call)
5962 = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs,
5963 atomic_sync_required_p (Name (gnat_node)));
5967 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
5969 /* If range check is needed, emit code to generate it. */
5970 if (Do_Range_Check (Expression (gnat_node)))
5971 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
5974 if (atomic_sync_required_p (Name (gnat_node)))
5975 gnu_result = build_atomic_store (gnu_lhs, gnu_rhs);
5978 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
5980 /* If the type being assigned is an array type and the two sides are
5981 not completely disjoint, play safe and use memmove. But don't do
5982 it for a bit-packed array as it might not be byte-aligned. */
5983 if (TREE_CODE (gnu_result) == MODIFY_EXPR
5984 && Is_Array_Type (Etype (Name (gnat_node)))
5985 && !Is_Bit_Packed_Array (Etype (Name (gnat_node)))
5986 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
5988 tree to, from, size, to_ptr, from_ptr, t;
5990 to = TREE_OPERAND (gnu_result, 0);
5991 from = TREE_OPERAND (gnu_result, 1);
5993 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
5994 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
5996 to_ptr = build_fold_addr_expr (to);
5997 from_ptr = build_fold_addr_expr (from);
5999 t = builtin_decl_implicit (BUILT_IN_MEMMOVE);
6000 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
6005 case N_If_Statement:
6007 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
6009 /* Make the outer COND_EXPR. Avoid non-determinism. */
6010 gnu_result = build3 (COND_EXPR, void_type_node,
6011 gnat_to_gnu (Condition (gnat_node)),
6012 NULL_TREE, NULL_TREE);
6013 COND_EXPR_THEN (gnu_result)
6014 = build_stmt_group (Then_Statements (gnat_node), false);
6015 TREE_SIDE_EFFECTS (gnu_result) = 1;
6016 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
6018 /* Now make a COND_EXPR for each of the "else if" parts. Put each
6019 into the previous "else" part and point to where to put any
6020 outer "else". Also avoid non-determinism. */
6021 if (Present (Elsif_Parts (gnat_node)))
6022 for (gnat_temp = First (Elsif_Parts (gnat_node));
6023 Present (gnat_temp); gnat_temp = Next (gnat_temp))
6025 gnu_expr = build3 (COND_EXPR, void_type_node,
6026 gnat_to_gnu (Condition (gnat_temp)),
6027 NULL_TREE, NULL_TREE);
6028 COND_EXPR_THEN (gnu_expr)
6029 = build_stmt_group (Then_Statements (gnat_temp), false);
6030 TREE_SIDE_EFFECTS (gnu_expr) = 1;
6031 set_expr_location_from_node (gnu_expr, gnat_temp);
6032 *gnu_else_ptr = gnu_expr;
6033 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
6036 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
6040 case N_Case_Statement:
6041 gnu_result = Case_Statement_to_gnu (gnat_node);
6044 case N_Loop_Statement:
6045 gnu_result = Loop_Statement_to_gnu (gnat_node);
6048 case N_Block_Statement:
6049 start_stmt_group ();
6051 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
6052 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
6054 gnu_result = end_stmt_group ();
6056 if (Present (Identifier (gnat_node)))
6057 mark_out_of_scope (Entity (Identifier (gnat_node)));
6060 case N_Exit_Statement:
6062 = build2 (EXIT_STMT, void_type_node,
6063 (Present (Condition (gnat_node))
6064 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
6065 (Present (Name (gnat_node))
6066 ? get_gnu_tree (Entity (Name (gnat_node)))
6067 : VEC_last (loop_info, gnu_loop_stack)->label));
6070 case N_Return_Statement:
6072 tree gnu_ret_obj, gnu_ret_val;
6074 /* If the subprogram is a function, we must return the expression. */
6075 if (Present (Expression (gnat_node)))
6077 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
6079 /* If this function has copy-in/copy-out parameters, get the real
6080 object for the return. See Subprogram_to_gnu. */
6081 if (TYPE_CI_CO_LIST (gnu_subprog_type))
6082 gnu_ret_obj = VEC_last (tree, gnu_return_var_stack);
6084 gnu_ret_obj = DECL_RESULT (current_function_decl);
6086 /* Get the GCC tree for the expression to be returned. */
6087 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
6089 /* Do not remove the padding from GNU_RET_VAL if the inner type is
6090 self-referential since we want to allocate the fixed size. */
6091 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
6092 && TYPE_IS_PADDING_P
6093 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
6094 && CONTAINS_PLACEHOLDER_P
6095 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
6096 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
6098 /* If the function returns by direct reference, return a pointer
6099 to the return value. */
6100 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
6101 || By_Ref (gnat_node))
6102 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
6104 /* Otherwise, if it returns an unconstrained array, we have to
6105 allocate a new version of the result and return it. */
6106 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
6108 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
6110 /* And find out whether this is a candidate for Named Return
6111 Value. If so, record it. */
6112 if (!TYPE_CI_CO_LIST (gnu_subprog_type) && optimize)
6114 tree ret_val = gnu_ret_val;
6116 /* Strip useless conversions around the return value. */
6117 if (gnat_useless_type_conversion (ret_val))
6118 ret_val = TREE_OPERAND (ret_val, 0);
6120 /* Strip unpadding around the return value. */
6121 if (TREE_CODE (ret_val) == COMPONENT_REF
6122 && TYPE_IS_PADDING_P
6123 (TREE_TYPE (TREE_OPERAND (ret_val, 0))))
6124 ret_val = TREE_OPERAND (ret_val, 0);
6126 /* Now apply the test to the return value. */
6127 if (return_value_ok_for_nrv_p (NULL_TREE, ret_val))
6129 if (!f_named_ret_val)
6130 f_named_ret_val = BITMAP_GGC_ALLOC ();
6131 bitmap_set_bit (f_named_ret_val, DECL_UID (ret_val));
6133 f_gnat_ret = gnat_node;
6137 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
6139 TREE_TYPE (gnu_ret_obj),
6140 Procedure_To_Call (gnat_node),
6141 Storage_Pool (gnat_node),
6145 /* Otherwise, if it returns by invisible reference, dereference
6146 the pointer it is passed using the type of the return value
6147 and build the copy operation manually. This ensures that we
6148 don't copy too much data, for example if the return type is
6149 unconstrained with a maximum size. */
6150 else if (TREE_ADDRESSABLE (gnu_subprog_type))
6153 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
6155 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
6156 gnu_ret_deref, gnu_ret_val);
6157 add_stmt_with_node (gnu_result, gnat_node);
6158 gnu_ret_val = NULL_TREE;
6163 gnu_ret_obj = gnu_ret_val = NULL_TREE;
6165 /* If we have a return label defined, convert this into a branch to
6166 that label. The return proper will be handled elsewhere. */
6167 if (VEC_last (tree, gnu_return_label_stack))
6170 add_stmt (build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_ret_obj,
6173 gnu_result = build1 (GOTO_EXPR, void_type_node,
6174 VEC_last (tree, gnu_return_label_stack));
6176 /* When not optimizing, make sure the return is preserved. */
6177 if (!optimize && Comes_From_Source (gnat_node))
6178 DECL_ARTIFICIAL (VEC_last (tree, gnu_return_label_stack)) = 0;
6181 /* Otherwise, build a regular return. */
6183 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
6187 case N_Goto_Statement:
6189 = build1 (GOTO_EXPR, void_type_node, gnat_to_gnu (Name (gnat_node)));
6192 /***************************/
6193 /* Chapter 6: Subprograms */
6194 /***************************/
6196 case N_Subprogram_Declaration:
6197 /* Unless there is a freeze node, declare the subprogram. We consider
6198 this a "definition" even though we're not generating code for
6199 the subprogram because we will be making the corresponding GCC
6202 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
6203 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
6205 gnu_result = alloc_stmt_list ();
6208 case N_Abstract_Subprogram_Declaration:
6209 /* This subprogram doesn't exist for code generation purposes, but we
6210 have to elaborate the types of any parameters and result, unless
6211 they are imported types (nothing to generate in this case).
6213 The parameter list may contain types with freeze nodes, e.g. not null
6214 subtypes, so the subprogram itself may carry a freeze node, in which
6215 case its elaboration must be deferred. */
6217 /* Process the parameter types first. */
6218 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
6220 = First_Formal_With_Extras
6221 (Defining_Entity (Specification (gnat_node)));
6222 Present (gnat_temp);
6223 gnat_temp = Next_Formal_With_Extras (gnat_temp))
6224 if (Is_Itype (Etype (gnat_temp))
6225 && !From_With_Type (Etype (gnat_temp)))
6226 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
6228 /* Then the result type, set to Standard_Void_Type for procedures. */
6230 Entity_Id gnat_temp_type
6231 = Etype (Defining_Entity (Specification (gnat_node)));
6233 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
6234 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
6237 gnu_result = alloc_stmt_list ();
6240 case N_Defining_Program_Unit_Name:
6241 /* For a child unit identifier go up a level to get the specification.
6242 We get this when we try to find the spec of a child unit package
6243 that is the compilation unit being compiled. */
6244 gnu_result = gnat_to_gnu (Parent (gnat_node));
6247 case N_Subprogram_Body:
6248 Subprogram_Body_to_gnu (gnat_node);
6249 gnu_result = alloc_stmt_list ();
6252 case N_Function_Call:
6253 case N_Procedure_Call_Statement:
6254 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE, false);
6257 /************************/
6258 /* Chapter 7: Packages */
6259 /************************/
6261 case N_Package_Declaration:
6262 gnu_result = gnat_to_gnu (Specification (gnat_node));
6265 case N_Package_Specification:
6267 start_stmt_group ();
6268 process_decls (Visible_Declarations (gnat_node),
6269 Private_Declarations (gnat_node), Empty, true, true);
6270 gnu_result = end_stmt_group ();
6273 case N_Package_Body:
6275 /* If this is the body of a generic package - do nothing. */
6276 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
6278 gnu_result = alloc_stmt_list ();
6282 start_stmt_group ();
6283 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
6285 if (Present (Handled_Statement_Sequence (gnat_node)))
6286 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
6288 gnu_result = end_stmt_group ();
6291 /********************************/
6292 /* Chapter 8: Visibility Rules */
6293 /********************************/
6295 case N_Use_Package_Clause:
6296 case N_Use_Type_Clause:
6297 /* Nothing to do here - but these may appear in list of declarations. */
6298 gnu_result = alloc_stmt_list ();
6301 /*********************/
6302 /* Chapter 9: Tasks */
6303 /*********************/
6305 case N_Protected_Type_Declaration:
6306 gnu_result = alloc_stmt_list ();
6309 case N_Single_Task_Declaration:
6310 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
6311 gnu_result = alloc_stmt_list ();
6314 /*********************************************************/
6315 /* Chapter 10: Program Structure and Compilation Issues */
6316 /*********************************************************/
6318 case N_Compilation_Unit:
6319 /* This is not called for the main unit on which gigi is invoked. */
6320 Compilation_Unit_to_gnu (gnat_node);
6321 gnu_result = alloc_stmt_list ();
6324 case N_Subprogram_Body_Stub:
6325 case N_Package_Body_Stub:
6326 case N_Protected_Body_Stub:
6327 case N_Task_Body_Stub:
6328 /* Simply process whatever unit is being inserted. */
6329 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
6333 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
6336 /***************************/
6337 /* Chapter 11: Exceptions */
6338 /***************************/
6340 case N_Handled_Sequence_Of_Statements:
6341 /* If there is an At_End procedure attached to this node, and the EH
6342 mechanism is SJLJ, we must have at least a corresponding At_End
6343 handler, unless the No_Exception_Handlers restriction is set. */
6344 gcc_assert (type_annotate_only
6345 || Exception_Mechanism != Setjmp_Longjmp
6346 || No (At_End_Proc (gnat_node))
6347 || Present (Exception_Handlers (gnat_node))
6348 || No_Exception_Handlers_Set ());
6350 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
6353 case N_Exception_Handler:
6354 if (Exception_Mechanism == Setjmp_Longjmp)
6355 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
6356 else if (Exception_Mechanism == Back_End_Exceptions)
6357 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
6362 case N_Raise_Statement:
6363 /* Only for reraise in back-end exceptions mode. */
6364 gcc_assert (No (Name (gnat_node))
6365 && Exception_Mechanism == Back_End_Exceptions);
6367 start_stmt_group ();
6370 /* Clear the current exception pointer so that the occurrence won't be
6372 gnu_expr = create_var_decl (get_identifier ("SAVED_EXPTR"), NULL_TREE,
6373 ptr_type_node, gnu_incoming_exc_ptr,
6374 false, false, false, false, NULL, gnat_node);
6376 add_stmt (build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_incoming_exc_ptr,
6377 convert (ptr_type_node, integer_zero_node)));
6378 add_stmt (build_call_n_expr (reraise_zcx_decl, 1, gnu_expr));
6380 gnu_result = end_stmt_group ();
6383 case N_Push_Constraint_Error_Label:
6384 push_exception_label_stack (&gnu_constraint_error_label_stack,
6385 Exception_Label (gnat_node));
6388 case N_Push_Storage_Error_Label:
6389 push_exception_label_stack (&gnu_storage_error_label_stack,
6390 Exception_Label (gnat_node));
6393 case N_Push_Program_Error_Label:
6394 push_exception_label_stack (&gnu_program_error_label_stack,
6395 Exception_Label (gnat_node));
6398 case N_Pop_Constraint_Error_Label:
6399 VEC_pop (tree, gnu_constraint_error_label_stack);
6402 case N_Pop_Storage_Error_Label:
6403 VEC_pop (tree, gnu_storage_error_label_stack);
6406 case N_Pop_Program_Error_Label:
6407 VEC_pop (tree, gnu_program_error_label_stack);
6410 /******************************/
6411 /* Chapter 12: Generic Units */
6412 /******************************/
6414 case N_Generic_Function_Renaming_Declaration:
6415 case N_Generic_Package_Renaming_Declaration:
6416 case N_Generic_Procedure_Renaming_Declaration:
6417 case N_Generic_Package_Declaration:
6418 case N_Generic_Subprogram_Declaration:
6419 case N_Package_Instantiation:
6420 case N_Procedure_Instantiation:
6421 case N_Function_Instantiation:
6422 /* These nodes can appear on a declaration list but there is nothing to
6423 to be done with them. */
6424 gnu_result = alloc_stmt_list ();
6427 /**************************************************/
6428 /* Chapter 13: Representation Clauses and */
6429 /* Implementation-Dependent Features */
6430 /**************************************************/
6432 case N_Attribute_Definition_Clause:
6433 gnu_result = alloc_stmt_list ();
6435 /* The only one we need to deal with is 'Address since, for the others,
6436 the front-end puts the information elsewhere. */
6437 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
6440 /* And we only deal with 'Address if the object has a Freeze node. */
6441 gnat_temp = Entity (Name (gnat_node));
6442 if (No (Freeze_Node (gnat_temp)))
6445 /* Get the value to use as the address and save it as the equivalent
6446 for the object. When it is frozen, gnat_to_gnu_entity will do the
6448 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
6451 case N_Enumeration_Representation_Clause:
6452 case N_Record_Representation_Clause:
6454 /* We do nothing with these. SEM puts the information elsewhere. */
6455 gnu_result = alloc_stmt_list ();
6458 case N_Code_Statement:
6459 if (!type_annotate_only)
6461 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
6462 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
6463 tree gnu_clobbers = NULL_TREE, tail;
6464 bool allows_mem, allows_reg, fake;
6465 int ninputs, noutputs, i;
6466 const char **oconstraints;
6467 const char *constraint;
6470 /* First retrieve the 3 operand lists built by the front-end. */
6471 Setup_Asm_Outputs (gnat_node);
6472 while (Present (gnat_temp = Asm_Output_Variable ()))
6474 tree gnu_value = gnat_to_gnu (gnat_temp);
6475 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
6476 (Asm_Output_Constraint ()));
6478 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
6482 Setup_Asm_Inputs (gnat_node);
6483 while (Present (gnat_temp = Asm_Input_Value ()))
6485 tree gnu_value = gnat_to_gnu (gnat_temp);
6486 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
6487 (Asm_Input_Constraint ()));
6489 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
6493 Clobber_Setup (gnat_node);
6494 while ((clobber = Clobber_Get_Next ()))
6496 = tree_cons (NULL_TREE,
6497 build_string (strlen (clobber) + 1, clobber),
6500 /* Then perform some standard checking and processing on the
6501 operands. In particular, mark them addressable if needed. */
6502 gnu_outputs = nreverse (gnu_outputs);
6503 noutputs = list_length (gnu_outputs);
6504 gnu_inputs = nreverse (gnu_inputs);
6505 ninputs = list_length (gnu_inputs);
6506 oconstraints = XALLOCAVEC (const char *, noutputs);
6508 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
6510 tree output = TREE_VALUE (tail);
6512 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6513 oconstraints[i] = constraint;
6515 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6516 &allows_mem, &allows_reg, &fake))
6518 /* If the operand is going to end up in memory,
6519 mark it addressable. Note that we don't test
6520 allows_mem like in the input case below; this
6521 is modelled on the C front-end. */
6524 output = remove_conversions (output, false);
6525 if (TREE_CODE (output) == CONST_DECL
6526 && DECL_CONST_CORRESPONDING_VAR (output))
6527 output = DECL_CONST_CORRESPONDING_VAR (output);
6528 if (!gnat_mark_addressable (output))
6529 output = error_mark_node;
6533 output = error_mark_node;
6535 TREE_VALUE (tail) = output;
6538 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
6540 tree input = TREE_VALUE (tail);
6542 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6544 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
6546 &allows_mem, &allows_reg))
6548 /* If the operand is going to end up in memory,
6549 mark it addressable. */
6550 if (!allows_reg && allows_mem)
6552 input = remove_conversions (input, false);
6553 if (TREE_CODE (input) == CONST_DECL
6554 && DECL_CONST_CORRESPONDING_VAR (input))
6555 input = DECL_CONST_CORRESPONDING_VAR (input);
6556 if (!gnat_mark_addressable (input))
6557 input = error_mark_node;
6561 input = error_mark_node;
6563 TREE_VALUE (tail) = input;
6566 gnu_result = build5 (ASM_EXPR, void_type_node,
6567 gnu_template, gnu_outputs,
6568 gnu_inputs, gnu_clobbers, NULL_TREE);
6569 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
6572 gnu_result = alloc_stmt_list ();
6580 case N_Expression_With_Actions:
6581 gnu_result_type = get_unpadded_type (Etype (gnat_node));
6582 /* This construct doesn't define a scope so we don't wrap the statement
6583 list in a BIND_EXPR; however, we wrap it in a SAVE_EXPR to protect it
6585 gnu_result = build_stmt_group (Actions (gnat_node), false);
6586 gnu_result = build1 (SAVE_EXPR, void_type_node, gnu_result);
6587 TREE_SIDE_EFFECTS (gnu_result) = 1;
6588 gnu_expr = gnat_to_gnu (Expression (gnat_node));
6590 = build_compound_expr (TREE_TYPE (gnu_expr), gnu_result, gnu_expr);
6593 case N_Freeze_Entity:
6594 start_stmt_group ();
6595 process_freeze_entity (gnat_node);
6596 process_decls (Actions (gnat_node), Empty, Empty, true, true);
6597 gnu_result = end_stmt_group ();
6600 case N_Itype_Reference:
6601 if (!present_gnu_tree (Itype (gnat_node)))
6602 process_type (Itype (gnat_node));
6604 gnu_result = alloc_stmt_list ();
6607 case N_Free_Statement:
6608 if (!type_annotate_only)
6610 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
6611 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
6613 tree gnu_actual_obj_type = 0;
6616 /* If this is a thin pointer, we must dereference it to create
6617 a fat pointer, then go back below to a thin pointer. The
6618 reason for this is that we need a fat pointer someplace in
6619 order to properly compute the size. */
6620 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
6621 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
6622 build_unary_op (INDIRECT_REF, NULL_TREE,
6625 /* If this is an unconstrained array, we know the object must
6626 have been allocated with the template in front of the object.
6627 So pass the template address, but get the total size. Do this
6628 by converting to a thin pointer. */
6629 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
6631 = convert (build_pointer_type
6632 (TYPE_OBJECT_RECORD_TYPE
6633 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
6636 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
6638 if (Present (Actual_Designated_Subtype (gnat_node)))
6641 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
6643 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
6645 = build_unc_object_type_from_ptr (gnu_ptr_type,
6646 gnu_actual_obj_type,
6647 get_identifier ("DEALLOC"),
6651 gnu_actual_obj_type = gnu_obj_type;
6653 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
6655 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
6656 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
6658 tree gnu_char_ptr_type
6659 = build_pointer_type (unsigned_char_type_node);
6660 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
6661 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
6662 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
6667 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
6668 Procedure_To_Call (gnat_node),
6669 Storage_Pool (gnat_node),
6674 case N_Raise_Constraint_Error:
6675 case N_Raise_Program_Error:
6676 case N_Raise_Storage_Error:
6678 const int reason = UI_To_Int (Reason (gnat_node));
6679 const Node_Id gnat_cond = Condition (gnat_node);
6680 const bool with_extra_info = Exception_Extra_Info
6681 && !No_Exception_Handlers_Set ()
6682 && !get_exception_label (kind);
6683 tree gnu_cond = NULL_TREE;
6685 if (type_annotate_only)
6687 gnu_result = alloc_stmt_list ();
6691 gnu_result_type = get_unpadded_type (Etype (gnat_node));
6695 case CE_Access_Check_Failed:
6696 if (with_extra_info)
6697 gnu_result = build_call_raise_column (reason, gnat_node);
6700 case CE_Index_Check_Failed:
6701 case CE_Range_Check_Failed:
6702 case CE_Invalid_Data:
6703 if (Present (gnat_cond)
6704 && Nkind (gnat_cond) == N_Op_Not
6705 && Nkind (Right_Opnd (gnat_cond)) == N_In
6706 && Nkind (Right_Opnd (Right_Opnd (gnat_cond))) == N_Range)
6708 Node_Id gnat_index = Left_Opnd (Right_Opnd (gnat_cond));
6709 Node_Id gnat_type = Etype (gnat_index);
6710 Node_Id gnat_range = Right_Opnd (Right_Opnd (gnat_cond));
6711 tree gnu_index = gnat_to_gnu (gnat_index);
6712 tree gnu_low_bound = gnat_to_gnu (Low_Bound (gnat_range));
6713 tree gnu_high_bound = gnat_to_gnu (High_Bound (gnat_range));
6714 struct range_check_info_d *rci;
6717 && Known_Esize (gnat_type)
6718 && UI_To_Int (Esize (gnat_type)) <= 32)
6720 = build_call_raise_range (reason, gnat_node, gnu_index,
6721 gnu_low_bound, gnu_high_bound);
6723 /* If loop unswitching is enabled, we try to compute invariant
6724 conditions for checks applied to iteration variables, i.e.
6725 conditions that are both independent of the variable and
6726 necessary in order for the check to fail in the course of
6727 some iteration, and prepend them to the original condition
6728 of the checks. This will make it possible later for the
6729 loop unswitching pass to replace the loop with two loops,
6730 one of which has the checks eliminated and the other has
6731 the original checks reinstated, and a run time selection.
6732 The former loop will be suitable for vectorization. */
6733 if (flag_unswitch_loops
6734 && (gnu_low_bound = gnat_invariant_expr (gnu_low_bound))
6735 && (gnu_high_bound = gnat_invariant_expr (gnu_high_bound))
6736 && (rci = push_range_check_info (gnu_index)))
6738 rci->low_bound = gnu_low_bound;
6739 rci->high_bound = gnu_high_bound;
6740 rci->type = gnat_to_gnu_type (gnat_type);
6741 rci->invariant_cond = build1 (SAVE_EXPR, boolean_type_node,
6743 gnu_cond = build_binary_op (TRUTH_ANDIF_EXPR,
6745 rci->invariant_cond,
6746 gnat_to_gnu (gnat_cond));
6755 if (gnu_result == error_mark_node)
6756 gnu_result = build_call_raise (reason, gnat_node, kind);
6758 set_expr_location_from_node (gnu_result, gnat_node);
6760 /* If the type is VOID, this is a statement, so we need to generate
6761 the code for the call. Handle a condition, if there is one. */
6762 if (VOID_TYPE_P (gnu_result_type))
6764 if (Present (gnat_cond))
6767 gnu_cond = gnat_to_gnu (gnat_cond);
6769 = build3 (COND_EXPR, void_type_node, gnu_cond, gnu_result,
6770 alloc_stmt_list ());
6774 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
6778 case N_Validate_Unchecked_Conversion:
6780 Entity_Id gnat_target_type = Target_Type (gnat_node);
6781 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
6782 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
6784 /* No need for any warning in this case. */
6785 if (!flag_strict_aliasing)
6788 /* If the result is a pointer type, see if we are either converting
6789 from a non-pointer or from a pointer to a type with a different
6790 alias set and warn if so. If the result is defined in the same
6791 unit as this unchecked conversion, we can allow this because we
6792 can know to make the pointer type behave properly. */
6793 else if (POINTER_TYPE_P (gnu_target_type)
6794 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
6795 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
6797 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
6798 ? TREE_TYPE (gnu_source_type)
6800 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
6802 if ((TYPE_IS_DUMMY_P (gnu_target_desig_type)
6803 || get_alias_set (gnu_target_desig_type) != 0)
6804 && (!POINTER_TYPE_P (gnu_source_type)
6805 || (TYPE_IS_DUMMY_P (gnu_source_desig_type)
6806 != TYPE_IS_DUMMY_P (gnu_target_desig_type))
6807 || (TYPE_IS_DUMMY_P (gnu_source_desig_type)
6808 && gnu_source_desig_type != gnu_target_desig_type)
6809 || !alias_sets_conflict_p
6810 (get_alias_set (gnu_source_desig_type),
6811 get_alias_set (gnu_target_desig_type))))
6814 ("?possible aliasing problem for type&",
6815 gnat_node, Target_Type (gnat_node));
6817 ("\\?use -fno-strict-aliasing switch for references",
6820 ("\\?or use `pragma No_Strict_Aliasing (&);`",
6821 gnat_node, Target_Type (gnat_node));
6825 /* But if the result is a fat pointer type, we have no mechanism to
6826 do that, so we unconditionally warn in problematic cases. */
6827 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
6829 tree gnu_source_array_type
6830 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
6831 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
6833 tree gnu_target_array_type
6834 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
6836 if ((TYPE_IS_DUMMY_P (gnu_target_array_type)
6837 || get_alias_set (gnu_target_array_type) != 0)
6838 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
6839 || (TYPE_IS_DUMMY_P (gnu_source_array_type)
6840 != TYPE_IS_DUMMY_P (gnu_target_array_type))
6841 || (TYPE_IS_DUMMY_P (gnu_source_array_type)
6842 && gnu_source_array_type != gnu_target_array_type)
6843 || !alias_sets_conflict_p
6844 (get_alias_set (gnu_source_array_type),
6845 get_alias_set (gnu_target_array_type))))
6848 ("?possible aliasing problem for type&",
6849 gnat_node, Target_Type (gnat_node));
6851 ("\\?use -fno-strict-aliasing switch for references",
6856 gnu_result = alloc_stmt_list ();
6860 /* SCIL nodes require no processing for GCC. Other nodes should only
6861 be present when annotating types. */
6862 gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only);
6863 gnu_result = alloc_stmt_list ();
6866 /* If we pushed the processing of the elaboration routine, pop it back. */
6867 if (went_into_elab_proc)
6868 current_function_decl = NULL_TREE;
6870 /* When not optimizing, turn boolean rvalues B into B != false tests
6871 so that the code just below can put the location information of the
6872 reference to B on the inequality operator for better debug info. */
6874 && TREE_CODE (gnu_result) != INTEGER_CST
6875 && (kind == N_Identifier
6876 || kind == N_Expanded_Name
6877 || kind == N_Explicit_Dereference
6878 || kind == N_Function_Call
6879 || kind == N_Indexed_Component
6880 || kind == N_Selected_Component)
6881 && TREE_CODE (get_base_type (gnu_result_type)) == BOOLEAN_TYPE
6882 && !lvalue_required_p (gnat_node, gnu_result_type, false, false, false))
6883 gnu_result = build_binary_op (NE_EXPR, gnu_result_type,
6884 convert (gnu_result_type, gnu_result),
6885 convert (gnu_result_type,
6886 boolean_false_node));
6888 /* Set the location information on the result. Note that we may have
6889 no result if we tried to build a CALL_EXPR node to a procedure with
6890 no side-effects and optimization is enabled. */
6891 if (gnu_result && EXPR_P (gnu_result))
6892 set_gnu_expr_location_from_node (gnu_result, gnat_node);
6894 /* If we're supposed to return something of void_type, it means we have
6895 something we're elaborating for effect, so just return. */
6896 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
6899 /* If the result is a constant that overflowed, raise Constraint_Error. */
6900 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
6902 post_error ("?`Constraint_Error` will be raised at run time", gnat_node);
6904 = build1 (NULL_EXPR, gnu_result_type,
6905 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
6906 N_Raise_Constraint_Error));
6909 /* If the result has side-effects and is of an unconstrained type, make a
6910 SAVE_EXPR so that we can be sure it will only be referenced once. But
6911 this is useless for a call to a function that returns an unconstrained
6912 type with default discriminant, as we cannot compute the size of the
6913 actual returned object. We must do this before any conversions. */
6914 if (TREE_SIDE_EFFECTS (gnu_result)
6915 && !(TREE_CODE (gnu_result) == CALL_EXPR
6916 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
6917 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
6918 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
6919 gnu_result = gnat_stabilize_reference (gnu_result, false, NULL);
6921 /* Now convert the result to the result type, unless we are in one of the
6924 1. If this is the LHS of an assignment or an actual parameter of a
6925 call, return the result almost unmodified since the RHS will have
6926 to be converted to our type in that case, unless the result type
6927 has a simpler size. Likewise if there is just a no-op unchecked
6928 conversion in-between. Similarly, don't convert integral types
6929 that are the operands of an unchecked conversion since we need
6930 to ignore those conversions (for 'Valid).
6932 2. If we have a label (which doesn't have any well-defined type), a
6933 field or an error, return the result almost unmodified. Similarly,
6934 if the two types are record types with the same name, don't convert.
6935 This will be the case when we are converting from a packable version
6936 of a type to its original type and we need those conversions to be
6937 NOPs in order for assignments into these types to work properly.
6939 3. If the type is void or if we have no result, return error_mark_node
6940 to show we have no result.
6942 4. If this a call to a function that returns an unconstrained type with
6943 default discriminant, return the call expression unmodified since we
6944 cannot compute the size of the actual returned object.
6946 5. Finally, if the type of the result is already correct. */
6948 if (Present (Parent (gnat_node))
6949 && (lhs_or_actual_p (gnat_node)
6950 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
6951 && unchecked_conversion_nop (Parent (gnat_node)))
6952 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
6953 && !AGGREGATE_TYPE_P (gnu_result_type)
6954 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
6955 && !(TYPE_SIZE (gnu_result_type)
6956 && TYPE_SIZE (TREE_TYPE (gnu_result))
6957 && (AGGREGATE_TYPE_P (gnu_result_type)
6958 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
6959 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
6960 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
6962 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
6963 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
6964 && (CONTAINS_PLACEHOLDER_P
6965 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
6966 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
6967 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
6969 /* Remove padding only if the inner object is of self-referential
6970 size: in that case it must be an object of unconstrained type
6971 with a default discriminant and we want to avoid copying too
6973 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
6974 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
6975 (TREE_TYPE (gnu_result))))))
6976 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
6980 else if (TREE_CODE (gnu_result) == LABEL_DECL
6981 || TREE_CODE (gnu_result) == FIELD_DECL
6982 || TREE_CODE (gnu_result) == ERROR_MARK
6983 || (TYPE_NAME (gnu_result_type)
6984 == TYPE_NAME (TREE_TYPE (gnu_result))
6985 && TREE_CODE (gnu_result_type) == RECORD_TYPE
6986 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
6988 /* Remove any padding. */
6989 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
6990 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
6994 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
6995 gnu_result = error_mark_node;
6997 else if (TREE_CODE (gnu_result) == CALL_EXPR
6998 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
6999 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
7001 /* ??? We need to convert if the padded type has fixed size because
7002 gnat_types_compatible_p will say that padded types are compatible
7003 but the gimplifier will not and, therefore, will ultimately choke
7004 if there isn't a conversion added early. */
7005 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result))) == INTEGER_CST)
7006 gnu_result = convert (gnu_result_type, gnu_result);
7009 else if (TREE_TYPE (gnu_result) != gnu_result_type)
7010 gnu_result = convert (gnu_result_type, gnu_result);
7012 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
7013 while ((TREE_CODE (gnu_result) == NOP_EXPR
7014 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
7015 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
7016 gnu_result = TREE_OPERAND (gnu_result, 0);
7021 /* Subroutine of above to push the exception label stack. GNU_STACK is
7022 a pointer to the stack to update and GNAT_LABEL, if present, is the
7023 label to push onto the stack. */
7026 push_exception_label_stack (VEC(tree,gc) **gnu_stack, Entity_Id gnat_label)
7028 tree gnu_label = (Present (gnat_label)
7029 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
7032 VEC_safe_push (tree, gc, *gnu_stack, gnu_label);
7035 /* Record the current code position in GNAT_NODE. */
7038 record_code_position (Node_Id gnat_node)
7040 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
7042 add_stmt_with_node (stmt_stmt, gnat_node);
7043 save_gnu_tree (gnat_node, stmt_stmt, true);
7046 /* Insert the code for GNAT_NODE at the position saved for that node. */
7049 insert_code_for (Node_Id gnat_node)
7051 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
7052 save_gnu_tree (gnat_node, NULL_TREE, true);
7055 /* Start a new statement group chained to the previous group. */
7058 start_stmt_group (void)
7060 struct stmt_group *group = stmt_group_free_list;
7062 /* First see if we can get one from the free list. */
7064 stmt_group_free_list = group->previous;
7066 group = ggc_alloc_stmt_group ();
7068 group->previous = current_stmt_group;
7069 group->stmt_list = group->block = group->cleanups = NULL_TREE;
7070 current_stmt_group = group;
7073 /* Add GNU_STMT to the current statement group. If it is an expression with
7074 no effects, it is ignored. */
7077 add_stmt (tree gnu_stmt)
7079 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
7082 /* Similar, but the statement is always added, regardless of side-effects. */
7085 add_stmt_force (tree gnu_stmt)
7087 append_to_statement_list_force (gnu_stmt, ¤t_stmt_group->stmt_list);
7090 /* Like add_stmt, but set the location of GNU_STMT to that of GNAT_NODE. */
7093 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
7095 if (Present (gnat_node))
7096 set_expr_location_from_node (gnu_stmt, gnat_node);
7097 add_stmt (gnu_stmt);
7100 /* Similar, but the statement is always added, regardless of side-effects. */
7103 add_stmt_with_node_force (tree gnu_stmt, Node_Id gnat_node)
7105 if (Present (gnat_node))
7106 set_expr_location_from_node (gnu_stmt, gnat_node);
7107 add_stmt_force (gnu_stmt);
7110 /* Add a declaration statement for GNU_DECL to the current statement group.
7111 Get SLOC from Entity_Id. */
7114 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
7116 tree type = TREE_TYPE (gnu_decl);
7117 tree gnu_stmt, gnu_init, t;
7119 /* If this is a variable that Gigi is to ignore, we may have been given
7120 an ERROR_MARK. So test for it. We also might have been given a
7121 reference for a renaming. So only do something for a decl. Also
7122 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
7123 if (!DECL_P (gnu_decl)
7124 || (TREE_CODE (gnu_decl) == TYPE_DECL
7125 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
7128 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
7130 /* If we are global, we don't want to actually output the DECL_EXPR for
7131 this decl since we already have evaluated the expressions in the
7132 sizes and positions as globals and doing it again would be wrong. */
7133 if (global_bindings_p ())
7135 /* Mark everything as used to prevent node sharing with subprograms.
7136 Note that walk_tree knows how to deal with TYPE_DECL, but neither
7137 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
7138 MARK_VISITED (gnu_stmt);
7139 if (TREE_CODE (gnu_decl) == VAR_DECL
7140 || TREE_CODE (gnu_decl) == CONST_DECL)
7142 MARK_VISITED (DECL_SIZE (gnu_decl));
7143 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
7144 MARK_VISITED (DECL_INITIAL (gnu_decl));
7146 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
7147 else if (TREE_CODE (gnu_decl) == TYPE_DECL
7148 && RECORD_OR_UNION_TYPE_P (type)
7149 && !TYPE_FAT_POINTER_P (type))
7150 MARK_VISITED (TYPE_ADA_SIZE (type));
7152 else if (!DECL_EXTERNAL (gnu_decl))
7153 add_stmt_with_node (gnu_stmt, gnat_entity);
7155 /* If this is a variable and an initializer is attached to it, it must be
7156 valid for the context. Similar to init_const in create_var_decl_1. */
7157 if (TREE_CODE (gnu_decl) == VAR_DECL
7158 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
7159 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
7160 || (TREE_STATIC (gnu_decl)
7161 && !initializer_constant_valid_p (gnu_init,
7162 TREE_TYPE (gnu_init)))))
7164 /* If GNU_DECL has a padded type, convert it to the unpadded
7165 type so the assignment is done properly. */
7166 if (TYPE_IS_PADDING_P (type))
7167 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
7171 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
7173 DECL_INITIAL (gnu_decl) = NULL_TREE;
7174 if (TREE_READONLY (gnu_decl))
7176 TREE_READONLY (gnu_decl) = 0;
7177 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
7180 add_stmt_with_node (gnu_stmt, gnat_entity);
7184 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
7187 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
7191 if (TREE_VISITED (t))
7194 /* Don't mark a dummy type as visited because we want to mark its sizes
7195 and fields once it's filled in. */
7196 else if (!TYPE_IS_DUMMY_P (t))
7197 TREE_VISITED (t) = 1;
7200 TYPE_SIZES_GIMPLIFIED (t) = 1;
7205 /* Mark nodes rooted at T with TREE_VISITED and types as having their
7206 sized gimplified. We use this to indicate all variable sizes and
7207 positions in global types may not be shared by any subprogram. */
7210 mark_visited (tree t)
7212 walk_tree (&t, mark_visited_r, NULL, NULL);
7215 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
7216 set its location to that of GNAT_NODE if present. */
7219 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
7221 if (Present (gnat_node))
7222 set_expr_location_from_node (gnu_cleanup, gnat_node);
7223 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
7226 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
7229 set_block_for_group (tree gnu_block)
7231 gcc_assert (!current_stmt_group->block);
7232 current_stmt_group->block = gnu_block;
7235 /* Return code corresponding to the current code group. It is normally
7236 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
7237 BLOCK or cleanups were set. */
7240 end_stmt_group (void)
7242 struct stmt_group *group = current_stmt_group;
7243 tree gnu_retval = group->stmt_list;
7245 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
7246 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
7247 make a BIND_EXPR. Note that we nest in that because the cleanup may
7248 reference variables in the block. */
7249 if (gnu_retval == NULL_TREE)
7250 gnu_retval = alloc_stmt_list ();
7252 if (group->cleanups)
7253 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
7256 if (current_stmt_group->block)
7257 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
7258 gnu_retval, group->block);
7260 /* Remove this group from the stack and add it to the free list. */
7261 current_stmt_group = group->previous;
7262 group->previous = stmt_group_free_list;
7263 stmt_group_free_list = group;
7268 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
7272 add_stmt_list (List_Id gnat_list)
7276 if (Present (gnat_list))
7277 for (gnat_node = First (gnat_list); Present (gnat_node);
7278 gnat_node = Next (gnat_node))
7279 add_stmt (gnat_to_gnu (gnat_node));
7282 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
7283 If BINDING_P is true, push and pop a binding level around the list. */
7286 build_stmt_group (List_Id gnat_list, bool binding_p)
7288 start_stmt_group ();
7292 add_stmt_list (gnat_list);
7296 return end_stmt_group ();
7299 /* Generate GIMPLE in place for the expression at *EXPR_P. */
7302 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
7303 gimple_seq *post_p ATTRIBUTE_UNUSED)
7305 tree expr = *expr_p;
7308 if (IS_ADA_STMT (expr))
7309 return gnat_gimplify_stmt (expr_p);
7311 switch (TREE_CODE (expr))
7314 /* If this is for a scalar, just make a VAR_DECL for it. If for
7315 an aggregate, get a null pointer of the appropriate type and
7317 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
7318 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
7319 convert (build_pointer_type (TREE_TYPE (expr)),
7320 integer_zero_node));
7323 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
7324 TREE_NO_WARNING (*expr_p) = 1;
7327 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
7330 case UNCONSTRAINED_ARRAY_REF:
7331 /* We should only do this if we are just elaborating for side-effects,
7332 but we can't know that yet. */
7333 *expr_p = TREE_OPERAND (*expr_p, 0);
7337 op = TREE_OPERAND (expr, 0);
7339 /* If we are taking the address of a constant CONSTRUCTOR, make sure it
7340 is put into static memory. We know that it's going to be read-only
7341 given the semantics we have and it must be in static memory when the
7342 reference is in an elaboration procedure. */
7343 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
7345 tree addr = build_fold_addr_expr (tree_output_constant_def (op));
7346 *expr_p = fold_convert (TREE_TYPE (expr), addr);
7350 return GS_UNHANDLED;
7352 case VIEW_CONVERT_EXPR:
7353 op = TREE_OPERAND (expr, 0);
7355 /* If we are view-converting a CONSTRUCTOR or a call from an aggregate
7356 type to a scalar one, explicitly create the local temporary. That's
7357 required if the type is passed by reference. */
7358 if ((TREE_CODE (op) == CONSTRUCTOR || TREE_CODE (op) == CALL_EXPR)
7359 && AGGREGATE_TYPE_P (TREE_TYPE (op))
7360 && !AGGREGATE_TYPE_P (TREE_TYPE (expr)))
7362 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
7363 gimple_add_tmp_var (new_var);
7365 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
7366 gimplify_and_add (mod, pre_p);
7368 TREE_OPERAND (expr, 0) = new_var;
7372 return GS_UNHANDLED;
7375 op = DECL_EXPR_DECL (expr);
7377 /* The expressions for the RM bounds must be gimplified to ensure that
7378 they are properly elaborated. See gimplify_decl_expr. */
7379 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
7380 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
7381 switch (TREE_CODE (TREE_TYPE (op)))
7388 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
7390 val = TYPE_RM_MIN_VALUE (type);
7393 gimplify_one_sizepos (&val, pre_p);
7394 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
7395 SET_TYPE_RM_MIN_VALUE (t, val);
7398 val = TYPE_RM_MAX_VALUE (type);
7401 gimplify_one_sizepos (&val, pre_p);
7402 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
7403 SET_TYPE_RM_MAX_VALUE (t, val);
7413 /* ... fall through ... */
7416 return GS_UNHANDLED;
7420 /* Generate GIMPLE in place for the statement at *STMT_P. */
7422 static enum gimplify_status
7423 gnat_gimplify_stmt (tree *stmt_p)
7425 tree stmt = *stmt_p;
7427 switch (TREE_CODE (stmt))
7430 *stmt_p = STMT_STMT_STMT (stmt);
7435 tree gnu_start_label = create_artificial_label (input_location);
7436 tree gnu_cond = LOOP_STMT_COND (stmt);
7437 tree gnu_update = LOOP_STMT_UPDATE (stmt);
7438 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
7441 /* Build the condition expression from the test, if any. */
7444 = build3 (COND_EXPR, void_type_node, gnu_cond, alloc_stmt_list (),
7445 build1 (GOTO_EXPR, void_type_node, gnu_end_label));
7447 /* Set to emit the statements of the loop. */
7448 *stmt_p = NULL_TREE;
7450 /* We first emit the start label and then a conditional jump to the
7451 end label if there's a top condition, then the update if it's at
7452 the top, then the body of the loop, then a conditional jump to
7453 the end label if there's a bottom condition, then the update if
7454 it's at the bottom, and finally a jump to the start label and the
7455 definition of the end label. */
7456 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
7460 if (gnu_cond && !LOOP_STMT_BOTTOM_COND_P (stmt))
7461 append_to_statement_list (gnu_cond, stmt_p);
7463 if (gnu_update && LOOP_STMT_TOP_UPDATE_P (stmt))
7464 append_to_statement_list (gnu_update, stmt_p);
7466 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
7468 if (gnu_cond && LOOP_STMT_BOTTOM_COND_P (stmt))
7469 append_to_statement_list (gnu_cond, stmt_p);
7471 if (gnu_update && !LOOP_STMT_TOP_UPDATE_P (stmt))
7472 append_to_statement_list (gnu_update, stmt_p);
7474 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
7475 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
7476 append_to_statement_list (t, stmt_p);
7478 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
7485 /* Build a statement to jump to the corresponding end label, then
7486 see if it needs to be conditional. */
7487 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
7488 if (EXIT_STMT_COND (stmt))
7489 *stmt_p = build3 (COND_EXPR, void_type_node,
7490 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
7498 /* Force references to each of the entities in packages withed by GNAT_NODE.
7499 Operate recursively but check that we aren't elaborating something more
7502 This routine is exclusively called in type_annotate mode, to compute DDA
7503 information for types in withed units, for ASIS use. */
7506 elaborate_all_entities (Node_Id gnat_node)
7508 Entity_Id gnat_with_clause, gnat_entity;
7510 /* Process each unit only once. As we trace the context of all relevant
7511 units transitively, including generic bodies, we may encounter the
7512 same generic unit repeatedly. */
7513 if (!present_gnu_tree (gnat_node))
7514 save_gnu_tree (gnat_node, integer_zero_node, true);
7516 /* Save entities in all context units. A body may have an implicit_with
7517 on its own spec, if the context includes a child unit, so don't save
7519 for (gnat_with_clause = First (Context_Items (gnat_node));
7520 Present (gnat_with_clause);
7521 gnat_with_clause = Next (gnat_with_clause))
7522 if (Nkind (gnat_with_clause) == N_With_Clause
7523 && !present_gnu_tree (Library_Unit (gnat_with_clause))
7524 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
7526 elaborate_all_entities (Library_Unit (gnat_with_clause));
7528 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
7530 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
7531 Present (gnat_entity);
7532 gnat_entity = Next_Entity (gnat_entity))
7533 if (Is_Public (gnat_entity)
7534 && Convention (gnat_entity) != Convention_Intrinsic
7535 && Ekind (gnat_entity) != E_Package
7536 && Ekind (gnat_entity) != E_Package_Body
7537 && Ekind (gnat_entity) != E_Operator
7538 && !(IN (Ekind (gnat_entity), Type_Kind)
7539 && !Is_Frozen (gnat_entity))
7540 && !((Ekind (gnat_entity) == E_Procedure
7541 || Ekind (gnat_entity) == E_Function)
7542 && Is_Intrinsic_Subprogram (gnat_entity))
7543 && !IN (Ekind (gnat_entity), Named_Kind)
7544 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
7545 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
7547 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
7550 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
7552 /* Retrieve compilation unit node of generic body. */
7553 while (Present (gnat_body)
7554 && Nkind (gnat_body) != N_Compilation_Unit)
7555 gnat_body = Parent (gnat_body);
7557 /* If body is available, elaborate its context. */
7558 if (Present (gnat_body))
7559 elaborate_all_entities (gnat_body);
7563 if (Nkind (Unit (gnat_node)) == N_Package_Body)
7564 elaborate_all_entities (Library_Unit (gnat_node));
7567 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
7570 process_freeze_entity (Node_Id gnat_node)
7572 const Entity_Id gnat_entity = Entity (gnat_node);
7573 const Entity_Kind kind = Ekind (gnat_entity);
7574 tree gnu_old, gnu_new;
7576 /* If this is a package, we need to generate code for the package. */
7577 if (kind == E_Package)
7580 (Parent (Corresponding_Body
7581 (Parent (Declaration_Node (gnat_entity)))));
7585 /* Don't do anything for class-wide types as they are always transformed
7586 into their root type. */
7587 if (kind == E_Class_Wide_Type)
7590 /* Check for an old definition. This freeze node might be for an Itype. */
7592 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE;
7594 /* If this entity has an address representation clause, GNU_OLD is the
7595 address, so discard it here. */
7596 if (Present (Address_Clause (gnat_entity)))
7597 gnu_old = NULL_TREE;
7599 /* Don't do anything for subprograms that may have been elaborated before
7600 their freeze nodes. This can happen, for example, because of an inner
7601 call in an instance body or because of previous compilation of a spec
7602 for inlining purposes. */
7604 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
7605 && (kind == E_Function || kind == E_Procedure))
7606 || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
7607 && kind == E_Subprogram_Type)))
7610 /* If we have a non-dummy type old tree, we have nothing to do, except
7611 aborting if this is the public view of a private type whose full view was
7612 not delayed, as this node was never delayed as it should have been. We
7613 let this happen for concurrent types and their Corresponding_Record_Type,
7614 however, because each might legitimately be elaborated before its own
7615 freeze node, e.g. while processing the other. */
7617 && !(TREE_CODE (gnu_old) == TYPE_DECL
7618 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
7620 gcc_assert ((IN (kind, Incomplete_Or_Private_Kind)
7621 && Present (Full_View (gnat_entity))
7622 && No (Freeze_Node (Full_View (gnat_entity))))
7623 || Is_Concurrent_Type (gnat_entity)
7624 || (IN (kind, Record_Kind)
7625 && Is_Concurrent_Record_Type (gnat_entity)));
7629 /* Reset the saved tree, if any, and elaborate the object or type for real.
7630 If there is a full view, elaborate it and use the result. And, if this
7631 is the root type of a class-wide type, reuse it for the latter. */
7634 save_gnu_tree (gnat_entity, NULL_TREE, false);
7635 if (IN (kind, Incomplete_Or_Private_Kind)
7636 && Present (Full_View (gnat_entity))
7637 && present_gnu_tree (Full_View (gnat_entity)))
7638 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
7639 if (IN (kind, Type_Kind)
7640 && Present (Class_Wide_Type (gnat_entity))
7641 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
7642 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
7645 if (IN (kind, Incomplete_Or_Private_Kind)
7646 && Present (Full_View (gnat_entity)))
7648 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
7650 /* Propagate back-annotations from full view to partial view. */
7651 if (Unknown_Alignment (gnat_entity))
7652 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
7654 if (Unknown_Esize (gnat_entity))
7655 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
7657 if (Unknown_RM_Size (gnat_entity))
7658 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
7660 /* The above call may have defined this entity (the simplest example
7661 of this is when we have a private enumeral type since the bounds
7662 will have the public view). */
7663 if (!present_gnu_tree (gnat_entity))
7664 save_gnu_tree (gnat_entity, gnu_new, false);
7669 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
7670 && present_gnu_tree (Declaration_Node (gnat_entity)))
7671 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
7673 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
7676 if (IN (kind, Type_Kind)
7677 && Present (Class_Wide_Type (gnat_entity))
7678 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
7679 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
7681 /* If we have an old type and we've made pointers to this type, update those
7682 pointers. If this is a Taft amendment type in the main unit, we need to
7683 mark the type as used since other units referencing it don't see the full
7684 declaration and, therefore, cannot mark it as used themselves. */
7687 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7688 TREE_TYPE (gnu_new));
7689 if (DECL_TAFT_TYPE_P (gnu_old))
7690 used_types_insert (TREE_TYPE (gnu_new));
7694 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
7695 We make two passes, one to elaborate anything other than bodies (but
7696 we declare a function if there was no spec). The second pass
7697 elaborates the bodies.
7699 GNAT_END_LIST gives the element in the list past the end. Normally,
7700 this is Empty, but can be First_Real_Statement for a
7701 Handled_Sequence_Of_Statements.
7703 We make a complete pass through both lists if PASS1P is true, then make
7704 the second pass over both lists if PASS2P is true. The lists usually
7705 correspond to the public and private parts of a package. */
7708 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
7709 Node_Id gnat_end_list, bool pass1p, bool pass2p)
7711 List_Id gnat_decl_array[2];
7715 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
7718 for (i = 0; i <= 1; i++)
7719 if (Present (gnat_decl_array[i]))
7720 for (gnat_decl = First (gnat_decl_array[i]);
7721 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
7723 /* For package specs, we recurse inside the declarations,
7724 thus taking the two pass approach inside the boundary. */
7725 if (Nkind (gnat_decl) == N_Package_Declaration
7726 && (Nkind (Specification (gnat_decl)
7727 == N_Package_Specification)))
7728 process_decls (Visible_Declarations (Specification (gnat_decl)),
7729 Private_Declarations (Specification (gnat_decl)),
7730 Empty, true, false);
7732 /* Similarly for any declarations in the actions of a
7734 else if (Nkind (gnat_decl) == N_Freeze_Entity)
7736 process_freeze_entity (gnat_decl);
7737 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
7740 /* Package bodies with freeze nodes get their elaboration deferred
7741 until the freeze node, but the code must be placed in the right
7742 place, so record the code position now. */
7743 else if (Nkind (gnat_decl) == N_Package_Body
7744 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
7745 record_code_position (gnat_decl);
7747 else if (Nkind (gnat_decl) == N_Package_Body_Stub
7748 && Present (Library_Unit (gnat_decl))
7749 && Present (Freeze_Node
7752 (Library_Unit (gnat_decl)))))))
7753 record_code_position
7754 (Proper_Body (Unit (Library_Unit (gnat_decl))));
7756 /* We defer most subprogram bodies to the second pass. */
7757 else if (Nkind (gnat_decl) == N_Subprogram_Body)
7759 if (Acts_As_Spec (gnat_decl))
7761 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
7763 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
7764 && Ekind (gnat_subprog_id) != E_Generic_Function)
7765 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
7769 /* For bodies and stubs that act as their own specs, the entity
7770 itself must be elaborated in the first pass, because it may
7771 be used in other declarations. */
7772 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
7774 Node_Id gnat_subprog_id
7775 = Defining_Entity (Specification (gnat_decl));
7777 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
7778 && Ekind (gnat_subprog_id) != E_Generic_Procedure
7779 && Ekind (gnat_subprog_id) != E_Generic_Function)
7780 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
7783 /* Concurrent stubs stand for the corresponding subprogram bodies,
7784 which are deferred like other bodies. */
7785 else if (Nkind (gnat_decl) == N_Task_Body_Stub
7786 || Nkind (gnat_decl) == N_Protected_Body_Stub)
7790 add_stmt (gnat_to_gnu (gnat_decl));
7793 /* Here we elaborate everything we deferred above except for package bodies,
7794 which are elaborated at their freeze nodes. Note that we must also
7795 go inside things (package specs and freeze nodes) the first pass did. */
7797 for (i = 0; i <= 1; i++)
7798 if (Present (gnat_decl_array[i]))
7799 for (gnat_decl = First (gnat_decl_array[i]);
7800 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
7802 if (Nkind (gnat_decl) == N_Subprogram_Body
7803 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
7804 || Nkind (gnat_decl) == N_Task_Body_Stub
7805 || Nkind (gnat_decl) == N_Protected_Body_Stub)
7806 add_stmt (gnat_to_gnu (gnat_decl));
7808 else if (Nkind (gnat_decl) == N_Package_Declaration
7809 && (Nkind (Specification (gnat_decl)
7810 == N_Package_Specification)))
7811 process_decls (Visible_Declarations (Specification (gnat_decl)),
7812 Private_Declarations (Specification (gnat_decl)),
7813 Empty, false, true);
7815 else if (Nkind (gnat_decl) == N_Freeze_Entity)
7816 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
7820 /* Make a unary operation of kind CODE using build_unary_op, but guard
7821 the operation by an overflow check. CODE can be one of NEGATE_EXPR
7822 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
7823 the operation is to be performed in that type. GNAT_NODE is the gnat
7824 node conveying the source location for which the error should be
7828 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
7831 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
7833 operand = gnat_protect_expr (operand);
7835 return emit_check (build_binary_op (EQ_EXPR, boolean_type_node,
7836 operand, TYPE_MIN_VALUE (gnu_type)),
7837 build_unary_op (code, gnu_type, operand),
7838 CE_Overflow_Check_Failed, gnat_node);
7841 /* Make a binary operation of kind CODE using build_binary_op, but guard
7842 the operation by an overflow check. CODE can be one of PLUS_EXPR,
7843 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
7844 Usually the operation is to be performed in that type. GNAT_NODE is
7845 the GNAT node conveying the source location for which the error should
7849 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
7850 tree right, Node_Id gnat_node)
7852 tree lhs = gnat_protect_expr (left);
7853 tree rhs = gnat_protect_expr (right);
7854 tree type_max = TYPE_MAX_VALUE (gnu_type);
7855 tree type_min = TYPE_MIN_VALUE (gnu_type);
7858 tree zero = convert (gnu_type, integer_zero_node);
7863 int precision = TYPE_PRECISION (gnu_type);
7865 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
7867 /* Prefer a constant or known-positive rhs to simplify checks. */
7868 if (!TREE_CONSTANT (rhs)
7869 && commutative_tree_code (code)
7870 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
7871 && tree_expr_nonnegative_p (lhs))))
7878 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
7879 ? boolean_false_node
7880 : build_binary_op (LT_EXPR, boolean_type_node, rhs, zero);
7882 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
7884 /* Try a few strategies that may be cheaper than the general
7885 code at the end of the function, if the rhs is not known.
7887 - Call library function for 64-bit multiplication (complex)
7888 - Widen, if input arguments are sufficiently small
7889 - Determine overflow using wrapped result for addition/subtraction. */
7891 if (!TREE_CONSTANT (rhs))
7893 /* Even for add/subtract double size to get another base type. */
7894 int needed_precision = precision * 2;
7896 if (code == MULT_EXPR && precision == 64)
7898 tree int_64 = gnat_type_for_size (64, 0);
7900 return convert (gnu_type, build_call_n_expr (mulv64_decl, 2,
7901 convert (int_64, lhs),
7902 convert (int_64, rhs)));
7905 else if (needed_precision <= BITS_PER_WORD
7906 || (code == MULT_EXPR
7907 && needed_precision <= LONG_LONG_TYPE_SIZE))
7909 tree wide_type = gnat_type_for_size (needed_precision, 0);
7911 tree wide_result = build_binary_op (code, wide_type,
7912 convert (wide_type, lhs),
7913 convert (wide_type, rhs));
7915 tree check = build_binary_op
7916 (TRUTH_ORIF_EXPR, boolean_type_node,
7917 build_binary_op (LT_EXPR, boolean_type_node, wide_result,
7918 convert (wide_type, type_min)),
7919 build_binary_op (GT_EXPR, boolean_type_node, wide_result,
7920 convert (wide_type, type_max)));
7922 tree result = convert (gnu_type, wide_result);
7925 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
7928 else if (code == PLUS_EXPR || code == MINUS_EXPR)
7930 tree unsigned_type = gnat_type_for_size (precision, 1);
7931 tree wrapped_expr = convert
7932 (gnu_type, build_binary_op (code, unsigned_type,
7933 convert (unsigned_type, lhs),
7934 convert (unsigned_type, rhs)));
7936 tree result = convert
7937 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
7939 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
7940 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
7941 tree check = build_binary_op
7942 (TRUTH_XOR_EXPR, boolean_type_node, rhs_lt_zero,
7943 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
7944 boolean_type_node, wrapped_expr, lhs));
7947 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
7954 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
7955 check_pos = build_binary_op (GT_EXPR, boolean_type_node, lhs,
7956 build_binary_op (MINUS_EXPR, gnu_type,
7959 /* When rhs < 0, overflow when lhs < type_min - rhs. */
7960 check_neg = build_binary_op (LT_EXPR, boolean_type_node, lhs,
7961 build_binary_op (MINUS_EXPR, gnu_type,
7966 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
7967 check_pos = build_binary_op (LT_EXPR, boolean_type_node, lhs,
7968 build_binary_op (PLUS_EXPR, gnu_type,
7971 /* When rhs < 0, overflow when lhs > type_max + rhs. */
7972 check_neg = build_binary_op (GT_EXPR, boolean_type_node, lhs,
7973 build_binary_op (PLUS_EXPR, gnu_type,
7978 /* The check here is designed to be efficient if the rhs is constant,
7979 but it will work for any rhs by using integer division.
7980 Four different check expressions determine whether X * C overflows,
7983 C > 0 => X > type_max / C || X < type_min / C
7984 C == -1 => X == type_min
7985 C < -1 => X > type_min / C || X < type_max / C */
7987 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
7988 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
7991 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
7992 build_binary_op (NE_EXPR, boolean_type_node, zero,
7994 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
7995 build_binary_op (GT_EXPR,
7998 build_binary_op (LT_EXPR,
8003 = fold_build3 (COND_EXPR, boolean_type_node,
8004 build_binary_op (EQ_EXPR, boolean_type_node, rhs,
8005 build_int_cst (gnu_type, -1)),
8006 build_binary_op (EQ_EXPR, boolean_type_node, lhs,
8008 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8009 build_binary_op (GT_EXPR,
8012 build_binary_op (LT_EXPR,
8021 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
8023 /* If we can fold the expression to a constant, just return it.
8024 The caller will deal with overflow, no need to generate a check. */
8025 if (TREE_CONSTANT (gnu_expr))
8028 check = fold_build3 (COND_EXPR, boolean_type_node, rhs_lt_zero, check_neg,
8031 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
8034 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
8035 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
8036 which we have to check. GNAT_NODE is the GNAT node conveying the source
8037 location for which the error should be signaled. */
8040 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
8042 tree gnu_range_type = get_unpadded_type (gnat_range_type);
8043 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
8044 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
8045 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
8047 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
8048 This can for example happen when translating 'Val or 'Value. */
8049 if (gnu_compare_type == gnu_range_type)
8052 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
8053 we can't do anything since we might be truncating the bounds. No
8054 check is needed in this case. */
8055 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
8056 && (TYPE_PRECISION (gnu_compare_type)
8057 < TYPE_PRECISION (get_base_type (gnu_range_type))))
8060 /* Checked expressions must be evaluated only once. */
8061 gnu_expr = gnat_protect_expr (gnu_expr);
8063 /* Note that the form of the check is
8064 (not (expr >= lo)) or (not (expr <= hi))
8065 the reason for this slightly convoluted form is that NaNs
8066 are not considered to be in range in the float case. */
8068 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8070 (build_binary_op (GE_EXPR, boolean_type_node,
8071 convert (gnu_compare_type, gnu_expr),
8072 convert (gnu_compare_type, gnu_low))),
8074 (build_binary_op (LE_EXPR, boolean_type_node,
8075 convert (gnu_compare_type, gnu_expr),
8076 convert (gnu_compare_type,
8078 gnu_expr, CE_Range_Check_Failed, gnat_node);
8081 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
8082 we are about to index, GNU_EXPR is the index expression to be checked,
8083 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
8084 has to be checked. Note that for index checking we cannot simply use the
8085 emit_range_check function (although very similar code needs to be generated
8086 in both cases) since for index checking the array type against which we are
8087 checking the indices may be unconstrained and consequently we need to get
8088 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
8089 The place where we need to do that is in subprograms having unconstrained
8090 array formal parameters. GNAT_NODE is the GNAT node conveying the source
8091 location for which the error should be signaled. */
8094 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
8095 tree gnu_high, Node_Id gnat_node)
8097 tree gnu_expr_check;
8099 /* Checked expressions must be evaluated only once. */
8100 gnu_expr = gnat_protect_expr (gnu_expr);
8102 /* Must do this computation in the base type in case the expression's
8103 type is an unsigned subtypes. */
8104 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
8106 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
8107 the object we are handling. */
8108 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
8109 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
8112 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8113 build_binary_op (LT_EXPR, boolean_type_node,
8115 convert (TREE_TYPE (gnu_expr_check),
8117 build_binary_op (GT_EXPR, boolean_type_node,
8119 convert (TREE_TYPE (gnu_expr_check),
8121 gnu_expr, CE_Index_Check_Failed, gnat_node);
8124 /* GNU_COND contains the condition corresponding to an access, discriminant or
8125 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
8126 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
8127 REASON is the code that says why the exception was raised. GNAT_NODE is
8128 the GNAT node conveying the source location for which the error should be
8132 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
8135 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
8137 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
8138 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
8139 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
8142 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
8143 we don't need to evaluate it just for the check. */
8144 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
8149 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
8150 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
8151 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
8152 float to integer conversion with truncation; otherwise round.
8153 GNAT_NODE is the GNAT node conveying the source location for which the
8154 error should be signaled. */
8157 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
8158 bool rangep, bool truncatep, Node_Id gnat_node)
8160 tree gnu_type = get_unpadded_type (gnat_type);
8161 tree gnu_in_type = TREE_TYPE (gnu_expr);
8162 tree gnu_in_basetype = get_base_type (gnu_in_type);
8163 tree gnu_base_type = get_base_type (gnu_type);
8164 tree gnu_result = gnu_expr;
8166 /* If we are not doing any checks, the output is an integral type, and
8167 the input is not a floating type, just do the conversion. This
8168 shortcut is required to avoid problems with packed array types
8169 and simplifies code in all cases anyway. */
8170 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
8171 && !FLOAT_TYPE_P (gnu_in_type))
8172 return convert (gnu_type, gnu_expr);
8174 /* First convert the expression to its base type. This
8175 will never generate code, but makes the tests below much simpler.
8176 But don't do this if converting from an integer type to an unconstrained
8177 array type since then we need to get the bounds from the original
8179 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
8180 gnu_result = convert (gnu_in_basetype, gnu_result);
8182 /* If overflow checks are requested, we need to be sure the result will
8183 fit in the output base type. But don't do this if the input
8184 is integer and the output floating-point. */
8186 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
8188 /* Ensure GNU_EXPR only gets evaluated once. */
8189 tree gnu_input = gnat_protect_expr (gnu_result);
8190 tree gnu_cond = boolean_false_node;
8191 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
8192 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
8193 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
8194 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
8196 /* Convert the lower bounds to signed types, so we're sure we're
8197 comparing them properly. Likewise, convert the upper bounds
8198 to unsigned types. */
8199 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
8200 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
8202 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8203 && !TYPE_UNSIGNED (gnu_in_basetype))
8204 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
8206 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
8207 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
8209 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
8210 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
8212 /* Check each bound separately and only if the result bound
8213 is tighter than the bound on the input type. Note that all the
8214 types are base types, so the bounds must be constant. Also,
8215 the comparison is done in the base type of the input, which
8216 always has the proper signedness. First check for input
8217 integer (which means output integer), output float (which means
8218 both float), or mixed, in which case we always compare.
8219 Note that we have to do the comparison which would *fail* in the
8220 case of an error since if it's an FP comparison and one of the
8221 values is a NaN or Inf, the comparison will fail. */
8222 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8223 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
8224 : (FLOAT_TYPE_P (gnu_base_type)
8225 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
8226 TREE_REAL_CST (gnu_out_lb))
8230 (build_binary_op (GE_EXPR, boolean_type_node,
8231 gnu_input, convert (gnu_in_basetype,
8234 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8235 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
8236 : (FLOAT_TYPE_P (gnu_base_type)
8237 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
8238 TREE_REAL_CST (gnu_in_lb))
8241 = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node, gnu_cond,
8243 (build_binary_op (LE_EXPR, boolean_type_node,
8245 convert (gnu_in_basetype,
8248 if (!integer_zerop (gnu_cond))
8249 gnu_result = emit_check (gnu_cond, gnu_input,
8250 CE_Overflow_Check_Failed, gnat_node);
8253 /* Now convert to the result base type. If this is a non-truncating
8254 float-to-integer conversion, round. */
8255 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
8258 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
8259 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
8260 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
8261 const struct real_format *fmt;
8263 /* The following calculations depend on proper rounding to even
8264 of each arithmetic operation. In order to prevent excess
8265 precision from spoiling this property, use the widest hardware
8266 floating-point type if FP_ARITH_MAY_WIDEN is true. */
8268 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
8270 /* FIXME: Should not have padding in the first place. */
8271 if (TYPE_IS_PADDING_P (calc_type))
8272 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
8274 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
8275 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
8276 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
8277 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
8278 half_minus_pred_half);
8279 gnu_pred_half = build_real (calc_type, pred_half);
8281 /* If the input is strictly negative, subtract this value
8282 and otherwise add it from the input. For 0.5, the result
8283 is exactly between 1.0 and the machine number preceding 1.0
8284 (for calc_type). Since the last bit of 1.0 is even, this 0.5
8285 will round to 1.0, while all other number with an absolute
8286 value less than 0.5 round to 0.0. For larger numbers exactly
8287 halfway between integers, rounding will always be correct as
8288 the true mathematical result will be closer to the higher
8289 integer compared to the lower one. So, this constant works
8290 for all floating-point numbers.
8292 The reason to use the same constant with subtract/add instead
8293 of a positive and negative constant is to allow the comparison
8294 to be scheduled in parallel with retrieval of the constant and
8295 conversion of the input to the calc_type (if necessary). */
8297 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
8298 gnu_result = gnat_protect_expr (gnu_result);
8299 gnu_conv = convert (calc_type, gnu_result);
8301 = fold_build2 (GE_EXPR, boolean_type_node, gnu_result, gnu_zero);
8303 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
8304 gnu_subtract_pred_half
8305 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
8306 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
8307 gnu_add_pred_half, gnu_subtract_pred_half);
8310 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
8311 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
8312 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
8313 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
8315 gnu_result = convert (gnu_base_type, gnu_result);
8317 /* Finally, do the range check if requested. Note that if the result type
8318 is a modular type, the range check is actually an overflow check. */
8320 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
8321 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
8322 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
8324 return convert (gnu_type, gnu_result);
8327 /* Return true if GNU_EXPR can be directly addressed. This is the case
8328 unless it is an expression involving computation or if it involves a
8329 reference to a bitfield or to an object not sufficiently aligned for
8330 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
8331 be directly addressed as an object of this type.
8333 *** Notes on addressability issues in the Ada compiler ***
8335 This predicate is necessary in order to bridge the gap between Gigi
8336 and the middle-end about addressability of GENERIC trees. A tree
8337 is said to be addressable if it can be directly addressed, i.e. if
8338 its address can be taken, is a multiple of the type's alignment on
8339 strict-alignment architectures and returns the first storage unit
8340 assigned to the object represented by the tree.
8342 In the C family of languages, everything is in practice addressable
8343 at the language level, except for bit-fields. This means that these
8344 compilers will take the address of any tree that doesn't represent
8345 a bit-field reference and expect the result to be the first storage
8346 unit assigned to the object. Even in cases where this will result
8347 in unaligned accesses at run time, nothing is supposed to be done
8348 and the program is considered as erroneous instead (see PR c/18287).
8350 The implicit assumptions made in the middle-end are in keeping with
8351 the C viewpoint described above:
8352 - the address of a bit-field reference is supposed to be never
8353 taken; the compiler (generally) will stop on such a construct,
8354 - any other tree is addressable if it is formally addressable,
8355 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
8357 In Ada, the viewpoint is the opposite one: nothing is addressable
8358 at the language level unless explicitly declared so. This means
8359 that the compiler will both make sure that the trees representing
8360 references to addressable ("aliased" in Ada parlance) objects are
8361 addressable and make no real attempts at ensuring that the trees
8362 representing references to non-addressable objects are addressable.
8364 In the first case, Ada is effectively equivalent to C and handing
8365 down the direct result of applying ADDR_EXPR to these trees to the
8366 middle-end works flawlessly. In the second case, Ada cannot afford
8367 to consider the program as erroneous if the address of trees that
8368 are not addressable is requested for technical reasons, unlike C;
8369 as a consequence, the Ada compiler must arrange for either making
8370 sure that this address is not requested in the middle-end or for
8371 compensating by inserting temporaries if it is requested in Gigi.
8373 The first goal can be achieved because the middle-end should not
8374 request the address of non-addressable trees on its own; the only
8375 exception is for the invocation of low-level block operations like
8376 memcpy, for which the addressability requirements are lower since
8377 the type's alignment can be disregarded. In practice, this means
8378 that Gigi must make sure that such operations cannot be applied to
8379 non-BLKmode bit-fields.
8381 The second goal is achieved by means of the addressable_p predicate,
8382 which computes whether a temporary must be inserted by Gigi when the
8383 address of a tree is requested; if so, the address of the temporary
8384 will be used in lieu of that of the original tree and some glue code
8385 generated to connect everything together. */
8388 addressable_p (tree gnu_expr, tree gnu_type)
8390 /* For an integral type, the size of the actual type of the object may not
8391 be greater than that of the expected type, otherwise an indirect access
8392 in the latter type wouldn't correctly set all the bits of the object. */
8394 && INTEGRAL_TYPE_P (gnu_type)
8395 && smaller_form_type_p (gnu_type, TREE_TYPE (gnu_expr)))
8398 /* The size of the actual type of the object may not be smaller than that
8399 of the expected type, otherwise an indirect access in the latter type
8400 would be larger than the object. But only record types need to be
8401 considered in practice for this case. */
8403 && TREE_CODE (gnu_type) == RECORD_TYPE
8404 && smaller_form_type_p (TREE_TYPE (gnu_expr), gnu_type))
8407 switch (TREE_CODE (gnu_expr))
8413 /* All DECLs are addressable: if they are in a register, we can force
8417 case UNCONSTRAINED_ARRAY_REF:
8419 /* Taking the address of a dereference yields the original pointer. */
8424 /* Taking the address yields a pointer to the constant pool. */
8428 /* Taking the address of a static constructor yields a pointer to the
8429 tree constant pool. */
8430 return TREE_STATIC (gnu_expr) ? true : false;
8441 /* All rvalues are deemed addressable since taking their address will
8442 force a temporary to be created by the middle-end. */
8446 /* The address of a compound expression is that of its 2nd operand. */
8447 return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type);
8450 /* We accept &COND_EXPR as soon as both operands are addressable and
8451 expect the outcome to be the address of the selected operand. */
8452 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
8453 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
8456 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
8457 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
8458 the field is sufficiently aligned, in case it is subject
8459 to a pragma Component_Alignment. But we don't need to
8460 check the alignment of the containing record, as it is
8461 guaranteed to be not smaller than that of its most
8462 aligned field that is not a bit-field. */
8463 && (!STRICT_ALIGNMENT
8464 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
8465 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
8466 /* The field of a padding record is always addressable. */
8467 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
8468 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8470 case ARRAY_REF: case ARRAY_RANGE_REF:
8471 case REALPART_EXPR: case IMAGPART_EXPR:
8473 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
8476 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
8477 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8479 case VIEW_CONVERT_EXPR:
8481 /* This is addressable if we can avoid a copy. */
8482 tree type = TREE_TYPE (gnu_expr);
8483 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
8484 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
8485 && (!STRICT_ALIGNMENT
8486 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
8487 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
8488 || ((TYPE_MODE (type) == BLKmode
8489 || TYPE_MODE (inner_type) == BLKmode)
8490 && (!STRICT_ALIGNMENT
8491 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
8492 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
8493 || TYPE_ALIGN_OK (type)
8494 || TYPE_ALIGN_OK (inner_type))))
8495 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8503 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
8504 a separate Freeze node exists, delay the bulk of the processing. Otherwise
8505 make a GCC type for GNAT_ENTITY and set up the correspondence. */
8508 process_type (Entity_Id gnat_entity)
8511 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
8514 /* If we are to delay elaboration of this type, just do any
8515 elaborations needed for expressions within the declaration and
8516 make a dummy type entry for this node and its Full_View (if
8517 any) in case something points to it. Don't do this if it
8518 has already been done (the only way that can happen is if
8519 the private completion is also delayed). */
8520 if (Present (Freeze_Node (gnat_entity))
8521 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
8522 && Present (Full_View (gnat_entity))
8523 && Freeze_Node (Full_View (gnat_entity))
8524 && !present_gnu_tree (Full_View (gnat_entity))))
8526 elaborate_entity (gnat_entity);
8530 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
8531 save_gnu_tree (gnat_entity, gnu_decl, false);
8532 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
8533 && Present (Full_View (gnat_entity)))
8535 if (Has_Completion_In_Body (gnat_entity))
8536 DECL_TAFT_TYPE_P (gnu_decl) = 1;
8537 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
8544 /* If we saved away a dummy type for this node it means that this
8545 made the type that corresponds to the full type of an incomplete
8546 type. Clear that type for now and then update the type in the
8550 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
8551 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
8553 save_gnu_tree (gnat_entity, NULL_TREE, false);
8556 /* Now fully elaborate the type. */
8557 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
8558 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
8560 /* If we have an old type and we've made pointers to this type, update those
8561 pointers. If this is a Taft amendment type in the main unit, we need to
8562 mark the type as used since other units referencing it don't see the full
8563 declaration and, therefore, cannot mark it as used themselves. */
8566 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
8567 TREE_TYPE (gnu_new));
8568 if (DECL_TAFT_TYPE_P (gnu_old))
8569 used_types_insert (TREE_TYPE (gnu_new));
8572 /* If this is a record type corresponding to a task or protected type
8573 that is a completion of an incomplete type, perform a similar update
8574 on the type. ??? Including protected types here is a guess. */
8575 if (IN (Ekind (gnat_entity), Record_Kind)
8576 && Is_Concurrent_Record_Type (gnat_entity)
8577 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
8580 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
8582 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
8584 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
8587 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
8588 TREE_TYPE (gnu_new));
8592 /* GNAT_ENTITY is the type of the resulting constructor, GNAT_ASSOC is the
8593 front of the Component_Associations of an N_Aggregate and GNU_TYPE is the
8594 GCC type of the corresponding record type. Return the CONSTRUCTOR. */
8597 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
8599 tree gnu_list = NULL_TREE, gnu_result;
8601 /* We test for GNU_FIELD being empty in the case where a variant
8602 was the last thing since we don't take things off GNAT_ASSOC in
8603 that case. We check GNAT_ASSOC in case we have a variant, but it
8606 for (; Present (gnat_assoc); gnat_assoc = Next (gnat_assoc))
8608 Node_Id gnat_field = First (Choices (gnat_assoc));
8609 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
8610 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
8612 /* The expander is supposed to put a single component selector name
8613 in every record component association. */
8614 gcc_assert (No (Next (gnat_field)));
8616 /* Ignore fields that have Corresponding_Discriminants since we'll
8617 be setting that field in the parent. */
8618 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
8619 && Is_Tagged_Type (Scope (Entity (gnat_field))))
8622 /* Also ignore discriminants of Unchecked_Unions. */
8623 if (Is_Unchecked_Union (gnat_entity)
8624 && Ekind (Entity (gnat_field)) == E_Discriminant)
8627 /* Before assigning a value in an aggregate make sure range checks
8628 are done if required. Then convert to the type of the field. */
8629 if (Do_Range_Check (Expression (gnat_assoc)))
8630 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
8632 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
8634 /* Add the field and expression to the list. */
8635 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
8638 gnu_result = extract_values (gnu_list, gnu_type);
8640 #ifdef ENABLE_CHECKING
8641 /* Verify that every entry in GNU_LIST was used. */
8642 for (; gnu_list; gnu_list = TREE_CHAIN (gnu_list))
8643 gcc_assert (TREE_ADDRESSABLE (gnu_list));
8649 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
8650 the first element of an array aggregate. It may itself be an aggregate.
8651 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
8652 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
8653 for range checking. */
8656 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
8657 Entity_Id gnat_component_type)
8659 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
8661 VEC(constructor_elt,gc) *gnu_expr_vec = NULL;
8663 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
8665 /* If the expression is itself an array aggregate then first build the
8666 innermost constructor if it is part of our array (multi-dimensional
8668 if (Nkind (gnat_expr) == N_Aggregate
8669 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
8670 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
8671 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
8672 TREE_TYPE (gnu_array_type),
8673 gnat_component_type);
8676 gnu_expr = gnat_to_gnu (gnat_expr);
8678 /* Before assigning the element to the array, make sure it is
8680 if (Do_Range_Check (gnat_expr))
8681 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
8684 CONSTRUCTOR_APPEND_ELT (gnu_expr_vec, gnu_index,
8685 convert (TREE_TYPE (gnu_array_type), gnu_expr));
8687 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node);
8690 return gnat_build_constructor (gnu_array_type, gnu_expr_vec);
8693 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
8694 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
8695 of the associations that are from RECORD_TYPE. If we see an internal
8696 record, make a recursive call to fill it in as well. */
8699 extract_values (tree values, tree record_type)
8702 VEC(constructor_elt,gc) *v = NULL;
8704 for (field = TYPE_FIELDS (record_type); field; field = DECL_CHAIN (field))
8708 /* _Parent is an internal field, but may have values in the aggregate,
8709 so check for values first. */
8710 if ((tem = purpose_member (field, values)))
8712 value = TREE_VALUE (tem);
8713 TREE_ADDRESSABLE (tem) = 1;
8716 else if (DECL_INTERNAL_P (field))
8718 value = extract_values (values, TREE_TYPE (field));
8719 if (TREE_CODE (value) == CONSTRUCTOR
8720 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
8724 /* If we have a record subtype, the names will match, but not the
8725 actual FIELD_DECLs. */
8726 for (tem = values; tem; tem = TREE_CHAIN (tem))
8727 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
8729 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
8730 TREE_ADDRESSABLE (tem) = 1;
8736 CONSTRUCTOR_APPEND_ELT (v, field, value);
8739 return gnat_build_constructor (record_type, v);
8742 /* EXP is to be treated as an array or record. Handle the cases when it is
8743 an access object and perform the required dereferences. */
8746 maybe_implicit_deref (tree exp)
8748 /* If the type is a pointer, dereference it. */
8749 if (POINTER_TYPE_P (TREE_TYPE (exp))
8750 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
8751 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
8753 /* If we got a padded type, remove it too. */
8754 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
8755 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
8760 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
8761 location and false if it doesn't. In the former case, set the Gigi global
8762 variable REF_FILENAME to the simple debug file name as given by sinput. */
8765 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
8767 if (Sloc == No_Location)
8770 if (Sloc <= Standard_Location)
8772 *locus = BUILTINS_LOCATION;
8777 Source_File_Index file = Get_Source_File_Index (Sloc);
8778 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
8779 Column_Number column = Get_Column_Number (Sloc);
8780 struct line_map *map = LINEMAPS_ORDINARY_MAP_AT (line_table, file - 1);
8782 /* We can have zero if pragma Source_Reference is in effect. */
8786 /* Translate the location. */
8787 *locus = linemap_position_for_line_and_column (map, line, column);
8791 = IDENTIFIER_POINTER
8793 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
8798 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
8799 don't do anything if it doesn't correspond to a source location. */
8802 set_expr_location_from_node (tree node, Node_Id gnat_node)
8806 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
8809 SET_EXPR_LOCATION (node, locus);
8812 /* More elaborate version of set_expr_location_from_node to be used in more
8813 general contexts, for example the result of the translation of a generic
8817 set_gnu_expr_location_from_node (tree node, Node_Id gnat_node)
8819 /* Set the location information on the node if it is a real expression.
8820 References can be reused for multiple GNAT nodes and they would get
8821 the location information of their last use. Also make sure not to
8822 overwrite an existing location as it is probably more precise. */
8824 switch (TREE_CODE (node))
8827 case NON_LVALUE_EXPR:
8831 if (EXPR_P (TREE_OPERAND (node, 1)))
8832 set_gnu_expr_location_from_node (TREE_OPERAND (node, 1), gnat_node);
8834 /* ... fall through ... */
8837 if (!REFERENCE_CLASS_P (node) && !EXPR_HAS_LOCATION (node))
8839 set_expr_location_from_node (node, gnat_node);
8840 set_end_locus_from_node (node, gnat_node);
8846 /* Return a colon-separated list of encodings contained in encoded Ada
8850 extract_encoding (const char *name)
8852 char *encoding = (char *) ggc_alloc_atomic (strlen (name));
8853 get_encoding (name, encoding);
8857 /* Extract the Ada name from an encoded name. */
8860 decode_name (const char *name)
8862 char *decoded = (char *) ggc_alloc_atomic (strlen (name) * 2 + 60);
8863 __gnat_decode (name, decoded, 0);
8867 /* Post an error message. MSG is the error message, properly annotated.
8868 NODE is the node at which to post the error and the node to use for the
8869 '&' substitution. */
8872 post_error (const char *msg, Node_Id node)
8874 String_Template temp;
8877 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
8878 fp.Array = msg, fp.Bounds = &temp;
8880 Error_Msg_N (fp, node);
8883 /* Similar to post_error, but NODE is the node at which to post the error and
8884 ENT is the node to use for the '&' substitution. */
8887 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
8889 String_Template temp;
8892 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
8893 fp.Array = msg, fp.Bounds = &temp;
8895 Error_Msg_NE (fp, node, ent);
8898 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
8901 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int num)
8903 Error_Msg_Uint_1 = UI_From_Int (num);
8904 post_error_ne (msg, node, ent);
8907 /* Set the end_locus information for GNU_NODE, if any, from an explicit end
8908 location associated with GNAT_NODE or GNAT_NODE itself, whichever makes
8909 most sense. Return true if a sensible assignment was performed. */
8912 set_end_locus_from_node (tree gnu_node, Node_Id gnat_node)
8914 Node_Id gnat_end_label = Empty;
8915 location_t end_locus;
8917 /* Pick the GNAT node of which we'll take the sloc to assign to the GCC node
8918 end_locus when there is one. We consider only GNAT nodes with a possible
8919 End_Label attached. If the End_Label actually was unassigned, fallback
8920 on the orginal node. We'd better assign an explicit sloc associated with
8921 the outer construct in any case. */
8923 switch (Nkind (gnat_node))
8925 case N_Package_Body:
8926 case N_Subprogram_Body:
8927 case N_Block_Statement:
8928 gnat_end_label = End_Label (Handled_Statement_Sequence (gnat_node));
8931 case N_Package_Declaration:
8932 gnat_end_label = End_Label (Specification (gnat_node));
8939 gnat_node = Present (gnat_end_label) ? gnat_end_label : gnat_node;
8941 /* Some expanded subprograms have neither an End_Label nor a Sloc
8942 attached. Notify that to callers. */
8944 if (!Sloc_to_locus (Sloc (gnat_node), &end_locus))
8947 switch (TREE_CODE (gnu_node))
8950 BLOCK_SOURCE_END_LOCATION (BIND_EXPR_BLOCK (gnu_node)) = end_locus;
8954 DECL_STRUCT_FUNCTION (gnu_node)->function_end_locus = end_locus;
8962 /* Similar to post_error_ne, but T is a GCC tree representing the number to
8963 write. If T represents a constant, the text inside curly brackets in
8964 MSG will be output (presumably including a '^'). Otherwise it will not
8965 be output and the text inside square brackets will be output instead. */
8968 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
8970 char *new_msg = XALLOCAVEC (char, strlen (msg) + 1);
8971 char start_yes, end_yes, start_no, end_no;
8975 if (TREE_CODE (t) == INTEGER_CST)
8977 Error_Msg_Uint_1 = UI_From_gnu (t);
8978 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
8981 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
8983 for (p = msg, q = new_msg; *p; p++)
8985 if (*p == start_yes)
8986 for (p++; *p != end_yes; p++)
8988 else if (*p == start_no)
8989 for (p++; *p != end_no; p++)
8997 post_error_ne (new_msg, node, ent);
9000 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
9003 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
9006 Error_Msg_Uint_2 = UI_From_Int (num);
9007 post_error_ne_tree (msg, node, ent, t);
9010 /* Initialize the table that maps GNAT codes to GCC codes for simple
9011 binary and unary operations. */
9014 init_code_table (void)
9016 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
9017 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
9019 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
9020 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
9021 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
9022 gnu_codes[N_Op_Eq] = EQ_EXPR;
9023 gnu_codes[N_Op_Ne] = NE_EXPR;
9024 gnu_codes[N_Op_Lt] = LT_EXPR;
9025 gnu_codes[N_Op_Le] = LE_EXPR;
9026 gnu_codes[N_Op_Gt] = GT_EXPR;
9027 gnu_codes[N_Op_Ge] = GE_EXPR;
9028 gnu_codes[N_Op_Add] = PLUS_EXPR;
9029 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
9030 gnu_codes[N_Op_Multiply] = MULT_EXPR;
9031 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
9032 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
9033 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
9034 gnu_codes[N_Op_Abs] = ABS_EXPR;
9035 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
9036 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
9037 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
9038 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
9039 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
9040 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
9043 /* Return a label to branch to for the exception type in KIND or NULL_TREE
9047 get_exception_label (char kind)
9049 if (kind == N_Raise_Constraint_Error)
9050 return VEC_last (tree, gnu_constraint_error_label_stack);
9051 else if (kind == N_Raise_Storage_Error)
9052 return VEC_last (tree, gnu_storage_error_label_stack);
9053 else if (kind == N_Raise_Program_Error)
9054 return VEC_last (tree, gnu_program_error_label_stack);
9059 /* Return the decl for the current elaboration procedure. */
9062 get_elaboration_procedure (void)
9064 return VEC_last (tree, gnu_elab_proc_stack);
9067 #include "gt-ada-trans.h"