1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2010, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License 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"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
56 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
57 for fear of running out of stack space. If we need more, we use xmalloc
59 #define ALLOCA_THRESHOLD 1000
61 /* Let code below know whether we are targetting VMS without need of
62 intrusive preprocessor directives. */
63 #ifndef TARGET_ABI_OPEN_VMS
64 #define TARGET_ABI_OPEN_VMS 0
67 /* For efficient float-to-int rounding, it is necessary to know whether
68 floating-point arithmetic may use wider intermediate results. When
69 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
70 that arithmetic does not widen if double precision is emulated. */
71 #ifndef FP_ARITH_MAY_WIDEN
72 #if defined(HAVE_extendsfdf2)
73 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
75 #define FP_ARITH_MAY_WIDEN 0
79 /* Pointers to front-end tables accessed through macros. */
80 struct Node *Nodes_Ptr;
81 Node_Id *Next_Node_Ptr;
82 Node_Id *Prev_Node_Ptr;
83 struct Elist_Header *Elists_Ptr;
84 struct Elmt_Item *Elmts_Ptr;
85 struct String_Entry *Strings_Ptr;
86 Char_Code *String_Chars_Ptr;
87 struct List_Header *List_Headers_Ptr;
89 /* Highest number in the front-end node table. */
92 /* Current node being treated, in case abort called. */
93 Node_Id error_gnat_node;
95 /* True when gigi is being called on an analyzed but unexpanded
96 tree, and the only purpose of the call is to properly annotate
97 types with representation information. */
98 bool type_annotate_only;
100 /* Current filename without path. */
101 const char *ref_filename;
103 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
104 of unconstrained array IN parameters to avoid emitting a great deal of
105 redundant instructions to recompute them each time. */
106 struct GTY (()) parm_attr_d {
107 int id; /* GTY doesn't like Entity_Id. */
114 typedef struct parm_attr_d *parm_attr;
116 DEF_VEC_P(parm_attr);
117 DEF_VEC_ALLOC_P(parm_attr,gc);
119 struct GTY(()) language_function {
120 VEC(parm_attr,gc) *parm_attr_cache;
123 #define f_parm_attr_cache \
124 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
126 /* A structure used to gather together information about a statement group.
127 We use this to gather related statements, for example the "then" part
128 of a IF. In the case where it represents a lexical scope, we may also
129 have a BLOCK node corresponding to it and/or cleanups. */
131 struct GTY((chain_next ("%h.previous"))) stmt_group {
132 struct stmt_group *previous; /* Previous code group. */
133 tree stmt_list; /* List of statements for this code group. */
134 tree block; /* BLOCK for this code group, if any. */
135 tree cleanups; /* Cleanups for this code group, if any. */
138 static GTY(()) struct stmt_group *current_stmt_group;
140 /* List of unused struct stmt_group nodes. */
141 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
143 /* A structure used to record information on elaboration procedures
144 we've made and need to process.
146 ??? gnat_node should be Node_Id, but gengtype gets confused. */
148 struct GTY((chain_next ("%h.next"))) elab_info {
149 struct elab_info *next; /* Pointer to next in chain. */
150 tree elab_proc; /* Elaboration procedure. */
151 int gnat_node; /* The N_Compilation_Unit. */
154 static GTY(()) struct elab_info *elab_info_list;
156 /* Free list of TREE_LIST nodes used for stacks. */
157 static GTY((deletable)) tree gnu_stack_free_list;
159 /* List of TREE_LIST nodes representing a stack of exception pointer
160 variables. TREE_VALUE is the VAR_DECL that stores the address of
161 the raised exception. Nonzero means we are in an exception
162 handler. Not used in the zero-cost case. */
163 static GTY(()) tree gnu_except_ptr_stack;
165 /* List of TREE_LIST nodes used to store the current elaboration procedure
166 decl. TREE_VALUE is the decl. */
167 static GTY(()) tree gnu_elab_proc_stack;
169 /* Variable that stores a list of labels to be used as a goto target instead of
170 a return in some functions. See processing for N_Subprogram_Body. */
171 static GTY(()) tree gnu_return_label_stack;
173 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
174 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
175 static GTY(()) tree gnu_loop_label_stack;
177 /* List of TREE_LIST nodes representing labels for switch statements.
178 TREE_VALUE of each entry is the label at the end of the switch. */
179 static GTY(()) tree gnu_switch_label_stack;
181 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
182 static GTY(()) tree gnu_constraint_error_label_stack;
183 static GTY(()) tree gnu_storage_error_label_stack;
184 static GTY(()) tree gnu_program_error_label_stack;
186 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
187 static enum tree_code gnu_codes[Number_Node_Kinds];
189 static void init_code_table (void);
190 static void Compilation_Unit_to_gnu (Node_Id);
191 static void record_code_position (Node_Id);
192 static void insert_code_for (Node_Id);
193 static void add_cleanup (tree, Node_Id);
194 static tree unshare_save_expr (tree *, int *, void *);
195 static void add_stmt_list (List_Id);
196 static void push_exception_label_stack (tree *, Entity_Id);
197 static tree build_stmt_group (List_Id, bool);
198 static void push_stack (tree *, tree, tree);
199 static void pop_stack (tree *);
200 static enum gimplify_status gnat_gimplify_stmt (tree *);
201 static void elaborate_all_entities (Node_Id);
202 static void process_freeze_entity (Node_Id);
203 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
204 static tree emit_range_check (tree, Node_Id, Node_Id);
205 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
206 static tree emit_check (tree, tree, int, Node_Id);
207 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
208 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
209 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
210 static bool smaller_form_type_p (tree, tree);
211 static bool addressable_p (tree, tree);
212 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
213 static tree extract_values (tree, tree);
214 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
215 static tree maybe_implicit_deref (tree);
216 static void set_expr_location_from_node (tree, Node_Id);
217 static int lvalue_required_p (Node_Id, tree, bool, bool, bool);
219 /* Hooks for debug info back-ends, only supported and used in a restricted set
220 of configurations. */
221 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
222 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
224 /* This is the main program of the back-end. It sets up all the table
225 structures and then generates code. */
228 gigi (Node_Id gnat_root, int max_gnat_node, int number_name ATTRIBUTE_UNUSED,
229 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
230 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
231 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
232 struct List_Header *list_headers_ptr, Nat number_file,
233 struct File_Info_Type *file_info_ptr,
234 Entity_Id standard_boolean, Entity_Id standard_integer,
235 Entity_Id standard_character, Entity_Id standard_long_long_float,
236 Entity_Id standard_exception_type, Int gigi_operating_mode)
238 Entity_Id gnat_literal;
239 tree long_long_float_type, exception_type, t;
240 tree int64_type = gnat_type_for_size (64, 0);
241 struct elab_info *info;
244 max_gnat_nodes = max_gnat_node;
246 Nodes_Ptr = nodes_ptr;
247 Next_Node_Ptr = next_node_ptr;
248 Prev_Node_Ptr = prev_node_ptr;
249 Elists_Ptr = elists_ptr;
250 Elmts_Ptr = elmts_ptr;
251 Strings_Ptr = strings_ptr;
252 String_Chars_Ptr = string_chars_ptr;
253 List_Headers_Ptr = list_headers_ptr;
255 type_annotate_only = (gigi_operating_mode == 1);
257 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
259 /* Declare the name of the compilation unit as the first global
260 name in order to make the middle-end fully deterministic. */
261 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
262 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
264 for (i = 0; i < number_file; i++)
266 /* Use the identifier table to make a permanent copy of the filename as
267 the name table gets reallocated after Gigi returns but before all the
268 debugging information is output. The __gnat_to_canonical_file_spec
269 call translates filenames from pragmas Source_Reference that contain
270 host style syntax not understood by gdb. */
274 (__gnat_to_canonical_file_spec
275 (Get_Name_String (file_info_ptr[i].File_Name))));
277 /* We rely on the order isomorphism between files and line maps. */
278 gcc_assert ((int) line_table->used == i);
280 /* We create the line map for a source file at once, with a fixed number
281 of columns chosen to avoid jumping over the next power of 2. */
282 linemap_add (line_table, LC_ENTER, 0, filename, 1);
283 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
284 linemap_position_for_column (line_table, 252 - 1);
285 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
288 /* Initialize ourselves. */
293 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
295 if (type_annotate_only)
297 TYPE_SIZE (void_type_node) = bitsize_zero_node;
298 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
301 /* If the GNU type extensions to DWARF are available, setup the hooks. */
302 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
303 /* We condition the name demangling and the generation of type encoding
304 strings on -gdwarf+ and always set descriptive types on. */
305 if (use_gnu_debug_info_extensions)
307 dwarf2out_set_type_encoding_func (extract_encoding);
308 dwarf2out_set_demangle_name_func (decode_name);
310 dwarf2out_set_descriptive_type_func (get_parallel_type);
313 /* Enable GNAT stack checking method if needed */
314 if (!Stack_Check_Probes_On_Target)
315 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
317 /* Retrieve alignment settings. */
318 double_float_alignment = get_target_double_float_alignment ();
319 double_scalar_alignment = get_target_double_scalar_alignment ();
321 /* Record the builtin types. Define `integer' and `character' first so that
322 dbx will output them first. */
323 record_builtin_type ("integer", integer_type_node);
324 record_builtin_type ("character", unsigned_char_type_node);
325 record_builtin_type ("boolean", boolean_type_node);
326 record_builtin_type ("void", void_type_node);
328 /* Save the type we made for integer as the type for Standard.Integer. */
329 save_gnu_tree (Base_Type (standard_integer),
330 TYPE_NAME (integer_type_node),
333 /* Likewise for character as the type for Standard.Character. */
334 save_gnu_tree (Base_Type (standard_character),
335 TYPE_NAME (unsigned_char_type_node),
338 /* Likewise for boolean as the type for Standard.Boolean. */
339 save_gnu_tree (Base_Type (standard_boolean),
340 TYPE_NAME (boolean_type_node),
342 gnat_literal = First_Literal (Base_Type (standard_boolean));
343 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
344 gcc_assert (t == boolean_false_node);
345 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
346 boolean_type_node, t, true, false, false, false,
348 DECL_IGNORED_P (t) = 1;
349 save_gnu_tree (gnat_literal, t, false);
350 gnat_literal = Next_Literal (gnat_literal);
351 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
352 gcc_assert (t == boolean_true_node);
353 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
354 boolean_type_node, t, true, false, false, false,
356 DECL_IGNORED_P (t) = 1;
357 save_gnu_tree (gnat_literal, t, false);
359 void_ftype = build_function_type (void_type_node, NULL_TREE);
360 ptr_void_ftype = build_pointer_type (void_ftype);
362 /* Now declare runtime functions. */
363 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
365 /* malloc is a function declaration tree for a function to allocate
368 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
369 build_function_type (ptr_void_type_node,
370 tree_cons (NULL_TREE,
372 NULL_TREE, false, true, true, NULL, Empty);
373 DECL_IS_MALLOC (malloc_decl) = 1;
375 /* malloc32 is a function declaration tree for a function to allocate
376 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
378 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
379 build_function_type (ptr_void_type_node,
380 tree_cons (NULL_TREE,
382 NULL_TREE, false, true, true, NULL, Empty);
383 DECL_IS_MALLOC (malloc32_decl) = 1;
385 /* free is a function declaration tree for a function to free memory. */
387 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
388 build_function_type (void_type_node,
389 tree_cons (NULL_TREE,
392 NULL_TREE, false, true, true, NULL, Empty);
394 /* This is used for 64-bit multiplication with overflow checking. */
396 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
397 build_function_type_list (int64_type, int64_type,
398 int64_type, NULL_TREE),
399 NULL_TREE, false, true, true, NULL, Empty);
401 /* Name of the _Parent field in tagged record types. */
402 parent_name_id = get_identifier (Get_Name_String (Name_uParent));
404 /* Make the types and functions used for exception processing. */
406 = build_array_type (gnat_type_for_mode (Pmode, 0),
407 build_index_type (size_int (5)));
408 record_builtin_type ("JMPBUF_T", jmpbuf_type);
409 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
411 /* Functions to get and set the jumpbuf pointer for the current thread. */
413 = create_subprog_decl
414 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
415 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
416 NULL_TREE, false, true, true, NULL, Empty);
417 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
418 DECL_PURE_P (get_jmpbuf_decl) = 1;
419 DECL_IGNORED_P (get_jmpbuf_decl) = 1;
422 = create_subprog_decl
423 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
425 build_function_type (void_type_node,
426 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
427 NULL_TREE, false, true, true, NULL, Empty);
428 DECL_IGNORED_P (set_jmpbuf_decl) = 1;
430 /* setjmp returns an integer and has one operand, which is a pointer to
433 = create_subprog_decl
434 (get_identifier ("__builtin_setjmp"), NULL_TREE,
435 build_function_type (integer_type_node,
436 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
437 NULL_TREE, false, true, true, NULL, Empty);
438 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
439 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
441 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
443 update_setjmp_buf_decl
444 = create_subprog_decl
445 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
446 build_function_type (void_type_node,
447 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
448 NULL_TREE, false, true, true, NULL, Empty);
449 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
450 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
452 /* Hooks to call when entering/leaving an exception handler. */
454 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
455 build_function_type (void_type_node,
456 tree_cons (NULL_TREE,
459 NULL_TREE, false, true, true, NULL, Empty);
460 DECL_IGNORED_P (begin_handler_decl) = 1;
463 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
464 build_function_type (void_type_node,
465 tree_cons (NULL_TREE,
468 NULL_TREE, false, true, true, NULL, Empty);
469 DECL_IGNORED_P (end_handler_decl) = 1;
471 /* If in no exception handlers mode, all raise statements are redirected to
472 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
473 this procedure will never be called in this mode. */
474 if (No_Exception_Handlers_Set ())
477 = create_subprog_decl
478 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
479 build_function_type (void_type_node,
480 tree_cons (NULL_TREE,
482 (unsigned_char_type_node),
483 tree_cons (NULL_TREE,
486 NULL_TREE, false, true, true, NULL, Empty);
488 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
489 gnat_raise_decls[i] = decl;
492 /* Otherwise, make one decl for each exception reason. */
493 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
497 sprintf (name, "__gnat_rcheck_%.2d", i);
499 = create_subprog_decl
500 (get_identifier (name), NULL_TREE,
501 build_function_type (void_type_node,
502 tree_cons (NULL_TREE,
504 (unsigned_char_type_node),
505 tree_cons (NULL_TREE,
508 NULL_TREE, false, true, true, NULL, Empty);
511 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
513 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
514 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
515 TREE_TYPE (gnat_raise_decls[i])
516 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
520 /* Set the types that GCC and Gigi use from the front end. */
522 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
523 except_type_node = TREE_TYPE (exception_type);
525 /* Make other functions used for exception processing. */
527 = create_subprog_decl
528 (get_identifier ("system__soft_links__get_gnat_exception"),
530 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
531 NULL_TREE, false, true, true, NULL, Empty);
532 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
533 DECL_PURE_P (get_excptr_decl) = 1;
536 = create_subprog_decl
537 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
538 build_function_type (void_type_node,
539 tree_cons (NULL_TREE,
540 build_pointer_type (except_type_node),
542 NULL_TREE, false, true, true, NULL, Empty);
544 /* Indicate that these never return. */
545 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
546 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
547 TREE_TYPE (raise_nodefer_decl)
548 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
551 /* Build the special descriptor type and its null node if needed. */
552 if (TARGET_VTABLE_USES_DESCRIPTORS)
554 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
555 tree field_list = NULL_TREE, null_list = NULL_TREE;
558 fdesc_type_node = make_node (RECORD_TYPE);
560 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
563 = create_field_decl (NULL_TREE, ptr_void_ftype, fdesc_type_node,
564 NULL_TREE, NULL_TREE, 0, 1);
565 TREE_CHAIN (field) = field_list;
567 null_list = tree_cons (field, null_node, null_list);
570 finish_record_type (fdesc_type_node, nreverse (field_list), 0, false);
571 record_builtin_type ("descriptor", fdesc_type_node);
572 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
576 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
578 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
580 /* In this case, the builtin floating point types are VAX float,
581 so make up a type for use. */
582 longest_float_type_node = make_node (REAL_TYPE);
583 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
584 layout_type (longest_float_type_node);
585 record_builtin_type ("longest float type", longest_float_type_node);
588 longest_float_type_node = TREE_TYPE (long_long_float_type);
590 /* Dummy objects to materialize "others" and "all others" in the exception
591 tables. These are exported by a-exexpr.adb, so see this unit for the
594 = create_var_decl (get_identifier ("OTHERS"),
595 get_identifier ("__gnat_others_value"),
596 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
599 = create_var_decl (get_identifier ("ALL_OTHERS"),
600 get_identifier ("__gnat_all_others_value"),
601 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
603 main_identifier_node = get_identifier ("main");
605 /* Install the builtins we might need, either internally or as
606 user available facilities for Intrinsic imports. */
607 gnat_install_builtins ();
609 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
610 gnu_constraint_error_label_stack
611 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
612 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
613 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
615 /* Process any Pragma Ident for the main unit. */
616 #ifdef ASM_OUTPUT_IDENT
617 if (Present (Ident_String (Main_Unit)))
620 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
623 /* If we are using the GCC exception mechanism, let GCC know. */
624 if (Exception_Mechanism == Back_End_Exceptions)
627 /* Now translate the compilation unit proper. */
628 Compilation_Unit_to_gnu (gnat_root);
630 /* Finally see if we have any elaboration procedures to deal with. */
631 for (info = elab_info_list; info; info = info->next)
633 tree gnu_body = DECL_SAVED_TREE (info->elab_proc), gnu_stmts;
635 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
636 the gimplifier for obvious reasons, but it turns out that we need to
637 unshare them for the global level because of SAVE_EXPRs made around
638 checks for global objects and around allocators for global objects
639 of variable size, in order to prevent node sharing in the underlying
640 expression. Note that this implicitly assumes that the SAVE_EXPR
641 nodes themselves are not shared between subprograms, which would be
642 an upstream bug for which we would not change the outcome. */
643 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
645 /* We should have a BIND_EXPR but it may not have any statements in it.
646 If it doesn't have any, we have nothing to do except for setting the
647 flag on the GNAT node. Otherwise, process the function as others. */
648 gnu_stmts = gnu_body;
649 if (TREE_CODE (gnu_stmts) == BIND_EXPR)
650 gnu_stmts = BIND_EXPR_BODY (gnu_stmts);
651 if (!gnu_stmts || !STATEMENT_LIST_HEAD (gnu_stmts))
652 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
655 begin_subprog_body (info->elab_proc);
656 end_subprog_body (gnu_body);
660 /* We cannot track the location of errors past this point. */
661 error_gnat_node = Empty;
664 /* Return a positive value if an lvalue is required for GNAT_NODE, which is
665 an N_Attribute_Reference. */
668 lvalue_required_for_attribute_p (Node_Id gnat_node)
670 switch (Get_Attribute_Id (Attribute_Name (gnat_node)))
678 case Attr_Range_Length:
680 case Attr_Object_Size:
681 case Attr_Value_Size:
682 case Attr_Component_Size:
683 case Attr_Max_Size_In_Storage_Elements:
686 case Attr_Null_Parameter:
687 case Attr_Passed_By_Reference:
688 case Attr_Mechanism_Code:
693 case Attr_Unchecked_Access:
694 case Attr_Unrestricted_Access:
695 case Attr_Code_Address:
696 case Attr_Pool_Address:
699 case Attr_Bit_Position:
709 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
710 is the type that will be used for GNAT_NODE in the translated GNU tree.
711 CONSTANT indicates whether the underlying object represented by GNAT_NODE
712 is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates
713 whether its value is the address of a constant and ALIASED whether it is
714 aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored.
716 The function climbs up the GNAT tree starting from the node and returns 1
717 upon encountering a node that effectively requires an lvalue downstream.
718 It returns int instead of bool to facilitate usage in non-purely binary
722 lvalue_required_p (Node_Id gnat_node, tree gnu_type, bool constant,
723 bool address_of_constant, bool aliased)
725 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
727 switch (Nkind (gnat_parent))
732 case N_Attribute_Reference:
733 return lvalue_required_for_attribute_p (gnat_parent);
735 case N_Parameter_Association:
736 case N_Function_Call:
737 case N_Procedure_Call_Statement:
738 /* If the parameter is by reference, an lvalue is required. */
740 || must_pass_by_ref (gnu_type)
741 || default_pass_by_ref (gnu_type));
743 case N_Indexed_Component:
744 /* Only the array expression can require an lvalue. */
745 if (Prefix (gnat_parent) != gnat_node)
748 /* ??? Consider that referencing an indexed component with a
749 non-constant index forces the whole aggregate to memory.
750 Note that N_Integer_Literal is conservative, any static
751 expression in the RM sense could probably be accepted. */
752 for (gnat_temp = First (Expressions (gnat_parent));
754 gnat_temp = Next (gnat_temp))
755 if (Nkind (gnat_temp) != N_Integer_Literal)
758 /* ... fall through ... */
761 /* Only the array expression can require an lvalue. */
762 if (Prefix (gnat_parent) != gnat_node)
765 aliased |= Has_Aliased_Components (Etype (gnat_node));
766 return lvalue_required_p (gnat_parent, gnu_type, constant,
767 address_of_constant, aliased);
769 case N_Selected_Component:
770 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
771 return lvalue_required_p (gnat_parent, gnu_type, constant,
772 address_of_constant, aliased);
774 case N_Object_Renaming_Declaration:
775 /* We need to make a real renaming only if the constant object is
776 aliased or if we may use a renaming pointer; otherwise we can
777 optimize and return the rvalue. We make an exception if the object
778 is an identifier since in this case the rvalue can be propagated
779 attached to the CONST_DECL. */
782 /* This should match the constant case of the renaming code. */
784 (Underlying_Type (Etype (Name (gnat_parent))))
785 || Nkind (Name (gnat_parent)) == N_Identifier);
787 case N_Object_Declaration:
788 /* We cannot use a constructor if this is an atomic object because
789 the actual assignment might end up being done component-wise. */
790 return ((Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
791 && Is_Atomic (Defining_Entity (gnat_parent)))
792 /* We don't use a constructor if this is a class-wide object
793 because the effective type of the object is the equivalent
794 type of the class-wide subtype and it smashes most of the
795 data into an array of bytes to which we cannot convert. */
796 || Ekind ((Etype (Defining_Entity (gnat_parent))))
797 == E_Class_Wide_Subtype);
799 case N_Assignment_Statement:
800 /* We cannot use a constructor if the LHS is an atomic object because
801 the actual assignment might end up being done component-wise. */
803 || Name (gnat_parent) == gnat_node
804 || (Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
805 && Is_Atomic (Entity (Name (gnat_parent)))));
807 case N_Type_Conversion:
808 case N_Qualified_Expression:
809 /* We must look through all conversions for composite types because we
810 may need to bypass an intermediate conversion to a narrower record
811 type that is generated for a formal conversion, e.g. the conversion
812 to the root type of a hierarchy of tagged types generated for the
813 formal conversion to the class-wide type. */
814 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_node))))
817 /* ... fall through ... */
819 case N_Unchecked_Type_Conversion:
820 return lvalue_required_p (gnat_parent,
821 get_unpadded_type (Etype (gnat_parent)),
822 constant, address_of_constant, aliased);
825 /* We should only reach here through the N_Qualified_Expression case
826 and, therefore, only for composite types. Force an lvalue since
827 a block-copy to the newly allocated area of memory is made. */
830 case N_Explicit_Dereference:
831 /* We look through dereferences for address of constant because we need
832 to handle the special cases listed above. */
833 if (constant && address_of_constant)
834 return lvalue_required_p (gnat_parent,
835 get_unpadded_type (Etype (gnat_parent)),
838 /* ... fall through ... */
847 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
848 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
849 to where we should place the result type. */
852 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
854 Node_Id gnat_temp, gnat_temp_type;
855 tree gnu_result, gnu_result_type;
857 /* Whether we should require an lvalue for GNAT_NODE. Needed in
858 specific circumstances only, so evaluated lazily. < 0 means
859 unknown, > 0 means known true, 0 means known false. */
860 int require_lvalue = -1;
862 /* If GNAT_NODE is a constant, whether we should use the initialization
863 value instead of the constant entity, typically for scalars with an
864 address clause when the parent doesn't require an lvalue. */
865 bool use_constant_initializer = false;
867 /* If the Etype of this node does not equal the Etype of the Entity,
868 something is wrong with the entity map, probably in generic
869 instantiation. However, this does not apply to types. Since we sometime
870 have strange Ekind's, just do this test for objects. Also, if the Etype of
871 the Entity is private, the Etype of the N_Identifier is allowed to be the
872 full type and also we consider a packed array type to be the same as the
873 original type. Similarly, a class-wide type is equivalent to a subtype of
874 itself. Finally, if the types are Itypes, one may be a copy of the other,
875 which is also legal. */
876 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
877 ? gnat_node : Entity (gnat_node));
878 gnat_temp_type = Etype (gnat_temp);
880 gcc_assert (Etype (gnat_node) == gnat_temp_type
881 || (Is_Packed (gnat_temp_type)
882 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
883 || (Is_Class_Wide_Type (Etype (gnat_node)))
884 || (IN (Ekind (gnat_temp_type), Private_Kind)
885 && Present (Full_View (gnat_temp_type))
886 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
887 || (Is_Packed (Full_View (gnat_temp_type))
888 && (Etype (gnat_node)
889 == Packed_Array_Type (Full_View
890 (gnat_temp_type))))))
891 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
892 || !(Ekind (gnat_temp) == E_Variable
893 || Ekind (gnat_temp) == E_Component
894 || Ekind (gnat_temp) == E_Constant
895 || Ekind (gnat_temp) == E_Loop_Parameter
896 || IN (Ekind (gnat_temp), Formal_Kind)));
898 /* If this is a reference to a deferred constant whose partial view is an
899 unconstrained private type, the proper type is on the full view of the
900 constant, not on the full view of the type, which may be unconstrained.
902 This may be a reference to a type, for example in the prefix of the
903 attribute Position, generated for dispatching code (see Make_DT in
904 exp_disp,adb). In that case we need the type itself, not is parent,
905 in particular if it is a derived type */
906 if (Is_Private_Type (gnat_temp_type)
907 && Has_Unknown_Discriminants (gnat_temp_type)
908 && Ekind (gnat_temp) == E_Constant
909 && Present (Full_View (gnat_temp)))
911 gnat_temp = Full_View (gnat_temp);
912 gnat_temp_type = Etype (gnat_temp);
916 /* We want to use the Actual_Subtype if it has already been elaborated,
917 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
919 if ((Ekind (gnat_temp) == E_Constant
920 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
921 && !(Is_Array_Type (Etype (gnat_temp))
922 && Present (Packed_Array_Type (Etype (gnat_temp))))
923 && Present (Actual_Subtype (gnat_temp))
924 && present_gnu_tree (Actual_Subtype (gnat_temp)))
925 gnat_temp_type = Actual_Subtype (gnat_temp);
927 gnat_temp_type = Etype (gnat_node);
930 /* Expand the type of this identifier first, in case it is an enumeral
931 literal, which only get made when the type is expanded. There is no
932 order-of-elaboration issue here. */
933 gnu_result_type = get_unpadded_type (gnat_temp_type);
935 /* If this is a non-imported scalar constant with an address clause,
936 retrieve the value instead of a pointer to be dereferenced unless
937 an lvalue is required. This is generally more efficient and actually
938 required if this is a static expression because it might be used
939 in a context where a dereference is inappropriate, such as a case
940 statement alternative or a record discriminant. There is no possible
941 volatile-ness short-circuit here since Volatile constants must bei
943 if (Ekind (gnat_temp) == E_Constant
944 && Is_Scalar_Type (gnat_temp_type)
945 && !Is_Imported (gnat_temp)
946 && Present (Address_Clause (gnat_temp)))
948 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
949 false, Is_Aliased (gnat_temp));
950 use_constant_initializer = !require_lvalue;
953 if (use_constant_initializer)
955 /* If this is a deferred constant, the initializer is attached to
957 if (Present (Full_View (gnat_temp)))
958 gnat_temp = Full_View (gnat_temp);
960 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
963 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
965 /* If we are in an exception handler, force this variable into memory to
966 ensure optimization does not remove stores that appear redundant but are
967 actually needed in case an exception occurs.
969 ??? Note that we need not do this if the variable is declared within the
970 handler, only if it is referenced in the handler and declared in an
971 enclosing block, but we have no way of testing that right now.
973 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
974 here, but it can now be removed by the Tree aliasing machinery if the
975 address of the variable is never taken. All we can do is to make the
976 variable volatile, which might incur the generation of temporaries just
977 to access the memory in some circumstances. This can be avoided for
978 variables of non-constant size because they are automatically allocated
979 to memory. There might be no way of allocating a proper temporary for
980 them in any case. We only do this for SJLJ though. */
981 if (TREE_VALUE (gnu_except_ptr_stack)
982 && TREE_CODE (gnu_result) == VAR_DECL
983 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
984 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
986 /* Some objects (such as parameters passed by reference, globals of
987 variable size, and renamed objects) actually represent the address
988 of the object. In that case, we must do the dereference. Likewise,
989 deal with parameters to foreign convention subprograms. */
990 if (DECL_P (gnu_result)
991 && (DECL_BY_REF_P (gnu_result)
992 || (TREE_CODE (gnu_result) == PARM_DECL
993 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
995 const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result);
998 if (TREE_CODE (gnu_result) == PARM_DECL
999 && DECL_BY_COMPONENT_PTR_P (gnu_result))
1001 = build_unary_op (INDIRECT_REF, NULL_TREE,
1002 convert (build_pointer_type (gnu_result_type),
1005 /* If it's a renaming pointer and we are at the right binding level,
1006 we can reference the renamed object directly, since the renamed
1007 expression has been protected against multiple evaluations. */
1008 else if (TREE_CODE (gnu_result) == VAR_DECL
1009 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result))
1010 && (!DECL_RENAMING_GLOBAL_P (gnu_result)
1011 || global_bindings_p ()))
1012 gnu_result = renamed_obj;
1014 /* Return the underlying CST for a CONST_DECL like a few lines below,
1015 after dereferencing in this case. */
1016 else if (TREE_CODE (gnu_result) == CONST_DECL)
1017 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
1018 DECL_INITIAL (gnu_result));
1021 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
1024 TREE_READONLY (gnu_result) = 1;
1027 /* The GNAT tree has the type of a function as the type of its result. Also
1028 use the type of the result if the Etype is a subtype which is nominally
1029 unconstrained. But remove any padding from the resulting type. */
1030 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
1031 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
1033 gnu_result_type = TREE_TYPE (gnu_result);
1034 if (TYPE_IS_PADDING_P (gnu_result_type))
1035 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
1038 /* If we have a constant declaration and its initializer, try to return the
1039 latter to avoid the need to call fold in lots of places and the need for
1040 elaboration code if this identifier is used as an initializer itself. */
1041 if (TREE_CONSTANT (gnu_result)
1042 && DECL_P (gnu_result)
1043 && DECL_INITIAL (gnu_result))
1045 bool constant_only = (TREE_CODE (gnu_result) == CONST_DECL
1046 && !DECL_CONST_CORRESPONDING_VAR (gnu_result));
1047 bool address_of_constant = (TREE_CODE (gnu_result) == CONST_DECL
1048 && DECL_CONST_ADDRESS_P (gnu_result));
1050 /* If there is a (corresponding) variable or this is the address of a
1051 constant, we only want to return the initializer if an lvalue isn't
1052 required. Evaluate this now if we have not already done so. */
1053 if ((!constant_only || address_of_constant) && require_lvalue < 0)
1055 = lvalue_required_p (gnat_node, gnu_result_type, true,
1056 address_of_constant, Is_Aliased (gnat_temp));
1058 if ((constant_only && !address_of_constant) || !require_lvalue)
1059 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
1062 *gnu_result_type_p = gnu_result_type;
1067 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1068 any statements we generate. */
1071 Pragma_to_gnu (Node_Id gnat_node)
1074 tree gnu_result = alloc_stmt_list ();
1076 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
1077 annotating types. */
1078 if (type_annotate_only
1079 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
1082 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
1084 case Pragma_Inspection_Point:
1085 /* Do nothing at top level: all such variables are already viewable. */
1086 if (global_bindings_p ())
1089 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
1090 Present (gnat_temp);
1091 gnat_temp = Next (gnat_temp))
1093 Node_Id gnat_expr = Expression (gnat_temp);
1094 tree gnu_expr = gnat_to_gnu (gnat_expr);
1096 enum machine_mode mode;
1097 tree asm_constraint = NULL_TREE;
1098 #ifdef ASM_COMMENT_START
1102 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1103 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1105 /* Use the value only if it fits into a normal register,
1106 otherwise use the address. */
1107 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1108 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1109 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1110 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1113 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1115 #ifdef ASM_COMMENT_START
1116 comment = concat (ASM_COMMENT_START,
1117 " inspection point: ",
1118 Get_Name_String (Chars (gnat_expr)),
1119 use_address ? " address" : "",
1122 asm_constraint = build_string (strlen (comment), comment);
1125 gnu_expr = build5 (ASM_EXPR, void_type_node,
1129 (build_tree_list (NULL_TREE,
1130 build_string (1, "g")),
1131 gnu_expr, NULL_TREE),
1132 NULL_TREE, NULL_TREE);
1133 ASM_VOLATILE_P (gnu_expr) = 1;
1134 set_expr_location_from_node (gnu_expr, gnat_node);
1135 append_to_statement_list (gnu_expr, &gnu_result);
1139 case Pragma_Optimize:
1140 switch (Chars (Expression
1141 (First (Pragma_Argument_Associations (gnat_node)))))
1143 case Name_Time: case Name_Space:
1145 post_error ("insufficient -O value?", gnat_node);
1150 post_error ("must specify -O0?", gnat_node);
1158 case Pragma_Reviewable:
1159 if (write_symbols == NO_DEBUG)
1160 post_error ("must specify -g?", gnat_node);
1167 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1168 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1169 where we should place the result type. ATTRIBUTE is the attribute ID. */
1172 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1174 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1175 tree gnu_type = TREE_TYPE (gnu_prefix);
1176 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1177 bool prefix_unused = false;
1179 /* If the input is a NULL_EXPR, make a new one. */
1180 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1182 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1183 *gnu_result_type_p = gnu_result_type;
1184 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1191 /* These are just conversions since representation clauses for
1192 enumeration types are handled in the front-end. */
1194 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1195 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1196 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1197 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1198 checkp, checkp, true, gnat_node);
1204 /* These just add or subtract the constant 1 since representation
1205 clauses for enumeration types are handled in the front-end. */
1206 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1207 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1209 if (Do_Range_Check (First (Expressions (gnat_node))))
1211 gnu_expr = gnat_protect_expr (gnu_expr);
1214 (build_binary_op (EQ_EXPR, boolean_type_node,
1216 attribute == Attr_Pred
1217 ? TYPE_MIN_VALUE (gnu_result_type)
1218 : TYPE_MAX_VALUE (gnu_result_type)),
1219 gnu_expr, CE_Range_Check_Failed, gnat_node);
1223 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1224 gnu_result_type, gnu_expr,
1225 convert (gnu_result_type, integer_one_node));
1229 case Attr_Unrestricted_Access:
1230 /* Conversions don't change addresses but can cause us to miss the
1231 COMPONENT_REF case below, so strip them off. */
1232 gnu_prefix = remove_conversions (gnu_prefix,
1233 !Must_Be_Byte_Aligned (gnat_node));
1235 /* If we are taking 'Address of an unconstrained object, this is the
1236 pointer to the underlying array. */
1237 if (attribute == Attr_Address)
1238 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1240 /* If we are building a static dispatch table, we have to honor
1241 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1242 with the C++ ABI. We do it in the non-static case as well,
1243 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1244 else if (TARGET_VTABLE_USES_DESCRIPTORS
1245 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1247 tree gnu_field, gnu_list = NULL_TREE, t;
1248 /* Descriptors can only be built here for top-level functions. */
1249 bool build_descriptor = (global_bindings_p () != 0);
1252 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1254 /* If we're not going to build the descriptor, we have to retrieve
1255 the one which will be built by the linker (or by the compiler
1256 later if a static chain is requested). */
1257 if (!build_descriptor)
1259 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1260 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1262 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1265 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1266 i < TARGET_VTABLE_USES_DESCRIPTORS;
1267 gnu_field = TREE_CHAIN (gnu_field), i++)
1269 if (build_descriptor)
1271 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1272 build_int_cst (NULL_TREE, i));
1273 TREE_CONSTANT (t) = 1;
1276 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1277 gnu_field, NULL_TREE);
1279 gnu_list = tree_cons (gnu_field, t, gnu_list);
1282 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1286 /* ... fall through ... */
1289 case Attr_Unchecked_Access:
1290 case Attr_Code_Address:
1291 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1293 = build_unary_op (((attribute == Attr_Address
1294 || attribute == Attr_Unrestricted_Access)
1295 && !Must_Be_Byte_Aligned (gnat_node))
1296 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1297 gnu_result_type, gnu_prefix);
1299 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1300 don't try to build a trampoline. */
1301 if (attribute == Attr_Code_Address)
1303 for (gnu_expr = gnu_result;
1304 CONVERT_EXPR_P (gnu_expr);
1305 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1306 TREE_CONSTANT (gnu_expr) = 1;
1308 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1309 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1312 /* For other address attributes applied to a nested function,
1313 find an inner ADDR_EXPR and annotate it so that we can issue
1314 a useful warning with -Wtrampolines. */
1315 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1317 for (gnu_expr = gnu_result;
1318 CONVERT_EXPR_P (gnu_expr);
1319 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1322 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1323 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1325 set_expr_location_from_node (gnu_expr, gnat_node);
1327 /* Check that we're not violating the No_Implicit_Dynamic_Code
1328 restriction. Be conservative if we don't know anything
1329 about the trampoline strategy for the target. */
1330 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1335 case Attr_Pool_Address:
1338 tree gnu_ptr = gnu_prefix;
1340 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1342 /* If this is an unconstrained array, we know the object has been
1343 allocated with the template in front of the object. So compute
1344 the template address. */
1345 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1347 = convert (build_pointer_type
1348 (TYPE_OBJECT_RECORD_TYPE
1349 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1352 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1353 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1354 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1356 tree gnu_char_ptr_type
1357 = build_pointer_type (unsigned_char_type_node);
1358 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1359 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1360 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1364 gnu_result = convert (gnu_result_type, gnu_ptr);
1369 case Attr_Object_Size:
1370 case Attr_Value_Size:
1371 case Attr_Max_Size_In_Storage_Elements:
1372 gnu_expr = gnu_prefix;
1374 /* Remove NOPs and conversions between original and packable version
1375 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1376 to see if a COMPONENT_REF was involved. */
1377 while (TREE_CODE (gnu_expr) == NOP_EXPR
1378 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1379 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1380 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1382 && TYPE_NAME (TREE_TYPE (gnu_expr))
1383 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1384 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1386 gnu_prefix = remove_conversions (gnu_prefix, true);
1387 prefix_unused = true;
1388 gnu_type = TREE_TYPE (gnu_prefix);
1390 /* Replace an unconstrained array type with the type of the underlying
1391 array. We can't do this with a call to maybe_unconstrained_array
1392 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1393 use the record type that will be used to allocate the object and its
1395 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1397 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1398 if (attribute != Attr_Max_Size_In_Storage_Elements)
1399 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1402 /* If we're looking for the size of a field, return the field size.
1403 Otherwise, if the prefix is an object, or if we're looking for
1404 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1405 GCC size of the type. Otherwise, it is the RM size of the type. */
1406 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1407 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1408 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1409 || attribute == Attr_Object_Size
1410 || attribute == Attr_Max_Size_In_Storage_Elements)
1412 /* If the prefix is an object of a padded type, the GCC size isn't
1413 relevant to the programmer. Normally what we want is the RM size,
1414 which was set from the specified size, but if it was not set, we
1415 want the size of the field. Using the MAX of those two produces
1416 the right result in all cases. Don't use the size of the field
1417 if it's self-referential, since that's never what's wanted. */
1418 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1419 && TYPE_IS_PADDING_P (gnu_type)
1420 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1422 gnu_result = rm_size (gnu_type);
1423 if (!CONTAINS_PLACEHOLDER_P
1424 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1426 = size_binop (MAX_EXPR, gnu_result,
1427 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1429 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1431 Node_Id gnat_deref = Prefix (gnat_node);
1432 Node_Id gnat_actual_subtype
1433 = Actual_Designated_Subtype (gnat_deref);
1435 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1437 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1438 && Present (gnat_actual_subtype))
1440 tree gnu_actual_obj_type
1441 = gnat_to_gnu_type (gnat_actual_subtype);
1443 = build_unc_object_type_from_ptr (gnu_ptr_type,
1444 gnu_actual_obj_type,
1445 get_identifier ("SIZE"),
1449 gnu_result = TYPE_SIZE (gnu_type);
1452 gnu_result = TYPE_SIZE (gnu_type);
1455 gnu_result = rm_size (gnu_type);
1457 /* Deal with a self-referential size by returning the maximum size for
1458 a type and by qualifying the size with the object otherwise. */
1459 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1461 if (TREE_CODE (gnu_prefix) == TYPE_DECL)
1462 gnu_result = max_size (gnu_result, true);
1464 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1467 /* If the type contains a template, subtract its size. */
1468 if (TREE_CODE (gnu_type) == RECORD_TYPE
1469 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1470 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1471 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1473 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1474 if (attribute == Attr_Max_Size_In_Storage_Elements)
1475 gnu_result = size_binop (CEIL_DIV_EXPR, gnu_result, bitsize_unit_node);
1477 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1480 case Attr_Alignment:
1484 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1485 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1486 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1488 gnu_type = TREE_TYPE (gnu_prefix);
1489 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1490 prefix_unused = true;
1492 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1493 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1496 Node_Id gnat_prefix = Prefix (gnat_node);
1497 Entity_Id gnat_type = Etype (gnat_prefix);
1498 unsigned int double_align;
1499 bool is_capped_double, align_clause;
1501 /* If the default alignment of "double" or larger scalar types is
1502 specifically capped and there is an alignment clause neither
1503 on the type nor on the prefix itself, return the cap. */
1504 if ((double_align = double_float_alignment) > 0)
1506 = is_double_float_or_array (gnat_type, &align_clause);
1507 else if ((double_align = double_scalar_alignment) > 0)
1509 = is_double_scalar_or_array (gnat_type, &align_clause);
1511 is_capped_double = align_clause = false;
1513 if (is_capped_double
1514 && Nkind (gnat_prefix) == N_Identifier
1515 && Present (Alignment_Clause (Entity (gnat_prefix))))
1516 align_clause = true;
1518 if (is_capped_double && !align_clause)
1519 align = double_align;
1521 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1524 gnu_result = size_int (align);
1530 case Attr_Range_Length:
1531 prefix_unused = true;
1533 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1535 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1537 if (attribute == Attr_First)
1538 gnu_result = TYPE_MIN_VALUE (gnu_type);
1539 else if (attribute == Attr_Last)
1540 gnu_result = TYPE_MAX_VALUE (gnu_type);
1544 (MAX_EXPR, get_base_type (gnu_result_type),
1546 (PLUS_EXPR, get_base_type (gnu_result_type),
1547 build_binary_op (MINUS_EXPR,
1548 get_base_type (gnu_result_type),
1549 convert (gnu_result_type,
1550 TYPE_MAX_VALUE (gnu_type)),
1551 convert (gnu_result_type,
1552 TYPE_MIN_VALUE (gnu_type))),
1553 convert (gnu_result_type, integer_one_node)),
1554 convert (gnu_result_type, integer_zero_node));
1559 /* ... fall through ... */
1563 int Dimension = (Present (Expressions (gnat_node))
1564 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1566 struct parm_attr_d *pa = NULL;
1567 Entity_Id gnat_param = Empty;
1569 /* Make sure any implicit dereference gets done. */
1570 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1571 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1572 /* We treat unconstrained array In parameters specially. */
1573 if (Nkind (Prefix (gnat_node)) == N_Identifier
1574 && !Is_Constrained (Etype (Prefix (gnat_node)))
1575 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1576 gnat_param = Entity (Prefix (gnat_node));
1577 gnu_type = TREE_TYPE (gnu_prefix);
1578 prefix_unused = true;
1579 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1581 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1586 for (ndim = 1, gnu_type_temp = gnu_type;
1587 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1588 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1589 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1592 Dimension = ndim + 1 - Dimension;
1595 for (i = 1; i < Dimension; i++)
1596 gnu_type = TREE_TYPE (gnu_type);
1598 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1600 /* When not optimizing, look up the slot associated with the parameter
1601 and the dimension in the cache and create a new one on failure. */
1602 if (!optimize && Present (gnat_param))
1604 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1605 if (pa->id == gnat_param && pa->dim == Dimension)
1610 pa = GGC_CNEW (struct parm_attr_d);
1611 pa->id = gnat_param;
1612 pa->dim = Dimension;
1613 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1617 /* Return the cached expression or build a new one. */
1618 if (attribute == Attr_First)
1620 if (pa && pa->first)
1622 gnu_result = pa->first;
1627 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1630 else if (attribute == Attr_Last)
1634 gnu_result = pa->last;
1639 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1642 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1644 if (pa && pa->length)
1646 gnu_result = pa->length;
1651 /* We used to compute the length as max (hb - lb + 1, 0),
1652 which could overflow for some cases of empty arrays, e.g.
1653 when lb == index_type'first. We now compute the length as
1654 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1655 much rarer cases, for extremely large arrays we expect
1656 never to encounter in practice. In addition, the former
1657 computation required the use of potentially constraining
1658 signed arithmetic while the latter doesn't. Note that
1659 the comparison must be done in the original index type,
1660 to avoid any overflow during the conversion. */
1661 tree comp_type = get_base_type (gnu_result_type);
1662 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1663 tree lb = TYPE_MIN_VALUE (index_type);
1664 tree hb = TYPE_MAX_VALUE (index_type);
1666 = build_binary_op (PLUS_EXPR, comp_type,
1667 build_binary_op (MINUS_EXPR,
1669 convert (comp_type, hb),
1670 convert (comp_type, lb)),
1671 convert (comp_type, integer_one_node));
1673 = build_cond_expr (comp_type,
1674 build_binary_op (GE_EXPR,
1678 convert (comp_type, integer_zero_node));
1682 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1683 handling. Note that these attributes could not have been used on
1684 an unconstrained array type. */
1685 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1687 /* Cache the expression we have just computed. Since we want to do it
1688 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1689 create the temporary. */
1693 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1694 TREE_SIDE_EFFECTS (gnu_result) = 1;
1695 if (attribute == Attr_First)
1696 pa->first = gnu_result;
1697 else if (attribute == Attr_Last)
1698 pa->last = gnu_result;
1700 pa->length = gnu_result;
1703 /* Set the source location onto the predicate of the condition in the
1704 'Length case but do not do it if the expression is cached to avoid
1705 messing up the debug info. */
1706 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1707 && TREE_CODE (gnu_result) == COND_EXPR
1708 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1709 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1715 case Attr_Bit_Position:
1717 case Attr_First_Bit:
1721 HOST_WIDE_INT bitsize;
1722 HOST_WIDE_INT bitpos;
1724 tree gnu_field_bitpos;
1725 tree gnu_field_offset;
1727 enum machine_mode mode;
1728 int unsignedp, volatilep;
1730 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1731 gnu_prefix = remove_conversions (gnu_prefix, true);
1732 prefix_unused = true;
1734 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1735 the result is 0. Don't allow 'Bit on a bare component, though. */
1736 if (attribute == Attr_Bit
1737 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1738 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1740 gnu_result = integer_zero_node;
1745 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1746 || (attribute == Attr_Bit_Position
1747 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1749 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1750 &mode, &unsignedp, &volatilep, false);
1752 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1754 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1755 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1757 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1758 TREE_CODE (gnu_inner) == COMPONENT_REF
1759 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1760 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1763 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1764 bit_position (TREE_OPERAND (gnu_inner, 1)));
1766 = size_binop (PLUS_EXPR, gnu_field_offset,
1767 byte_position (TREE_OPERAND (gnu_inner, 1)));
1770 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1772 gnu_field_bitpos = bit_position (gnu_prefix);
1773 gnu_field_offset = byte_position (gnu_prefix);
1777 gnu_field_bitpos = bitsize_zero_node;
1778 gnu_field_offset = size_zero_node;
1784 gnu_result = gnu_field_offset;
1787 case Attr_First_Bit:
1789 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1793 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1794 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1795 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1796 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1800 case Attr_Bit_Position:
1801 gnu_result = gnu_field_bitpos;
1805 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1807 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1814 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1815 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1817 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1818 gnu_result = build_binary_op (attribute == Attr_Min
1819 ? MIN_EXPR : MAX_EXPR,
1820 gnu_result_type, gnu_lhs, gnu_rhs);
1824 case Attr_Passed_By_Reference:
1825 gnu_result = size_int (default_pass_by_ref (gnu_type)
1826 || must_pass_by_ref (gnu_type));
1827 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1830 case Attr_Component_Size:
1831 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1832 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1833 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1835 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1836 gnu_type = TREE_TYPE (gnu_prefix);
1838 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1839 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1841 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1842 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1843 gnu_type = TREE_TYPE (gnu_type);
1845 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1847 /* Note this size cannot be self-referential. */
1848 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1849 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1850 prefix_unused = true;
1853 case Attr_Null_Parameter:
1854 /* This is just a zero cast to the pointer type for our prefix and
1856 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1858 = build_unary_op (INDIRECT_REF, NULL_TREE,
1859 convert (build_pointer_type (gnu_result_type),
1860 integer_zero_node));
1861 TREE_PRIVATE (gnu_result) = 1;
1864 case Attr_Mechanism_Code:
1867 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1869 prefix_unused = true;
1870 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1871 if (Present (Expressions (gnat_node)))
1873 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1875 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1876 i--, gnat_obj = Next_Formal (gnat_obj))
1880 code = Mechanism (gnat_obj);
1881 if (code == Default)
1882 code = ((present_gnu_tree (gnat_obj)
1883 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1884 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1886 && (DECL_BY_COMPONENT_PTR_P
1887 (get_gnu_tree (gnat_obj))))))
1888 ? By_Reference : By_Copy);
1889 gnu_result = convert (gnu_result_type, size_int (- code));
1894 /* Say we have an unimplemented attribute. Then set the value to be
1895 returned to be a zero and hope that's something we can convert to
1896 the type of this attribute. */
1897 post_error ("unimplemented attribute", gnat_node);
1898 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1899 gnu_result = integer_zero_node;
1903 /* If this is an attribute where the prefix was unused, force a use of it if
1904 it has a side-effect. But don't do it if the prefix is just an entity
1905 name. However, if an access check is needed, we must do it. See second
1906 example in AARM 11.6(5.e). */
1907 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1908 && !Is_Entity_Name (Prefix (gnat_node)))
1909 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1910 gnu_prefix, gnu_result);
1912 *gnu_result_type_p = gnu_result_type;
1916 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1917 to a GCC tree, which is returned. */
1920 Case_Statement_to_gnu (Node_Id gnat_node)
1926 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1927 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1929 /* The range of values in a case statement is determined by the rules in
1930 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1931 of the expression. One exception arises in the case of a simple name that
1932 is parenthesized. This still has the Etype of the name, but since it is
1933 not a name, para 7 does not apply, and we need to go to the base type.
1934 This is the only case where parenthesization affects the dynamic
1935 semantics (i.e. the range of possible values at runtime that is covered
1936 by the others alternative.
1938 Another exception is if the subtype of the expression is non-static. In
1939 that case, we also have to use the base type. */
1940 if (Paren_Count (Expression (gnat_node)) != 0
1941 || !Is_OK_Static_Subtype (Underlying_Type
1942 (Etype (Expression (gnat_node)))))
1943 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1945 /* We build a SWITCH_EXPR that contains the code with interspersed
1946 CASE_LABEL_EXPRs for each label. */
1948 push_stack (&gnu_switch_label_stack, NULL_TREE,
1949 create_artificial_label (input_location));
1950 start_stmt_group ();
1951 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1952 Present (gnat_when);
1953 gnat_when = Next_Non_Pragma (gnat_when))
1955 bool choices_added_p = false;
1956 Node_Id gnat_choice;
1958 /* First compile all the different case choices for the current WHEN
1960 for (gnat_choice = First (Discrete_Choices (gnat_when));
1961 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1963 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1965 switch (Nkind (gnat_choice))
1968 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1969 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1972 case N_Subtype_Indication:
1973 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1974 (Constraint (gnat_choice))));
1975 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1976 (Constraint (gnat_choice))));
1980 case N_Expanded_Name:
1981 /* This represents either a subtype range or a static value of
1982 some kind; Ekind says which. */
1983 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1985 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1987 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1988 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1992 /* ... fall through ... */
1994 case N_Character_Literal:
1995 case N_Integer_Literal:
1996 gnu_low = gnat_to_gnu (gnat_choice);
1999 case N_Others_Choice:
2006 /* If the case value is a subtype that raises Constraint_Error at
2007 run-time because of a wrong bound, then gnu_low or gnu_high is
2008 not translated into an INTEGER_CST. In such a case, we need
2009 to ensure that the when statement is not added in the tree,
2010 otherwise it will crash the gimplifier. */
2011 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
2012 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
2014 add_stmt_with_node (build3
2015 (CASE_LABEL_EXPR, void_type_node,
2017 create_artificial_label (input_location)),
2019 choices_added_p = true;
2023 /* Push a binding level here in case variables are declared as we want
2024 them to be local to this set of statements instead of to the block
2025 containing the Case statement. */
2026 if (choices_added_p)
2028 add_stmt (build_stmt_group (Statements (gnat_when), true));
2029 add_stmt (build1 (GOTO_EXPR, void_type_node,
2030 TREE_VALUE (gnu_switch_label_stack)));
2034 /* Now emit a definition of the label all the cases branched to. */
2035 add_stmt (build1 (LABEL_EXPR, void_type_node,
2036 TREE_VALUE (gnu_switch_label_stack)));
2037 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
2038 end_stmt_group (), NULL_TREE);
2039 pop_stack (&gnu_switch_label_stack);
2044 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2045 false, or the maximum value if MAX is true, of TYPE. */
2048 can_equal_min_or_max_val_p (tree val, tree type, bool max)
2050 tree min_or_max_val = (max ? TYPE_MAX_VALUE (type) : TYPE_MIN_VALUE (type));
2052 if (TREE_CODE (min_or_max_val) != INTEGER_CST)
2055 if (TREE_CODE (val) == NOP_EXPR)
2057 ? TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val, 0)))
2058 : TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val, 0))));
2060 if (TREE_CODE (val) != INTEGER_CST)
2063 return tree_int_cst_equal (val, min_or_max_val) == 1;
2066 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2067 If REVERSE is true, minimum value is taken as maximum value. */
2070 can_equal_min_val_p (tree val, tree type, bool reverse)
2072 return can_equal_min_or_max_val_p (val, type, reverse);
2075 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2076 If REVERSE is true, maximum value is taken as minimum value. */
2079 can_equal_max_val_p (tree val, tree type, bool reverse)
2081 return can_equal_min_or_max_val_p (val, type, !reverse);
2084 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2085 to a GCC tree, which is returned. */
2088 Loop_Statement_to_gnu (Node_Id gnat_node)
2090 const Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
2091 tree gnu_loop_stmt = build4 (LOOP_STMT, void_type_node, NULL_TREE,
2092 NULL_TREE, NULL_TREE, NULL_TREE);
2093 tree gnu_loop_label = create_artificial_label (input_location);
2094 tree gnu_loop_var = NULL_TREE, gnu_cond_expr = NULL_TREE;
2097 /* Set location information for statement and end label. */
2098 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
2099 Sloc_to_locus (Sloc (End_Label (gnat_node)),
2100 &DECL_SOURCE_LOCATION (gnu_loop_label));
2101 LOOP_STMT_LABEL (gnu_loop_stmt) = gnu_loop_label;
2103 /* Save the end label of this LOOP_STMT in a stack so that a corresponding
2104 N_Exit_Statement can find it. */
2105 push_stack (&gnu_loop_label_stack, NULL_TREE, gnu_loop_label);
2107 /* Set the condition under which the loop must keep going.
2108 For the case "LOOP .... END LOOP;" the condition is always true. */
2109 if (No (gnat_iter_scheme))
2112 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2113 else if (Present (Condition (gnat_iter_scheme)))
2114 LOOP_STMT_COND (gnu_loop_stmt)
2115 = gnat_to_gnu (Condition (gnat_iter_scheme));
2117 /* Otherwise we have an iteration scheme and the condition is given by the
2118 bounds of the subtype of the iteration variable. */
2121 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2122 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2123 Entity_Id gnat_type = Etype (gnat_loop_var);
2124 tree gnu_type = get_unpadded_type (gnat_type);
2125 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
2126 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
2127 tree gnu_base_type = get_base_type (gnu_type);
2128 tree gnu_one_node = convert (gnu_base_type, integer_one_node);
2129 tree gnu_first, gnu_last;
2130 enum tree_code update_code, test_code, shift_code;
2131 bool reverse = Reverse_Present (gnat_loop_spec), fallback = false;
2133 /* We must disable modulo reduction for the iteration variable, if any,
2134 in order for the loop comparison to be effective. */
2137 gnu_first = gnu_high;
2139 update_code = MINUS_NOMOD_EXPR;
2140 test_code = GE_EXPR;
2141 shift_code = PLUS_NOMOD_EXPR;
2145 gnu_first = gnu_low;
2146 gnu_last = gnu_high;
2147 update_code = PLUS_NOMOD_EXPR;
2148 test_code = LE_EXPR;
2149 shift_code = MINUS_NOMOD_EXPR;
2152 /* We use two different strategies to translate the loop, depending on
2153 whether optimization is enabled.
2155 If it is, we try to generate the canonical form of loop expected by
2156 the loop optimizer, which is the do-while form:
2165 This makes it possible to bypass loop header copying and to turn the
2166 BOTTOM_COND into an inequality test. This should catch (almost) all
2167 loops with constant starting point. If we cannot, we try to generate
2168 the default form, which is:
2176 It will be rotated during loop header copying and an entry test added
2177 to yield the do-while form. This should catch (almost) all loops with
2178 constant ending point. If we cannot, we generate the fallback form:
2187 which works in all cases but for which loop header copying will copy
2188 the BOTTOM_COND, thus adding a third conditional branch.
2190 If optimization is disabled, loop header copying doesn't come into
2191 play and we try to generate the loop forms with the less conditional
2192 branches directly. First, the default form, it should catch (almost)
2193 all loops with constant ending point. Then, if we cannot, we try to
2194 generate the shifted form:
2202 which should catch loops with constant starting point. Otherwise, if
2203 we cannot, we generate the fallback form. */
2207 /* We can use the do-while form if GNU_FIRST-1 doesn't overflow. */
2208 if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse))
2210 gnu_first = build_binary_op (shift_code, gnu_base_type,
2211 gnu_first, gnu_one_node);
2212 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2213 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2216 /* Otherwise, we can use the default form if GNU_LAST+1 doesn't. */
2217 else if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2220 /* Otherwise, use the fallback form. */
2226 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
2227 if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2230 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
2232 else if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse)
2233 && !can_equal_min_val_p (gnu_last, gnu_base_type, reverse))
2235 gnu_first = build_binary_op (shift_code, gnu_base_type,
2236 gnu_first, gnu_one_node);
2237 gnu_last = build_binary_op (shift_code, gnu_base_type,
2238 gnu_last, gnu_one_node);
2239 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2242 /* Otherwise, use the fallback form. */
2248 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2250 /* If we use the BOTTOM_COND, we can turn the test into an inequality
2251 test but we have to add an ENTRY_COND to protect the empty loop. */
2252 if (LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt))
2254 test_code = NE_EXPR;
2256 = build3 (COND_EXPR, void_type_node,
2257 build_binary_op (LE_EXPR, boolean_type_node,
2259 NULL_TREE, alloc_stmt_list ());
2260 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2263 /* Open a new nesting level that will surround the loop to declare the
2264 iteration variable. */
2265 start_stmt_group ();
2268 /* Declare the iteration variable and set it to its initial value. */
2269 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2270 if (DECL_BY_REF_P (gnu_loop_var))
2271 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2273 /* Do all the arithmetics in the base type. */
2274 gnu_loop_var = convert (gnu_base_type, gnu_loop_var);
2276 /* Set either the top or bottom exit condition. */
2277 LOOP_STMT_COND (gnu_loop_stmt)
2278 = build_binary_op (test_code, boolean_type_node, gnu_loop_var,
2281 /* Set either the top or bottom update statement and give it the source
2282 location of the iteration for better coverage info. */
2283 LOOP_STMT_UPDATE (gnu_loop_stmt)
2284 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2285 build_binary_op (update_code, gnu_base_type,
2286 gnu_loop_var, gnu_one_node));
2287 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2291 /* If the loop was named, have the name point to this loop. In this case,
2292 the association is not a DECL node, but the end label of the loop. */
2293 if (Present (Identifier (gnat_node)))
2294 save_gnu_tree (Entity (Identifier (gnat_node)), gnu_loop_label, true);
2296 /* Make the loop body into its own block, so any allocated storage will be
2297 released every iteration. This is needed for stack allocation. */
2298 LOOP_STMT_BODY (gnu_loop_stmt)
2299 = build_stmt_group (Statements (gnat_node), true);
2300 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
2302 /* If we declared a variable, then we are in a statement group for that
2303 declaration. Add the LOOP_STMT to it and make that the "loop". */
2306 add_stmt (gnu_loop_stmt);
2308 gnu_loop_stmt = end_stmt_group ();
2311 /* If we have an outer COND_EXPR, that's our result and this loop is its
2312 "true" statement. Otherwise, the result is the LOOP_STMT. */
2315 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2316 gnu_result = gnu_cond_expr;
2317 recalculate_side_effects (gnu_cond_expr);
2320 gnu_result = gnu_loop_stmt;
2322 pop_stack (&gnu_loop_label_stack);
2327 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2328 handler for the current function. */
2330 /* This is implemented by issuing a call to the appropriate VMS specific
2331 builtin. To avoid having VMS specific sections in the global gigi decls
2332 array, we maintain the decls of interest here. We can't declare them
2333 inside the function because we must mark them never to be GC'd, which we
2334 can only do at the global level. */
2336 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2337 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2340 establish_gnat_vms_condition_handler (void)
2342 tree establish_stmt;
2344 /* Elaborate the required decls on the first call. Check on the decl for
2345 the gnat condition handler to decide, as this is one we create so we are
2346 sure that it will be non null on subsequent calls. The builtin decl is
2347 looked up so remains null on targets where it is not implemented yet. */
2348 if (gnat_vms_condition_handler_decl == NULL_TREE)
2350 vms_builtin_establish_handler_decl
2352 (get_identifier ("__builtin_establish_vms_condition_handler"));
2354 gnat_vms_condition_handler_decl
2355 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2357 build_function_type_list (boolean_type_node,
2361 NULL_TREE, 0, 1, 1, 0, Empty);
2363 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2364 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2367 /* Do nothing if the establish builtin is not available, which might happen
2368 on targets where the facility is not implemented. */
2369 if (vms_builtin_establish_handler_decl == NULL_TREE)
2373 = build_call_1_expr (vms_builtin_establish_handler_decl,
2375 (ADDR_EXPR, NULL_TREE,
2376 gnat_vms_condition_handler_decl));
2378 add_stmt (establish_stmt);
2381 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2382 don't return anything. */
2385 Subprogram_Body_to_gnu (Node_Id gnat_node)
2387 /* Defining identifier of a parameter to the subprogram. */
2388 Entity_Id gnat_param;
2389 /* The defining identifier for the subprogram body. Note that if a
2390 specification has appeared before for this body, then the identifier
2391 occurring in that specification will also be a defining identifier and all
2392 the calls to this subprogram will point to that specification. */
2393 Entity_Id gnat_subprog_id
2394 = (Present (Corresponding_Spec (gnat_node))
2395 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2396 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2397 tree gnu_subprog_decl;
2398 /* Its RESULT_DECL node. */
2399 tree gnu_result_decl;
2400 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2401 tree gnu_subprog_type;
2404 VEC(parm_attr,gc) *cache;
2406 /* If this is a generic object or if it has been eliminated,
2408 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2409 || Ekind (gnat_subprog_id) == E_Generic_Function
2410 || Is_Eliminated (gnat_subprog_id))
2413 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2414 the already-elaborated tree node. However, if this subprogram had its
2415 elaboration deferred, we will already have made a tree node for it. So
2416 treat it as not being defined in that case. Such a subprogram cannot
2417 have an address clause or a freeze node, so this test is safe, though it
2418 does disable some otherwise-useful error checking. */
2420 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2421 Acts_As_Spec (gnat_node)
2422 && !present_gnu_tree (gnat_subprog_id));
2423 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
2424 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2426 /* If the function returns by invisible reference, make it explicit in the
2427 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
2428 if (TREE_ADDRESSABLE (gnu_subprog_type))
2430 TREE_TYPE (gnu_result_decl)
2431 = build_reference_type (TREE_TYPE (gnu_result_decl));
2432 relayout_decl (gnu_result_decl);
2435 /* Propagate the debug mode. */
2436 if (!Needs_Debug_Info (gnat_subprog_id))
2437 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2439 /* Set the line number in the decl to correspond to that of the body so that
2440 the line number notes are written correctly. */
2441 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2443 /* Initialize the information structure for the function. */
2444 allocate_struct_function (gnu_subprog_decl, false);
2445 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2446 = GGC_CNEW (struct language_function);
2449 begin_subprog_body (gnu_subprog_decl);
2451 /* If there are Out parameters, we need to ensure that the return statement
2452 properly copies them out. We do this by making a new block and converting
2453 any inner return into a goto to a label at the end of the block. */
2454 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2455 push_stack (&gnu_return_label_stack, NULL_TREE,
2456 gnu_cico_list ? create_artificial_label (input_location)
2459 /* Get a tree corresponding to the code for the subprogram. */
2460 start_stmt_group ();
2463 /* See if there are any parameters for which we don't yet have GCC entities.
2464 These must be for Out parameters for which we will be making VAR_DECL
2465 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2466 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2467 the order of the parameters. */
2468 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2469 Present (gnat_param);
2470 gnat_param = Next_Formal_With_Extras (gnat_param))
2471 if (!present_gnu_tree (gnat_param))
2473 /* Skip any entries that have been already filled in; they must
2474 correspond to In Out parameters. */
2475 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2476 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2479 /* Do any needed references for padded types. */
2480 TREE_VALUE (gnu_cico_list)
2481 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2482 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2485 /* On VMS, establish our condition handler to possibly turn a condition into
2486 the corresponding exception if the subprogram has a foreign convention or
2489 To ensure proper execution of local finalizations on condition instances,
2490 we must turn a condition into the corresponding exception even if there
2491 is no applicable Ada handler, and need at least one condition handler per
2492 possible call chain involving GNAT code. OTOH, establishing the handler
2493 has a cost so we want to minimize the number of subprograms into which
2494 this happens. The foreign or exported condition is expected to satisfy
2495 all the constraints. */
2496 if (TARGET_ABI_OPEN_VMS
2497 && (Has_Foreign_Convention (gnat_subprog_id)
2498 || Is_Exported (gnat_subprog_id)))
2499 establish_gnat_vms_condition_handler ();
2501 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2503 /* Generate the code of the subprogram itself. A return statement will be
2504 present and any Out parameters will be handled there. */
2505 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2507 gnu_result = end_stmt_group ();
2509 /* If we populated the parameter attributes cache, we need to make sure
2510 that the cached expressions are evaluated on all possible paths. */
2511 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2514 struct parm_attr_d *pa;
2517 start_stmt_group ();
2519 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2522 add_stmt_with_node (pa->first, gnat_node);
2524 add_stmt_with_node (pa->last, gnat_node);
2526 add_stmt_with_node (pa->length, gnat_node);
2529 add_stmt (gnu_result);
2530 gnu_result = end_stmt_group ();
2533 /* If we are dealing with a return from an Ada procedure with parameters
2534 passed by copy-in/copy-out, we need to return a record containing the
2535 final values of these parameters. If the list contains only one entry,
2536 return just that entry though.
2538 For a full description of the copy-in/copy-out parameter mechanism, see
2539 the part of the gnat_to_gnu_entity routine dealing with the translation
2542 We need to make a block that contains the definition of that label and
2543 the copying of the return value. It first contains the function, then
2544 the label and copy statement. */
2545 if (TREE_VALUE (gnu_return_label_stack))
2549 start_stmt_group ();
2551 add_stmt (gnu_result);
2552 add_stmt (build1 (LABEL_EXPR, void_type_node,
2553 TREE_VALUE (gnu_return_label_stack)));
2555 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2556 if (list_length (gnu_cico_list) == 1)
2557 gnu_retval = TREE_VALUE (gnu_cico_list);
2559 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2562 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
2563 End_Label (Handled_Statement_Sequence (gnat_node)));
2565 gnu_result = end_stmt_group ();
2568 pop_stack (&gnu_return_label_stack);
2570 /* Set the end location. */
2572 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2573 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2574 : Sloc (gnat_node)),
2575 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2577 end_subprog_body (gnu_result);
2579 /* Finally annotate the parameters and disconnect the trees for parameters
2580 that we have turned into variables since they are now unusable. */
2581 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2582 Present (gnat_param);
2583 gnat_param = Next_Formal_With_Extras (gnat_param))
2585 tree gnu_param = get_gnu_tree (gnat_param);
2586 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
2587 DECL_BY_REF_P (gnu_param));
2588 if (TREE_CODE (gnu_param) == VAR_DECL)
2589 save_gnu_tree (gnat_param, NULL_TREE, false);
2592 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2593 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2595 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2598 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2599 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2600 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2601 If GNU_TARGET is non-null, this must be a function call on the RHS of a
2602 N_Assignment_Statement and the result is to be placed into that object. */
2605 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2607 /* The GCC node corresponding to the GNAT subprogram name. This can either
2608 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2609 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2611 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
2612 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2613 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
2614 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
2615 Entity_Id gnat_formal;
2616 Node_Id gnat_actual;
2617 VEC(tree,gc) *gnu_actual_vec = NULL;
2618 tree gnu_name_list = NULL_TREE;
2619 tree gnu_before_list = NULL_TREE;
2620 tree gnu_after_list = NULL_TREE;
2622 bool went_into_elab_proc = false;
2624 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2626 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
2627 all our args first. */
2628 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
2630 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
2631 gnat_node, N_Raise_Program_Error);
2633 for (gnat_actual = First_Actual (gnat_node);
2634 Present (gnat_actual);
2635 gnat_actual = Next_Actual (gnat_actual))
2636 add_stmt (gnat_to_gnu (gnat_actual));
2638 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2640 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2641 return build1 (NULL_EXPR, TREE_TYPE (gnu_subprog_type), call_expr);
2647 /* The only way we can be making a call via an access type is if Name is an
2648 explicit dereference. In that case, get the list of formal args from the
2649 type the access type is pointing to. Otherwise, get the formals from the
2650 entity being called. */
2651 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2652 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2653 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2654 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2655 gnat_formal = Empty;
2657 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2659 /* If we are translating a statement, open a new nesting level that will
2660 surround it to declare the temporaries created for the call. */
2661 if (Nkind (gnat_node) == N_Procedure_Call_Statement || gnu_target)
2663 start_stmt_group ();
2667 /* The lifetime of the temporaries created for the call ends with the call
2668 so we can give them the scope of the elaboration routine at top level. */
2669 else if (!current_function_decl)
2671 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
2672 went_into_elab_proc = true;
2675 /* Create the list of the actual parameters as GCC expects it, namely a
2676 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
2677 is an expression and the TREE_PURPOSE field is null. But skip Out
2678 parameters not passed by reference and that need not be copied in. */
2679 for (gnat_actual = First_Actual (gnat_node);
2680 Present (gnat_actual);
2681 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2682 gnat_actual = Next_Actual (gnat_actual))
2684 tree gnu_formal = present_gnu_tree (gnat_formal)
2685 ? get_gnu_tree (gnat_formal) : NULL_TREE;
2686 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2687 /* In the Out or In Out case, we must suppress conversions that yield
2688 an lvalue but can nevertheless cause the creation of a temporary,
2689 because we need the real object in this case, either to pass its
2690 address if it's passed by reference or as target of the back copy
2691 done after the call if it uses the copy-in copy-out mechanism.
2692 We do it in the In case too, except for an unchecked conversion
2693 because it alone can cause the actual to be misaligned and the
2694 addressability test is applied to the real object. */
2695 bool suppress_type_conversion
2696 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2697 && Ekind (gnat_formal) != E_In_Parameter)
2698 || (Nkind (gnat_actual) == N_Type_Conversion
2699 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2700 Node_Id gnat_name = suppress_type_conversion
2701 ? Expression (gnat_actual) : gnat_actual;
2702 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2705 /* If it's possible we may need to use this expression twice, make sure
2706 that any side-effects are handled via SAVE_EXPRs; likewise if we need
2707 to force side-effects before the call.
2708 ??? This is more conservative than we need since we don't need to do
2709 this for pass-by-ref with no conversion. */
2710 if (Ekind (gnat_formal) != E_In_Parameter)
2711 gnu_name = gnat_stabilize_reference (gnu_name, true, NULL);
2713 /* If we are passing a non-addressable parameter by reference, pass the
2714 address of a copy. In the Out or In Out case, set up to copy back
2715 out after the call. */
2717 && (DECL_BY_REF_P (gnu_formal)
2718 || (TREE_CODE (gnu_formal) == PARM_DECL
2719 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2720 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2721 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2722 && !addressable_p (gnu_name, gnu_name_type))
2724 tree gnu_orig = gnu_name, gnu_temp, gnu_stmt;
2726 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
2727 but sort of an instantiation for them. */
2728 if (TREE_CODE (gnu_name) == CONSTRUCTOR)
2731 /* If the type is passed by reference, a copy is not allowed. */
2732 else if (TREE_ADDRESSABLE (gnu_formal_type))
2733 post_error ("misaligned actual cannot be passed by reference",
2736 /* For users of Starlet we issue a warning because the interface
2737 apparently assumes that by-ref parameters outlive the procedure
2738 invocation. The code still will not work as intended, but we
2739 cannot do much better since low-level parts of the back-end
2740 would allocate temporaries at will because of the misalignment
2741 if we did not do so here. */
2742 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2745 ("?possible violation of implicit assumption", gnat_actual);
2747 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2748 Entity (Name (gnat_node)));
2749 post_error_ne ("?because of misalignment of &", gnat_actual,
2753 /* If the actual type of the object is already the nominal type,
2754 we have nothing to do, except if the size is self-referential
2755 in which case we'll remove the unpadding below. */
2756 if (TREE_TYPE (gnu_name) == gnu_name_type
2757 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2760 /* Otherwise remove the unpadding from all the objects. */
2761 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2762 && TYPE_IS_PADDING_P
2763 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
2764 gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0);
2766 /* Otherwise convert to the nominal type of the object if needed.
2767 There are several cases in which we need to make the temporary
2768 using this type instead of the actual type of the object when
2769 they are distinct, because the expectations of the callee would
2770 otherwise not be met:
2771 - if it's a justified modular type,
2772 - if the actual type is a smaller form of it,
2773 - if it's a smaller form of the actual type. */
2774 else if ((TREE_CODE (gnu_name_type) == RECORD_TYPE
2775 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2776 || smaller_form_type_p (TREE_TYPE (gnu_name),
2778 || (INTEGRAL_TYPE_P (gnu_name_type)
2779 && smaller_form_type_p (gnu_name_type,
2780 TREE_TYPE (gnu_name))))
2781 gnu_name = convert (gnu_name_type, gnu_name);
2783 /* Create an explicit temporary holding the copy. This ensures that
2784 its lifetime is as narrow as possible around a statement. */
2785 gnu_temp = create_var_decl (create_tmp_var_name ("A"), NULL_TREE,
2786 TREE_TYPE (gnu_name), NULL_TREE, false,
2787 false, false, false, NULL, Empty);
2788 DECL_ARTIFICIAL (gnu_temp) = 1;
2789 DECL_IGNORED_P (gnu_temp) = 1;
2791 /* But initialize it on the fly like for an implicit temporary as
2792 we aren't necessarily dealing with a statement. */
2794 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_name);
2795 set_expr_location_from_node (gnu_stmt, gnat_actual);
2797 /* From now on, the real object is the temporary. */
2798 gnu_name = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_name), gnu_stmt,
2801 /* Set up to move the copy back to the original if needed. */
2802 if (Ekind (gnat_formal) != E_In_Parameter)
2804 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig,
2806 set_expr_location_from_node (gnu_stmt, gnat_node);
2807 append_to_statement_list (gnu_stmt, &gnu_after_list);
2811 /* Start from the real object and build the actual. */
2812 gnu_actual = gnu_name;
2814 /* If this was a procedure call, we may not have removed any padding.
2815 So do it here for the part we will use as an input, if any. */
2816 if (Ekind (gnat_formal) != E_Out_Parameter
2817 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2819 = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual);
2821 /* Put back the conversion we suppressed above in the computation of the
2822 real object. And even if we didn't suppress any conversion there, we
2823 may have suppressed a conversion to the Etype of the actual earlier,
2824 since the parent is a procedure call, so put it back here. */
2825 if (suppress_type_conversion
2826 && Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2828 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2829 gnu_actual, No_Truncation (gnat_actual));
2832 = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual);
2834 /* Make sure that the actual is in range of the formal's type. */
2835 if (Ekind (gnat_formal) != E_Out_Parameter
2836 && Do_Range_Check (gnat_actual))
2838 = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual);
2840 /* Unless this is an In parameter, we must remove any justified modular
2841 building from GNU_NAME to get an lvalue. */
2842 if (Ekind (gnat_formal) != E_In_Parameter
2843 && TREE_CODE (gnu_name) == CONSTRUCTOR
2844 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2845 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2847 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name);
2849 /* If we have not saved a GCC object for the formal, it means it is an
2850 Out parameter not passed by reference and that need not be copied in.
2851 Otherwise, first see if the parameter is passed by reference. */
2853 && TREE_CODE (gnu_formal) == PARM_DECL
2854 && DECL_BY_REF_P (gnu_formal))
2856 if (Ekind (gnat_formal) != E_In_Parameter)
2858 /* In Out or Out parameters passed by reference don't use the
2859 copy-in copy-out mechanism so the address of the real object
2860 must be passed to the function. */
2861 gnu_actual = gnu_name;
2863 /* If we have a padded type, be sure we've removed padding. */
2864 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2865 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2868 /* If we have the constructed subtype of an aliased object
2869 with an unconstrained nominal subtype, the type of the
2870 actual includes the template, although it is formally
2871 constrained. So we need to convert it back to the real
2872 constructed subtype to retrieve the constrained part
2873 and takes its address. */
2874 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2875 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2876 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2877 && Is_Array_Type (Etype (gnat_actual)))
2878 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2882 /* There is no need to convert the actual to the formal's type before
2883 taking its address. The only exception is for unconstrained array
2884 types because of the way we build fat pointers. */
2885 else if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE)
2886 gnu_actual = convert (gnu_formal_type, gnu_actual);
2888 /* The symmetry of the paths to the type of an entity is broken here
2889 since arguments don't know that they will be passed by ref. */
2890 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2891 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2894 && TREE_CODE (gnu_formal) == PARM_DECL
2895 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2897 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2898 gnu_actual = maybe_implicit_deref (gnu_actual);
2899 gnu_actual = maybe_unconstrained_array (gnu_actual);
2901 if (TYPE_IS_PADDING_P (gnu_formal_type))
2903 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2904 gnu_actual = convert (gnu_formal_type, gnu_actual);
2907 /* Take the address of the object and convert to the proper pointer
2908 type. We'd like to actually compute the address of the beginning
2909 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2910 possibility that the ARRAY_REF might return a constant and we'd be
2911 getting the wrong address. Neither approach is exactly correct,
2912 but this is the most likely to work in all cases. */
2913 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2916 && TREE_CODE (gnu_formal) == PARM_DECL
2917 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2919 gnu_actual = convert (gnu_formal_type, gnu_actual);
2921 /* If this is 'Null_Parameter, pass a zero descriptor. */
2922 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2923 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2924 && TREE_PRIVATE (gnu_actual))
2926 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
2928 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2929 fill_vms_descriptor (gnu_actual,
2937 if (Ekind (gnat_formal) != E_In_Parameter)
2938 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2940 if (!(gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL))
2942 /* Make sure side-effects are evaluated before the call. */
2943 if (TREE_SIDE_EFFECTS (gnu_name))
2944 append_to_statement_list (gnu_name, &gnu_before_list);
2948 gnu_actual = convert (gnu_formal_type, gnu_actual);
2950 /* If this is 'Null_Parameter, pass a zero even though we are
2951 dereferencing it. */
2952 if (TREE_CODE (gnu_actual) == INDIRECT_REF
2953 && TREE_PRIVATE (gnu_actual)
2954 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
2955 && TREE_CODE (gnu_size) == INTEGER_CST
2956 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
2958 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2959 convert (gnat_type_for_size
2960 (TREE_INT_CST_LOW (gnu_size), 1),
2964 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2967 VEC_safe_push (tree, gc, gnu_actual_vec, gnu_actual);
2970 gnu_call = build_call_list (TREE_TYPE (gnu_subprog_type), gnu_subprog_addr,
2971 nreverse (gnu_actual_list));
2972 set_expr_location_from_node (gnu_call, gnat_node);
2974 /* If it's a function call, the result is the call expression unless a target
2975 is specified, in which case we copy the result into the target and return
2976 the assignment statement. */
2977 if (Nkind (gnat_node) == N_Function_Call)
2979 tree gnu_result = gnu_call;
2981 /* If the function returns an unconstrained array or by direct reference,
2982 we have to dereference the pointer. */
2983 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
2984 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
2985 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2989 Node_Id gnat_parent = Parent (gnat_node);
2990 enum tree_code op_code;
2992 /* If range check is needed, emit code to generate it. */
2993 if (Do_Range_Check (gnat_node))
2995 = emit_range_check (gnu_result, Etype (Name (gnat_parent)),
2998 /* ??? If the return type has non-constant size, then force the
2999 return slot optimization as we would not be able to generate
3000 a temporary. That's what has been done historically. */
3001 if (TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_subprog_type))))
3002 op_code = MODIFY_EXPR;
3004 op_code = INIT_EXPR;
3007 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_result);
3008 add_stmt_with_node (gnu_result, gnat_parent);
3010 gnu_result = end_stmt_group ();
3014 if (went_into_elab_proc)
3015 current_function_decl = NULL_TREE;
3016 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
3022 /* If this is the case where the GNAT tree contains a procedure call but the
3023 Ada procedure has copy-in/copy-out parameters, then the special parameter
3024 passing mechanism must be used. */
3025 if (TYPE_CI_CO_LIST (gnu_subprog_type))
3027 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
3028 copy-out parameters. */
3029 tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
3030 const int length = list_length (gnu_cico_list);
3034 tree gnu_temp, gnu_stmt;
3036 /* The call sequence must contain one and only one call, even though
3037 the function is pure. Save the result into a temporary. */
3038 gnu_temp = create_var_decl (create_tmp_var_name ("R"), NULL_TREE,
3039 TREE_TYPE (gnu_call), NULL_TREE, false,
3040 false, false, false, NULL, Empty);
3041 DECL_ARTIFICIAL (gnu_temp) = 1;
3042 DECL_IGNORED_P (gnu_temp) = 1;
3045 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_call);
3046 set_expr_location_from_node (gnu_stmt, gnat_node);
3048 /* Add the call statement to the list and start from its result. */
3049 append_to_statement_list (gnu_stmt, &gnu_before_list);
3050 gnu_call = gnu_temp;
3052 gnu_name_list = nreverse (gnu_name_list);
3055 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
3056 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
3058 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
3060 for (gnat_actual = First_Actual (gnat_node);
3061 Present (gnat_actual);
3062 gnat_formal = Next_Formal_With_Extras (gnat_formal),
3063 gnat_actual = Next_Actual (gnat_actual))
3064 /* If we are dealing with a copy in copy out parameter, we must
3065 retrieve its value from the record returned in the call. */
3066 if (!(present_gnu_tree (gnat_formal)
3067 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
3068 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
3069 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
3070 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
3071 || (DECL_BY_DESCRIPTOR_P
3072 (get_gnu_tree (gnat_formal))))))))
3073 && Ekind (gnat_formal) != E_In_Parameter)
3075 /* Get the value to assign to this Out or In Out parameter. It is
3076 either the result of the function if there is only a single such
3077 parameter or the appropriate field from the record returned. */
3081 : build_component_ref (gnu_call, NULL_TREE,
3082 TREE_PURPOSE (gnu_cico_list), false);
3084 /* If the actual is a conversion, get the inner expression, which
3085 will be the real destination, and convert the result to the
3086 type of the actual parameter. */
3088 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
3090 /* If the result is a padded type, remove the padding. */
3091 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
3093 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
3096 /* If the actual is a type conversion, the real target object is
3097 denoted by the inner Expression and we need to convert the
3098 result to the associated type.
3099 We also need to convert our gnu assignment target to this type
3100 if the corresponding GNU_NAME was constructed from the GNAT
3101 conversion node and not from the inner Expression. */
3102 if (Nkind (gnat_actual) == N_Type_Conversion)
3105 = convert_with_check
3106 (Etype (Expression (gnat_actual)), gnu_result,
3107 Do_Overflow_Check (gnat_actual),
3108 Do_Range_Check (Expression (gnat_actual)),
3109 Float_Truncate (gnat_actual), gnat_actual);
3111 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
3112 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
3115 /* Unchecked conversions as actuals for Out parameters are not
3116 allowed in user code because they are not variables, but do
3117 occur in front-end expansions. The associated GNU_NAME is
3118 always obtained from the inner expression in such cases. */
3119 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
3120 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
3122 No_Truncation (gnat_actual));
3125 if (Do_Range_Check (gnat_actual))
3127 = emit_range_check (gnu_result, Etype (gnat_actual),
3130 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
3131 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
3132 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
3135 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
3136 gnu_actual, gnu_result);
3137 set_expr_location_from_node (gnu_result, gnat_node);
3138 append_to_statement_list (gnu_result, &gnu_before_list);
3139 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
3140 gnu_name_list = TREE_CHAIN (gnu_name_list);
3144 append_to_statement_list (gnu_call, &gnu_before_list);
3146 append_to_statement_list (gnu_after_list, &gnu_before_list);
3148 add_stmt (gnu_before_list);
3150 return end_stmt_group ();
3153 /* Subroutine of gnat_to_gnu to translate gnat_node, an
3154 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
3157 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
3159 tree gnu_jmpsave_decl = NULL_TREE;
3160 tree gnu_jmpbuf_decl = NULL_TREE;
3161 /* If just annotating, ignore all EH and cleanups. */
3162 bool gcc_zcx = (!type_annotate_only
3163 && Present (Exception_Handlers (gnat_node))
3164 && Exception_Mechanism == Back_End_Exceptions);
3166 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
3167 && Exception_Mechanism == Setjmp_Longjmp);
3168 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
3169 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
3170 tree gnu_inner_block; /* The statement(s) for the block itself. */
3175 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
3176 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
3177 add_cleanup, and when we leave the binding, end_stmt_group will create
3178 the TRY_FINALLY_EXPR.
3180 ??? The region level calls down there have been specifically put in place
3181 for a ZCX context and currently the order in which things are emitted
3182 (region/handlers) is different from the SJLJ case. Instead of putting
3183 other calls with different conditions at other places for the SJLJ case,
3184 it seems cleaner to reorder things for the SJLJ case and generalize the
3185 condition to make it not ZCX specific.
3187 If there are any exceptions or cleanup processing involved, we need an
3188 outer statement group (for Setjmp_Longjmp) and binding level. */
3189 if (binding_for_block)
3191 start_stmt_group ();
3195 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
3196 area for address of previous buffer. Do this first since we need to have
3197 the setjmp buf known for any decls in this block. */
3200 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
3201 NULL_TREE, jmpbuf_ptr_type,
3202 build_call_0_expr (get_jmpbuf_decl),
3203 false, false, false, false, NULL,
3205 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
3207 /* The __builtin_setjmp receivers will immediately reinstall it. Now
3208 because of the unstructured form of EH used by setjmp_longjmp, there
3209 might be forward edges going to __builtin_setjmp receivers on which
3210 it is uninitialized, although they will never be actually taken. */
3211 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
3212 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
3213 NULL_TREE, jmpbuf_type,
3214 NULL_TREE, false, false, false, false,
3216 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
3218 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
3220 /* When we exit this block, restore the saved value. */
3221 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
3222 End_Label (gnat_node));
3225 /* If we are to call a function when exiting this block, add a cleanup
3226 to the binding level we made above. Note that add_cleanup is FIFO
3227 so we must register this cleanup after the EH cleanup just above. */
3229 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
3230 End_Label (gnat_node));
3232 /* Now build the tree for the declarations and statements inside this block.
3233 If this is SJLJ, set our jmp_buf as the current buffer. */
3234 start_stmt_group ();
3237 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3238 build_unary_op (ADDR_EXPR, NULL_TREE,
3241 if (Present (First_Real_Statement (gnat_node)))
3242 process_decls (Statements (gnat_node), Empty,
3243 First_Real_Statement (gnat_node), true, true);
3245 /* Generate code for each statement in the block. */
3246 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3247 ? First_Real_Statement (gnat_node)
3248 : First (Statements (gnat_node)));
3249 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3250 add_stmt (gnat_to_gnu (gnat_temp));
3251 gnu_inner_block = end_stmt_group ();
3253 /* Now generate code for the two exception models, if either is relevant for
3257 tree *gnu_else_ptr = 0;
3260 /* Make a binding level for the exception handling declarations and code
3261 and set up gnu_except_ptr_stack for the handlers to use. */
3262 start_stmt_group ();
3265 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3266 create_var_decl (get_identifier ("EXCEPT_PTR"),
3268 build_pointer_type (except_type_node),
3269 build_call_0_expr (get_excptr_decl), false,
3270 false, false, false, NULL, gnat_node));
3272 /* Generate code for each handler. The N_Exception_Handler case does the
3273 real work and returns a COND_EXPR for each handler, which we chain
3275 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3276 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3278 gnu_expr = gnat_to_gnu (gnat_temp);
3280 /* If this is the first one, set it as the outer one. Otherwise,
3281 point the "else" part of the previous handler to us. Then point
3282 to our "else" part. */
3284 add_stmt (gnu_expr);
3286 *gnu_else_ptr = gnu_expr;
3288 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3291 /* If none of the exception handlers did anything, re-raise but do not
3293 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3294 TREE_VALUE (gnu_except_ptr_stack));
3295 set_expr_location_from_node
3297 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
3300 *gnu_else_ptr = gnu_expr;
3302 add_stmt (gnu_expr);
3304 /* End the binding level dedicated to the exception handlers and get the
3305 whole statement group. */
3306 pop_stack (&gnu_except_ptr_stack);
3308 gnu_handler = end_stmt_group ();
3310 /* If the setjmp returns 1, we restore our incoming longjmp value and
3311 then check the handlers. */
3312 start_stmt_group ();
3313 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3316 add_stmt (gnu_handler);
3317 gnu_handler = end_stmt_group ();
3319 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3320 gnu_result = build3 (COND_EXPR, void_type_node,
3323 build_unary_op (ADDR_EXPR, NULL_TREE,
3325 gnu_handler, gnu_inner_block);
3331 /* First make a block containing the handlers. */
3332 start_stmt_group ();
3333 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3334 Present (gnat_temp);
3335 gnat_temp = Next_Non_Pragma (gnat_temp))
3336 add_stmt (gnat_to_gnu (gnat_temp));
3337 gnu_handlers = end_stmt_group ();
3339 /* Now make the TRY_CATCH_EXPR for the block. */
3340 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3341 gnu_inner_block, gnu_handlers);
3344 gnu_result = gnu_inner_block;
3346 /* Now close our outer block, if we had to make one. */
3347 if (binding_for_block)
3349 add_stmt (gnu_result);
3351 gnu_result = end_stmt_group ();
3357 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3358 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3359 exception handling. */
3362 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3364 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3365 an "if" statement to select the proper exceptions. For "Others", exclude
3366 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3367 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3368 tree gnu_choice = integer_zero_node;
3369 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3372 for (gnat_temp = First (Exception_Choices (gnat_node));
3373 gnat_temp; gnat_temp = Next (gnat_temp))
3377 if (Nkind (gnat_temp) == N_Others_Choice)
3379 if (All_Others (gnat_temp))
3380 this_choice = integer_one_node;
3384 (EQ_EXPR, boolean_type_node,
3389 (INDIRECT_REF, NULL_TREE,
3390 TREE_VALUE (gnu_except_ptr_stack)),
3391 get_identifier ("not_handled_by_others"), NULL_TREE,
3396 else if (Nkind (gnat_temp) == N_Identifier
3397 || Nkind (gnat_temp) == N_Expanded_Name)
3399 Entity_Id gnat_ex_id = Entity (gnat_temp);
3402 /* Exception may be a renaming. Recover original exception which is
3403 the one elaborated and registered. */
3404 if (Present (Renamed_Object (gnat_ex_id)))
3405 gnat_ex_id = Renamed_Object (gnat_ex_id);
3407 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3411 (EQ_EXPR, boolean_type_node, TREE_VALUE (gnu_except_ptr_stack),
3412 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3413 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3415 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3416 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3418 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3421 = build_component_ref
3422 (build_unary_op (INDIRECT_REF, NULL_TREE,
3423 TREE_VALUE (gnu_except_ptr_stack)),
3424 get_identifier ("lang"), NULL_TREE, false);
3428 (TRUTH_ORIF_EXPR, boolean_type_node,
3429 build_binary_op (EQ_EXPR, boolean_type_node, gnu_comp,
3430 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3437 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
3438 gnu_choice, this_choice);
3441 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3444 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3445 to a GCC tree, which is returned. This is the variant for ZCX. */
3448 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3450 tree gnu_etypes_list = NULL_TREE;
3453 tree gnu_current_exc_ptr;
3454 tree gnu_incoming_exc_ptr;
3457 /* We build a TREE_LIST of nodes representing what exception types this
3458 handler can catch, with special cases for others and all others cases.
3460 Each exception type is actually identified by a pointer to the exception
3461 id, or to a dummy object for "others" and "all others". */
3462 for (gnat_temp = First (Exception_Choices (gnat_node));
3463 gnat_temp; gnat_temp = Next (gnat_temp))
3465 if (Nkind (gnat_temp) == N_Others_Choice)
3468 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3471 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3473 else if (Nkind (gnat_temp) == N_Identifier
3474 || Nkind (gnat_temp) == N_Expanded_Name)
3476 Entity_Id gnat_ex_id = Entity (gnat_temp);
3478 /* Exception may be a renaming. Recover original exception which is
3479 the one elaborated and registered. */
3480 if (Present (Renamed_Object (gnat_ex_id)))
3481 gnat_ex_id = Renamed_Object (gnat_ex_id);
3483 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3484 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3486 /* The Non_Ada_Error case for VMS exceptions is handled
3487 by the personality routine. */
3492 /* The GCC interface expects NULL to be passed for catch all handlers, so
3493 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3494 is integer_zero_node. It would not work, however, because GCC's
3495 notion of "catch all" is stronger than our notion of "others". Until
3496 we correctly use the cleanup interface as well, doing that would
3497 prevent the "all others" handlers from being seen, because nothing
3498 can be caught beyond a catch all from GCC's point of view. */
3499 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3502 start_stmt_group ();
3505 /* Expand a call to the begin_handler hook at the beginning of the handler,
3506 and arrange for a call to the end_handler hook to occur on every possible
3509 The hooks expect a pointer to the low level occurrence. This is required
3510 for our stack management scheme because a raise inside the handler pushes
3511 a new occurrence on top of the stack, which means that this top does not
3512 necessarily match the occurrence this handler was dealing with.
3514 __builtin_eh_pointer references the exception occurrence being
3515 propagated. Upon handler entry, this is the exception for which the
3516 handler is triggered. This might not be the case upon handler exit,
3517 however, as we might have a new occurrence propagated by the handler's
3518 body, and the end_handler hook called as a cleanup in this context.
3520 We use a local variable to retrieve the incoming value at handler entry
3521 time, and reuse it to feed the end_handler hook's argument at exit. */
3524 = build_call_expr (built_in_decls [BUILT_IN_EH_POINTER],
3525 1, integer_zero_node);
3526 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3527 ptr_type_node, gnu_current_exc_ptr,
3528 false, false, false, false, NULL,
3531 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3532 gnu_incoming_exc_ptr),
3534 /* ??? We don't seem to have an End_Label at hand to set the location. */
3535 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3537 add_stmt_list (Statements (gnat_node));
3540 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3544 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3547 Compilation_Unit_to_gnu (Node_Id gnat_node)
3549 const Node_Id gnat_unit = Unit (gnat_node);
3550 const bool body_p = (Nkind (gnat_unit) == N_Package_Body
3551 || Nkind (gnat_unit) == N_Subprogram_Body);
3552 const Entity_Id gnat_unit_entity = Defining_Entity (gnat_unit);
3553 /* Make the decl for the elaboration procedure. */
3554 tree gnu_elab_proc_decl
3555 = create_subprog_decl
3556 (create_concat_name (gnat_unit_entity, body_p ? "elabb" : "elabs"),
3557 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL, gnat_unit);
3558 struct elab_info *info;
3560 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3561 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3563 /* Initialize the information structure for the function. */
3564 allocate_struct_function (gnu_elab_proc_decl, false);
3565 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3566 current_function_decl = NULL_TREE;
3568 start_stmt_group ();
3571 current_function_decl = NULL_TREE;
3573 start_stmt_group ();
3576 /* For a body, first process the spec if there is one. */
3577 if (Nkind (Unit (gnat_node)) == N_Package_Body
3578 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3579 && !Acts_As_Spec (gnat_node)))
3581 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3582 finalize_from_with_types ();
3585 /* If we can inline, generate code for all the inlined subprograms. */
3588 Entity_Id gnat_entity;
3590 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
3591 Present (gnat_entity);
3592 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
3594 Node_Id gnat_body = Parent (Declaration_Node (gnat_entity));
3596 if (Nkind (gnat_body) != N_Subprogram_Body)
3598 /* ??? This really should always be present. */
3599 if (No (Corresponding_Body (gnat_body)))
3602 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
3605 if (Present (gnat_body))
3607 /* Define the entity first so we set DECL_EXTERNAL. */
3608 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
3609 add_stmt (gnat_to_gnu (gnat_body));
3614 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3616 elaborate_all_entities (gnat_node);
3618 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3619 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3620 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3624 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3626 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3628 /* Process any pragmas and actions following the unit. */
3629 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3630 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3631 finalize_from_with_types ();
3633 /* Save away what we've made so far and record this potential elaboration
3635 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3636 set_current_block_context (gnu_elab_proc_decl);
3638 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3642 &DECL_STRUCT_FUNCTION (gnu_elab_proc_decl)->function_end_locus);
3644 info->next = elab_info_list;
3645 info->elab_proc = gnu_elab_proc_decl;
3646 info->gnat_node = gnat_node;
3647 elab_info_list = info;
3649 /* Generate elaboration code for this unit, if necessary, and say whether
3651 pop_stack (&gnu_elab_proc_stack);
3653 /* Invalidate the global renaming pointers. This is necessary because
3654 stabilization of the renamed entities may create SAVE_EXPRs which
3655 have been tied to a specific elaboration routine just above. */
3656 invalidate_global_renaming_pointers ();
3659 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
3660 as gigi is concerned. This is used to avoid conversions on the LHS. */
3663 unchecked_conversion_nop (Node_Id gnat_node)
3665 Entity_Id from_type, to_type;
3667 /* The conversion must be on the LHS of an assignment or an actual parameter
3668 of a call. Otherwise, even if the conversion was essentially a no-op, it
3669 could de facto ensure type consistency and this should be preserved. */
3670 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3671 && Name (Parent (gnat_node)) == gnat_node)
3672 && !((Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
3673 || Nkind (Parent (gnat_node)) == N_Function_Call)
3674 && Name (Parent (gnat_node)) != gnat_node))
3677 from_type = Etype (Expression (gnat_node));
3679 /* We're interested in artificial conversions generated by the front-end
3680 to make private types explicit, e.g. in Expand_Assign_Array. */
3681 if (!Is_Private_Type (from_type))
3684 from_type = Underlying_Type (from_type);
3685 to_type = Etype (gnat_node);
3687 /* The direct conversion to the underlying type is a no-op. */
3688 if (to_type == from_type)
3691 /* For an array subtype, the conversion to the PAT is a no-op. */
3692 if (Ekind (from_type) == E_Array_Subtype
3693 && to_type == Packed_Array_Type (from_type))
3696 /* For a record subtype, the conversion to the type is a no-op. */
3697 if (Ekind (from_type) == E_Record_Subtype
3698 && to_type == Etype (from_type))
3704 /* This function is the driver of the GNAT to GCC tree transformation process.
3705 It is the entry point of the tree transformer. GNAT_NODE is the root of
3706 some GNAT tree. Return the root of the corresponding GCC tree. If this
3707 is an expression, return the GCC equivalent of the expression. If this
3708 is a statement, return the statement or add it to the current statement
3709 group, in which case anything returned is to be interpreted as occurring
3710 after anything added. */
3713 gnat_to_gnu (Node_Id gnat_node)
3715 const Node_Kind kind = Nkind (gnat_node);
3716 bool went_into_elab_proc = false;
3717 tree gnu_result = error_mark_node; /* Default to no value. */
3718 tree gnu_result_type = void_type_node;
3719 tree gnu_expr, gnu_lhs, gnu_rhs;
3722 /* Save node number for error message and set location information. */
3723 error_gnat_node = gnat_node;
3724 Sloc_to_locus (Sloc (gnat_node), &input_location);
3726 /* If this node is a statement and we are only annotating types, return an
3727 empty statement list. */
3728 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
3729 return alloc_stmt_list ();
3731 /* If this node is a non-static subexpression and we are only annotating
3732 types, make this into a NULL_EXPR. */
3733 if (type_annotate_only
3734 && IN (kind, N_Subexpr)
3735 && kind != N_Identifier
3736 && !Compile_Time_Known_Value (gnat_node))
3737 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3738 build_call_raise (CE_Range_Check_Failed, gnat_node,
3739 N_Raise_Constraint_Error));
3741 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
3742 && kind != N_Null_Statement)
3743 || kind == N_Procedure_Call_Statement
3745 || kind == N_Implicit_Label_Declaration
3746 || kind == N_Handled_Sequence_Of_Statements
3747 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
3749 /* If this is a statement and we are at top level, it must be part of
3750 the elaboration procedure, so mark us as being in that procedure. */
3751 if (!current_function_decl)
3753 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3754 went_into_elab_proc = true;
3757 /* If we are in the elaboration procedure, check if we are violating a
3758 No_Elaboration_Code restriction by having a statement there. Don't
3759 check for a possible No_Elaboration_Code restriction violation on
3760 N_Handled_Sequence_Of_Statements, as we want to signal an error on
3761 every nested real statement instead. This also avoids triggering
3762 spurious errors on dummy (empty) sequences created by the front-end
3763 for package bodies in some cases. */
3764 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3765 && kind != N_Handled_Sequence_Of_Statements)
3766 Check_Elaboration_Code_Allowed (gnat_node);
3771 /********************************/
3772 /* Chapter 2: Lexical Elements */
3773 /********************************/
3776 case N_Expanded_Name:
3777 case N_Operator_Symbol:
3778 case N_Defining_Identifier:
3779 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3782 case N_Integer_Literal:
3786 /* Get the type of the result, looking inside any padding and
3787 justified modular types. Then get the value in that type. */
3788 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3790 if (TREE_CODE (gnu_type) == RECORD_TYPE
3791 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3792 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3794 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3796 /* If the result overflows (meaning it doesn't fit in its base type),
3797 abort. We would like to check that the value is within the range
3798 of the subtype, but that causes problems with subtypes whose usage
3799 will raise Constraint_Error and with biased representation, so
3801 gcc_assert (!TREE_OVERFLOW (gnu_result));
3805 case N_Character_Literal:
3806 /* If a Entity is present, it means that this was one of the
3807 literals in a user-defined character type. In that case,
3808 just return the value in the CONST_DECL. Otherwise, use the
3809 character code. In that case, the base type should be an
3810 INTEGER_TYPE, but we won't bother checking for that. */
3811 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3812 if (Present (Entity (gnat_node)))
3813 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3816 = build_int_cst_type
3817 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3820 case N_Real_Literal:
3821 /* If this is of a fixed-point type, the value we want is the
3822 value of the corresponding integer. */
3823 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3825 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3826 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3828 gcc_assert (!TREE_OVERFLOW (gnu_result));
3831 /* We should never see a Vax_Float type literal, since the front end
3832 is supposed to transform these using appropriate conversions. */
3833 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3838 Ureal ur_realval = Realval (gnat_node);
3840 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3842 /* If the real value is zero, so is the result. Otherwise,
3843 convert it to a machine number if it isn't already. That
3844 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3845 if (UR_Is_Zero (ur_realval))
3846 gnu_result = convert (gnu_result_type, integer_zero_node);
3849 if (!Is_Machine_Number (gnat_node))
3851 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3852 ur_realval, Round_Even, gnat_node);
3855 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3857 /* If we have a base of zero, divide by the denominator.
3858 Otherwise, the base must be 2 and we scale the value, which
3859 we know can fit in the mantissa of the type (hence the use
3860 of that type above). */
3861 if (No (Rbase (ur_realval)))
3863 = build_binary_op (RDIV_EXPR,
3864 get_base_type (gnu_result_type),
3866 UI_To_gnu (Denominator (ur_realval),
3870 REAL_VALUE_TYPE tmp;
3872 gcc_assert (Rbase (ur_realval) == 2);
3873 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3874 - UI_To_Int (Denominator (ur_realval)));
3875 gnu_result = build_real (gnu_result_type, tmp);
3879 /* Now see if we need to negate the result. Do it this way to
3880 properly handle -0. */
3881 if (UR_Is_Negative (Realval (gnat_node)))
3883 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3889 case N_String_Literal:
3890 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3891 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3893 String_Id gnat_string = Strval (gnat_node);
3894 int length = String_Length (gnat_string);
3897 if (length >= ALLOCA_THRESHOLD)
3898 string = XNEWVEC (char, length + 1);
3900 string = (char *) alloca (length + 1);
3902 /* Build the string with the characters in the literal. Note
3903 that Ada strings are 1-origin. */
3904 for (i = 0; i < length; i++)
3905 string[i] = Get_String_Char (gnat_string, i + 1);
3907 /* Put a null at the end of the string in case it's in a context
3908 where GCC will want to treat it as a C string. */
3911 gnu_result = build_string (length, string);
3913 /* Strings in GCC don't normally have types, but we want
3914 this to not be converted to the array type. */
3915 TREE_TYPE (gnu_result) = gnu_result_type;
3917 if (length >= ALLOCA_THRESHOLD)
3922 /* Build a list consisting of each character, then make
3924 String_Id gnat_string = Strval (gnat_node);
3925 int length = String_Length (gnat_string);
3927 tree gnu_list = NULL_TREE;
3928 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3930 for (i = 0; i < length; i++)
3933 = tree_cons (gnu_idx,
3934 build_int_cst (TREE_TYPE (gnu_result_type),
3935 Get_String_Char (gnat_string,
3939 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3944 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3949 gnu_result = Pragma_to_gnu (gnat_node);
3952 /**************************************/
3953 /* Chapter 3: Declarations and Types */
3954 /**************************************/
3956 case N_Subtype_Declaration:
3957 case N_Full_Type_Declaration:
3958 case N_Incomplete_Type_Declaration:
3959 case N_Private_Type_Declaration:
3960 case N_Private_Extension_Declaration:
3961 case N_Task_Type_Declaration:
3962 process_type (Defining_Entity (gnat_node));
3963 gnu_result = alloc_stmt_list ();
3966 case N_Object_Declaration:
3967 case N_Exception_Declaration:
3968 gnat_temp = Defining_Entity (gnat_node);
3969 gnu_result = alloc_stmt_list ();
3971 /* If we are just annotating types and this object has an unconstrained
3972 or task type, don't elaborate it. */
3973 if (type_annotate_only
3974 && (((Is_Array_Type (Etype (gnat_temp))
3975 || Is_Record_Type (Etype (gnat_temp)))
3976 && !Is_Constrained (Etype (gnat_temp)))
3977 || Is_Concurrent_Type (Etype (gnat_temp))))
3980 if (Present (Expression (gnat_node))
3981 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
3982 && (!type_annotate_only
3983 || Compile_Time_Known_Value (Expression (gnat_node))))
3985 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3986 if (Do_Range_Check (Expression (gnat_node)))
3988 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3990 /* If this object has its elaboration delayed, we must force
3991 evaluation of GNU_EXPR right now and save it for when the object
3993 if (Present (Freeze_Node (gnat_temp)))
3995 if ((Is_Public (gnat_temp) || global_bindings_p ())
3996 && !TREE_CONSTANT (gnu_expr))
3998 = create_var_decl (create_concat_name (gnat_temp, "init"),
3999 NULL_TREE, TREE_TYPE (gnu_expr),
4000 gnu_expr, false, Is_Public (gnat_temp),
4001 false, false, NULL, gnat_temp);
4003 gnu_expr = gnat_save_expr (gnu_expr);
4005 save_gnu_tree (gnat_node, gnu_expr, true);
4009 gnu_expr = NULL_TREE;
4011 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
4012 gnu_expr = NULL_TREE;
4014 /* If this is a deferred constant with an address clause, we ignore the
4015 full view since the clause is on the partial view and we cannot have
4016 2 different GCC trees for the object. The only bits of the full view
4017 we will use is the initializer, but it will be directly fetched. */
4018 if (Ekind(gnat_temp) == E_Constant
4019 && Present (Address_Clause (gnat_temp))
4020 && Present (Full_View (gnat_temp)))
4021 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
4023 if (No (Freeze_Node (gnat_temp)))
4024 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
4027 case N_Object_Renaming_Declaration:
4028 gnat_temp = Defining_Entity (gnat_node);
4030 /* Don't do anything if this renaming is handled by the front end or if
4031 we are just annotating types and this object has a composite or task
4032 type, don't elaborate it. We return the result in case it has any
4033 SAVE_EXPRs in it that need to be evaluated here. */
4034 if (!Is_Renaming_Of_Object (gnat_temp)
4035 && ! (type_annotate_only
4036 && (Is_Array_Type (Etype (gnat_temp))
4037 || Is_Record_Type (Etype (gnat_temp))
4038 || Is_Concurrent_Type (Etype (gnat_temp)))))
4040 = gnat_to_gnu_entity (gnat_temp,
4041 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
4043 gnu_result = alloc_stmt_list ();
4046 case N_Implicit_Label_Declaration:
4047 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4048 gnu_result = alloc_stmt_list ();
4051 case N_Exception_Renaming_Declaration:
4052 case N_Number_Declaration:
4053 case N_Package_Renaming_Declaration:
4054 case N_Subprogram_Renaming_Declaration:
4055 /* These are fully handled in the front end. */
4056 gnu_result = alloc_stmt_list ();
4059 /*************************************/
4060 /* Chapter 4: Names and Expressions */
4061 /*************************************/
4063 case N_Explicit_Dereference:
4064 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4065 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4066 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
4069 case N_Indexed_Component:
4071 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
4075 Node_Id *gnat_expr_array;
4077 gnu_array_object = maybe_implicit_deref (gnu_array_object);
4079 /* Convert vector inputs to their representative array type, to fit
4080 what the code below expects. */
4081 gnu_array_object = maybe_vector_array (gnu_array_object);
4083 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
4085 /* If we got a padded type, remove it too. */
4086 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
4088 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
4091 gnu_result = gnu_array_object;
4093 /* First compute the number of dimensions of the array, then
4094 fill the expression array, the order depending on whether
4095 this is a Convention_Fortran array or not. */
4096 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
4097 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
4098 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
4099 ndim++, gnu_type = TREE_TYPE (gnu_type))
4102 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
4104 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
4105 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
4107 i--, gnat_temp = Next (gnat_temp))
4108 gnat_expr_array[i] = gnat_temp;
4110 for (i = 0, gnat_temp = First (Expressions (gnat_node));
4112 i++, gnat_temp = Next (gnat_temp))
4113 gnat_expr_array[i] = gnat_temp;
4115 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
4116 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
4118 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
4119 gnat_temp = gnat_expr_array[i];
4120 gnu_expr = gnat_to_gnu (gnat_temp);
4122 if (Do_Range_Check (gnat_temp))
4125 (gnu_array_object, gnu_expr,
4126 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
4127 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
4130 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
4131 gnu_result, gnu_expr);
4135 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4140 Node_Id gnat_range_node = Discrete_Range (gnat_node);
4143 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4144 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4146 /* Do any implicit dereferences of the prefix and do any needed
4148 gnu_result = maybe_implicit_deref (gnu_result);
4149 gnu_result = maybe_unconstrained_array (gnu_result);
4150 gnu_type = TREE_TYPE (gnu_result);
4151 if (Do_Range_Check (gnat_range_node))
4153 /* Get the bounds of the slice. */
4155 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
4156 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
4157 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
4158 /* Get the permitted bounds. */
4159 tree gnu_base_index_type
4160 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
4161 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4162 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
4163 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4164 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
4165 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
4167 gnu_min_expr = gnat_protect_expr (gnu_min_expr);
4168 gnu_max_expr = gnat_protect_expr (gnu_max_expr);
4170 /* Derive a good type to convert everything to. */
4171 gnu_expr_type = get_base_type (gnu_index_type);
4173 /* Test whether the minimum slice value is too small. */
4174 gnu_expr_l = build_binary_op (LT_EXPR, boolean_type_node,
4175 convert (gnu_expr_type,
4177 convert (gnu_expr_type,
4178 gnu_base_min_expr));
4180 /* Test whether the maximum slice value is too large. */
4181 gnu_expr_h = build_binary_op (GT_EXPR, boolean_type_node,
4182 convert (gnu_expr_type,
4184 convert (gnu_expr_type,
4185 gnu_base_max_expr));
4187 /* Build a slice index check that returns the low bound,
4188 assuming the slice is not empty. */
4189 gnu_expr = emit_check
4190 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
4191 gnu_expr_l, gnu_expr_h),
4192 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
4194 /* Build a conditional expression that does the index checks and
4195 returns the low bound if the slice is not empty (max >= min),
4196 and returns the naked low bound otherwise (max < min), unless
4197 it is non-constant and the high bound is; this prevents VRP
4198 from inferring bogus ranges on the unlikely path. */
4199 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
4200 build_binary_op (GE_EXPR, gnu_expr_type,
4201 convert (gnu_expr_type,
4203 convert (gnu_expr_type,
4206 TREE_CODE (gnu_min_expr) != INTEGER_CST
4207 && TREE_CODE (gnu_max_expr) == INTEGER_CST
4208 ? gnu_max_expr : gnu_min_expr);
4211 /* Simply return the naked low bound. */
4212 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
4214 /* If this is a slice with non-constant size of an array with constant
4215 size, set the maximum size for the allocation of temporaries. */
4216 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
4217 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
4218 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
4220 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
4221 gnu_result, gnu_expr);
4225 case N_Selected_Component:
4227 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
4228 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
4229 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
4232 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
4233 || IN (Ekind (gnat_pref_type), Access_Kind))
4235 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
4236 gnat_pref_type = Underlying_Type (gnat_pref_type);
4237 else if (IN (Ekind (gnat_pref_type), Access_Kind))
4238 gnat_pref_type = Designated_Type (gnat_pref_type);
4241 gnu_prefix = maybe_implicit_deref (gnu_prefix);
4243 /* For discriminant references in tagged types always substitute the
4244 corresponding discriminant as the actual selected component. */
4245 if (Is_Tagged_Type (gnat_pref_type))
4246 while (Present (Corresponding_Discriminant (gnat_field)))
4247 gnat_field = Corresponding_Discriminant (gnat_field);
4249 /* For discriminant references of untagged types always substitute the
4250 corresponding stored discriminant. */
4251 else if (Present (Corresponding_Discriminant (gnat_field)))
4252 gnat_field = Original_Record_Component (gnat_field);
4254 /* Handle extracting the real or imaginary part of a complex.
4255 The real part is the first field and the imaginary the last. */
4256 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
4257 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
4258 ? REALPART_EXPR : IMAGPART_EXPR,
4259 NULL_TREE, gnu_prefix);
4262 gnu_field = gnat_to_gnu_field_decl (gnat_field);
4264 /* If there are discriminants, the prefix might be evaluated more
4265 than once, which is a problem if it has side-effects. */
4266 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
4267 ? Designated_Type (Etype
4268 (Prefix (gnat_node)))
4269 : Etype (Prefix (gnat_node))))
4270 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL);
4273 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
4274 (Nkind (Parent (gnat_node))
4275 == N_Attribute_Reference)
4276 && lvalue_required_for_attribute_p
4277 (Parent (gnat_node)));
4280 gcc_assert (gnu_result);
4281 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4285 case N_Attribute_Reference:
4287 /* The attribute designator. */
4288 const int attr = Get_Attribute_Id (Attribute_Name (gnat_node));
4290 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
4291 is a unit, not an object with a GCC equivalent. */
4292 if (attr == Attr_Elab_Spec || attr == Attr_Elab_Body)
4294 create_subprog_decl (create_concat_name
4295 (Entity (Prefix (gnat_node)),
4296 attr == Attr_Elab_Body ? "elabb" : "elabs"),
4297 NULL_TREE, void_ftype, NULL_TREE, false,
4298 true, true, NULL, gnat_node);
4300 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attr);
4305 /* Like 'Access as far as we are concerned. */
4306 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4307 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4308 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4312 case N_Extension_Aggregate:
4316 /* ??? It is wrong to evaluate the type now, but there doesn't
4317 seem to be any other practical way of doing it. */
4319 gcc_assert (!Expansion_Delayed (gnat_node));
4321 gnu_aggr_type = gnu_result_type
4322 = get_unpadded_type (Etype (gnat_node));
4324 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4325 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4327 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4328 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
4329 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
4331 if (Null_Record_Present (gnat_node))
4332 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4334 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4335 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4337 = assoc_to_constructor (Etype (gnat_node),
4338 First (Component_Associations (gnat_node)),
4340 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4341 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4343 Component_Type (Etype (gnat_node)));
4344 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4347 (COMPLEX_EXPR, gnu_aggr_type,
4348 gnat_to_gnu (Expression (First
4349 (Component_Associations (gnat_node)))),
4350 gnat_to_gnu (Expression
4352 (First (Component_Associations (gnat_node))))));
4356 gnu_result = convert (gnu_result_type, gnu_result);
4361 if (TARGET_VTABLE_USES_DESCRIPTORS
4362 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4363 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4364 gnu_result = null_fdesc_node;
4366 gnu_result = null_pointer_node;
4367 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4370 case N_Type_Conversion:
4371 case N_Qualified_Expression:
4372 /* Get the operand expression. */
4373 gnu_result = gnat_to_gnu (Expression (gnat_node));
4374 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4377 = convert_with_check (Etype (gnat_node), gnu_result,
4378 Do_Overflow_Check (gnat_node),
4379 Do_Range_Check (Expression (gnat_node)),
4380 kind == N_Type_Conversion
4381 && Float_Truncate (gnat_node), gnat_node);
4384 case N_Unchecked_Type_Conversion:
4385 gnu_result = gnat_to_gnu (Expression (gnat_node));
4387 /* Skip further processing if the conversion is deemed a no-op. */
4388 if (unchecked_conversion_nop (gnat_node))
4390 gnu_result_type = TREE_TYPE (gnu_result);
4394 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4396 /* If the result is a pointer type, see if we are improperly
4397 converting to a stricter alignment. */
4398 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4399 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4401 unsigned int align = known_alignment (gnu_result);
4402 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4403 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4405 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4406 post_error_ne_tree_2
4407 ("?source alignment (^) '< alignment of & (^)",
4408 gnat_node, Designated_Type (Etype (gnat_node)),
4409 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4412 /* If we are converting a descriptor to a function pointer, first
4413 build the pointer. */
4414 if (TARGET_VTABLE_USES_DESCRIPTORS
4415 && TREE_TYPE (gnu_result) == fdesc_type_node
4416 && POINTER_TYPE_P (gnu_result_type))
4417 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4419 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4420 No_Truncation (gnat_node));
4426 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
4427 Node_Id gnat_range = Right_Opnd (gnat_node);
4428 tree gnu_low, gnu_high;
4430 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
4432 if (Nkind (gnat_range) == N_Range)
4434 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4435 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4437 else if (Nkind (gnat_range) == N_Identifier
4438 || Nkind (gnat_range) == N_Expanded_Name)
4440 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4442 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4443 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4448 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4450 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
4451 ensure that GNU_OBJ is evaluated only once and perform a full range
4453 if (operand_equal_p (gnu_low, gnu_high, 0))
4455 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
4459 gnu_obj = gnat_protect_expr (gnu_obj);
4460 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
4462 set_expr_location_from_node (t1, gnat_node);
4463 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
4465 set_expr_location_from_node (t2, gnat_node);
4467 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
4470 if (kind == N_Not_In)
4471 gnu_result = invert_truthvalue (gnu_result);
4476 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4477 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4478 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4479 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4481 : (Rounded_Result (gnat_node)
4482 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4483 gnu_result_type, gnu_lhs, gnu_rhs);
4486 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4487 /* These can either be operations on booleans or on modular types.
4488 Fall through for boolean types since that's the way GNU_CODES is
4490 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4491 Modular_Integer_Kind))
4494 = (kind == N_Op_Or ? BIT_IOR_EXPR
4495 : kind == N_Op_And ? BIT_AND_EXPR
4498 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4499 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4500 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4501 gnu_result = build_binary_op (code, gnu_result_type,
4506 /* ... fall through ... */
4508 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4509 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4510 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4511 case N_Op_Mod: case N_Op_Rem:
4512 case N_Op_Rotate_Left:
4513 case N_Op_Rotate_Right:
4514 case N_Op_Shift_Left:
4515 case N_Op_Shift_Right:
4516 case N_Op_Shift_Right_Arithmetic:
4517 case N_And_Then: case N_Or_Else:
4519 enum tree_code code = gnu_codes[kind];
4520 bool ignore_lhs_overflow = false;
4521 location_t saved_location = input_location;
4524 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4525 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4526 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4528 /* Pending generic support for efficient vector logical operations in
4529 GCC, convert vectors to their representative array type view and
4531 gnu_lhs = maybe_vector_array (gnu_lhs);
4532 gnu_rhs = maybe_vector_array (gnu_rhs);
4534 /* If this is a comparison operator, convert any references to
4535 an unconstrained array value into a reference to the
4537 if (TREE_CODE_CLASS (code) == tcc_comparison)
4539 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4540 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4543 /* If the result type is a private type, its full view may be a
4544 numeric subtype. The representation we need is that of its base
4545 type, given that it is the result of an arithmetic operation. */
4546 else if (Is_Private_Type (Etype (gnat_node)))
4547 gnu_type = gnu_result_type
4548 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4550 /* If this is a shift whose count is not guaranteed to be correct,
4551 we need to adjust the shift count. */
4552 if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
4554 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4556 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4558 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
4559 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4560 gnu_rhs, gnu_max_shift);
4561 else if (kind == N_Op_Shift_Right_Arithmetic)
4564 (MIN_EXPR, gnu_count_type,
4565 build_binary_op (MINUS_EXPR,
4568 convert (gnu_count_type,
4573 /* For right shifts, the type says what kind of shift to do,
4574 so we may need to choose a different type. In this case,
4575 we have to ignore integer overflow lest it propagates all
4576 the way down and causes a CE to be explicitly raised. */
4577 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
4579 gnu_type = gnat_unsigned_type (gnu_type);
4580 ignore_lhs_overflow = true;
4582 else if (kind == N_Op_Shift_Right_Arithmetic
4583 && TYPE_UNSIGNED (gnu_type))
4585 gnu_type = gnat_signed_type (gnu_type);
4586 ignore_lhs_overflow = true;
4589 if (gnu_type != gnu_result_type)
4591 tree gnu_old_lhs = gnu_lhs;
4592 gnu_lhs = convert (gnu_type, gnu_lhs);
4593 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4594 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4595 gnu_rhs = convert (gnu_type, gnu_rhs);
4598 /* Instead of expanding overflow checks for addition, subtraction
4599 and multiplication itself, the front end will leave this to
4600 the back end when Backend_Overflow_Checks_On_Target is set.
4601 As the GCC back end itself does not know yet how to properly
4602 do overflow checking, do it here. The goal is to push
4603 the expansions further into the back end over time. */
4604 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4605 && (kind == N_Op_Add
4606 || kind == N_Op_Subtract
4607 || kind == N_Op_Multiply)
4608 && !TYPE_UNSIGNED (gnu_type)
4609 && !FLOAT_TYPE_P (gnu_type))
4610 gnu_result = build_binary_op_trapv (code, gnu_type,
4611 gnu_lhs, gnu_rhs, gnat_node);
4614 /* Some operations, e.g. comparisons of arrays, generate complex
4615 trees that need to be annotated while they are being built. */
4616 input_location = saved_location;
4617 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4620 /* If this is a logical shift with the shift count not verified,
4621 we must return zero if it is too large. We cannot compensate
4622 above in this case. */
4623 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
4624 && !Shift_Count_OK (gnat_node))
4628 build_binary_op (GE_EXPR, boolean_type_node,
4630 convert (TREE_TYPE (gnu_rhs),
4631 TYPE_SIZE (gnu_type))),
4632 convert (gnu_type, integer_zero_node),
4637 case N_Conditional_Expression:
4639 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4640 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4642 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4644 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4646 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
4651 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4652 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4656 /* This case can apply to a boolean or a modular type.
4657 Fall through for a boolean operand since GNU_CODES is set
4658 up to handle this. */
4659 if (Is_Modular_Integer_Type (Etype (gnat_node))
4660 || (Ekind (Etype (gnat_node)) == E_Private_Type
4661 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4663 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4664 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4665 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4670 /* ... fall through ... */
4672 case N_Op_Minus: case N_Op_Abs:
4673 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4675 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4676 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4678 gnu_result_type = get_unpadded_type (Base_Type
4679 (Full_View (Etype (gnat_node))));
4681 if (Do_Overflow_Check (gnat_node)
4682 && !TYPE_UNSIGNED (gnu_result_type)
4683 && !FLOAT_TYPE_P (gnu_result_type))
4685 = build_unary_op_trapv (gnu_codes[kind],
4686 gnu_result_type, gnu_expr, gnat_node);
4688 gnu_result = build_unary_op (gnu_codes[kind],
4689 gnu_result_type, gnu_expr);
4696 bool ignore_init_type = false;
4698 gnat_temp = Expression (gnat_node);
4700 /* The Expression operand can either be an N_Identifier or
4701 Expanded_Name, which must represent a type, or a
4702 N_Qualified_Expression, which contains both the object type and an
4703 initial value for the object. */
4704 if (Nkind (gnat_temp) == N_Identifier
4705 || Nkind (gnat_temp) == N_Expanded_Name)
4706 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4707 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4709 Entity_Id gnat_desig_type
4710 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4712 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4713 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4715 gnu_init = maybe_unconstrained_array (gnu_init);
4716 if (Do_Range_Check (Expression (gnat_temp)))
4718 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4720 if (Is_Elementary_Type (gnat_desig_type)
4721 || Is_Constrained (gnat_desig_type))
4723 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4724 gnu_init = convert (gnu_type, gnu_init);
4728 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4729 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4730 gnu_type = TREE_TYPE (gnu_init);
4732 gnu_init = convert (gnu_type, gnu_init);
4738 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4739 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4740 Procedure_To_Call (gnat_node),
4741 Storage_Pool (gnat_node), gnat_node,
4746 /**************************/
4747 /* Chapter 5: Statements */
4748 /**************************/
4751 gnu_result = build1 (LABEL_EXPR, void_type_node,
4752 gnat_to_gnu (Identifier (gnat_node)));
4755 case N_Null_Statement:
4756 /* When not optimizing, turn null statements from source into gotos to
4757 the next statement that the middle-end knows how to preserve. */
4758 if (!optimize && Comes_From_Source (gnat_node))
4760 tree stmt, label = create_label_decl (NULL_TREE);
4761 start_stmt_group ();
4762 stmt = build1 (GOTO_EXPR, void_type_node, label);
4763 set_expr_location_from_node (stmt, gnat_node);
4765 stmt = build1 (LABEL_EXPR, void_type_node, label);
4766 set_expr_location_from_node (stmt, gnat_node);
4768 gnu_result = end_stmt_group ();
4771 gnu_result = alloc_stmt_list ();
4774 case N_Assignment_Statement:
4775 /* Get the LHS and RHS of the statement and convert any reference to an
4776 unconstrained array into a reference to the underlying array. */
4777 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4779 /* If the type has a size that overflows, convert this into raise of
4780 Storage_Error: execution shouldn't have gotten here anyway. */
4781 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4782 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4783 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4784 N_Raise_Storage_Error);
4785 else if (Nkind (Expression (gnat_node)) == N_Function_Call)
4787 = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs);
4791 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4793 /* If range check is needed, emit code to generate it. */
4794 if (Do_Range_Check (Expression (gnat_node)))
4795 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4799 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4801 /* If the type being assigned is an array type and the two sides are
4802 not completely disjoint, play safe and use memmove. But don't do
4803 it for a bit-packed array as it might not be byte-aligned. */
4804 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4805 && Is_Array_Type (Etype (Name (gnat_node)))
4806 && !Is_Bit_Packed_Array (Etype (Name (gnat_node)))
4807 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4809 tree to, from, size, to_ptr, from_ptr, t;
4811 to = TREE_OPERAND (gnu_result, 0);
4812 from = TREE_OPERAND (gnu_result, 1);
4814 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4815 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4817 to_ptr = build_fold_addr_expr (to);
4818 from_ptr = build_fold_addr_expr (from);
4820 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4821 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4826 case N_If_Statement:
4828 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4830 /* Make the outer COND_EXPR. Avoid non-determinism. */
4831 gnu_result = build3 (COND_EXPR, void_type_node,
4832 gnat_to_gnu (Condition (gnat_node)),
4833 NULL_TREE, NULL_TREE);
4834 COND_EXPR_THEN (gnu_result)
4835 = build_stmt_group (Then_Statements (gnat_node), false);
4836 TREE_SIDE_EFFECTS (gnu_result) = 1;
4837 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4839 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4840 into the previous "else" part and point to where to put any
4841 outer "else". Also avoid non-determinism. */
4842 if (Present (Elsif_Parts (gnat_node)))
4843 for (gnat_temp = First (Elsif_Parts (gnat_node));
4844 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4846 gnu_expr = build3 (COND_EXPR, void_type_node,
4847 gnat_to_gnu (Condition (gnat_temp)),
4848 NULL_TREE, NULL_TREE);
4849 COND_EXPR_THEN (gnu_expr)
4850 = build_stmt_group (Then_Statements (gnat_temp), false);
4851 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4852 set_expr_location_from_node (gnu_expr, gnat_temp);
4853 *gnu_else_ptr = gnu_expr;
4854 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4857 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4861 case N_Case_Statement:
4862 gnu_result = Case_Statement_to_gnu (gnat_node);
4865 case N_Loop_Statement:
4866 gnu_result = Loop_Statement_to_gnu (gnat_node);
4869 case N_Block_Statement:
4870 start_stmt_group ();
4872 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4873 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4875 gnu_result = end_stmt_group ();
4877 if (Present (Identifier (gnat_node)))
4878 mark_out_of_scope (Entity (Identifier (gnat_node)));
4881 case N_Exit_Statement:
4883 = build2 (EXIT_STMT, void_type_node,
4884 (Present (Condition (gnat_node))
4885 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4886 (Present (Name (gnat_node))
4887 ? get_gnu_tree (Entity (Name (gnat_node)))
4888 : TREE_VALUE (gnu_loop_label_stack)));
4891 case N_Return_Statement:
4893 tree gnu_ret_val, gnu_ret_obj;
4895 /* If we have a return label defined, convert this into a branch to
4896 that label. The return proper will be handled elsewhere. */
4897 if (TREE_VALUE (gnu_return_label_stack))
4899 gnu_result = build1 (GOTO_EXPR, void_type_node,
4900 TREE_VALUE (gnu_return_label_stack));
4901 /* When not optimizing, make sure the return is preserved. */
4902 if (!optimize && Comes_From_Source (gnat_node))
4903 DECL_ARTIFICIAL (TREE_VALUE (gnu_return_label_stack)) = 0;
4907 /* If the subprogram is a function, we must return the expression. */
4908 if (Present (Expression (gnat_node)))
4910 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4911 tree gnu_result_decl = DECL_RESULT (current_function_decl);
4912 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4914 /* Do not remove the padding from GNU_RET_VAL if the inner type is
4915 self-referential since we want to allocate the fixed size. */
4916 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4917 && TYPE_IS_PADDING_P
4918 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4919 && CONTAINS_PLACEHOLDER_P
4920 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
4921 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4923 /* If the subprogram returns by direct reference, return a pointer
4924 to the return value. */
4925 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
4926 || By_Ref (gnat_node))
4927 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4929 /* Otherwise, if it returns an unconstrained array, we have to
4930 allocate a new version of the result and return it. */
4931 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
4933 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4934 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
4936 TREE_TYPE (gnu_subprog_type),
4937 Procedure_To_Call (gnat_node),
4938 Storage_Pool (gnat_node),
4942 /* If the subprogram returns by invisible reference, dereference
4943 the pointer it is passed using the type of the return value
4944 and build the copy operation manually. This ensures that we
4945 don't copy too much data, for example if the return type is
4946 unconstrained with a maximum size. */
4947 if (TREE_ADDRESSABLE (gnu_subprog_type))
4950 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4952 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4953 gnu_ret_obj, gnu_ret_val);
4954 add_stmt_with_node (gnu_result, gnat_node);
4955 gnu_ret_val = NULL_TREE;
4956 gnu_ret_obj = gnu_result_decl;
4959 /* Otherwise, build a regular return. */
4961 gnu_ret_obj = gnu_result_decl;
4965 gnu_ret_val = NULL_TREE;
4966 gnu_ret_obj = NULL_TREE;
4969 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
4973 case N_Goto_Statement:
4974 gnu_result = build1 (GOTO_EXPR, void_type_node,
4975 gnat_to_gnu (Name (gnat_node)));
4978 /***************************/
4979 /* Chapter 6: Subprograms */
4980 /***************************/
4982 case N_Subprogram_Declaration:
4983 /* Unless there is a freeze node, declare the subprogram. We consider
4984 this a "definition" even though we're not generating code for
4985 the subprogram because we will be making the corresponding GCC
4988 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4989 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4991 gnu_result = alloc_stmt_list ();
4994 case N_Abstract_Subprogram_Declaration:
4995 /* This subprogram doesn't exist for code generation purposes, but we
4996 have to elaborate the types of any parameters and result, unless
4997 they are imported types (nothing to generate in this case). */
4999 /* Process the parameter types first. */
5002 = First_Formal_With_Extras
5003 (Defining_Entity (Specification (gnat_node)));
5004 Present (gnat_temp);
5005 gnat_temp = Next_Formal_With_Extras (gnat_temp))
5006 if (Is_Itype (Etype (gnat_temp))
5007 && !From_With_Type (Etype (gnat_temp)))
5008 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
5011 /* Then the result type, set to Standard_Void_Type for procedures. */
5014 Entity_Id gnat_temp_type
5015 = Etype (Defining_Entity (Specification (gnat_node)));
5017 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
5018 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
5021 gnu_result = alloc_stmt_list ();
5024 case N_Defining_Program_Unit_Name:
5025 /* For a child unit identifier go up a level to get the specification.
5026 We get this when we try to find the spec of a child unit package
5027 that is the compilation unit being compiled. */
5028 gnu_result = gnat_to_gnu (Parent (gnat_node));
5031 case N_Subprogram_Body:
5032 Subprogram_Body_to_gnu (gnat_node);
5033 gnu_result = alloc_stmt_list ();
5036 case N_Function_Call:
5037 case N_Procedure_Call_Statement:
5038 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
5041 /************************/
5042 /* Chapter 7: Packages */
5043 /************************/
5045 case N_Package_Declaration:
5046 gnu_result = gnat_to_gnu (Specification (gnat_node));
5049 case N_Package_Specification:
5051 start_stmt_group ();
5052 process_decls (Visible_Declarations (gnat_node),
5053 Private_Declarations (gnat_node), Empty, true, true);
5054 gnu_result = end_stmt_group ();
5057 case N_Package_Body:
5059 /* If this is the body of a generic package - do nothing. */
5060 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
5062 gnu_result = alloc_stmt_list ();
5066 start_stmt_group ();
5067 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
5069 if (Present (Handled_Statement_Sequence (gnat_node)))
5070 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
5072 gnu_result = end_stmt_group ();
5075 /********************************/
5076 /* Chapter 8: Visibility Rules */
5077 /********************************/
5079 case N_Use_Package_Clause:
5080 case N_Use_Type_Clause:
5081 /* Nothing to do here - but these may appear in list of declarations. */
5082 gnu_result = alloc_stmt_list ();
5085 /*********************/
5086 /* Chapter 9: Tasks */
5087 /*********************/
5089 case N_Protected_Type_Declaration:
5090 gnu_result = alloc_stmt_list ();
5093 case N_Single_Task_Declaration:
5094 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
5095 gnu_result = alloc_stmt_list ();
5098 /*********************************************************/
5099 /* Chapter 10: Program Structure and Compilation Issues */
5100 /*********************************************************/
5102 case N_Compilation_Unit:
5103 /* This is not called for the main unit on which gigi is invoked. */
5104 Compilation_Unit_to_gnu (gnat_node);
5105 gnu_result = alloc_stmt_list ();
5108 case N_Subprogram_Body_Stub:
5109 case N_Package_Body_Stub:
5110 case N_Protected_Body_Stub:
5111 case N_Task_Body_Stub:
5112 /* Simply process whatever unit is being inserted. */
5113 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
5117 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
5120 /***************************/
5121 /* Chapter 11: Exceptions */
5122 /***************************/
5124 case N_Handled_Sequence_Of_Statements:
5125 /* If there is an At_End procedure attached to this node, and the EH
5126 mechanism is SJLJ, we must have at least a corresponding At_End
5127 handler, unless the No_Exception_Handlers restriction is set. */
5128 gcc_assert (type_annotate_only
5129 || Exception_Mechanism != Setjmp_Longjmp
5130 || No (At_End_Proc (gnat_node))
5131 || Present (Exception_Handlers (gnat_node))
5132 || No_Exception_Handlers_Set ());
5134 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
5137 case N_Exception_Handler:
5138 if (Exception_Mechanism == Setjmp_Longjmp)
5139 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
5140 else if (Exception_Mechanism == Back_End_Exceptions)
5141 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
5147 case N_Push_Constraint_Error_Label:
5148 push_exception_label_stack (&gnu_constraint_error_label_stack,
5149 Exception_Label (gnat_node));
5152 case N_Push_Storage_Error_Label:
5153 push_exception_label_stack (&gnu_storage_error_label_stack,
5154 Exception_Label (gnat_node));
5157 case N_Push_Program_Error_Label:
5158 push_exception_label_stack (&gnu_program_error_label_stack,
5159 Exception_Label (gnat_node));
5162 case N_Pop_Constraint_Error_Label:
5163 gnu_constraint_error_label_stack
5164 = TREE_CHAIN (gnu_constraint_error_label_stack);
5167 case N_Pop_Storage_Error_Label:
5168 gnu_storage_error_label_stack
5169 = TREE_CHAIN (gnu_storage_error_label_stack);
5172 case N_Pop_Program_Error_Label:
5173 gnu_program_error_label_stack
5174 = TREE_CHAIN (gnu_program_error_label_stack);
5177 /******************************/
5178 /* Chapter 12: Generic Units */
5179 /******************************/
5181 case N_Generic_Function_Renaming_Declaration:
5182 case N_Generic_Package_Renaming_Declaration:
5183 case N_Generic_Procedure_Renaming_Declaration:
5184 case N_Generic_Package_Declaration:
5185 case N_Generic_Subprogram_Declaration:
5186 case N_Package_Instantiation:
5187 case N_Procedure_Instantiation:
5188 case N_Function_Instantiation:
5189 /* These nodes can appear on a declaration list but there is nothing to
5190 to be done with them. */
5191 gnu_result = alloc_stmt_list ();
5194 /**************************************************/
5195 /* Chapter 13: Representation Clauses and */
5196 /* Implementation-Dependent Features */
5197 /**************************************************/
5199 case N_Attribute_Definition_Clause:
5200 gnu_result = alloc_stmt_list ();
5202 /* The only one we need to deal with is 'Address since, for the others,
5203 the front-end puts the information elsewhere. */
5204 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
5207 /* And we only deal with 'Address if the object has a Freeze node. */
5208 gnat_temp = Entity (Name (gnat_node));
5209 if (No (Freeze_Node (gnat_temp)))
5212 /* Get the value to use as the address and save it as the equivalent
5213 for the object. When it is frozen, gnat_to_gnu_entity will do the
5215 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
5218 case N_Enumeration_Representation_Clause:
5219 case N_Record_Representation_Clause:
5221 /* We do nothing with these. SEM puts the information elsewhere. */
5222 gnu_result = alloc_stmt_list ();
5225 case N_Code_Statement:
5226 if (!type_annotate_only)
5228 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
5229 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
5230 tree gnu_clobbers = NULL_TREE, tail;
5231 bool allows_mem, allows_reg, fake;
5232 int ninputs, noutputs, i;
5233 const char **oconstraints;
5234 const char *constraint;
5237 /* First retrieve the 3 operand lists built by the front-end. */
5238 Setup_Asm_Outputs (gnat_node);
5239 while (Present (gnat_temp = Asm_Output_Variable ()))
5241 tree gnu_value = gnat_to_gnu (gnat_temp);
5242 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5243 (Asm_Output_Constraint ()));
5245 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
5249 Setup_Asm_Inputs (gnat_node);
5250 while (Present (gnat_temp = Asm_Input_Value ()))
5252 tree gnu_value = gnat_to_gnu (gnat_temp);
5253 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5254 (Asm_Input_Constraint ()));
5256 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
5260 Clobber_Setup (gnat_node);
5261 while ((clobber = Clobber_Get_Next ()))
5263 = tree_cons (NULL_TREE,
5264 build_string (strlen (clobber) + 1, clobber),
5267 /* Then perform some standard checking and processing on the
5268 operands. In particular, mark them addressable if needed. */
5269 gnu_outputs = nreverse (gnu_outputs);
5270 noutputs = list_length (gnu_outputs);
5271 gnu_inputs = nreverse (gnu_inputs);
5272 ninputs = list_length (gnu_inputs);
5274 = (const char **) alloca (noutputs * sizeof (const char *));
5276 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
5278 tree output = TREE_VALUE (tail);
5280 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5281 oconstraints[i] = constraint;
5283 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
5284 &allows_mem, &allows_reg, &fake))
5286 /* If the operand is going to end up in memory,
5287 mark it addressable. Note that we don't test
5288 allows_mem like in the input case below; this
5289 is modelled on the C front-end. */
5291 && !gnat_mark_addressable (output))
5292 output = error_mark_node;
5295 output = error_mark_node;
5297 TREE_VALUE (tail) = output;
5300 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5302 tree input = TREE_VALUE (tail);
5304 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5306 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5308 &allows_mem, &allows_reg))
5310 /* If the operand is going to end up in memory,
5311 mark it addressable. */
5312 if (!allows_reg && allows_mem
5313 && !gnat_mark_addressable (input))
5314 input = error_mark_node;
5317 input = error_mark_node;
5319 TREE_VALUE (tail) = input;
5322 gnu_result = build5 (ASM_EXPR, void_type_node,
5323 gnu_template, gnu_outputs,
5324 gnu_inputs, gnu_clobbers, NULL_TREE);
5325 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5328 gnu_result = alloc_stmt_list ();
5336 case N_Freeze_Entity:
5337 start_stmt_group ();
5338 process_freeze_entity (gnat_node);
5339 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5340 gnu_result = end_stmt_group ();
5343 case N_Itype_Reference:
5344 if (!present_gnu_tree (Itype (gnat_node)))
5345 process_type (Itype (gnat_node));
5347 gnu_result = alloc_stmt_list ();
5350 case N_Free_Statement:
5351 if (!type_annotate_only)
5353 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5354 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5356 tree gnu_actual_obj_type = 0;
5359 /* If this is a thin pointer, we must dereference it to create
5360 a fat pointer, then go back below to a thin pointer. The
5361 reason for this is that we need a fat pointer someplace in
5362 order to properly compute the size. */
5363 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5364 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5365 build_unary_op (INDIRECT_REF, NULL_TREE,
5368 /* If this is an unconstrained array, we know the object must
5369 have been allocated with the template in front of the object.
5370 So pass the template address, but get the total size. Do this
5371 by converting to a thin pointer. */
5372 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5374 = convert (build_pointer_type
5375 (TYPE_OBJECT_RECORD_TYPE
5376 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5379 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5381 if (Present (Actual_Designated_Subtype (gnat_node)))
5384 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5386 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5388 = build_unc_object_type_from_ptr (gnu_ptr_type,
5389 gnu_actual_obj_type,
5390 get_identifier ("DEALLOC"),
5394 gnu_actual_obj_type = gnu_obj_type;
5396 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5398 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5399 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5401 tree gnu_char_ptr_type
5402 = build_pointer_type (unsigned_char_type_node);
5403 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5404 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5405 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5410 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
5411 Procedure_To_Call (gnat_node),
5412 Storage_Pool (gnat_node),
5417 case N_Raise_Constraint_Error:
5418 case N_Raise_Program_Error:
5419 case N_Raise_Storage_Error:
5420 if (type_annotate_only)
5422 gnu_result = alloc_stmt_list ();
5426 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5428 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node, kind);
5430 /* If the type is VOID, this is a statement, so we need to
5431 generate the code for the call. Handle a Condition, if there
5433 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5435 set_expr_location_from_node (gnu_result, gnat_node);
5437 if (Present (Condition (gnat_node)))
5438 gnu_result = build3 (COND_EXPR, void_type_node,
5439 gnat_to_gnu (Condition (gnat_node)),
5440 gnu_result, alloc_stmt_list ());
5443 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5446 case N_Validate_Unchecked_Conversion:
5448 Entity_Id gnat_target_type = Target_Type (gnat_node);
5449 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5450 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5452 /* No need for any warning in this case. */
5453 if (!flag_strict_aliasing)
5456 /* If the result is a pointer type, see if we are either converting
5457 from a non-pointer or from a pointer to a type with a different
5458 alias set and warn if so. If the result is defined in the same
5459 unit as this unchecked conversion, we can allow this because we
5460 can know to make the pointer type behave properly. */
5461 else if (POINTER_TYPE_P (gnu_target_type)
5462 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5463 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5465 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5466 ? TREE_TYPE (gnu_source_type)
5468 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5470 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5471 || get_alias_set (gnu_target_desig_type) != 0)
5472 && (!POINTER_TYPE_P (gnu_source_type)
5473 || (TYPE_DUMMY_P (gnu_source_desig_type)
5474 != TYPE_DUMMY_P (gnu_target_desig_type))
5475 || (TYPE_DUMMY_P (gnu_source_desig_type)
5476 && gnu_source_desig_type != gnu_target_desig_type)
5477 || !alias_sets_conflict_p
5478 (get_alias_set (gnu_source_desig_type),
5479 get_alias_set (gnu_target_desig_type))))
5482 ("?possible aliasing problem for type&",
5483 gnat_node, Target_Type (gnat_node));
5485 ("\\?use -fno-strict-aliasing switch for references",
5488 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5489 gnat_node, Target_Type (gnat_node));
5493 /* But if the result is a fat pointer type, we have no mechanism to
5494 do that, so we unconditionally warn in problematic cases. */
5495 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
5497 tree gnu_source_array_type
5498 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
5499 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5501 tree gnu_target_array_type
5502 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5504 if ((TYPE_DUMMY_P (gnu_target_array_type)
5505 || get_alias_set (gnu_target_array_type) != 0)
5506 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
5507 || (TYPE_DUMMY_P (gnu_source_array_type)
5508 != TYPE_DUMMY_P (gnu_target_array_type))
5509 || (TYPE_DUMMY_P (gnu_source_array_type)
5510 && gnu_source_array_type != gnu_target_array_type)
5511 || !alias_sets_conflict_p
5512 (get_alias_set (gnu_source_array_type),
5513 get_alias_set (gnu_target_array_type))))
5516 ("?possible aliasing problem for type&",
5517 gnat_node, Target_Type (gnat_node));
5519 ("\\?use -fno-strict-aliasing switch for references",
5524 gnu_result = alloc_stmt_list ();
5528 /* SCIL nodes require no processing for GCC. Other nodes should only
5529 be present when annotating types. */
5530 gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only);
5531 gnu_result = alloc_stmt_list ();
5534 /* If we pushed the processing of the elaboration routine, pop it back. */
5535 if (went_into_elab_proc)
5536 current_function_decl = NULL_TREE;
5538 /* Set the location information on the result if it is a real expression.
5539 References can be reused for multiple GNAT nodes and they would get
5540 the location information of their last use. Note that we may have
5541 no result if we tried to build a CALL_EXPR node to a procedure with
5542 no side-effects and optimization is enabled. */
5544 && EXPR_P (gnu_result)
5545 && TREE_CODE (gnu_result) != NOP_EXPR
5546 && !REFERENCE_CLASS_P (gnu_result)
5547 && !EXPR_HAS_LOCATION (gnu_result))
5548 set_expr_location_from_node (gnu_result, gnat_node);
5550 /* If we're supposed to return something of void_type, it means we have
5551 something we're elaborating for effect, so just return. */
5552 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5555 /* If the result is a constant that overflowed, raise Constraint_Error. */
5556 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5558 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5560 = build1 (NULL_EXPR, gnu_result_type,
5561 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5562 N_Raise_Constraint_Error));
5565 /* If our result has side-effects and is of an unconstrained type,
5566 make a SAVE_EXPR so that we can be sure it will only be referenced
5567 once. Note we must do this before any conversions. */
5568 if (TREE_SIDE_EFFECTS (gnu_result)
5569 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5570 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5571 gnu_result = gnat_stabilize_reference (gnu_result, false, NULL);
5573 /* Now convert the result to the result type, unless we are in one of the
5576 1. If this is the Name of an assignment statement or a parameter of
5577 a procedure call, return the result almost unmodified since the
5578 RHS will have to be converted to our type in that case, unless
5579 the result type has a simpler size. Likewise if there is just
5580 a no-op unchecked conversion in-between. Similarly, don't convert
5581 integral types that are the operands of an unchecked conversion
5582 since we need to ignore those conversions (for 'Valid).
5584 2. If we have a label (which doesn't have any well-defined type), a
5585 field or an error, return the result almost unmodified. Also don't
5586 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5587 its size since those are the cases where the front end may have the
5588 type wrong due to "instantiating" the unconstrained record with
5589 discriminant values. Similarly, if the two types are record types
5590 with the same name don't convert. This will be the case when we are
5591 converting from a packable version of a type to its original type and
5592 we need those conversions to be NOPs in order for assignments into
5593 these types to work properly.
5595 3. If the type is void or if we have no result, return error_mark_node
5596 to show we have no result.
5598 4. Finally, if the type of the result is already correct. */
5600 if (Present (Parent (gnat_node))
5601 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5602 && Name (Parent (gnat_node)) == gnat_node)
5603 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5604 && unchecked_conversion_nop (Parent (gnat_node)))
5605 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5606 && Name (Parent (gnat_node)) != gnat_node)
5607 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5608 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5609 && !AGGREGATE_TYPE_P (gnu_result_type)
5610 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5611 && !(TYPE_SIZE (gnu_result_type)
5612 && TYPE_SIZE (TREE_TYPE (gnu_result))
5613 && (AGGREGATE_TYPE_P (gnu_result_type)
5614 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5615 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5616 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5618 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5619 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5620 && (CONTAINS_PLACEHOLDER_P
5621 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5622 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5623 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5625 /* Remove padding only if the inner object is of self-referential
5626 size: in that case it must be an object of unconstrained type
5627 with a default discriminant and we want to avoid copying too
5629 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5630 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5631 (TREE_TYPE (gnu_result))))))
5632 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5636 else if (TREE_CODE (gnu_result) == LABEL_DECL
5637 || TREE_CODE (gnu_result) == FIELD_DECL
5638 || TREE_CODE (gnu_result) == ERROR_MARK
5639 || (TYPE_SIZE (gnu_result_type)
5640 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5641 && TREE_CODE (gnu_result) != INDIRECT_REF
5642 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5643 || ((TYPE_NAME (gnu_result_type)
5644 == TYPE_NAME (TREE_TYPE (gnu_result)))
5645 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5646 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5648 /* Remove any padding. */
5649 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5650 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5654 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5655 gnu_result = error_mark_node;
5657 else if (gnu_result_type != TREE_TYPE (gnu_result))
5658 gnu_result = convert (gnu_result_type, gnu_result);
5660 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5661 while ((TREE_CODE (gnu_result) == NOP_EXPR
5662 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5663 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5664 gnu_result = TREE_OPERAND (gnu_result, 0);
5669 /* Subroutine of above to push the exception label stack. GNU_STACK is
5670 a pointer to the stack to update and GNAT_LABEL, if present, is the
5671 label to push onto the stack. */
5674 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5676 tree gnu_label = (Present (gnat_label)
5677 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5680 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5683 /* Record the current code position in GNAT_NODE. */
5686 record_code_position (Node_Id gnat_node)
5688 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5690 add_stmt_with_node (stmt_stmt, gnat_node);
5691 save_gnu_tree (gnat_node, stmt_stmt, true);
5694 /* Insert the code for GNAT_NODE at the position saved for that node. */
5697 insert_code_for (Node_Id gnat_node)
5699 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5700 save_gnu_tree (gnat_node, NULL_TREE, true);
5703 /* Start a new statement group chained to the previous group. */
5706 start_stmt_group (void)
5708 struct stmt_group *group = stmt_group_free_list;
5710 /* First see if we can get one from the free list. */
5712 stmt_group_free_list = group->previous;
5714 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5716 group->previous = current_stmt_group;
5717 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5718 current_stmt_group = group;
5721 /* Add GNU_STMT to the current statement group. */
5724 add_stmt (tree gnu_stmt)
5726 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5729 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5732 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5734 if (Present (gnat_node))
5735 set_expr_location_from_node (gnu_stmt, gnat_node);
5736 add_stmt (gnu_stmt);
5739 /* Add a declaration statement for GNU_DECL to the current statement group.
5740 Get SLOC from Entity_Id. */
5743 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5745 tree type = TREE_TYPE (gnu_decl);
5746 tree gnu_stmt, gnu_init, t;
5748 /* If this is a variable that Gigi is to ignore, we may have been given
5749 an ERROR_MARK. So test for it. We also might have been given a
5750 reference for a renaming. So only do something for a decl. Also
5751 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5752 if (!DECL_P (gnu_decl)
5753 || (TREE_CODE (gnu_decl) == TYPE_DECL
5754 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5757 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5759 /* If we are global, we don't want to actually output the DECL_EXPR for
5760 this decl since we already have evaluated the expressions in the
5761 sizes and positions as globals and doing it again would be wrong. */
5762 if (global_bindings_p ())
5764 /* Mark everything as used to prevent node sharing with subprograms.
5765 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5766 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5767 MARK_VISITED (gnu_stmt);
5768 if (TREE_CODE (gnu_decl) == VAR_DECL
5769 || TREE_CODE (gnu_decl) == CONST_DECL)
5771 MARK_VISITED (DECL_SIZE (gnu_decl));
5772 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
5773 MARK_VISITED (DECL_INITIAL (gnu_decl));
5775 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5776 else if (TREE_CODE (gnu_decl) == TYPE_DECL
5777 && ((TREE_CODE (type) == RECORD_TYPE
5778 && !TYPE_FAT_POINTER_P (type))
5779 || TREE_CODE (type) == UNION_TYPE
5780 || TREE_CODE (type) == QUAL_UNION_TYPE))
5781 MARK_VISITED (TYPE_ADA_SIZE (type));
5784 add_stmt_with_node (gnu_stmt, gnat_entity);
5786 /* If this is a variable and an initializer is attached to it, it must be
5787 valid for the context. Similar to init_const in create_var_decl_1. */
5788 if (TREE_CODE (gnu_decl) == VAR_DECL
5789 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5790 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5791 || (TREE_STATIC (gnu_decl)
5792 && !initializer_constant_valid_p (gnu_init,
5793 TREE_TYPE (gnu_init)))))
5795 /* If GNU_DECL has a padded type, convert it to the unpadded
5796 type so the assignment is done properly. */
5797 if (TYPE_IS_PADDING_P (type))
5798 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5802 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
5804 DECL_INITIAL (gnu_decl) = NULL_TREE;
5805 if (TREE_READONLY (gnu_decl))
5807 TREE_READONLY (gnu_decl) = 0;
5808 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5811 add_stmt_with_node (gnu_stmt, gnat_entity);
5815 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5818 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5822 if (TREE_VISITED (t))
5825 /* Don't mark a dummy type as visited because we want to mark its sizes
5826 and fields once it's filled in. */
5827 else if (!TYPE_IS_DUMMY_P (t))
5828 TREE_VISITED (t) = 1;
5831 TYPE_SIZES_GIMPLIFIED (t) = 1;
5836 /* Mark nodes rooted at T with TREE_VISITED and types as having their
5837 sized gimplified. We use this to indicate all variable sizes and
5838 positions in global types may not be shared by any subprogram. */
5841 mark_visited (tree t)
5843 walk_tree (&t, mark_visited_r, NULL, NULL);
5846 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5849 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5850 void *data ATTRIBUTE_UNUSED)
5854 if (TREE_CODE (t) == SAVE_EXPR)
5855 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5860 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5861 set its location to that of GNAT_NODE if present. */
5864 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5866 if (Present (gnat_node))
5867 set_expr_location_from_node (gnu_cleanup, gnat_node);
5868 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5871 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5874 set_block_for_group (tree gnu_block)
5876 gcc_assert (!current_stmt_group->block);
5877 current_stmt_group->block = gnu_block;
5880 /* Return code corresponding to the current code group. It is normally
5881 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5882 BLOCK or cleanups were set. */
5885 end_stmt_group (void)
5887 struct stmt_group *group = current_stmt_group;
5888 tree gnu_retval = group->stmt_list;
5890 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5891 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5892 make a BIND_EXPR. Note that we nest in that because the cleanup may
5893 reference variables in the block. */
5894 if (gnu_retval == NULL_TREE)
5895 gnu_retval = alloc_stmt_list ();
5897 if (group->cleanups)
5898 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5901 if (current_stmt_group->block)
5902 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5903 gnu_retval, group->block);
5905 /* Remove this group from the stack and add it to the free list. */
5906 current_stmt_group = group->previous;
5907 group->previous = stmt_group_free_list;
5908 stmt_group_free_list = group;
5913 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5917 add_stmt_list (List_Id gnat_list)
5921 if (Present (gnat_list))
5922 for (gnat_node = First (gnat_list); Present (gnat_node);
5923 gnat_node = Next (gnat_node))
5924 add_stmt (gnat_to_gnu (gnat_node));
5927 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5928 If BINDING_P is true, push and pop a binding level around the list. */
5931 build_stmt_group (List_Id gnat_list, bool binding_p)
5933 start_stmt_group ();
5937 add_stmt_list (gnat_list);
5941 return end_stmt_group ();
5944 /* Push and pop routines for stacks. We keep a free list around so we
5945 don't waste tree nodes. */
5948 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5950 tree gnu_node = gnu_stack_free_list;
5954 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5955 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5956 TREE_PURPOSE (gnu_node) = gnu_purpose;
5957 TREE_VALUE (gnu_node) = gnu_value;
5960 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5962 *gnu_stack_ptr = gnu_node;
5966 pop_stack (tree *gnu_stack_ptr)
5968 tree gnu_node = *gnu_stack_ptr;
5970 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5971 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5972 gnu_stack_free_list = gnu_node;
5975 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5978 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5979 gimple_seq *post_p ATTRIBUTE_UNUSED)
5981 tree expr = *expr_p;
5984 if (IS_ADA_STMT (expr))
5985 return gnat_gimplify_stmt (expr_p);
5987 switch (TREE_CODE (expr))
5990 /* If this is for a scalar, just make a VAR_DECL for it. If for
5991 an aggregate, get a null pointer of the appropriate type and
5993 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5994 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5995 convert (build_pointer_type (TREE_TYPE (expr)),
5996 integer_zero_node));
5999 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
6000 TREE_NO_WARNING (*expr_p) = 1;
6003 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
6006 case UNCONSTRAINED_ARRAY_REF:
6007 /* We should only do this if we are just elaborating for side-effects,
6008 but we can't know that yet. */
6009 *expr_p = TREE_OPERAND (*expr_p, 0);
6013 op = TREE_OPERAND (expr, 0);
6015 if (TREE_CODE (op) == CONSTRUCTOR)
6017 /* If we are taking the address of a constant CONSTRUCTOR, make sure
6018 it is put into static memory. We know it's going to be read-only
6019 given the semantics we have and it must be in static memory when
6020 the reference is in an elaboration procedure. */
6021 if (TREE_CONSTANT (op))
6023 tree new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
6024 TREE_ADDRESSABLE (new_var) = 1;
6025 gimple_add_tmp_var (new_var);
6027 TREE_READONLY (new_var) = 1;
6028 TREE_STATIC (new_var) = 1;
6029 DECL_INITIAL (new_var) = op;
6031 TREE_OPERAND (expr, 0) = new_var;
6032 recompute_tree_invariant_for_addr_expr (expr);
6035 /* Otherwise explicitly create the local temporary. That's required
6036 if the type is passed by reference. */
6039 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
6040 TREE_ADDRESSABLE (new_var) = 1;
6041 gimple_add_tmp_var (new_var);
6043 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
6044 gimplify_and_add (mod, pre_p);
6046 TREE_OPERAND (expr, 0) = new_var;
6047 recompute_tree_invariant_for_addr_expr (expr);
6053 return GS_UNHANDLED;
6056 op = DECL_EXPR_DECL (expr);
6058 /* The expressions for the RM bounds must be gimplified to ensure that
6059 they are properly elaborated. See gimplify_decl_expr. */
6060 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
6061 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
6062 switch (TREE_CODE (TREE_TYPE (op)))
6069 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
6071 val = TYPE_RM_MIN_VALUE (type);
6074 gimplify_one_sizepos (&val, pre_p);
6075 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
6076 SET_TYPE_RM_MIN_VALUE (t, val);
6079 val = TYPE_RM_MAX_VALUE (type);
6082 gimplify_one_sizepos (&val, pre_p);
6083 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
6084 SET_TYPE_RM_MAX_VALUE (t, val);
6094 /* ... fall through ... */
6097 return GS_UNHANDLED;
6101 /* Generate GIMPLE in place for the statement at *STMT_P. */
6103 static enum gimplify_status
6104 gnat_gimplify_stmt (tree *stmt_p)
6106 tree stmt = *stmt_p;
6108 switch (TREE_CODE (stmt))
6111 *stmt_p = STMT_STMT_STMT (stmt);
6116 tree gnu_start_label = create_artificial_label (input_location);
6117 tree gnu_cond = LOOP_STMT_COND (stmt);
6118 tree gnu_update = LOOP_STMT_UPDATE (stmt);
6119 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
6122 /* Build the condition expression from the test, if any. */
6125 = build3 (COND_EXPR, void_type_node, gnu_cond, alloc_stmt_list (),
6126 build1 (GOTO_EXPR, void_type_node, gnu_end_label));
6128 /* Set to emit the statements of the loop. */
6129 *stmt_p = NULL_TREE;
6131 /* We first emit the start label and then a conditional jump to the
6132 end label if there's a top condition, then the update if it's at
6133 the top, then the body of the loop, then a conditional jump to
6134 the end label if there's a bottom condition, then the update if
6135 it's at the bottom, and finally a jump to the start label and the
6136 definition of the end label. */
6137 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6141 if (gnu_cond && !LOOP_STMT_BOTTOM_COND_P (stmt))
6142 append_to_statement_list (gnu_cond, stmt_p);
6144 if (gnu_update && LOOP_STMT_TOP_UPDATE_P (stmt))
6145 append_to_statement_list (gnu_update, stmt_p);
6147 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
6149 if (gnu_cond && LOOP_STMT_BOTTOM_COND_P (stmt))
6150 append_to_statement_list (gnu_cond, stmt_p);
6152 if (gnu_update && !LOOP_STMT_TOP_UPDATE_P (stmt))
6153 append_to_statement_list (gnu_update, stmt_p);
6155 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
6156 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
6157 append_to_statement_list (t, stmt_p);
6159 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6166 /* Build a statement to jump to the corresponding end label, then
6167 see if it needs to be conditional. */
6168 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
6169 if (EXIT_STMT_COND (stmt))
6170 *stmt_p = build3 (COND_EXPR, void_type_node,
6171 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
6179 /* Force references to each of the entities in packages withed by GNAT_NODE.
6180 Operate recursively but check that we aren't elaborating something more
6183 This routine is exclusively called in type_annotate mode, to compute DDA
6184 information for types in withed units, for ASIS use. */
6187 elaborate_all_entities (Node_Id gnat_node)
6189 Entity_Id gnat_with_clause, gnat_entity;
6191 /* Process each unit only once. As we trace the context of all relevant
6192 units transitively, including generic bodies, we may encounter the
6193 same generic unit repeatedly. */
6194 if (!present_gnu_tree (gnat_node))
6195 save_gnu_tree (gnat_node, integer_zero_node, true);
6197 /* Save entities in all context units. A body may have an implicit_with
6198 on its own spec, if the context includes a child unit, so don't save
6200 for (gnat_with_clause = First (Context_Items (gnat_node));
6201 Present (gnat_with_clause);
6202 gnat_with_clause = Next (gnat_with_clause))
6203 if (Nkind (gnat_with_clause) == N_With_Clause
6204 && !present_gnu_tree (Library_Unit (gnat_with_clause))
6205 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
6207 elaborate_all_entities (Library_Unit (gnat_with_clause));
6209 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
6211 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
6212 Present (gnat_entity);
6213 gnat_entity = Next_Entity (gnat_entity))
6214 if (Is_Public (gnat_entity)
6215 && Convention (gnat_entity) != Convention_Intrinsic
6216 && Ekind (gnat_entity) != E_Package
6217 && Ekind (gnat_entity) != E_Package_Body
6218 && Ekind (gnat_entity) != E_Operator
6219 && !(IN (Ekind (gnat_entity), Type_Kind)
6220 && !Is_Frozen (gnat_entity))
6221 && !((Ekind (gnat_entity) == E_Procedure
6222 || Ekind (gnat_entity) == E_Function)
6223 && Is_Intrinsic_Subprogram (gnat_entity))
6224 && !IN (Ekind (gnat_entity), Named_Kind)
6225 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
6226 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6228 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
6231 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
6233 /* Retrieve compilation unit node of generic body. */
6234 while (Present (gnat_body)
6235 && Nkind (gnat_body) != N_Compilation_Unit)
6236 gnat_body = Parent (gnat_body);
6238 /* If body is available, elaborate its context. */
6239 if (Present (gnat_body))
6240 elaborate_all_entities (gnat_body);
6244 if (Nkind (Unit (gnat_node)) == N_Package_Body)
6245 elaborate_all_entities (Library_Unit (gnat_node));
6248 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
6251 process_freeze_entity (Node_Id gnat_node)
6253 const Entity_Id gnat_entity = Entity (gnat_node);
6254 const Entity_Kind kind = Ekind (gnat_entity);
6255 tree gnu_old, gnu_new;
6257 /* If this is a package, we need to generate code for the package. */
6258 if (kind == E_Package)
6261 (Parent (Corresponding_Body
6262 (Parent (Declaration_Node (gnat_entity)))));
6266 /* Don't do anything for class-wide types as they are always transformed
6267 into their root type. */
6268 if (kind == E_Class_Wide_Type)
6271 /* Check for an old definition. This freeze node might be for an Itype. */
6273 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE;
6275 /* If this entity has an address representation clause, GNU_OLD is the
6276 address, so discard it here. */
6277 if (Present (Address_Clause (gnat_entity)))
6278 gnu_old = NULL_TREE;
6280 /* Don't do anything for subprograms that may have been elaborated before
6281 their freeze nodes. This can happen, for example, because of an inner
6282 call in an instance body or because of previous compilation of a spec
6283 for inlining purposes. */
6285 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6286 && (kind == E_Function || kind == E_Procedure))
6287 || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6288 && kind == E_Subprogram_Type)))
6291 /* If we have a non-dummy type old tree, we have nothing to do, except
6292 aborting if this is the public view of a private type whose full view was
6293 not delayed, as this node was never delayed as it should have been. We
6294 let this happen for concurrent types and their Corresponding_Record_Type,
6295 however, because each might legitimately be elaborated before its own
6296 freeze node, e.g. while processing the other. */
6298 && !(TREE_CODE (gnu_old) == TYPE_DECL
6299 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6301 gcc_assert ((IN (kind, Incomplete_Or_Private_Kind)
6302 && Present (Full_View (gnat_entity))
6303 && No (Freeze_Node (Full_View (gnat_entity))))
6304 || Is_Concurrent_Type (gnat_entity)
6305 || (IN (kind, Record_Kind)
6306 && Is_Concurrent_Record_Type (gnat_entity)));
6310 /* Reset the saved tree, if any, and elaborate the object or type for real.
6311 If there is a full view, elaborate it and use the result. And, if this
6312 is the root type of a class-wide type, reuse it for the latter. */
6315 save_gnu_tree (gnat_entity, NULL_TREE, false);
6316 if (IN (kind, Incomplete_Or_Private_Kind)
6317 && Present (Full_View (gnat_entity))
6318 && present_gnu_tree (Full_View (gnat_entity)))
6319 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6320 if (IN (kind, Type_Kind)
6321 && Present (Class_Wide_Type (gnat_entity))
6322 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6323 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6326 if (IN (kind, Incomplete_Or_Private_Kind)
6327 && Present (Full_View (gnat_entity)))
6329 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6331 /* Propagate back-annotations from full view to partial view. */
6332 if (Unknown_Alignment (gnat_entity))
6333 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6335 if (Unknown_Esize (gnat_entity))
6336 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6338 if (Unknown_RM_Size (gnat_entity))
6339 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6341 /* The above call may have defined this entity (the simplest example
6342 of this is when we have a private enumeral type since the bounds
6343 will have the public view). */
6344 if (!present_gnu_tree (gnat_entity))
6345 save_gnu_tree (gnat_entity, gnu_new, false);
6350 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6351 && present_gnu_tree (Declaration_Node (gnat_entity)))
6352 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6354 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6357 if (IN (kind, Type_Kind)
6358 && Present (Class_Wide_Type (gnat_entity))
6359 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6360 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6362 /* If we've made any pointers to the old version of this type, we
6363 have to update them. */
6365 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6366 TREE_TYPE (gnu_new));
6369 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6370 We make two passes, one to elaborate anything other than bodies (but
6371 we declare a function if there was no spec). The second pass
6372 elaborates the bodies.
6374 GNAT_END_LIST gives the element in the list past the end. Normally,
6375 this is Empty, but can be First_Real_Statement for a
6376 Handled_Sequence_Of_Statements.
6378 We make a complete pass through both lists if PASS1P is true, then make
6379 the second pass over both lists if PASS2P is true. The lists usually
6380 correspond to the public and private parts of a package. */
6383 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6384 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6386 List_Id gnat_decl_array[2];
6390 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6393 for (i = 0; i <= 1; i++)
6394 if (Present (gnat_decl_array[i]))
6395 for (gnat_decl = First (gnat_decl_array[i]);
6396 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6398 /* For package specs, we recurse inside the declarations,
6399 thus taking the two pass approach inside the boundary. */
6400 if (Nkind (gnat_decl) == N_Package_Declaration
6401 && (Nkind (Specification (gnat_decl)
6402 == N_Package_Specification)))
6403 process_decls (Visible_Declarations (Specification (gnat_decl)),
6404 Private_Declarations (Specification (gnat_decl)),
6405 Empty, true, false);
6407 /* Similarly for any declarations in the actions of a
6409 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6411 process_freeze_entity (gnat_decl);
6412 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6415 /* Package bodies with freeze nodes get their elaboration deferred
6416 until the freeze node, but the code must be placed in the right
6417 place, so record the code position now. */
6418 else if (Nkind (gnat_decl) == N_Package_Body
6419 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6420 record_code_position (gnat_decl);
6422 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6423 && Present (Library_Unit (gnat_decl))
6424 && Present (Freeze_Node
6427 (Library_Unit (gnat_decl)))))))
6428 record_code_position
6429 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6431 /* We defer most subprogram bodies to the second pass. */
6432 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6434 if (Acts_As_Spec (gnat_decl))
6436 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6438 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6439 && Ekind (gnat_subprog_id) != E_Generic_Function)
6440 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6444 /* For bodies and stubs that act as their own specs, the entity
6445 itself must be elaborated in the first pass, because it may
6446 be used in other declarations. */
6447 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6449 Node_Id gnat_subprog_id
6450 = Defining_Entity (Specification (gnat_decl));
6452 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6453 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6454 && Ekind (gnat_subprog_id) != E_Generic_Function)
6455 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6458 /* Concurrent stubs stand for the corresponding subprogram bodies,
6459 which are deferred like other bodies. */
6460 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6461 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6465 add_stmt (gnat_to_gnu (gnat_decl));
6468 /* Here we elaborate everything we deferred above except for package bodies,
6469 which are elaborated at their freeze nodes. Note that we must also
6470 go inside things (package specs and freeze nodes) the first pass did. */
6472 for (i = 0; i <= 1; i++)
6473 if (Present (gnat_decl_array[i]))
6474 for (gnat_decl = First (gnat_decl_array[i]);
6475 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6477 if (Nkind (gnat_decl) == N_Subprogram_Body
6478 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6479 || Nkind (gnat_decl) == N_Task_Body_Stub
6480 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6481 add_stmt (gnat_to_gnu (gnat_decl));
6483 else if (Nkind (gnat_decl) == N_Package_Declaration
6484 && (Nkind (Specification (gnat_decl)
6485 == N_Package_Specification)))
6486 process_decls (Visible_Declarations (Specification (gnat_decl)),
6487 Private_Declarations (Specification (gnat_decl)),
6488 Empty, false, true);
6490 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6491 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6495 /* Make a unary operation of kind CODE using build_unary_op, but guard
6496 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6497 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6498 the operation is to be performed in that type. GNAT_NODE is the gnat
6499 node conveying the source location for which the error should be
6503 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6506 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6508 operand = gnat_protect_expr (operand);
6510 return emit_check (build_binary_op (EQ_EXPR, boolean_type_node,
6511 operand, TYPE_MIN_VALUE (gnu_type)),
6512 build_unary_op (code, gnu_type, operand),
6513 CE_Overflow_Check_Failed, gnat_node);
6516 /* Make a binary operation of kind CODE using build_binary_op, but guard
6517 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6518 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6519 Usually the operation is to be performed in that type. GNAT_NODE is
6520 the GNAT node conveying the source location for which the error should
6524 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6525 tree right, Node_Id gnat_node)
6527 tree lhs = gnat_protect_expr (left);
6528 tree rhs = gnat_protect_expr (right);
6529 tree type_max = TYPE_MAX_VALUE (gnu_type);
6530 tree type_min = TYPE_MIN_VALUE (gnu_type);
6533 tree zero = convert (gnu_type, integer_zero_node);
6538 int precision = TYPE_PRECISION (gnu_type);
6540 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6542 /* Prefer a constant or known-positive rhs to simplify checks. */
6543 if (!TREE_CONSTANT (rhs)
6544 && commutative_tree_code (code)
6545 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6546 && tree_expr_nonnegative_p (lhs))))
6553 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6554 ? boolean_false_node
6555 : build_binary_op (LT_EXPR, boolean_type_node, rhs, zero);
6557 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6559 /* Try a few strategies that may be cheaper than the general
6560 code at the end of the function, if the rhs is not known.
6562 - Call library function for 64-bit multiplication (complex)
6563 - Widen, if input arguments are sufficiently small
6564 - Determine overflow using wrapped result for addition/subtraction. */
6566 if (!TREE_CONSTANT (rhs))
6568 /* Even for add/subtract double size to get another base type. */
6569 int needed_precision = precision * 2;
6571 if (code == MULT_EXPR && precision == 64)
6573 tree int_64 = gnat_type_for_size (64, 0);
6575 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6576 convert (int_64, lhs),
6577 convert (int_64, rhs)));
6580 else if (needed_precision <= BITS_PER_WORD
6581 || (code == MULT_EXPR
6582 && needed_precision <= LONG_LONG_TYPE_SIZE))
6584 tree wide_type = gnat_type_for_size (needed_precision, 0);
6586 tree wide_result = build_binary_op (code, wide_type,
6587 convert (wide_type, lhs),
6588 convert (wide_type, rhs));
6590 tree check = build_binary_op
6591 (TRUTH_ORIF_EXPR, boolean_type_node,
6592 build_binary_op (LT_EXPR, boolean_type_node, wide_result,
6593 convert (wide_type, type_min)),
6594 build_binary_op (GT_EXPR, boolean_type_node, wide_result,
6595 convert (wide_type, type_max)));
6597 tree result = convert (gnu_type, wide_result);
6600 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6603 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6605 tree unsigned_type = gnat_type_for_size (precision, 1);
6606 tree wrapped_expr = convert
6607 (gnu_type, build_binary_op (code, unsigned_type,
6608 convert (unsigned_type, lhs),
6609 convert (unsigned_type, rhs)));
6611 tree result = convert
6612 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6614 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6615 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6616 tree check = build_binary_op
6617 (TRUTH_XOR_EXPR, boolean_type_node, rhs_lt_zero,
6618 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6619 boolean_type_node, wrapped_expr, lhs));
6622 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6629 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6630 check_pos = build_binary_op (GT_EXPR, boolean_type_node, lhs,
6631 build_binary_op (MINUS_EXPR, gnu_type,
6634 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6635 check_neg = build_binary_op (LT_EXPR, boolean_type_node, lhs,
6636 build_binary_op (MINUS_EXPR, gnu_type,
6641 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6642 check_pos = build_binary_op (LT_EXPR, boolean_type_node, lhs,
6643 build_binary_op (PLUS_EXPR, gnu_type,
6646 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6647 check_neg = build_binary_op (GT_EXPR, boolean_type_node, lhs,
6648 build_binary_op (PLUS_EXPR, gnu_type,
6653 /* The check here is designed to be efficient if the rhs is constant,
6654 but it will work for any rhs by using integer division.
6655 Four different check expressions determine wether X * C overflows,
6658 C > 0 => X > type_max / C || X < type_min / C
6659 C == -1 => X == type_min
6660 C < -1 => X > type_min / C || X < type_max / C */
6662 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6663 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6666 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
6667 build_binary_op (NE_EXPR, boolean_type_node, zero,
6669 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6670 build_binary_op (GT_EXPR,
6673 build_binary_op (LT_EXPR,
6678 = fold_build3 (COND_EXPR, boolean_type_node,
6679 build_binary_op (EQ_EXPR, boolean_type_node, rhs,
6680 build_int_cst (gnu_type, -1)),
6681 build_binary_op (EQ_EXPR, boolean_type_node, lhs,
6683 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6684 build_binary_op (GT_EXPR,
6687 build_binary_op (LT_EXPR,
6696 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6698 /* If we can fold the expression to a constant, just return it.
6699 The caller will deal with overflow, no need to generate a check. */
6700 if (TREE_CONSTANT (gnu_expr))
6703 check = fold_build3 (COND_EXPR, boolean_type_node, rhs_lt_zero, check_neg,
6706 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6709 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6710 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6711 which we have to check. GNAT_NODE is the GNAT node conveying the source
6712 location for which the error should be signaled. */
6715 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6717 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6718 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6719 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6720 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6722 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6723 This can for example happen when translating 'Val or 'Value. */
6724 if (gnu_compare_type == gnu_range_type)
6727 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6728 we can't do anything since we might be truncating the bounds. No
6729 check is needed in this case. */
6730 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6731 && (TYPE_PRECISION (gnu_compare_type)
6732 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6735 /* Checked expressions must be evaluated only once. */
6736 gnu_expr = gnat_protect_expr (gnu_expr);
6738 /* Note that the form of the check is
6739 (not (expr >= lo)) or (not (expr <= hi))
6740 the reason for this slightly convoluted form is that NaNs
6741 are not considered to be in range in the float case. */
6743 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6745 (build_binary_op (GE_EXPR, boolean_type_node,
6746 convert (gnu_compare_type, gnu_expr),
6747 convert (gnu_compare_type, gnu_low))),
6749 (build_binary_op (LE_EXPR, boolean_type_node,
6750 convert (gnu_compare_type, gnu_expr),
6751 convert (gnu_compare_type,
6753 gnu_expr, CE_Range_Check_Failed, gnat_node);
6756 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6757 we are about to index, GNU_EXPR is the index expression to be checked,
6758 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6759 has to be checked. Note that for index checking we cannot simply use the
6760 emit_range_check function (although very similar code needs to be generated
6761 in both cases) since for index checking the array type against which we are
6762 checking the indices may be unconstrained and consequently we need to get
6763 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6764 The place where we need to do that is in subprograms having unconstrained
6765 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6766 location for which the error should be signaled. */
6769 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6770 tree gnu_high, Node_Id gnat_node)
6772 tree gnu_expr_check;
6774 /* Checked expressions must be evaluated only once. */
6775 gnu_expr = gnat_protect_expr (gnu_expr);
6777 /* Must do this computation in the base type in case the expression's
6778 type is an unsigned subtypes. */
6779 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6781 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6782 the object we are handling. */
6783 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6784 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6787 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6788 build_binary_op (LT_EXPR, boolean_type_node,
6790 convert (TREE_TYPE (gnu_expr_check),
6792 build_binary_op (GT_EXPR, boolean_type_node,
6794 convert (TREE_TYPE (gnu_expr_check),
6796 gnu_expr, CE_Index_Check_Failed, gnat_node);
6799 /* GNU_COND contains the condition corresponding to an access, discriminant or
6800 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6801 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6802 REASON is the code that says why the exception was raised. GNAT_NODE is
6803 the GNAT node conveying the source location for which the error should be
6807 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6810 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6812 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6813 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6814 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6817 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6818 we don't need to evaluate it just for the check. */
6819 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6824 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6825 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6826 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6827 float to integer conversion with truncation; otherwise round.
6828 GNAT_NODE is the GNAT node conveying the source location for which the
6829 error should be signaled. */
6832 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6833 bool rangep, bool truncatep, Node_Id gnat_node)
6835 tree gnu_type = get_unpadded_type (gnat_type);
6836 tree gnu_in_type = TREE_TYPE (gnu_expr);
6837 tree gnu_in_basetype = get_base_type (gnu_in_type);
6838 tree gnu_base_type = get_base_type (gnu_type);
6839 tree gnu_result = gnu_expr;
6841 /* If we are not doing any checks, the output is an integral type, and
6842 the input is not a floating type, just do the conversion. This
6843 shortcut is required to avoid problems with packed array types
6844 and simplifies code in all cases anyway. */
6845 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6846 && !FLOAT_TYPE_P (gnu_in_type))
6847 return convert (gnu_type, gnu_expr);
6849 /* First convert the expression to its base type. This
6850 will never generate code, but makes the tests below much simpler.
6851 But don't do this if converting from an integer type to an unconstrained
6852 array type since then we need to get the bounds from the original
6854 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6855 gnu_result = convert (gnu_in_basetype, gnu_result);
6857 /* If overflow checks are requested, we need to be sure the result will
6858 fit in the output base type. But don't do this if the input
6859 is integer and the output floating-point. */
6861 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6863 /* Ensure GNU_EXPR only gets evaluated once. */
6864 tree gnu_input = gnat_protect_expr (gnu_result);
6865 tree gnu_cond = integer_zero_node;
6866 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6867 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6868 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6869 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6871 /* Convert the lower bounds to signed types, so we're sure we're
6872 comparing them properly. Likewise, convert the upper bounds
6873 to unsigned types. */
6874 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6875 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6877 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6878 && !TYPE_UNSIGNED (gnu_in_basetype))
6879 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6881 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6882 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6884 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6885 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6887 /* Check each bound separately and only if the result bound
6888 is tighter than the bound on the input type. Note that all the
6889 types are base types, so the bounds must be constant. Also,
6890 the comparison is done in the base type of the input, which
6891 always has the proper signedness. First check for input
6892 integer (which means output integer), output float (which means
6893 both float), or mixed, in which case we always compare.
6894 Note that we have to do the comparison which would *fail* in the
6895 case of an error since if it's an FP comparison and one of the
6896 values is a NaN or Inf, the comparison will fail. */
6897 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6898 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6899 : (FLOAT_TYPE_P (gnu_base_type)
6900 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6901 TREE_REAL_CST (gnu_out_lb))
6905 (build_binary_op (GE_EXPR, boolean_type_node,
6906 gnu_input, convert (gnu_in_basetype,
6909 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6910 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6911 : (FLOAT_TYPE_P (gnu_base_type)
6912 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6913 TREE_REAL_CST (gnu_in_lb))
6916 = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node, gnu_cond,
6918 (build_binary_op (LE_EXPR, boolean_type_node,
6920 convert (gnu_in_basetype,
6923 if (!integer_zerop (gnu_cond))
6924 gnu_result = emit_check (gnu_cond, gnu_input,
6925 CE_Overflow_Check_Failed, gnat_node);
6928 /* Now convert to the result base type. If this is a non-truncating
6929 float-to-integer conversion, round. */
6930 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6933 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6934 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
6935 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6936 const struct real_format *fmt;
6938 /* The following calculations depend on proper rounding to even
6939 of each arithmetic operation. In order to prevent excess
6940 precision from spoiling this property, use the widest hardware
6941 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6943 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6945 /* FIXME: Should not have padding in the first place. */
6946 if (TYPE_IS_PADDING_P (calc_type))
6947 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6949 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6950 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6951 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6952 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6953 half_minus_pred_half);
6954 gnu_pred_half = build_real (calc_type, pred_half);
6956 /* If the input is strictly negative, subtract this value
6957 and otherwise add it from the input. For 0.5, the result
6958 is exactly between 1.0 and the machine number preceding 1.0
6959 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6960 will round to 1.0, while all other number with an absolute
6961 value less than 0.5 round to 0.0. For larger numbers exactly
6962 halfway between integers, rounding will always be correct as
6963 the true mathematical result will be closer to the higher
6964 integer compared to the lower one. So, this constant works
6965 for all floating-point numbers.
6967 The reason to use the same constant with subtract/add instead
6968 of a positive and negative constant is to allow the comparison
6969 to be scheduled in parallel with retrieval of the constant and
6970 conversion of the input to the calc_type (if necessary). */
6972 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6973 gnu_result = gnat_protect_expr (gnu_result);
6974 gnu_conv = convert (calc_type, gnu_result);
6976 = fold_build2 (GE_EXPR, integer_type_node, gnu_result, gnu_zero);
6978 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6979 gnu_subtract_pred_half
6980 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6981 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
6982 gnu_add_pred_half, gnu_subtract_pred_half);
6985 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6986 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6987 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6988 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6990 gnu_result = convert (gnu_base_type, gnu_result);
6992 /* Finally, do the range check if requested. Note that if the result type
6993 is a modular type, the range check is actually an overflow check. */
6995 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6996 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6997 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6999 return convert (gnu_type, gnu_result);
7002 /* Return true if TYPE is a smaller form of ORIG_TYPE. */
7005 smaller_form_type_p (tree type, tree orig_type)
7009 /* We're not interested in variants here. */
7010 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (orig_type))
7013 /* Like a variant, a packable version keeps the original TYPE_NAME. */
7014 if (TYPE_NAME (type) != TYPE_NAME (orig_type))
7017 size = TYPE_SIZE (type);
7018 osize = TYPE_SIZE (orig_type);
7020 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (osize) == INTEGER_CST))
7023 return tree_int_cst_lt (size, osize) != 0;
7026 /* Return true if GNU_EXPR can be directly addressed. This is the case
7027 unless it is an expression involving computation or if it involves a
7028 reference to a bitfield or to an object not sufficiently aligned for
7029 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
7030 be directly addressed as an object of this type.
7032 *** Notes on addressability issues in the Ada compiler ***
7034 This predicate is necessary in order to bridge the gap between Gigi
7035 and the middle-end about addressability of GENERIC trees. A tree
7036 is said to be addressable if it can be directly addressed, i.e. if
7037 its address can be taken, is a multiple of the type's alignment on
7038 strict-alignment architectures and returns the first storage unit
7039 assigned to the object represented by the tree.
7041 In the C family of languages, everything is in practice addressable
7042 at the language level, except for bit-fields. This means that these
7043 compilers will take the address of any tree that doesn't represent
7044 a bit-field reference and expect the result to be the first storage
7045 unit assigned to the object. Even in cases where this will result
7046 in unaligned accesses at run time, nothing is supposed to be done
7047 and the program is considered as erroneous instead (see PR c/18287).
7049 The implicit assumptions made in the middle-end are in keeping with
7050 the C viewpoint described above:
7051 - the address of a bit-field reference is supposed to be never
7052 taken; the compiler (generally) will stop on such a construct,
7053 - any other tree is addressable if it is formally addressable,
7054 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
7056 In Ada, the viewpoint is the opposite one: nothing is addressable
7057 at the language level unless explicitly declared so. This means
7058 that the compiler will both make sure that the trees representing
7059 references to addressable ("aliased" in Ada parlance) objects are
7060 addressable and make no real attempts at ensuring that the trees
7061 representing references to non-addressable objects are addressable.
7063 In the first case, Ada is effectively equivalent to C and handing
7064 down the direct result of applying ADDR_EXPR to these trees to the
7065 middle-end works flawlessly. In the second case, Ada cannot afford
7066 to consider the program as erroneous if the address of trees that
7067 are not addressable is requested for technical reasons, unlike C;
7068 as a consequence, the Ada compiler must arrange for either making
7069 sure that this address is not requested in the middle-end or for
7070 compensating by inserting temporaries if it is requested in Gigi.
7072 The first goal can be achieved because the middle-end should not
7073 request the address of non-addressable trees on its own; the only
7074 exception is for the invocation of low-level block operations like
7075 memcpy, for which the addressability requirements are lower since
7076 the type's alignment can be disregarded. In practice, this means
7077 that Gigi must make sure that such operations cannot be applied to
7078 non-BLKmode bit-fields.
7080 The second goal is achieved by means of the addressable_p predicate
7081 and by inserting SAVE_EXPRs around trees deemed non-addressable.
7082 They will be turned during gimplification into proper temporaries
7083 whose address will be used in lieu of that of the original tree. */
7086 addressable_p (tree gnu_expr, tree gnu_type)
7088 /* For an integral type, the size of the actual type of the object may not
7089 be greater than that of the expected type, otherwise an indirect access
7090 in the latter type wouldn't correctly set all the bits of the object. */
7092 && INTEGRAL_TYPE_P (gnu_type)
7093 && smaller_form_type_p (gnu_type, TREE_TYPE (gnu_expr)))
7096 /* The size of the actual type of the object may not be smaller than that
7097 of the expected type, otherwise an indirect access in the latter type
7098 would be larger than the object. But only record types need to be
7099 considered in practice for this case. */
7101 && TREE_CODE (gnu_type) == RECORD_TYPE
7102 && smaller_form_type_p (TREE_TYPE (gnu_expr), gnu_type))
7105 switch (TREE_CODE (gnu_expr))
7111 /* All DECLs are addressable: if they are in a register, we can force
7115 case UNCONSTRAINED_ARRAY_REF:
7117 /* Taking the address of a dereference yields the original pointer. */
7122 /* Taking the address yields a pointer to the constant pool. */
7126 /* Taking the address of a static constructor yields a pointer to the
7127 tree constant pool. */
7128 return TREE_STATIC (gnu_expr) ? true : false;
7139 /* All rvalues are deemed addressable since taking their address will
7140 force a temporary to be created by the middle-end. */
7144 /* The address of a compound expression is that of its 2nd operand. */
7145 return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type);
7148 /* We accept &COND_EXPR as soon as both operands are addressable and
7149 expect the outcome to be the address of the selected operand. */
7150 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
7151 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
7154 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
7155 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
7156 the field is sufficiently aligned, in case it is subject
7157 to a pragma Component_Alignment. But we don't need to
7158 check the alignment of the containing record, as it is
7159 guaranteed to be not smaller than that of its most
7160 aligned field that is not a bit-field. */
7161 && (!STRICT_ALIGNMENT
7162 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
7163 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
7164 /* The field of a padding record is always addressable. */
7165 || TYPE_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
7166 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7168 case ARRAY_REF: case ARRAY_RANGE_REF:
7169 case REALPART_EXPR: case IMAGPART_EXPR:
7171 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
7174 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
7175 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7177 case VIEW_CONVERT_EXPR:
7179 /* This is addressable if we can avoid a copy. */
7180 tree type = TREE_TYPE (gnu_expr);
7181 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
7182 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
7183 && (!STRICT_ALIGNMENT
7184 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7185 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
7186 || ((TYPE_MODE (type) == BLKmode
7187 || TYPE_MODE (inner_type) == BLKmode)
7188 && (!STRICT_ALIGNMENT
7189 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7190 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
7191 || TYPE_ALIGN_OK (type)
7192 || TYPE_ALIGN_OK (inner_type))))
7193 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7201 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
7202 a separate Freeze node exists, delay the bulk of the processing. Otherwise
7203 make a GCC type for GNAT_ENTITY and set up the correspondence. */
7206 process_type (Entity_Id gnat_entity)
7209 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
7212 /* If we are to delay elaboration of this type, just do any
7213 elaborations needed for expressions within the declaration and
7214 make a dummy type entry for this node and its Full_View (if
7215 any) in case something points to it. Don't do this if it
7216 has already been done (the only way that can happen is if
7217 the private completion is also delayed). */
7218 if (Present (Freeze_Node (gnat_entity))
7219 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7220 && Present (Full_View (gnat_entity))
7221 && Freeze_Node (Full_View (gnat_entity))
7222 && !present_gnu_tree (Full_View (gnat_entity))))
7224 elaborate_entity (gnat_entity);
7228 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
7229 save_gnu_tree (gnat_entity, gnu_decl, false);
7230 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7231 && Present (Full_View (gnat_entity)))
7232 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
7238 /* If we saved away a dummy type for this node it means that this
7239 made the type that corresponds to the full type of an incomplete
7240 type. Clear that type for now and then update the type in the
7244 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
7245 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
7247 save_gnu_tree (gnat_entity, NULL_TREE, false);
7250 /* Now fully elaborate the type. */
7251 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7252 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7254 /* If we have an old type and we've made pointers to this type,
7255 update those pointers. */
7257 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7258 TREE_TYPE (gnu_new));
7260 /* If this is a record type corresponding to a task or protected type
7261 that is a completion of an incomplete type, perform a similar update
7262 on the type. ??? Including protected types here is a guess. */
7263 if (IN (Ekind (gnat_entity), Record_Kind)
7264 && Is_Concurrent_Record_Type (gnat_entity)
7265 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7268 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7270 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7272 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7275 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7276 TREE_TYPE (gnu_new));
7280 /* GNAT_ENTITY is the type of the resulting constructors,
7281 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7282 and GNU_TYPE is the GCC type of the corresponding record.
7284 Return a CONSTRUCTOR to build the record. */
7287 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7289 tree gnu_list, gnu_result;
7291 /* We test for GNU_FIELD being empty in the case where a variant
7292 was the last thing since we don't take things off GNAT_ASSOC in
7293 that case. We check GNAT_ASSOC in case we have a variant, but it
7296 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7297 gnat_assoc = Next (gnat_assoc))
7299 Node_Id gnat_field = First (Choices (gnat_assoc));
7300 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7301 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7303 /* The expander is supposed to put a single component selector name
7304 in every record component association. */
7305 gcc_assert (No (Next (gnat_field)));
7307 /* Ignore fields that have Corresponding_Discriminants since we'll
7308 be setting that field in the parent. */
7309 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7310 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7313 /* Also ignore discriminants of Unchecked_Unions. */
7314 else if (Is_Unchecked_Union (gnat_entity)
7315 && Ekind (Entity (gnat_field)) == E_Discriminant)
7318 /* Before assigning a value in an aggregate make sure range checks
7319 are done if required. Then convert to the type of the field. */
7320 if (Do_Range_Check (Expression (gnat_assoc)))
7321 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7323 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7325 /* Add the field and expression to the list. */
7326 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7329 gnu_result = extract_values (gnu_list, gnu_type);
7331 #ifdef ENABLE_CHECKING
7335 /* Verify every entry in GNU_LIST was used. */
7336 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7337 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7344 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7345 the first element of an array aggregate. It may itself be an aggregate.
7346 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7347 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7348 for range checking. */
7351 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7352 Entity_Id gnat_component_type)
7354 tree gnu_expr_list = NULL_TREE;
7355 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7358 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7360 /* If the expression is itself an array aggregate then first build the
7361 innermost constructor if it is part of our array (multi-dimensional
7363 if (Nkind (gnat_expr) == N_Aggregate
7364 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7365 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7366 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7367 TREE_TYPE (gnu_array_type),
7368 gnat_component_type);
7371 gnu_expr = gnat_to_gnu (gnat_expr);
7373 /* Before assigning the element to the array, make sure it is
7375 if (Do_Range_Check (gnat_expr))
7376 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7380 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7383 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7386 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7389 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7390 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7391 of the associations that are from RECORD_TYPE. If we see an internal
7392 record, make a recursive call to fill it in as well. */
7395 extract_values (tree values, tree record_type)
7397 tree result = NULL_TREE;
7400 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7404 /* _Parent is an internal field, but may have values in the aggregate,
7405 so check for values first. */
7406 if ((tem = purpose_member (field, values)))
7408 value = TREE_VALUE (tem);
7409 TREE_ADDRESSABLE (tem) = 1;
7412 else if (DECL_INTERNAL_P (field))
7414 value = extract_values (values, TREE_TYPE (field));
7415 if (TREE_CODE (value) == CONSTRUCTOR
7416 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7420 /* If we have a record subtype, the names will match, but not the
7421 actual FIELD_DECLs. */
7422 for (tem = values; tem; tem = TREE_CHAIN (tem))
7423 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7425 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7426 TREE_ADDRESSABLE (tem) = 1;
7432 result = tree_cons (field, value, result);
7435 return gnat_build_constructor (record_type, nreverse (result));
7438 /* EXP is to be treated as an array or record. Handle the cases when it is
7439 an access object and perform the required dereferences. */
7442 maybe_implicit_deref (tree exp)
7444 /* If the type is a pointer, dereference it. */
7445 if (POINTER_TYPE_P (TREE_TYPE (exp))
7446 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
7447 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7449 /* If we got a padded type, remove it too. */
7450 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7451 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7456 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7457 location and false if it doesn't. In the former case, set the Gigi global
7458 variable REF_FILENAME to the simple debug file name as given by sinput. */
7461 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7463 if (Sloc == No_Location)
7466 if (Sloc <= Standard_Location)
7468 *locus = BUILTINS_LOCATION;
7473 Source_File_Index file = Get_Source_File_Index (Sloc);
7474 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7475 Column_Number column = Get_Column_Number (Sloc);
7476 struct line_map *map = &line_table->maps[file - 1];
7478 /* Translate the location according to the line-map.h formula. */
7479 *locus = map->start_location
7480 + ((line - map->to_line) << map->column_bits)
7481 + (column & ((1 << map->column_bits) - 1));
7485 = IDENTIFIER_POINTER
7487 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7492 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7493 don't do anything if it doesn't correspond to a source location. */
7496 set_expr_location_from_node (tree node, Node_Id gnat_node)
7500 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7503 SET_EXPR_LOCATION (node, locus);
7506 /* Return a colon-separated list of encodings contained in encoded Ada
7510 extract_encoding (const char *name)
7512 char *encoding = GGC_NEWVEC (char, strlen (name));
7513 get_encoding (name, encoding);
7517 /* Extract the Ada name from an encoded name. */
7520 decode_name (const char *name)
7522 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7523 __gnat_decode (name, decoded, 0);
7527 /* Post an error message. MSG is the error message, properly annotated.
7528 NODE is the node at which to post the error and the node to use for the
7529 '&' substitution. */
7532 post_error (const char *msg, Node_Id node)
7534 String_Template temp;
7537 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7538 fp.Array = msg, fp.Bounds = &temp;
7540 Error_Msg_N (fp, node);
7543 /* Similar to post_error, but NODE is the node at which to post the error and
7544 ENT is the node to use for the '&' substitution. */
7547 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7549 String_Template temp;
7552 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7553 fp.Array = msg, fp.Bounds = &temp;
7555 Error_Msg_NE (fp, node, ent);
7558 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
7561 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int num)
7563 Error_Msg_Uint_1 = UI_From_Int (num);
7564 post_error_ne (msg, node, ent);
7567 /* Similar to post_error_ne, but T is a GCC tree representing the number to
7568 write. If T represents a constant, the text inside curly brackets in
7569 MSG will be output (presumably including a '^'). Otherwise it will not
7570 be output and the text inside square brackets will be output instead. */
7573 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7575 char *new_msg = XALLOCAVEC (char, strlen (msg) + 1);
7576 char start_yes, end_yes, start_no, end_no;
7580 if (TREE_CODE (t) == INTEGER_CST)
7582 Error_Msg_Uint_1 = UI_From_gnu (t);
7583 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7586 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7588 for (p = msg, q = new_msg; *p; p++)
7590 if (*p == start_yes)
7591 for (p++; *p != end_yes; p++)
7593 else if (*p == start_no)
7594 for (p++; *p != end_no; p++)
7602 post_error_ne (new_msg, node, ent);
7605 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
7608 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7611 Error_Msg_Uint_2 = UI_From_Int (num);
7612 post_error_ne_tree (msg, node, ent, t);
7615 /* Initialize the table that maps GNAT codes to GCC codes for simple
7616 binary and unary operations. */
7619 init_code_table (void)
7621 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7622 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7624 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7625 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7626 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7627 gnu_codes[N_Op_Eq] = EQ_EXPR;
7628 gnu_codes[N_Op_Ne] = NE_EXPR;
7629 gnu_codes[N_Op_Lt] = LT_EXPR;
7630 gnu_codes[N_Op_Le] = LE_EXPR;
7631 gnu_codes[N_Op_Gt] = GT_EXPR;
7632 gnu_codes[N_Op_Ge] = GE_EXPR;
7633 gnu_codes[N_Op_Add] = PLUS_EXPR;
7634 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7635 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7636 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7637 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7638 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7639 gnu_codes[N_Op_Abs] = ABS_EXPR;
7640 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7641 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7642 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7643 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7644 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7645 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7648 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7652 get_exception_label (char kind)
7654 if (kind == N_Raise_Constraint_Error)
7655 return TREE_VALUE (gnu_constraint_error_label_stack);
7656 else if (kind == N_Raise_Storage_Error)
7657 return TREE_VALUE (gnu_storage_error_label_stack);
7658 else if (kind == N_Raise_Program_Error)
7659 return TREE_VALUE (gnu_program_error_label_stack);
7664 #include "gt-ada-trans.h"