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 other address attributes applied to a nested function,
1399 find an inner ADDR_EXPR and annotate it so that we can issue
1400 a useful warning with -Wtrampolines. */
1401 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1403 gnu_expr = remove_conversions (gnu_result, false);
1405 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1406 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1408 set_expr_location_from_node (gnu_expr, gnat_node);
1410 /* Check that we're not violating the No_Implicit_Dynamic_Code
1411 restriction. Be conservative if we don't know anything
1412 about the trampoline strategy for the target. */
1413 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1418 case Attr_Pool_Address:
1421 tree gnu_ptr = gnu_prefix;
1423 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1425 /* If this is an unconstrained array, we know the object has been
1426 allocated with the template in front of the object. So compute
1427 the template address. */
1428 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1430 = convert (build_pointer_type
1431 (TYPE_OBJECT_RECORD_TYPE
1432 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1435 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1436 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1437 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1439 tree gnu_char_ptr_type
1440 = build_pointer_type (unsigned_char_type_node);
1441 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1442 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1443 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1447 gnu_result = convert (gnu_result_type, gnu_ptr);
1452 case Attr_Object_Size:
1453 case Attr_Value_Size:
1454 case Attr_Max_Size_In_Storage_Elements:
1455 gnu_expr = gnu_prefix;
1457 /* Remove NOPs and conversions between original and packable version
1458 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1459 to see if a COMPONENT_REF was involved. */
1460 while (TREE_CODE (gnu_expr) == NOP_EXPR
1461 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1462 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1463 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1465 && TYPE_NAME (TREE_TYPE (gnu_expr))
1466 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1467 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1469 gnu_prefix = remove_conversions (gnu_prefix, true);
1470 prefix_unused = true;
1471 gnu_type = TREE_TYPE (gnu_prefix);
1473 /* Replace an unconstrained array type with the type of the underlying
1474 array. We can't do this with a call to maybe_unconstrained_array
1475 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1476 use the record type that will be used to allocate the object and its
1478 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1480 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1481 if (attribute != Attr_Max_Size_In_Storage_Elements)
1482 gnu_type = TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (gnu_type)));
1485 /* If we're looking for the size of a field, return the field size.
1486 Otherwise, if the prefix is an object, or if we're looking for
1487 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1488 GCC size of the type. Otherwise, it is the RM size of the type. */
1489 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1490 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1491 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1492 || attribute == Attr_Object_Size
1493 || attribute == Attr_Max_Size_In_Storage_Elements)
1495 /* If the prefix is an object of a padded type, the GCC size isn't
1496 relevant to the programmer. Normally what we want is the RM size,
1497 which was set from the specified size, but if it was not set, we
1498 want the size of the field. Using the MAX of those two produces
1499 the right result in all cases. Don't use the size of the field
1500 if it's self-referential, since that's never what's wanted. */
1501 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1502 && TYPE_IS_PADDING_P (gnu_type)
1503 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1505 gnu_result = rm_size (gnu_type);
1506 if (!CONTAINS_PLACEHOLDER_P
1507 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1509 = size_binop (MAX_EXPR, gnu_result,
1510 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1512 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1514 Node_Id gnat_deref = Prefix (gnat_node);
1515 Node_Id gnat_actual_subtype
1516 = Actual_Designated_Subtype (gnat_deref);
1518 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1520 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1521 && Present (gnat_actual_subtype))
1523 tree gnu_actual_obj_type
1524 = gnat_to_gnu_type (gnat_actual_subtype);
1526 = build_unc_object_type_from_ptr (gnu_ptr_type,
1527 gnu_actual_obj_type,
1528 get_identifier ("SIZE"),
1532 gnu_result = TYPE_SIZE (gnu_type);
1535 gnu_result = TYPE_SIZE (gnu_type);
1538 gnu_result = rm_size (gnu_type);
1540 /* Deal with a self-referential size by returning the maximum size for
1541 a type and by qualifying the size with the object otherwise. */
1542 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1544 if (TREE_CODE (gnu_prefix) == TYPE_DECL)
1545 gnu_result = max_size (gnu_result, true);
1547 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1550 /* If the type contains a template, subtract its size. */
1551 if (TREE_CODE (gnu_type) == RECORD_TYPE
1552 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1553 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1554 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1556 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1557 if (attribute == Attr_Max_Size_In_Storage_Elements)
1558 gnu_result = size_binop (CEIL_DIV_EXPR, gnu_result, bitsize_unit_node);
1560 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1563 case Attr_Alignment:
1567 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1568 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1569 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1571 gnu_type = TREE_TYPE (gnu_prefix);
1572 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1573 prefix_unused = true;
1575 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1576 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1579 Node_Id gnat_prefix = Prefix (gnat_node);
1580 Entity_Id gnat_type = Etype (gnat_prefix);
1581 unsigned int double_align;
1582 bool is_capped_double, align_clause;
1584 /* If the default alignment of "double" or larger scalar types is
1585 specifically capped and there is an alignment clause neither
1586 on the type nor on the prefix itself, return the cap. */
1587 if ((double_align = double_float_alignment) > 0)
1589 = is_double_float_or_array (gnat_type, &align_clause);
1590 else if ((double_align = double_scalar_alignment) > 0)
1592 = is_double_scalar_or_array (gnat_type, &align_clause);
1594 is_capped_double = align_clause = false;
1596 if (is_capped_double
1597 && Nkind (gnat_prefix) == N_Identifier
1598 && Present (Alignment_Clause (Entity (gnat_prefix))))
1599 align_clause = true;
1601 if (is_capped_double && !align_clause)
1602 align = double_align;
1604 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1607 gnu_result = size_int (align);
1613 case Attr_Range_Length:
1614 prefix_unused = true;
1616 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1618 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1620 if (attribute == Attr_First)
1621 gnu_result = TYPE_MIN_VALUE (gnu_type);
1622 else if (attribute == Attr_Last)
1623 gnu_result = TYPE_MAX_VALUE (gnu_type);
1627 (MAX_EXPR, get_base_type (gnu_result_type),
1629 (PLUS_EXPR, get_base_type (gnu_result_type),
1630 build_binary_op (MINUS_EXPR,
1631 get_base_type (gnu_result_type),
1632 convert (gnu_result_type,
1633 TYPE_MAX_VALUE (gnu_type)),
1634 convert (gnu_result_type,
1635 TYPE_MIN_VALUE (gnu_type))),
1636 convert (gnu_result_type, integer_one_node)),
1637 convert (gnu_result_type, integer_zero_node));
1642 /* ... fall through ... */
1646 int Dimension = (Present (Expressions (gnat_node))
1647 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1649 struct parm_attr_d *pa = NULL;
1650 Entity_Id gnat_param = Empty;
1652 /* Make sure any implicit dereference gets done. */
1653 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1654 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1656 /* We treat unconstrained array In parameters specially. */
1657 if (!Is_Constrained (Etype (Prefix (gnat_node))))
1659 Node_Id gnat_prefix = Prefix (gnat_node);
1661 /* This is the direct case. */
1662 if (Nkind (gnat_prefix) == N_Identifier
1663 && Ekind (Entity (gnat_prefix)) == E_In_Parameter)
1664 gnat_param = Entity (gnat_prefix);
1666 /* This is the indirect case. Note that we need to be sure that
1667 the access value cannot be null as we'll hoist the load. */
1668 if (Nkind (gnat_prefix) == N_Explicit_Dereference
1669 && Nkind (Prefix (gnat_prefix)) == N_Identifier
1670 && Ekind (Entity (Prefix (gnat_prefix))) == E_In_Parameter
1671 && Can_Never_Be_Null (Entity (Prefix (gnat_prefix))))
1672 gnat_param = Entity (Prefix (gnat_prefix));
1675 gnu_type = TREE_TYPE (gnu_prefix);
1676 prefix_unused = true;
1677 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1679 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1684 for (ndim = 1, gnu_type_temp = gnu_type;
1685 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1686 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1687 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1690 Dimension = ndim + 1 - Dimension;
1693 for (i = 1; i < Dimension; i++)
1694 gnu_type = TREE_TYPE (gnu_type);
1696 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1698 /* When not optimizing, look up the slot associated with the parameter
1699 and the dimension in the cache and create a new one on failure. */
1700 if (!optimize && Present (gnat_param))
1702 FOR_EACH_VEC_ELT (parm_attr, f_parm_attr_cache, i, pa)
1703 if (pa->id == gnat_param && pa->dim == Dimension)
1708 pa = ggc_alloc_cleared_parm_attr_d ();
1709 pa->id = gnat_param;
1710 pa->dim = Dimension;
1711 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1715 /* Return the cached expression or build a new one. */
1716 if (attribute == Attr_First)
1718 if (pa && pa->first)
1720 gnu_result = pa->first;
1725 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1728 else if (attribute == Attr_Last)
1732 gnu_result = pa->last;
1737 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1740 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1742 if (pa && pa->length)
1744 gnu_result = pa->length;
1749 /* We used to compute the length as max (hb - lb + 1, 0),
1750 which could overflow for some cases of empty arrays, e.g.
1751 when lb == index_type'first. We now compute the length as
1752 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1753 much rarer cases, for extremely large arrays we expect
1754 never to encounter in practice. In addition, the former
1755 computation required the use of potentially constraining
1756 signed arithmetic while the latter doesn't. Note that
1757 the comparison must be done in the original index type,
1758 to avoid any overflow during the conversion. */
1759 tree comp_type = get_base_type (gnu_result_type);
1760 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1761 tree lb = TYPE_MIN_VALUE (index_type);
1762 tree hb = TYPE_MAX_VALUE (index_type);
1764 = build_binary_op (PLUS_EXPR, comp_type,
1765 build_binary_op (MINUS_EXPR,
1767 convert (comp_type, hb),
1768 convert (comp_type, lb)),
1769 convert (comp_type, integer_one_node));
1771 = build_cond_expr (comp_type,
1772 build_binary_op (GE_EXPR,
1776 convert (comp_type, integer_zero_node));
1780 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1781 handling. Note that these attributes could not have been used on
1782 an unconstrained array type. */
1783 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1785 /* Cache the expression we have just computed. Since we want to do it
1786 at run time, we force the use of a SAVE_EXPR and let the gimplifier
1787 create the temporary in the outermost binding level. We will make
1788 sure in Subprogram_Body_to_gnu that it is evaluated on all possible
1789 paths by forcing its evaluation on entry of the function. */
1793 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1794 if (attribute == Attr_First)
1795 pa->first = gnu_result;
1796 else if (attribute == Attr_Last)
1797 pa->last = gnu_result;
1799 pa->length = gnu_result;
1802 /* Set the source location onto the predicate of the condition in the
1803 'Length case but do not do it if the expression is cached to avoid
1804 messing up the debug info. */
1805 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1806 && TREE_CODE (gnu_result) == COND_EXPR
1807 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1808 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1814 case Attr_Bit_Position:
1816 case Attr_First_Bit:
1820 HOST_WIDE_INT bitsize;
1821 HOST_WIDE_INT bitpos;
1823 tree gnu_field_bitpos;
1824 tree gnu_field_offset;
1826 enum machine_mode mode;
1827 int unsignedp, volatilep;
1829 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1830 gnu_prefix = remove_conversions (gnu_prefix, true);
1831 prefix_unused = true;
1833 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1834 the result is 0. Don't allow 'Bit on a bare component, though. */
1835 if (attribute == Attr_Bit
1836 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1837 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1839 gnu_result = integer_zero_node;
1844 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1845 || (attribute == Attr_Bit_Position
1846 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1848 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1849 &mode, &unsignedp, &volatilep, false);
1851 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1853 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1854 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1856 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1857 TREE_CODE (gnu_inner) == COMPONENT_REF
1858 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1859 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1862 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1863 bit_position (TREE_OPERAND (gnu_inner, 1)));
1865 = size_binop (PLUS_EXPR, gnu_field_offset,
1866 byte_position (TREE_OPERAND (gnu_inner, 1)));
1869 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1871 gnu_field_bitpos = bit_position (gnu_prefix);
1872 gnu_field_offset = byte_position (gnu_prefix);
1876 gnu_field_bitpos = bitsize_zero_node;
1877 gnu_field_offset = size_zero_node;
1883 gnu_result = gnu_field_offset;
1886 case Attr_First_Bit:
1888 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1892 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1893 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1894 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1895 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1899 case Attr_Bit_Position:
1900 gnu_result = gnu_field_bitpos;
1904 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1906 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1913 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1914 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1916 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1917 gnu_result = build_binary_op (attribute == Attr_Min
1918 ? MIN_EXPR : MAX_EXPR,
1919 gnu_result_type, gnu_lhs, gnu_rhs);
1923 case Attr_Passed_By_Reference:
1924 gnu_result = size_int (default_pass_by_ref (gnu_type)
1925 || must_pass_by_ref (gnu_type));
1926 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1929 case Attr_Component_Size:
1930 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1931 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1932 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1934 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1935 gnu_type = TREE_TYPE (gnu_prefix);
1937 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1938 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1940 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1941 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1942 gnu_type = TREE_TYPE (gnu_type);
1944 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1946 /* Note this size cannot be self-referential. */
1947 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1948 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1949 prefix_unused = true;
1952 case Attr_Descriptor_Size:
1953 gnu_type = TREE_TYPE (gnu_prefix);
1954 gcc_assert (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE);
1956 /* What we want is the offset of the ARRAY field in the record that the
1957 thin pointer designates, but the components have been shifted so this
1958 is actually the opposite of the offset of the BOUNDS field. */
1959 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1960 gnu_result = size_binop (MINUS_EXPR, bitsize_zero_node,
1961 bit_position (TYPE_FIELDS (gnu_type)));
1962 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1963 prefix_unused = true;
1966 case Attr_Null_Parameter:
1967 /* This is just a zero cast to the pointer type for our prefix and
1969 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1971 = build_unary_op (INDIRECT_REF, NULL_TREE,
1972 convert (build_pointer_type (gnu_result_type),
1973 integer_zero_node));
1974 TREE_PRIVATE (gnu_result) = 1;
1977 case Attr_Mechanism_Code:
1980 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1982 prefix_unused = true;
1983 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1984 if (Present (Expressions (gnat_node)))
1986 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1988 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1989 i--, gnat_obj = Next_Formal (gnat_obj))
1993 code = Mechanism (gnat_obj);
1994 if (code == Default)
1995 code = ((present_gnu_tree (gnat_obj)
1996 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1997 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1999 && (DECL_BY_COMPONENT_PTR_P
2000 (get_gnu_tree (gnat_obj))))))
2001 ? By_Reference : By_Copy);
2002 gnu_result = convert (gnu_result_type, size_int (- code));
2007 /* Say we have an unimplemented attribute. Then set the value to be
2008 returned to be a zero and hope that's something we can convert to
2009 the type of this attribute. */
2010 post_error ("unimplemented attribute", gnat_node);
2011 gnu_result_type = get_unpadded_type (Etype (gnat_node));
2012 gnu_result = integer_zero_node;
2016 /* If this is an attribute where the prefix was unused, force a use of it if
2017 it has a side-effect. But don't do it if the prefix is just an entity
2018 name. However, if an access check is needed, we must do it. See second
2019 example in AARM 11.6(5.e). */
2020 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
2021 && !Is_Entity_Name (Prefix (gnat_node)))
2022 gnu_result = build_compound_expr (TREE_TYPE (gnu_result), gnu_prefix,
2025 *gnu_result_type_p = gnu_result_type;
2029 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
2030 to a GCC tree, which is returned. */
2033 Case_Statement_to_gnu (Node_Id gnat_node)
2035 tree gnu_result, gnu_expr, gnu_label;
2037 location_t end_locus;
2038 bool may_fallthru = false;
2040 gnu_expr = gnat_to_gnu (Expression (gnat_node));
2041 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
2043 /* The range of values in a case statement is determined by the rules in
2044 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
2045 of the expression. One exception arises in the case of a simple name that
2046 is parenthesized. This still has the Etype of the name, but since it is
2047 not a name, para 7 does not apply, and we need to go to the base type.
2048 This is the only case where parenthesization affects the dynamic
2049 semantics (i.e. the range of possible values at run time that is covered
2050 by the others alternative).
2052 Another exception is if the subtype of the expression is non-static. In
2053 that case, we also have to use the base type. */
2054 if (Paren_Count (Expression (gnat_node)) != 0
2055 || !Is_OK_Static_Subtype (Underlying_Type
2056 (Etype (Expression (gnat_node)))))
2057 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
2059 /* We build a SWITCH_EXPR that contains the code with interspersed
2060 CASE_LABEL_EXPRs for each label. */
2061 if (!Sloc_to_locus (Sloc (gnat_node) + UI_To_Int (End_Span (gnat_node)),
2063 end_locus = input_location;
2064 gnu_label = create_artificial_label (end_locus);
2065 start_stmt_group ();
2067 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
2068 Present (gnat_when);
2069 gnat_when = Next_Non_Pragma (gnat_when))
2071 bool choices_added_p = false;
2072 Node_Id gnat_choice;
2074 /* First compile all the different case choices for the current WHEN
2076 for (gnat_choice = First (Discrete_Choices (gnat_when));
2077 Present (gnat_choice); gnat_choice = Next (gnat_choice))
2079 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
2081 switch (Nkind (gnat_choice))
2084 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
2085 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
2088 case N_Subtype_Indication:
2089 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
2090 (Constraint (gnat_choice))));
2091 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
2092 (Constraint (gnat_choice))));
2096 case N_Expanded_Name:
2097 /* This represents either a subtype range or a static value of
2098 some kind; Ekind says which. */
2099 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
2101 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
2103 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
2104 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
2108 /* ... fall through ... */
2110 case N_Character_Literal:
2111 case N_Integer_Literal:
2112 gnu_low = gnat_to_gnu (gnat_choice);
2115 case N_Others_Choice:
2122 /* If the case value is a subtype that raises Constraint_Error at
2123 run time because of a wrong bound, then gnu_low or gnu_high is
2124 not translated into an INTEGER_CST. In such a case, we need
2125 to ensure that the when statement is not added in the tree,
2126 otherwise it will crash the gimplifier. */
2127 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
2128 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
2130 add_stmt_with_node (build_case_label
2132 create_artificial_label (input_location)),
2134 choices_added_p = true;
2138 /* Push a binding level here in case variables are declared as we want
2139 them to be local to this set of statements instead of to the block
2140 containing the Case statement. */
2141 if (choices_added_p)
2143 tree group = build_stmt_group (Statements (gnat_when), true);
2144 bool group_may_fallthru = block_may_fallthru (group);
2146 if (group_may_fallthru)
2148 tree stmt = build1 (GOTO_EXPR, void_type_node, gnu_label);
2149 SET_EXPR_LOCATION (stmt, end_locus);
2151 may_fallthru = true;
2156 /* Now emit a definition of the label the cases branch to, if any. */
2158 add_stmt (build1 (LABEL_EXPR, void_type_node, gnu_label));
2159 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
2160 end_stmt_group (), NULL_TREE);
2165 /* Find out whether VAR is an iteration variable of an enclosing loop in the
2166 current function. If so, push a range_check_info structure onto the stack
2167 of this enclosing loop and return it. Otherwise, return NULL. */
2169 static struct range_check_info_d *
2170 push_range_check_info (tree var)
2172 struct loop_info_d *iter = NULL;
2175 if (VEC_empty (loop_info, gnu_loop_stack))
2178 var = remove_conversions (var, false);
2180 if (TREE_CODE (var) != VAR_DECL)
2183 if (decl_function_context (var) != current_function_decl)
2186 for (i = VEC_length (loop_info, gnu_loop_stack) - 1;
2187 VEC_iterate (loop_info, gnu_loop_stack, i, iter);
2189 if (var == iter->loop_var)
2194 struct range_check_info_d *rci = ggc_alloc_range_check_info_d ();
2195 VEC_safe_push (range_check_info, gc, iter->checks, rci);
2202 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2203 false, or the maximum value if MAX is true, of TYPE. */
2206 can_equal_min_or_max_val_p (tree val, tree type, bool max)
2208 tree min_or_max_val = (max ? TYPE_MAX_VALUE (type) : TYPE_MIN_VALUE (type));
2210 if (TREE_CODE (min_or_max_val) != INTEGER_CST)
2213 if (TREE_CODE (val) == NOP_EXPR)
2215 ? TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val, 0)))
2216 : TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val, 0))));
2218 if (TREE_CODE (val) != INTEGER_CST)
2221 return tree_int_cst_equal (val, min_or_max_val) == 1;
2224 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2225 If REVERSE is true, minimum value is taken as maximum value. */
2228 can_equal_min_val_p (tree val, tree type, bool reverse)
2230 return can_equal_min_or_max_val_p (val, type, reverse);
2233 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2234 If REVERSE is true, maximum value is taken as minimum value. */
2237 can_equal_max_val_p (tree val, tree type, bool reverse)
2239 return can_equal_min_or_max_val_p (val, type, !reverse);
2242 /* Return true if VAL1 can be lower than VAL2. */
2245 can_be_lower_p (tree val1, tree val2)
2247 if (TREE_CODE (val1) == NOP_EXPR)
2248 val1 = TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val1, 0)));
2250 if (TREE_CODE (val1) != INTEGER_CST)
2253 if (TREE_CODE (val2) == NOP_EXPR)
2254 val2 = TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val2, 0)));
2256 if (TREE_CODE (val2) != INTEGER_CST)
2259 return tree_int_cst_lt (val1, val2);
2262 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2263 to a GCC tree, which is returned. */
2266 Loop_Statement_to_gnu (Node_Id gnat_node)
2268 const Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
2269 struct loop_info_d *gnu_loop_info = ggc_alloc_cleared_loop_info_d ();
2270 tree gnu_loop_stmt = build4 (LOOP_STMT, void_type_node, NULL_TREE,
2271 NULL_TREE, NULL_TREE, NULL_TREE);
2272 tree gnu_loop_label = create_artificial_label (input_location);
2273 tree gnu_cond_expr = NULL_TREE, gnu_low = NULL_TREE, gnu_high = NULL_TREE;
2276 /* Push the loop_info structure associated with the LOOP_STMT. */
2277 VEC_safe_push (loop_info, gc, gnu_loop_stack, gnu_loop_info);
2279 /* Set location information for statement and end label. */
2280 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
2281 Sloc_to_locus (Sloc (End_Label (gnat_node)),
2282 &DECL_SOURCE_LOCATION (gnu_loop_label));
2283 LOOP_STMT_LABEL (gnu_loop_stmt) = gnu_loop_label;
2285 /* Save the label so that a corresponding N_Exit_Statement can find it. */
2286 gnu_loop_info->label = gnu_loop_label;
2288 /* Set the condition under which the loop must keep going.
2289 For the case "LOOP .... END LOOP;" the condition is always true. */
2290 if (No (gnat_iter_scheme))
2293 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2294 else if (Present (Condition (gnat_iter_scheme)))
2295 LOOP_STMT_COND (gnu_loop_stmt)
2296 = gnat_to_gnu (Condition (gnat_iter_scheme));
2298 /* Otherwise we have an iteration scheme and the condition is given by the
2299 bounds of the subtype of the iteration variable. */
2302 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2303 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2304 Entity_Id gnat_type = Etype (gnat_loop_var);
2305 tree gnu_type = get_unpadded_type (gnat_type);
2306 tree gnu_base_type = get_base_type (gnu_type);
2307 tree gnu_one_node = convert (gnu_base_type, integer_one_node);
2308 tree gnu_loop_var, gnu_loop_iv, gnu_first, gnu_last, gnu_stmt;
2309 enum tree_code update_code, test_code, shift_code;
2310 bool reverse = Reverse_Present (gnat_loop_spec), use_iv = false;
2312 gnu_low = TYPE_MIN_VALUE (gnu_type);
2313 gnu_high = TYPE_MAX_VALUE (gnu_type);
2315 /* We must disable modulo reduction for the iteration variable, if any,
2316 in order for the loop comparison to be effective. */
2319 gnu_first = gnu_high;
2321 update_code = MINUS_NOMOD_EXPR;
2322 test_code = GE_EXPR;
2323 shift_code = PLUS_NOMOD_EXPR;
2327 gnu_first = gnu_low;
2328 gnu_last = gnu_high;
2329 update_code = PLUS_NOMOD_EXPR;
2330 test_code = LE_EXPR;
2331 shift_code = MINUS_NOMOD_EXPR;
2334 /* We use two different strategies to translate the loop, depending on
2335 whether optimization is enabled.
2337 If it is, we generate the canonical loop form expected by the loop
2338 optimizer and the loop vectorizer, which is the do-while form:
2347 This avoids an implicit dependency on loop header copying and makes
2348 it possible to turn BOTTOM_COND into an inequality test.
2350 If optimization is disabled, loop header copying doesn't come into
2351 play and we try to generate the loop form with the fewer conditional
2352 branches. First, the default form, which is:
2360 It should catch most loops with constant ending point. Then, if we
2361 cannot, we try to generate the shifted form:
2369 which should catch loops with constant starting point. Otherwise, if
2370 we cannot, we generate the fallback form:
2379 which works in all cases. */
2383 /* We can use the do-while form directly if GNU_FIRST-1 doesn't
2385 if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse))
2388 /* Otherwise, use the do-while form with the help of a special
2389 induction variable in the unsigned version of the base type
2390 or the unsigned version of sizetype, whichever is the
2391 largest, in order to have wrap-around arithmetics for it. */
2394 if (TYPE_PRECISION (gnu_base_type) > TYPE_PRECISION (sizetype))
2395 gnu_base_type = gnat_unsigned_type (gnu_base_type);
2397 gnu_base_type = sizetype;
2399 gnu_first = convert (gnu_base_type, gnu_first);
2400 gnu_last = convert (gnu_base_type, gnu_last);
2401 gnu_one_node = convert (gnu_base_type, integer_one_node);
2406 = build_binary_op (shift_code, gnu_base_type, gnu_first,
2408 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2409 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2413 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
2414 if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2417 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
2419 else if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse)
2420 && !can_equal_min_val_p (gnu_last, gnu_base_type, reverse))
2423 = build_binary_op (shift_code, gnu_base_type, gnu_first,
2426 = build_binary_op (shift_code, gnu_base_type, gnu_last,
2428 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2431 /* Otherwise, use the fallback form. */
2433 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2436 /* If we use the BOTTOM_COND, we can turn the test into an inequality
2437 test but we may have to add ENTRY_COND to protect the empty loop. */
2438 if (LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt))
2440 test_code = NE_EXPR;
2441 if (can_be_lower_p (gnu_high, gnu_low))
2444 = build3 (COND_EXPR, void_type_node,
2445 build_binary_op (LE_EXPR, boolean_type_node,
2447 NULL_TREE, alloc_stmt_list ());
2448 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2452 /* Open a new nesting level that will surround the loop to declare the
2453 iteration variable. */
2454 start_stmt_group ();
2457 /* If we use the special induction variable, create it and set it to
2458 its initial value. Morever, the regular iteration variable cannot
2459 itself be initialized, lest the initial value wrapped around. */
2463 = create_init_temporary ("I", gnu_first, &gnu_stmt, gnat_loop_var);
2464 add_stmt (gnu_stmt);
2465 gnu_first = NULL_TREE;
2468 gnu_loop_iv = NULL_TREE;
2470 /* Declare the iteration variable and set it to its initial value. */
2471 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2472 if (DECL_BY_REF_P (gnu_loop_var))
2473 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2476 gcc_assert (DECL_LOOP_PARM_P (gnu_loop_var));
2477 SET_DECL_INDUCTION_VAR (gnu_loop_var, gnu_loop_iv);
2479 gnu_loop_info->loop_var = gnu_loop_var;
2481 /* Do all the arithmetics in the base type. */
2482 gnu_loop_var = convert (gnu_base_type, gnu_loop_var);
2484 /* Set either the top or bottom exit condition. */
2486 LOOP_STMT_COND (gnu_loop_stmt)
2487 = build_binary_op (test_code, boolean_type_node, gnu_loop_iv,
2490 LOOP_STMT_COND (gnu_loop_stmt)
2491 = build_binary_op (test_code, boolean_type_node, gnu_loop_var,
2494 /* Set either the top or bottom update statement and give it the source
2495 location of the iteration for better coverage info. */
2499 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_iv,
2500 build_binary_op (update_code, gnu_base_type,
2501 gnu_loop_iv, gnu_one_node));
2502 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2503 append_to_statement_list (gnu_stmt,
2504 &LOOP_STMT_UPDATE (gnu_loop_stmt));
2506 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2508 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2509 append_to_statement_list (gnu_stmt,
2510 &LOOP_STMT_UPDATE (gnu_loop_stmt));
2515 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2516 build_binary_op (update_code, gnu_base_type,
2517 gnu_loop_var, gnu_one_node));
2518 set_expr_location_from_node (gnu_stmt, gnat_iter_scheme);
2519 LOOP_STMT_UPDATE (gnu_loop_stmt) = gnu_stmt;
2523 /* If the loop was named, have the name point to this loop. In this case,
2524 the association is not a DECL node, but the end label of the loop. */
2525 if (Present (Identifier (gnat_node)))
2526 save_gnu_tree (Entity (Identifier (gnat_node)), gnu_loop_label, true);
2528 /* Make the loop body into its own block, so any allocated storage will be
2529 released every iteration. This is needed for stack allocation. */
2530 LOOP_STMT_BODY (gnu_loop_stmt)
2531 = build_stmt_group (Statements (gnat_node), true);
2532 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
2534 /* If we have an iteration scheme, then we are in a statement group. Add
2535 the LOOP_STMT to it, finish it and make it the "loop". */
2536 if (Present (gnat_iter_scheme) && No (Condition (gnat_iter_scheme)))
2538 struct range_check_info_d *rci;
2539 unsigned n_checks = VEC_length (range_check_info, gnu_loop_info->checks);
2542 /* First, if we have computed a small number of invariant conditions for
2543 range checks applied to the iteration variable, then initialize these
2544 conditions in front of the loop. Otherwise, leave them set to True.
2546 ??? The heuristics need to be improved, by taking into account the
2547 following datapoints:
2548 - loop unswitching is disabled for big loops. The cap is the
2549 parameter PARAM_MAX_UNSWITCH_INSNS (50).
2550 - loop unswitching can only be applied a small number of times
2551 to a given loop. The cap is PARAM_MAX_UNSWITCH_LEVEL (3).
2552 - the front-end quickly generates useless or redundant checks
2553 that can be entirely optimized away in the end. */
2554 if (1 <= n_checks && n_checks <= 4)
2556 VEC_iterate (range_check_info, gnu_loop_info->checks, i, rci);
2560 = build_binary_op (GE_EXPR, boolean_type_node,
2561 convert (rci->type, gnu_low),
2564 = build_binary_op (LE_EXPR, boolean_type_node,
2565 convert (rci->type, gnu_high),
2568 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
2571 TREE_OPERAND (rci->invariant_cond, 0)
2572 = build_unary_op (TRUTH_NOT_EXPR, boolean_type_node, range_ok);
2574 add_stmt_with_node_force (rci->invariant_cond, gnat_node);
2577 add_stmt (gnu_loop_stmt);
2579 gnu_loop_stmt = end_stmt_group ();
2582 /* If we have an outer COND_EXPR, that's our result and this loop is its
2583 "true" statement. Otherwise, the result is the LOOP_STMT. */
2586 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2587 gnu_result = gnu_cond_expr;
2588 recalculate_side_effects (gnu_cond_expr);
2591 gnu_result = gnu_loop_stmt;
2593 VEC_pop (loop_info, gnu_loop_stack);
2598 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2599 handler for the current function. */
2601 /* This is implemented by issuing a call to the appropriate VMS specific
2602 builtin. To avoid having VMS specific sections in the global gigi decls
2603 array, we maintain the decls of interest here. We can't declare them
2604 inside the function because we must mark them never to be GC'd, which we
2605 can only do at the global level. */
2607 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2608 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2611 establish_gnat_vms_condition_handler (void)
2613 tree establish_stmt;
2615 /* Elaborate the required decls on the first call. Check on the decl for
2616 the gnat condition handler to decide, as this is one we create so we are
2617 sure that it will be non null on subsequent calls. The builtin decl is
2618 looked up so remains null on targets where it is not implemented yet. */
2619 if (gnat_vms_condition_handler_decl == NULL_TREE)
2621 vms_builtin_establish_handler_decl
2623 (get_identifier ("__builtin_establish_vms_condition_handler"));
2625 gnat_vms_condition_handler_decl
2626 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2628 build_function_type_list (boolean_type_node,
2632 NULL_TREE, false, true, true, true, NULL,
2635 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2636 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2639 /* Do nothing if the establish builtin is not available, which might happen
2640 on targets where the facility is not implemented. */
2641 if (vms_builtin_establish_handler_decl == NULL_TREE)
2645 = build_call_n_expr (vms_builtin_establish_handler_decl, 1,
2647 (ADDR_EXPR, NULL_TREE,
2648 gnat_vms_condition_handler_decl));
2650 add_stmt (establish_stmt);
2653 /* This page implements a form of Named Return Value optimization modelled
2654 on the C++ optimization of the same name. The main difference is that
2655 we disregard any semantical considerations when applying it here, the
2656 counterpart being that we don't try to apply it to semantically loaded
2657 return types, i.e. types with the TREE_ADDRESSABLE flag set.
2659 We consider a function body of the following GENERIC form:
2663 RETURN_EXPR [<retval> = ...]
2665 RETURN_EXPR [<retval> = R1]
2669 RETURN_EXPR [<retval> = ...]
2671 RETURN_EXPR [<retval> = Ri]
2674 and we try to fulfill a simple criterion that would make it possible to
2675 replace one or several Ri variables with the RESULT_DECL of the function.
2677 The first observation is that RETURN_EXPRs that don't directly reference
2678 any of the Ri variables on the RHS of their assignment are transparent wrt
2679 the optimization. This is because the Ri variables aren't addressable so
2680 any transformation applied to them doesn't affect the RHS; moreover, the
2681 assignment writes the full <retval> object so existing values are entirely
2684 This property can be extended to some forms of RETURN_EXPRs that reference
2685 the Ri variables, for example CONSTRUCTORs, but isn't true in the general
2686 case, in particular when function calls are involved.
2688 Therefore the algorithm is as follows:
2690 1. Collect the list of candidates for a Named Return Value (Ri variables
2691 on the RHS of assignments of RETURN_EXPRs) as well as the list of the
2692 other expressions on the RHS of such assignments.
2694 2. Prune the members of the first list (candidates) that are referenced
2695 by a member of the second list (expressions).
2697 3. Extract a set of candidates with non-overlapping live ranges from the
2698 first list. These are the Named Return Values.
2700 4. Adjust the relevant RETURN_EXPRs and replace the occurrences of the
2701 Named Return Values in the function with the RESULT_DECL.
2703 If the function returns an unconstrained type, things are a bit different
2704 because the anonymous return object is allocated on the secondary stack
2705 and RESULT_DECL is only a pointer to it. Each return object can be of a
2706 different size and is allocated separately so we need not care about the
2707 aforementioned overlapping issues. Therefore, we don't collect the other
2708 expressions and skip step #2 in the algorithm. */
2715 struct pointer_set_t *visited;
2718 /* Return true if T is a Named Return Value. */
2721 is_nrv_p (bitmap nrv, tree t)
2723 return TREE_CODE (t) == VAR_DECL && bitmap_bit_p (nrv, DECL_UID (t));
2726 /* Helper function for walk_tree, used by finalize_nrv below. */
2729 prune_nrv_r (tree *tp, int *walk_subtrees, void *data)
2731 struct nrv_data *dp = (struct nrv_data *)data;
2734 /* No need to walk into types or decls. */
2735 if (IS_TYPE_OR_DECL_P (t))
2738 if (is_nrv_p (dp->nrv, t))
2739 bitmap_clear_bit (dp->nrv, DECL_UID (t));
2744 /* Prune Named Return Values in BLOCK and return true if there is still a
2745 Named Return Value in BLOCK or one of its sub-blocks. */
2748 prune_nrv_in_block (bitmap nrv, tree block)
2750 bool has_nrv = false;
2753 /* First recurse on the sub-blocks. */
2754 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
2755 has_nrv |= prune_nrv_in_block (nrv, t);
2757 /* Then make sure to keep at most one NRV per block. */
2758 for (t = BLOCK_VARS (block); t; t = DECL_CHAIN (t))
2759 if (is_nrv_p (nrv, t))
2762 bitmap_clear_bit (nrv, DECL_UID (t));
2770 /* Helper function for walk_tree, used by finalize_nrv below. */
2773 finalize_nrv_r (tree *tp, int *walk_subtrees, void *data)
2775 struct nrv_data *dp = (struct nrv_data *)data;
2778 /* No need to walk into types. */
2782 /* Change RETURN_EXPRs of NRVs to just refer to the RESULT_DECL; this is a
2783 nop, but differs from using NULL_TREE in that it indicates that we care
2784 about the value of the RESULT_DECL. */
2785 else if (TREE_CODE (t) == RETURN_EXPR
2786 && TREE_CODE (TREE_OPERAND (t, 0)) == MODIFY_EXPR)
2788 tree ret_val = TREE_OPERAND (TREE_OPERAND (t, 0), 1), init_expr;
2790 /* If this is the temporary created for a return value with variable
2791 size in call_to_gnu, we replace the RHS with the init expression. */
2792 if (TREE_CODE (ret_val) == COMPOUND_EXPR
2793 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR
2794 && TREE_OPERAND (TREE_OPERAND (ret_val, 0), 0)
2795 == TREE_OPERAND (ret_val, 1))
2797 init_expr = TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1);
2798 ret_val = TREE_OPERAND (ret_val, 1);
2801 init_expr = NULL_TREE;
2803 /* Strip useless conversions around the return value. */
2804 if (gnat_useless_type_conversion (ret_val))
2805 ret_val = TREE_OPERAND (ret_val, 0);
2807 if (is_nrv_p (dp->nrv, ret_val))
2810 TREE_OPERAND (TREE_OPERAND (t, 0), 1) = init_expr;
2812 TREE_OPERAND (t, 0) = dp->result;
2816 /* Replace the DECL_EXPR of NRVs with an initialization of the RESULT_DECL,
2818 else if (TREE_CODE (t) == DECL_EXPR
2819 && is_nrv_p (dp->nrv, DECL_EXPR_DECL (t)))
2821 tree var = DECL_EXPR_DECL (t), init;
2823 if (DECL_INITIAL (var))
2825 init = build_binary_op (INIT_EXPR, NULL_TREE, dp->result,
2826 DECL_INITIAL (var));
2827 SET_EXPR_LOCATION (init, EXPR_LOCATION (t));
2828 DECL_INITIAL (var) = NULL_TREE;
2831 init = build_empty_stmt (EXPR_LOCATION (t));
2834 /* Identify the NRV to the RESULT_DECL for debugging purposes. */
2835 SET_DECL_VALUE_EXPR (var, dp->result);
2836 DECL_HAS_VALUE_EXPR_P (var) = 1;
2837 /* ??? Kludge to avoid an assertion failure during inlining. */
2838 DECL_SIZE (var) = bitsize_unit_node;
2839 DECL_SIZE_UNIT (var) = size_one_node;
2842 /* And replace all uses of NRVs with the RESULT_DECL. */
2843 else if (is_nrv_p (dp->nrv, t))
2844 *tp = convert (TREE_TYPE (t), dp->result);
2846 /* Avoid walking into the same tree more than once. Unfortunately, we
2847 can't just use walk_tree_without_duplicates because it would only
2848 call us for the first occurrence of NRVs in the function body. */
2849 if (pointer_set_insert (dp->visited, *tp))
2855 /* Likewise, but used when the function returns an unconstrained type. */
2858 finalize_nrv_unc_r (tree *tp, int *walk_subtrees, void *data)
2860 struct nrv_data *dp = (struct nrv_data *)data;
2863 /* No need to walk into types. */
2867 /* We need to see the DECL_EXPR of NRVs before any other references so we
2868 walk the body of BIND_EXPR before walking its variables. */
2869 else if (TREE_CODE (t) == BIND_EXPR)
2870 walk_tree (&BIND_EXPR_BODY (t), finalize_nrv_unc_r, data, NULL);
2872 /* Change RETURN_EXPRs of NRVs to assign to the RESULT_DECL only the final
2873 return value built by the allocator instead of the whole construct. */
2874 else if (TREE_CODE (t) == RETURN_EXPR
2875 && TREE_CODE (TREE_OPERAND (t, 0)) == MODIFY_EXPR)
2877 tree ret_val = TREE_OPERAND (TREE_OPERAND (t, 0), 1);
2879 /* This is the construct returned by the allocator. */
2880 if (TREE_CODE (ret_val) == COMPOUND_EXPR
2881 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR)
2883 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (ret_val)))
2885 = VEC_index (constructor_elt,
2887 (TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1)),
2890 ret_val = TREE_OPERAND (TREE_OPERAND (ret_val, 0), 1);
2893 /* Strip useless conversions around the return value. */
2894 if (gnat_useless_type_conversion (ret_val)
2895 || TREE_CODE (ret_val) == VIEW_CONVERT_EXPR)
2896 ret_val = TREE_OPERAND (ret_val, 0);
2898 /* Strip unpadding around the return value. */
2899 if (TREE_CODE (ret_val) == COMPONENT_REF
2900 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (ret_val, 0))))
2901 ret_val = TREE_OPERAND (ret_val, 0);
2903 /* Assign the new return value to the RESULT_DECL. */
2904 if (is_nrv_p (dp->nrv, ret_val))
2905 TREE_OPERAND (TREE_OPERAND (t, 0), 1)
2906 = TREE_OPERAND (DECL_INITIAL (ret_val), 0);
2909 /* Adjust the DECL_EXPR of NRVs to call the allocator and save the result
2910 into a new variable. */
2911 else if (TREE_CODE (t) == DECL_EXPR
2912 && is_nrv_p (dp->nrv, DECL_EXPR_DECL (t)))
2914 tree saved_current_function_decl = current_function_decl;
2915 tree var = DECL_EXPR_DECL (t);
2916 tree alloc, p_array, new_var, new_ret;
2917 VEC(constructor_elt,gc) *v = VEC_alloc (constructor_elt, gc, 2);
2919 /* Create an artificial context to build the allocation. */
2920 current_function_decl = decl_function_context (var);
2921 start_stmt_group ();
2924 /* This will return a COMPOUND_EXPR with the allocation in the first
2925 arm and the final return value in the second arm. */
2926 alloc = build_allocator (TREE_TYPE (var), DECL_INITIAL (var),
2927 TREE_TYPE (dp->result),
2928 Procedure_To_Call (dp->gnat_ret),
2929 Storage_Pool (dp->gnat_ret),
2932 /* The new variable is built as a reference to the allocated space. */
2934 = build_decl (DECL_SOURCE_LOCATION (var), VAR_DECL, DECL_NAME (var),
2935 build_reference_type (TREE_TYPE (var)));
2936 DECL_BY_REFERENCE (new_var) = 1;
2938 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (alloc)))
2940 /* The new initial value is a COMPOUND_EXPR with the allocation in
2941 the first arm and the value of P_ARRAY in the second arm. */
2942 DECL_INITIAL (new_var)
2943 = build2 (COMPOUND_EXPR, TREE_TYPE (new_var),
2944 TREE_OPERAND (alloc, 0),
2945 VEC_index (constructor_elt,
2946 CONSTRUCTOR_ELTS (TREE_OPERAND (alloc, 1)),
2949 /* Build a modified CONSTRUCTOR that references NEW_VAR. */
2950 p_array = TYPE_FIELDS (TREE_TYPE (alloc));
2951 CONSTRUCTOR_APPEND_ELT (v, p_array,
2952 fold_convert (TREE_TYPE (p_array), new_var));
2953 CONSTRUCTOR_APPEND_ELT (v, DECL_CHAIN (p_array),
2954 VEC_index (constructor_elt,
2956 (TREE_OPERAND (alloc, 1)),
2958 new_ret = build_constructor (TREE_TYPE (alloc), v);
2962 /* The new initial value is just the allocation. */
2963 DECL_INITIAL (new_var) = alloc;
2964 new_ret = fold_convert (TREE_TYPE (alloc), new_var);
2967 gnat_pushdecl (new_var, Empty);
2969 /* Destroy the artificial context and insert the new statements. */
2971 *tp = end_stmt_group ();
2972 current_function_decl = saved_current_function_decl;
2974 /* Chain NEW_VAR immediately after VAR and ignore the latter. */
2975 DECL_CHAIN (new_var) = DECL_CHAIN (var);
2976 DECL_CHAIN (var) = new_var;
2977 DECL_IGNORED_P (var) = 1;
2979 /* Save the new return value and the dereference of NEW_VAR. */
2981 = build2 (COMPOUND_EXPR, TREE_TYPE (var), new_ret,
2982 build1 (INDIRECT_REF, TREE_TYPE (var), new_var));
2983 /* ??? Kludge to avoid messing up during inlining. */
2984 DECL_CONTEXT (var) = NULL_TREE;
2987 /* And replace all uses of NRVs with the dereference of NEW_VAR. */
2988 else if (is_nrv_p (dp->nrv, t))
2989 *tp = TREE_OPERAND (DECL_INITIAL (t), 1);
2991 /* Avoid walking into the same tree more than once. Unfortunately, we
2992 can't just use walk_tree_without_duplicates because it would only
2993 call us for the first occurrence of NRVs in the function body. */
2994 if (pointer_set_insert (dp->visited, *tp))
3000 /* Finalize the Named Return Value optimization for FNDECL. The NRV bitmap
3001 contains the candidates for Named Return Value and OTHER is a list of
3002 the other return values. GNAT_RET is a representative return node. */
3005 finalize_nrv (tree fndecl, bitmap nrv, VEC(tree,gc) *other, Node_Id gnat_ret)
3007 struct cgraph_node *node;
3008 struct nrv_data data;
3013 /* We shouldn't be applying the optimization to return types that we aren't
3014 allowed to manipulate freely. */
3015 gcc_assert (!TREE_ADDRESSABLE (TREE_TYPE (TREE_TYPE (fndecl))));
3017 /* Prune the candidates that are referenced by other return values. */
3019 data.result = NULL_TREE;
3020 data.visited = NULL;
3021 for (i = 0; VEC_iterate(tree, other, i, iter); i++)
3022 walk_tree_without_duplicates (&iter, prune_nrv_r, &data);
3023 if (bitmap_empty_p (nrv))
3026 /* Prune also the candidates that are referenced by nested functions. */
3027 node = cgraph_get_create_node (fndecl);
3028 for (node = node->nested; node; node = node->next_nested)
3029 walk_tree_without_duplicates (&DECL_SAVED_TREE (node->decl), prune_nrv_r,
3031 if (bitmap_empty_p (nrv))
3034 /* Extract a set of NRVs with non-overlapping live ranges. */
3035 if (!prune_nrv_in_block (nrv, DECL_INITIAL (fndecl)))
3038 /* Adjust the relevant RETURN_EXPRs and replace the occurrences of NRVs. */
3040 data.result = DECL_RESULT (fndecl);
3041 data.gnat_ret = gnat_ret;
3042 data.visited = pointer_set_create ();
3043 if (TYPE_RETURN_UNCONSTRAINED_P (TREE_TYPE (fndecl)))
3044 func = finalize_nrv_unc_r;
3046 func = finalize_nrv_r;
3047 walk_tree (&DECL_SAVED_TREE (fndecl), func, &data, NULL);
3048 pointer_set_destroy (data.visited);
3051 /* Return true if RET_VAL can be used as a Named Return Value for the
3052 anonymous return object RET_OBJ. */
3055 return_value_ok_for_nrv_p (tree ret_obj, tree ret_val)
3057 if (TREE_CODE (ret_val) != VAR_DECL)
3060 if (TREE_THIS_VOLATILE (ret_val))
3063 if (DECL_CONTEXT (ret_val) != current_function_decl)
3066 if (TREE_STATIC (ret_val))
3069 if (TREE_ADDRESSABLE (ret_val))
3072 if (ret_obj && DECL_ALIGN (ret_val) > DECL_ALIGN (ret_obj))
3078 /* Build a RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR around
3079 the assignment of RET_VAL to RET_OBJ. Otherwise build a bare RETURN_EXPR
3080 around RESULT_OBJ, which may be null in this case. */
3083 build_return_expr (tree ret_obj, tree ret_val)
3089 /* The gimplifier explicitly enforces the following invariant:
3098 As a consequence, type consistency dictates that we use the type
3099 of the RET_OBJ as the operation type. */
3100 tree operation_type = TREE_TYPE (ret_obj);
3102 /* Convert the right operand to the operation type. Note that it's the
3103 same transformation as in the MODIFY_EXPR case of build_binary_op,
3104 with the assumption that the type cannot involve a placeholder. */
3105 if (operation_type != TREE_TYPE (ret_val))
3106 ret_val = convert (operation_type, ret_val);
3108 result_expr = build2 (MODIFY_EXPR, void_type_node, ret_obj, ret_val);
3110 /* If the function returns an aggregate type, find out whether this is
3111 a candidate for Named Return Value. If so, record it. Otherwise,
3112 if this is an expression of some kind, record it elsewhere. */
3114 && AGGREGATE_TYPE_P (operation_type)
3115 && !TYPE_IS_FAT_POINTER_P (operation_type)
3116 && aggregate_value_p (operation_type, current_function_decl))
3118 /* Recognize the temporary created for a return value with variable
3119 size in call_to_gnu. We want to eliminate it if possible. */
3120 if (TREE_CODE (ret_val) == COMPOUND_EXPR
3121 && TREE_CODE (TREE_OPERAND (ret_val, 0)) == INIT_EXPR
3122 && TREE_OPERAND (TREE_OPERAND (ret_val, 0), 0)
3123 == TREE_OPERAND (ret_val, 1))
3124 ret_val = TREE_OPERAND (ret_val, 1);
3126 /* Strip useless conversions around the return value. */
3127 if (gnat_useless_type_conversion (ret_val))
3128 ret_val = TREE_OPERAND (ret_val, 0);
3130 /* Now apply the test to the return value. */
3131 if (return_value_ok_for_nrv_p (ret_obj, ret_val))
3133 if (!f_named_ret_val)
3134 f_named_ret_val = BITMAP_GGC_ALLOC ();
3135 bitmap_set_bit (f_named_ret_val, DECL_UID (ret_val));
3138 /* Note that we need not care about CONSTRUCTORs here, as they are
3139 totally transparent given the read-compose-write semantics of
3140 assignments from CONSTRUCTORs. */
3141 else if (EXPR_P (ret_val))
3142 VEC_safe_push (tree, gc, f_other_ret_val, ret_val);
3146 result_expr = ret_obj;
3148 return build1 (RETURN_EXPR, void_type_node, result_expr);
3151 /* Build a stub for the subprogram specified by the GCC tree GNU_SUBPROG
3152 and the GNAT node GNAT_SUBPROG. */
3155 build_function_stub (tree gnu_subprog, Entity_Id gnat_subprog)
3157 tree gnu_subprog_type, gnu_subprog_addr, gnu_subprog_call;
3158 tree gnu_subprog_param, gnu_stub_param, gnu_param;
3159 tree gnu_stub_decl = DECL_FUNCTION_STUB (gnu_subprog);
3160 VEC(tree,gc) *gnu_param_vec = NULL;
3162 gnu_subprog_type = TREE_TYPE (gnu_subprog);
3164 /* Initialize the information structure for the function. */
3165 allocate_struct_function (gnu_stub_decl, false);
3168 begin_subprog_body (gnu_stub_decl);
3170 start_stmt_group ();
3173 /* Loop over the parameters of the stub and translate any of them
3174 passed by descriptor into a by reference one. */
3175 for (gnu_stub_param = DECL_ARGUMENTS (gnu_stub_decl),
3176 gnu_subprog_param = DECL_ARGUMENTS (gnu_subprog);
3178 gnu_stub_param = DECL_CHAIN (gnu_stub_param),
3179 gnu_subprog_param = DECL_CHAIN (gnu_subprog_param))
3181 if (DECL_BY_DESCRIPTOR_P (gnu_stub_param))
3183 gcc_assert (DECL_BY_REF_P (gnu_subprog_param));
3185 = convert_vms_descriptor (TREE_TYPE (gnu_subprog_param),
3187 DECL_PARM_ALT_TYPE (gnu_stub_param),
3188 DECL_BY_DOUBLE_REF_P (gnu_subprog_param),
3192 gnu_param = gnu_stub_param;
3194 VEC_safe_push (tree, gc, gnu_param_vec, gnu_param);
3197 /* Invoke the internal subprogram. */
3198 gnu_subprog_addr = build1 (ADDR_EXPR, build_pointer_type (gnu_subprog_type),
3200 gnu_subprog_call = build_call_vec (TREE_TYPE (gnu_subprog_type),
3201 gnu_subprog_addr, gnu_param_vec);
3203 /* Propagate the return value, if any. */
3204 if (VOID_TYPE_P (TREE_TYPE (gnu_subprog_type)))
3205 add_stmt (gnu_subprog_call);
3207 add_stmt (build_return_expr (DECL_RESULT (gnu_stub_decl),
3211 end_subprog_body (end_stmt_group ());
3212 rest_of_subprog_body_compilation (gnu_stub_decl);
3215 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
3216 don't return anything. */
3219 Subprogram_Body_to_gnu (Node_Id gnat_node)
3221 /* Defining identifier of a parameter to the subprogram. */
3222 Entity_Id gnat_param;
3223 /* The defining identifier for the subprogram body. Note that if a
3224 specification has appeared before for this body, then the identifier
3225 occurring in that specification will also be a defining identifier and all
3226 the calls to this subprogram will point to that specification. */
3227 Entity_Id gnat_subprog_id
3228 = (Present (Corresponding_Spec (gnat_node))
3229 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
3230 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
3231 tree gnu_subprog_decl;
3232 /* Its RESULT_DECL node. */
3233 tree gnu_result_decl;
3234 /* Its FUNCTION_TYPE node. */
3235 tree gnu_subprog_type;
3236 /* The TYPE_CI_CO_LIST of its FUNCTION_TYPE node, if any. */
3238 /* The entry in the CI_CO_LIST that represents a function return, if any. */
3239 tree gnu_return_var_elmt = NULL_TREE;
3241 struct language_function *gnu_subprog_language;
3242 VEC(parm_attr,gc) *cache;
3244 /* If this is a generic object or if it has been eliminated,
3246 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
3247 || Ekind (gnat_subprog_id) == E_Generic_Function
3248 || Is_Eliminated (gnat_subprog_id))
3251 /* If this subprogram acts as its own spec, define it. Otherwise, just get
3252 the already-elaborated tree node. However, if this subprogram had its
3253 elaboration deferred, we will already have made a tree node for it. So
3254 treat it as not being defined in that case. Such a subprogram cannot
3255 have an address clause or a freeze node, so this test is safe, though it
3256 does disable some otherwise-useful error checking. */
3258 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
3259 Acts_As_Spec (gnat_node)
3260 && !present_gnu_tree (gnat_subprog_id));
3261 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
3262 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
3263 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
3265 gnu_return_var_elmt = value_member (void_type_node, gnu_cico_list);
3267 /* If the function returns by invisible reference, make it explicit in the
3268 function body. See gnat_to_gnu_entity, E_Subprogram_Type case.
3269 Handle the explicit case here and the copy-in/copy-out case below. */
3270 if (TREE_ADDRESSABLE (gnu_subprog_type) && !gnu_return_var_elmt)
3272 TREE_TYPE (gnu_result_decl)
3273 = build_reference_type (TREE_TYPE (gnu_result_decl));
3274 relayout_decl (gnu_result_decl);
3277 /* Set the line number in the decl to correspond to that of the body so that
3278 the line number notes are written correctly. */
3279 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
3281 /* Initialize the information structure for the function. */
3282 allocate_struct_function (gnu_subprog_decl, false);
3283 gnu_subprog_language = ggc_alloc_cleared_language_function ();
3284 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language = gnu_subprog_language;
3287 begin_subprog_body (gnu_subprog_decl);
3289 /* If there are In Out or Out parameters, we need to ensure that the return
3290 statement properly copies them out. We do this by making a new block and
3291 converting any return into a goto to a label at the end of the block. */
3294 tree gnu_return_var = NULL_TREE;
3296 VEC_safe_push (tree, gc, gnu_return_label_stack,
3297 create_artificial_label (input_location));
3299 start_stmt_group ();
3302 /* If this is a function with In Out or Out parameters, we also need a
3303 variable for the return value to be placed. */
3304 if (gnu_return_var_elmt)
3306 tree gnu_return_type
3307 = TREE_TYPE (TREE_PURPOSE (gnu_return_var_elmt));
3309 /* If the function returns by invisible reference, make it
3310 explicit in the function body. See gnat_to_gnu_entity,
3311 E_Subprogram_Type case. */
3312 if (TREE_ADDRESSABLE (gnu_subprog_type))
3313 gnu_return_type = build_reference_type (gnu_return_type);
3316 = create_var_decl (get_identifier ("RETVAL"), NULL_TREE,
3317 gnu_return_type, NULL_TREE, false, false,
3318 false, false, NULL, gnat_subprog_id);
3319 TREE_VALUE (gnu_return_var_elmt) = gnu_return_var;
3322 VEC_safe_push (tree, gc, gnu_return_var_stack, gnu_return_var);
3324 /* See whether there are parameters for which we don't have a GCC tree
3325 yet. These must be Out parameters. Make a VAR_DECL for them and
3326 put it into TYPE_CI_CO_LIST, which must contain an empty entry too.
3327 We can match up the entries because TYPE_CI_CO_LIST is in the order
3328 of the parameters. */
3329 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
3330 Present (gnat_param);
3331 gnat_param = Next_Formal_With_Extras (gnat_param))
3332 if (!present_gnu_tree (gnat_param))
3334 tree gnu_cico_entry = gnu_cico_list;
3336 /* Skip any entries that have been already filled in; they must
3337 correspond to In Out parameters. */
3338 while (gnu_cico_entry && TREE_VALUE (gnu_cico_entry))
3339 gnu_cico_entry = TREE_CHAIN (gnu_cico_entry);
3341 /* Do any needed references for padded types. */
3342 TREE_VALUE (gnu_cico_entry)
3343 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_entry)),
3344 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
3348 VEC_safe_push (tree, gc, gnu_return_label_stack, NULL_TREE);
3350 /* Get a tree corresponding to the code for the subprogram. */
3351 start_stmt_group ();
3354 /* On VMS, establish our condition handler to possibly turn a condition into
3355 the corresponding exception if the subprogram has a foreign convention or
3358 To ensure proper execution of local finalizations on condition instances,
3359 we must turn a condition into the corresponding exception even if there
3360 is no applicable Ada handler, and need at least one condition handler per
3361 possible call chain involving GNAT code. OTOH, establishing the handler
3362 has a cost so we want to minimize the number of subprograms into which
3363 this happens. The foreign or exported condition is expected to satisfy
3364 all the constraints. */
3365 if (TARGET_ABI_OPEN_VMS
3366 && (Has_Foreign_Convention (gnat_subprog_id)
3367 || Is_Exported (gnat_subprog_id)))
3368 establish_gnat_vms_condition_handler ();
3370 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
3372 /* Generate the code of the subprogram itself. A return statement will be
3373 present and any Out parameters will be handled there. */
3374 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
3376 gnu_result = end_stmt_group ();
3378 /* If we populated the parameter attributes cache, we need to make sure that
3379 the cached expressions are evaluated on all the possible paths leading to
3380 their uses. So we force their evaluation on entry of the function. */
3381 cache = gnu_subprog_language->parm_attr_cache;
3384 struct parm_attr_d *pa;
3387 start_stmt_group ();
3389 FOR_EACH_VEC_ELT (parm_attr, cache, i, pa)
3392 add_stmt_with_node_force (pa->first, gnat_node);
3394 add_stmt_with_node_force (pa->last, gnat_node);
3396 add_stmt_with_node_force (pa->length, gnat_node);
3399 add_stmt (gnu_result);
3400 gnu_result = end_stmt_group ();
3402 gnu_subprog_language->parm_attr_cache = NULL;
3405 /* If we are dealing with a return from an Ada procedure with parameters
3406 passed by copy-in/copy-out, we need to return a record containing the
3407 final values of these parameters. If the list contains only one entry,
3408 return just that entry though.
3410 For a full description of the copy-in/copy-out parameter mechanism, see
3411 the part of the gnat_to_gnu_entity routine dealing with the translation
3414 We need to make a block that contains the definition of that label and
3415 the copying of the return value. It first contains the function, then
3416 the label and copy statement. */
3421 add_stmt (gnu_result);
3422 add_stmt (build1 (LABEL_EXPR, void_type_node,
3423 VEC_last (tree, gnu_return_label_stack)));
3425 if (list_length (gnu_cico_list) == 1)
3426 gnu_retval = TREE_VALUE (gnu_cico_list);
3428 gnu_retval = build_constructor_from_list (TREE_TYPE (gnu_subprog_type),
3431 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
3432 End_Label (Handled_Statement_Sequence (gnat_node)));
3434 gnu_result = end_stmt_group ();
3437 VEC_pop (tree, gnu_return_label_stack);
3439 /* Attempt setting the end_locus of our GCC body tree, typically a
3440 BIND_EXPR or STATEMENT_LIST, then the end_locus of our GCC subprogram
3441 declaration tree. */
3442 set_end_locus_from_node (gnu_result, gnat_node);
3443 set_end_locus_from_node (gnu_subprog_decl, gnat_node);
3445 end_subprog_body (gnu_result);
3447 /* Finally annotate the parameters and disconnect the trees for parameters
3448 that we have turned into variables since they are now unusable. */
3449 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
3450 Present (gnat_param);
3451 gnat_param = Next_Formal_With_Extras (gnat_param))
3453 tree gnu_param = get_gnu_tree (gnat_param);
3454 bool is_var_decl = (TREE_CODE (gnu_param) == VAR_DECL);
3456 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
3457 DECL_BY_REF_P (gnu_param),
3458 !is_var_decl && DECL_BY_DOUBLE_REF_P (gnu_param));
3461 save_gnu_tree (gnat_param, NULL_TREE, false);
3464 /* Disconnect the variable created for the return value. */
3465 if (gnu_return_var_elmt)
3466 TREE_VALUE (gnu_return_var_elmt) = void_type_node;
3468 /* If the function returns an aggregate type and we have candidates for
3469 a Named Return Value, finalize the optimization. */
3470 if (optimize && gnu_subprog_language->named_ret_val)
3472 finalize_nrv (gnu_subprog_decl,
3473 gnu_subprog_language->named_ret_val,
3474 gnu_subprog_language->other_ret_val,
3475 gnu_subprog_language->gnat_ret);
3476 gnu_subprog_language->named_ret_val = NULL;
3477 gnu_subprog_language->other_ret_val = NULL;
3480 rest_of_subprog_body_compilation (gnu_subprog_decl);
3482 /* If there is a stub associated with the function, build it now. */
3483 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
3484 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
3486 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
3489 /* Return true if GNAT_NODE requires atomic synchronization. */
3492 atomic_sync_required_p (Node_Id gnat_node)
3494 const Node_Id gnat_parent = Parent (gnat_node);
3496 unsigned char attr_id;
3498 /* First, scan the node to find the Atomic_Sync_Required flag. */
3499 kind = Nkind (gnat_node);
3500 if (kind == N_Type_Conversion || kind == N_Unchecked_Type_Conversion)
3502 gnat_node = Expression (gnat_node);
3503 kind = Nkind (gnat_node);
3508 case N_Expanded_Name:
3509 case N_Explicit_Dereference:
3511 case N_Indexed_Component:
3512 case N_Selected_Component:
3513 if (!Atomic_Sync_Required (gnat_node))
3521 /* Then, scan the parent to find out cases where the flag is irrelevant. */
3522 kind = Nkind (gnat_parent);
3525 case N_Attribute_Reference:
3526 attr_id = Get_Attribute_Id (Attribute_Name (gnat_parent));
3527 /* Do not mess up machine code insertions. */
3528 if (attr_id == Attr_Asm_Input || attr_id == Attr_Asm_Output)
3532 case N_Object_Renaming_Declaration:
3533 /* Do not generate a function call as a renamed object. */
3543 /* Create a temporary variable with PREFIX and TYPE, and return it. */
3546 create_temporary (const char *prefix, tree type)
3548 tree gnu_temp = create_var_decl (create_tmp_var_name (prefix), NULL_TREE,
3549 type, NULL_TREE, false, false, false, false,
3551 DECL_ARTIFICIAL (gnu_temp) = 1;
3552 DECL_IGNORED_P (gnu_temp) = 1;
3557 /* Create a temporary variable with PREFIX and initialize it with GNU_INIT.
3558 Put the initialization statement into GNU_INIT_STMT and annotate it with
3559 the SLOC of GNAT_NODE. Return the temporary variable. */
3562 create_init_temporary (const char *prefix, tree gnu_init, tree *gnu_init_stmt,
3565 tree gnu_temp = create_temporary (prefix, TREE_TYPE (gnu_init));
3567 *gnu_init_stmt = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_init);
3568 set_expr_location_from_node (*gnu_init_stmt, gnat_node);
3573 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
3574 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
3575 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
3576 If GNU_TARGET is non-null, this must be a function call on the RHS of a
3577 N_Assignment_Statement and the result is to be placed into that object.
3578 If, in addition, ATOMIC_SYNC is true, then the assignment to GNU_TARGET
3579 requires atomic synchronization. */
3582 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target,
3585 const bool function_call = (Nkind (gnat_node) == N_Function_Call);
3586 const bool returning_value = (function_call && !gnu_target);
3587 /* The GCC node corresponding to the GNAT subprogram name. This can either
3588 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
3589 or an indirect reference expression (an INDIRECT_REF node) pointing to a
3591 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
3592 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
3593 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
3594 /* The return type of the FUNCTION_TYPE. */
3595 tree gnu_result_type = TREE_TYPE (gnu_subprog_type);
3596 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
3597 VEC(tree,gc) *gnu_actual_vec = NULL;
3598 tree gnu_name_list = NULL_TREE;
3599 tree gnu_stmt_list = NULL_TREE;
3600 tree gnu_after_list = NULL_TREE;
3601 tree gnu_retval = NULL_TREE;
3602 tree gnu_call, gnu_result;
3603 bool went_into_elab_proc = false;
3604 bool pushed_binding_level = false;
3605 Entity_Id gnat_formal;
3606 Node_Id gnat_actual;
3608 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
3610 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
3611 all our args first. */
3612 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
3614 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
3615 gnat_node, N_Raise_Program_Error);
3617 for (gnat_actual = First_Actual (gnat_node);
3618 Present (gnat_actual);
3619 gnat_actual = Next_Actual (gnat_actual))
3620 add_stmt (gnat_to_gnu (gnat_actual));
3622 if (returning_value)
3624 *gnu_result_type_p = gnu_result_type;
3625 return build1 (NULL_EXPR, gnu_result_type, call_expr);
3631 /* The only way we can be making a call via an access type is if Name is an
3632 explicit dereference. In that case, get the list of formal args from the
3633 type the access type is pointing to. Otherwise, get the formals from the
3634 entity being called. */
3635 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
3636 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
3637 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
3638 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
3639 gnat_formal = Empty;
3641 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
3643 /* The lifetime of the temporaries created for the call ends right after the
3644 return value is copied, so we can give them the scope of the elaboration
3645 routine at top level. */
3646 if (!current_function_decl)
3648 current_function_decl = get_elaboration_procedure ();
3649 went_into_elab_proc = true;
3652 /* First, create the temporary for the return value when:
3654 1. There is no target and the function has copy-in/copy-out parameters,
3655 because we need to preserve the return value before copying back the
3658 2. There is no target and this is not an object declaration, and the
3659 return type is by-reference or has variable size, because in these
3660 cases the gimplifier cannot create the temporary.
3662 3. There is a target and it is a slice or an array with fixed size,
3663 and the return type has variable size, because the gimplifier
3664 doesn't handle these cases.
3666 This must be done before we push a binding level around the call, since
3667 we will pop it before copying the return value. */
3669 && ((!gnu_target && TYPE_CI_CO_LIST (gnu_subprog_type))
3671 && Nkind (Parent (gnat_node)) != N_Object_Declaration
3672 && (TREE_ADDRESSABLE (gnu_result_type)
3673 || TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST))
3675 && (TREE_CODE (gnu_target) == ARRAY_RANGE_REF
3676 || (TREE_CODE (TREE_TYPE (gnu_target)) == ARRAY_TYPE
3677 && TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_target)))
3679 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST)))
3680 gnu_retval = create_temporary ("R", gnu_result_type);
3682 /* Create the list of the actual parameters as GCC expects it, namely a
3683 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
3684 is an expression and the TREE_PURPOSE field is null. But skip Out
3685 parameters not passed by reference and that need not be copied in. */
3686 for (gnat_actual = First_Actual (gnat_node);
3687 Present (gnat_actual);
3688 gnat_formal = Next_Formal_With_Extras (gnat_formal),
3689 gnat_actual = Next_Actual (gnat_actual))
3691 tree gnu_formal = present_gnu_tree (gnat_formal)
3692 ? get_gnu_tree (gnat_formal) : NULL_TREE;
3693 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
3694 const bool is_true_formal_parm
3695 = gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL;
3696 const bool is_by_ref_formal_parm
3697 = is_true_formal_parm
3698 && (DECL_BY_REF_P (gnu_formal)
3699 || DECL_BY_COMPONENT_PTR_P (gnu_formal)
3700 || DECL_BY_DESCRIPTOR_P (gnu_formal));
3701 /* In the Out or In Out case, we must suppress conversions that yield
3702 an lvalue but can nevertheless cause the creation of a temporary,
3703 because we need the real object in this case, either to pass its
3704 address if it's passed by reference or as target of the back copy
3705 done after the call if it uses the copy-in/copy-out mechanism.
3706 We do it in the In case too, except for an unchecked conversion
3707 because it alone can cause the actual to be misaligned and the
3708 addressability test is applied to the real object. */
3709 const bool suppress_type_conversion
3710 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
3711 && Ekind (gnat_formal) != E_In_Parameter)
3712 || (Nkind (gnat_actual) == N_Type_Conversion
3713 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
3714 Node_Id gnat_name = suppress_type_conversion
3715 ? Expression (gnat_actual) : gnat_actual;
3716 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
3719 /* If it's possible we may need to use this expression twice, make sure
3720 that any side-effects are handled via SAVE_EXPRs; likewise if we need
3721 to force side-effects before the call.
3722 ??? This is more conservative than we need since we don't need to do
3723 this for pass-by-ref with no conversion. */
3724 if (Ekind (gnat_formal) != E_In_Parameter)
3725 gnu_name = gnat_stabilize_reference (gnu_name, true, NULL);
3727 /* If we are passing a non-addressable parameter by reference, pass the
3728 address of a copy. In the Out or In Out case, set up to copy back
3729 out after the call. */
3730 if (is_by_ref_formal_parm
3731 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
3732 && !addressable_p (gnu_name, gnu_name_type))
3734 bool in_param = (Ekind (gnat_formal) == E_In_Parameter);
3735 tree gnu_orig = gnu_name, gnu_temp, gnu_stmt;
3737 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
3738 but sort of an instantiation for them. */
3739 if (TREE_CODE (gnu_name) == CONSTRUCTOR)
3742 /* If the type is passed by reference, a copy is not allowed. */
3743 else if (TREE_ADDRESSABLE (gnu_formal_type))
3744 post_error ("misaligned actual cannot be passed by reference",
3747 /* For users of Starlet we issue a warning because the interface
3748 apparently assumes that by-ref parameters outlive the procedure
3749 invocation. The code still will not work as intended, but we
3750 cannot do much better since low-level parts of the back-end
3751 would allocate temporaries at will because of the misalignment
3752 if we did not do so here. */
3753 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
3756 ("?possible violation of implicit assumption", gnat_actual);
3758 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
3759 Entity (Name (gnat_node)));
3760 post_error_ne ("?because of misalignment of &", gnat_actual,
3764 /* If the actual type of the object is already the nominal type,
3765 we have nothing to do, except if the size is self-referential
3766 in which case we'll remove the unpadding below. */
3767 if (TREE_TYPE (gnu_name) == gnu_name_type
3768 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
3771 /* Otherwise remove the unpadding from all the objects. */
3772 else if (TREE_CODE (gnu_name) == COMPONENT_REF
3773 && TYPE_IS_PADDING_P
3774 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
3775 gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0);
3777 /* Otherwise convert to the nominal type of the object if needed.
3778 There are several cases in which we need to make the temporary
3779 using this type instead of the actual type of the object when
3780 they are distinct, because the expectations of the callee would
3781 otherwise not be met:
3782 - if it's a justified modular type,
3783 - if the actual type is a smaller form of it,
3784 - if it's a smaller form of the actual type. */
3785 else if ((TREE_CODE (gnu_name_type) == RECORD_TYPE
3786 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
3787 || smaller_form_type_p (TREE_TYPE (gnu_name),
3789 || (INTEGRAL_TYPE_P (gnu_name_type)
3790 && smaller_form_type_p (gnu_name_type,
3791 TREE_TYPE (gnu_name))))
3792 gnu_name = convert (gnu_name_type, gnu_name);
3794 /* If this is an In Out or Out parameter and we're returning a value,
3795 we need to create a temporary for the return value because we must
3796 preserve it before copying back at the very end. */
3797 if (!in_param && returning_value && !gnu_retval)
3798 gnu_retval = create_temporary ("R", gnu_result_type);
3800 /* If we haven't pushed a binding level, push a new one. This will
3801 narrow the lifetime of the temporary we are about to make as much
3802 as possible. The drawback is that we'd need to create a temporary
3803 for the return value, if any (see comment before the loop). So do
3804 it only when this temporary was already created just above. */
3805 if (!pushed_binding_level && !(in_param && returning_value))
3807 start_stmt_group ();
3809 pushed_binding_level = true;
3812 /* Create an explicit temporary holding the copy. */
3814 = create_init_temporary ("A", gnu_name, &gnu_stmt, gnat_actual);
3816 /* But initialize it on the fly like for an implicit temporary as
3817 we aren't necessarily having a statement list. */
3818 gnu_name = build_compound_expr (TREE_TYPE (gnu_name), gnu_stmt,
3821 /* Set up to move the copy back to the original if needed. */
3824 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig,
3826 set_expr_location_from_node (gnu_stmt, gnat_node);
3827 append_to_statement_list (gnu_stmt, &gnu_after_list);
3831 /* Start from the real object and build the actual. */
3832 gnu_actual = gnu_name;
3834 /* If this is an atomic access of an In or In Out parameter for which
3835 synchronization is required, build the atomic load. */
3836 if (is_true_formal_parm
3837 && !is_by_ref_formal_parm
3838 && Ekind (gnat_formal) != E_Out_Parameter
3839 && atomic_sync_required_p (gnat_actual))
3840 gnu_actual = build_atomic_load (gnu_actual);
3842 /* If this was a procedure call, we may not have removed any padding.
3843 So do it here for the part we will use as an input, if any. */
3844 if (Ekind (gnat_formal) != E_Out_Parameter
3845 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
3847 = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual);
3849 /* Put back the conversion we suppressed above in the computation of the
3850 real object. And even if we didn't suppress any conversion there, we
3851 may have suppressed a conversion to the Etype of the actual earlier,
3852 since the parent is a procedure call, so put it back here. */
3853 if (suppress_type_conversion
3854 && Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
3856 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
3857 gnu_actual, No_Truncation (gnat_actual));
3860 = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual);
3862 /* Make sure that the actual is in range of the formal's type. */
3863 if (Ekind (gnat_formal) != E_Out_Parameter
3864 && Do_Range_Check (gnat_actual))
3866 = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual);
3868 /* Unless this is an In parameter, we must remove any justified modular
3869 building from GNU_NAME to get an lvalue. */
3870 if (Ekind (gnat_formal) != E_In_Parameter
3871 && TREE_CODE (gnu_name) == CONSTRUCTOR
3872 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
3873 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
3875 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name);
3877 /* If we have not saved a GCC object for the formal, it means it is an
3878 Out parameter not passed by reference and that need not be copied in.
3879 Otherwise, first see if the parameter is passed by reference. */
3880 if (is_true_formal_parm && DECL_BY_REF_P (gnu_formal))
3882 if (Ekind (gnat_formal) != E_In_Parameter)
3884 /* In Out or Out parameters passed by reference don't use the
3885 copy-in/copy-out mechanism so the address of the real object
3886 must be passed to the function. */
3887 gnu_actual = gnu_name;
3889 /* If we have a padded type, be sure we've removed padding. */
3890 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
3891 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
3894 /* If we have the constructed subtype of an aliased object
3895 with an unconstrained nominal subtype, the type of the
3896 actual includes the template, although it is formally
3897 constrained. So we need to convert it back to the real
3898 constructed subtype to retrieve the constrained part
3899 and takes its address. */
3900 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
3901 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
3902 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
3903 && Is_Array_Type (Etype (gnat_actual)))
3904 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
3908 /* There is no need to convert the actual to the formal's type before
3909 taking its address. The only exception is for unconstrained array
3910 types because of the way we build fat pointers. */
3911 if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE)
3913 /* Put back a view conversion for In Out or Out parameters. */
3914 if (Ekind (gnat_formal) != E_In_Parameter)
3915 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
3917 gnu_actual = convert (gnu_formal_type, gnu_actual);
3920 /* The symmetry of the paths to the type of an entity is broken here
3921 since arguments don't know that they will be passed by ref. */
3922 gnu_formal_type = TREE_TYPE (gnu_formal);
3924 if (DECL_BY_DOUBLE_REF_P (gnu_formal))
3926 = build_unary_op (ADDR_EXPR, TREE_TYPE (gnu_formal_type),
3929 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
3931 else if (is_true_formal_parm && DECL_BY_COMPONENT_PTR_P (gnu_formal))
3933 gnu_formal_type = TREE_TYPE (gnu_formal);
3934 gnu_actual = maybe_implicit_deref (gnu_actual);
3935 gnu_actual = maybe_unconstrained_array (gnu_actual);
3937 if (TYPE_IS_PADDING_P (gnu_formal_type))
3939 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
3940 gnu_actual = convert (gnu_formal_type, gnu_actual);
3943 /* Take the address of the object and convert to the proper pointer
3944 type. We'd like to actually compute the address of the beginning
3945 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
3946 possibility that the ARRAY_REF might return a constant and we'd be
3947 getting the wrong address. Neither approach is exactly correct,
3948 but this is the most likely to work in all cases. */
3949 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
3951 else if (is_true_formal_parm && DECL_BY_DESCRIPTOR_P (gnu_formal))
3953 gnu_actual = convert (gnu_formal_type, gnu_actual);
3955 /* If this is 'Null_Parameter, pass a zero descriptor. */
3956 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
3957 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
3958 && TREE_PRIVATE (gnu_actual))
3960 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
3962 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
3964 (TREE_TYPE (TREE_TYPE (gnu_formal)),
3965 gnu_actual, gnat_actual));
3971 if (Ekind (gnat_formal) != E_In_Parameter)
3972 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
3974 if (!is_true_formal_parm)
3976 /* Make sure side-effects are evaluated before the call. */
3977 if (TREE_SIDE_EFFECTS (gnu_name))
3978 append_to_statement_list (gnu_name, &gnu_stmt_list);
3982 gnu_actual = convert (gnu_formal_type, gnu_actual);
3984 /* If this is 'Null_Parameter, pass a zero even though we are
3985 dereferencing it. */
3986 if (TREE_CODE (gnu_actual) == INDIRECT_REF
3987 && TREE_PRIVATE (gnu_actual)
3988 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
3989 && TREE_CODE (gnu_size) == INTEGER_CST
3990 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
3992 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
3993 convert (gnat_type_for_size
3994 (TREE_INT_CST_LOW (gnu_size), 1),
3998 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
4001 VEC_safe_push (tree, gc, gnu_actual_vec, gnu_actual);
4005 = build_call_vec (gnu_result_type, gnu_subprog_addr, gnu_actual_vec);
4006 set_expr_location_from_node (gnu_call, gnat_node);
4008 /* If we have created a temporary for the return value, initialize it. */
4012 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_retval, gnu_call);
4013 set_expr_location_from_node (gnu_stmt, gnat_node);
4014 append_to_statement_list (gnu_stmt, &gnu_stmt_list);
4015 gnu_call = gnu_retval;
4018 /* If this is a subprogram with copy-in/copy-out parameters, we need to
4019 unpack the valued returned from the function into the In Out or Out
4020 parameters. We deal with the function return (if this is an Ada
4022 if (TYPE_CI_CO_LIST (gnu_subprog_type))
4024 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
4025 copy-out parameters. */
4026 tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
4027 const int length = list_length (gnu_cico_list);
4029 /* The call sequence must contain one and only one call, even though the
4030 function is pure. Save the result into a temporary if needed. */
4036 /* If we haven't pushed a binding level, push a new one. This
4037 will narrow the lifetime of the temporary we are about to
4038 make as much as possible. */
4039 if (!pushed_binding_level)
4041 start_stmt_group ();
4043 pushed_binding_level = true;
4046 = create_init_temporary ("P", gnu_call, &gnu_stmt, gnat_node);
4047 append_to_statement_list (gnu_stmt, &gnu_stmt_list);
4050 gnu_name_list = nreverse (gnu_name_list);
4053 /* The first entry is for the actual return value if this is a
4054 function, so skip it. */
4055 if (TREE_VALUE (gnu_cico_list) == void_type_node)
4056 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
4058 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
4059 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
4061 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
4063 for (gnat_actual = First_Actual (gnat_node);
4064 Present (gnat_actual);
4065 gnat_formal = Next_Formal_With_Extras (gnat_formal),
4066 gnat_actual = Next_Actual (gnat_actual))
4067 /* If we are dealing with a copy-in/copy-out parameter, we must
4068 retrieve its value from the record returned in the call. */
4069 if (!(present_gnu_tree (gnat_formal)
4070 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
4071 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
4072 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
4073 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
4074 || (DECL_BY_DESCRIPTOR_P
4075 (get_gnu_tree (gnat_formal))))))))
4076 && Ekind (gnat_formal) != E_In_Parameter)
4078 /* Get the value to assign to this Out or In Out parameter. It is
4079 either the result of the function if there is only a single such
4080 parameter or the appropriate field from the record returned. */
4084 : build_component_ref (gnu_call, NULL_TREE,
4085 TREE_PURPOSE (gnu_cico_list), false);
4087 /* If the actual is a conversion, get the inner expression, which
4088 will be the real destination, and convert the result to the
4089 type of the actual parameter. */
4091 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
4093 /* If the result is a padded type, remove the padding. */
4094 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
4096 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
4099 /* If the actual is a type conversion, the real target object is
4100 denoted by the inner Expression and we need to convert the
4101 result to the associated type.
4102 We also need to convert our gnu assignment target to this type
4103 if the corresponding GNU_NAME was constructed from the GNAT
4104 conversion node and not from the inner Expression. */
4105 if (Nkind (gnat_actual) == N_Type_Conversion)
4108 = convert_with_check
4109 (Etype (Expression (gnat_actual)), gnu_result,
4110 Do_Overflow_Check (gnat_actual),
4111 Do_Range_Check (Expression (gnat_actual)),
4112 Float_Truncate (gnat_actual), gnat_actual);
4114 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
4115 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
4118 /* Unchecked conversions as actuals for Out parameters are not
4119 allowed in user code because they are not variables, but do
4120 occur in front-end expansions. The associated GNU_NAME is
4121 always obtained from the inner expression in such cases. */
4122 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
4123 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
4125 No_Truncation (gnat_actual));
4128 if (Do_Range_Check (gnat_actual))
4130 = emit_range_check (gnu_result, Etype (gnat_actual),
4133 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
4134 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
4135 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
4138 if (atomic_sync_required_p (gnat_actual))
4139 gnu_result = build_atomic_store (gnu_actual, gnu_result);
4141 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4142 gnu_actual, gnu_result);
4143 set_expr_location_from_node (gnu_result, gnat_node);
4144 append_to_statement_list (gnu_result, &gnu_stmt_list);
4145 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
4146 gnu_name_list = TREE_CHAIN (gnu_name_list);
4150 /* If this is a function call, the result is the call expression unless a
4151 target is specified, in which case we copy the result into the target
4152 and return the assignment statement. */
4155 /* If this is a function with copy-in/copy-out parameters, extract the
4156 return value from it and update the return type. */
4157 if (TYPE_CI_CO_LIST (gnu_subprog_type))
4159 tree gnu_elmt = value_member (void_type_node,
4160 TYPE_CI_CO_LIST (gnu_subprog_type));
4161 gnu_call = build_component_ref (gnu_call, NULL_TREE,
4162 TREE_PURPOSE (gnu_elmt), false);
4163 gnu_result_type = TREE_TYPE (gnu_call);
4166 /* If the function returns an unconstrained array or by direct reference,
4167 we have to dereference the pointer. */
4168 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
4169 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
4170 gnu_call = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_call);
4174 Node_Id gnat_parent = Parent (gnat_node);
4175 enum tree_code op_code;
4177 /* If range check is needed, emit code to generate it. */
4178 if (Do_Range_Check (gnat_node))
4180 = emit_range_check (gnu_call, Etype (Name (gnat_parent)),
4183 /* ??? If the return type has variable size, then force the return
4184 slot optimization as we would not be able to create a temporary.
4185 Likewise if it was unconstrained as we would copy too much data.
4186 That's what has been done historically. */
4187 if (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
4188 || (TYPE_IS_PADDING_P (gnu_result_type)
4189 && CONTAINS_PLACEHOLDER_P
4190 (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS (gnu_result_type))))))
4191 op_code = INIT_EXPR;
4193 op_code = MODIFY_EXPR;
4196 gnu_call = build_atomic_store (gnu_target, gnu_call);
4199 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_call);
4200 set_expr_location_from_node (gnu_call, gnat_parent);
4201 append_to_statement_list (gnu_call, &gnu_stmt_list);
4204 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
4207 /* Otherwise, if this is a procedure call statement without copy-in/copy-out
4208 parameters, the result is just the call statement. */
4209 else if (!TYPE_CI_CO_LIST (gnu_subprog_type))
4210 append_to_statement_list (gnu_call, &gnu_stmt_list);
4212 /* Finally, add the copy back statements, if any. */
4213 append_to_statement_list (gnu_after_list, &gnu_stmt_list);
4215 if (went_into_elab_proc)
4216 current_function_decl = NULL_TREE;
4218 /* If we have pushed a binding level, pop it and finish up the enclosing
4220 if (pushed_binding_level)
4222 add_stmt (gnu_stmt_list);
4224 gnu_result = end_stmt_group ();
4227 /* Otherwise, retrieve the statement list, if any. */
4228 else if (gnu_stmt_list)
4229 gnu_result = gnu_stmt_list;
4231 /* Otherwise, just return the call expression. */
4235 /* If we nevertheless need a value, make a COMPOUND_EXPR to return it.
4236 But first simplify if we have only one statement in the list. */
4237 if (returning_value)
4239 tree first = expr_first (gnu_result), last = expr_last (gnu_result);
4243 = build_compound_expr (TREE_TYPE (gnu_call), gnu_result, gnu_call);
4249 /* Subroutine of gnat_to_gnu to translate gnat_node, an
4250 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
4253 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
4255 tree gnu_jmpsave_decl = NULL_TREE;
4256 tree gnu_jmpbuf_decl = NULL_TREE;
4257 /* If just annotating, ignore all EH and cleanups. */
4258 bool gcc_zcx = (!type_annotate_only
4259 && Present (Exception_Handlers (gnat_node))
4260 && Exception_Mechanism == Back_End_Exceptions);
4262 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
4263 && Exception_Mechanism == Setjmp_Longjmp);
4264 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
4265 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
4266 tree gnu_inner_block; /* The statement(s) for the block itself. */
4271 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
4272 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
4273 add_cleanup, and when we leave the binding, end_stmt_group will create
4274 the TRY_FINALLY_EXPR.
4276 ??? The region level calls down there have been specifically put in place
4277 for a ZCX context and currently the order in which things are emitted
4278 (region/handlers) is different from the SJLJ case. Instead of putting
4279 other calls with different conditions at other places for the SJLJ case,
4280 it seems cleaner to reorder things for the SJLJ case and generalize the
4281 condition to make it not ZCX specific.
4283 If there are any exceptions or cleanup processing involved, we need an
4284 outer statement group (for Setjmp_Longjmp) and binding level. */
4285 if (binding_for_block)
4287 start_stmt_group ();
4291 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
4292 area for address of previous buffer. Do this first since we need to have
4293 the setjmp buf known for any decls in this block. */
4297 = create_var_decl (get_identifier ("JMPBUF_SAVE"), NULL_TREE,
4299 build_call_n_expr (get_jmpbuf_decl, 0),
4300 false, false, false, false, NULL, gnat_node);
4301 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
4303 /* The __builtin_setjmp receivers will immediately reinstall it. Now
4304 because of the unstructured form of EH used by setjmp_longjmp, there
4305 might be forward edges going to __builtin_setjmp receivers on which
4306 it is uninitialized, although they will never be actually taken. */
4307 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
4309 = create_var_decl (get_identifier ("JMP_BUF"), NULL_TREE,
4312 false, false, false, false, NULL, gnat_node);
4313 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
4315 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
4317 /* When we exit this block, restore the saved value. */
4318 add_cleanup (build_call_n_expr (set_jmpbuf_decl, 1, gnu_jmpsave_decl),
4319 End_Label (gnat_node));
4322 /* If we are to call a function when exiting this block, add a cleanup
4323 to the binding level we made above. Note that add_cleanup is FIFO
4324 so we must register this cleanup after the EH cleanup just above. */
4326 add_cleanup (build_call_n_expr (gnat_to_gnu (At_End_Proc (gnat_node)), 0),
4327 End_Label (gnat_node));
4329 /* Now build the tree for the declarations and statements inside this block.
4330 If this is SJLJ, set our jmp_buf as the current buffer. */
4331 start_stmt_group ();
4334 add_stmt (build_call_n_expr (set_jmpbuf_decl, 1,
4335 build_unary_op (ADDR_EXPR, NULL_TREE,
4338 if (Present (First_Real_Statement (gnat_node)))
4339 process_decls (Statements (gnat_node), Empty,
4340 First_Real_Statement (gnat_node), true, true);
4342 /* Generate code for each statement in the block. */
4343 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
4344 ? First_Real_Statement (gnat_node)
4345 : First (Statements (gnat_node)));
4346 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4347 add_stmt (gnat_to_gnu (gnat_temp));
4348 gnu_inner_block = end_stmt_group ();
4350 /* Now generate code for the two exception models, if either is relevant for
4354 tree *gnu_else_ptr = 0;
4357 /* Make a binding level for the exception handling declarations and code
4358 and set up gnu_except_ptr_stack for the handlers to use. */
4359 start_stmt_group ();
4362 VEC_safe_push (tree, gc, gnu_except_ptr_stack,
4363 create_var_decl (get_identifier ("EXCEPT_PTR"), NULL_TREE,
4364 build_pointer_type (except_type_node),
4365 build_call_n_expr (get_excptr_decl, 0),
4366 false, false, false, false,
4369 /* Generate code for each handler. The N_Exception_Handler case does the
4370 real work and returns a COND_EXPR for each handler, which we chain
4372 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
4373 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
4375 gnu_expr = gnat_to_gnu (gnat_temp);
4377 /* If this is the first one, set it as the outer one. Otherwise,
4378 point the "else" part of the previous handler to us. Then point
4379 to our "else" part. */
4381 add_stmt (gnu_expr);
4383 *gnu_else_ptr = gnu_expr;
4385 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4388 /* If none of the exception handlers did anything, re-raise but do not
4390 gnu_expr = build_call_n_expr (raise_nodefer_decl, 1,
4391 VEC_last (tree, gnu_except_ptr_stack));
4392 set_expr_location_from_node
4394 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
4397 *gnu_else_ptr = gnu_expr;
4399 add_stmt (gnu_expr);
4401 /* End the binding level dedicated to the exception handlers and get the
4402 whole statement group. */
4403 VEC_pop (tree, gnu_except_ptr_stack);
4405 gnu_handler = end_stmt_group ();
4407 /* If the setjmp returns 1, we restore our incoming longjmp value and
4408 then check the handlers. */
4409 start_stmt_group ();
4410 add_stmt_with_node (build_call_n_expr (set_jmpbuf_decl, 1,
4413 add_stmt (gnu_handler);
4414 gnu_handler = end_stmt_group ();
4416 /* This block is now "if (setjmp) ... <handlers> else <block>". */
4417 gnu_result = build3 (COND_EXPR, void_type_node,
4420 build_unary_op (ADDR_EXPR, NULL_TREE,
4422 gnu_handler, gnu_inner_block);
4428 /* First make a block containing the handlers. */
4429 start_stmt_group ();
4430 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
4431 Present (gnat_temp);
4432 gnat_temp = Next_Non_Pragma (gnat_temp))
4433 add_stmt (gnat_to_gnu (gnat_temp));
4434 gnu_handlers = end_stmt_group ();
4436 /* Now make the TRY_CATCH_EXPR for the block. */
4437 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
4438 gnu_inner_block, gnu_handlers);
4441 gnu_result = gnu_inner_block;
4443 /* Now close our outer block, if we had to make one. */
4444 if (binding_for_block)
4446 add_stmt (gnu_result);
4448 gnu_result = end_stmt_group ();
4454 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4455 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
4456 exception handling. */
4459 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
4461 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
4462 an "if" statement to select the proper exceptions. For "Others", exclude
4463 exceptions where Handled_By_Others is nonzero unless the All_Others flag
4464 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
4465 tree gnu_choice = boolean_false_node;
4466 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
4469 for (gnat_temp = First (Exception_Choices (gnat_node));
4470 gnat_temp; gnat_temp = Next (gnat_temp))
4474 if (Nkind (gnat_temp) == N_Others_Choice)
4476 if (All_Others (gnat_temp))
4477 this_choice = boolean_true_node;
4481 (EQ_EXPR, boolean_type_node,
4486 (INDIRECT_REF, NULL_TREE,
4487 VEC_last (tree, gnu_except_ptr_stack)),
4488 get_identifier ("not_handled_by_others"), NULL_TREE,
4493 else if (Nkind (gnat_temp) == N_Identifier
4494 || Nkind (gnat_temp) == N_Expanded_Name)
4496 Entity_Id gnat_ex_id = Entity (gnat_temp);
4499 /* Exception may be a renaming. Recover original exception which is
4500 the one elaborated and registered. */
4501 if (Present (Renamed_Object (gnat_ex_id)))
4502 gnat_ex_id = Renamed_Object (gnat_ex_id);
4504 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
4508 (EQ_EXPR, boolean_type_node,
4509 VEC_last (tree, gnu_except_ptr_stack),
4510 convert (TREE_TYPE (VEC_last (tree, gnu_except_ptr_stack)),
4511 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
4513 /* If this is the distinguished exception "Non_Ada_Error" (and we are
4514 in VMS mode), also allow a non-Ada exception (a VMS condition) t
4516 if (Is_Non_Ada_Error (Entity (gnat_temp)))
4519 = build_component_ref
4520 (build_unary_op (INDIRECT_REF, NULL_TREE,
4521 VEC_last (tree, gnu_except_ptr_stack)),
4522 get_identifier ("lang"), NULL_TREE, false);
4526 (TRUTH_ORIF_EXPR, boolean_type_node,
4527 build_binary_op (EQ_EXPR, boolean_type_node, gnu_comp,
4528 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
4535 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
4536 gnu_choice, this_choice);
4539 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
4542 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4543 to a GCC tree, which is returned. This is the variant for ZCX. */
4546 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
4548 tree gnu_etypes_list = NULL_TREE;
4551 tree gnu_current_exc_ptr;
4552 tree prev_gnu_incoming_exc_ptr;
4555 /* We build a TREE_LIST of nodes representing what exception types this
4556 handler can catch, with special cases for others and all others cases.
4558 Each exception type is actually identified by a pointer to the exception
4559 id, or to a dummy object for "others" and "all others". */
4560 for (gnat_temp = First (Exception_Choices (gnat_node));
4561 gnat_temp; gnat_temp = Next (gnat_temp))
4563 if (Nkind (gnat_temp) == N_Others_Choice)
4566 = All_Others (gnat_temp) ? all_others_decl : others_decl;
4569 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
4571 else if (Nkind (gnat_temp) == N_Identifier
4572 || Nkind (gnat_temp) == N_Expanded_Name)
4574 Entity_Id gnat_ex_id = Entity (gnat_temp);
4576 /* Exception may be a renaming. Recover original exception which is
4577 the one elaborated and registered. */
4578 if (Present (Renamed_Object (gnat_ex_id)))
4579 gnat_ex_id = Renamed_Object (gnat_ex_id);
4581 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
4582 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
4584 /* The Non_Ada_Error case for VMS exceptions is handled
4585 by the personality routine. */
4590 /* The GCC interface expects NULL to be passed for catch all handlers, so
4591 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
4592 is integer_zero_node. It would not work, however, because GCC's
4593 notion of "catch all" is stronger than our notion of "others". Until
4594 we correctly use the cleanup interface as well, doing that would
4595 prevent the "all others" handlers from being seen, because nothing
4596 can be caught beyond a catch all from GCC's point of view. */
4597 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
4600 start_stmt_group ();
4603 /* Expand a call to the begin_handler hook at the beginning of the handler,
4604 and arrange for a call to the end_handler hook to occur on every possible
4607 The hooks expect a pointer to the low level occurrence. This is required
4608 for our stack management scheme because a raise inside the handler pushes
4609 a new occurrence on top of the stack, which means that this top does not
4610 necessarily match the occurrence this handler was dealing with.
4612 __builtin_eh_pointer references the exception occurrence being
4613 propagated. Upon handler entry, this is the exception for which the
4614 handler is triggered. This might not be the case upon handler exit,
4615 however, as we might have a new occurrence propagated by the handler's
4616 body, and the end_handler hook called as a cleanup in this context.
4618 We use a local variable to retrieve the incoming value at handler entry
4619 time, and reuse it to feed the end_handler hook's argument at exit. */
4622 = build_call_expr (builtin_decl_explicit (BUILT_IN_EH_POINTER),
4623 1, integer_zero_node);
4624 prev_gnu_incoming_exc_ptr = gnu_incoming_exc_ptr;
4625 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
4626 ptr_type_node, gnu_current_exc_ptr,
4627 false, false, false, false,
4630 add_stmt_with_node (build_call_n_expr (begin_handler_decl, 1,
4631 gnu_incoming_exc_ptr),
4633 /* ??? We don't seem to have an End_Label at hand to set the location. */
4634 add_cleanup (build_call_n_expr (end_handler_decl, 1, gnu_incoming_exc_ptr),
4636 add_stmt_list (Statements (gnat_node));
4639 gnu_incoming_exc_ptr = prev_gnu_incoming_exc_ptr;
4641 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
4645 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
4648 Compilation_Unit_to_gnu (Node_Id gnat_node)
4650 const Node_Id gnat_unit = Unit (gnat_node);
4651 const bool body_p = (Nkind (gnat_unit) == N_Package_Body
4652 || Nkind (gnat_unit) == N_Subprogram_Body);
4653 const Entity_Id gnat_unit_entity = Defining_Entity (gnat_unit);
4654 /* Make the decl for the elaboration procedure. */
4655 tree gnu_elab_proc_decl
4656 = create_subprog_decl
4657 (create_concat_name (gnat_unit_entity, body_p ? "elabb" : "elabs"),
4658 NULL_TREE, void_ftype, NULL_TREE, false, true, false, true, NULL,
4660 struct elab_info *info;
4662 VEC_safe_push (tree, gc, gnu_elab_proc_stack, gnu_elab_proc_decl);
4663 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
4665 /* Initialize the information structure for the function. */
4666 allocate_struct_function (gnu_elab_proc_decl, false);
4669 current_function_decl = NULL_TREE;
4671 start_stmt_group ();
4674 /* For a body, first process the spec if there is one. */
4675 if (Nkind (gnat_unit) == N_Package_Body
4676 || (Nkind (gnat_unit) == N_Subprogram_Body && !Acts_As_Spec (gnat_node)))
4677 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
4679 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
4681 elaborate_all_entities (gnat_node);
4683 if (Nkind (gnat_unit) == N_Subprogram_Declaration
4684 || Nkind (gnat_unit) == N_Generic_Package_Declaration
4685 || Nkind (gnat_unit) == N_Generic_Subprogram_Declaration)
4689 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
4691 add_stmt (gnat_to_gnu (gnat_unit));
4693 /* If we can inline, generate code for all the inlined subprograms. */
4696 Entity_Id gnat_entity;
4698 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
4699 Present (gnat_entity);
4700 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
4702 Node_Id gnat_body = Parent (Declaration_Node (gnat_entity));
4704 if (Nkind (gnat_body) != N_Subprogram_Body)
4706 /* ??? This really should always be present. */
4707 if (No (Corresponding_Body (gnat_body)))
4710 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
4713 if (Present (gnat_body))
4715 /* Define the entity first so we set DECL_EXTERNAL. */
4716 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
4717 add_stmt (gnat_to_gnu (gnat_body));
4722 /* Process any pragmas and actions following the unit. */
4723 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
4724 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
4725 finalize_from_with_types ();
4727 /* Save away what we've made so far and record this potential elaboration
4729 info = ggc_alloc_elab_info ();
4730 set_current_block_context (gnu_elab_proc_decl);
4732 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
4734 set_end_locus_from_node (gnu_elab_proc_decl, gnat_unit);
4736 info->next = elab_info_list;
4737 info->elab_proc = gnu_elab_proc_decl;
4738 info->gnat_node = gnat_node;
4739 elab_info_list = info;
4741 /* Generate elaboration code for this unit, if necessary, and say whether
4743 VEC_pop (tree, gnu_elab_proc_stack);
4745 /* Invalidate the global renaming pointers. This is necessary because
4746 stabilization of the renamed entities may create SAVE_EXPRs which
4747 have been tied to a specific elaboration routine just above. */
4748 invalidate_global_renaming_pointers ();
4751 /* Return true if GNAT_NODE is on the LHS of an assignment or an actual
4752 parameter of a call. */
4755 lhs_or_actual_p (Node_Id gnat_node)
4757 Node_Id gnat_parent = Parent (gnat_node);
4758 Node_Kind kind = Nkind (gnat_parent);
4760 if (kind == N_Assignment_Statement && Name (gnat_parent) == gnat_node)
4763 if ((kind == N_Procedure_Call_Statement || kind == N_Function_Call)
4764 && Name (gnat_parent) != gnat_node)
4767 if (kind == N_Parameter_Association)
4773 /* Return true if either GNAT_NODE or a view of GNAT_NODE is on the LHS
4774 of an assignment or an actual parameter of a call. */
4777 present_in_lhs_or_actual_p (Node_Id gnat_node)
4781 if (lhs_or_actual_p (gnat_node))
4784 kind = Nkind (Parent (gnat_node));
4786 if ((kind == N_Type_Conversion || kind == N_Unchecked_Type_Conversion)
4787 && lhs_or_actual_p (Parent (gnat_node)))
4793 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
4794 as gigi is concerned. This is used to avoid conversions on the LHS. */
4797 unchecked_conversion_nop (Node_Id gnat_node)
4799 Entity_Id from_type, to_type;
4801 /* The conversion must be on the LHS of an assignment or an actual parameter
4802 of a call. Otherwise, even if the conversion was essentially a no-op, it
4803 could de facto ensure type consistency and this should be preserved. */
4804 if (!lhs_or_actual_p (gnat_node))
4807 from_type = Etype (Expression (gnat_node));
4809 /* We're interested in artificial conversions generated by the front-end
4810 to make private types explicit, e.g. in Expand_Assign_Array. */
4811 if (!Is_Private_Type (from_type))
4814 from_type = Underlying_Type (from_type);
4815 to_type = Etype (gnat_node);
4817 /* The direct conversion to the underlying type is a no-op. */
4818 if (to_type == from_type)
4821 /* For an array subtype, the conversion to the PAT is a no-op. */
4822 if (Ekind (from_type) == E_Array_Subtype
4823 && to_type == Packed_Array_Type (from_type))
4826 /* For a record subtype, the conversion to the type is a no-op. */
4827 if (Ekind (from_type) == E_Record_Subtype
4828 && to_type == Etype (from_type))
4834 /* This function is the driver of the GNAT to GCC tree transformation process.
4835 It is the entry point of the tree transformer. GNAT_NODE is the root of
4836 some GNAT tree. Return the root of the corresponding GCC tree. If this
4837 is an expression, return the GCC equivalent of the expression. If this
4838 is a statement, return the statement or add it to the current statement
4839 group, in which case anything returned is to be interpreted as occurring
4840 after anything added. */
4843 gnat_to_gnu (Node_Id gnat_node)
4845 const Node_Kind kind = Nkind (gnat_node);
4846 bool went_into_elab_proc = false;
4847 tree gnu_result = error_mark_node; /* Default to no value. */
4848 tree gnu_result_type = void_type_node;
4849 tree gnu_expr, gnu_lhs, gnu_rhs;
4852 /* Save node number for error message and set location information. */
4853 error_gnat_node = gnat_node;
4854 Sloc_to_locus (Sloc (gnat_node), &input_location);
4856 /* If this node is a statement and we are only annotating types, return an
4857 empty statement list. */
4858 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
4859 return alloc_stmt_list ();
4861 /* If this node is a non-static subexpression and we are only annotating
4862 types, make this into a NULL_EXPR. */
4863 if (type_annotate_only
4864 && IN (kind, N_Subexpr)
4865 && kind != N_Identifier
4866 && !Compile_Time_Known_Value (gnat_node))
4867 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
4868 build_call_raise (CE_Range_Check_Failed, gnat_node,
4869 N_Raise_Constraint_Error));
4871 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
4872 && kind != N_Null_Statement)
4873 || kind == N_Procedure_Call_Statement
4875 || kind == N_Implicit_Label_Declaration
4876 || kind == N_Handled_Sequence_Of_Statements
4877 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
4879 tree current_elab_proc = get_elaboration_procedure ();
4881 /* If this is a statement and we are at top level, it must be part of
4882 the elaboration procedure, so mark us as being in that procedure. */
4883 if (!current_function_decl)
4885 current_function_decl = current_elab_proc;
4886 went_into_elab_proc = true;
4889 /* If we are in the elaboration procedure, check if we are violating a
4890 No_Elaboration_Code restriction by having a statement there. Don't
4891 check for a possible No_Elaboration_Code restriction violation on
4892 N_Handled_Sequence_Of_Statements, as we want to signal an error on
4893 every nested real statement instead. This also avoids triggering
4894 spurious errors on dummy (empty) sequences created by the front-end
4895 for package bodies in some cases. */
4896 if (current_function_decl == current_elab_proc
4897 && kind != N_Handled_Sequence_Of_Statements)
4898 Check_Elaboration_Code_Allowed (gnat_node);
4903 /********************************/
4904 /* Chapter 2: Lexical Elements */
4905 /********************************/
4908 case N_Expanded_Name:
4909 case N_Operator_Symbol:
4910 case N_Defining_Identifier:
4911 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
4913 /* If this is an atomic access on the RHS for which synchronization is
4914 required, build the atomic load. */
4915 if (atomic_sync_required_p (gnat_node)
4916 && !present_in_lhs_or_actual_p (gnat_node))
4917 gnu_result = build_atomic_load (gnu_result);
4920 case N_Integer_Literal:
4924 /* Get the type of the result, looking inside any padding and
4925 justified modular types. Then get the value in that type. */
4926 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4928 if (TREE_CODE (gnu_type) == RECORD_TYPE
4929 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
4930 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
4932 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
4934 /* If the result overflows (meaning it doesn't fit in its base type),
4935 abort. We would like to check that the value is within the range
4936 of the subtype, but that causes problems with subtypes whose usage
4937 will raise Constraint_Error and with biased representation, so
4939 gcc_assert (!TREE_OVERFLOW (gnu_result));
4943 case N_Character_Literal:
4944 /* If a Entity is present, it means that this was one of the
4945 literals in a user-defined character type. In that case,
4946 just return the value in the CONST_DECL. Otherwise, use the
4947 character code. In that case, the base type should be an
4948 INTEGER_TYPE, but we won't bother checking for that. */
4949 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4950 if (Present (Entity (gnat_node)))
4951 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
4954 = build_int_cst_type
4955 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
4958 case N_Real_Literal:
4959 /* If this is of a fixed-point type, the value we want is the
4960 value of the corresponding integer. */
4961 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
4963 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4964 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
4966 gcc_assert (!TREE_OVERFLOW (gnu_result));
4969 /* We should never see a Vax_Float type literal, since the front end
4970 is supposed to transform these using appropriate conversions. */
4971 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
4976 Ureal ur_realval = Realval (gnat_node);
4978 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4980 /* If the real value is zero, so is the result. Otherwise,
4981 convert it to a machine number if it isn't already. That
4982 forces BASE to 0 or 2 and simplifies the rest of our logic. */
4983 if (UR_Is_Zero (ur_realval))
4984 gnu_result = convert (gnu_result_type, integer_zero_node);
4987 if (!Is_Machine_Number (gnat_node))
4989 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
4990 ur_realval, Round_Even, gnat_node);
4993 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
4995 /* If we have a base of zero, divide by the denominator.
4996 Otherwise, the base must be 2 and we scale the value, which
4997 we know can fit in the mantissa of the type (hence the use
4998 of that type above). */
4999 if (No (Rbase (ur_realval)))
5001 = build_binary_op (RDIV_EXPR,
5002 get_base_type (gnu_result_type),
5004 UI_To_gnu (Denominator (ur_realval),
5008 REAL_VALUE_TYPE tmp;
5010 gcc_assert (Rbase (ur_realval) == 2);
5011 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
5012 - UI_To_Int (Denominator (ur_realval)));
5013 gnu_result = build_real (gnu_result_type, tmp);
5017 /* Now see if we need to negate the result. Do it this way to
5018 properly handle -0. */
5019 if (UR_Is_Negative (Realval (gnat_node)))
5021 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
5027 case N_String_Literal:
5028 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5029 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
5031 String_Id gnat_string = Strval (gnat_node);
5032 int length = String_Length (gnat_string);
5035 if (length >= ALLOCA_THRESHOLD)
5036 string = XNEWVEC (char, length + 1);
5038 string = (char *) alloca (length + 1);
5040 /* Build the string with the characters in the literal. Note
5041 that Ada strings are 1-origin. */
5042 for (i = 0; i < length; i++)
5043 string[i] = Get_String_Char (gnat_string, i + 1);
5045 /* Put a null at the end of the string in case it's in a context
5046 where GCC will want to treat it as a C string. */
5049 gnu_result = build_string (length, string);
5051 /* Strings in GCC don't normally have types, but we want
5052 this to not be converted to the array type. */
5053 TREE_TYPE (gnu_result) = gnu_result_type;
5055 if (length >= ALLOCA_THRESHOLD)
5060 /* Build a list consisting of each character, then make
5062 String_Id gnat_string = Strval (gnat_node);
5063 int length = String_Length (gnat_string);
5065 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
5066 VEC(constructor_elt,gc) *gnu_vec
5067 = VEC_alloc (constructor_elt, gc, length);
5069 for (i = 0; i < length; i++)
5071 tree t = build_int_cst (TREE_TYPE (gnu_result_type),
5072 Get_String_Char (gnat_string, i + 1));
5074 CONSTRUCTOR_APPEND_ELT (gnu_vec, gnu_idx, t);
5075 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node);
5078 gnu_result = gnat_build_constructor (gnu_result_type, gnu_vec);
5083 gnu_result = Pragma_to_gnu (gnat_node);
5086 /**************************************/
5087 /* Chapter 3: Declarations and Types */
5088 /**************************************/
5090 case N_Subtype_Declaration:
5091 case N_Full_Type_Declaration:
5092 case N_Incomplete_Type_Declaration:
5093 case N_Private_Type_Declaration:
5094 case N_Private_Extension_Declaration:
5095 case N_Task_Type_Declaration:
5096 process_type (Defining_Entity (gnat_node));
5097 gnu_result = alloc_stmt_list ();
5100 case N_Object_Declaration:
5101 case N_Exception_Declaration:
5102 gnat_temp = Defining_Entity (gnat_node);
5103 gnu_result = alloc_stmt_list ();
5105 /* If we are just annotating types and this object has an unconstrained
5106 or task type, don't elaborate it. */
5107 if (type_annotate_only
5108 && (((Is_Array_Type (Etype (gnat_temp))
5109 || Is_Record_Type (Etype (gnat_temp)))
5110 && !Is_Constrained (Etype (gnat_temp)))
5111 || Is_Concurrent_Type (Etype (gnat_temp))))
5114 if (Present (Expression (gnat_node))
5115 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
5116 && (!type_annotate_only
5117 || Compile_Time_Known_Value (Expression (gnat_node))))
5119 gnu_expr = gnat_to_gnu (Expression (gnat_node));
5120 if (Do_Range_Check (Expression (gnat_node)))
5122 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
5124 /* If this object has its elaboration delayed, we must force
5125 evaluation of GNU_EXPR right now and save it for when the object
5127 if (Present (Freeze_Node (gnat_temp)))
5129 if (TREE_CONSTANT (gnu_expr))
5131 else if (global_bindings_p ())
5133 = create_var_decl (create_concat_name (gnat_temp, "init"),
5134 NULL_TREE, TREE_TYPE (gnu_expr), gnu_expr,
5135 false, false, false, false,
5138 gnu_expr = gnat_save_expr (gnu_expr);
5140 save_gnu_tree (gnat_node, gnu_expr, true);
5144 gnu_expr = NULL_TREE;
5146 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
5147 gnu_expr = NULL_TREE;
5149 /* If this is a deferred constant with an address clause, we ignore the
5150 full view since the clause is on the partial view and we cannot have
5151 2 different GCC trees for the object. The only bits of the full view
5152 we will use is the initializer, but it will be directly fetched. */
5153 if (Ekind(gnat_temp) == E_Constant
5154 && Present (Address_Clause (gnat_temp))
5155 && Present (Full_View (gnat_temp)))
5156 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
5158 if (No (Freeze_Node (gnat_temp)))
5159 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
5162 case N_Object_Renaming_Declaration:
5163 gnat_temp = Defining_Entity (gnat_node);
5165 /* Don't do anything if this renaming is handled by the front end or if
5166 we are just annotating types and this object has a composite or task
5167 type, don't elaborate it. We return the result in case it has any
5168 SAVE_EXPRs in it that need to be evaluated here. */
5169 if (!Is_Renaming_Of_Object (gnat_temp)
5170 && ! (type_annotate_only
5171 && (Is_Array_Type (Etype (gnat_temp))
5172 || Is_Record_Type (Etype (gnat_temp))
5173 || Is_Concurrent_Type (Etype (gnat_temp)))))
5175 = gnat_to_gnu_entity (gnat_temp,
5176 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
5178 gnu_result = alloc_stmt_list ();
5181 case N_Implicit_Label_Declaration:
5182 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
5183 gnu_result = alloc_stmt_list ();
5186 case N_Exception_Renaming_Declaration:
5187 case N_Number_Declaration:
5188 case N_Package_Renaming_Declaration:
5189 case N_Subprogram_Renaming_Declaration:
5190 /* These are fully handled in the front end. */
5191 gnu_result = alloc_stmt_list ();
5194 /*************************************/
5195 /* Chapter 4: Names and Expressions */
5196 /*************************************/
5198 case N_Explicit_Dereference:
5199 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5200 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5201 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
5203 /* If this is an atomic access on the RHS for which synchronization is
5204 required, build the atomic load. */
5205 if (atomic_sync_required_p (gnat_node)
5206 && !present_in_lhs_or_actual_p (gnat_node))
5207 gnu_result = build_atomic_load (gnu_result);
5210 case N_Indexed_Component:
5212 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
5216 Node_Id *gnat_expr_array;
5218 gnu_array_object = maybe_implicit_deref (gnu_array_object);
5220 /* Convert vector inputs to their representative array type, to fit
5221 what the code below expects. */
5222 gnu_array_object = maybe_vector_array (gnu_array_object);
5224 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
5226 /* If we got a padded type, remove it too. */
5227 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
5229 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
5232 gnu_result = gnu_array_object;
5234 /* First compute the number of dimensions of the array, then
5235 fill the expression array, the order depending on whether
5236 this is a Convention_Fortran array or not. */
5237 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
5238 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
5239 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
5240 ndim++, gnu_type = TREE_TYPE (gnu_type))
5243 gnat_expr_array = XALLOCAVEC (Node_Id, ndim);
5245 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
5246 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
5248 i--, gnat_temp = Next (gnat_temp))
5249 gnat_expr_array[i] = gnat_temp;
5251 for (i = 0, gnat_temp = First (Expressions (gnat_node));
5253 i++, gnat_temp = Next (gnat_temp))
5254 gnat_expr_array[i] = gnat_temp;
5256 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
5257 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
5259 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
5260 gnat_temp = gnat_expr_array[i];
5261 gnu_expr = gnat_to_gnu (gnat_temp);
5263 if (Do_Range_Check (gnat_temp))
5266 (gnu_array_object, gnu_expr,
5267 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
5268 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
5271 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
5272 gnu_result, gnu_expr);
5275 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5277 /* If this is an atomic access on the RHS for which synchronization is
5278 required, build the atomic load. */
5279 if (atomic_sync_required_p (gnat_node)
5280 && !present_in_lhs_or_actual_p (gnat_node))
5281 gnu_result = build_atomic_load (gnu_result);
5287 Node_Id gnat_range_node = Discrete_Range (gnat_node);
5290 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5291 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5293 /* Do any implicit dereferences of the prefix and do any needed
5295 gnu_result = maybe_implicit_deref (gnu_result);
5296 gnu_result = maybe_unconstrained_array (gnu_result);
5297 gnu_type = TREE_TYPE (gnu_result);
5298 if (Do_Range_Check (gnat_range_node))
5300 /* Get the bounds of the slice. */
5302 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
5303 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
5304 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
5305 /* Get the permitted bounds. */
5306 tree gnu_base_index_type
5307 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
5308 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5309 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
5310 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5311 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
5312 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
5314 gnu_min_expr = gnat_protect_expr (gnu_min_expr);
5315 gnu_max_expr = gnat_protect_expr (gnu_max_expr);
5317 /* Derive a good type to convert everything to. */
5318 gnu_expr_type = get_base_type (gnu_index_type);
5320 /* Test whether the minimum slice value is too small. */
5321 gnu_expr_l = build_binary_op (LT_EXPR, boolean_type_node,
5322 convert (gnu_expr_type,
5324 convert (gnu_expr_type,
5325 gnu_base_min_expr));
5327 /* Test whether the maximum slice value is too large. */
5328 gnu_expr_h = build_binary_op (GT_EXPR, boolean_type_node,
5329 convert (gnu_expr_type,
5331 convert (gnu_expr_type,
5332 gnu_base_max_expr));
5334 /* Build a slice index check that returns the low bound,
5335 assuming the slice is not empty. */
5336 gnu_expr = emit_check
5337 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
5338 gnu_expr_l, gnu_expr_h),
5339 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
5341 /* Build a conditional expression that does the index checks and
5342 returns the low bound if the slice is not empty (max >= min),
5343 and returns the naked low bound otherwise (max < min), unless
5344 it is non-constant and the high bound is; this prevents VRP
5345 from inferring bogus ranges on the unlikely path. */
5346 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
5347 build_binary_op (GE_EXPR, gnu_expr_type,
5348 convert (gnu_expr_type,
5350 convert (gnu_expr_type,
5353 TREE_CODE (gnu_min_expr) != INTEGER_CST
5354 && TREE_CODE (gnu_max_expr) == INTEGER_CST
5355 ? gnu_max_expr : gnu_min_expr);
5358 /* Simply return the naked low bound. */
5359 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
5361 /* If this is a slice with non-constant size of an array with constant
5362 size, set the maximum size for the allocation of temporaries. */
5363 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
5364 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
5365 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
5367 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
5368 gnu_result, gnu_expr);
5372 case N_Selected_Component:
5374 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
5375 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
5376 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
5379 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
5380 || IN (Ekind (gnat_pref_type), Access_Kind))
5382 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
5383 gnat_pref_type = Underlying_Type (gnat_pref_type);
5384 else if (IN (Ekind (gnat_pref_type), Access_Kind))
5385 gnat_pref_type = Designated_Type (gnat_pref_type);
5388 gnu_prefix = maybe_implicit_deref (gnu_prefix);
5390 /* For discriminant references in tagged types always substitute the
5391 corresponding discriminant as the actual selected component. */
5392 if (Is_Tagged_Type (gnat_pref_type))
5393 while (Present (Corresponding_Discriminant (gnat_field)))
5394 gnat_field = Corresponding_Discriminant (gnat_field);
5396 /* For discriminant references of untagged types always substitute the
5397 corresponding stored discriminant. */
5398 else if (Present (Corresponding_Discriminant (gnat_field)))
5399 gnat_field = Original_Record_Component (gnat_field);
5401 /* Handle extracting the real or imaginary part of a complex.
5402 The real part is the first field and the imaginary the last. */
5403 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
5404 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
5405 ? REALPART_EXPR : IMAGPART_EXPR,
5406 NULL_TREE, gnu_prefix);
5409 gnu_field = gnat_to_gnu_field_decl (gnat_field);
5411 /* If there are discriminants, the prefix might be evaluated more
5412 than once, which is a problem if it has side-effects. */
5413 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
5414 ? Designated_Type (Etype
5415 (Prefix (gnat_node)))
5416 : Etype (Prefix (gnat_node))))
5417 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL);
5420 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
5421 (Nkind (Parent (gnat_node))
5422 == N_Attribute_Reference)
5423 && lvalue_required_for_attribute_p
5424 (Parent (gnat_node)));
5427 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5429 /* If this is an atomic access on the RHS for which synchronization is
5430 required, build the atomic load. */
5431 if (atomic_sync_required_p (gnat_node)
5432 && !present_in_lhs_or_actual_p (gnat_node))
5433 gnu_result = build_atomic_load (gnu_result);
5437 case N_Attribute_Reference:
5439 /* The attribute designator. */
5440 const int attr = Get_Attribute_Id (Attribute_Name (gnat_node));
5442 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
5443 is a unit, not an object with a GCC equivalent. */
5444 if (attr == Attr_Elab_Spec || attr == Attr_Elab_Body)
5446 create_subprog_decl (create_concat_name
5447 (Entity (Prefix (gnat_node)),
5448 attr == Attr_Elab_Body ? "elabb" : "elabs"),
5449 NULL_TREE, void_ftype, NULL_TREE, false,
5450 true, true, true, NULL, gnat_node);
5452 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attr);
5457 /* Like 'Access as far as we are concerned. */
5458 gnu_result = gnat_to_gnu (Prefix (gnat_node));
5459 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
5460 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5464 case N_Extension_Aggregate:
5468 /* ??? It is wrong to evaluate the type now, but there doesn't
5469 seem to be any other practical way of doing it. */
5471 gcc_assert (!Expansion_Delayed (gnat_node));
5473 gnu_aggr_type = gnu_result_type
5474 = get_unpadded_type (Etype (gnat_node));
5476 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
5477 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
5479 = TREE_TYPE (DECL_CHAIN (TYPE_FIELDS (gnu_result_type)));
5480 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
5481 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
5483 if (Null_Record_Present (gnat_node))
5484 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL);
5486 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
5487 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
5489 = assoc_to_constructor (Etype (gnat_node),
5490 First (Component_Associations (gnat_node)),
5492 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
5493 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
5495 Component_Type (Etype (gnat_node)));
5496 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
5499 (COMPLEX_EXPR, gnu_aggr_type,
5500 gnat_to_gnu (Expression (First
5501 (Component_Associations (gnat_node)))),
5502 gnat_to_gnu (Expression
5504 (First (Component_Associations (gnat_node))))));
5508 gnu_result = convert (gnu_result_type, gnu_result);
5513 if (TARGET_VTABLE_USES_DESCRIPTORS
5514 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
5515 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
5516 gnu_result = null_fdesc_node;
5518 gnu_result = null_pointer_node;
5519 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5522 case N_Type_Conversion:
5523 case N_Qualified_Expression:
5524 /* Get the operand expression. */
5525 gnu_result = gnat_to_gnu (Expression (gnat_node));
5526 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5528 /* If this is a qualified expression for a tagged type, we mark the type
5529 as used. Because of polymorphism, this might be the only reference to
5530 the tagged type in the program while objects have it as dynamic type.
5531 The debugger needs to see it to display these objects properly. */
5532 if (kind == N_Qualified_Expression && Is_Tagged_Type (Etype (gnat_node)))
5533 used_types_insert (gnu_result_type);
5536 = convert_with_check (Etype (gnat_node), gnu_result,
5537 Do_Overflow_Check (gnat_node),
5538 Do_Range_Check (Expression (gnat_node)),
5539 kind == N_Type_Conversion
5540 && Float_Truncate (gnat_node), gnat_node);
5543 case N_Unchecked_Type_Conversion:
5544 gnu_result = gnat_to_gnu (Expression (gnat_node));
5546 /* Skip further processing if the conversion is deemed a no-op. */
5547 if (unchecked_conversion_nop (gnat_node))
5549 gnu_result_type = TREE_TYPE (gnu_result);
5553 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5555 /* If the result is a pointer type, see if we are improperly
5556 converting to a stricter alignment. */
5557 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
5558 && IN (Ekind (Etype (gnat_node)), Access_Kind))
5560 unsigned int align = known_alignment (gnu_result);
5561 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
5562 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
5564 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
5565 post_error_ne_tree_2
5566 ("?source alignment (^) '< alignment of & (^)",
5567 gnat_node, Designated_Type (Etype (gnat_node)),
5568 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
5571 /* If we are converting a descriptor to a function pointer, first
5572 build the pointer. */
5573 if (TARGET_VTABLE_USES_DESCRIPTORS
5574 && TREE_TYPE (gnu_result) == fdesc_type_node
5575 && POINTER_TYPE_P (gnu_result_type))
5576 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
5578 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
5579 No_Truncation (gnat_node));
5585 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
5586 Node_Id gnat_range = Right_Opnd (gnat_node);
5587 tree gnu_low, gnu_high;
5589 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
5591 if (Nkind (gnat_range) == N_Range)
5593 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
5594 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
5596 else if (Nkind (gnat_range) == N_Identifier
5597 || Nkind (gnat_range) == N_Expanded_Name)
5599 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
5601 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
5602 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
5607 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5609 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
5610 ensure that GNU_OBJ is evaluated only once and perform a full range
5612 if (operand_equal_p (gnu_low, gnu_high, 0))
5614 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
5618 gnu_obj = gnat_protect_expr (gnu_obj);
5619 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
5621 set_expr_location_from_node (t1, gnat_node);
5622 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
5624 set_expr_location_from_node (t2, gnat_node);
5626 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
5629 if (kind == N_Not_In)
5631 = invert_truthvalue_loc (EXPR_LOCATION (gnu_result), gnu_result);
5636 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5637 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5638 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5639 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
5641 : (Rounded_Result (gnat_node)
5642 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
5643 gnu_result_type, gnu_lhs, gnu_rhs);
5646 case N_Op_Or: case N_Op_And: case N_Op_Xor:
5647 /* These can either be operations on booleans or on modular types.
5648 Fall through for boolean types since that's the way GNU_CODES is
5650 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
5651 Modular_Integer_Kind))
5654 = (kind == N_Op_Or ? BIT_IOR_EXPR
5655 : kind == N_Op_And ? BIT_AND_EXPR
5658 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5659 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5660 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5661 gnu_result = build_binary_op (code, gnu_result_type,
5666 /* ... fall through ... */
5668 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
5669 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
5670 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
5671 case N_Op_Mod: case N_Op_Rem:
5672 case N_Op_Rotate_Left:
5673 case N_Op_Rotate_Right:
5674 case N_Op_Shift_Left:
5675 case N_Op_Shift_Right:
5676 case N_Op_Shift_Right_Arithmetic:
5677 case N_And_Then: case N_Or_Else:
5679 enum tree_code code = gnu_codes[kind];
5680 bool ignore_lhs_overflow = false;
5681 location_t saved_location = input_location;
5684 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
5685 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
5686 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
5688 /* Pending generic support for efficient vector logical operations in
5689 GCC, convert vectors to their representative array type view and
5691 gnu_lhs = maybe_vector_array (gnu_lhs);
5692 gnu_rhs = maybe_vector_array (gnu_rhs);
5694 /* If this is a comparison operator, convert any references to
5695 an unconstrained array value into a reference to the
5697 if (TREE_CODE_CLASS (code) == tcc_comparison)
5699 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
5700 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
5703 /* If the result type is a private type, its full view may be a
5704 numeric subtype. The representation we need is that of its base
5705 type, given that it is the result of an arithmetic operation. */
5706 else if (Is_Private_Type (Etype (gnat_node)))
5707 gnu_type = gnu_result_type
5708 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
5710 /* If this is a shift whose count is not guaranteed to be correct,
5711 we need to adjust the shift count. */
5712 if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
5714 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
5716 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
5718 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
5719 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
5720 gnu_rhs, gnu_max_shift);
5721 else if (kind == N_Op_Shift_Right_Arithmetic)
5724 (MIN_EXPR, gnu_count_type,
5725 build_binary_op (MINUS_EXPR,
5728 convert (gnu_count_type,
5733 /* For right shifts, the type says what kind of shift to do,
5734 so we may need to choose a different type. In this case,
5735 we have to ignore integer overflow lest it propagates all
5736 the way down and causes a CE to be explicitly raised. */
5737 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
5739 gnu_type = gnat_unsigned_type (gnu_type);
5740 ignore_lhs_overflow = true;
5742 else if (kind == N_Op_Shift_Right_Arithmetic
5743 && TYPE_UNSIGNED (gnu_type))
5745 gnu_type = gnat_signed_type (gnu_type);
5746 ignore_lhs_overflow = true;
5749 if (gnu_type != gnu_result_type)
5751 tree gnu_old_lhs = gnu_lhs;
5752 gnu_lhs = convert (gnu_type, gnu_lhs);
5753 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
5754 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
5755 gnu_rhs = convert (gnu_type, gnu_rhs);
5758 /* Instead of expanding overflow checks for addition, subtraction
5759 and multiplication itself, the front end will leave this to
5760 the back end when Backend_Overflow_Checks_On_Target is set.
5761 As the GCC back end itself does not know yet how to properly
5762 do overflow checking, do it here. The goal is to push
5763 the expansions further into the back end over time. */
5764 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
5765 && (kind == N_Op_Add
5766 || kind == N_Op_Subtract
5767 || kind == N_Op_Multiply)
5768 && !TYPE_UNSIGNED (gnu_type)
5769 && !FLOAT_TYPE_P (gnu_type))
5770 gnu_result = build_binary_op_trapv (code, gnu_type,
5771 gnu_lhs, gnu_rhs, gnat_node);
5774 /* Some operations, e.g. comparisons of arrays, generate complex
5775 trees that need to be annotated while they are being built. */
5776 input_location = saved_location;
5777 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
5780 /* If this is a logical shift with the shift count not verified,
5781 we must return zero if it is too large. We cannot compensate
5782 above in this case. */
5783 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
5784 && !Shift_Count_OK (gnat_node))
5788 build_binary_op (GE_EXPR, boolean_type_node,
5790 convert (TREE_TYPE (gnu_rhs),
5791 TYPE_SIZE (gnu_type))),
5792 convert (gnu_type, integer_zero_node),
5797 case N_Conditional_Expression:
5799 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
5800 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
5802 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
5804 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5806 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
5811 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
5812 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5816 /* This case can apply to a boolean or a modular type.
5817 Fall through for a boolean operand since GNU_CODES is set
5818 up to handle this. */
5819 if (Is_Modular_Integer_Type (Etype (gnat_node))
5820 || (Ekind (Etype (gnat_node)) == E_Private_Type
5821 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
5823 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
5824 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5825 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
5830 /* ... fall through ... */
5832 case N_Op_Minus: case N_Op_Abs:
5833 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
5835 if (Ekind (Etype (gnat_node)) != E_Private_Type)
5836 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5838 gnu_result_type = get_unpadded_type (Base_Type
5839 (Full_View (Etype (gnat_node))));
5841 if (Do_Overflow_Check (gnat_node)
5842 && !TYPE_UNSIGNED (gnu_result_type)
5843 && !FLOAT_TYPE_P (gnu_result_type))
5845 = build_unary_op_trapv (gnu_codes[kind],
5846 gnu_result_type, gnu_expr, gnat_node);
5848 gnu_result = build_unary_op (gnu_codes[kind],
5849 gnu_result_type, gnu_expr);
5856 bool ignore_init_type = false;
5858 gnat_temp = Expression (gnat_node);
5860 /* The Expression operand can either be an N_Identifier or
5861 Expanded_Name, which must represent a type, or a
5862 N_Qualified_Expression, which contains both the object type and an
5863 initial value for the object. */
5864 if (Nkind (gnat_temp) == N_Identifier
5865 || Nkind (gnat_temp) == N_Expanded_Name)
5866 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
5867 else if (Nkind (gnat_temp) == N_Qualified_Expression)
5869 Entity_Id gnat_desig_type
5870 = Designated_Type (Underlying_Type (Etype (gnat_node)));
5872 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
5873 gnu_init = gnat_to_gnu (Expression (gnat_temp));
5875 gnu_init = maybe_unconstrained_array (gnu_init);
5876 if (Do_Range_Check (Expression (gnat_temp)))
5878 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
5880 if (Is_Elementary_Type (gnat_desig_type)
5881 || Is_Constrained (gnat_desig_type))
5882 gnu_type = gnat_to_gnu_type (gnat_desig_type);
5885 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
5886 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
5887 gnu_type = TREE_TYPE (gnu_init);
5890 /* See the N_Qualified_Expression case for the rationale. */
5891 if (Is_Tagged_Type (gnat_desig_type))
5892 used_types_insert (gnu_type);
5894 gnu_init = convert (gnu_type, gnu_init);
5899 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5900 return build_allocator (gnu_type, gnu_init, gnu_result_type,
5901 Procedure_To_Call (gnat_node),
5902 Storage_Pool (gnat_node), gnat_node,
5907 /**************************/
5908 /* Chapter 5: Statements */
5909 /**************************/
5912 gnu_result = build1 (LABEL_EXPR, void_type_node,
5913 gnat_to_gnu (Identifier (gnat_node)));
5916 case N_Null_Statement:
5917 /* When not optimizing, turn null statements from source into gotos to
5918 the next statement that the middle-end knows how to preserve. */
5919 if (!optimize && Comes_From_Source (gnat_node))
5921 tree stmt, label = create_label_decl (NULL_TREE, gnat_node);
5922 DECL_IGNORED_P (label) = 1;
5923 start_stmt_group ();
5924 stmt = build1 (GOTO_EXPR, void_type_node, label);
5925 set_expr_location_from_node (stmt, gnat_node);
5927 stmt = build1 (LABEL_EXPR, void_type_node, label);
5928 set_expr_location_from_node (stmt, gnat_node);
5930 gnu_result = end_stmt_group ();
5933 gnu_result = alloc_stmt_list ();
5936 case N_Assignment_Statement:
5937 /* Get the LHS and RHS of the statement and convert any reference to an
5938 unconstrained array into a reference to the underlying array. */
5939 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
5941 /* If the type has a size that overflows, convert this into raise of
5942 Storage_Error: execution shouldn't have gotten here anyway. */
5943 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
5944 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
5945 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
5946 N_Raise_Storage_Error);
5947 else if (Nkind (Expression (gnat_node)) == N_Function_Call)
5949 = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs,
5950 atomic_sync_required_p (Name (gnat_node)));
5954 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
5956 /* If range check is needed, emit code to generate it. */
5957 if (Do_Range_Check (Expression (gnat_node)))
5958 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
5961 if (atomic_sync_required_p (Name (gnat_node)))
5962 gnu_result = build_atomic_store (gnu_lhs, gnu_rhs);
5965 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
5967 /* If the type being assigned is an array type and the two sides are
5968 not completely disjoint, play safe and use memmove. But don't do
5969 it for a bit-packed array as it might not be byte-aligned. */
5970 if (TREE_CODE (gnu_result) == MODIFY_EXPR
5971 && Is_Array_Type (Etype (Name (gnat_node)))
5972 && !Is_Bit_Packed_Array (Etype (Name (gnat_node)))
5973 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
5975 tree to, from, size, to_ptr, from_ptr, t;
5977 to = TREE_OPERAND (gnu_result, 0);
5978 from = TREE_OPERAND (gnu_result, 1);
5980 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
5981 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
5983 to_ptr = build_fold_addr_expr (to);
5984 from_ptr = build_fold_addr_expr (from);
5986 t = builtin_decl_implicit (BUILT_IN_MEMMOVE);
5987 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
5992 case N_If_Statement:
5994 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
5996 /* Make the outer COND_EXPR. Avoid non-determinism. */
5997 gnu_result = build3 (COND_EXPR, void_type_node,
5998 gnat_to_gnu (Condition (gnat_node)),
5999 NULL_TREE, NULL_TREE);
6000 COND_EXPR_THEN (gnu_result)
6001 = build_stmt_group (Then_Statements (gnat_node), false);
6002 TREE_SIDE_EFFECTS (gnu_result) = 1;
6003 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
6005 /* Now make a COND_EXPR for each of the "else if" parts. Put each
6006 into the previous "else" part and point to where to put any
6007 outer "else". Also avoid non-determinism. */
6008 if (Present (Elsif_Parts (gnat_node)))
6009 for (gnat_temp = First (Elsif_Parts (gnat_node));
6010 Present (gnat_temp); gnat_temp = Next (gnat_temp))
6012 gnu_expr = build3 (COND_EXPR, void_type_node,
6013 gnat_to_gnu (Condition (gnat_temp)),
6014 NULL_TREE, NULL_TREE);
6015 COND_EXPR_THEN (gnu_expr)
6016 = build_stmt_group (Then_Statements (gnat_temp), false);
6017 TREE_SIDE_EFFECTS (gnu_expr) = 1;
6018 set_expr_location_from_node (gnu_expr, gnat_temp);
6019 *gnu_else_ptr = gnu_expr;
6020 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
6023 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
6027 case N_Case_Statement:
6028 gnu_result = Case_Statement_to_gnu (gnat_node);
6031 case N_Loop_Statement:
6032 gnu_result = Loop_Statement_to_gnu (gnat_node);
6035 case N_Block_Statement:
6036 start_stmt_group ();
6038 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
6039 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
6041 gnu_result = end_stmt_group ();
6043 if (Present (Identifier (gnat_node)))
6044 mark_out_of_scope (Entity (Identifier (gnat_node)));
6047 case N_Exit_Statement:
6049 = build2 (EXIT_STMT, void_type_node,
6050 (Present (Condition (gnat_node))
6051 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
6052 (Present (Name (gnat_node))
6053 ? get_gnu_tree (Entity (Name (gnat_node)))
6054 : VEC_last (loop_info, gnu_loop_stack)->label));
6057 case N_Return_Statement:
6059 tree gnu_ret_obj, gnu_ret_val;
6061 /* If the subprogram is a function, we must return the expression. */
6062 if (Present (Expression (gnat_node)))
6064 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
6066 /* If this function has copy-in/copy-out parameters, get the real
6067 object for the return. See Subprogram_to_gnu. */
6068 if (TYPE_CI_CO_LIST (gnu_subprog_type))
6069 gnu_ret_obj = VEC_last (tree, gnu_return_var_stack);
6071 gnu_ret_obj = DECL_RESULT (current_function_decl);
6073 /* Get the GCC tree for the expression to be returned. */
6074 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
6076 /* Do not remove the padding from GNU_RET_VAL if the inner type is
6077 self-referential since we want to allocate the fixed size. */
6078 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
6079 && TYPE_IS_PADDING_P
6080 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
6081 && CONTAINS_PLACEHOLDER_P
6082 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
6083 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
6085 /* If the function returns by direct reference, return a pointer
6086 to the return value. */
6087 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
6088 || By_Ref (gnat_node))
6089 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
6091 /* Otherwise, if it returns an unconstrained array, we have to
6092 allocate a new version of the result and return it. */
6093 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
6095 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
6097 /* And find out whether this is a candidate for Named Return
6098 Value. If so, record it. */
6099 if (!TYPE_CI_CO_LIST (gnu_subprog_type) && optimize)
6101 tree ret_val = gnu_ret_val;
6103 /* Strip useless conversions around the return value. */
6104 if (gnat_useless_type_conversion (ret_val))
6105 ret_val = TREE_OPERAND (ret_val, 0);
6107 /* Strip unpadding around the return value. */
6108 if (TREE_CODE (ret_val) == COMPONENT_REF
6109 && TYPE_IS_PADDING_P
6110 (TREE_TYPE (TREE_OPERAND (ret_val, 0))))
6111 ret_val = TREE_OPERAND (ret_val, 0);
6113 /* Now apply the test to the return value. */
6114 if (return_value_ok_for_nrv_p (NULL_TREE, ret_val))
6116 if (!f_named_ret_val)
6117 f_named_ret_val = BITMAP_GGC_ALLOC ();
6118 bitmap_set_bit (f_named_ret_val, DECL_UID (ret_val));
6120 f_gnat_ret = gnat_node;
6124 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
6126 TREE_TYPE (gnu_ret_obj),
6127 Procedure_To_Call (gnat_node),
6128 Storage_Pool (gnat_node),
6132 /* Otherwise, if it returns by invisible reference, dereference
6133 the pointer it is passed using the type of the return value
6134 and build the copy operation manually. This ensures that we
6135 don't copy too much data, for example if the return type is
6136 unconstrained with a maximum size. */
6137 else if (TREE_ADDRESSABLE (gnu_subprog_type))
6140 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
6142 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
6143 gnu_ret_deref, gnu_ret_val);
6144 add_stmt_with_node (gnu_result, gnat_node);
6145 gnu_ret_val = NULL_TREE;
6150 gnu_ret_obj = gnu_ret_val = NULL_TREE;
6152 /* If we have a return label defined, convert this into a branch to
6153 that label. The return proper will be handled elsewhere. */
6154 if (VEC_last (tree, gnu_return_label_stack))
6157 add_stmt (build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_ret_obj,
6160 gnu_result = build1 (GOTO_EXPR, void_type_node,
6161 VEC_last (tree, gnu_return_label_stack));
6163 /* When not optimizing, make sure the return is preserved. */
6164 if (!optimize && Comes_From_Source (gnat_node))
6165 DECL_ARTIFICIAL (VEC_last (tree, gnu_return_label_stack)) = 0;
6168 /* Otherwise, build a regular return. */
6170 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
6174 case N_Goto_Statement:
6176 = build1 (GOTO_EXPR, void_type_node, gnat_to_gnu (Name (gnat_node)));
6179 /***************************/
6180 /* Chapter 6: Subprograms */
6181 /***************************/
6183 case N_Subprogram_Declaration:
6184 /* Unless there is a freeze node, declare the subprogram. We consider
6185 this a "definition" even though we're not generating code for
6186 the subprogram because we will be making the corresponding GCC
6189 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
6190 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
6192 gnu_result = alloc_stmt_list ();
6195 case N_Abstract_Subprogram_Declaration:
6196 /* This subprogram doesn't exist for code generation purposes, but we
6197 have to elaborate the types of any parameters and result, unless
6198 they are imported types (nothing to generate in this case).
6200 The parameter list may contain types with freeze nodes, e.g. not null
6201 subtypes, so the subprogram itself may carry a freeze node, in which
6202 case its elaboration must be deferred. */
6204 /* Process the parameter types first. */
6205 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
6207 = First_Formal_With_Extras
6208 (Defining_Entity (Specification (gnat_node)));
6209 Present (gnat_temp);
6210 gnat_temp = Next_Formal_With_Extras (gnat_temp))
6211 if (Is_Itype (Etype (gnat_temp))
6212 && !From_With_Type (Etype (gnat_temp)))
6213 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
6215 /* Then the result type, set to Standard_Void_Type for procedures. */
6217 Entity_Id gnat_temp_type
6218 = Etype (Defining_Entity (Specification (gnat_node)));
6220 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
6221 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
6224 gnu_result = alloc_stmt_list ();
6227 case N_Defining_Program_Unit_Name:
6228 /* For a child unit identifier go up a level to get the specification.
6229 We get this when we try to find the spec of a child unit package
6230 that is the compilation unit being compiled. */
6231 gnu_result = gnat_to_gnu (Parent (gnat_node));
6234 case N_Subprogram_Body:
6235 Subprogram_Body_to_gnu (gnat_node);
6236 gnu_result = alloc_stmt_list ();
6239 case N_Function_Call:
6240 case N_Procedure_Call_Statement:
6241 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE, false);
6244 /************************/
6245 /* Chapter 7: Packages */
6246 /************************/
6248 case N_Package_Declaration:
6249 gnu_result = gnat_to_gnu (Specification (gnat_node));
6252 case N_Package_Specification:
6254 start_stmt_group ();
6255 process_decls (Visible_Declarations (gnat_node),
6256 Private_Declarations (gnat_node), Empty, true, true);
6257 gnu_result = end_stmt_group ();
6260 case N_Package_Body:
6262 /* If this is the body of a generic package - do nothing. */
6263 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
6265 gnu_result = alloc_stmt_list ();
6269 start_stmt_group ();
6270 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
6272 if (Present (Handled_Statement_Sequence (gnat_node)))
6273 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
6275 gnu_result = end_stmt_group ();
6278 /********************************/
6279 /* Chapter 8: Visibility Rules */
6280 /********************************/
6282 case N_Use_Package_Clause:
6283 case N_Use_Type_Clause:
6284 /* Nothing to do here - but these may appear in list of declarations. */
6285 gnu_result = alloc_stmt_list ();
6288 /*********************/
6289 /* Chapter 9: Tasks */
6290 /*********************/
6292 case N_Protected_Type_Declaration:
6293 gnu_result = alloc_stmt_list ();
6296 case N_Single_Task_Declaration:
6297 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
6298 gnu_result = alloc_stmt_list ();
6301 /*********************************************************/
6302 /* Chapter 10: Program Structure and Compilation Issues */
6303 /*********************************************************/
6305 case N_Compilation_Unit:
6306 /* This is not called for the main unit on which gigi is invoked. */
6307 Compilation_Unit_to_gnu (gnat_node);
6308 gnu_result = alloc_stmt_list ();
6311 case N_Subprogram_Body_Stub:
6312 case N_Package_Body_Stub:
6313 case N_Protected_Body_Stub:
6314 case N_Task_Body_Stub:
6315 /* Simply process whatever unit is being inserted. */
6316 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
6320 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
6323 /***************************/
6324 /* Chapter 11: Exceptions */
6325 /***************************/
6327 case N_Handled_Sequence_Of_Statements:
6328 /* If there is an At_End procedure attached to this node, and the EH
6329 mechanism is SJLJ, we must have at least a corresponding At_End
6330 handler, unless the No_Exception_Handlers restriction is set. */
6331 gcc_assert (type_annotate_only
6332 || Exception_Mechanism != Setjmp_Longjmp
6333 || No (At_End_Proc (gnat_node))
6334 || Present (Exception_Handlers (gnat_node))
6335 || No_Exception_Handlers_Set ());
6337 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
6340 case N_Exception_Handler:
6341 if (Exception_Mechanism == Setjmp_Longjmp)
6342 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
6343 else if (Exception_Mechanism == Back_End_Exceptions)
6344 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
6349 case N_Raise_Statement:
6350 /* Only for reraise in back-end exceptions mode. */
6351 gcc_assert (No (Name (gnat_node))
6352 && Exception_Mechanism == Back_End_Exceptions);
6354 start_stmt_group ();
6357 /* Clear the current exception pointer so that the occurrence won't be
6359 gnu_expr = create_var_decl (get_identifier ("SAVED_EXPTR"), NULL_TREE,
6360 ptr_type_node, gnu_incoming_exc_ptr,
6361 false, false, false, false, NULL, gnat_node);
6363 add_stmt (build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_incoming_exc_ptr,
6364 convert (ptr_type_node, integer_zero_node)));
6365 add_stmt (build_call_n_expr (reraise_zcx_decl, 1, gnu_expr));
6367 gnu_result = end_stmt_group ();
6370 case N_Push_Constraint_Error_Label:
6371 push_exception_label_stack (&gnu_constraint_error_label_stack,
6372 Exception_Label (gnat_node));
6375 case N_Push_Storage_Error_Label:
6376 push_exception_label_stack (&gnu_storage_error_label_stack,
6377 Exception_Label (gnat_node));
6380 case N_Push_Program_Error_Label:
6381 push_exception_label_stack (&gnu_program_error_label_stack,
6382 Exception_Label (gnat_node));
6385 case N_Pop_Constraint_Error_Label:
6386 VEC_pop (tree, gnu_constraint_error_label_stack);
6389 case N_Pop_Storage_Error_Label:
6390 VEC_pop (tree, gnu_storage_error_label_stack);
6393 case N_Pop_Program_Error_Label:
6394 VEC_pop (tree, gnu_program_error_label_stack);
6397 /******************************/
6398 /* Chapter 12: Generic Units */
6399 /******************************/
6401 case N_Generic_Function_Renaming_Declaration:
6402 case N_Generic_Package_Renaming_Declaration:
6403 case N_Generic_Procedure_Renaming_Declaration:
6404 case N_Generic_Package_Declaration:
6405 case N_Generic_Subprogram_Declaration:
6406 case N_Package_Instantiation:
6407 case N_Procedure_Instantiation:
6408 case N_Function_Instantiation:
6409 /* These nodes can appear on a declaration list but there is nothing to
6410 to be done with them. */
6411 gnu_result = alloc_stmt_list ();
6414 /**************************************************/
6415 /* Chapter 13: Representation Clauses and */
6416 /* Implementation-Dependent Features */
6417 /**************************************************/
6419 case N_Attribute_Definition_Clause:
6420 gnu_result = alloc_stmt_list ();
6422 /* The only one we need to deal with is 'Address since, for the others,
6423 the front-end puts the information elsewhere. */
6424 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
6427 /* And we only deal with 'Address if the object has a Freeze node. */
6428 gnat_temp = Entity (Name (gnat_node));
6429 if (No (Freeze_Node (gnat_temp)))
6432 /* Get the value to use as the address and save it as the equivalent
6433 for the object. When it is frozen, gnat_to_gnu_entity will do the
6435 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
6438 case N_Enumeration_Representation_Clause:
6439 case N_Record_Representation_Clause:
6441 /* We do nothing with these. SEM puts the information elsewhere. */
6442 gnu_result = alloc_stmt_list ();
6445 case N_Code_Statement:
6446 if (!type_annotate_only)
6448 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
6449 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
6450 tree gnu_clobbers = NULL_TREE, tail;
6451 bool allows_mem, allows_reg, fake;
6452 int ninputs, noutputs, i;
6453 const char **oconstraints;
6454 const char *constraint;
6457 /* First retrieve the 3 operand lists built by the front-end. */
6458 Setup_Asm_Outputs (gnat_node);
6459 while (Present (gnat_temp = Asm_Output_Variable ()))
6461 tree gnu_value = gnat_to_gnu (gnat_temp);
6462 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
6463 (Asm_Output_Constraint ()));
6465 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
6469 Setup_Asm_Inputs (gnat_node);
6470 while (Present (gnat_temp = Asm_Input_Value ()))
6472 tree gnu_value = gnat_to_gnu (gnat_temp);
6473 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
6474 (Asm_Input_Constraint ()));
6476 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
6480 Clobber_Setup (gnat_node);
6481 while ((clobber = Clobber_Get_Next ()))
6483 = tree_cons (NULL_TREE,
6484 build_string (strlen (clobber) + 1, clobber),
6487 /* Then perform some standard checking and processing on the
6488 operands. In particular, mark them addressable if needed. */
6489 gnu_outputs = nreverse (gnu_outputs);
6490 noutputs = list_length (gnu_outputs);
6491 gnu_inputs = nreverse (gnu_inputs);
6492 ninputs = list_length (gnu_inputs);
6493 oconstraints = XALLOCAVEC (const char *, noutputs);
6495 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
6497 tree output = TREE_VALUE (tail);
6499 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6500 oconstraints[i] = constraint;
6502 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6503 &allows_mem, &allows_reg, &fake))
6505 /* If the operand is going to end up in memory,
6506 mark it addressable. Note that we don't test
6507 allows_mem like in the input case below; this
6508 is modelled on the C front-end. */
6511 output = remove_conversions (output, false);
6512 if (TREE_CODE (output) == CONST_DECL
6513 && DECL_CONST_CORRESPONDING_VAR (output))
6514 output = DECL_CONST_CORRESPONDING_VAR (output);
6515 if (!gnat_mark_addressable (output))
6516 output = error_mark_node;
6520 output = error_mark_node;
6522 TREE_VALUE (tail) = output;
6525 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
6527 tree input = TREE_VALUE (tail);
6529 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6531 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
6533 &allows_mem, &allows_reg))
6535 /* If the operand is going to end up in memory,
6536 mark it addressable. */
6537 if (!allows_reg && allows_mem)
6539 input = remove_conversions (input, false);
6540 if (TREE_CODE (input) == CONST_DECL
6541 && DECL_CONST_CORRESPONDING_VAR (input))
6542 input = DECL_CONST_CORRESPONDING_VAR (input);
6543 if (!gnat_mark_addressable (input))
6544 input = error_mark_node;
6548 input = error_mark_node;
6550 TREE_VALUE (tail) = input;
6553 gnu_result = build5 (ASM_EXPR, void_type_node,
6554 gnu_template, gnu_outputs,
6555 gnu_inputs, gnu_clobbers, NULL_TREE);
6556 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
6559 gnu_result = alloc_stmt_list ();
6567 case N_Expression_With_Actions:
6568 gnu_result_type = get_unpadded_type (Etype (gnat_node));
6569 /* This construct doesn't define a scope so we don't wrap the statement
6570 list in a BIND_EXPR; however, we wrap it in a SAVE_EXPR to protect it
6572 gnu_result = build_stmt_group (Actions (gnat_node), false);
6573 gnu_result = build1 (SAVE_EXPR, void_type_node, gnu_result);
6574 TREE_SIDE_EFFECTS (gnu_result) = 1;
6575 gnu_expr = gnat_to_gnu (Expression (gnat_node));
6577 = build_compound_expr (TREE_TYPE (gnu_expr), gnu_result, gnu_expr);
6580 case N_Freeze_Entity:
6581 start_stmt_group ();
6582 process_freeze_entity (gnat_node);
6583 process_decls (Actions (gnat_node), Empty, Empty, true, true);
6584 gnu_result = end_stmt_group ();
6587 case N_Itype_Reference:
6588 if (!present_gnu_tree (Itype (gnat_node)))
6589 process_type (Itype (gnat_node));
6591 gnu_result = alloc_stmt_list ();
6594 case N_Free_Statement:
6595 if (!type_annotate_only)
6597 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
6598 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
6600 tree gnu_actual_obj_type = 0;
6603 /* If this is a thin pointer, we must dereference it to create
6604 a fat pointer, then go back below to a thin pointer. The
6605 reason for this is that we need a fat pointer someplace in
6606 order to properly compute the size. */
6607 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
6608 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
6609 build_unary_op (INDIRECT_REF, NULL_TREE,
6612 /* If this is an unconstrained array, we know the object must
6613 have been allocated with the template in front of the object.
6614 So pass the template address, but get the total size. Do this
6615 by converting to a thin pointer. */
6616 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
6618 = convert (build_pointer_type
6619 (TYPE_OBJECT_RECORD_TYPE
6620 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
6623 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
6625 if (Present (Actual_Designated_Subtype (gnat_node)))
6628 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
6630 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
6632 = build_unc_object_type_from_ptr (gnu_ptr_type,
6633 gnu_actual_obj_type,
6634 get_identifier ("DEALLOC"),
6638 gnu_actual_obj_type = gnu_obj_type;
6640 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
6642 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
6643 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
6645 tree gnu_char_ptr_type
6646 = build_pointer_type (unsigned_char_type_node);
6647 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
6648 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
6649 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
6654 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
6655 Procedure_To_Call (gnat_node),
6656 Storage_Pool (gnat_node),
6661 case N_Raise_Constraint_Error:
6662 case N_Raise_Program_Error:
6663 case N_Raise_Storage_Error:
6665 const int reason = UI_To_Int (Reason (gnat_node));
6666 const Node_Id gnat_cond = Condition (gnat_node);
6667 const bool with_extra_info = Exception_Extra_Info
6668 && !No_Exception_Handlers_Set ()
6669 && !get_exception_label (kind);
6670 tree gnu_cond = NULL_TREE;
6672 if (type_annotate_only)
6674 gnu_result = alloc_stmt_list ();
6678 gnu_result_type = get_unpadded_type (Etype (gnat_node));
6682 case CE_Access_Check_Failed:
6683 if (with_extra_info)
6684 gnu_result = build_call_raise_column (reason, gnat_node);
6687 case CE_Index_Check_Failed:
6688 case CE_Range_Check_Failed:
6689 case CE_Invalid_Data:
6690 if (Present (gnat_cond)
6691 && Nkind (gnat_cond) == N_Op_Not
6692 && Nkind (Right_Opnd (gnat_cond)) == N_In
6693 && Nkind (Right_Opnd (Right_Opnd (gnat_cond))) == N_Range)
6695 Node_Id gnat_index = Left_Opnd (Right_Opnd (gnat_cond));
6696 Node_Id gnat_type = Etype (gnat_index);
6697 Node_Id gnat_range = Right_Opnd (Right_Opnd (gnat_cond));
6698 tree gnu_index = gnat_to_gnu (gnat_index);
6699 tree gnu_low_bound = gnat_to_gnu (Low_Bound (gnat_range));
6700 tree gnu_high_bound = gnat_to_gnu (High_Bound (gnat_range));
6701 struct range_check_info_d *rci;
6704 && Known_Esize (gnat_type)
6705 && UI_To_Int (Esize (gnat_type)) <= 32)
6707 = build_call_raise_range (reason, gnat_node, gnu_index,
6708 gnu_low_bound, gnu_high_bound);
6710 /* If loop unswitching is enabled, we try to compute invariant
6711 conditions for checks applied to iteration variables, i.e.
6712 conditions that are both independent of the variable and
6713 necessary in order for the check to fail in the course of
6714 some iteration, and prepend them to the original condition
6715 of the checks. This will make it possible later for the
6716 loop unswitching pass to replace the loop with two loops,
6717 one of which has the checks eliminated and the other has
6718 the original checks reinstated, and a run time selection.
6719 The former loop will be suitable for vectorization. */
6720 if (flag_unswitch_loops
6721 && (gnu_low_bound = gnat_invariant_expr (gnu_low_bound))
6722 && (gnu_high_bound = gnat_invariant_expr (gnu_high_bound))
6723 && (rci = push_range_check_info (gnu_index)))
6725 rci->low_bound = gnu_low_bound;
6726 rci->high_bound = gnu_high_bound;
6727 rci->type = gnat_to_gnu_type (gnat_type);
6728 rci->invariant_cond = build1 (SAVE_EXPR, boolean_type_node,
6730 gnu_cond = build_binary_op (TRUTH_ANDIF_EXPR,
6732 rci->invariant_cond,
6733 gnat_to_gnu (gnat_cond));
6742 if (gnu_result == error_mark_node)
6743 gnu_result = build_call_raise (reason, gnat_node, kind);
6745 set_expr_location_from_node (gnu_result, gnat_node);
6747 /* If the type is VOID, this is a statement, so we need to generate
6748 the code for the call. Handle a condition, if there is one. */
6749 if (VOID_TYPE_P (gnu_result_type))
6751 if (Present (gnat_cond))
6754 gnu_cond = gnat_to_gnu (gnat_cond);
6756 = build3 (COND_EXPR, void_type_node, gnu_cond, gnu_result,
6757 alloc_stmt_list ());
6761 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
6765 case N_Validate_Unchecked_Conversion:
6767 Entity_Id gnat_target_type = Target_Type (gnat_node);
6768 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
6769 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
6771 /* No need for any warning in this case. */
6772 if (!flag_strict_aliasing)
6775 /* If the result is a pointer type, see if we are either converting
6776 from a non-pointer or from a pointer to a type with a different
6777 alias set and warn if so. If the result is defined in the same
6778 unit as this unchecked conversion, we can allow this because we
6779 can know to make the pointer type behave properly. */
6780 else if (POINTER_TYPE_P (gnu_target_type)
6781 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
6782 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
6784 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
6785 ? TREE_TYPE (gnu_source_type)
6787 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
6789 if ((TYPE_DUMMY_P (gnu_target_desig_type)
6790 || get_alias_set (gnu_target_desig_type) != 0)
6791 && (!POINTER_TYPE_P (gnu_source_type)
6792 || (TYPE_DUMMY_P (gnu_source_desig_type)
6793 != TYPE_DUMMY_P (gnu_target_desig_type))
6794 || (TYPE_DUMMY_P (gnu_source_desig_type)
6795 && gnu_source_desig_type != gnu_target_desig_type)
6796 || !alias_sets_conflict_p
6797 (get_alias_set (gnu_source_desig_type),
6798 get_alias_set (gnu_target_desig_type))))
6801 ("?possible aliasing problem for type&",
6802 gnat_node, Target_Type (gnat_node));
6804 ("\\?use -fno-strict-aliasing switch for references",
6807 ("\\?or use `pragma No_Strict_Aliasing (&);`",
6808 gnat_node, Target_Type (gnat_node));
6812 /* But if the result is a fat pointer type, we have no mechanism to
6813 do that, so we unconditionally warn in problematic cases. */
6814 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
6816 tree gnu_source_array_type
6817 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
6818 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
6820 tree gnu_target_array_type
6821 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
6823 if ((TYPE_DUMMY_P (gnu_target_array_type)
6824 || get_alias_set (gnu_target_array_type) != 0)
6825 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
6826 || (TYPE_DUMMY_P (gnu_source_array_type)
6827 != TYPE_DUMMY_P (gnu_target_array_type))
6828 || (TYPE_DUMMY_P (gnu_source_array_type)
6829 && gnu_source_array_type != gnu_target_array_type)
6830 || !alias_sets_conflict_p
6831 (get_alias_set (gnu_source_array_type),
6832 get_alias_set (gnu_target_array_type))))
6835 ("?possible aliasing problem for type&",
6836 gnat_node, Target_Type (gnat_node));
6838 ("\\?use -fno-strict-aliasing switch for references",
6843 gnu_result = alloc_stmt_list ();
6847 /* SCIL nodes require no processing for GCC. Other nodes should only
6848 be present when annotating types. */
6849 gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only);
6850 gnu_result = alloc_stmt_list ();
6853 /* If we pushed the processing of the elaboration routine, pop it back. */
6854 if (went_into_elab_proc)
6855 current_function_decl = NULL_TREE;
6857 /* When not optimizing, turn boolean rvalues B into B != false tests
6858 so that the code just below can put the location information of the
6859 reference to B on the inequality operator for better debug info. */
6861 && TREE_CODE (gnu_result) != INTEGER_CST
6862 && (kind == N_Identifier
6863 || kind == N_Expanded_Name
6864 || kind == N_Explicit_Dereference
6865 || kind == N_Function_Call
6866 || kind == N_Indexed_Component
6867 || kind == N_Selected_Component)
6868 && TREE_CODE (get_base_type (gnu_result_type)) == BOOLEAN_TYPE
6869 && !lvalue_required_p (gnat_node, gnu_result_type, false, false, false))
6870 gnu_result = build_binary_op (NE_EXPR, gnu_result_type,
6871 convert (gnu_result_type, gnu_result),
6872 convert (gnu_result_type,
6873 boolean_false_node));
6875 /* Set the location information on the result. Note that we may have
6876 no result if we tried to build a CALL_EXPR node to a procedure with
6877 no side-effects and optimization is enabled. */
6878 if (gnu_result && EXPR_P (gnu_result))
6879 set_gnu_expr_location_from_node (gnu_result, gnat_node);
6881 /* If we're supposed to return something of void_type, it means we have
6882 something we're elaborating for effect, so just return. */
6883 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
6886 /* If the result is a constant that overflowed, raise Constraint_Error. */
6887 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
6889 post_error ("?`Constraint_Error` will be raised at run time", gnat_node);
6891 = build1 (NULL_EXPR, gnu_result_type,
6892 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
6893 N_Raise_Constraint_Error));
6896 /* If the result has side-effects and is of an unconstrained type, make a
6897 SAVE_EXPR so that we can be sure it will only be referenced once. But
6898 this is useless for a call to a function that returns an unconstrained
6899 type with default discriminant, as we cannot compute the size of the
6900 actual returned object. We must do this before any conversions. */
6901 if (TREE_SIDE_EFFECTS (gnu_result)
6902 && !(TREE_CODE (gnu_result) == CALL_EXPR
6903 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
6904 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
6905 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
6906 gnu_result = gnat_stabilize_reference (gnu_result, false, NULL);
6908 /* Now convert the result to the result type, unless we are in one of the
6911 1. If this is the LHS of an assignment or an actual parameter of a
6912 call, return the result almost unmodified since the RHS will have
6913 to be converted to our type in that case, unless the result type
6914 has a simpler size. Likewise if there is just a no-op unchecked
6915 conversion in-between. Similarly, don't convert integral types
6916 that are the operands of an unchecked conversion since we need
6917 to ignore those conversions (for 'Valid).
6919 2. If we have a label (which doesn't have any well-defined type), a
6920 field or an error, return the result almost unmodified. Similarly,
6921 if the two types are record types with the same name, don't convert.
6922 This will be the case when we are converting from a packable version
6923 of a type to its original type and we need those conversions to be
6924 NOPs in order for assignments into these types to work properly.
6926 3. If the type is void or if we have no result, return error_mark_node
6927 to show we have no result.
6929 4. If this a call to a function that returns an unconstrained type with
6930 default discriminant, return the call expression unmodified since we
6931 cannot compute the size of the actual returned object.
6933 5. Finally, if the type of the result is already correct. */
6935 if (Present (Parent (gnat_node))
6936 && (lhs_or_actual_p (gnat_node)
6937 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
6938 && unchecked_conversion_nop (Parent (gnat_node)))
6939 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
6940 && !AGGREGATE_TYPE_P (gnu_result_type)
6941 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
6942 && !(TYPE_SIZE (gnu_result_type)
6943 && TYPE_SIZE (TREE_TYPE (gnu_result))
6944 && (AGGREGATE_TYPE_P (gnu_result_type)
6945 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
6946 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
6947 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
6949 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
6950 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
6951 && (CONTAINS_PLACEHOLDER_P
6952 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
6953 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
6954 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
6956 /* Remove padding only if the inner object is of self-referential
6957 size: in that case it must be an object of unconstrained type
6958 with a default discriminant and we want to avoid copying too
6960 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
6961 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
6962 (TREE_TYPE (gnu_result))))))
6963 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
6967 else if (TREE_CODE (gnu_result) == LABEL_DECL
6968 || TREE_CODE (gnu_result) == FIELD_DECL
6969 || TREE_CODE (gnu_result) == ERROR_MARK
6970 || (TYPE_NAME (gnu_result_type)
6971 == TYPE_NAME (TREE_TYPE (gnu_result))
6972 && TREE_CODE (gnu_result_type) == RECORD_TYPE
6973 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
6975 /* Remove any padding. */
6976 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
6977 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
6981 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
6982 gnu_result = error_mark_node;
6984 else if (TREE_CODE (gnu_result) == CALL_EXPR
6985 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
6986 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
6988 /* ??? We need to convert if the padded type has fixed size because
6989 gnat_types_compatible_p will say that padded types are compatible
6990 but the gimplifier will not and, therefore, will ultimately choke
6991 if there isn't a conversion added early. */
6992 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result))) == INTEGER_CST)
6993 gnu_result = convert (gnu_result_type, gnu_result);
6996 else if (TREE_TYPE (gnu_result) != gnu_result_type)
6997 gnu_result = convert (gnu_result_type, gnu_result);
6999 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
7000 while ((TREE_CODE (gnu_result) == NOP_EXPR
7001 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
7002 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
7003 gnu_result = TREE_OPERAND (gnu_result, 0);
7008 /* Subroutine of above to push the exception label stack. GNU_STACK is
7009 a pointer to the stack to update and GNAT_LABEL, if present, is the
7010 label to push onto the stack. */
7013 push_exception_label_stack (VEC(tree,gc) **gnu_stack, Entity_Id gnat_label)
7015 tree gnu_label = (Present (gnat_label)
7016 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
7019 VEC_safe_push (tree, gc, *gnu_stack, gnu_label);
7022 /* Record the current code position in GNAT_NODE. */
7025 record_code_position (Node_Id gnat_node)
7027 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
7029 add_stmt_with_node (stmt_stmt, gnat_node);
7030 save_gnu_tree (gnat_node, stmt_stmt, true);
7033 /* Insert the code for GNAT_NODE at the position saved for that node. */
7036 insert_code_for (Node_Id gnat_node)
7038 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
7039 save_gnu_tree (gnat_node, NULL_TREE, true);
7042 /* Start a new statement group chained to the previous group. */
7045 start_stmt_group (void)
7047 struct stmt_group *group = stmt_group_free_list;
7049 /* First see if we can get one from the free list. */
7051 stmt_group_free_list = group->previous;
7053 group = ggc_alloc_stmt_group ();
7055 group->previous = current_stmt_group;
7056 group->stmt_list = group->block = group->cleanups = NULL_TREE;
7057 current_stmt_group = group;
7060 /* Add GNU_STMT to the current statement group. If it is an expression with
7061 no effects, it is ignored. */
7064 add_stmt (tree gnu_stmt)
7066 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
7069 /* Similar, but the statement is always added, regardless of side-effects. */
7072 add_stmt_force (tree gnu_stmt)
7074 append_to_statement_list_force (gnu_stmt, ¤t_stmt_group->stmt_list);
7077 /* Like add_stmt, but set the location of GNU_STMT to that of GNAT_NODE. */
7080 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
7082 if (Present (gnat_node))
7083 set_expr_location_from_node (gnu_stmt, gnat_node);
7084 add_stmt (gnu_stmt);
7087 /* Similar, but the statement is always added, regardless of side-effects. */
7090 add_stmt_with_node_force (tree gnu_stmt, Node_Id gnat_node)
7092 if (Present (gnat_node))
7093 set_expr_location_from_node (gnu_stmt, gnat_node);
7094 add_stmt_force (gnu_stmt);
7097 /* Add a declaration statement for GNU_DECL to the current statement group.
7098 Get SLOC from Entity_Id. */
7101 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
7103 tree type = TREE_TYPE (gnu_decl);
7104 tree gnu_stmt, gnu_init, t;
7106 /* If this is a variable that Gigi is to ignore, we may have been given
7107 an ERROR_MARK. So test for it. We also might have been given a
7108 reference for a renaming. So only do something for a decl. Also
7109 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
7110 if (!DECL_P (gnu_decl)
7111 || (TREE_CODE (gnu_decl) == TYPE_DECL
7112 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
7115 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
7117 /* If we are global, we don't want to actually output the DECL_EXPR for
7118 this decl since we already have evaluated the expressions in the
7119 sizes and positions as globals and doing it again would be wrong. */
7120 if (global_bindings_p ())
7122 /* Mark everything as used to prevent node sharing with subprograms.
7123 Note that walk_tree knows how to deal with TYPE_DECL, but neither
7124 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
7125 MARK_VISITED (gnu_stmt);
7126 if (TREE_CODE (gnu_decl) == VAR_DECL
7127 || TREE_CODE (gnu_decl) == CONST_DECL)
7129 MARK_VISITED (DECL_SIZE (gnu_decl));
7130 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
7131 MARK_VISITED (DECL_INITIAL (gnu_decl));
7133 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
7134 else if (TREE_CODE (gnu_decl) == TYPE_DECL
7135 && RECORD_OR_UNION_TYPE_P (type)
7136 && !TYPE_FAT_POINTER_P (type))
7137 MARK_VISITED (TYPE_ADA_SIZE (type));
7139 else if (!DECL_EXTERNAL (gnu_decl))
7140 add_stmt_with_node (gnu_stmt, gnat_entity);
7142 /* If this is a variable and an initializer is attached to it, it must be
7143 valid for the context. Similar to init_const in create_var_decl_1. */
7144 if (TREE_CODE (gnu_decl) == VAR_DECL
7145 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
7146 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
7147 || (TREE_STATIC (gnu_decl)
7148 && !initializer_constant_valid_p (gnu_init,
7149 TREE_TYPE (gnu_init)))))
7151 /* If GNU_DECL has a padded type, convert it to the unpadded
7152 type so the assignment is done properly. */
7153 if (TYPE_IS_PADDING_P (type))
7154 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
7158 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
7160 DECL_INITIAL (gnu_decl) = NULL_TREE;
7161 if (TREE_READONLY (gnu_decl))
7163 TREE_READONLY (gnu_decl) = 0;
7164 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
7167 add_stmt_with_node (gnu_stmt, gnat_entity);
7171 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
7174 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
7178 if (TREE_VISITED (t))
7181 /* Don't mark a dummy type as visited because we want to mark its sizes
7182 and fields once it's filled in. */
7183 else if (!TYPE_IS_DUMMY_P (t))
7184 TREE_VISITED (t) = 1;
7187 TYPE_SIZES_GIMPLIFIED (t) = 1;
7192 /* Mark nodes rooted at T with TREE_VISITED and types as having their
7193 sized gimplified. We use this to indicate all variable sizes and
7194 positions in global types may not be shared by any subprogram. */
7197 mark_visited (tree t)
7199 walk_tree (&t, mark_visited_r, NULL, NULL);
7202 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
7203 set its location to that of GNAT_NODE if present. */
7206 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
7208 if (Present (gnat_node))
7209 set_expr_location_from_node (gnu_cleanup, gnat_node);
7210 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
7213 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
7216 set_block_for_group (tree gnu_block)
7218 gcc_assert (!current_stmt_group->block);
7219 current_stmt_group->block = gnu_block;
7222 /* Return code corresponding to the current code group. It is normally
7223 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
7224 BLOCK or cleanups were set. */
7227 end_stmt_group (void)
7229 struct stmt_group *group = current_stmt_group;
7230 tree gnu_retval = group->stmt_list;
7232 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
7233 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
7234 make a BIND_EXPR. Note that we nest in that because the cleanup may
7235 reference variables in the block. */
7236 if (gnu_retval == NULL_TREE)
7237 gnu_retval = alloc_stmt_list ();
7239 if (group->cleanups)
7240 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
7243 if (current_stmt_group->block)
7244 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
7245 gnu_retval, group->block);
7247 /* Remove this group from the stack and add it to the free list. */
7248 current_stmt_group = group->previous;
7249 group->previous = stmt_group_free_list;
7250 stmt_group_free_list = group;
7255 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
7259 add_stmt_list (List_Id gnat_list)
7263 if (Present (gnat_list))
7264 for (gnat_node = First (gnat_list); Present (gnat_node);
7265 gnat_node = Next (gnat_node))
7266 add_stmt (gnat_to_gnu (gnat_node));
7269 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
7270 If BINDING_P is true, push and pop a binding level around the list. */
7273 build_stmt_group (List_Id gnat_list, bool binding_p)
7275 start_stmt_group ();
7279 add_stmt_list (gnat_list);
7283 return end_stmt_group ();
7286 /* Generate GIMPLE in place for the expression at *EXPR_P. */
7289 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
7290 gimple_seq *post_p ATTRIBUTE_UNUSED)
7292 tree expr = *expr_p;
7295 if (IS_ADA_STMT (expr))
7296 return gnat_gimplify_stmt (expr_p);
7298 switch (TREE_CODE (expr))
7301 /* If this is for a scalar, just make a VAR_DECL for it. If for
7302 an aggregate, get a null pointer of the appropriate type and
7304 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
7305 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
7306 convert (build_pointer_type (TREE_TYPE (expr)),
7307 integer_zero_node));
7310 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
7311 TREE_NO_WARNING (*expr_p) = 1;
7314 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
7317 case UNCONSTRAINED_ARRAY_REF:
7318 /* We should only do this if we are just elaborating for side-effects,
7319 but we can't know that yet. */
7320 *expr_p = TREE_OPERAND (*expr_p, 0);
7324 op = TREE_OPERAND (expr, 0);
7326 /* If we are taking the address of a constant CONSTRUCTOR, make sure it
7327 is put into static memory. We know that it's going to be read-only
7328 given the semantics we have and it must be in static memory when the
7329 reference is in an elaboration procedure. */
7330 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
7332 tree addr = build_fold_addr_expr (tree_output_constant_def (op));
7333 *expr_p = fold_convert (TREE_TYPE (expr), addr);
7337 /* Otherwise, if we are taking the address of a non-constant CONSTRUCTOR
7338 or of a call, explicitly create the local temporary. That's required
7339 if the type is passed by reference. */
7340 if (TREE_CODE (op) == CONSTRUCTOR || TREE_CODE (op) == CALL_EXPR)
7342 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
7343 TREE_ADDRESSABLE (new_var) = 1;
7344 gimple_add_tmp_var (new_var);
7346 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
7347 gimplify_and_add (mod, pre_p);
7349 TREE_OPERAND (expr, 0) = new_var;
7350 recompute_tree_invariant_for_addr_expr (expr);
7354 return GS_UNHANDLED;
7356 case VIEW_CONVERT_EXPR:
7357 op = TREE_OPERAND (expr, 0);
7359 /* If we are view-converting a CONSTRUCTOR or a call from an aggregate
7360 type to a scalar one, explicitly create the local temporary. That's
7361 required if the type is passed by reference. */
7362 if ((TREE_CODE (op) == CONSTRUCTOR || TREE_CODE (op) == CALL_EXPR)
7363 && AGGREGATE_TYPE_P (TREE_TYPE (op))
7364 && !AGGREGATE_TYPE_P (TREE_TYPE (expr)))
7366 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
7367 gimple_add_tmp_var (new_var);
7369 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
7370 gimplify_and_add (mod, pre_p);
7372 TREE_OPERAND (expr, 0) = new_var;
7376 return GS_UNHANDLED;
7379 op = DECL_EXPR_DECL (expr);
7381 /* The expressions for the RM bounds must be gimplified to ensure that
7382 they are properly elaborated. See gimplify_decl_expr. */
7383 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
7384 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
7385 switch (TREE_CODE (TREE_TYPE (op)))
7392 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
7394 val = TYPE_RM_MIN_VALUE (type);
7397 gimplify_one_sizepos (&val, pre_p);
7398 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
7399 SET_TYPE_RM_MIN_VALUE (t, val);
7402 val = TYPE_RM_MAX_VALUE (type);
7405 gimplify_one_sizepos (&val, pre_p);
7406 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
7407 SET_TYPE_RM_MAX_VALUE (t, val);
7417 /* ... fall through ... */
7420 return GS_UNHANDLED;
7424 /* Generate GIMPLE in place for the statement at *STMT_P. */
7426 static enum gimplify_status
7427 gnat_gimplify_stmt (tree *stmt_p)
7429 tree stmt = *stmt_p;
7431 switch (TREE_CODE (stmt))
7434 *stmt_p = STMT_STMT_STMT (stmt);
7439 tree gnu_start_label = create_artificial_label (input_location);
7440 tree gnu_cond = LOOP_STMT_COND (stmt);
7441 tree gnu_update = LOOP_STMT_UPDATE (stmt);
7442 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
7445 /* Build the condition expression from the test, if any. */
7448 = build3 (COND_EXPR, void_type_node, gnu_cond, alloc_stmt_list (),
7449 build1 (GOTO_EXPR, void_type_node, gnu_end_label));
7451 /* Set to emit the statements of the loop. */
7452 *stmt_p = NULL_TREE;
7454 /* We first emit the start label and then a conditional jump to the
7455 end label if there's a top condition, then the update if it's at
7456 the top, then the body of the loop, then a conditional jump to
7457 the end label if there's a bottom condition, then the update if
7458 it's at the bottom, and finally a jump to the start label and the
7459 definition of the end label. */
7460 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
7464 if (gnu_cond && !LOOP_STMT_BOTTOM_COND_P (stmt))
7465 append_to_statement_list (gnu_cond, stmt_p);
7467 if (gnu_update && LOOP_STMT_TOP_UPDATE_P (stmt))
7468 append_to_statement_list (gnu_update, stmt_p);
7470 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
7472 if (gnu_cond && LOOP_STMT_BOTTOM_COND_P (stmt))
7473 append_to_statement_list (gnu_cond, stmt_p);
7475 if (gnu_update && !LOOP_STMT_TOP_UPDATE_P (stmt))
7476 append_to_statement_list (gnu_update, stmt_p);
7478 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
7479 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
7480 append_to_statement_list (t, stmt_p);
7482 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
7489 /* Build a statement to jump to the corresponding end label, then
7490 see if it needs to be conditional. */
7491 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
7492 if (EXIT_STMT_COND (stmt))
7493 *stmt_p = build3 (COND_EXPR, void_type_node,
7494 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
7502 /* Force references to each of the entities in packages withed by GNAT_NODE.
7503 Operate recursively but check that we aren't elaborating something more
7506 This routine is exclusively called in type_annotate mode, to compute DDA
7507 information for types in withed units, for ASIS use. */
7510 elaborate_all_entities (Node_Id gnat_node)
7512 Entity_Id gnat_with_clause, gnat_entity;
7514 /* Process each unit only once. As we trace the context of all relevant
7515 units transitively, including generic bodies, we may encounter the
7516 same generic unit repeatedly. */
7517 if (!present_gnu_tree (gnat_node))
7518 save_gnu_tree (gnat_node, integer_zero_node, true);
7520 /* Save entities in all context units. A body may have an implicit_with
7521 on its own spec, if the context includes a child unit, so don't save
7523 for (gnat_with_clause = First (Context_Items (gnat_node));
7524 Present (gnat_with_clause);
7525 gnat_with_clause = Next (gnat_with_clause))
7526 if (Nkind (gnat_with_clause) == N_With_Clause
7527 && !present_gnu_tree (Library_Unit (gnat_with_clause))
7528 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
7530 elaborate_all_entities (Library_Unit (gnat_with_clause));
7532 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
7534 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
7535 Present (gnat_entity);
7536 gnat_entity = Next_Entity (gnat_entity))
7537 if (Is_Public (gnat_entity)
7538 && Convention (gnat_entity) != Convention_Intrinsic
7539 && Ekind (gnat_entity) != E_Package
7540 && Ekind (gnat_entity) != E_Package_Body
7541 && Ekind (gnat_entity) != E_Operator
7542 && !(IN (Ekind (gnat_entity), Type_Kind)
7543 && !Is_Frozen (gnat_entity))
7544 && !((Ekind (gnat_entity) == E_Procedure
7545 || Ekind (gnat_entity) == E_Function)
7546 && Is_Intrinsic_Subprogram (gnat_entity))
7547 && !IN (Ekind (gnat_entity), Named_Kind)
7548 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
7549 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
7551 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
7554 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
7556 /* Retrieve compilation unit node of generic body. */
7557 while (Present (gnat_body)
7558 && Nkind (gnat_body) != N_Compilation_Unit)
7559 gnat_body = Parent (gnat_body);
7561 /* If body is available, elaborate its context. */
7562 if (Present (gnat_body))
7563 elaborate_all_entities (gnat_body);
7567 if (Nkind (Unit (gnat_node)) == N_Package_Body)
7568 elaborate_all_entities (Library_Unit (gnat_node));
7571 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
7574 process_freeze_entity (Node_Id gnat_node)
7576 const Entity_Id gnat_entity = Entity (gnat_node);
7577 const Entity_Kind kind = Ekind (gnat_entity);
7578 tree gnu_old, gnu_new;
7580 /* If this is a package, we need to generate code for the package. */
7581 if (kind == E_Package)
7584 (Parent (Corresponding_Body
7585 (Parent (Declaration_Node (gnat_entity)))));
7589 /* Don't do anything for class-wide types as they are always transformed
7590 into their root type. */
7591 if (kind == E_Class_Wide_Type)
7594 /* Check for an old definition. This freeze node might be for an Itype. */
7596 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE;
7598 /* If this entity has an address representation clause, GNU_OLD is the
7599 address, so discard it here. */
7600 if (Present (Address_Clause (gnat_entity)))
7601 gnu_old = NULL_TREE;
7603 /* Don't do anything for subprograms that may have been elaborated before
7604 their freeze nodes. This can happen, for example, because of an inner
7605 call in an instance body or because of previous compilation of a spec
7606 for inlining purposes. */
7608 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
7609 && (kind == E_Function || kind == E_Procedure))
7610 || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
7611 && kind == E_Subprogram_Type)))
7614 /* If we have a non-dummy type old tree, we have nothing to do, except
7615 aborting if this is the public view of a private type whose full view was
7616 not delayed, as this node was never delayed as it should have been. We
7617 let this happen for concurrent types and their Corresponding_Record_Type,
7618 however, because each might legitimately be elaborated before its own
7619 freeze node, e.g. while processing the other. */
7621 && !(TREE_CODE (gnu_old) == TYPE_DECL
7622 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
7624 gcc_assert ((IN (kind, Incomplete_Or_Private_Kind)
7625 && Present (Full_View (gnat_entity))
7626 && No (Freeze_Node (Full_View (gnat_entity))))
7627 || Is_Concurrent_Type (gnat_entity)
7628 || (IN (kind, Record_Kind)
7629 && Is_Concurrent_Record_Type (gnat_entity)));
7633 /* Reset the saved tree, if any, and elaborate the object or type for real.
7634 If there is a full view, elaborate it and use the result. And, if this
7635 is the root type of a class-wide type, reuse it for the latter. */
7638 save_gnu_tree (gnat_entity, NULL_TREE, false);
7639 if (IN (kind, Incomplete_Or_Private_Kind)
7640 && Present (Full_View (gnat_entity))
7641 && present_gnu_tree (Full_View (gnat_entity)))
7642 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
7643 if (IN (kind, Type_Kind)
7644 && Present (Class_Wide_Type (gnat_entity))
7645 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
7646 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
7649 if (IN (kind, Incomplete_Or_Private_Kind)
7650 && Present (Full_View (gnat_entity)))
7652 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
7654 /* Propagate back-annotations from full view to partial view. */
7655 if (Unknown_Alignment (gnat_entity))
7656 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
7658 if (Unknown_Esize (gnat_entity))
7659 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
7661 if (Unknown_RM_Size (gnat_entity))
7662 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
7664 /* The above call may have defined this entity (the simplest example
7665 of this is when we have a private enumeral type since the bounds
7666 will have the public view). */
7667 if (!present_gnu_tree (gnat_entity))
7668 save_gnu_tree (gnat_entity, gnu_new, false);
7673 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
7674 && present_gnu_tree (Declaration_Node (gnat_entity)))
7675 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
7677 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
7680 if (IN (kind, Type_Kind)
7681 && Present (Class_Wide_Type (gnat_entity))
7682 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
7683 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
7685 /* If we have an old type and we've made pointers to this type, update those
7686 pointers. If this is a Taft amendment type in the main unit, we need to
7687 mark the type as used since other units referencing it don't see the full
7688 declaration and, therefore, cannot mark it as used themselves. */
7691 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7692 TREE_TYPE (gnu_new));
7693 if (DECL_TAFT_TYPE_P (gnu_old))
7694 used_types_insert (TREE_TYPE (gnu_new));
7698 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
7699 We make two passes, one to elaborate anything other than bodies (but
7700 we declare a function if there was no spec). The second pass
7701 elaborates the bodies.
7703 GNAT_END_LIST gives the element in the list past the end. Normally,
7704 this is Empty, but can be First_Real_Statement for a
7705 Handled_Sequence_Of_Statements.
7707 We make a complete pass through both lists if PASS1P is true, then make
7708 the second pass over both lists if PASS2P is true. The lists usually
7709 correspond to the public and private parts of a package. */
7712 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
7713 Node_Id gnat_end_list, bool pass1p, bool pass2p)
7715 List_Id gnat_decl_array[2];
7719 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
7722 for (i = 0; i <= 1; i++)
7723 if (Present (gnat_decl_array[i]))
7724 for (gnat_decl = First (gnat_decl_array[i]);
7725 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
7727 /* For package specs, we recurse inside the declarations,
7728 thus taking the two pass approach inside the boundary. */
7729 if (Nkind (gnat_decl) == N_Package_Declaration
7730 && (Nkind (Specification (gnat_decl)
7731 == N_Package_Specification)))
7732 process_decls (Visible_Declarations (Specification (gnat_decl)),
7733 Private_Declarations (Specification (gnat_decl)),
7734 Empty, true, false);
7736 /* Similarly for any declarations in the actions of a
7738 else if (Nkind (gnat_decl) == N_Freeze_Entity)
7740 process_freeze_entity (gnat_decl);
7741 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
7744 /* Package bodies with freeze nodes get their elaboration deferred
7745 until the freeze node, but the code must be placed in the right
7746 place, so record the code position now. */
7747 else if (Nkind (gnat_decl) == N_Package_Body
7748 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
7749 record_code_position (gnat_decl);
7751 else if (Nkind (gnat_decl) == N_Package_Body_Stub
7752 && Present (Library_Unit (gnat_decl))
7753 && Present (Freeze_Node
7756 (Library_Unit (gnat_decl)))))))
7757 record_code_position
7758 (Proper_Body (Unit (Library_Unit (gnat_decl))));
7760 /* We defer most subprogram bodies to the second pass. */
7761 else if (Nkind (gnat_decl) == N_Subprogram_Body)
7763 if (Acts_As_Spec (gnat_decl))
7765 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
7767 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
7768 && Ekind (gnat_subprog_id) != E_Generic_Function)
7769 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
7773 /* For bodies and stubs that act as their own specs, the entity
7774 itself must be elaborated in the first pass, because it may
7775 be used in other declarations. */
7776 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
7778 Node_Id gnat_subprog_id
7779 = Defining_Entity (Specification (gnat_decl));
7781 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
7782 && Ekind (gnat_subprog_id) != E_Generic_Procedure
7783 && Ekind (gnat_subprog_id) != E_Generic_Function)
7784 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
7787 /* Concurrent stubs stand for the corresponding subprogram bodies,
7788 which are deferred like other bodies. */
7789 else if (Nkind (gnat_decl) == N_Task_Body_Stub
7790 || Nkind (gnat_decl) == N_Protected_Body_Stub)
7794 add_stmt (gnat_to_gnu (gnat_decl));
7797 /* Here we elaborate everything we deferred above except for package bodies,
7798 which are elaborated at their freeze nodes. Note that we must also
7799 go inside things (package specs and freeze nodes) the first pass did. */
7801 for (i = 0; i <= 1; i++)
7802 if (Present (gnat_decl_array[i]))
7803 for (gnat_decl = First (gnat_decl_array[i]);
7804 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
7806 if (Nkind (gnat_decl) == N_Subprogram_Body
7807 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
7808 || Nkind (gnat_decl) == N_Task_Body_Stub
7809 || Nkind (gnat_decl) == N_Protected_Body_Stub)
7810 add_stmt (gnat_to_gnu (gnat_decl));
7812 else if (Nkind (gnat_decl) == N_Package_Declaration
7813 && (Nkind (Specification (gnat_decl)
7814 == N_Package_Specification)))
7815 process_decls (Visible_Declarations (Specification (gnat_decl)),
7816 Private_Declarations (Specification (gnat_decl)),
7817 Empty, false, true);
7819 else if (Nkind (gnat_decl) == N_Freeze_Entity)
7820 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
7824 /* Make a unary operation of kind CODE using build_unary_op, but guard
7825 the operation by an overflow check. CODE can be one of NEGATE_EXPR
7826 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
7827 the operation is to be performed in that type. GNAT_NODE is the gnat
7828 node conveying the source location for which the error should be
7832 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
7835 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
7837 operand = gnat_protect_expr (operand);
7839 return emit_check (build_binary_op (EQ_EXPR, boolean_type_node,
7840 operand, TYPE_MIN_VALUE (gnu_type)),
7841 build_unary_op (code, gnu_type, operand),
7842 CE_Overflow_Check_Failed, gnat_node);
7845 /* Make a binary operation of kind CODE using build_binary_op, but guard
7846 the operation by an overflow check. CODE can be one of PLUS_EXPR,
7847 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
7848 Usually the operation is to be performed in that type. GNAT_NODE is
7849 the GNAT node conveying the source location for which the error should
7853 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
7854 tree right, Node_Id gnat_node)
7856 tree lhs = gnat_protect_expr (left);
7857 tree rhs = gnat_protect_expr (right);
7858 tree type_max = TYPE_MAX_VALUE (gnu_type);
7859 tree type_min = TYPE_MIN_VALUE (gnu_type);
7862 tree zero = convert (gnu_type, integer_zero_node);
7867 int precision = TYPE_PRECISION (gnu_type);
7869 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
7871 /* Prefer a constant or known-positive rhs to simplify checks. */
7872 if (!TREE_CONSTANT (rhs)
7873 && commutative_tree_code (code)
7874 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
7875 && tree_expr_nonnegative_p (lhs))))
7882 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
7883 ? boolean_false_node
7884 : build_binary_op (LT_EXPR, boolean_type_node, rhs, zero);
7886 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
7888 /* Try a few strategies that may be cheaper than the general
7889 code at the end of the function, if the rhs is not known.
7891 - Call library function for 64-bit multiplication (complex)
7892 - Widen, if input arguments are sufficiently small
7893 - Determine overflow using wrapped result for addition/subtraction. */
7895 if (!TREE_CONSTANT (rhs))
7897 /* Even for add/subtract double size to get another base type. */
7898 int needed_precision = precision * 2;
7900 if (code == MULT_EXPR && precision == 64)
7902 tree int_64 = gnat_type_for_size (64, 0);
7904 return convert (gnu_type, build_call_n_expr (mulv64_decl, 2,
7905 convert (int_64, lhs),
7906 convert (int_64, rhs)));
7909 else if (needed_precision <= BITS_PER_WORD
7910 || (code == MULT_EXPR
7911 && needed_precision <= LONG_LONG_TYPE_SIZE))
7913 tree wide_type = gnat_type_for_size (needed_precision, 0);
7915 tree wide_result = build_binary_op (code, wide_type,
7916 convert (wide_type, lhs),
7917 convert (wide_type, rhs));
7919 tree check = build_binary_op
7920 (TRUTH_ORIF_EXPR, boolean_type_node,
7921 build_binary_op (LT_EXPR, boolean_type_node, wide_result,
7922 convert (wide_type, type_min)),
7923 build_binary_op (GT_EXPR, boolean_type_node, wide_result,
7924 convert (wide_type, type_max)));
7926 tree result = convert (gnu_type, wide_result);
7929 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
7932 else if (code == PLUS_EXPR || code == MINUS_EXPR)
7934 tree unsigned_type = gnat_type_for_size (precision, 1);
7935 tree wrapped_expr = convert
7936 (gnu_type, build_binary_op (code, unsigned_type,
7937 convert (unsigned_type, lhs),
7938 convert (unsigned_type, rhs)));
7940 tree result = convert
7941 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
7943 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
7944 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
7945 tree check = build_binary_op
7946 (TRUTH_XOR_EXPR, boolean_type_node, rhs_lt_zero,
7947 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
7948 boolean_type_node, wrapped_expr, lhs));
7951 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
7958 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
7959 check_pos = build_binary_op (GT_EXPR, boolean_type_node, lhs,
7960 build_binary_op (MINUS_EXPR, gnu_type,
7963 /* When rhs < 0, overflow when lhs < type_min - rhs. */
7964 check_neg = build_binary_op (LT_EXPR, boolean_type_node, lhs,
7965 build_binary_op (MINUS_EXPR, gnu_type,
7970 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
7971 check_pos = build_binary_op (LT_EXPR, boolean_type_node, lhs,
7972 build_binary_op (PLUS_EXPR, gnu_type,
7975 /* When rhs < 0, overflow when lhs > type_max + rhs. */
7976 check_neg = build_binary_op (GT_EXPR, boolean_type_node, lhs,
7977 build_binary_op (PLUS_EXPR, gnu_type,
7982 /* The check here is designed to be efficient if the rhs is constant,
7983 but it will work for any rhs by using integer division.
7984 Four different check expressions determine whether X * C overflows,
7987 C > 0 => X > type_max / C || X < type_min / C
7988 C == -1 => X == type_min
7989 C < -1 => X > type_min / C || X < type_max / C */
7991 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
7992 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
7995 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
7996 build_binary_op (NE_EXPR, boolean_type_node, zero,
7998 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
7999 build_binary_op (GT_EXPR,
8002 build_binary_op (LT_EXPR,
8007 = fold_build3 (COND_EXPR, boolean_type_node,
8008 build_binary_op (EQ_EXPR, boolean_type_node, rhs,
8009 build_int_cst (gnu_type, -1)),
8010 build_binary_op (EQ_EXPR, boolean_type_node, lhs,
8012 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8013 build_binary_op (GT_EXPR,
8016 build_binary_op (LT_EXPR,
8025 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
8027 /* If we can fold the expression to a constant, just return it.
8028 The caller will deal with overflow, no need to generate a check. */
8029 if (TREE_CONSTANT (gnu_expr))
8032 check = fold_build3 (COND_EXPR, boolean_type_node, rhs_lt_zero, check_neg,
8035 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
8038 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
8039 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
8040 which we have to check. GNAT_NODE is the GNAT node conveying the source
8041 location for which the error should be signaled. */
8044 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
8046 tree gnu_range_type = get_unpadded_type (gnat_range_type);
8047 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
8048 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
8049 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
8051 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
8052 This can for example happen when translating 'Val or 'Value. */
8053 if (gnu_compare_type == gnu_range_type)
8056 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
8057 we can't do anything since we might be truncating the bounds. No
8058 check is needed in this case. */
8059 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
8060 && (TYPE_PRECISION (gnu_compare_type)
8061 < TYPE_PRECISION (get_base_type (gnu_range_type))))
8064 /* Checked expressions must be evaluated only once. */
8065 gnu_expr = gnat_protect_expr (gnu_expr);
8067 /* Note that the form of the check is
8068 (not (expr >= lo)) or (not (expr <= hi))
8069 the reason for this slightly convoluted form is that NaNs
8070 are not considered to be in range in the float case. */
8072 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8074 (build_binary_op (GE_EXPR, boolean_type_node,
8075 convert (gnu_compare_type, gnu_expr),
8076 convert (gnu_compare_type, gnu_low))),
8078 (build_binary_op (LE_EXPR, boolean_type_node,
8079 convert (gnu_compare_type, gnu_expr),
8080 convert (gnu_compare_type,
8082 gnu_expr, CE_Range_Check_Failed, gnat_node);
8085 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
8086 we are about to index, GNU_EXPR is the index expression to be checked,
8087 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
8088 has to be checked. Note that for index checking we cannot simply use the
8089 emit_range_check function (although very similar code needs to be generated
8090 in both cases) since for index checking the array type against which we are
8091 checking the indices may be unconstrained and consequently we need to get
8092 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
8093 The place where we need to do that is in subprograms having unconstrained
8094 array formal parameters. GNAT_NODE is the GNAT node conveying the source
8095 location for which the error should be signaled. */
8098 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
8099 tree gnu_high, Node_Id gnat_node)
8101 tree gnu_expr_check;
8103 /* Checked expressions must be evaluated only once. */
8104 gnu_expr = gnat_protect_expr (gnu_expr);
8106 /* Must do this computation in the base type in case the expression's
8107 type is an unsigned subtypes. */
8108 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
8110 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
8111 the object we are handling. */
8112 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
8113 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
8116 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
8117 build_binary_op (LT_EXPR, boolean_type_node,
8119 convert (TREE_TYPE (gnu_expr_check),
8121 build_binary_op (GT_EXPR, boolean_type_node,
8123 convert (TREE_TYPE (gnu_expr_check),
8125 gnu_expr, CE_Index_Check_Failed, gnat_node);
8128 /* GNU_COND contains the condition corresponding to an access, discriminant or
8129 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
8130 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
8131 REASON is the code that says why the exception was raised. GNAT_NODE is
8132 the GNAT node conveying the source location for which the error should be
8136 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
8139 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
8141 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
8142 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
8143 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
8146 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
8147 we don't need to evaluate it just for the check. */
8148 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
8153 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
8154 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
8155 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
8156 float to integer conversion with truncation; otherwise round.
8157 GNAT_NODE is the GNAT node conveying the source location for which the
8158 error should be signaled. */
8161 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
8162 bool rangep, bool truncatep, Node_Id gnat_node)
8164 tree gnu_type = get_unpadded_type (gnat_type);
8165 tree gnu_in_type = TREE_TYPE (gnu_expr);
8166 tree gnu_in_basetype = get_base_type (gnu_in_type);
8167 tree gnu_base_type = get_base_type (gnu_type);
8168 tree gnu_result = gnu_expr;
8170 /* If we are not doing any checks, the output is an integral type, and
8171 the input is not a floating type, just do the conversion. This
8172 shortcut is required to avoid problems with packed array types
8173 and simplifies code in all cases anyway. */
8174 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
8175 && !FLOAT_TYPE_P (gnu_in_type))
8176 return convert (gnu_type, gnu_expr);
8178 /* First convert the expression to its base type. This
8179 will never generate code, but makes the tests below much simpler.
8180 But don't do this if converting from an integer type to an unconstrained
8181 array type since then we need to get the bounds from the original
8183 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
8184 gnu_result = convert (gnu_in_basetype, gnu_result);
8186 /* If overflow checks are requested, we need to be sure the result will
8187 fit in the output base type. But don't do this if the input
8188 is integer and the output floating-point. */
8190 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
8192 /* Ensure GNU_EXPR only gets evaluated once. */
8193 tree gnu_input = gnat_protect_expr (gnu_result);
8194 tree gnu_cond = boolean_false_node;
8195 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
8196 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
8197 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
8198 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
8200 /* Convert the lower bounds to signed types, so we're sure we're
8201 comparing them properly. Likewise, convert the upper bounds
8202 to unsigned types. */
8203 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
8204 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
8206 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8207 && !TYPE_UNSIGNED (gnu_in_basetype))
8208 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
8210 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
8211 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
8213 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
8214 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
8216 /* Check each bound separately and only if the result bound
8217 is tighter than the bound on the input type. Note that all the
8218 types are base types, so the bounds must be constant. Also,
8219 the comparison is done in the base type of the input, which
8220 always has the proper signedness. First check for input
8221 integer (which means output integer), output float (which means
8222 both float), or mixed, in which case we always compare.
8223 Note that we have to do the comparison which would *fail* in the
8224 case of an error since if it's an FP comparison and one of the
8225 values is a NaN or Inf, the comparison will fail. */
8226 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8227 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
8228 : (FLOAT_TYPE_P (gnu_base_type)
8229 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
8230 TREE_REAL_CST (gnu_out_lb))
8234 (build_binary_op (GE_EXPR, boolean_type_node,
8235 gnu_input, convert (gnu_in_basetype,
8238 if (INTEGRAL_TYPE_P (gnu_in_basetype)
8239 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
8240 : (FLOAT_TYPE_P (gnu_base_type)
8241 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
8242 TREE_REAL_CST (gnu_in_lb))
8245 = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node, gnu_cond,
8247 (build_binary_op (LE_EXPR, boolean_type_node,
8249 convert (gnu_in_basetype,
8252 if (!integer_zerop (gnu_cond))
8253 gnu_result = emit_check (gnu_cond, gnu_input,
8254 CE_Overflow_Check_Failed, gnat_node);
8257 /* Now convert to the result base type. If this is a non-truncating
8258 float-to-integer conversion, round. */
8259 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
8262 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
8263 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
8264 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
8265 const struct real_format *fmt;
8267 /* The following calculations depend on proper rounding to even
8268 of each arithmetic operation. In order to prevent excess
8269 precision from spoiling this property, use the widest hardware
8270 floating-point type if FP_ARITH_MAY_WIDEN is true. */
8272 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
8274 /* FIXME: Should not have padding in the first place. */
8275 if (TYPE_IS_PADDING_P (calc_type))
8276 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
8278 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
8279 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
8280 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
8281 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
8282 half_minus_pred_half);
8283 gnu_pred_half = build_real (calc_type, pred_half);
8285 /* If the input is strictly negative, subtract this value
8286 and otherwise add it from the input. For 0.5, the result
8287 is exactly between 1.0 and the machine number preceding 1.0
8288 (for calc_type). Since the last bit of 1.0 is even, this 0.5
8289 will round to 1.0, while all other number with an absolute
8290 value less than 0.5 round to 0.0. For larger numbers exactly
8291 halfway between integers, rounding will always be correct as
8292 the true mathematical result will be closer to the higher
8293 integer compared to the lower one. So, this constant works
8294 for all floating-point numbers.
8296 The reason to use the same constant with subtract/add instead
8297 of a positive and negative constant is to allow the comparison
8298 to be scheduled in parallel with retrieval of the constant and
8299 conversion of the input to the calc_type (if necessary). */
8301 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
8302 gnu_result = gnat_protect_expr (gnu_result);
8303 gnu_conv = convert (calc_type, gnu_result);
8305 = fold_build2 (GE_EXPR, boolean_type_node, gnu_result, gnu_zero);
8307 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
8308 gnu_subtract_pred_half
8309 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
8310 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
8311 gnu_add_pred_half, gnu_subtract_pred_half);
8314 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
8315 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
8316 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
8317 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
8319 gnu_result = convert (gnu_base_type, gnu_result);
8321 /* Finally, do the range check if requested. Note that if the result type
8322 is a modular type, the range check is actually an overflow check. */
8324 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
8325 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
8326 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
8328 return convert (gnu_type, gnu_result);
8331 /* Return true if GNU_EXPR can be directly addressed. This is the case
8332 unless it is an expression involving computation or if it involves a
8333 reference to a bitfield or to an object not sufficiently aligned for
8334 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
8335 be directly addressed as an object of this type.
8337 *** Notes on addressability issues in the Ada compiler ***
8339 This predicate is necessary in order to bridge the gap between Gigi
8340 and the middle-end about addressability of GENERIC trees. A tree
8341 is said to be addressable if it can be directly addressed, i.e. if
8342 its address can be taken, is a multiple of the type's alignment on
8343 strict-alignment architectures and returns the first storage unit
8344 assigned to the object represented by the tree.
8346 In the C family of languages, everything is in practice addressable
8347 at the language level, except for bit-fields. This means that these
8348 compilers will take the address of any tree that doesn't represent
8349 a bit-field reference and expect the result to be the first storage
8350 unit assigned to the object. Even in cases where this will result
8351 in unaligned accesses at run time, nothing is supposed to be done
8352 and the program is considered as erroneous instead (see PR c/18287).
8354 The implicit assumptions made in the middle-end are in keeping with
8355 the C viewpoint described above:
8356 - the address of a bit-field reference is supposed to be never
8357 taken; the compiler (generally) will stop on such a construct,
8358 - any other tree is addressable if it is formally addressable,
8359 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
8361 In Ada, the viewpoint is the opposite one: nothing is addressable
8362 at the language level unless explicitly declared so. This means
8363 that the compiler will both make sure that the trees representing
8364 references to addressable ("aliased" in Ada parlance) objects are
8365 addressable and make no real attempts at ensuring that the trees
8366 representing references to non-addressable objects are addressable.
8368 In the first case, Ada is effectively equivalent to C and handing
8369 down the direct result of applying ADDR_EXPR to these trees to the
8370 middle-end works flawlessly. In the second case, Ada cannot afford
8371 to consider the program as erroneous if the address of trees that
8372 are not addressable is requested for technical reasons, unlike C;
8373 as a consequence, the Ada compiler must arrange for either making
8374 sure that this address is not requested in the middle-end or for
8375 compensating by inserting temporaries if it is requested in Gigi.
8377 The first goal can be achieved because the middle-end should not
8378 request the address of non-addressable trees on its own; the only
8379 exception is for the invocation of low-level block operations like
8380 memcpy, for which the addressability requirements are lower since
8381 the type's alignment can be disregarded. In practice, this means
8382 that Gigi must make sure that such operations cannot be applied to
8383 non-BLKmode bit-fields.
8385 The second goal is achieved by means of the addressable_p predicate,
8386 which computes whether a temporary must be inserted by Gigi when the
8387 address of a tree is requested; if so, the address of the temporary
8388 will be used in lieu of that of the original tree and some glue code
8389 generated to connect everything together. */
8392 addressable_p (tree gnu_expr, tree gnu_type)
8394 /* For an integral type, the size of the actual type of the object may not
8395 be greater than that of the expected type, otherwise an indirect access
8396 in the latter type wouldn't correctly set all the bits of the object. */
8398 && INTEGRAL_TYPE_P (gnu_type)
8399 && smaller_form_type_p (gnu_type, TREE_TYPE (gnu_expr)))
8402 /* The size of the actual type of the object may not be smaller than that
8403 of the expected type, otherwise an indirect access in the latter type
8404 would be larger than the object. But only record types need to be
8405 considered in practice for this case. */
8407 && TREE_CODE (gnu_type) == RECORD_TYPE
8408 && smaller_form_type_p (TREE_TYPE (gnu_expr), gnu_type))
8411 switch (TREE_CODE (gnu_expr))
8417 /* All DECLs are addressable: if they are in a register, we can force
8421 case UNCONSTRAINED_ARRAY_REF:
8423 /* Taking the address of a dereference yields the original pointer. */
8428 /* Taking the address yields a pointer to the constant pool. */
8432 /* Taking the address of a static constructor yields a pointer to the
8433 tree constant pool. */
8434 return TREE_STATIC (gnu_expr) ? true : false;
8445 /* All rvalues are deemed addressable since taking their address will
8446 force a temporary to be created by the middle-end. */
8450 /* The address of a compound expression is that of its 2nd operand. */
8451 return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type);
8454 /* We accept &COND_EXPR as soon as both operands are addressable and
8455 expect the outcome to be the address of the selected operand. */
8456 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
8457 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
8460 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
8461 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
8462 the field is sufficiently aligned, in case it is subject
8463 to a pragma Component_Alignment. But we don't need to
8464 check the alignment of the containing record, as it is
8465 guaranteed to be not smaller than that of its most
8466 aligned field that is not a bit-field. */
8467 && (!STRICT_ALIGNMENT
8468 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
8469 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
8470 /* The field of a padding record is always addressable. */
8471 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
8472 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8474 case ARRAY_REF: case ARRAY_RANGE_REF:
8475 case REALPART_EXPR: case IMAGPART_EXPR:
8477 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
8480 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
8481 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8483 case VIEW_CONVERT_EXPR:
8485 /* This is addressable if we can avoid a copy. */
8486 tree type = TREE_TYPE (gnu_expr);
8487 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
8488 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
8489 && (!STRICT_ALIGNMENT
8490 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
8491 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
8492 || ((TYPE_MODE (type) == BLKmode
8493 || TYPE_MODE (inner_type) == BLKmode)
8494 && (!STRICT_ALIGNMENT
8495 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
8496 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
8497 || TYPE_ALIGN_OK (type)
8498 || TYPE_ALIGN_OK (inner_type))))
8499 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
8507 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
8508 a separate Freeze node exists, delay the bulk of the processing. Otherwise
8509 make a GCC type for GNAT_ENTITY and set up the correspondence. */
8512 process_type (Entity_Id gnat_entity)
8515 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
8518 /* If we are to delay elaboration of this type, just do any
8519 elaborations needed for expressions within the declaration and
8520 make a dummy type entry for this node and its Full_View (if
8521 any) in case something points to it. Don't do this if it
8522 has already been done (the only way that can happen is if
8523 the private completion is also delayed). */
8524 if (Present (Freeze_Node (gnat_entity))
8525 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
8526 && Present (Full_View (gnat_entity))
8527 && Freeze_Node (Full_View (gnat_entity))
8528 && !present_gnu_tree (Full_View (gnat_entity))))
8530 elaborate_entity (gnat_entity);
8534 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
8535 save_gnu_tree (gnat_entity, gnu_decl, false);
8536 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
8537 && Present (Full_View (gnat_entity)))
8539 if (Has_Completion_In_Body (gnat_entity))
8540 DECL_TAFT_TYPE_P (gnu_decl) = 1;
8541 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
8548 /* If we saved away a dummy type for this node it means that this
8549 made the type that corresponds to the full type of an incomplete
8550 type. Clear that type for now and then update the type in the
8554 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
8555 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
8557 save_gnu_tree (gnat_entity, NULL_TREE, false);
8560 /* Now fully elaborate the type. */
8561 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
8562 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
8564 /* If we have an old type and we've made pointers to this type, update those
8565 pointers. If this is a Taft amendment type in the main unit, we need to
8566 mark the type as used since other units referencing it don't see the full
8567 declaration and, therefore, cannot mark it as used themselves. */
8570 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
8571 TREE_TYPE (gnu_new));
8572 if (DECL_TAFT_TYPE_P (gnu_old))
8573 used_types_insert (TREE_TYPE (gnu_new));
8576 /* If this is a record type corresponding to a task or protected type
8577 that is a completion of an incomplete type, perform a similar update
8578 on the type. ??? Including protected types here is a guess. */
8579 if (IN (Ekind (gnat_entity), Record_Kind)
8580 && Is_Concurrent_Record_Type (gnat_entity)
8581 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
8584 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
8586 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
8588 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
8591 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
8592 TREE_TYPE (gnu_new));
8596 /* GNAT_ENTITY is the type of the resulting constructor, GNAT_ASSOC is the
8597 front of the Component_Associations of an N_Aggregate and GNU_TYPE is the
8598 GCC type of the corresponding record type. Return the CONSTRUCTOR. */
8601 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
8603 tree gnu_list = NULL_TREE, gnu_result;
8605 /* We test for GNU_FIELD being empty in the case where a variant
8606 was the last thing since we don't take things off GNAT_ASSOC in
8607 that case. We check GNAT_ASSOC in case we have a variant, but it
8610 for (; Present (gnat_assoc); gnat_assoc = Next (gnat_assoc))
8612 Node_Id gnat_field = First (Choices (gnat_assoc));
8613 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
8614 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
8616 /* The expander is supposed to put a single component selector name
8617 in every record component association. */
8618 gcc_assert (No (Next (gnat_field)));
8620 /* Ignore fields that have Corresponding_Discriminants since we'll
8621 be setting that field in the parent. */
8622 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
8623 && Is_Tagged_Type (Scope (Entity (gnat_field))))
8626 /* Also ignore discriminants of Unchecked_Unions. */
8627 if (Is_Unchecked_Union (gnat_entity)
8628 && Ekind (Entity (gnat_field)) == E_Discriminant)
8631 /* Before assigning a value in an aggregate make sure range checks
8632 are done if required. Then convert to the type of the field. */
8633 if (Do_Range_Check (Expression (gnat_assoc)))
8634 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
8636 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
8638 /* Add the field and expression to the list. */
8639 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
8642 gnu_result = extract_values (gnu_list, gnu_type);
8644 #ifdef ENABLE_CHECKING
8645 /* Verify that every entry in GNU_LIST was used. */
8646 for (; gnu_list; gnu_list = TREE_CHAIN (gnu_list))
8647 gcc_assert (TREE_ADDRESSABLE (gnu_list));
8653 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
8654 the first element of an array aggregate. It may itself be an aggregate.
8655 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
8656 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
8657 for range checking. */
8660 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
8661 Entity_Id gnat_component_type)
8663 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
8665 VEC(constructor_elt,gc) *gnu_expr_vec = NULL;
8667 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
8669 /* If the expression is itself an array aggregate then first build the
8670 innermost constructor if it is part of our array (multi-dimensional
8672 if (Nkind (gnat_expr) == N_Aggregate
8673 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
8674 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
8675 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
8676 TREE_TYPE (gnu_array_type),
8677 gnat_component_type);
8680 gnu_expr = gnat_to_gnu (gnat_expr);
8682 /* Before assigning the element to the array, make sure it is
8684 if (Do_Range_Check (gnat_expr))
8685 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
8688 CONSTRUCTOR_APPEND_ELT (gnu_expr_vec, gnu_index,
8689 convert (TREE_TYPE (gnu_array_type), gnu_expr));
8691 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node);
8694 return gnat_build_constructor (gnu_array_type, gnu_expr_vec);
8697 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
8698 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
8699 of the associations that are from RECORD_TYPE. If we see an internal
8700 record, make a recursive call to fill it in as well. */
8703 extract_values (tree values, tree record_type)
8706 VEC(constructor_elt,gc) *v = NULL;
8708 for (field = TYPE_FIELDS (record_type); field; field = DECL_CHAIN (field))
8712 /* _Parent is an internal field, but may have values in the aggregate,
8713 so check for values first. */
8714 if ((tem = purpose_member (field, values)))
8716 value = TREE_VALUE (tem);
8717 TREE_ADDRESSABLE (tem) = 1;
8720 else if (DECL_INTERNAL_P (field))
8722 value = extract_values (values, TREE_TYPE (field));
8723 if (TREE_CODE (value) == CONSTRUCTOR
8724 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
8728 /* If we have a record subtype, the names will match, but not the
8729 actual FIELD_DECLs. */
8730 for (tem = values; tem; tem = TREE_CHAIN (tem))
8731 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
8733 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
8734 TREE_ADDRESSABLE (tem) = 1;
8740 CONSTRUCTOR_APPEND_ELT (v, field, value);
8743 return gnat_build_constructor (record_type, v);
8746 /* EXP is to be treated as an array or record. Handle the cases when it is
8747 an access object and perform the required dereferences. */
8750 maybe_implicit_deref (tree exp)
8752 /* If the type is a pointer, dereference it. */
8753 if (POINTER_TYPE_P (TREE_TYPE (exp))
8754 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
8755 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
8757 /* If we got a padded type, remove it too. */
8758 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
8759 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
8764 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
8765 location and false if it doesn't. In the former case, set the Gigi global
8766 variable REF_FILENAME to the simple debug file name as given by sinput. */
8769 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
8771 if (Sloc == No_Location)
8774 if (Sloc <= Standard_Location)
8776 *locus = BUILTINS_LOCATION;
8781 Source_File_Index file = Get_Source_File_Index (Sloc);
8782 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
8783 Column_Number column = Get_Column_Number (Sloc);
8784 struct line_map *map = LINEMAPS_ORDINARY_MAP_AT (line_table, file - 1);
8786 /* We can have zero if pragma Source_Reference is in effect. */
8790 /* Translate the location. */
8791 *locus = linemap_position_for_line_and_column (map, line, column);
8795 = IDENTIFIER_POINTER
8797 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
8802 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
8803 don't do anything if it doesn't correspond to a source location. */
8806 set_expr_location_from_node (tree node, Node_Id gnat_node)
8810 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
8813 SET_EXPR_LOCATION (node, locus);
8816 /* More elaborate version of set_expr_location_from_node to be used in more
8817 general contexts, for example the result of the translation of a generic
8821 set_gnu_expr_location_from_node (tree node, Node_Id gnat_node)
8823 /* Set the location information on the node if it is a real expression.
8824 References can be reused for multiple GNAT nodes and they would get
8825 the location information of their last use. Also make sure not to
8826 overwrite an existing location as it is probably more precise. */
8828 switch (TREE_CODE (node))
8831 case NON_LVALUE_EXPR:
8835 if (EXPR_P (TREE_OPERAND (node, 1)))
8836 set_gnu_expr_location_from_node (TREE_OPERAND (node, 1), gnat_node);
8838 /* ... fall through ... */
8841 if (!REFERENCE_CLASS_P (node) && !EXPR_HAS_LOCATION (node))
8843 set_expr_location_from_node (node, gnat_node);
8844 set_end_locus_from_node (node, gnat_node);
8850 /* Return a colon-separated list of encodings contained in encoded Ada
8854 extract_encoding (const char *name)
8856 char *encoding = (char *) ggc_alloc_atomic (strlen (name));
8857 get_encoding (name, encoding);
8861 /* Extract the Ada name from an encoded name. */
8864 decode_name (const char *name)
8866 char *decoded = (char *) ggc_alloc_atomic (strlen (name) * 2 + 60);
8867 __gnat_decode (name, decoded, 0);
8871 /* Post an error message. MSG is the error message, properly annotated.
8872 NODE is the node at which to post the error and the node to use for the
8873 '&' substitution. */
8876 post_error (const char *msg, Node_Id node)
8878 String_Template temp;
8881 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
8882 fp.Array = msg, fp.Bounds = &temp;
8884 Error_Msg_N (fp, node);
8887 /* Similar to post_error, but NODE is the node at which to post the error and
8888 ENT is the node to use for the '&' substitution. */
8891 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
8893 String_Template temp;
8896 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
8897 fp.Array = msg, fp.Bounds = &temp;
8899 Error_Msg_NE (fp, node, ent);
8902 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
8905 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int num)
8907 Error_Msg_Uint_1 = UI_From_Int (num);
8908 post_error_ne (msg, node, ent);
8911 /* Set the end_locus information for GNU_NODE, if any, from an explicit end
8912 location associated with GNAT_NODE or GNAT_NODE itself, whichever makes
8913 most sense. Return true if a sensible assignment was performed. */
8916 set_end_locus_from_node (tree gnu_node, Node_Id gnat_node)
8918 Node_Id gnat_end_label = Empty;
8919 location_t end_locus;
8921 /* Pick the GNAT node of which we'll take the sloc to assign to the GCC node
8922 end_locus when there is one. We consider only GNAT nodes with a possible
8923 End_Label attached. If the End_Label actually was unassigned, fallback
8924 on the orginal node. We'd better assign an explicit sloc associated with
8925 the outer construct in any case. */
8927 switch (Nkind (gnat_node))
8929 case N_Package_Body:
8930 case N_Subprogram_Body:
8931 case N_Block_Statement:
8932 gnat_end_label = End_Label (Handled_Statement_Sequence (gnat_node));
8935 case N_Package_Declaration:
8936 gnat_end_label = End_Label (Specification (gnat_node));
8943 gnat_node = Present (gnat_end_label) ? gnat_end_label : gnat_node;
8945 /* Some expanded subprograms have neither an End_Label nor a Sloc
8946 attached. Notify that to callers. */
8948 if (!Sloc_to_locus (Sloc (gnat_node), &end_locus))
8951 switch (TREE_CODE (gnu_node))
8954 BLOCK_SOURCE_END_LOCATION (BIND_EXPR_BLOCK (gnu_node)) = end_locus;
8958 DECL_STRUCT_FUNCTION (gnu_node)->function_end_locus = end_locus;
8966 /* Similar to post_error_ne, but T is a GCC tree representing the number to
8967 write. If T represents a constant, the text inside curly brackets in
8968 MSG will be output (presumably including a '^'). Otherwise it will not
8969 be output and the text inside square brackets will be output instead. */
8972 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
8974 char *new_msg = XALLOCAVEC (char, strlen (msg) + 1);
8975 char start_yes, end_yes, start_no, end_no;
8979 if (TREE_CODE (t) == INTEGER_CST)
8981 Error_Msg_Uint_1 = UI_From_gnu (t);
8982 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
8985 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
8987 for (p = msg, q = new_msg; *p; p++)
8989 if (*p == start_yes)
8990 for (p++; *p != end_yes; p++)
8992 else if (*p == start_no)
8993 for (p++; *p != end_no; p++)
9001 post_error_ne (new_msg, node, ent);
9004 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
9007 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
9010 Error_Msg_Uint_2 = UI_From_Int (num);
9011 post_error_ne_tree (msg, node, ent, t);
9014 /* Initialize the table that maps GNAT codes to GCC codes for simple
9015 binary and unary operations. */
9018 init_code_table (void)
9020 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
9021 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
9023 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
9024 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
9025 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
9026 gnu_codes[N_Op_Eq] = EQ_EXPR;
9027 gnu_codes[N_Op_Ne] = NE_EXPR;
9028 gnu_codes[N_Op_Lt] = LT_EXPR;
9029 gnu_codes[N_Op_Le] = LE_EXPR;
9030 gnu_codes[N_Op_Gt] = GT_EXPR;
9031 gnu_codes[N_Op_Ge] = GE_EXPR;
9032 gnu_codes[N_Op_Add] = PLUS_EXPR;
9033 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
9034 gnu_codes[N_Op_Multiply] = MULT_EXPR;
9035 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
9036 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
9037 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
9038 gnu_codes[N_Op_Abs] = ABS_EXPR;
9039 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
9040 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
9041 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
9042 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
9043 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
9044 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
9047 /* Return a label to branch to for the exception type in KIND or NULL_TREE
9051 get_exception_label (char kind)
9053 if (kind == N_Raise_Constraint_Error)
9054 return VEC_last (tree, gnu_constraint_error_label_stack);
9055 else if (kind == N_Raise_Storage_Error)
9056 return VEC_last (tree, gnu_storage_error_label_stack);
9057 else if (kind == N_Raise_Program_Error)
9058 return VEC_last (tree, gnu_program_error_label_stack);
9063 /* Return the decl for the current elaboration procedure. */
9066 get_elaboration_procedure (void)
9068 return VEC_last (tree, gnu_elab_proc_stack);
9071 #include "gt-ada-trans.h"