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. */
791 ||(Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
792 && Is_Atomic (Defining_Entity (gnat_parent)))
793 /* We don't use a constructor if this is a class-wide object
794 because the effective type of the object is the equivalent
795 type of the class-wide subtype and it smashes most of the
796 data into an array of bytes to which we cannot convert. */
797 || Ekind ((Etype (Defining_Entity (gnat_parent))))
798 == E_Class_Wide_Subtype);
800 case N_Assignment_Statement:
801 /* We cannot use a constructor if the LHS is an atomic object because
802 the actual assignment might end up being done component-wise. */
804 || Name (gnat_parent) == gnat_node
805 || (Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
806 && Is_Atomic (Entity (Name (gnat_parent)))));
808 case N_Type_Conversion:
809 case N_Qualified_Expression:
810 /* We must look through all conversions for composite types because we
811 may need to bypass an intermediate conversion to a narrower record
812 type that is generated for a formal conversion, e.g. the conversion
813 to the root type of a hierarchy of tagged types generated for the
814 formal conversion to the class-wide type. */
815 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_node))))
818 /* ... fall through ... */
820 case N_Unchecked_Type_Conversion:
822 || lvalue_required_p (gnat_parent,
823 get_unpadded_type (Etype (gnat_parent)),
824 constant, address_of_constant, aliased));
827 /* We should only reach here through the N_Qualified_Expression case
828 and, therefore, only for composite types. Force an lvalue since
829 a block-copy to the newly allocated area of memory is made. */
832 case N_Explicit_Dereference:
833 /* We look through dereferences for address of constant because we need
834 to handle the special cases listed above. */
835 if (constant && address_of_constant)
836 return lvalue_required_p (gnat_parent,
837 get_unpadded_type (Etype (gnat_parent)),
840 /* ... fall through ... */
849 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
850 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
851 to where we should place the result type. */
854 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
856 Node_Id gnat_temp, gnat_temp_type;
857 tree gnu_result, gnu_result_type;
859 /* Whether we should require an lvalue for GNAT_NODE. Needed in
860 specific circumstances only, so evaluated lazily. < 0 means
861 unknown, > 0 means known true, 0 means known false. */
862 int require_lvalue = -1;
864 /* If GNAT_NODE is a constant, whether we should use the initialization
865 value instead of the constant entity, typically for scalars with an
866 address clause when the parent doesn't require an lvalue. */
867 bool use_constant_initializer = false;
869 /* If the Etype of this node does not equal the Etype of the Entity,
870 something is wrong with the entity map, probably in generic
871 instantiation. However, this does not apply to types. Since we sometime
872 have strange Ekind's, just do this test for objects. Also, if the Etype of
873 the Entity is private, the Etype of the N_Identifier is allowed to be the
874 full type and also we consider a packed array type to be the same as the
875 original type. Similarly, a class-wide type is equivalent to a subtype of
876 itself. Finally, if the types are Itypes, one may be a copy of the other,
877 which is also legal. */
878 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
879 ? gnat_node : Entity (gnat_node));
880 gnat_temp_type = Etype (gnat_temp);
882 gcc_assert (Etype (gnat_node) == gnat_temp_type
883 || (Is_Packed (gnat_temp_type)
884 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
885 || (Is_Class_Wide_Type (Etype (gnat_node)))
886 || (IN (Ekind (gnat_temp_type), Private_Kind)
887 && Present (Full_View (gnat_temp_type))
888 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
889 || (Is_Packed (Full_View (gnat_temp_type))
890 && (Etype (gnat_node)
891 == Packed_Array_Type (Full_View
892 (gnat_temp_type))))))
893 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
894 || !(Ekind (gnat_temp) == E_Variable
895 || Ekind (gnat_temp) == E_Component
896 || Ekind (gnat_temp) == E_Constant
897 || Ekind (gnat_temp) == E_Loop_Parameter
898 || IN (Ekind (gnat_temp), Formal_Kind)));
900 /* If this is a reference to a deferred constant whose partial view is an
901 unconstrained private type, the proper type is on the full view of the
902 constant, not on the full view of the type, which may be unconstrained.
904 This may be a reference to a type, for example in the prefix of the
905 attribute Position, generated for dispatching code (see Make_DT in
906 exp_disp,adb). In that case we need the type itself, not is parent,
907 in particular if it is a derived type */
908 if (Is_Private_Type (gnat_temp_type)
909 && Has_Unknown_Discriminants (gnat_temp_type)
910 && Ekind (gnat_temp) == E_Constant
911 && Present (Full_View (gnat_temp)))
913 gnat_temp = Full_View (gnat_temp);
914 gnat_temp_type = Etype (gnat_temp);
918 /* We want to use the Actual_Subtype if it has already been elaborated,
919 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
921 if ((Ekind (gnat_temp) == E_Constant
922 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
923 && !(Is_Array_Type (Etype (gnat_temp))
924 && Present (Packed_Array_Type (Etype (gnat_temp))))
925 && Present (Actual_Subtype (gnat_temp))
926 && present_gnu_tree (Actual_Subtype (gnat_temp)))
927 gnat_temp_type = Actual_Subtype (gnat_temp);
929 gnat_temp_type = Etype (gnat_node);
932 /* Expand the type of this identifier first, in case it is an enumeral
933 literal, which only get made when the type is expanded. There is no
934 order-of-elaboration issue here. */
935 gnu_result_type = get_unpadded_type (gnat_temp_type);
937 /* If this is a non-imported scalar constant with an address clause,
938 retrieve the value instead of a pointer to be dereferenced unless
939 an lvalue is required. This is generally more efficient and actually
940 required if this is a static expression because it might be used
941 in a context where a dereference is inappropriate, such as a case
942 statement alternative or a record discriminant. There is no possible
943 volatile-ness short-circuit here since Volatile constants must bei
945 if (Ekind (gnat_temp) == E_Constant
946 && Is_Scalar_Type (gnat_temp_type)
947 && !Is_Imported (gnat_temp)
948 && Present (Address_Clause (gnat_temp)))
950 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
951 false, Is_Aliased (gnat_temp));
952 use_constant_initializer = !require_lvalue;
955 if (use_constant_initializer)
957 /* If this is a deferred constant, the initializer is attached to
959 if (Present (Full_View (gnat_temp)))
960 gnat_temp = Full_View (gnat_temp);
962 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
965 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
967 /* If we are in an exception handler, force this variable into memory to
968 ensure optimization does not remove stores that appear redundant but are
969 actually needed in case an exception occurs.
971 ??? Note that we need not do this if the variable is declared within the
972 handler, only if it is referenced in the handler and declared in an
973 enclosing block, but we have no way of testing that right now.
975 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
976 here, but it can now be removed by the Tree aliasing machinery if the
977 address of the variable is never taken. All we can do is to make the
978 variable volatile, which might incur the generation of temporaries just
979 to access the memory in some circumstances. This can be avoided for
980 variables of non-constant size because they are automatically allocated
981 to memory. There might be no way of allocating a proper temporary for
982 them in any case. We only do this for SJLJ though. */
983 if (TREE_VALUE (gnu_except_ptr_stack)
984 && TREE_CODE (gnu_result) == VAR_DECL
985 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
986 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
988 /* Some objects (such as parameters passed by reference, globals of
989 variable size, and renamed objects) actually represent the address
990 of the object. In that case, we must do the dereference. Likewise,
991 deal with parameters to foreign convention subprograms. */
992 if (DECL_P (gnu_result)
993 && (DECL_BY_REF_P (gnu_result)
994 || (TREE_CODE (gnu_result) == PARM_DECL
995 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
997 const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result);
1000 if (TREE_CODE (gnu_result) == PARM_DECL
1001 && DECL_BY_COMPONENT_PTR_P (gnu_result))
1003 = build_unary_op (INDIRECT_REF, NULL_TREE,
1004 convert (build_pointer_type (gnu_result_type),
1007 /* If it's a renaming pointer and we are at the right binding level,
1008 we can reference the renamed object directly, since the renamed
1009 expression has been protected against multiple evaluations. */
1010 else if (TREE_CODE (gnu_result) == VAR_DECL
1011 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result))
1012 && (!DECL_RENAMING_GLOBAL_P (gnu_result)
1013 || global_bindings_p ()))
1014 gnu_result = renamed_obj;
1016 /* Return the underlying CST for a CONST_DECL like a few lines below,
1017 after dereferencing in this case. */
1018 else if (TREE_CODE (gnu_result) == CONST_DECL)
1019 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
1020 DECL_INITIAL (gnu_result));
1023 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
1026 TREE_READONLY (gnu_result) = 1;
1029 /* The GNAT tree has the type of a function as the type of its result. Also
1030 use the type of the result if the Etype is a subtype which is nominally
1031 unconstrained. But remove any padding from the resulting type. */
1032 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
1033 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
1035 gnu_result_type = TREE_TYPE (gnu_result);
1036 if (TYPE_IS_PADDING_P (gnu_result_type))
1037 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
1040 /* If we have a constant declaration and its initializer, try to return the
1041 latter to avoid the need to call fold in lots of places and the need for
1042 elaboration code if this identifier is used as an initializer itself. */
1043 if (TREE_CONSTANT (gnu_result)
1044 && DECL_P (gnu_result)
1045 && DECL_INITIAL (gnu_result))
1047 bool constant_only = (TREE_CODE (gnu_result) == CONST_DECL
1048 && !DECL_CONST_CORRESPONDING_VAR (gnu_result));
1049 bool address_of_constant = (TREE_CODE (gnu_result) == CONST_DECL
1050 && DECL_CONST_ADDRESS_P (gnu_result));
1052 /* If there is a (corresponding) variable or this is the address of a
1053 constant, we only want to return the initializer if an lvalue isn't
1054 required. Evaluate this now if we have not already done so. */
1055 if ((!constant_only || address_of_constant) && require_lvalue < 0)
1057 = lvalue_required_p (gnat_node, gnu_result_type, true,
1058 address_of_constant, Is_Aliased (gnat_temp));
1060 /* ??? We need to unshare the initializer if the object is external
1061 as such objects are not marked for unsharing if we are not at the
1062 global level. This should be fixed in add_decl_expr. */
1063 if ((constant_only && !address_of_constant) || !require_lvalue)
1064 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
1067 *gnu_result_type_p = gnu_result_type;
1072 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1073 any statements we generate. */
1076 Pragma_to_gnu (Node_Id gnat_node)
1079 tree gnu_result = alloc_stmt_list ();
1081 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
1082 annotating types. */
1083 if (type_annotate_only
1084 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
1087 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
1089 case Pragma_Inspection_Point:
1090 /* Do nothing at top level: all such variables are already viewable. */
1091 if (global_bindings_p ())
1094 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
1095 Present (gnat_temp);
1096 gnat_temp = Next (gnat_temp))
1098 Node_Id gnat_expr = Expression (gnat_temp);
1099 tree gnu_expr = gnat_to_gnu (gnat_expr);
1101 enum machine_mode mode;
1102 tree asm_constraint = NULL_TREE;
1103 #ifdef ASM_COMMENT_START
1107 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1108 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1110 /* Use the value only if it fits into a normal register,
1111 otherwise use the address. */
1112 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1113 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1114 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1115 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1118 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1120 #ifdef ASM_COMMENT_START
1121 comment = concat (ASM_COMMENT_START,
1122 " inspection point: ",
1123 Get_Name_String (Chars (gnat_expr)),
1124 use_address ? " address" : "",
1127 asm_constraint = build_string (strlen (comment), comment);
1130 gnu_expr = build5 (ASM_EXPR, void_type_node,
1134 (build_tree_list (NULL_TREE,
1135 build_string (1, "g")),
1136 gnu_expr, NULL_TREE),
1137 NULL_TREE, NULL_TREE);
1138 ASM_VOLATILE_P (gnu_expr) = 1;
1139 set_expr_location_from_node (gnu_expr, gnat_node);
1140 append_to_statement_list (gnu_expr, &gnu_result);
1144 case Pragma_Optimize:
1145 switch (Chars (Expression
1146 (First (Pragma_Argument_Associations (gnat_node)))))
1148 case Name_Time: case Name_Space:
1150 post_error ("insufficient -O value?", gnat_node);
1155 post_error ("must specify -O0?", gnat_node);
1163 case Pragma_Reviewable:
1164 if (write_symbols == NO_DEBUG)
1165 post_error ("must specify -g?", gnat_node);
1172 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1173 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1174 where we should place the result type. ATTRIBUTE is the attribute ID. */
1177 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1179 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1180 tree gnu_type = TREE_TYPE (gnu_prefix);
1181 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1182 bool prefix_unused = false;
1184 /* If the input is a NULL_EXPR, make a new one. */
1185 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1187 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1188 *gnu_result_type_p = gnu_result_type;
1189 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1196 /* These are just conversions since representation clauses for
1197 enumeration types are handled in the front-end. */
1199 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1200 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1201 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1202 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1203 checkp, checkp, true, gnat_node);
1209 /* These just add or subtract the constant 1 since representation
1210 clauses for enumeration types are handled in the front-end. */
1211 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1212 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1214 if (Do_Range_Check (First (Expressions (gnat_node))))
1216 gnu_expr = gnat_protect_expr (gnu_expr);
1219 (build_binary_op (EQ_EXPR, boolean_type_node,
1221 attribute == Attr_Pred
1222 ? TYPE_MIN_VALUE (gnu_result_type)
1223 : TYPE_MAX_VALUE (gnu_result_type)),
1224 gnu_expr, CE_Range_Check_Failed, gnat_node);
1228 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1229 gnu_result_type, gnu_expr,
1230 convert (gnu_result_type, integer_one_node));
1234 case Attr_Unrestricted_Access:
1235 /* Conversions don't change addresses but can cause us to miss the
1236 COMPONENT_REF case below, so strip them off. */
1237 gnu_prefix = remove_conversions (gnu_prefix,
1238 !Must_Be_Byte_Aligned (gnat_node));
1240 /* If we are taking 'Address of an unconstrained object, this is the
1241 pointer to the underlying array. */
1242 if (attribute == Attr_Address)
1243 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1245 /* If we are building a static dispatch table, we have to honor
1246 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1247 with the C++ ABI. We do it in the non-static case as well,
1248 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1249 else if (TARGET_VTABLE_USES_DESCRIPTORS
1250 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1252 tree gnu_field, gnu_list = NULL_TREE, t;
1253 /* Descriptors can only be built here for top-level functions. */
1254 bool build_descriptor = (global_bindings_p () != 0);
1257 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1259 /* If we're not going to build the descriptor, we have to retrieve
1260 the one which will be built by the linker (or by the compiler
1261 later if a static chain is requested). */
1262 if (!build_descriptor)
1264 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1265 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1267 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1270 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1271 i < TARGET_VTABLE_USES_DESCRIPTORS;
1272 gnu_field = TREE_CHAIN (gnu_field), i++)
1274 if (build_descriptor)
1276 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1277 build_int_cst (NULL_TREE, i));
1278 TREE_CONSTANT (t) = 1;
1281 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1282 gnu_field, NULL_TREE);
1284 gnu_list = tree_cons (gnu_field, t, gnu_list);
1287 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1291 /* ... fall through ... */
1294 case Attr_Unchecked_Access:
1295 case Attr_Code_Address:
1296 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1298 = build_unary_op (((attribute == Attr_Address
1299 || attribute == Attr_Unrestricted_Access)
1300 && !Must_Be_Byte_Aligned (gnat_node))
1301 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1302 gnu_result_type, gnu_prefix);
1304 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1305 don't try to build a trampoline. */
1306 if (attribute == Attr_Code_Address)
1308 for (gnu_expr = gnu_result;
1309 CONVERT_EXPR_P (gnu_expr);
1310 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1311 TREE_CONSTANT (gnu_expr) = 1;
1313 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1314 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1317 /* For other address attributes applied to a nested function,
1318 find an inner ADDR_EXPR and annotate it so that we can issue
1319 a useful warning with -Wtrampolines. */
1320 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1322 for (gnu_expr = gnu_result;
1323 CONVERT_EXPR_P (gnu_expr);
1324 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1327 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1328 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1330 set_expr_location_from_node (gnu_expr, gnat_node);
1332 /* Check that we're not violating the No_Implicit_Dynamic_Code
1333 restriction. Be conservative if we don't know anything
1334 about the trampoline strategy for the target. */
1335 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1340 case Attr_Pool_Address:
1343 tree gnu_ptr = gnu_prefix;
1345 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1347 /* If this is an unconstrained array, we know the object has been
1348 allocated with the template in front of the object. So compute
1349 the template address. */
1350 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1352 = convert (build_pointer_type
1353 (TYPE_OBJECT_RECORD_TYPE
1354 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1357 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1358 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1359 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1361 tree gnu_char_ptr_type
1362 = build_pointer_type (unsigned_char_type_node);
1363 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1364 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1365 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1369 gnu_result = convert (gnu_result_type, gnu_ptr);
1374 case Attr_Object_Size:
1375 case Attr_Value_Size:
1376 case Attr_Max_Size_In_Storage_Elements:
1377 gnu_expr = gnu_prefix;
1379 /* Remove NOPs and conversions between original and packable version
1380 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1381 to see if a COMPONENT_REF was involved. */
1382 while (TREE_CODE (gnu_expr) == NOP_EXPR
1383 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1384 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1385 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1387 && TYPE_NAME (TREE_TYPE (gnu_expr))
1388 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1389 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1391 gnu_prefix = remove_conversions (gnu_prefix, true);
1392 prefix_unused = true;
1393 gnu_type = TREE_TYPE (gnu_prefix);
1395 /* Replace an unconstrained array type with the type of the underlying
1396 array. We can't do this with a call to maybe_unconstrained_array
1397 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1398 use the record type that will be used to allocate the object and its
1400 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1402 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1403 if (attribute != Attr_Max_Size_In_Storage_Elements)
1404 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1407 /* If we're looking for the size of a field, return the field size.
1408 Otherwise, if the prefix is an object, or if we're looking for
1409 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1410 GCC size of the type. Otherwise, it is the RM size of the type. */
1411 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1412 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1413 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1414 || attribute == Attr_Object_Size
1415 || attribute == Attr_Max_Size_In_Storage_Elements)
1417 /* If the prefix is an object of a padded type, the GCC size isn't
1418 relevant to the programmer. Normally what we want is the RM size,
1419 which was set from the specified size, but if it was not set, we
1420 want the size of the field. Using the MAX of those two produces
1421 the right result in all cases. Don't use the size of the field
1422 if it's self-referential, since that's never what's wanted. */
1423 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1424 && TYPE_IS_PADDING_P (gnu_type)
1425 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1427 gnu_result = rm_size (gnu_type);
1428 if (!CONTAINS_PLACEHOLDER_P
1429 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1431 = size_binop (MAX_EXPR, gnu_result,
1432 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1434 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1436 Node_Id gnat_deref = Prefix (gnat_node);
1437 Node_Id gnat_actual_subtype
1438 = Actual_Designated_Subtype (gnat_deref);
1440 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1442 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1443 && Present (gnat_actual_subtype))
1445 tree gnu_actual_obj_type
1446 = gnat_to_gnu_type (gnat_actual_subtype);
1448 = build_unc_object_type_from_ptr (gnu_ptr_type,
1449 gnu_actual_obj_type,
1450 get_identifier ("SIZE"),
1454 gnu_result = TYPE_SIZE (gnu_type);
1457 gnu_result = TYPE_SIZE (gnu_type);
1460 gnu_result = rm_size (gnu_type);
1462 /* Deal with a self-referential size by returning the maximum size for
1463 a type and by qualifying the size with the object otherwise. */
1464 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1466 if (TREE_CODE (gnu_prefix) == TYPE_DECL)
1467 gnu_result = max_size (gnu_result, true);
1469 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1472 /* If the type contains a template, subtract its size. */
1473 if (TREE_CODE (gnu_type) == RECORD_TYPE
1474 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1475 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1476 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1478 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1479 if (attribute == Attr_Max_Size_In_Storage_Elements)
1480 gnu_result = size_binop (CEIL_DIV_EXPR, gnu_result, bitsize_unit_node);
1482 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1485 case Attr_Alignment:
1489 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1490 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1491 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1493 gnu_type = TREE_TYPE (gnu_prefix);
1494 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1495 prefix_unused = true;
1497 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1498 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1501 Node_Id gnat_prefix = Prefix (gnat_node);
1502 Entity_Id gnat_type = Etype (gnat_prefix);
1503 unsigned int double_align;
1504 bool is_capped_double, align_clause;
1506 /* If the default alignment of "double" or larger scalar types is
1507 specifically capped and there is an alignment clause neither
1508 on the type nor on the prefix itself, return the cap. */
1509 if ((double_align = double_float_alignment) > 0)
1511 = is_double_float_or_array (gnat_type, &align_clause);
1512 else if ((double_align = double_scalar_alignment) > 0)
1514 = is_double_scalar_or_array (gnat_type, &align_clause);
1516 is_capped_double = align_clause = false;
1518 if (is_capped_double
1519 && Nkind (gnat_prefix) == N_Identifier
1520 && Present (Alignment_Clause (Entity (gnat_prefix))))
1521 align_clause = true;
1523 if (is_capped_double && !align_clause)
1524 align = double_align;
1526 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1529 gnu_result = size_int (align);
1535 case Attr_Range_Length:
1536 prefix_unused = true;
1538 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1540 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1542 if (attribute == Attr_First)
1543 gnu_result = TYPE_MIN_VALUE (gnu_type);
1544 else if (attribute == Attr_Last)
1545 gnu_result = TYPE_MAX_VALUE (gnu_type);
1549 (MAX_EXPR, get_base_type (gnu_result_type),
1551 (PLUS_EXPR, get_base_type (gnu_result_type),
1552 build_binary_op (MINUS_EXPR,
1553 get_base_type (gnu_result_type),
1554 convert (gnu_result_type,
1555 TYPE_MAX_VALUE (gnu_type)),
1556 convert (gnu_result_type,
1557 TYPE_MIN_VALUE (gnu_type))),
1558 convert (gnu_result_type, integer_one_node)),
1559 convert (gnu_result_type, integer_zero_node));
1564 /* ... fall through ... */
1568 int Dimension = (Present (Expressions (gnat_node))
1569 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1571 struct parm_attr_d *pa = NULL;
1572 Entity_Id gnat_param = Empty;
1574 /* Make sure any implicit dereference gets done. */
1575 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1576 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1577 /* We treat unconstrained array In parameters specially. */
1578 if (Nkind (Prefix (gnat_node)) == N_Identifier
1579 && !Is_Constrained (Etype (Prefix (gnat_node)))
1580 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1581 gnat_param = Entity (Prefix (gnat_node));
1582 gnu_type = TREE_TYPE (gnu_prefix);
1583 prefix_unused = true;
1584 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1586 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1591 for (ndim = 1, gnu_type_temp = gnu_type;
1592 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1593 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1594 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1597 Dimension = ndim + 1 - Dimension;
1600 for (i = 1; i < Dimension; i++)
1601 gnu_type = TREE_TYPE (gnu_type);
1603 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1605 /* When not optimizing, look up the slot associated with the parameter
1606 and the dimension in the cache and create a new one on failure. */
1607 if (!optimize && Present (gnat_param))
1609 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1610 if (pa->id == gnat_param && pa->dim == Dimension)
1615 pa = GGC_CNEW (struct parm_attr_d);
1616 pa->id = gnat_param;
1617 pa->dim = Dimension;
1618 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1622 /* Return the cached expression or build a new one. */
1623 if (attribute == Attr_First)
1625 if (pa && pa->first)
1627 gnu_result = pa->first;
1632 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1635 else if (attribute == Attr_Last)
1639 gnu_result = pa->last;
1644 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1647 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1649 if (pa && pa->length)
1651 gnu_result = pa->length;
1656 /* We used to compute the length as max (hb - lb + 1, 0),
1657 which could overflow for some cases of empty arrays, e.g.
1658 when lb == index_type'first. We now compute the length as
1659 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1660 much rarer cases, for extremely large arrays we expect
1661 never to encounter in practice. In addition, the former
1662 computation required the use of potentially constraining
1663 signed arithmetic while the latter doesn't. Note that
1664 the comparison must be done in the original index type,
1665 to avoid any overflow during the conversion. */
1666 tree comp_type = get_base_type (gnu_result_type);
1667 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1668 tree lb = TYPE_MIN_VALUE (index_type);
1669 tree hb = TYPE_MAX_VALUE (index_type);
1671 = build_binary_op (PLUS_EXPR, comp_type,
1672 build_binary_op (MINUS_EXPR,
1674 convert (comp_type, hb),
1675 convert (comp_type, lb)),
1676 convert (comp_type, integer_one_node));
1678 = build_cond_expr (comp_type,
1679 build_binary_op (GE_EXPR,
1683 convert (comp_type, integer_zero_node));
1687 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1688 handling. Note that these attributes could not have been used on
1689 an unconstrained array type. */
1690 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1692 /* Cache the expression we have just computed. Since we want to do it
1693 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1694 create the temporary. */
1698 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1699 TREE_SIDE_EFFECTS (gnu_result) = 1;
1700 if (attribute == Attr_First)
1701 pa->first = gnu_result;
1702 else if (attribute == Attr_Last)
1703 pa->last = gnu_result;
1705 pa->length = gnu_result;
1708 /* Set the source location onto the predicate of the condition in the
1709 'Length case but do not do it if the expression is cached to avoid
1710 messing up the debug info. */
1711 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1712 && TREE_CODE (gnu_result) == COND_EXPR
1713 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1714 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1720 case Attr_Bit_Position:
1722 case Attr_First_Bit:
1726 HOST_WIDE_INT bitsize;
1727 HOST_WIDE_INT bitpos;
1729 tree gnu_field_bitpos;
1730 tree gnu_field_offset;
1732 enum machine_mode mode;
1733 int unsignedp, volatilep;
1735 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1736 gnu_prefix = remove_conversions (gnu_prefix, true);
1737 prefix_unused = true;
1739 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1740 the result is 0. Don't allow 'Bit on a bare component, though. */
1741 if (attribute == Attr_Bit
1742 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1743 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1745 gnu_result = integer_zero_node;
1750 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1751 || (attribute == Attr_Bit_Position
1752 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1754 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1755 &mode, &unsignedp, &volatilep, false);
1757 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1759 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1760 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1762 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1763 TREE_CODE (gnu_inner) == COMPONENT_REF
1764 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1765 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1768 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1769 bit_position (TREE_OPERAND (gnu_inner, 1)));
1771 = size_binop (PLUS_EXPR, gnu_field_offset,
1772 byte_position (TREE_OPERAND (gnu_inner, 1)));
1775 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1777 gnu_field_bitpos = bit_position (gnu_prefix);
1778 gnu_field_offset = byte_position (gnu_prefix);
1782 gnu_field_bitpos = bitsize_zero_node;
1783 gnu_field_offset = size_zero_node;
1789 gnu_result = gnu_field_offset;
1792 case Attr_First_Bit:
1794 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1798 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1799 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1800 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1801 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1805 case Attr_Bit_Position:
1806 gnu_result = gnu_field_bitpos;
1810 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1812 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1819 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1820 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1822 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1823 gnu_result = build_binary_op (attribute == Attr_Min
1824 ? MIN_EXPR : MAX_EXPR,
1825 gnu_result_type, gnu_lhs, gnu_rhs);
1829 case Attr_Passed_By_Reference:
1830 gnu_result = size_int (default_pass_by_ref (gnu_type)
1831 || must_pass_by_ref (gnu_type));
1832 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1835 case Attr_Component_Size:
1836 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1837 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1838 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1840 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1841 gnu_type = TREE_TYPE (gnu_prefix);
1843 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1844 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1846 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1847 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1848 gnu_type = TREE_TYPE (gnu_type);
1850 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1852 /* Note this size cannot be self-referential. */
1853 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1854 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1855 prefix_unused = true;
1858 case Attr_Null_Parameter:
1859 /* This is just a zero cast to the pointer type for our prefix and
1861 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1863 = build_unary_op (INDIRECT_REF, NULL_TREE,
1864 convert (build_pointer_type (gnu_result_type),
1865 integer_zero_node));
1866 TREE_PRIVATE (gnu_result) = 1;
1869 case Attr_Mechanism_Code:
1872 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1874 prefix_unused = true;
1875 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1876 if (Present (Expressions (gnat_node)))
1878 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1880 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1881 i--, gnat_obj = Next_Formal (gnat_obj))
1885 code = Mechanism (gnat_obj);
1886 if (code == Default)
1887 code = ((present_gnu_tree (gnat_obj)
1888 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1889 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1891 && (DECL_BY_COMPONENT_PTR_P
1892 (get_gnu_tree (gnat_obj))))))
1893 ? By_Reference : By_Copy);
1894 gnu_result = convert (gnu_result_type, size_int (- code));
1899 /* Say we have an unimplemented attribute. Then set the value to be
1900 returned to be a zero and hope that's something we can convert to
1901 the type of this attribute. */
1902 post_error ("unimplemented attribute", gnat_node);
1903 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1904 gnu_result = integer_zero_node;
1908 /* If this is an attribute where the prefix was unused, force a use of it if
1909 it has a side-effect. But don't do it if the prefix is just an entity
1910 name. However, if an access check is needed, we must do it. See second
1911 example in AARM 11.6(5.e). */
1912 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1913 && !Is_Entity_Name (Prefix (gnat_node)))
1914 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1915 gnu_prefix, gnu_result);
1917 *gnu_result_type_p = gnu_result_type;
1921 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1922 to a GCC tree, which is returned. */
1925 Case_Statement_to_gnu (Node_Id gnat_node)
1931 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1932 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1934 /* The range of values in a case statement is determined by the rules in
1935 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1936 of the expression. One exception arises in the case of a simple name that
1937 is parenthesized. This still has the Etype of the name, but since it is
1938 not a name, para 7 does not apply, and we need to go to the base type.
1939 This is the only case where parenthesization affects the dynamic
1940 semantics (i.e. the range of possible values at runtime that is covered
1941 by the others alternative.
1943 Another exception is if the subtype of the expression is non-static. In
1944 that case, we also have to use the base type. */
1945 if (Paren_Count (Expression (gnat_node)) != 0
1946 || !Is_OK_Static_Subtype (Underlying_Type
1947 (Etype (Expression (gnat_node)))))
1948 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1950 /* We build a SWITCH_EXPR that contains the code with interspersed
1951 CASE_LABEL_EXPRs for each label. */
1953 push_stack (&gnu_switch_label_stack, NULL_TREE,
1954 create_artificial_label (input_location));
1955 start_stmt_group ();
1956 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1957 Present (gnat_when);
1958 gnat_when = Next_Non_Pragma (gnat_when))
1960 bool choices_added_p = false;
1961 Node_Id gnat_choice;
1963 /* First compile all the different case choices for the current WHEN
1965 for (gnat_choice = First (Discrete_Choices (gnat_when));
1966 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1968 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1970 switch (Nkind (gnat_choice))
1973 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1974 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1977 case N_Subtype_Indication:
1978 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1979 (Constraint (gnat_choice))));
1980 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1981 (Constraint (gnat_choice))));
1985 case N_Expanded_Name:
1986 /* This represents either a subtype range or a static value of
1987 some kind; Ekind says which. */
1988 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1990 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1992 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1993 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1997 /* ... fall through ... */
1999 case N_Character_Literal:
2000 case N_Integer_Literal:
2001 gnu_low = gnat_to_gnu (gnat_choice);
2004 case N_Others_Choice:
2011 /* If the case value is a subtype that raises Constraint_Error at
2012 run-time because of a wrong bound, then gnu_low or gnu_high is
2013 not translated into an INTEGER_CST. In such a case, we need
2014 to ensure that the when statement is not added in the tree,
2015 otherwise it will crash the gimplifier. */
2016 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
2017 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
2019 add_stmt_with_node (build3
2020 (CASE_LABEL_EXPR, void_type_node,
2022 create_artificial_label (input_location)),
2024 choices_added_p = true;
2028 /* Push a binding level here in case variables are declared as we want
2029 them to be local to this set of statements instead of to the block
2030 containing the Case statement. */
2031 if (choices_added_p)
2033 add_stmt (build_stmt_group (Statements (gnat_when), true));
2034 add_stmt (build1 (GOTO_EXPR, void_type_node,
2035 TREE_VALUE (gnu_switch_label_stack)));
2039 /* Now emit a definition of the label all the cases branched to. */
2040 add_stmt (build1 (LABEL_EXPR, void_type_node,
2041 TREE_VALUE (gnu_switch_label_stack)));
2042 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
2043 end_stmt_group (), NULL_TREE);
2044 pop_stack (&gnu_switch_label_stack);
2049 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2050 false, or the maximum value if MAX is true, of TYPE. */
2053 can_equal_min_or_max_val_p (tree val, tree type, bool max)
2055 tree min_or_max_val = (max ? TYPE_MAX_VALUE (type) : TYPE_MIN_VALUE (type));
2057 if (TREE_CODE (min_or_max_val) != INTEGER_CST)
2060 if (TREE_CODE (val) == NOP_EXPR)
2062 ? TYPE_MAX_VALUE (TREE_TYPE (TREE_OPERAND (val, 0)))
2063 : TYPE_MIN_VALUE (TREE_TYPE (TREE_OPERAND (val, 0))));
2065 if (TREE_CODE (val) != INTEGER_CST)
2068 return tree_int_cst_equal (val, min_or_max_val) == 1;
2071 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2072 If REVERSE is true, minimum value is taken as maximum value. */
2075 can_equal_min_val_p (tree val, tree type, bool reverse)
2077 return can_equal_min_or_max_val_p (val, type, reverse);
2080 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2081 If REVERSE is true, maximum value is taken as minimum value. */
2084 can_equal_max_val_p (tree val, tree type, bool reverse)
2086 return can_equal_min_or_max_val_p (val, type, !reverse);
2089 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2090 to a GCC tree, which is returned. */
2093 Loop_Statement_to_gnu (Node_Id gnat_node)
2095 const Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
2096 tree gnu_loop_stmt = build4 (LOOP_STMT, void_type_node, NULL_TREE,
2097 NULL_TREE, NULL_TREE, NULL_TREE);
2098 tree gnu_loop_label = create_artificial_label (input_location);
2099 tree gnu_loop_var = NULL_TREE, gnu_cond_expr = NULL_TREE;
2102 /* Set location information for statement and end label. */
2103 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
2104 Sloc_to_locus (Sloc (End_Label (gnat_node)),
2105 &DECL_SOURCE_LOCATION (gnu_loop_label));
2106 LOOP_STMT_LABEL (gnu_loop_stmt) = gnu_loop_label;
2108 /* Save the end label of this LOOP_STMT in a stack so that a corresponding
2109 N_Exit_Statement can find it. */
2110 push_stack (&gnu_loop_label_stack, NULL_TREE, gnu_loop_label);
2112 /* Set the condition under which the loop must keep going.
2113 For the case "LOOP .... END LOOP;" the condition is always true. */
2114 if (No (gnat_iter_scheme))
2117 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2118 else if (Present (Condition (gnat_iter_scheme)))
2119 LOOP_STMT_COND (gnu_loop_stmt)
2120 = gnat_to_gnu (Condition (gnat_iter_scheme));
2122 /* Otherwise we have an iteration scheme and the condition is given by the
2123 bounds of the subtype of the iteration variable. */
2126 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2127 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2128 Entity_Id gnat_type = Etype (gnat_loop_var);
2129 tree gnu_type = get_unpadded_type (gnat_type);
2130 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
2131 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
2132 tree gnu_base_type = get_base_type (gnu_type);
2133 tree gnu_one_node = convert (gnu_base_type, integer_one_node);
2134 tree gnu_first, gnu_last;
2135 enum tree_code update_code, test_code, shift_code;
2136 bool reverse = Reverse_Present (gnat_loop_spec), fallback = false;
2138 /* We must disable modulo reduction for the iteration variable, if any,
2139 in order for the loop comparison to be effective. */
2142 gnu_first = gnu_high;
2144 update_code = MINUS_NOMOD_EXPR;
2145 test_code = GE_EXPR;
2146 shift_code = PLUS_NOMOD_EXPR;
2150 gnu_first = gnu_low;
2151 gnu_last = gnu_high;
2152 update_code = PLUS_NOMOD_EXPR;
2153 test_code = LE_EXPR;
2154 shift_code = MINUS_NOMOD_EXPR;
2157 /* We use two different strategies to translate the loop, depending on
2158 whether optimization is enabled.
2160 If it is, we try to generate the canonical form of loop expected by
2161 the loop optimizer, which is the do-while form:
2170 This makes it possible to bypass loop header copying and to turn the
2171 BOTTOM_COND into an inequality test. This should catch (almost) all
2172 loops with constant starting point. If we cannot, we try to generate
2173 the default form, which is:
2181 It will be rotated during loop header copying and an entry test added
2182 to yield the do-while form. This should catch (almost) all loops with
2183 constant ending point. If we cannot, we generate the fallback form:
2192 which works in all cases but for which loop header copying will copy
2193 the BOTTOM_COND, thus adding a third conditional branch.
2195 If optimization is disabled, loop header copying doesn't come into
2196 play and we try to generate the loop forms with the less conditional
2197 branches directly. First, the default form, it should catch (almost)
2198 all loops with constant ending point. Then, if we cannot, we try to
2199 generate the shifted form:
2207 which should catch loops with constant starting point. Otherwise, if
2208 we cannot, we generate the fallback form. */
2212 /* We can use the do-while form if GNU_FIRST-1 doesn't overflow. */
2213 if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse))
2215 gnu_first = build_binary_op (shift_code, gnu_base_type,
2216 gnu_first, gnu_one_node);
2217 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2218 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2221 /* Otherwise, we can use the default form if GNU_LAST+1 doesn't. */
2222 else if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2225 /* Otherwise, use the fallback form. */
2231 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
2232 if (!can_equal_max_val_p (gnu_last, gnu_base_type, reverse))
2235 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
2237 else if (!can_equal_min_val_p (gnu_first, gnu_base_type, reverse)
2238 && !can_equal_min_val_p (gnu_last, gnu_base_type, reverse))
2240 gnu_first = build_binary_op (shift_code, gnu_base_type,
2241 gnu_first, gnu_one_node);
2242 gnu_last = build_binary_op (shift_code, gnu_base_type,
2243 gnu_last, gnu_one_node);
2244 LOOP_STMT_TOP_UPDATE_P (gnu_loop_stmt) = 1;
2247 /* Otherwise, use the fallback form. */
2253 LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt) = 1;
2255 /* If we use the BOTTOM_COND, we can turn the test into an inequality
2256 test but we have to add an ENTRY_COND to protect the empty loop. */
2257 if (LOOP_STMT_BOTTOM_COND_P (gnu_loop_stmt))
2259 test_code = NE_EXPR;
2261 = build3 (COND_EXPR, void_type_node,
2262 build_binary_op (LE_EXPR, boolean_type_node,
2264 NULL_TREE, alloc_stmt_list ());
2265 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2268 /* Open a new nesting level that will surround the loop to declare the
2269 iteration variable. */
2270 start_stmt_group ();
2273 /* Declare the iteration variable and set it to its initial value. */
2274 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2275 if (DECL_BY_REF_P (gnu_loop_var))
2276 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2278 /* Do all the arithmetics in the base type. */
2279 gnu_loop_var = convert (gnu_base_type, gnu_loop_var);
2281 /* Set either the top or bottom exit condition. */
2282 LOOP_STMT_COND (gnu_loop_stmt)
2283 = build_binary_op (test_code, boolean_type_node, gnu_loop_var,
2286 /* Set either the top or bottom update statement and give it the source
2287 location of the iteration for better coverage info. */
2288 LOOP_STMT_UPDATE (gnu_loop_stmt)
2289 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_loop_var,
2290 build_binary_op (update_code, gnu_base_type,
2291 gnu_loop_var, gnu_one_node));
2292 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2296 /* If the loop was named, have the name point to this loop. In this case,
2297 the association is not a DECL node, but the end label of the loop. */
2298 if (Present (Identifier (gnat_node)))
2299 save_gnu_tree (Entity (Identifier (gnat_node)), gnu_loop_label, true);
2301 /* Make the loop body into its own block, so any allocated storage will be
2302 released every iteration. This is needed for stack allocation. */
2303 LOOP_STMT_BODY (gnu_loop_stmt)
2304 = build_stmt_group (Statements (gnat_node), true);
2305 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
2307 /* If we declared a variable, then we are in a statement group for that
2308 declaration. Add the LOOP_STMT to it and make that the "loop". */
2311 add_stmt (gnu_loop_stmt);
2313 gnu_loop_stmt = end_stmt_group ();
2316 /* If we have an outer COND_EXPR, that's our result and this loop is its
2317 "true" statement. Otherwise, the result is the LOOP_STMT. */
2320 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2321 gnu_result = gnu_cond_expr;
2322 recalculate_side_effects (gnu_cond_expr);
2325 gnu_result = gnu_loop_stmt;
2327 pop_stack (&gnu_loop_label_stack);
2332 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2333 handler for the current function. */
2335 /* This is implemented by issuing a call to the appropriate VMS specific
2336 builtin. To avoid having VMS specific sections in the global gigi decls
2337 array, we maintain the decls of interest here. We can't declare them
2338 inside the function because we must mark them never to be GC'd, which we
2339 can only do at the global level. */
2341 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2342 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2345 establish_gnat_vms_condition_handler (void)
2347 tree establish_stmt;
2349 /* Elaborate the required decls on the first call. Check on the decl for
2350 the gnat condition handler to decide, as this is one we create so we are
2351 sure that it will be non null on subsequent calls. The builtin decl is
2352 looked up so remains null on targets where it is not implemented yet. */
2353 if (gnat_vms_condition_handler_decl == NULL_TREE)
2355 vms_builtin_establish_handler_decl
2357 (get_identifier ("__builtin_establish_vms_condition_handler"));
2359 gnat_vms_condition_handler_decl
2360 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2362 build_function_type_list (boolean_type_node,
2366 NULL_TREE, 0, 1, 1, 0, Empty);
2368 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2369 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2372 /* Do nothing if the establish builtin is not available, which might happen
2373 on targets where the facility is not implemented. */
2374 if (vms_builtin_establish_handler_decl == NULL_TREE)
2378 = build_call_1_expr (vms_builtin_establish_handler_decl,
2380 (ADDR_EXPR, NULL_TREE,
2381 gnat_vms_condition_handler_decl));
2383 add_stmt (establish_stmt);
2386 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2387 don't return anything. */
2390 Subprogram_Body_to_gnu (Node_Id gnat_node)
2392 /* Defining identifier of a parameter to the subprogram. */
2393 Entity_Id gnat_param;
2394 /* The defining identifier for the subprogram body. Note that if a
2395 specification has appeared before for this body, then the identifier
2396 occurring in that specification will also be a defining identifier and all
2397 the calls to this subprogram will point to that specification. */
2398 Entity_Id gnat_subprog_id
2399 = (Present (Corresponding_Spec (gnat_node))
2400 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2401 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2402 tree gnu_subprog_decl;
2403 /* Its RESULT_DECL node. */
2404 tree gnu_result_decl;
2405 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2406 tree gnu_subprog_type;
2409 VEC(parm_attr,gc) *cache;
2411 /* If this is a generic object or if it has been eliminated,
2413 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2414 || Ekind (gnat_subprog_id) == E_Generic_Function
2415 || Is_Eliminated (gnat_subprog_id))
2418 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2419 the already-elaborated tree node. However, if this subprogram had its
2420 elaboration deferred, we will already have made a tree node for it. So
2421 treat it as not being defined in that case. Such a subprogram cannot
2422 have an address clause or a freeze node, so this test is safe, though it
2423 does disable some otherwise-useful error checking. */
2425 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2426 Acts_As_Spec (gnat_node)
2427 && !present_gnu_tree (gnat_subprog_id));
2428 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
2429 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2431 /* If the function returns by invisible reference, make it explicit in the
2432 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
2433 if (TREE_ADDRESSABLE (gnu_subprog_type))
2435 TREE_TYPE (gnu_result_decl)
2436 = build_reference_type (TREE_TYPE (gnu_result_decl));
2437 relayout_decl (gnu_result_decl);
2440 /* Propagate the debug mode. */
2441 if (!Needs_Debug_Info (gnat_subprog_id))
2442 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2444 /* Set the line number in the decl to correspond to that of the body so that
2445 the line number notes are written correctly. */
2446 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2448 /* Initialize the information structure for the function. */
2449 allocate_struct_function (gnu_subprog_decl, false);
2450 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2451 = GGC_CNEW (struct language_function);
2454 begin_subprog_body (gnu_subprog_decl);
2456 /* If there are Out parameters, we need to ensure that the return statement
2457 properly copies them out. We do this by making a new block and converting
2458 any inner return into a goto to a label at the end of the block. */
2459 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2460 push_stack (&gnu_return_label_stack, NULL_TREE,
2461 gnu_cico_list ? create_artificial_label (input_location)
2464 /* Get a tree corresponding to the code for the subprogram. */
2465 start_stmt_group ();
2468 /* See if there are any parameters for which we don't yet have GCC entities.
2469 These must be for Out parameters for which we will be making VAR_DECL
2470 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2471 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2472 the order of the parameters. */
2473 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2474 Present (gnat_param);
2475 gnat_param = Next_Formal_With_Extras (gnat_param))
2476 if (!present_gnu_tree (gnat_param))
2478 /* Skip any entries that have been already filled in; they must
2479 correspond to In Out parameters. */
2480 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2481 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2484 /* Do any needed references for padded types. */
2485 TREE_VALUE (gnu_cico_list)
2486 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2487 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2490 /* On VMS, establish our condition handler to possibly turn a condition into
2491 the corresponding exception if the subprogram has a foreign convention or
2494 To ensure proper execution of local finalizations on condition instances,
2495 we must turn a condition into the corresponding exception even if there
2496 is no applicable Ada handler, and need at least one condition handler per
2497 possible call chain involving GNAT code. OTOH, establishing the handler
2498 has a cost so we want to minimize the number of subprograms into which
2499 this happens. The foreign or exported condition is expected to satisfy
2500 all the constraints. */
2501 if (TARGET_ABI_OPEN_VMS
2502 && (Has_Foreign_Convention (gnat_subprog_id)
2503 || Is_Exported (gnat_subprog_id)))
2504 establish_gnat_vms_condition_handler ();
2506 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2508 /* Generate the code of the subprogram itself. A return statement will be
2509 present and any Out parameters will be handled there. */
2510 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2512 gnu_result = end_stmt_group ();
2514 /* If we populated the parameter attributes cache, we need to make sure
2515 that the cached expressions are evaluated on all possible paths. */
2516 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2519 struct parm_attr_d *pa;
2522 start_stmt_group ();
2524 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2527 add_stmt_with_node (pa->first, gnat_node);
2529 add_stmt_with_node (pa->last, gnat_node);
2531 add_stmt_with_node (pa->length, gnat_node);
2534 add_stmt (gnu_result);
2535 gnu_result = end_stmt_group ();
2538 /* If we are dealing with a return from an Ada procedure with parameters
2539 passed by copy-in/copy-out, we need to return a record containing the
2540 final values of these parameters. If the list contains only one entry,
2541 return just that entry though.
2543 For a full description of the copy-in/copy-out parameter mechanism, see
2544 the part of the gnat_to_gnu_entity routine dealing with the translation
2547 We need to make a block that contains the definition of that label and
2548 the copying of the return value. It first contains the function, then
2549 the label and copy statement. */
2550 if (TREE_VALUE (gnu_return_label_stack))
2554 start_stmt_group ();
2556 add_stmt (gnu_result);
2557 add_stmt (build1 (LABEL_EXPR, void_type_node,
2558 TREE_VALUE (gnu_return_label_stack)));
2560 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2561 if (list_length (gnu_cico_list) == 1)
2562 gnu_retval = TREE_VALUE (gnu_cico_list);
2564 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2567 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
2568 End_Label (Handled_Statement_Sequence (gnat_node)));
2570 gnu_result = end_stmt_group ();
2573 pop_stack (&gnu_return_label_stack);
2575 /* Set the end location. */
2577 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2578 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2579 : Sloc (gnat_node)),
2580 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2582 end_subprog_body (gnu_result);
2584 /* Finally annotate the parameters and disconnect the trees for parameters
2585 that we have turned into variables since they are now unusable. */
2586 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2587 Present (gnat_param);
2588 gnat_param = Next_Formal_With_Extras (gnat_param))
2590 tree gnu_param = get_gnu_tree (gnat_param);
2591 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
2592 DECL_BY_REF_P (gnu_param));
2593 if (TREE_CODE (gnu_param) == VAR_DECL)
2594 save_gnu_tree (gnat_param, NULL_TREE, false);
2597 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2598 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2600 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2603 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2604 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2605 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2606 If GNU_TARGET is non-null, this must be a function call on the RHS of a
2607 N_Assignment_Statement and the result is to be placed into that object. */
2610 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2612 /* The GCC node corresponding to the GNAT subprogram name. This can either
2613 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2614 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2616 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
2617 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2618 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
2619 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
2620 Entity_Id gnat_formal;
2621 Node_Id gnat_actual;
2622 VEC(tree,gc) *gnu_actual_vec = NULL;
2623 tree gnu_name_list = NULL_TREE;
2624 tree gnu_before_list = NULL_TREE;
2625 tree gnu_after_list = NULL_TREE;
2627 bool went_into_elab_proc = false;
2629 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2631 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
2632 all our args first. */
2633 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
2635 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
2636 gnat_node, N_Raise_Program_Error);
2638 for (gnat_actual = First_Actual (gnat_node);
2639 Present (gnat_actual);
2640 gnat_actual = Next_Actual (gnat_actual))
2641 add_stmt (gnat_to_gnu (gnat_actual));
2643 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2645 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2646 return build1 (NULL_EXPR, TREE_TYPE (gnu_subprog_type), call_expr);
2652 /* The only way we can be making a call via an access type is if Name is an
2653 explicit dereference. In that case, get the list of formal args from the
2654 type the access type is pointing to. Otherwise, get the formals from the
2655 entity being called. */
2656 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2657 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2658 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2659 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2660 gnat_formal = Empty;
2662 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2664 /* If we are translating a statement, open a new nesting level that will
2665 surround it to declare the temporaries created for the call. */
2666 if (Nkind (gnat_node) == N_Procedure_Call_Statement || gnu_target)
2668 start_stmt_group ();
2672 /* The lifetime of the temporaries created for the call ends with the call
2673 so we can give them the scope of the elaboration routine at top level. */
2674 else if (!current_function_decl)
2676 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
2677 went_into_elab_proc = true;
2680 /* Create the list of the actual parameters as GCC expects it, namely a
2681 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
2682 is an expression and the TREE_PURPOSE field is null. But skip Out
2683 parameters not passed by reference and that need not be copied in. */
2684 for (gnat_actual = First_Actual (gnat_node);
2685 Present (gnat_actual);
2686 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2687 gnat_actual = Next_Actual (gnat_actual))
2689 tree gnu_formal = present_gnu_tree (gnat_formal)
2690 ? get_gnu_tree (gnat_formal) : NULL_TREE;
2691 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2692 /* In the Out or In Out case, we must suppress conversions that yield
2693 an lvalue but can nevertheless cause the creation of a temporary,
2694 because we need the real object in this case, either to pass its
2695 address if it's passed by reference or as target of the back copy
2696 done after the call if it uses the copy-in copy-out mechanism.
2697 We do it in the In case too, except for an unchecked conversion
2698 because it alone can cause the actual to be misaligned and the
2699 addressability test is applied to the real object. */
2700 bool suppress_type_conversion
2701 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2702 && Ekind (gnat_formal) != E_In_Parameter)
2703 || (Nkind (gnat_actual) == N_Type_Conversion
2704 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2705 Node_Id gnat_name = suppress_type_conversion
2706 ? Expression (gnat_actual) : gnat_actual;
2707 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2710 /* If it's possible we may need to use this expression twice, make sure
2711 that any side-effects are handled via SAVE_EXPRs; likewise if we need
2712 to force side-effects before the call.
2713 ??? This is more conservative than we need since we don't need to do
2714 this for pass-by-ref with no conversion. */
2715 if (Ekind (gnat_formal) != E_In_Parameter)
2716 gnu_name = gnat_stabilize_reference (gnu_name, true, NULL);
2718 /* If we are passing a non-addressable parameter by reference, pass the
2719 address of a copy. In the Out or In Out case, set up to copy back
2720 out after the call. */
2722 && (DECL_BY_REF_P (gnu_formal)
2723 || (TREE_CODE (gnu_formal) == PARM_DECL
2724 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2725 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2726 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2727 && !addressable_p (gnu_name, gnu_name_type))
2729 tree gnu_orig = gnu_name, gnu_temp, gnu_stmt;
2731 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
2732 but sort of an instantiation for them. */
2733 if (TREE_CODE (gnu_name) == CONSTRUCTOR)
2736 /* If the type is passed by reference, a copy is not allowed. */
2737 else if (TREE_ADDRESSABLE (gnu_formal_type))
2738 post_error ("misaligned actual cannot be passed by reference",
2741 /* For users of Starlet we issue a warning because the interface
2742 apparently assumes that by-ref parameters outlive the procedure
2743 invocation. The code still will not work as intended, but we
2744 cannot do much better since low-level parts of the back-end
2745 would allocate temporaries at will because of the misalignment
2746 if we did not do so here. */
2747 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2750 ("?possible violation of implicit assumption", gnat_actual);
2752 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2753 Entity (Name (gnat_node)));
2754 post_error_ne ("?because of misalignment of &", gnat_actual,
2758 /* If the actual type of the object is already the nominal type,
2759 we have nothing to do, except if the size is self-referential
2760 in which case we'll remove the unpadding below. */
2761 if (TREE_TYPE (gnu_name) == gnu_name_type
2762 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2765 /* Otherwise remove the unpadding from all the objects. */
2766 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2767 && TYPE_IS_PADDING_P
2768 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
2769 gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0);
2771 /* Otherwise convert to the nominal type of the object if needed.
2772 There are several cases in which we need to make the temporary
2773 using this type instead of the actual type of the object when
2774 they are distinct, because the expectations of the callee would
2775 otherwise not be met:
2776 - if it's a justified modular type,
2777 - if the actual type is a smaller form of it,
2778 - if it's a smaller form of the actual type. */
2779 else if ((TREE_CODE (gnu_name_type) == RECORD_TYPE
2780 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2781 || smaller_form_type_p (TREE_TYPE (gnu_name),
2783 || (INTEGRAL_TYPE_P (gnu_name_type)
2784 && smaller_form_type_p (gnu_name_type,
2785 TREE_TYPE (gnu_name))))
2786 gnu_name = convert (gnu_name_type, gnu_name);
2788 /* Create an explicit temporary holding the copy. This ensures that
2789 its lifetime is as narrow as possible around a statement. */
2790 gnu_temp = create_var_decl (create_tmp_var_name ("A"), NULL_TREE,
2791 TREE_TYPE (gnu_name), NULL_TREE, false,
2792 false, false, false, NULL, Empty);
2793 DECL_ARTIFICIAL (gnu_temp) = 1;
2794 DECL_IGNORED_P (gnu_temp) = 1;
2796 /* But initialize it on the fly like for an implicit temporary as
2797 we aren't necessarily dealing with a statement. */
2799 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_name);
2800 set_expr_location_from_node (gnu_stmt, gnat_actual);
2802 /* From now on, the real object is the temporary. */
2803 gnu_name = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_name), gnu_stmt,
2806 /* Set up to move the copy back to the original if needed. */
2807 if (Ekind (gnat_formal) != E_In_Parameter)
2809 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig,
2811 set_expr_location_from_node (gnu_stmt, gnat_node);
2812 append_to_statement_list (gnu_stmt, &gnu_after_list);
2816 /* Start from the real object and build the actual. */
2817 gnu_actual = gnu_name;
2819 /* If this was a procedure call, we may not have removed any padding.
2820 So do it here for the part we will use as an input, if any. */
2821 if (Ekind (gnat_formal) != E_Out_Parameter
2822 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2824 = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual);
2826 /* Put back the conversion we suppressed above in the computation of the
2827 real object. And even if we didn't suppress any conversion there, we
2828 may have suppressed a conversion to the Etype of the actual earlier,
2829 since the parent is a procedure call, so put it back here. */
2830 if (suppress_type_conversion
2831 && Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2833 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2834 gnu_actual, No_Truncation (gnat_actual));
2837 = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual);
2839 /* Make sure that the actual is in range of the formal's type. */
2840 if (Ekind (gnat_formal) != E_Out_Parameter
2841 && Do_Range_Check (gnat_actual))
2843 = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual);
2845 /* Unless this is an In parameter, we must remove any justified modular
2846 building from GNU_NAME to get an lvalue. */
2847 if (Ekind (gnat_formal) != E_In_Parameter
2848 && TREE_CODE (gnu_name) == CONSTRUCTOR
2849 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2850 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2852 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name);
2854 /* If we have not saved a GCC object for the formal, it means it is an
2855 Out parameter not passed by reference and that need not be copied in.
2856 Otherwise, first see if the parameter is passed by reference. */
2858 && TREE_CODE (gnu_formal) == PARM_DECL
2859 && DECL_BY_REF_P (gnu_formal))
2861 if (Ekind (gnat_formal) != E_In_Parameter)
2863 /* In Out or Out parameters passed by reference don't use the
2864 copy-in copy-out mechanism so the address of the real object
2865 must be passed to the function. */
2866 gnu_actual = gnu_name;
2868 /* If we have a padded type, be sure we've removed padding. */
2869 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2870 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2873 /* If we have the constructed subtype of an aliased object
2874 with an unconstrained nominal subtype, the type of the
2875 actual includes the template, although it is formally
2876 constrained. So we need to convert it back to the real
2877 constructed subtype to retrieve the constrained part
2878 and takes its address. */
2879 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2880 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2881 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2882 && Is_Array_Type (Etype (gnat_actual)))
2883 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2887 /* There is no need to convert the actual to the formal's type before
2888 taking its address. The only exception is for unconstrained array
2889 types because of the way we build fat pointers. */
2890 else if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE)
2891 gnu_actual = convert (gnu_formal_type, gnu_actual);
2893 /* The symmetry of the paths to the type of an entity is broken here
2894 since arguments don't know that they will be passed by ref. */
2895 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2896 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2899 && TREE_CODE (gnu_formal) == PARM_DECL
2900 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2902 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2903 gnu_actual = maybe_implicit_deref (gnu_actual);
2904 gnu_actual = maybe_unconstrained_array (gnu_actual);
2906 if (TYPE_IS_PADDING_P (gnu_formal_type))
2908 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2909 gnu_actual = convert (gnu_formal_type, gnu_actual);
2912 /* Take the address of the object and convert to the proper pointer
2913 type. We'd like to actually compute the address of the beginning
2914 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2915 possibility that the ARRAY_REF might return a constant and we'd be
2916 getting the wrong address. Neither approach is exactly correct,
2917 but this is the most likely to work in all cases. */
2918 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2921 && TREE_CODE (gnu_formal) == PARM_DECL
2922 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2924 gnu_actual = convert (gnu_formal_type, gnu_actual);
2926 /* If this is 'Null_Parameter, pass a zero descriptor. */
2927 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2928 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2929 && TREE_PRIVATE (gnu_actual))
2931 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
2933 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2934 fill_vms_descriptor (gnu_actual,
2942 if (Ekind (gnat_formal) != E_In_Parameter)
2943 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2945 if (!(gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL))
2947 /* Make sure side-effects are evaluated before the call. */
2948 if (TREE_SIDE_EFFECTS (gnu_name))
2949 append_to_statement_list (gnu_name, &gnu_before_list);
2953 gnu_actual = convert (gnu_formal_type, gnu_actual);
2955 /* If this is 'Null_Parameter, pass a zero even though we are
2956 dereferencing it. */
2957 if (TREE_CODE (gnu_actual) == INDIRECT_REF
2958 && TREE_PRIVATE (gnu_actual)
2959 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
2960 && TREE_CODE (gnu_size) == INTEGER_CST
2961 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
2963 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2964 convert (gnat_type_for_size
2965 (TREE_INT_CST_LOW (gnu_size), 1),
2969 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2972 VEC_safe_push (tree, gc, gnu_actual_vec, gnu_actual);
2975 gnu_call = build_call_list (TREE_TYPE (gnu_subprog_type), gnu_subprog_addr,
2976 nreverse (gnu_actual_list));
2977 set_expr_location_from_node (gnu_call, gnat_node);
2979 /* If it's a function call, the result is the call expression unless a target
2980 is specified, in which case we copy the result into the target and return
2981 the assignment statement. */
2982 if (Nkind (gnat_node) == N_Function_Call)
2984 tree gnu_result = gnu_call;
2986 /* If the function returns an unconstrained array or by direct reference,
2987 we have to dereference the pointer. */
2988 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
2989 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
2990 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2994 Node_Id gnat_parent = Parent (gnat_node);
2995 enum tree_code op_code;
2997 /* If range check is needed, emit code to generate it. */
2998 if (Do_Range_Check (gnat_node))
3000 = emit_range_check (gnu_result, Etype (Name (gnat_parent)),
3003 /* ??? If the return type has non-constant size, then force the
3004 return slot optimization as we would not be able to generate
3005 a temporary. That's what has been done historically. */
3006 if (TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_subprog_type))))
3007 op_code = MODIFY_EXPR;
3009 op_code = INIT_EXPR;
3012 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_result);
3013 add_stmt_with_node (gnu_result, gnat_parent);
3015 gnu_result = end_stmt_group ();
3019 if (went_into_elab_proc)
3020 current_function_decl = NULL_TREE;
3021 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
3027 /* If this is the case where the GNAT tree contains a procedure call but the
3028 Ada procedure has copy-in/copy-out parameters, then the special parameter
3029 passing mechanism must be used. */
3030 if (TYPE_CI_CO_LIST (gnu_subprog_type))
3032 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
3033 copy-out parameters. */
3034 tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
3035 const int length = list_length (gnu_cico_list);
3039 tree gnu_temp, gnu_stmt;
3041 /* The call sequence must contain one and only one call, even though
3042 the function is pure. Save the result into a temporary. */
3043 gnu_temp = create_var_decl (create_tmp_var_name ("R"), NULL_TREE,
3044 TREE_TYPE (gnu_call), NULL_TREE, false,
3045 false, false, false, NULL, Empty);
3046 DECL_ARTIFICIAL (gnu_temp) = 1;
3047 DECL_IGNORED_P (gnu_temp) = 1;
3050 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_call);
3051 set_expr_location_from_node (gnu_stmt, gnat_node);
3053 /* Add the call statement to the list and start from its result. */
3054 append_to_statement_list (gnu_stmt, &gnu_before_list);
3055 gnu_call = gnu_temp;
3057 gnu_name_list = nreverse (gnu_name_list);
3060 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
3061 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
3063 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
3065 for (gnat_actual = First_Actual (gnat_node);
3066 Present (gnat_actual);
3067 gnat_formal = Next_Formal_With_Extras (gnat_formal),
3068 gnat_actual = Next_Actual (gnat_actual))
3069 /* If we are dealing with a copy in copy out parameter, we must
3070 retrieve its value from the record returned in the call. */
3071 if (!(present_gnu_tree (gnat_formal)
3072 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
3073 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
3074 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
3075 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
3076 || (DECL_BY_DESCRIPTOR_P
3077 (get_gnu_tree (gnat_formal))))))))
3078 && Ekind (gnat_formal) != E_In_Parameter)
3080 /* Get the value to assign to this Out or In Out parameter. It is
3081 either the result of the function if there is only a single such
3082 parameter or the appropriate field from the record returned. */
3086 : build_component_ref (gnu_call, NULL_TREE,
3087 TREE_PURPOSE (gnu_cico_list), false);
3089 /* If the actual is a conversion, get the inner expression, which
3090 will be the real destination, and convert the result to the
3091 type of the actual parameter. */
3093 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
3095 /* If the result is a padded type, remove the padding. */
3096 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
3098 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
3101 /* If the actual is a type conversion, the real target object is
3102 denoted by the inner Expression and we need to convert the
3103 result to the associated type.
3104 We also need to convert our gnu assignment target to this type
3105 if the corresponding GNU_NAME was constructed from the GNAT
3106 conversion node and not from the inner Expression. */
3107 if (Nkind (gnat_actual) == N_Type_Conversion)
3110 = convert_with_check
3111 (Etype (Expression (gnat_actual)), gnu_result,
3112 Do_Overflow_Check (gnat_actual),
3113 Do_Range_Check (Expression (gnat_actual)),
3114 Float_Truncate (gnat_actual), gnat_actual);
3116 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
3117 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
3120 /* Unchecked conversions as actuals for Out parameters are not
3121 allowed in user code because they are not variables, but do
3122 occur in front-end expansions. The associated GNU_NAME is
3123 always obtained from the inner expression in such cases. */
3124 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
3125 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
3127 No_Truncation (gnat_actual));
3130 if (Do_Range_Check (gnat_actual))
3132 = emit_range_check (gnu_result, Etype (gnat_actual),
3135 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
3136 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
3137 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
3140 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
3141 gnu_actual, gnu_result);
3142 set_expr_location_from_node (gnu_result, gnat_node);
3143 append_to_statement_list (gnu_result, &gnu_before_list);
3144 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
3145 gnu_name_list = TREE_CHAIN (gnu_name_list);
3149 append_to_statement_list (gnu_call, &gnu_before_list);
3151 append_to_statement_list (gnu_after_list, &gnu_before_list);
3153 add_stmt (gnu_before_list);
3155 return end_stmt_group ();
3158 /* Subroutine of gnat_to_gnu to translate gnat_node, an
3159 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
3162 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
3164 tree gnu_jmpsave_decl = NULL_TREE;
3165 tree gnu_jmpbuf_decl = NULL_TREE;
3166 /* If just annotating, ignore all EH and cleanups. */
3167 bool gcc_zcx = (!type_annotate_only
3168 && Present (Exception_Handlers (gnat_node))
3169 && Exception_Mechanism == Back_End_Exceptions);
3171 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
3172 && Exception_Mechanism == Setjmp_Longjmp);
3173 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
3174 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
3175 tree gnu_inner_block; /* The statement(s) for the block itself. */
3180 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
3181 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
3182 add_cleanup, and when we leave the binding, end_stmt_group will create
3183 the TRY_FINALLY_EXPR.
3185 ??? The region level calls down there have been specifically put in place
3186 for a ZCX context and currently the order in which things are emitted
3187 (region/handlers) is different from the SJLJ case. Instead of putting
3188 other calls with different conditions at other places for the SJLJ case,
3189 it seems cleaner to reorder things for the SJLJ case and generalize the
3190 condition to make it not ZCX specific.
3192 If there are any exceptions or cleanup processing involved, we need an
3193 outer statement group (for Setjmp_Longjmp) and binding level. */
3194 if (binding_for_block)
3196 start_stmt_group ();
3200 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
3201 area for address of previous buffer. Do this first since we need to have
3202 the setjmp buf known for any decls in this block. */
3205 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
3206 NULL_TREE, jmpbuf_ptr_type,
3207 build_call_0_expr (get_jmpbuf_decl),
3208 false, false, false, false, NULL,
3210 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
3212 /* The __builtin_setjmp receivers will immediately reinstall it. Now
3213 because of the unstructured form of EH used by setjmp_longjmp, there
3214 might be forward edges going to __builtin_setjmp receivers on which
3215 it is uninitialized, although they will never be actually taken. */
3216 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
3217 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
3218 NULL_TREE, jmpbuf_type,
3219 NULL_TREE, false, false, false, false,
3221 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
3223 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
3225 /* When we exit this block, restore the saved value. */
3226 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
3227 End_Label (gnat_node));
3230 /* If we are to call a function when exiting this block, add a cleanup
3231 to the binding level we made above. Note that add_cleanup is FIFO
3232 so we must register this cleanup after the EH cleanup just above. */
3234 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
3235 End_Label (gnat_node));
3237 /* Now build the tree for the declarations and statements inside this block.
3238 If this is SJLJ, set our jmp_buf as the current buffer. */
3239 start_stmt_group ();
3242 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3243 build_unary_op (ADDR_EXPR, NULL_TREE,
3246 if (Present (First_Real_Statement (gnat_node)))
3247 process_decls (Statements (gnat_node), Empty,
3248 First_Real_Statement (gnat_node), true, true);
3250 /* Generate code for each statement in the block. */
3251 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3252 ? First_Real_Statement (gnat_node)
3253 : First (Statements (gnat_node)));
3254 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3255 add_stmt (gnat_to_gnu (gnat_temp));
3256 gnu_inner_block = end_stmt_group ();
3258 /* Now generate code for the two exception models, if either is relevant for
3262 tree *gnu_else_ptr = 0;
3265 /* Make a binding level for the exception handling declarations and code
3266 and set up gnu_except_ptr_stack for the handlers to use. */
3267 start_stmt_group ();
3270 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3271 create_var_decl (get_identifier ("EXCEPT_PTR"),
3273 build_pointer_type (except_type_node),
3274 build_call_0_expr (get_excptr_decl), false,
3275 false, false, false, NULL, gnat_node));
3277 /* Generate code for each handler. The N_Exception_Handler case does the
3278 real work and returns a COND_EXPR for each handler, which we chain
3280 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3281 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3283 gnu_expr = gnat_to_gnu (gnat_temp);
3285 /* If this is the first one, set it as the outer one. Otherwise,
3286 point the "else" part of the previous handler to us. Then point
3287 to our "else" part. */
3289 add_stmt (gnu_expr);
3291 *gnu_else_ptr = gnu_expr;
3293 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3296 /* If none of the exception handlers did anything, re-raise but do not
3298 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3299 TREE_VALUE (gnu_except_ptr_stack));
3300 set_expr_location_from_node
3302 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
3305 *gnu_else_ptr = gnu_expr;
3307 add_stmt (gnu_expr);
3309 /* End the binding level dedicated to the exception handlers and get the
3310 whole statement group. */
3311 pop_stack (&gnu_except_ptr_stack);
3313 gnu_handler = end_stmt_group ();
3315 /* If the setjmp returns 1, we restore our incoming longjmp value and
3316 then check the handlers. */
3317 start_stmt_group ();
3318 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3321 add_stmt (gnu_handler);
3322 gnu_handler = end_stmt_group ();
3324 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3325 gnu_result = build3 (COND_EXPR, void_type_node,
3328 build_unary_op (ADDR_EXPR, NULL_TREE,
3330 gnu_handler, gnu_inner_block);
3336 /* First make a block containing the handlers. */
3337 start_stmt_group ();
3338 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3339 Present (gnat_temp);
3340 gnat_temp = Next_Non_Pragma (gnat_temp))
3341 add_stmt (gnat_to_gnu (gnat_temp));
3342 gnu_handlers = end_stmt_group ();
3344 /* Now make the TRY_CATCH_EXPR for the block. */
3345 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3346 gnu_inner_block, gnu_handlers);
3349 gnu_result = gnu_inner_block;
3351 /* Now close our outer block, if we had to make one. */
3352 if (binding_for_block)
3354 add_stmt (gnu_result);
3356 gnu_result = end_stmt_group ();
3362 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3363 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3364 exception handling. */
3367 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3369 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3370 an "if" statement to select the proper exceptions. For "Others", exclude
3371 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3372 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3373 tree gnu_choice = integer_zero_node;
3374 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3377 for (gnat_temp = First (Exception_Choices (gnat_node));
3378 gnat_temp; gnat_temp = Next (gnat_temp))
3382 if (Nkind (gnat_temp) == N_Others_Choice)
3384 if (All_Others (gnat_temp))
3385 this_choice = integer_one_node;
3389 (EQ_EXPR, boolean_type_node,
3394 (INDIRECT_REF, NULL_TREE,
3395 TREE_VALUE (gnu_except_ptr_stack)),
3396 get_identifier ("not_handled_by_others"), NULL_TREE,
3401 else if (Nkind (gnat_temp) == N_Identifier
3402 || Nkind (gnat_temp) == N_Expanded_Name)
3404 Entity_Id gnat_ex_id = Entity (gnat_temp);
3407 /* Exception may be a renaming. Recover original exception which is
3408 the one elaborated and registered. */
3409 if (Present (Renamed_Object (gnat_ex_id)))
3410 gnat_ex_id = Renamed_Object (gnat_ex_id);
3412 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3416 (EQ_EXPR, boolean_type_node, TREE_VALUE (gnu_except_ptr_stack),
3417 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3418 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3420 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3421 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3423 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3426 = build_component_ref
3427 (build_unary_op (INDIRECT_REF, NULL_TREE,
3428 TREE_VALUE (gnu_except_ptr_stack)),
3429 get_identifier ("lang"), NULL_TREE, false);
3433 (TRUTH_ORIF_EXPR, boolean_type_node,
3434 build_binary_op (EQ_EXPR, boolean_type_node, gnu_comp,
3435 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3442 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
3443 gnu_choice, this_choice);
3446 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3449 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3450 to a GCC tree, which is returned. This is the variant for ZCX. */
3453 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3455 tree gnu_etypes_list = NULL_TREE;
3458 tree gnu_current_exc_ptr;
3459 tree gnu_incoming_exc_ptr;
3462 /* We build a TREE_LIST of nodes representing what exception types this
3463 handler can catch, with special cases for others and all others cases.
3465 Each exception type is actually identified by a pointer to the exception
3466 id, or to a dummy object for "others" and "all others". */
3467 for (gnat_temp = First (Exception_Choices (gnat_node));
3468 gnat_temp; gnat_temp = Next (gnat_temp))
3470 if (Nkind (gnat_temp) == N_Others_Choice)
3473 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3476 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3478 else if (Nkind (gnat_temp) == N_Identifier
3479 || Nkind (gnat_temp) == N_Expanded_Name)
3481 Entity_Id gnat_ex_id = Entity (gnat_temp);
3483 /* Exception may be a renaming. Recover original exception which is
3484 the one elaborated and registered. */
3485 if (Present (Renamed_Object (gnat_ex_id)))
3486 gnat_ex_id = Renamed_Object (gnat_ex_id);
3488 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3489 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3491 /* The Non_Ada_Error case for VMS exceptions is handled
3492 by the personality routine. */
3497 /* The GCC interface expects NULL to be passed for catch all handlers, so
3498 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3499 is integer_zero_node. It would not work, however, because GCC's
3500 notion of "catch all" is stronger than our notion of "others". Until
3501 we correctly use the cleanup interface as well, doing that would
3502 prevent the "all others" handlers from being seen, because nothing
3503 can be caught beyond a catch all from GCC's point of view. */
3504 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3507 start_stmt_group ();
3510 /* Expand a call to the begin_handler hook at the beginning of the handler,
3511 and arrange for a call to the end_handler hook to occur on every possible
3514 The hooks expect a pointer to the low level occurrence. This is required
3515 for our stack management scheme because a raise inside the handler pushes
3516 a new occurrence on top of the stack, which means that this top does not
3517 necessarily match the occurrence this handler was dealing with.
3519 __builtin_eh_pointer references the exception occurrence being
3520 propagated. Upon handler entry, this is the exception for which the
3521 handler is triggered. This might not be the case upon handler exit,
3522 however, as we might have a new occurrence propagated by the handler's
3523 body, and the end_handler hook called as a cleanup in this context.
3525 We use a local variable to retrieve the incoming value at handler entry
3526 time, and reuse it to feed the end_handler hook's argument at exit. */
3529 = build_call_expr (built_in_decls [BUILT_IN_EH_POINTER],
3530 1, integer_zero_node);
3531 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3532 ptr_type_node, gnu_current_exc_ptr,
3533 false, false, false, false, NULL,
3536 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3537 gnu_incoming_exc_ptr),
3539 /* ??? We don't seem to have an End_Label at hand to set the location. */
3540 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3542 add_stmt_list (Statements (gnat_node));
3545 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3549 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3552 Compilation_Unit_to_gnu (Node_Id gnat_node)
3554 const Node_Id gnat_unit = Unit (gnat_node);
3555 const bool body_p = (Nkind (gnat_unit) == N_Package_Body
3556 || Nkind (gnat_unit) == N_Subprogram_Body);
3557 const Entity_Id gnat_unit_entity = Defining_Entity (gnat_unit);
3558 /* Make the decl for the elaboration procedure. */
3559 tree gnu_elab_proc_decl
3560 = create_subprog_decl
3561 (create_concat_name (gnat_unit_entity, body_p ? "elabb" : "elabs"),
3562 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL, gnat_unit);
3563 struct elab_info *info;
3565 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3566 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3568 /* Initialize the information structure for the function. */
3569 allocate_struct_function (gnu_elab_proc_decl, false);
3572 current_function_decl = NULL_TREE;
3574 start_stmt_group ();
3577 current_function_decl = NULL_TREE;
3579 start_stmt_group ();
3582 /* For a body, first process the spec if there is one. */
3583 if (Nkind (Unit (gnat_node)) == N_Package_Body
3584 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3585 && !Acts_As_Spec (gnat_node)))
3587 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3588 finalize_from_with_types ();
3591 /* If we can inline, generate code for all the inlined subprograms. */
3594 Entity_Id gnat_entity;
3596 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
3597 Present (gnat_entity);
3598 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
3600 Node_Id gnat_body = Parent (Declaration_Node (gnat_entity));
3602 if (Nkind (gnat_body) != N_Subprogram_Body)
3604 /* ??? This really should always be present. */
3605 if (No (Corresponding_Body (gnat_body)))
3608 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
3611 if (Present (gnat_body))
3613 /* Define the entity first so we set DECL_EXTERNAL. */
3614 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
3615 add_stmt (gnat_to_gnu (gnat_body));
3620 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3622 elaborate_all_entities (gnat_node);
3624 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3625 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3626 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3630 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3632 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3634 /* Process any pragmas and actions following the unit. */
3635 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3636 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3637 finalize_from_with_types ();
3639 /* Save away what we've made so far and record this potential elaboration
3641 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3642 set_current_block_context (gnu_elab_proc_decl);
3644 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3648 &DECL_STRUCT_FUNCTION (gnu_elab_proc_decl)->function_end_locus);
3650 info->next = elab_info_list;
3651 info->elab_proc = gnu_elab_proc_decl;
3652 info->gnat_node = gnat_node;
3653 elab_info_list = info;
3655 /* Generate elaboration code for this unit, if necessary, and say whether
3657 pop_stack (&gnu_elab_proc_stack);
3659 /* Invalidate the global renaming pointers. This is necessary because
3660 stabilization of the renamed entities may create SAVE_EXPRs which
3661 have been tied to a specific elaboration routine just above. */
3662 invalidate_global_renaming_pointers ();
3665 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
3666 as gigi is concerned. This is used to avoid conversions on the LHS. */
3669 unchecked_conversion_nop (Node_Id gnat_node)
3671 Entity_Id from_type, to_type;
3673 /* The conversion must be on the LHS of an assignment or an actual parameter
3674 of a call. Otherwise, even if the conversion was essentially a no-op, it
3675 could de facto ensure type consistency and this should be preserved. */
3676 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3677 && Name (Parent (gnat_node)) == gnat_node)
3678 && !((Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
3679 || Nkind (Parent (gnat_node)) == N_Function_Call)
3680 && Name (Parent (gnat_node)) != gnat_node))
3683 from_type = Etype (Expression (gnat_node));
3685 /* We're interested in artificial conversions generated by the front-end
3686 to make private types explicit, e.g. in Expand_Assign_Array. */
3687 if (!Is_Private_Type (from_type))
3690 from_type = Underlying_Type (from_type);
3691 to_type = Etype (gnat_node);
3693 /* The direct conversion to the underlying type is a no-op. */
3694 if (to_type == from_type)
3697 /* For an array subtype, the conversion to the PAT is a no-op. */
3698 if (Ekind (from_type) == E_Array_Subtype
3699 && to_type == Packed_Array_Type (from_type))
3702 /* For a record subtype, the conversion to the type is a no-op. */
3703 if (Ekind (from_type) == E_Record_Subtype
3704 && to_type == Etype (from_type))
3710 /* This function is the driver of the GNAT to GCC tree transformation process.
3711 It is the entry point of the tree transformer. GNAT_NODE is the root of
3712 some GNAT tree. Return the root of the corresponding GCC tree. If this
3713 is an expression, return the GCC equivalent of the expression. If this
3714 is a statement, return the statement or add it to the current statement
3715 group, in which case anything returned is to be interpreted as occurring
3716 after anything added. */
3719 gnat_to_gnu (Node_Id gnat_node)
3721 const Node_Kind kind = Nkind (gnat_node);
3722 bool went_into_elab_proc = false;
3723 tree gnu_result = error_mark_node; /* Default to no value. */
3724 tree gnu_result_type = void_type_node;
3725 tree gnu_expr, gnu_lhs, gnu_rhs;
3728 /* Save node number for error message and set location information. */
3729 error_gnat_node = gnat_node;
3730 Sloc_to_locus (Sloc (gnat_node), &input_location);
3732 /* If this node is a statement and we are only annotating types, return an
3733 empty statement list. */
3734 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
3735 return alloc_stmt_list ();
3737 /* If this node is a non-static subexpression and we are only annotating
3738 types, make this into a NULL_EXPR. */
3739 if (type_annotate_only
3740 && IN (kind, N_Subexpr)
3741 && kind != N_Identifier
3742 && !Compile_Time_Known_Value (gnat_node))
3743 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3744 build_call_raise (CE_Range_Check_Failed, gnat_node,
3745 N_Raise_Constraint_Error));
3747 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
3748 && kind != N_Null_Statement)
3749 || kind == N_Procedure_Call_Statement
3751 || kind == N_Implicit_Label_Declaration
3752 || kind == N_Handled_Sequence_Of_Statements
3753 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
3755 /* If this is a statement and we are at top level, it must be part of
3756 the elaboration procedure, so mark us as being in that procedure. */
3757 if (!current_function_decl)
3759 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3760 went_into_elab_proc = true;
3763 /* If we are in the elaboration procedure, check if we are violating a
3764 No_Elaboration_Code restriction by having a statement there. Don't
3765 check for a possible No_Elaboration_Code restriction violation on
3766 N_Handled_Sequence_Of_Statements, as we want to signal an error on
3767 every nested real statement instead. This also avoids triggering
3768 spurious errors on dummy (empty) sequences created by the front-end
3769 for package bodies in some cases. */
3770 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3771 && kind != N_Handled_Sequence_Of_Statements)
3772 Check_Elaboration_Code_Allowed (gnat_node);
3777 /********************************/
3778 /* Chapter 2: Lexical Elements */
3779 /********************************/
3782 case N_Expanded_Name:
3783 case N_Operator_Symbol:
3784 case N_Defining_Identifier:
3785 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3788 case N_Integer_Literal:
3792 /* Get the type of the result, looking inside any padding and
3793 justified modular types. Then get the value in that type. */
3794 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3796 if (TREE_CODE (gnu_type) == RECORD_TYPE
3797 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3798 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3800 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3802 /* If the result overflows (meaning it doesn't fit in its base type),
3803 abort. We would like to check that the value is within the range
3804 of the subtype, but that causes problems with subtypes whose usage
3805 will raise Constraint_Error and with biased representation, so
3807 gcc_assert (!TREE_OVERFLOW (gnu_result));
3811 case N_Character_Literal:
3812 /* If a Entity is present, it means that this was one of the
3813 literals in a user-defined character type. In that case,
3814 just return the value in the CONST_DECL. Otherwise, use the
3815 character code. In that case, the base type should be an
3816 INTEGER_TYPE, but we won't bother checking for that. */
3817 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3818 if (Present (Entity (gnat_node)))
3819 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3822 = build_int_cst_type
3823 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3826 case N_Real_Literal:
3827 /* If this is of a fixed-point type, the value we want is the
3828 value of the corresponding integer. */
3829 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3831 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3832 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3834 gcc_assert (!TREE_OVERFLOW (gnu_result));
3837 /* We should never see a Vax_Float type literal, since the front end
3838 is supposed to transform these using appropriate conversions. */
3839 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3844 Ureal ur_realval = Realval (gnat_node);
3846 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3848 /* If the real value is zero, so is the result. Otherwise,
3849 convert it to a machine number if it isn't already. That
3850 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3851 if (UR_Is_Zero (ur_realval))
3852 gnu_result = convert (gnu_result_type, integer_zero_node);
3855 if (!Is_Machine_Number (gnat_node))
3857 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3858 ur_realval, Round_Even, gnat_node);
3861 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3863 /* If we have a base of zero, divide by the denominator.
3864 Otherwise, the base must be 2 and we scale the value, which
3865 we know can fit in the mantissa of the type (hence the use
3866 of that type above). */
3867 if (No (Rbase (ur_realval)))
3869 = build_binary_op (RDIV_EXPR,
3870 get_base_type (gnu_result_type),
3872 UI_To_gnu (Denominator (ur_realval),
3876 REAL_VALUE_TYPE tmp;
3878 gcc_assert (Rbase (ur_realval) == 2);
3879 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3880 - UI_To_Int (Denominator (ur_realval)));
3881 gnu_result = build_real (gnu_result_type, tmp);
3885 /* Now see if we need to negate the result. Do it this way to
3886 properly handle -0. */
3887 if (UR_Is_Negative (Realval (gnat_node)))
3889 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3895 case N_String_Literal:
3896 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3897 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3899 String_Id gnat_string = Strval (gnat_node);
3900 int length = String_Length (gnat_string);
3903 if (length >= ALLOCA_THRESHOLD)
3904 string = XNEWVEC (char, length + 1);
3906 string = (char *) alloca (length + 1);
3908 /* Build the string with the characters in the literal. Note
3909 that Ada strings are 1-origin. */
3910 for (i = 0; i < length; i++)
3911 string[i] = Get_String_Char (gnat_string, i + 1);
3913 /* Put a null at the end of the string in case it's in a context
3914 where GCC will want to treat it as a C string. */
3917 gnu_result = build_string (length, string);
3919 /* Strings in GCC don't normally have types, but we want
3920 this to not be converted to the array type. */
3921 TREE_TYPE (gnu_result) = gnu_result_type;
3923 if (length >= ALLOCA_THRESHOLD)
3928 /* Build a list consisting of each character, then make
3930 String_Id gnat_string = Strval (gnat_node);
3931 int length = String_Length (gnat_string);
3933 tree gnu_list = NULL_TREE;
3934 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3936 for (i = 0; i < length; i++)
3939 = tree_cons (gnu_idx,
3940 build_int_cst (TREE_TYPE (gnu_result_type),
3941 Get_String_Char (gnat_string,
3945 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3950 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3955 gnu_result = Pragma_to_gnu (gnat_node);
3958 /**************************************/
3959 /* Chapter 3: Declarations and Types */
3960 /**************************************/
3962 case N_Subtype_Declaration:
3963 case N_Full_Type_Declaration:
3964 case N_Incomplete_Type_Declaration:
3965 case N_Private_Type_Declaration:
3966 case N_Private_Extension_Declaration:
3967 case N_Task_Type_Declaration:
3968 process_type (Defining_Entity (gnat_node));
3969 gnu_result = alloc_stmt_list ();
3972 case N_Object_Declaration:
3973 case N_Exception_Declaration:
3974 gnat_temp = Defining_Entity (gnat_node);
3975 gnu_result = alloc_stmt_list ();
3977 /* If we are just annotating types and this object has an unconstrained
3978 or task type, don't elaborate it. */
3979 if (type_annotate_only
3980 && (((Is_Array_Type (Etype (gnat_temp))
3981 || Is_Record_Type (Etype (gnat_temp)))
3982 && !Is_Constrained (Etype (gnat_temp)))
3983 || Is_Concurrent_Type (Etype (gnat_temp))))
3986 if (Present (Expression (gnat_node))
3987 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
3988 && (!type_annotate_only
3989 || Compile_Time_Known_Value (Expression (gnat_node))))
3991 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3992 if (Do_Range_Check (Expression (gnat_node)))
3994 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3996 /* If this object has its elaboration delayed, we must force
3997 evaluation of GNU_EXPR right now and save it for when the object
3999 if (Present (Freeze_Node (gnat_temp)))
4001 if ((Is_Public (gnat_temp) || global_bindings_p ())
4002 && !TREE_CONSTANT (gnu_expr))
4004 = create_var_decl (create_concat_name (gnat_temp, "init"),
4005 NULL_TREE, TREE_TYPE (gnu_expr),
4006 gnu_expr, false, Is_Public (gnat_temp),
4007 false, false, NULL, gnat_temp);
4009 gnu_expr = gnat_save_expr (gnu_expr);
4011 save_gnu_tree (gnat_node, gnu_expr, true);
4015 gnu_expr = NULL_TREE;
4017 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
4018 gnu_expr = NULL_TREE;
4020 /* If this is a deferred constant with an address clause, we ignore the
4021 full view since the clause is on the partial view and we cannot have
4022 2 different GCC trees for the object. The only bits of the full view
4023 we will use is the initializer, but it will be directly fetched. */
4024 if (Ekind(gnat_temp) == E_Constant
4025 && Present (Address_Clause (gnat_temp))
4026 && Present (Full_View (gnat_temp)))
4027 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
4029 if (No (Freeze_Node (gnat_temp)))
4030 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
4033 case N_Object_Renaming_Declaration:
4034 gnat_temp = Defining_Entity (gnat_node);
4036 /* Don't do anything if this renaming is handled by the front end or if
4037 we are just annotating types and this object has a composite or task
4038 type, don't elaborate it. We return the result in case it has any
4039 SAVE_EXPRs in it that need to be evaluated here. */
4040 if (!Is_Renaming_Of_Object (gnat_temp)
4041 && ! (type_annotate_only
4042 && (Is_Array_Type (Etype (gnat_temp))
4043 || Is_Record_Type (Etype (gnat_temp))
4044 || Is_Concurrent_Type (Etype (gnat_temp)))))
4046 = gnat_to_gnu_entity (gnat_temp,
4047 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
4049 gnu_result = alloc_stmt_list ();
4052 case N_Implicit_Label_Declaration:
4053 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4054 gnu_result = alloc_stmt_list ();
4057 case N_Exception_Renaming_Declaration:
4058 case N_Number_Declaration:
4059 case N_Package_Renaming_Declaration:
4060 case N_Subprogram_Renaming_Declaration:
4061 /* These are fully handled in the front end. */
4062 gnu_result = alloc_stmt_list ();
4065 /*************************************/
4066 /* Chapter 4: Names and Expressions */
4067 /*************************************/
4069 case N_Explicit_Dereference:
4070 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4071 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4072 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
4075 case N_Indexed_Component:
4077 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
4081 Node_Id *gnat_expr_array;
4083 gnu_array_object = maybe_implicit_deref (gnu_array_object);
4085 /* Convert vector inputs to their representative array type, to fit
4086 what the code below expects. */
4087 gnu_array_object = maybe_vector_array (gnu_array_object);
4089 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
4091 /* If we got a padded type, remove it too. */
4092 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
4094 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
4097 gnu_result = gnu_array_object;
4099 /* First compute the number of dimensions of the array, then
4100 fill the expression array, the order depending on whether
4101 this is a Convention_Fortran array or not. */
4102 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
4103 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
4104 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
4105 ndim++, gnu_type = TREE_TYPE (gnu_type))
4108 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
4110 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
4111 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
4113 i--, gnat_temp = Next (gnat_temp))
4114 gnat_expr_array[i] = gnat_temp;
4116 for (i = 0, gnat_temp = First (Expressions (gnat_node));
4118 i++, gnat_temp = Next (gnat_temp))
4119 gnat_expr_array[i] = gnat_temp;
4121 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
4122 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
4124 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
4125 gnat_temp = gnat_expr_array[i];
4126 gnu_expr = gnat_to_gnu (gnat_temp);
4128 if (Do_Range_Check (gnat_temp))
4131 (gnu_array_object, gnu_expr,
4132 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
4133 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
4136 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
4137 gnu_result, gnu_expr);
4141 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4146 Node_Id gnat_range_node = Discrete_Range (gnat_node);
4149 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4150 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4152 /* Do any implicit dereferences of the prefix and do any needed
4154 gnu_result = maybe_implicit_deref (gnu_result);
4155 gnu_result = maybe_unconstrained_array (gnu_result);
4156 gnu_type = TREE_TYPE (gnu_result);
4157 if (Do_Range_Check (gnat_range_node))
4159 /* Get the bounds of the slice. */
4161 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
4162 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
4163 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
4164 /* Get the permitted bounds. */
4165 tree gnu_base_index_type
4166 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
4167 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4168 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
4169 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4170 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
4171 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
4173 gnu_min_expr = gnat_protect_expr (gnu_min_expr);
4174 gnu_max_expr = gnat_protect_expr (gnu_max_expr);
4176 /* Derive a good type to convert everything to. */
4177 gnu_expr_type = get_base_type (gnu_index_type);
4179 /* Test whether the minimum slice value is too small. */
4180 gnu_expr_l = build_binary_op (LT_EXPR, boolean_type_node,
4181 convert (gnu_expr_type,
4183 convert (gnu_expr_type,
4184 gnu_base_min_expr));
4186 /* Test whether the maximum slice value is too large. */
4187 gnu_expr_h = build_binary_op (GT_EXPR, boolean_type_node,
4188 convert (gnu_expr_type,
4190 convert (gnu_expr_type,
4191 gnu_base_max_expr));
4193 /* Build a slice index check that returns the low bound,
4194 assuming the slice is not empty. */
4195 gnu_expr = emit_check
4196 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
4197 gnu_expr_l, gnu_expr_h),
4198 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
4200 /* Build a conditional expression that does the index checks and
4201 returns the low bound if the slice is not empty (max >= min),
4202 and returns the naked low bound otherwise (max < min), unless
4203 it is non-constant and the high bound is; this prevents VRP
4204 from inferring bogus ranges on the unlikely path. */
4205 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
4206 build_binary_op (GE_EXPR, gnu_expr_type,
4207 convert (gnu_expr_type,
4209 convert (gnu_expr_type,
4212 TREE_CODE (gnu_min_expr) != INTEGER_CST
4213 && TREE_CODE (gnu_max_expr) == INTEGER_CST
4214 ? gnu_max_expr : gnu_min_expr);
4217 /* Simply return the naked low bound. */
4218 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
4220 /* If this is a slice with non-constant size of an array with constant
4221 size, set the maximum size for the allocation of temporaries. */
4222 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
4223 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
4224 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
4226 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
4227 gnu_result, gnu_expr);
4231 case N_Selected_Component:
4233 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
4234 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
4235 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
4238 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
4239 || IN (Ekind (gnat_pref_type), Access_Kind))
4241 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
4242 gnat_pref_type = Underlying_Type (gnat_pref_type);
4243 else if (IN (Ekind (gnat_pref_type), Access_Kind))
4244 gnat_pref_type = Designated_Type (gnat_pref_type);
4247 gnu_prefix = maybe_implicit_deref (gnu_prefix);
4249 /* For discriminant references in tagged types always substitute the
4250 corresponding discriminant as the actual selected component. */
4251 if (Is_Tagged_Type (gnat_pref_type))
4252 while (Present (Corresponding_Discriminant (gnat_field)))
4253 gnat_field = Corresponding_Discriminant (gnat_field);
4255 /* For discriminant references of untagged types always substitute the
4256 corresponding stored discriminant. */
4257 else if (Present (Corresponding_Discriminant (gnat_field)))
4258 gnat_field = Original_Record_Component (gnat_field);
4260 /* Handle extracting the real or imaginary part of a complex.
4261 The real part is the first field and the imaginary the last. */
4262 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
4263 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
4264 ? REALPART_EXPR : IMAGPART_EXPR,
4265 NULL_TREE, gnu_prefix);
4268 gnu_field = gnat_to_gnu_field_decl (gnat_field);
4270 /* If there are discriminants, the prefix might be evaluated more
4271 than once, which is a problem if it has side-effects. */
4272 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
4273 ? Designated_Type (Etype
4274 (Prefix (gnat_node)))
4275 : Etype (Prefix (gnat_node))))
4276 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL);
4279 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
4280 (Nkind (Parent (gnat_node))
4281 == N_Attribute_Reference)
4282 && lvalue_required_for_attribute_p
4283 (Parent (gnat_node)));
4286 gcc_assert (gnu_result);
4287 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4291 case N_Attribute_Reference:
4293 /* The attribute designator. */
4294 const int attr = Get_Attribute_Id (Attribute_Name (gnat_node));
4296 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
4297 is a unit, not an object with a GCC equivalent. */
4298 if (attr == Attr_Elab_Spec || attr == Attr_Elab_Body)
4300 create_subprog_decl (create_concat_name
4301 (Entity (Prefix (gnat_node)),
4302 attr == Attr_Elab_Body ? "elabb" : "elabs"),
4303 NULL_TREE, void_ftype, NULL_TREE, false,
4304 true, true, NULL, gnat_node);
4306 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attr);
4311 /* Like 'Access as far as we are concerned. */
4312 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4313 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4314 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4318 case N_Extension_Aggregate:
4322 /* ??? It is wrong to evaluate the type now, but there doesn't
4323 seem to be any other practical way of doing it. */
4325 gcc_assert (!Expansion_Delayed (gnat_node));
4327 gnu_aggr_type = gnu_result_type
4328 = get_unpadded_type (Etype (gnat_node));
4330 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4331 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4333 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4334 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
4335 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
4337 if (Null_Record_Present (gnat_node))
4338 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4340 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4341 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4343 = assoc_to_constructor (Etype (gnat_node),
4344 First (Component_Associations (gnat_node)),
4346 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4347 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4349 Component_Type (Etype (gnat_node)));
4350 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4353 (COMPLEX_EXPR, gnu_aggr_type,
4354 gnat_to_gnu (Expression (First
4355 (Component_Associations (gnat_node)))),
4356 gnat_to_gnu (Expression
4358 (First (Component_Associations (gnat_node))))));
4362 gnu_result = convert (gnu_result_type, gnu_result);
4367 if (TARGET_VTABLE_USES_DESCRIPTORS
4368 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4369 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4370 gnu_result = null_fdesc_node;
4372 gnu_result = null_pointer_node;
4373 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4376 case N_Type_Conversion:
4377 case N_Qualified_Expression:
4378 /* Get the operand expression. */
4379 gnu_result = gnat_to_gnu (Expression (gnat_node));
4380 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4383 = convert_with_check (Etype (gnat_node), gnu_result,
4384 Do_Overflow_Check (gnat_node),
4385 Do_Range_Check (Expression (gnat_node)),
4386 kind == N_Type_Conversion
4387 && Float_Truncate (gnat_node), gnat_node);
4390 case N_Unchecked_Type_Conversion:
4391 gnu_result = gnat_to_gnu (Expression (gnat_node));
4393 /* Skip further processing if the conversion is deemed a no-op. */
4394 if (unchecked_conversion_nop (gnat_node))
4396 gnu_result_type = TREE_TYPE (gnu_result);
4400 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4402 /* If the result is a pointer type, see if we are improperly
4403 converting to a stricter alignment. */
4404 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4405 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4407 unsigned int align = known_alignment (gnu_result);
4408 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4409 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4411 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4412 post_error_ne_tree_2
4413 ("?source alignment (^) '< alignment of & (^)",
4414 gnat_node, Designated_Type (Etype (gnat_node)),
4415 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4418 /* If we are converting a descriptor to a function pointer, first
4419 build the pointer. */
4420 if (TARGET_VTABLE_USES_DESCRIPTORS
4421 && TREE_TYPE (gnu_result) == fdesc_type_node
4422 && POINTER_TYPE_P (gnu_result_type))
4423 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4425 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4426 No_Truncation (gnat_node));
4432 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
4433 Node_Id gnat_range = Right_Opnd (gnat_node);
4434 tree gnu_low, gnu_high;
4436 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
4438 if (Nkind (gnat_range) == N_Range)
4440 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4441 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4443 else if (Nkind (gnat_range) == N_Identifier
4444 || Nkind (gnat_range) == N_Expanded_Name)
4446 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4448 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4449 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4454 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4456 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
4457 ensure that GNU_OBJ is evaluated only once and perform a full range
4459 if (operand_equal_p (gnu_low, gnu_high, 0))
4461 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
4465 gnu_obj = gnat_protect_expr (gnu_obj);
4466 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
4468 set_expr_location_from_node (t1, gnat_node);
4469 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
4471 set_expr_location_from_node (t2, gnat_node);
4473 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
4476 if (kind == N_Not_In)
4477 gnu_result = invert_truthvalue (gnu_result);
4482 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4483 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4484 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4485 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4487 : (Rounded_Result (gnat_node)
4488 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4489 gnu_result_type, gnu_lhs, gnu_rhs);
4492 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4493 /* These can either be operations on booleans or on modular types.
4494 Fall through for boolean types since that's the way GNU_CODES is
4496 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4497 Modular_Integer_Kind))
4500 = (kind == N_Op_Or ? BIT_IOR_EXPR
4501 : kind == N_Op_And ? BIT_AND_EXPR
4504 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4505 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4506 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4507 gnu_result = build_binary_op (code, gnu_result_type,
4512 /* ... fall through ... */
4514 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4515 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4516 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4517 case N_Op_Mod: case N_Op_Rem:
4518 case N_Op_Rotate_Left:
4519 case N_Op_Rotate_Right:
4520 case N_Op_Shift_Left:
4521 case N_Op_Shift_Right:
4522 case N_Op_Shift_Right_Arithmetic:
4523 case N_And_Then: case N_Or_Else:
4525 enum tree_code code = gnu_codes[kind];
4526 bool ignore_lhs_overflow = false;
4527 location_t saved_location = input_location;
4530 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4531 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4532 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4534 /* Pending generic support for efficient vector logical operations in
4535 GCC, convert vectors to their representative array type view and
4537 gnu_lhs = maybe_vector_array (gnu_lhs);
4538 gnu_rhs = maybe_vector_array (gnu_rhs);
4540 /* If this is a comparison operator, convert any references to
4541 an unconstrained array value into a reference to the
4543 if (TREE_CODE_CLASS (code) == tcc_comparison)
4545 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4546 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4549 /* If the result type is a private type, its full view may be a
4550 numeric subtype. The representation we need is that of its base
4551 type, given that it is the result of an arithmetic operation. */
4552 else if (Is_Private_Type (Etype (gnat_node)))
4553 gnu_type = gnu_result_type
4554 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4556 /* If this is a shift whose count is not guaranteed to be correct,
4557 we need to adjust the shift count. */
4558 if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
4560 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4562 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4564 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
4565 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4566 gnu_rhs, gnu_max_shift);
4567 else if (kind == N_Op_Shift_Right_Arithmetic)
4570 (MIN_EXPR, gnu_count_type,
4571 build_binary_op (MINUS_EXPR,
4574 convert (gnu_count_type,
4579 /* For right shifts, the type says what kind of shift to do,
4580 so we may need to choose a different type. In this case,
4581 we have to ignore integer overflow lest it propagates all
4582 the way down and causes a CE to be explicitly raised. */
4583 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
4585 gnu_type = gnat_unsigned_type (gnu_type);
4586 ignore_lhs_overflow = true;
4588 else if (kind == N_Op_Shift_Right_Arithmetic
4589 && TYPE_UNSIGNED (gnu_type))
4591 gnu_type = gnat_signed_type (gnu_type);
4592 ignore_lhs_overflow = true;
4595 if (gnu_type != gnu_result_type)
4597 tree gnu_old_lhs = gnu_lhs;
4598 gnu_lhs = convert (gnu_type, gnu_lhs);
4599 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4600 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4601 gnu_rhs = convert (gnu_type, gnu_rhs);
4604 /* Instead of expanding overflow checks for addition, subtraction
4605 and multiplication itself, the front end will leave this to
4606 the back end when Backend_Overflow_Checks_On_Target is set.
4607 As the GCC back end itself does not know yet how to properly
4608 do overflow checking, do it here. The goal is to push
4609 the expansions further into the back end over time. */
4610 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4611 && (kind == N_Op_Add
4612 || kind == N_Op_Subtract
4613 || kind == N_Op_Multiply)
4614 && !TYPE_UNSIGNED (gnu_type)
4615 && !FLOAT_TYPE_P (gnu_type))
4616 gnu_result = build_binary_op_trapv (code, gnu_type,
4617 gnu_lhs, gnu_rhs, gnat_node);
4620 /* Some operations, e.g. comparisons of arrays, generate complex
4621 trees that need to be annotated while they are being built. */
4622 input_location = saved_location;
4623 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4626 /* If this is a logical shift with the shift count not verified,
4627 we must return zero if it is too large. We cannot compensate
4628 above in this case. */
4629 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
4630 && !Shift_Count_OK (gnat_node))
4634 build_binary_op (GE_EXPR, boolean_type_node,
4636 convert (TREE_TYPE (gnu_rhs),
4637 TYPE_SIZE (gnu_type))),
4638 convert (gnu_type, integer_zero_node),
4643 case N_Conditional_Expression:
4645 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4646 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4648 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4650 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4652 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
4657 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4658 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4662 /* This case can apply to a boolean or a modular type.
4663 Fall through for a boolean operand since GNU_CODES is set
4664 up to handle this. */
4665 if (Is_Modular_Integer_Type (Etype (gnat_node))
4666 || (Ekind (Etype (gnat_node)) == E_Private_Type
4667 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4669 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4670 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4671 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4676 /* ... fall through ... */
4678 case N_Op_Minus: case N_Op_Abs:
4679 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4681 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4682 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4684 gnu_result_type = get_unpadded_type (Base_Type
4685 (Full_View (Etype (gnat_node))));
4687 if (Do_Overflow_Check (gnat_node)
4688 && !TYPE_UNSIGNED (gnu_result_type)
4689 && !FLOAT_TYPE_P (gnu_result_type))
4691 = build_unary_op_trapv (gnu_codes[kind],
4692 gnu_result_type, gnu_expr, gnat_node);
4694 gnu_result = build_unary_op (gnu_codes[kind],
4695 gnu_result_type, gnu_expr);
4702 bool ignore_init_type = false;
4704 gnat_temp = Expression (gnat_node);
4706 /* The Expression operand can either be an N_Identifier or
4707 Expanded_Name, which must represent a type, or a
4708 N_Qualified_Expression, which contains both the object type and an
4709 initial value for the object. */
4710 if (Nkind (gnat_temp) == N_Identifier
4711 || Nkind (gnat_temp) == N_Expanded_Name)
4712 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4713 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4715 Entity_Id gnat_desig_type
4716 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4718 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4719 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4721 gnu_init = maybe_unconstrained_array (gnu_init);
4722 if (Do_Range_Check (Expression (gnat_temp)))
4724 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4726 if (Is_Elementary_Type (gnat_desig_type)
4727 || Is_Constrained (gnat_desig_type))
4729 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4730 gnu_init = convert (gnu_type, gnu_init);
4734 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4735 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4736 gnu_type = TREE_TYPE (gnu_init);
4738 gnu_init = convert (gnu_type, gnu_init);
4744 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4745 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4746 Procedure_To_Call (gnat_node),
4747 Storage_Pool (gnat_node), gnat_node,
4752 /**************************/
4753 /* Chapter 5: Statements */
4754 /**************************/
4757 gnu_result = build1 (LABEL_EXPR, void_type_node,
4758 gnat_to_gnu (Identifier (gnat_node)));
4761 case N_Null_Statement:
4762 /* When not optimizing, turn null statements from source into gotos to
4763 the next statement that the middle-end knows how to preserve. */
4764 if (!optimize && Comes_From_Source (gnat_node))
4766 tree stmt, label = create_label_decl (NULL_TREE);
4767 start_stmt_group ();
4768 stmt = build1 (GOTO_EXPR, void_type_node, label);
4769 set_expr_location_from_node (stmt, gnat_node);
4771 stmt = build1 (LABEL_EXPR, void_type_node, label);
4772 set_expr_location_from_node (stmt, gnat_node);
4774 gnu_result = end_stmt_group ();
4777 gnu_result = alloc_stmt_list ();
4780 case N_Assignment_Statement:
4781 /* Get the LHS and RHS of the statement and convert any reference to an
4782 unconstrained array into a reference to the underlying array. */
4783 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4785 /* If the type has a size that overflows, convert this into raise of
4786 Storage_Error: execution shouldn't have gotten here anyway. */
4787 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4788 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4789 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4790 N_Raise_Storage_Error);
4791 else if (Nkind (Expression (gnat_node)) == N_Function_Call)
4793 = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs);
4797 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4799 /* If range check is needed, emit code to generate it. */
4800 if (Do_Range_Check (Expression (gnat_node)))
4801 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4805 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4807 /* If the type being assigned is an array type and the two sides are
4808 not completely disjoint, play safe and use memmove. But don't do
4809 it for a bit-packed array as it might not be byte-aligned. */
4810 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4811 && Is_Array_Type (Etype (Name (gnat_node)))
4812 && !Is_Bit_Packed_Array (Etype (Name (gnat_node)))
4813 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4815 tree to, from, size, to_ptr, from_ptr, t;
4817 to = TREE_OPERAND (gnu_result, 0);
4818 from = TREE_OPERAND (gnu_result, 1);
4820 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4821 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4823 to_ptr = build_fold_addr_expr (to);
4824 from_ptr = build_fold_addr_expr (from);
4826 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4827 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4832 case N_If_Statement:
4834 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4836 /* Make the outer COND_EXPR. Avoid non-determinism. */
4837 gnu_result = build3 (COND_EXPR, void_type_node,
4838 gnat_to_gnu (Condition (gnat_node)),
4839 NULL_TREE, NULL_TREE);
4840 COND_EXPR_THEN (gnu_result)
4841 = build_stmt_group (Then_Statements (gnat_node), false);
4842 TREE_SIDE_EFFECTS (gnu_result) = 1;
4843 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4845 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4846 into the previous "else" part and point to where to put any
4847 outer "else". Also avoid non-determinism. */
4848 if (Present (Elsif_Parts (gnat_node)))
4849 for (gnat_temp = First (Elsif_Parts (gnat_node));
4850 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4852 gnu_expr = build3 (COND_EXPR, void_type_node,
4853 gnat_to_gnu (Condition (gnat_temp)),
4854 NULL_TREE, NULL_TREE);
4855 COND_EXPR_THEN (gnu_expr)
4856 = build_stmt_group (Then_Statements (gnat_temp), false);
4857 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4858 set_expr_location_from_node (gnu_expr, gnat_temp);
4859 *gnu_else_ptr = gnu_expr;
4860 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4863 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4867 case N_Case_Statement:
4868 gnu_result = Case_Statement_to_gnu (gnat_node);
4871 case N_Loop_Statement:
4872 gnu_result = Loop_Statement_to_gnu (gnat_node);
4875 case N_Block_Statement:
4876 start_stmt_group ();
4878 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4879 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4881 gnu_result = end_stmt_group ();
4883 if (Present (Identifier (gnat_node)))
4884 mark_out_of_scope (Entity (Identifier (gnat_node)));
4887 case N_Exit_Statement:
4889 = build2 (EXIT_STMT, void_type_node,
4890 (Present (Condition (gnat_node))
4891 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4892 (Present (Name (gnat_node))
4893 ? get_gnu_tree (Entity (Name (gnat_node)))
4894 : TREE_VALUE (gnu_loop_label_stack)));
4897 case N_Return_Statement:
4899 tree gnu_ret_val, gnu_ret_obj;
4901 /* If we have a return label defined, convert this into a branch to
4902 that label. The return proper will be handled elsewhere. */
4903 if (TREE_VALUE (gnu_return_label_stack))
4905 gnu_result = build1 (GOTO_EXPR, void_type_node,
4906 TREE_VALUE (gnu_return_label_stack));
4907 /* When not optimizing, make sure the return is preserved. */
4908 if (!optimize && Comes_From_Source (gnat_node))
4909 DECL_ARTIFICIAL (TREE_VALUE (gnu_return_label_stack)) = 0;
4913 /* If the subprogram is a function, we must return the expression. */
4914 if (Present (Expression (gnat_node)))
4916 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4917 tree gnu_result_decl = DECL_RESULT (current_function_decl);
4918 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4920 /* Do not remove the padding from GNU_RET_VAL if the inner type is
4921 self-referential since we want to allocate the fixed size. */
4922 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4923 && TYPE_IS_PADDING_P
4924 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4925 && CONTAINS_PLACEHOLDER_P
4926 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
4927 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4929 /* If the subprogram returns by direct reference, return a pointer
4930 to the return value. */
4931 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
4932 || By_Ref (gnat_node))
4933 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4935 /* Otherwise, if it returns an unconstrained array, we have to
4936 allocate a new version of the result and return it. */
4937 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
4939 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4940 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
4942 TREE_TYPE (gnu_subprog_type),
4943 Procedure_To_Call (gnat_node),
4944 Storage_Pool (gnat_node),
4948 /* If the subprogram returns by invisible reference, dereference
4949 the pointer it is passed using the type of the return value
4950 and build the copy operation manually. This ensures that we
4951 don't copy too much data, for example if the return type is
4952 unconstrained with a maximum size. */
4953 if (TREE_ADDRESSABLE (gnu_subprog_type))
4956 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4958 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4959 gnu_ret_obj, gnu_ret_val);
4960 add_stmt_with_node (gnu_result, gnat_node);
4961 gnu_ret_val = NULL_TREE;
4962 gnu_ret_obj = gnu_result_decl;
4965 /* Otherwise, build a regular return. */
4967 gnu_ret_obj = gnu_result_decl;
4971 gnu_ret_val = NULL_TREE;
4972 gnu_ret_obj = NULL_TREE;
4975 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
4979 case N_Goto_Statement:
4980 gnu_result = build1 (GOTO_EXPR, void_type_node,
4981 gnat_to_gnu (Name (gnat_node)));
4984 /***************************/
4985 /* Chapter 6: Subprograms */
4986 /***************************/
4988 case N_Subprogram_Declaration:
4989 /* Unless there is a freeze node, declare the subprogram. We consider
4990 this a "definition" even though we're not generating code for
4991 the subprogram because we will be making the corresponding GCC
4994 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4995 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4997 gnu_result = alloc_stmt_list ();
5000 case N_Abstract_Subprogram_Declaration:
5001 /* This subprogram doesn't exist for code generation purposes, but we
5002 have to elaborate the types of any parameters and result, unless
5003 they are imported types (nothing to generate in this case). */
5005 /* Process the parameter types first. */
5008 = First_Formal_With_Extras
5009 (Defining_Entity (Specification (gnat_node)));
5010 Present (gnat_temp);
5011 gnat_temp = Next_Formal_With_Extras (gnat_temp))
5012 if (Is_Itype (Etype (gnat_temp))
5013 && !From_With_Type (Etype (gnat_temp)))
5014 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
5017 /* Then the result type, set to Standard_Void_Type for procedures. */
5020 Entity_Id gnat_temp_type
5021 = Etype (Defining_Entity (Specification (gnat_node)));
5023 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
5024 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
5027 gnu_result = alloc_stmt_list ();
5030 case N_Defining_Program_Unit_Name:
5031 /* For a child unit identifier go up a level to get the specification.
5032 We get this when we try to find the spec of a child unit package
5033 that is the compilation unit being compiled. */
5034 gnu_result = gnat_to_gnu (Parent (gnat_node));
5037 case N_Subprogram_Body:
5038 Subprogram_Body_to_gnu (gnat_node);
5039 gnu_result = alloc_stmt_list ();
5042 case N_Function_Call:
5043 case N_Procedure_Call_Statement:
5044 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
5047 /************************/
5048 /* Chapter 7: Packages */
5049 /************************/
5051 case N_Package_Declaration:
5052 gnu_result = gnat_to_gnu (Specification (gnat_node));
5055 case N_Package_Specification:
5057 start_stmt_group ();
5058 process_decls (Visible_Declarations (gnat_node),
5059 Private_Declarations (gnat_node), Empty, true, true);
5060 gnu_result = end_stmt_group ();
5063 case N_Package_Body:
5065 /* If this is the body of a generic package - do nothing. */
5066 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
5068 gnu_result = alloc_stmt_list ();
5072 start_stmt_group ();
5073 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
5075 if (Present (Handled_Statement_Sequence (gnat_node)))
5076 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
5078 gnu_result = end_stmt_group ();
5081 /********************************/
5082 /* Chapter 8: Visibility Rules */
5083 /********************************/
5085 case N_Use_Package_Clause:
5086 case N_Use_Type_Clause:
5087 /* Nothing to do here - but these may appear in list of declarations. */
5088 gnu_result = alloc_stmt_list ();
5091 /*********************/
5092 /* Chapter 9: Tasks */
5093 /*********************/
5095 case N_Protected_Type_Declaration:
5096 gnu_result = alloc_stmt_list ();
5099 case N_Single_Task_Declaration:
5100 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
5101 gnu_result = alloc_stmt_list ();
5104 /*********************************************************/
5105 /* Chapter 10: Program Structure and Compilation Issues */
5106 /*********************************************************/
5108 case N_Compilation_Unit:
5109 /* This is not called for the main unit on which gigi is invoked. */
5110 Compilation_Unit_to_gnu (gnat_node);
5111 gnu_result = alloc_stmt_list ();
5114 case N_Subprogram_Body_Stub:
5115 case N_Package_Body_Stub:
5116 case N_Protected_Body_Stub:
5117 case N_Task_Body_Stub:
5118 /* Simply process whatever unit is being inserted. */
5119 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
5123 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
5126 /***************************/
5127 /* Chapter 11: Exceptions */
5128 /***************************/
5130 case N_Handled_Sequence_Of_Statements:
5131 /* If there is an At_End procedure attached to this node, and the EH
5132 mechanism is SJLJ, we must have at least a corresponding At_End
5133 handler, unless the No_Exception_Handlers restriction is set. */
5134 gcc_assert (type_annotate_only
5135 || Exception_Mechanism != Setjmp_Longjmp
5136 || No (At_End_Proc (gnat_node))
5137 || Present (Exception_Handlers (gnat_node))
5138 || No_Exception_Handlers_Set ());
5140 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
5143 case N_Exception_Handler:
5144 if (Exception_Mechanism == Setjmp_Longjmp)
5145 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
5146 else if (Exception_Mechanism == Back_End_Exceptions)
5147 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
5153 case N_Push_Constraint_Error_Label:
5154 push_exception_label_stack (&gnu_constraint_error_label_stack,
5155 Exception_Label (gnat_node));
5158 case N_Push_Storage_Error_Label:
5159 push_exception_label_stack (&gnu_storage_error_label_stack,
5160 Exception_Label (gnat_node));
5163 case N_Push_Program_Error_Label:
5164 push_exception_label_stack (&gnu_program_error_label_stack,
5165 Exception_Label (gnat_node));
5168 case N_Pop_Constraint_Error_Label:
5169 gnu_constraint_error_label_stack
5170 = TREE_CHAIN (gnu_constraint_error_label_stack);
5173 case N_Pop_Storage_Error_Label:
5174 gnu_storage_error_label_stack
5175 = TREE_CHAIN (gnu_storage_error_label_stack);
5178 case N_Pop_Program_Error_Label:
5179 gnu_program_error_label_stack
5180 = TREE_CHAIN (gnu_program_error_label_stack);
5183 /******************************/
5184 /* Chapter 12: Generic Units */
5185 /******************************/
5187 case N_Generic_Function_Renaming_Declaration:
5188 case N_Generic_Package_Renaming_Declaration:
5189 case N_Generic_Procedure_Renaming_Declaration:
5190 case N_Generic_Package_Declaration:
5191 case N_Generic_Subprogram_Declaration:
5192 case N_Package_Instantiation:
5193 case N_Procedure_Instantiation:
5194 case N_Function_Instantiation:
5195 /* These nodes can appear on a declaration list but there is nothing to
5196 to be done with them. */
5197 gnu_result = alloc_stmt_list ();
5200 /**************************************************/
5201 /* Chapter 13: Representation Clauses and */
5202 /* Implementation-Dependent Features */
5203 /**************************************************/
5205 case N_Attribute_Definition_Clause:
5206 gnu_result = alloc_stmt_list ();
5208 /* The only one we need to deal with is 'Address since, for the others,
5209 the front-end puts the information elsewhere. */
5210 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
5213 /* And we only deal with 'Address if the object has a Freeze node. */
5214 gnat_temp = Entity (Name (gnat_node));
5215 if (No (Freeze_Node (gnat_temp)))
5218 /* Get the value to use as the address and save it as the equivalent
5219 for the object. When it is frozen, gnat_to_gnu_entity will do the
5221 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
5224 case N_Enumeration_Representation_Clause:
5225 case N_Record_Representation_Clause:
5227 /* We do nothing with these. SEM puts the information elsewhere. */
5228 gnu_result = alloc_stmt_list ();
5231 case N_Code_Statement:
5232 if (!type_annotate_only)
5234 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
5235 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
5236 tree gnu_clobbers = NULL_TREE, tail;
5237 bool allows_mem, allows_reg, fake;
5238 int ninputs, noutputs, i;
5239 const char **oconstraints;
5240 const char *constraint;
5243 /* First retrieve the 3 operand lists built by the front-end. */
5244 Setup_Asm_Outputs (gnat_node);
5245 while (Present (gnat_temp = Asm_Output_Variable ()))
5247 tree gnu_value = gnat_to_gnu (gnat_temp);
5248 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5249 (Asm_Output_Constraint ()));
5251 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
5255 Setup_Asm_Inputs (gnat_node);
5256 while (Present (gnat_temp = Asm_Input_Value ()))
5258 tree gnu_value = gnat_to_gnu (gnat_temp);
5259 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5260 (Asm_Input_Constraint ()));
5262 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
5266 Clobber_Setup (gnat_node);
5267 while ((clobber = Clobber_Get_Next ()))
5269 = tree_cons (NULL_TREE,
5270 build_string (strlen (clobber) + 1, clobber),
5273 /* Then perform some standard checking and processing on the
5274 operands. In particular, mark them addressable if needed. */
5275 gnu_outputs = nreverse (gnu_outputs);
5276 noutputs = list_length (gnu_outputs);
5277 gnu_inputs = nreverse (gnu_inputs);
5278 ninputs = list_length (gnu_inputs);
5280 = (const char **) alloca (noutputs * sizeof (const char *));
5282 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
5284 tree output = TREE_VALUE (tail);
5286 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5287 oconstraints[i] = constraint;
5289 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
5290 &allows_mem, &allows_reg, &fake))
5292 /* If the operand is going to end up in memory,
5293 mark it addressable. Note that we don't test
5294 allows_mem like in the input case below; this
5295 is modelled on the C front-end. */
5297 && !gnat_mark_addressable (output))
5298 output = error_mark_node;
5301 output = error_mark_node;
5303 TREE_VALUE (tail) = output;
5306 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5308 tree input = TREE_VALUE (tail);
5310 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5312 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5314 &allows_mem, &allows_reg))
5316 /* If the operand is going to end up in memory,
5317 mark it addressable. */
5318 if (!allows_reg && allows_mem
5319 && !gnat_mark_addressable (input))
5320 input = error_mark_node;
5323 input = error_mark_node;
5325 TREE_VALUE (tail) = input;
5328 gnu_result = build5 (ASM_EXPR, void_type_node,
5329 gnu_template, gnu_outputs,
5330 gnu_inputs, gnu_clobbers, NULL_TREE);
5331 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5334 gnu_result = alloc_stmt_list ();
5342 case N_Freeze_Entity:
5343 start_stmt_group ();
5344 process_freeze_entity (gnat_node);
5345 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5346 gnu_result = end_stmt_group ();
5349 case N_Itype_Reference:
5350 if (!present_gnu_tree (Itype (gnat_node)))
5351 process_type (Itype (gnat_node));
5353 gnu_result = alloc_stmt_list ();
5356 case N_Free_Statement:
5357 if (!type_annotate_only)
5359 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5360 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5362 tree gnu_actual_obj_type = 0;
5365 /* If this is a thin pointer, we must dereference it to create
5366 a fat pointer, then go back below to a thin pointer. The
5367 reason for this is that we need a fat pointer someplace in
5368 order to properly compute the size. */
5369 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5370 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5371 build_unary_op (INDIRECT_REF, NULL_TREE,
5374 /* If this is an unconstrained array, we know the object must
5375 have been allocated with the template in front of the object.
5376 So pass the template address, but get the total size. Do this
5377 by converting to a thin pointer. */
5378 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5380 = convert (build_pointer_type
5381 (TYPE_OBJECT_RECORD_TYPE
5382 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5385 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5387 if (Present (Actual_Designated_Subtype (gnat_node)))
5390 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5392 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5394 = build_unc_object_type_from_ptr (gnu_ptr_type,
5395 gnu_actual_obj_type,
5400 gnu_actual_obj_type = gnu_obj_type;
5402 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5404 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5405 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5407 tree gnu_char_ptr_type
5408 = build_pointer_type (unsigned_char_type_node);
5409 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5410 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5411 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5416 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
5417 Procedure_To_Call (gnat_node),
5418 Storage_Pool (gnat_node),
5423 case N_Raise_Constraint_Error:
5424 case N_Raise_Program_Error:
5425 case N_Raise_Storage_Error:
5426 if (type_annotate_only)
5428 gnu_result = alloc_stmt_list ();
5432 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5434 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node, kind);
5436 /* If the type is VOID, this is a statement, so we need to
5437 generate the code for the call. Handle a Condition, if there
5439 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5441 set_expr_location_from_node (gnu_result, gnat_node);
5443 if (Present (Condition (gnat_node)))
5444 gnu_result = build3 (COND_EXPR, void_type_node,
5445 gnat_to_gnu (Condition (gnat_node)),
5446 gnu_result, alloc_stmt_list ());
5449 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5452 case N_Validate_Unchecked_Conversion:
5454 Entity_Id gnat_target_type = Target_Type (gnat_node);
5455 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5456 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5458 /* No need for any warning in this case. */
5459 if (!flag_strict_aliasing)
5462 /* If the result is a pointer type, see if we are either converting
5463 from a non-pointer or from a pointer to a type with a different
5464 alias set and warn if so. If the result is defined in the same
5465 unit as this unchecked conversion, we can allow this because we
5466 can know to make the pointer type behave properly. */
5467 else if (POINTER_TYPE_P (gnu_target_type)
5468 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5469 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5471 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5472 ? TREE_TYPE (gnu_source_type)
5474 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5476 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5477 || get_alias_set (gnu_target_desig_type) != 0)
5478 && (!POINTER_TYPE_P (gnu_source_type)
5479 || (TYPE_DUMMY_P (gnu_source_desig_type)
5480 != TYPE_DUMMY_P (gnu_target_desig_type))
5481 || (TYPE_DUMMY_P (gnu_source_desig_type)
5482 && gnu_source_desig_type != gnu_target_desig_type)
5483 || !alias_sets_conflict_p
5484 (get_alias_set (gnu_source_desig_type),
5485 get_alias_set (gnu_target_desig_type))))
5488 ("?possible aliasing problem for type&",
5489 gnat_node, Target_Type (gnat_node));
5491 ("\\?use -fno-strict-aliasing switch for references",
5494 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5495 gnat_node, Target_Type (gnat_node));
5499 /* But if the result is a fat pointer type, we have no mechanism to
5500 do that, so we unconditionally warn in problematic cases. */
5501 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
5503 tree gnu_source_array_type
5504 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
5505 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5507 tree gnu_target_array_type
5508 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5510 if ((TYPE_DUMMY_P (gnu_target_array_type)
5511 || get_alias_set (gnu_target_array_type) != 0)
5512 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
5513 || (TYPE_DUMMY_P (gnu_source_array_type)
5514 != TYPE_DUMMY_P (gnu_target_array_type))
5515 || (TYPE_DUMMY_P (gnu_source_array_type)
5516 && gnu_source_array_type != gnu_target_array_type)
5517 || !alias_sets_conflict_p
5518 (get_alias_set (gnu_source_array_type),
5519 get_alias_set (gnu_target_array_type))))
5522 ("?possible aliasing problem for type&",
5523 gnat_node, Target_Type (gnat_node));
5525 ("\\?use -fno-strict-aliasing switch for references",
5530 gnu_result = alloc_stmt_list ();
5534 /* SCIL nodes require no processing for GCC. Other nodes should only
5535 be present when annotating types. */
5536 gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only);
5537 gnu_result = alloc_stmt_list ();
5540 /* If we pushed the processing of the elaboration routine, pop it back. */
5541 if (went_into_elab_proc)
5542 current_function_decl = NULL_TREE;
5544 /* When not optimizing, turn boolean rvalues B into B != false tests
5545 so that the code just below can put the location information of the
5546 reference to B on the inequality operator for better debug info. */
5548 && (kind == N_Identifier
5549 || kind == N_Expanded_Name
5550 || kind == N_Explicit_Dereference
5551 || kind == N_Function_Call
5552 || kind == N_Indexed_Component
5553 || kind == N_Selected_Component)
5554 && TREE_CODE (get_base_type (gnu_result_type)) == BOOLEAN_TYPE
5555 && !lvalue_required_p (gnat_node, gnu_result_type, false, false, false))
5556 gnu_result = build_binary_op (NE_EXPR, gnu_result_type,
5557 convert (gnu_result_type, gnu_result),
5558 convert (gnu_result_type,
5559 boolean_false_node));
5561 /* Set the location information on the result if it is a real expression.
5562 References can be reused for multiple GNAT nodes and they would get
5563 the location information of their last use. Note that we may have
5564 no result if we tried to build a CALL_EXPR node to a procedure with
5565 no side-effects and optimization is enabled. */
5567 && EXPR_P (gnu_result)
5568 && TREE_CODE (gnu_result) != NOP_EXPR
5569 && !REFERENCE_CLASS_P (gnu_result)
5570 && !EXPR_HAS_LOCATION (gnu_result))
5571 set_expr_location_from_node (gnu_result, gnat_node);
5573 /* If we're supposed to return something of void_type, it means we have
5574 something we're elaborating for effect, so just return. */
5575 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5578 /* If the result is a constant that overflowed, raise Constraint_Error. */
5579 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5581 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5583 = build1 (NULL_EXPR, gnu_result_type,
5584 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5585 N_Raise_Constraint_Error));
5588 /* If our result has side-effects and is of an unconstrained type,
5589 make a SAVE_EXPR so that we can be sure it will only be referenced
5590 once. Note we must do this before any conversions. */
5591 if (TREE_SIDE_EFFECTS (gnu_result)
5592 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5593 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5594 gnu_result = gnat_stabilize_reference (gnu_result, false, NULL);
5596 /* Now convert the result to the result type, unless we are in one of the
5599 1. If this is the Name of an assignment statement or a parameter of
5600 a procedure call, return the result almost unmodified since the
5601 RHS will have to be converted to our type in that case, unless
5602 the result type has a simpler size. Likewise if there is just
5603 a no-op unchecked conversion in-between. Similarly, don't convert
5604 integral types that are the operands of an unchecked conversion
5605 since we need to ignore those conversions (for 'Valid).
5607 2. If we have a label (which doesn't have any well-defined type), a
5608 field or an error, return the result almost unmodified. Also don't
5609 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5610 its size since those are the cases where the front end may have the
5611 type wrong due to "instantiating" the unconstrained record with
5612 discriminant values. Similarly, if the two types are record types
5613 with the same name don't convert. This will be the case when we are
5614 converting from a packable version of a type to its original type and
5615 we need those conversions to be NOPs in order for assignments into
5616 these types to work properly.
5618 3. If the type is void or if we have no result, return error_mark_node
5619 to show we have no result.
5621 4. Finally, if the type of the result is already correct. */
5623 if (Present (Parent (gnat_node))
5624 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5625 && Name (Parent (gnat_node)) == gnat_node)
5626 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5627 && unchecked_conversion_nop (Parent (gnat_node)))
5628 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5629 && Name (Parent (gnat_node)) != gnat_node)
5630 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5631 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5632 && !AGGREGATE_TYPE_P (gnu_result_type)
5633 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5634 && !(TYPE_SIZE (gnu_result_type)
5635 && TYPE_SIZE (TREE_TYPE (gnu_result))
5636 && (AGGREGATE_TYPE_P (gnu_result_type)
5637 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5638 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5639 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5641 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5642 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5643 && (CONTAINS_PLACEHOLDER_P
5644 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5645 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5646 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5648 /* Remove padding only if the inner object is of self-referential
5649 size: in that case it must be an object of unconstrained type
5650 with a default discriminant and we want to avoid copying too
5652 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5653 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5654 (TREE_TYPE (gnu_result))))))
5655 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5659 else if (TREE_CODE (gnu_result) == LABEL_DECL
5660 || TREE_CODE (gnu_result) == FIELD_DECL
5661 || TREE_CODE (gnu_result) == ERROR_MARK
5662 || (TYPE_SIZE (gnu_result_type)
5663 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5664 && TREE_CODE (gnu_result) != INDIRECT_REF
5665 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5666 || ((TYPE_NAME (gnu_result_type)
5667 == TYPE_NAME (TREE_TYPE (gnu_result)))
5668 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5669 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5671 /* Remove any padding. */
5672 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5673 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5677 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5678 gnu_result = error_mark_node;
5680 else if (gnu_result_type != TREE_TYPE (gnu_result))
5681 gnu_result = convert (gnu_result_type, gnu_result);
5683 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5684 while ((TREE_CODE (gnu_result) == NOP_EXPR
5685 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5686 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5687 gnu_result = TREE_OPERAND (gnu_result, 0);
5692 /* Subroutine of above to push the exception label stack. GNU_STACK is
5693 a pointer to the stack to update and GNAT_LABEL, if present, is the
5694 label to push onto the stack. */
5697 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5699 tree gnu_label = (Present (gnat_label)
5700 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5703 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5706 /* Record the current code position in GNAT_NODE. */
5709 record_code_position (Node_Id gnat_node)
5711 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5713 add_stmt_with_node (stmt_stmt, gnat_node);
5714 save_gnu_tree (gnat_node, stmt_stmt, true);
5717 /* Insert the code for GNAT_NODE at the position saved for that node. */
5720 insert_code_for (Node_Id gnat_node)
5722 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5723 save_gnu_tree (gnat_node, NULL_TREE, true);
5726 /* Start a new statement group chained to the previous group. */
5729 start_stmt_group (void)
5731 struct stmt_group *group = stmt_group_free_list;
5733 /* First see if we can get one from the free list. */
5735 stmt_group_free_list = group->previous;
5737 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5739 group->previous = current_stmt_group;
5740 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5741 current_stmt_group = group;
5744 /* Add GNU_STMT to the current statement group. */
5747 add_stmt (tree gnu_stmt)
5749 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5752 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5755 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5757 if (Present (gnat_node))
5758 set_expr_location_from_node (gnu_stmt, gnat_node);
5759 add_stmt (gnu_stmt);
5762 /* Add a declaration statement for GNU_DECL to the current statement group.
5763 Get SLOC from Entity_Id. */
5766 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5768 tree type = TREE_TYPE (gnu_decl);
5769 tree gnu_stmt, gnu_init, t;
5771 /* If this is a variable that Gigi is to ignore, we may have been given
5772 an ERROR_MARK. So test for it. We also might have been given a
5773 reference for a renaming. So only do something for a decl. Also
5774 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5775 if (!DECL_P (gnu_decl)
5776 || (TREE_CODE (gnu_decl) == TYPE_DECL
5777 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5780 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5782 /* If we are global, we don't want to actually output the DECL_EXPR for
5783 this decl since we already have evaluated the expressions in the
5784 sizes and positions as globals and doing it again would be wrong. */
5785 if (global_bindings_p ())
5787 /* Mark everything as used to prevent node sharing with subprograms.
5788 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5789 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5790 MARK_VISITED (gnu_stmt);
5791 if (TREE_CODE (gnu_decl) == VAR_DECL
5792 || TREE_CODE (gnu_decl) == CONST_DECL)
5794 MARK_VISITED (DECL_SIZE (gnu_decl));
5795 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
5796 MARK_VISITED (DECL_INITIAL (gnu_decl));
5798 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5799 else if (TREE_CODE (gnu_decl) == TYPE_DECL
5800 && ((TREE_CODE (type) == RECORD_TYPE
5801 && !TYPE_FAT_POINTER_P (type))
5802 || TREE_CODE (type) == UNION_TYPE
5803 || TREE_CODE (type) == QUAL_UNION_TYPE))
5804 MARK_VISITED (TYPE_ADA_SIZE (type));
5807 add_stmt_with_node (gnu_stmt, gnat_entity);
5809 /* If this is a variable and an initializer is attached to it, it must be
5810 valid for the context. Similar to init_const in create_var_decl_1. */
5811 if (TREE_CODE (gnu_decl) == VAR_DECL
5812 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5813 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5814 || (TREE_STATIC (gnu_decl)
5815 && !initializer_constant_valid_p (gnu_init,
5816 TREE_TYPE (gnu_init)))))
5818 /* If GNU_DECL has a padded type, convert it to the unpadded
5819 type so the assignment is done properly. */
5820 if (TYPE_IS_PADDING_P (type))
5821 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5825 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
5827 DECL_INITIAL (gnu_decl) = NULL_TREE;
5828 if (TREE_READONLY (gnu_decl))
5830 TREE_READONLY (gnu_decl) = 0;
5831 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5834 add_stmt_with_node (gnu_stmt, gnat_entity);
5838 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5841 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5845 if (TREE_VISITED (t))
5848 /* Don't mark a dummy type as visited because we want to mark its sizes
5849 and fields once it's filled in. */
5850 else if (!TYPE_IS_DUMMY_P (t))
5851 TREE_VISITED (t) = 1;
5854 TYPE_SIZES_GIMPLIFIED (t) = 1;
5859 /* Mark nodes rooted at T with TREE_VISITED and types as having their
5860 sized gimplified. We use this to indicate all variable sizes and
5861 positions in global types may not be shared by any subprogram. */
5864 mark_visited (tree t)
5866 walk_tree (&t, mark_visited_r, NULL, NULL);
5869 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5872 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5873 void *data ATTRIBUTE_UNUSED)
5877 if (TREE_CODE (t) == SAVE_EXPR)
5878 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5883 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5884 set its location to that of GNAT_NODE if present. */
5887 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5889 if (Present (gnat_node))
5890 set_expr_location_from_node (gnu_cleanup, gnat_node);
5891 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5894 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5897 set_block_for_group (tree gnu_block)
5899 gcc_assert (!current_stmt_group->block);
5900 current_stmt_group->block = gnu_block;
5903 /* Return code corresponding to the current code group. It is normally
5904 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5905 BLOCK or cleanups were set. */
5908 end_stmt_group (void)
5910 struct stmt_group *group = current_stmt_group;
5911 tree gnu_retval = group->stmt_list;
5913 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5914 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5915 make a BIND_EXPR. Note that we nest in that because the cleanup may
5916 reference variables in the block. */
5917 if (gnu_retval == NULL_TREE)
5918 gnu_retval = alloc_stmt_list ();
5920 if (group->cleanups)
5921 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5924 if (current_stmt_group->block)
5925 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5926 gnu_retval, group->block);
5928 /* Remove this group from the stack and add it to the free list. */
5929 current_stmt_group = group->previous;
5930 group->previous = stmt_group_free_list;
5931 stmt_group_free_list = group;
5936 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5940 add_stmt_list (List_Id gnat_list)
5944 if (Present (gnat_list))
5945 for (gnat_node = First (gnat_list); Present (gnat_node);
5946 gnat_node = Next (gnat_node))
5947 add_stmt (gnat_to_gnu (gnat_node));
5950 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5951 If BINDING_P is true, push and pop a binding level around the list. */
5954 build_stmt_group (List_Id gnat_list, bool binding_p)
5956 start_stmt_group ();
5960 add_stmt_list (gnat_list);
5964 return end_stmt_group ();
5967 /* Push and pop routines for stacks. We keep a free list around so we
5968 don't waste tree nodes. */
5971 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5973 tree gnu_node = gnu_stack_free_list;
5977 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5978 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5979 TREE_PURPOSE (gnu_node) = gnu_purpose;
5980 TREE_VALUE (gnu_node) = gnu_value;
5983 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5985 *gnu_stack_ptr = gnu_node;
5989 pop_stack (tree *gnu_stack_ptr)
5991 tree gnu_node = *gnu_stack_ptr;
5993 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5994 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5995 gnu_stack_free_list = gnu_node;
5998 /* Generate GIMPLE in place for the expression at *EXPR_P. */
6001 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
6002 gimple_seq *post_p ATTRIBUTE_UNUSED)
6004 tree expr = *expr_p;
6007 if (IS_ADA_STMT (expr))
6008 return gnat_gimplify_stmt (expr_p);
6010 switch (TREE_CODE (expr))
6013 /* If this is for a scalar, just make a VAR_DECL for it. If for
6014 an aggregate, get a null pointer of the appropriate type and
6016 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
6017 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
6018 convert (build_pointer_type (TREE_TYPE (expr)),
6019 integer_zero_node));
6022 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
6023 TREE_NO_WARNING (*expr_p) = 1;
6026 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
6029 case UNCONSTRAINED_ARRAY_REF:
6030 /* We should only do this if we are just elaborating for side-effects,
6031 but we can't know that yet. */
6032 *expr_p = TREE_OPERAND (*expr_p, 0);
6036 op = TREE_OPERAND (expr, 0);
6038 if (TREE_CODE (op) == CONSTRUCTOR)
6040 /* If we are taking the address of a constant CONSTRUCTOR, make sure
6041 it is put into static memory. We know it's going to be read-only
6042 given the semantics we have and it must be in static memory when
6043 the reference is in an elaboration procedure. */
6044 if (TREE_CONSTANT (op))
6046 tree addr = build_fold_addr_expr (tree_output_constant_def (op));
6047 *expr_p = fold_convert (TREE_TYPE (expr), addr);
6050 /* Otherwise explicitly create the local temporary. That's required
6051 if the type is passed by reference. */
6054 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
6055 TREE_ADDRESSABLE (new_var) = 1;
6056 gimple_add_tmp_var (new_var);
6058 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
6059 gimplify_and_add (mod, pre_p);
6061 TREE_OPERAND (expr, 0) = new_var;
6062 recompute_tree_invariant_for_addr_expr (expr);
6068 return GS_UNHANDLED;
6071 op = DECL_EXPR_DECL (expr);
6073 /* The expressions for the RM bounds must be gimplified to ensure that
6074 they are properly elaborated. See gimplify_decl_expr. */
6075 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
6076 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
6077 switch (TREE_CODE (TREE_TYPE (op)))
6084 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
6086 val = TYPE_RM_MIN_VALUE (type);
6089 gimplify_one_sizepos (&val, pre_p);
6090 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
6091 SET_TYPE_RM_MIN_VALUE (t, val);
6094 val = TYPE_RM_MAX_VALUE (type);
6097 gimplify_one_sizepos (&val, pre_p);
6098 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
6099 SET_TYPE_RM_MAX_VALUE (t, val);
6109 /* ... fall through ... */
6112 return GS_UNHANDLED;
6116 /* Generate GIMPLE in place for the statement at *STMT_P. */
6118 static enum gimplify_status
6119 gnat_gimplify_stmt (tree *stmt_p)
6121 tree stmt = *stmt_p;
6123 switch (TREE_CODE (stmt))
6126 *stmt_p = STMT_STMT_STMT (stmt);
6131 tree gnu_start_label = create_artificial_label (input_location);
6132 tree gnu_cond = LOOP_STMT_COND (stmt);
6133 tree gnu_update = LOOP_STMT_UPDATE (stmt);
6134 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
6137 /* Build the condition expression from the test, if any. */
6140 = build3 (COND_EXPR, void_type_node, gnu_cond, alloc_stmt_list (),
6141 build1 (GOTO_EXPR, void_type_node, gnu_end_label));
6143 /* Set to emit the statements of the loop. */
6144 *stmt_p = NULL_TREE;
6146 /* We first emit the start label and then a conditional jump to the
6147 end label if there's a top condition, then the update if it's at
6148 the top, then the body of the loop, then a conditional jump to
6149 the end label if there's a bottom condition, then the update if
6150 it's at the bottom, and finally a jump to the start label and the
6151 definition of the end label. */
6152 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6156 if (gnu_cond && !LOOP_STMT_BOTTOM_COND_P (stmt))
6157 append_to_statement_list (gnu_cond, stmt_p);
6159 if (gnu_update && LOOP_STMT_TOP_UPDATE_P (stmt))
6160 append_to_statement_list (gnu_update, stmt_p);
6162 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
6164 if (gnu_cond && LOOP_STMT_BOTTOM_COND_P (stmt))
6165 append_to_statement_list (gnu_cond, stmt_p);
6167 if (gnu_update && !LOOP_STMT_TOP_UPDATE_P (stmt))
6168 append_to_statement_list (gnu_update, stmt_p);
6170 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
6171 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
6172 append_to_statement_list (t, stmt_p);
6174 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6181 /* Build a statement to jump to the corresponding end label, then
6182 see if it needs to be conditional. */
6183 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
6184 if (EXIT_STMT_COND (stmt))
6185 *stmt_p = build3 (COND_EXPR, void_type_node,
6186 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
6194 /* Force references to each of the entities in packages withed by GNAT_NODE.
6195 Operate recursively but check that we aren't elaborating something more
6198 This routine is exclusively called in type_annotate mode, to compute DDA
6199 information for types in withed units, for ASIS use. */
6202 elaborate_all_entities (Node_Id gnat_node)
6204 Entity_Id gnat_with_clause, gnat_entity;
6206 /* Process each unit only once. As we trace the context of all relevant
6207 units transitively, including generic bodies, we may encounter the
6208 same generic unit repeatedly. */
6209 if (!present_gnu_tree (gnat_node))
6210 save_gnu_tree (gnat_node, integer_zero_node, true);
6212 /* Save entities in all context units. A body may have an implicit_with
6213 on its own spec, if the context includes a child unit, so don't save
6215 for (gnat_with_clause = First (Context_Items (gnat_node));
6216 Present (gnat_with_clause);
6217 gnat_with_clause = Next (gnat_with_clause))
6218 if (Nkind (gnat_with_clause) == N_With_Clause
6219 && !present_gnu_tree (Library_Unit (gnat_with_clause))
6220 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
6222 elaborate_all_entities (Library_Unit (gnat_with_clause));
6224 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
6226 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
6227 Present (gnat_entity);
6228 gnat_entity = Next_Entity (gnat_entity))
6229 if (Is_Public (gnat_entity)
6230 && Convention (gnat_entity) != Convention_Intrinsic
6231 && Ekind (gnat_entity) != E_Package
6232 && Ekind (gnat_entity) != E_Package_Body
6233 && Ekind (gnat_entity) != E_Operator
6234 && !(IN (Ekind (gnat_entity), Type_Kind)
6235 && !Is_Frozen (gnat_entity))
6236 && !((Ekind (gnat_entity) == E_Procedure
6237 || Ekind (gnat_entity) == E_Function)
6238 && Is_Intrinsic_Subprogram (gnat_entity))
6239 && !IN (Ekind (gnat_entity), Named_Kind)
6240 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
6241 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6243 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
6246 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
6248 /* Retrieve compilation unit node of generic body. */
6249 while (Present (gnat_body)
6250 && Nkind (gnat_body) != N_Compilation_Unit)
6251 gnat_body = Parent (gnat_body);
6253 /* If body is available, elaborate its context. */
6254 if (Present (gnat_body))
6255 elaborate_all_entities (gnat_body);
6259 if (Nkind (Unit (gnat_node)) == N_Package_Body)
6260 elaborate_all_entities (Library_Unit (gnat_node));
6263 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
6266 process_freeze_entity (Node_Id gnat_node)
6268 const Entity_Id gnat_entity = Entity (gnat_node);
6269 const Entity_Kind kind = Ekind (gnat_entity);
6270 tree gnu_old, gnu_new;
6272 /* If this is a package, we need to generate code for the package. */
6273 if (kind == E_Package)
6276 (Parent (Corresponding_Body
6277 (Parent (Declaration_Node (gnat_entity)))));
6281 /* Don't do anything for class-wide types as they are always transformed
6282 into their root type. */
6283 if (kind == E_Class_Wide_Type)
6286 /* Check for an old definition. This freeze node might be for an Itype. */
6288 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE;
6290 /* If this entity has an address representation clause, GNU_OLD is the
6291 address, so discard it here. */
6292 if (Present (Address_Clause (gnat_entity)))
6293 gnu_old = NULL_TREE;
6295 /* Don't do anything for subprograms that may have been elaborated before
6296 their freeze nodes. This can happen, for example, because of an inner
6297 call in an instance body or because of previous compilation of a spec
6298 for inlining purposes. */
6300 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6301 && (kind == E_Function || kind == E_Procedure))
6302 || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6303 && kind == E_Subprogram_Type)))
6306 /* If we have a non-dummy type old tree, we have nothing to do, except
6307 aborting if this is the public view of a private type whose full view was
6308 not delayed, as this node was never delayed as it should have been. We
6309 let this happen for concurrent types and their Corresponding_Record_Type,
6310 however, because each might legitimately be elaborated before its own
6311 freeze node, e.g. while processing the other. */
6313 && !(TREE_CODE (gnu_old) == TYPE_DECL
6314 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6316 gcc_assert ((IN (kind, Incomplete_Or_Private_Kind)
6317 && Present (Full_View (gnat_entity))
6318 && No (Freeze_Node (Full_View (gnat_entity))))
6319 || Is_Concurrent_Type (gnat_entity)
6320 || (IN (kind, Record_Kind)
6321 && Is_Concurrent_Record_Type (gnat_entity)));
6325 /* Reset the saved tree, if any, and elaborate the object or type for real.
6326 If there is a full view, elaborate it and use the result. And, if this
6327 is the root type of a class-wide type, reuse it for the latter. */
6330 save_gnu_tree (gnat_entity, NULL_TREE, false);
6331 if (IN (kind, Incomplete_Or_Private_Kind)
6332 && Present (Full_View (gnat_entity))
6333 && present_gnu_tree (Full_View (gnat_entity)))
6334 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6335 if (IN (kind, Type_Kind)
6336 && Present (Class_Wide_Type (gnat_entity))
6337 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6338 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6341 if (IN (kind, Incomplete_Or_Private_Kind)
6342 && Present (Full_View (gnat_entity)))
6344 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6346 /* Propagate back-annotations from full view to partial view. */
6347 if (Unknown_Alignment (gnat_entity))
6348 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6350 if (Unknown_Esize (gnat_entity))
6351 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6353 if (Unknown_RM_Size (gnat_entity))
6354 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6356 /* The above call may have defined this entity (the simplest example
6357 of this is when we have a private enumeral type since the bounds
6358 will have the public view). */
6359 if (!present_gnu_tree (gnat_entity))
6360 save_gnu_tree (gnat_entity, gnu_new, false);
6365 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6366 && present_gnu_tree (Declaration_Node (gnat_entity)))
6367 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6369 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6372 if (IN (kind, Type_Kind)
6373 && Present (Class_Wide_Type (gnat_entity))
6374 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6375 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6377 /* If we've made any pointers to the old version of this type, we
6378 have to update them. */
6380 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6381 TREE_TYPE (gnu_new));
6384 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6385 We make two passes, one to elaborate anything other than bodies (but
6386 we declare a function if there was no spec). The second pass
6387 elaborates the bodies.
6389 GNAT_END_LIST gives the element in the list past the end. Normally,
6390 this is Empty, but can be First_Real_Statement for a
6391 Handled_Sequence_Of_Statements.
6393 We make a complete pass through both lists if PASS1P is true, then make
6394 the second pass over both lists if PASS2P is true. The lists usually
6395 correspond to the public and private parts of a package. */
6398 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6399 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6401 List_Id gnat_decl_array[2];
6405 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6408 for (i = 0; i <= 1; i++)
6409 if (Present (gnat_decl_array[i]))
6410 for (gnat_decl = First (gnat_decl_array[i]);
6411 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6413 /* For package specs, we recurse inside the declarations,
6414 thus taking the two pass approach inside the boundary. */
6415 if (Nkind (gnat_decl) == N_Package_Declaration
6416 && (Nkind (Specification (gnat_decl)
6417 == N_Package_Specification)))
6418 process_decls (Visible_Declarations (Specification (gnat_decl)),
6419 Private_Declarations (Specification (gnat_decl)),
6420 Empty, true, false);
6422 /* Similarly for any declarations in the actions of a
6424 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6426 process_freeze_entity (gnat_decl);
6427 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6430 /* Package bodies with freeze nodes get their elaboration deferred
6431 until the freeze node, but the code must be placed in the right
6432 place, so record the code position now. */
6433 else if (Nkind (gnat_decl) == N_Package_Body
6434 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6435 record_code_position (gnat_decl);
6437 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6438 && Present (Library_Unit (gnat_decl))
6439 && Present (Freeze_Node
6442 (Library_Unit (gnat_decl)))))))
6443 record_code_position
6444 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6446 /* We defer most subprogram bodies to the second pass. */
6447 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6449 if (Acts_As_Spec (gnat_decl))
6451 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6453 if (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);
6459 /* For bodies and stubs that act as their own specs, the entity
6460 itself must be elaborated in the first pass, because it may
6461 be used in other declarations. */
6462 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6464 Node_Id gnat_subprog_id
6465 = Defining_Entity (Specification (gnat_decl));
6467 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6468 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6469 && Ekind (gnat_subprog_id) != E_Generic_Function)
6470 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6473 /* Concurrent stubs stand for the corresponding subprogram bodies,
6474 which are deferred like other bodies. */
6475 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6476 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6480 add_stmt (gnat_to_gnu (gnat_decl));
6483 /* Here we elaborate everything we deferred above except for package bodies,
6484 which are elaborated at their freeze nodes. Note that we must also
6485 go inside things (package specs and freeze nodes) the first pass did. */
6487 for (i = 0; i <= 1; i++)
6488 if (Present (gnat_decl_array[i]))
6489 for (gnat_decl = First (gnat_decl_array[i]);
6490 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6492 if (Nkind (gnat_decl) == N_Subprogram_Body
6493 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6494 || Nkind (gnat_decl) == N_Task_Body_Stub
6495 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6496 add_stmt (gnat_to_gnu (gnat_decl));
6498 else if (Nkind (gnat_decl) == N_Package_Declaration
6499 && (Nkind (Specification (gnat_decl)
6500 == N_Package_Specification)))
6501 process_decls (Visible_Declarations (Specification (gnat_decl)),
6502 Private_Declarations (Specification (gnat_decl)),
6503 Empty, false, true);
6505 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6506 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6510 /* Make a unary operation of kind CODE using build_unary_op, but guard
6511 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6512 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6513 the operation is to be performed in that type. GNAT_NODE is the gnat
6514 node conveying the source location for which the error should be
6518 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6521 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6523 operand = gnat_protect_expr (operand);
6525 return emit_check (build_binary_op (EQ_EXPR, boolean_type_node,
6526 operand, TYPE_MIN_VALUE (gnu_type)),
6527 build_unary_op (code, gnu_type, operand),
6528 CE_Overflow_Check_Failed, gnat_node);
6531 /* Make a binary operation of kind CODE using build_binary_op, but guard
6532 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6533 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6534 Usually the operation is to be performed in that type. GNAT_NODE is
6535 the GNAT node conveying the source location for which the error should
6539 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6540 tree right, Node_Id gnat_node)
6542 tree lhs = gnat_protect_expr (left);
6543 tree rhs = gnat_protect_expr (right);
6544 tree type_max = TYPE_MAX_VALUE (gnu_type);
6545 tree type_min = TYPE_MIN_VALUE (gnu_type);
6548 tree zero = convert (gnu_type, integer_zero_node);
6553 int precision = TYPE_PRECISION (gnu_type);
6555 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6557 /* Prefer a constant or known-positive rhs to simplify checks. */
6558 if (!TREE_CONSTANT (rhs)
6559 && commutative_tree_code (code)
6560 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6561 && tree_expr_nonnegative_p (lhs))))
6568 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6569 ? boolean_false_node
6570 : build_binary_op (LT_EXPR, boolean_type_node, rhs, zero);
6572 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6574 /* Try a few strategies that may be cheaper than the general
6575 code at the end of the function, if the rhs is not known.
6577 - Call library function for 64-bit multiplication (complex)
6578 - Widen, if input arguments are sufficiently small
6579 - Determine overflow using wrapped result for addition/subtraction. */
6581 if (!TREE_CONSTANT (rhs))
6583 /* Even for add/subtract double size to get another base type. */
6584 int needed_precision = precision * 2;
6586 if (code == MULT_EXPR && precision == 64)
6588 tree int_64 = gnat_type_for_size (64, 0);
6590 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6591 convert (int_64, lhs),
6592 convert (int_64, rhs)));
6595 else if (needed_precision <= BITS_PER_WORD
6596 || (code == MULT_EXPR
6597 && needed_precision <= LONG_LONG_TYPE_SIZE))
6599 tree wide_type = gnat_type_for_size (needed_precision, 0);
6601 tree wide_result = build_binary_op (code, wide_type,
6602 convert (wide_type, lhs),
6603 convert (wide_type, rhs));
6605 tree check = build_binary_op
6606 (TRUTH_ORIF_EXPR, boolean_type_node,
6607 build_binary_op (LT_EXPR, boolean_type_node, wide_result,
6608 convert (wide_type, type_min)),
6609 build_binary_op (GT_EXPR, boolean_type_node, wide_result,
6610 convert (wide_type, type_max)));
6612 tree result = convert (gnu_type, wide_result);
6615 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6618 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6620 tree unsigned_type = gnat_type_for_size (precision, 1);
6621 tree wrapped_expr = convert
6622 (gnu_type, build_binary_op (code, unsigned_type,
6623 convert (unsigned_type, lhs),
6624 convert (unsigned_type, rhs)));
6626 tree result = convert
6627 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6629 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6630 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6631 tree check = build_binary_op
6632 (TRUTH_XOR_EXPR, boolean_type_node, rhs_lt_zero,
6633 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6634 boolean_type_node, wrapped_expr, lhs));
6637 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6644 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6645 check_pos = build_binary_op (GT_EXPR, boolean_type_node, lhs,
6646 build_binary_op (MINUS_EXPR, gnu_type,
6649 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6650 check_neg = build_binary_op (LT_EXPR, boolean_type_node, lhs,
6651 build_binary_op (MINUS_EXPR, gnu_type,
6656 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6657 check_pos = build_binary_op (LT_EXPR, boolean_type_node, lhs,
6658 build_binary_op (PLUS_EXPR, gnu_type,
6661 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6662 check_neg = build_binary_op (GT_EXPR, boolean_type_node, lhs,
6663 build_binary_op (PLUS_EXPR, gnu_type,
6668 /* The check here is designed to be efficient if the rhs is constant,
6669 but it will work for any rhs by using integer division.
6670 Four different check expressions determine wether X * C overflows,
6673 C > 0 => X > type_max / C || X < type_min / C
6674 C == -1 => X == type_min
6675 C < -1 => X > type_min / C || X < type_max / C */
6677 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6678 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6681 = build_binary_op (TRUTH_ANDIF_EXPR, boolean_type_node,
6682 build_binary_op (NE_EXPR, boolean_type_node, zero,
6684 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6685 build_binary_op (GT_EXPR,
6688 build_binary_op (LT_EXPR,
6693 = fold_build3 (COND_EXPR, boolean_type_node,
6694 build_binary_op (EQ_EXPR, boolean_type_node, rhs,
6695 build_int_cst (gnu_type, -1)),
6696 build_binary_op (EQ_EXPR, boolean_type_node, lhs,
6698 build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6699 build_binary_op (GT_EXPR,
6702 build_binary_op (LT_EXPR,
6711 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6713 /* If we can fold the expression to a constant, just return it.
6714 The caller will deal with overflow, no need to generate a check. */
6715 if (TREE_CONSTANT (gnu_expr))
6718 check = fold_build3 (COND_EXPR, boolean_type_node, rhs_lt_zero, check_neg,
6721 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6724 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6725 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6726 which we have to check. GNAT_NODE is the GNAT node conveying the source
6727 location for which the error should be signaled. */
6730 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6732 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6733 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6734 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6735 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6737 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6738 This can for example happen when translating 'Val or 'Value. */
6739 if (gnu_compare_type == gnu_range_type)
6742 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6743 we can't do anything since we might be truncating the bounds. No
6744 check is needed in this case. */
6745 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6746 && (TYPE_PRECISION (gnu_compare_type)
6747 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6750 /* Checked expressions must be evaluated only once. */
6751 gnu_expr = gnat_protect_expr (gnu_expr);
6753 /* Note that the form of the check is
6754 (not (expr >= lo)) or (not (expr <= hi))
6755 the reason for this slightly convoluted form is that NaNs
6756 are not considered to be in range in the float case. */
6758 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6760 (build_binary_op (GE_EXPR, boolean_type_node,
6761 convert (gnu_compare_type, gnu_expr),
6762 convert (gnu_compare_type, gnu_low))),
6764 (build_binary_op (LE_EXPR, boolean_type_node,
6765 convert (gnu_compare_type, gnu_expr),
6766 convert (gnu_compare_type,
6768 gnu_expr, CE_Range_Check_Failed, gnat_node);
6771 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6772 we are about to index, GNU_EXPR is the index expression to be checked,
6773 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6774 has to be checked. Note that for index checking we cannot simply use the
6775 emit_range_check function (although very similar code needs to be generated
6776 in both cases) since for index checking the array type against which we are
6777 checking the indices may be unconstrained and consequently we need to get
6778 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6779 The place where we need to do that is in subprograms having unconstrained
6780 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6781 location for which the error should be signaled. */
6784 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6785 tree gnu_high, Node_Id gnat_node)
6787 tree gnu_expr_check;
6789 /* Checked expressions must be evaluated only once. */
6790 gnu_expr = gnat_protect_expr (gnu_expr);
6792 /* Must do this computation in the base type in case the expression's
6793 type is an unsigned subtypes. */
6794 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6796 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6797 the object we are handling. */
6798 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6799 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6802 (build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node,
6803 build_binary_op (LT_EXPR, boolean_type_node,
6805 convert (TREE_TYPE (gnu_expr_check),
6807 build_binary_op (GT_EXPR, boolean_type_node,
6809 convert (TREE_TYPE (gnu_expr_check),
6811 gnu_expr, CE_Index_Check_Failed, gnat_node);
6814 /* GNU_COND contains the condition corresponding to an access, discriminant or
6815 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6816 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6817 REASON is the code that says why the exception was raised. GNAT_NODE is
6818 the GNAT node conveying the source location for which the error should be
6822 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6825 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6827 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6828 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6829 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6832 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6833 we don't need to evaluate it just for the check. */
6834 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6839 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6840 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6841 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6842 float to integer conversion with truncation; otherwise round.
6843 GNAT_NODE is the GNAT node conveying the source location for which the
6844 error should be signaled. */
6847 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6848 bool rangep, bool truncatep, Node_Id gnat_node)
6850 tree gnu_type = get_unpadded_type (gnat_type);
6851 tree gnu_in_type = TREE_TYPE (gnu_expr);
6852 tree gnu_in_basetype = get_base_type (gnu_in_type);
6853 tree gnu_base_type = get_base_type (gnu_type);
6854 tree gnu_result = gnu_expr;
6856 /* If we are not doing any checks, the output is an integral type, and
6857 the input is not a floating type, just do the conversion. This
6858 shortcut is required to avoid problems with packed array types
6859 and simplifies code in all cases anyway. */
6860 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6861 && !FLOAT_TYPE_P (gnu_in_type))
6862 return convert (gnu_type, gnu_expr);
6864 /* First convert the expression to its base type. This
6865 will never generate code, but makes the tests below much simpler.
6866 But don't do this if converting from an integer type to an unconstrained
6867 array type since then we need to get the bounds from the original
6869 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6870 gnu_result = convert (gnu_in_basetype, gnu_result);
6872 /* If overflow checks are requested, we need to be sure the result will
6873 fit in the output base type. But don't do this if the input
6874 is integer and the output floating-point. */
6876 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6878 /* Ensure GNU_EXPR only gets evaluated once. */
6879 tree gnu_input = gnat_protect_expr (gnu_result);
6880 tree gnu_cond = integer_zero_node;
6881 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6882 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6883 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6884 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6886 /* Convert the lower bounds to signed types, so we're sure we're
6887 comparing them properly. Likewise, convert the upper bounds
6888 to unsigned types. */
6889 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6890 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6892 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6893 && !TYPE_UNSIGNED (gnu_in_basetype))
6894 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6896 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6897 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6899 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6900 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6902 /* Check each bound separately and only if the result bound
6903 is tighter than the bound on the input type. Note that all the
6904 types are base types, so the bounds must be constant. Also,
6905 the comparison is done in the base type of the input, which
6906 always has the proper signedness. First check for input
6907 integer (which means output integer), output float (which means
6908 both float), or mixed, in which case we always compare.
6909 Note that we have to do the comparison which would *fail* in the
6910 case of an error since if it's an FP comparison and one of the
6911 values is a NaN or Inf, the comparison will fail. */
6912 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6913 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6914 : (FLOAT_TYPE_P (gnu_base_type)
6915 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6916 TREE_REAL_CST (gnu_out_lb))
6920 (build_binary_op (GE_EXPR, boolean_type_node,
6921 gnu_input, convert (gnu_in_basetype,
6924 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6925 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6926 : (FLOAT_TYPE_P (gnu_base_type)
6927 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6928 TREE_REAL_CST (gnu_in_lb))
6931 = build_binary_op (TRUTH_ORIF_EXPR, boolean_type_node, gnu_cond,
6933 (build_binary_op (LE_EXPR, boolean_type_node,
6935 convert (gnu_in_basetype,
6938 if (!integer_zerop (gnu_cond))
6939 gnu_result = emit_check (gnu_cond, gnu_input,
6940 CE_Overflow_Check_Failed, gnat_node);
6943 /* Now convert to the result base type. If this is a non-truncating
6944 float-to-integer conversion, round. */
6945 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6948 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6949 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
6950 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6951 const struct real_format *fmt;
6953 /* The following calculations depend on proper rounding to even
6954 of each arithmetic operation. In order to prevent excess
6955 precision from spoiling this property, use the widest hardware
6956 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6958 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6960 /* FIXME: Should not have padding in the first place. */
6961 if (TYPE_IS_PADDING_P (calc_type))
6962 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6964 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6965 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6966 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6967 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6968 half_minus_pred_half);
6969 gnu_pred_half = build_real (calc_type, pred_half);
6971 /* If the input is strictly negative, subtract this value
6972 and otherwise add it from the input. For 0.5, the result
6973 is exactly between 1.0 and the machine number preceding 1.0
6974 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6975 will round to 1.0, while all other number with an absolute
6976 value less than 0.5 round to 0.0. For larger numbers exactly
6977 halfway between integers, rounding will always be correct as
6978 the true mathematical result will be closer to the higher
6979 integer compared to the lower one. So, this constant works
6980 for all floating-point numbers.
6982 The reason to use the same constant with subtract/add instead
6983 of a positive and negative constant is to allow the comparison
6984 to be scheduled in parallel with retrieval of the constant and
6985 conversion of the input to the calc_type (if necessary). */
6987 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6988 gnu_result = gnat_protect_expr (gnu_result);
6989 gnu_conv = convert (calc_type, gnu_result);
6991 = fold_build2 (GE_EXPR, boolean_type_node, gnu_result, gnu_zero);
6993 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6994 gnu_subtract_pred_half
6995 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6996 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
6997 gnu_add_pred_half, gnu_subtract_pred_half);
7000 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
7001 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
7002 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
7003 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
7005 gnu_result = convert (gnu_base_type, gnu_result);
7007 /* Finally, do the range check if requested. Note that if the result type
7008 is a modular type, the range check is actually an overflow check. */
7010 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
7011 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
7012 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
7014 return convert (gnu_type, gnu_result);
7017 /* Return true if TYPE is a smaller form of ORIG_TYPE. */
7020 smaller_form_type_p (tree type, tree orig_type)
7024 /* We're not interested in variants here. */
7025 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (orig_type))
7028 /* Like a variant, a packable version keeps the original TYPE_NAME. */
7029 if (TYPE_NAME (type) != TYPE_NAME (orig_type))
7032 size = TYPE_SIZE (type);
7033 osize = TYPE_SIZE (orig_type);
7035 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (osize) == INTEGER_CST))
7038 return tree_int_cst_lt (size, osize) != 0;
7041 /* Return true if GNU_EXPR can be directly addressed. This is the case
7042 unless it is an expression involving computation or if it involves a
7043 reference to a bitfield or to an object not sufficiently aligned for
7044 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
7045 be directly addressed as an object of this type.
7047 *** Notes on addressability issues in the Ada compiler ***
7049 This predicate is necessary in order to bridge the gap between Gigi
7050 and the middle-end about addressability of GENERIC trees. A tree
7051 is said to be addressable if it can be directly addressed, i.e. if
7052 its address can be taken, is a multiple of the type's alignment on
7053 strict-alignment architectures and returns the first storage unit
7054 assigned to the object represented by the tree.
7056 In the C family of languages, everything is in practice addressable
7057 at the language level, except for bit-fields. This means that these
7058 compilers will take the address of any tree that doesn't represent
7059 a bit-field reference and expect the result to be the first storage
7060 unit assigned to the object. Even in cases where this will result
7061 in unaligned accesses at run time, nothing is supposed to be done
7062 and the program is considered as erroneous instead (see PR c/18287).
7064 The implicit assumptions made in the middle-end are in keeping with
7065 the C viewpoint described above:
7066 - the address of a bit-field reference is supposed to be never
7067 taken; the compiler (generally) will stop on such a construct,
7068 - any other tree is addressable if it is formally addressable,
7069 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
7071 In Ada, the viewpoint is the opposite one: nothing is addressable
7072 at the language level unless explicitly declared so. This means
7073 that the compiler will both make sure that the trees representing
7074 references to addressable ("aliased" in Ada parlance) objects are
7075 addressable and make no real attempts at ensuring that the trees
7076 representing references to non-addressable objects are addressable.
7078 In the first case, Ada is effectively equivalent to C and handing
7079 down the direct result of applying ADDR_EXPR to these trees to the
7080 middle-end works flawlessly. In the second case, Ada cannot afford
7081 to consider the program as erroneous if the address of trees that
7082 are not addressable is requested for technical reasons, unlike C;
7083 as a consequence, the Ada compiler must arrange for either making
7084 sure that this address is not requested in the middle-end or for
7085 compensating by inserting temporaries if it is requested in Gigi.
7087 The first goal can be achieved because the middle-end should not
7088 request the address of non-addressable trees on its own; the only
7089 exception is for the invocation of low-level block operations like
7090 memcpy, for which the addressability requirements are lower since
7091 the type's alignment can be disregarded. In practice, this means
7092 that Gigi must make sure that such operations cannot be applied to
7093 non-BLKmode bit-fields.
7095 The second goal is achieved by means of the addressable_p predicate
7096 and by inserting SAVE_EXPRs around trees deemed non-addressable.
7097 They will be turned during gimplification into proper temporaries
7098 whose address will be used in lieu of that of the original tree. */
7101 addressable_p (tree gnu_expr, tree gnu_type)
7103 /* For an integral type, the size of the actual type of the object may not
7104 be greater than that of the expected type, otherwise an indirect access
7105 in the latter type wouldn't correctly set all the bits of the object. */
7107 && INTEGRAL_TYPE_P (gnu_type)
7108 && smaller_form_type_p (gnu_type, TREE_TYPE (gnu_expr)))
7111 /* The size of the actual type of the object may not be smaller than that
7112 of the expected type, otherwise an indirect access in the latter type
7113 would be larger than the object. But only record types need to be
7114 considered in practice for this case. */
7116 && TREE_CODE (gnu_type) == RECORD_TYPE
7117 && smaller_form_type_p (TREE_TYPE (gnu_expr), gnu_type))
7120 switch (TREE_CODE (gnu_expr))
7126 /* All DECLs are addressable: if they are in a register, we can force
7130 case UNCONSTRAINED_ARRAY_REF:
7132 /* Taking the address of a dereference yields the original pointer. */
7137 /* Taking the address yields a pointer to the constant pool. */
7141 /* Taking the address of a static constructor yields a pointer to the
7142 tree constant pool. */
7143 return TREE_STATIC (gnu_expr) ? true : false;
7154 /* All rvalues are deemed addressable since taking their address will
7155 force a temporary to be created by the middle-end. */
7159 /* The address of a compound expression is that of its 2nd operand. */
7160 return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type);
7163 /* We accept &COND_EXPR as soon as both operands are addressable and
7164 expect the outcome to be the address of the selected operand. */
7165 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
7166 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
7169 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
7170 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
7171 the field is sufficiently aligned, in case it is subject
7172 to a pragma Component_Alignment. But we don't need to
7173 check the alignment of the containing record, as it is
7174 guaranteed to be not smaller than that of its most
7175 aligned field that is not a bit-field. */
7176 && (!STRICT_ALIGNMENT
7177 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
7178 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
7179 /* The field of a padding record is always addressable. */
7180 || TYPE_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
7181 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7183 case ARRAY_REF: case ARRAY_RANGE_REF:
7184 case REALPART_EXPR: case IMAGPART_EXPR:
7186 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
7189 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
7190 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7192 case VIEW_CONVERT_EXPR:
7194 /* This is addressable if we can avoid a copy. */
7195 tree type = TREE_TYPE (gnu_expr);
7196 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
7197 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
7198 && (!STRICT_ALIGNMENT
7199 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7200 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
7201 || ((TYPE_MODE (type) == BLKmode
7202 || TYPE_MODE (inner_type) == BLKmode)
7203 && (!STRICT_ALIGNMENT
7204 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7205 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
7206 || TYPE_ALIGN_OK (type)
7207 || TYPE_ALIGN_OK (inner_type))))
7208 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7216 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
7217 a separate Freeze node exists, delay the bulk of the processing. Otherwise
7218 make a GCC type for GNAT_ENTITY and set up the correspondence. */
7221 process_type (Entity_Id gnat_entity)
7224 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
7227 /* If we are to delay elaboration of this type, just do any
7228 elaborations needed for expressions within the declaration and
7229 make a dummy type entry for this node and its Full_View (if
7230 any) in case something points to it. Don't do this if it
7231 has already been done (the only way that can happen is if
7232 the private completion is also delayed). */
7233 if (Present (Freeze_Node (gnat_entity))
7234 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7235 && Present (Full_View (gnat_entity))
7236 && Freeze_Node (Full_View (gnat_entity))
7237 && !present_gnu_tree (Full_View (gnat_entity))))
7239 elaborate_entity (gnat_entity);
7243 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
7244 save_gnu_tree (gnat_entity, gnu_decl, false);
7245 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7246 && Present (Full_View (gnat_entity)))
7247 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
7253 /* If we saved away a dummy type for this node it means that this
7254 made the type that corresponds to the full type of an incomplete
7255 type. Clear that type for now and then update the type in the
7259 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
7260 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
7262 save_gnu_tree (gnat_entity, NULL_TREE, false);
7265 /* Now fully elaborate the type. */
7266 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7267 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7269 /* If we have an old type and we've made pointers to this type,
7270 update those pointers. */
7272 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7273 TREE_TYPE (gnu_new));
7275 /* If this is a record type corresponding to a task or protected type
7276 that is a completion of an incomplete type, perform a similar update
7277 on the type. ??? Including protected types here is a guess. */
7278 if (IN (Ekind (gnat_entity), Record_Kind)
7279 && Is_Concurrent_Record_Type (gnat_entity)
7280 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7283 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7285 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7287 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7290 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7291 TREE_TYPE (gnu_new));
7295 /* GNAT_ENTITY is the type of the resulting constructors,
7296 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7297 and GNU_TYPE is the GCC type of the corresponding record.
7299 Return a CONSTRUCTOR to build the record. */
7302 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7304 tree gnu_list, gnu_result;
7306 /* We test for GNU_FIELD being empty in the case where a variant
7307 was the last thing since we don't take things off GNAT_ASSOC in
7308 that case. We check GNAT_ASSOC in case we have a variant, but it
7311 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7312 gnat_assoc = Next (gnat_assoc))
7314 Node_Id gnat_field = First (Choices (gnat_assoc));
7315 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7316 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7318 /* The expander is supposed to put a single component selector name
7319 in every record component association. */
7320 gcc_assert (No (Next (gnat_field)));
7322 /* Ignore fields that have Corresponding_Discriminants since we'll
7323 be setting that field in the parent. */
7324 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7325 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7328 /* Also ignore discriminants of Unchecked_Unions. */
7329 else if (Is_Unchecked_Union (gnat_entity)
7330 && Ekind (Entity (gnat_field)) == E_Discriminant)
7333 /* Before assigning a value in an aggregate make sure range checks
7334 are done if required. Then convert to the type of the field. */
7335 if (Do_Range_Check (Expression (gnat_assoc)))
7336 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7338 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7340 /* Add the field and expression to the list. */
7341 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7344 gnu_result = extract_values (gnu_list, gnu_type);
7346 #ifdef ENABLE_CHECKING
7350 /* Verify every entry in GNU_LIST was used. */
7351 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7352 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7359 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7360 the first element of an array aggregate. It may itself be an aggregate.
7361 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7362 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7363 for range checking. */
7366 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7367 Entity_Id gnat_component_type)
7369 tree gnu_expr_list = NULL_TREE;
7370 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7373 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7375 /* If the expression is itself an array aggregate then first build the
7376 innermost constructor if it is part of our array (multi-dimensional
7378 if (Nkind (gnat_expr) == N_Aggregate
7379 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7380 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7381 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7382 TREE_TYPE (gnu_array_type),
7383 gnat_component_type);
7386 gnu_expr = gnat_to_gnu (gnat_expr);
7388 /* Before assigning the element to the array, make sure it is
7390 if (Do_Range_Check (gnat_expr))
7391 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7395 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7398 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7401 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7404 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7405 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7406 of the associations that are from RECORD_TYPE. If we see an internal
7407 record, make a recursive call to fill it in as well. */
7410 extract_values (tree values, tree record_type)
7412 tree result = NULL_TREE;
7415 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7419 /* _Parent is an internal field, but may have values in the aggregate,
7420 so check for values first. */
7421 if ((tem = purpose_member (field, values)))
7423 value = TREE_VALUE (tem);
7424 TREE_ADDRESSABLE (tem) = 1;
7427 else if (DECL_INTERNAL_P (field))
7429 value = extract_values (values, TREE_TYPE (field));
7430 if (TREE_CODE (value) == CONSTRUCTOR
7431 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7435 /* If we have a record subtype, the names will match, but not the
7436 actual FIELD_DECLs. */
7437 for (tem = values; tem; tem = TREE_CHAIN (tem))
7438 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7440 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7441 TREE_ADDRESSABLE (tem) = 1;
7447 result = tree_cons (field, value, result);
7450 return gnat_build_constructor (record_type, nreverse (result));
7453 /* EXP is to be treated as an array or record. Handle the cases when it is
7454 an access object and perform the required dereferences. */
7457 maybe_implicit_deref (tree exp)
7459 /* If the type is a pointer, dereference it. */
7460 if (POINTER_TYPE_P (TREE_TYPE (exp))
7461 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
7462 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7464 /* If we got a padded type, remove it too. */
7465 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7466 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7471 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7472 location and false if it doesn't. In the former case, set the Gigi global
7473 variable REF_FILENAME to the simple debug file name as given by sinput. */
7476 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7478 if (Sloc == No_Location)
7481 if (Sloc <= Standard_Location)
7483 *locus = BUILTINS_LOCATION;
7488 Source_File_Index file = Get_Source_File_Index (Sloc);
7489 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7490 Column_Number column = Get_Column_Number (Sloc);
7491 struct line_map *map = &line_table->maps[file - 1];
7493 /* Translate the location according to the line-map.h formula. */
7494 *locus = map->start_location
7495 + ((line - map->to_line) << map->column_bits)
7496 + (column & ((1 << map->column_bits) - 1));
7500 = IDENTIFIER_POINTER
7502 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7507 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7508 don't do anything if it doesn't correspond to a source location. */
7511 set_expr_location_from_node (tree node, Node_Id gnat_node)
7515 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7518 SET_EXPR_LOCATION (node, locus);
7521 /* Return a colon-separated list of encodings contained in encoded Ada
7525 extract_encoding (const char *name)
7527 char *encoding = GGC_NEWVEC (char, strlen (name));
7528 get_encoding (name, encoding);
7532 /* Extract the Ada name from an encoded name. */
7535 decode_name (const char *name)
7537 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7538 __gnat_decode (name, decoded, 0);
7542 /* Post an error message. MSG is the error message, properly annotated.
7543 NODE is the node at which to post the error and the node to use for the
7544 '&' substitution. */
7547 post_error (const char *msg, Node_Id node)
7549 String_Template temp;
7552 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7553 fp.Array = msg, fp.Bounds = &temp;
7555 Error_Msg_N (fp, node);
7558 /* Similar to post_error, but NODE is the node at which to post the error and
7559 ENT is the node to use for the '&' substitution. */
7562 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7564 String_Template temp;
7567 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7568 fp.Array = msg, fp.Bounds = &temp;
7570 Error_Msg_NE (fp, node, ent);
7573 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
7576 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int num)
7578 Error_Msg_Uint_1 = UI_From_Int (num);
7579 post_error_ne (msg, node, ent);
7582 /* Similar to post_error_ne, but T is a GCC tree representing the number to
7583 write. If T represents a constant, the text inside curly brackets in
7584 MSG will be output (presumably including a '^'). Otherwise it will not
7585 be output and the text inside square brackets will be output instead. */
7588 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7590 char *new_msg = XALLOCAVEC (char, strlen (msg) + 1);
7591 char start_yes, end_yes, start_no, end_no;
7595 if (TREE_CODE (t) == INTEGER_CST)
7597 Error_Msg_Uint_1 = UI_From_gnu (t);
7598 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7601 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7603 for (p = msg, q = new_msg; *p; p++)
7605 if (*p == start_yes)
7606 for (p++; *p != end_yes; p++)
7608 else if (*p == start_no)
7609 for (p++; *p != end_no; p++)
7617 post_error_ne (new_msg, node, ent);
7620 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
7623 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7626 Error_Msg_Uint_2 = UI_From_Int (num);
7627 post_error_ne_tree (msg, node, ent, t);
7630 /* Initialize the table that maps GNAT codes to GCC codes for simple
7631 binary and unary operations. */
7634 init_code_table (void)
7636 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7637 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7639 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7640 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7641 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7642 gnu_codes[N_Op_Eq] = EQ_EXPR;
7643 gnu_codes[N_Op_Ne] = NE_EXPR;
7644 gnu_codes[N_Op_Lt] = LT_EXPR;
7645 gnu_codes[N_Op_Le] = LE_EXPR;
7646 gnu_codes[N_Op_Gt] = GT_EXPR;
7647 gnu_codes[N_Op_Ge] = GE_EXPR;
7648 gnu_codes[N_Op_Add] = PLUS_EXPR;
7649 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7650 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7651 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7652 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7653 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7654 gnu_codes[N_Op_Abs] = ABS_EXPR;
7655 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7656 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7657 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7658 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7659 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7660 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7663 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7667 get_exception_label (char kind)
7669 if (kind == N_Raise_Constraint_Error)
7670 return TREE_VALUE (gnu_constraint_error_label_stack);
7671 else if (kind == N_Raise_Storage_Error)
7672 return TREE_VALUE (gnu_storage_error_label_stack);
7673 else if (kind == N_Raise_Program_Error)
7674 return TREE_VALUE (gnu_program_error_label_stack);
7679 #include "gt-ada-trans.h"