1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2009, 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"
42 #include "tree-iterator.h"
59 #include "adadecode.h"
61 #include "dwarf2out.h"
63 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
64 for fear of running out of stack space. If we need more, we use xmalloc
66 #define ALLOCA_THRESHOLD 1000
68 /* Let code below know whether we are targetting VMS without need of
69 intrusive preprocessor directives. */
70 #ifndef TARGET_ABI_OPEN_VMS
71 #define TARGET_ABI_OPEN_VMS 0
74 /* For efficient float-to-int rounding, it is necessary to know whether
75 floating-point arithmetic may use wider intermediate results. When
76 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
77 that arithmetic does not widen if double precision is emulated. */
78 #ifndef FP_ARITH_MAY_WIDEN
79 #if defined(HAVE_extendsfdf2)
80 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
82 #define FP_ARITH_MAY_WIDEN 0
86 extern char *__gnat_to_canonical_file_spec (char *);
91 struct Node *Nodes_Ptr;
92 Node_Id *Next_Node_Ptr;
93 Node_Id *Prev_Node_Ptr;
94 struct Elist_Header *Elists_Ptr;
95 struct Elmt_Item *Elmts_Ptr;
96 struct String_Entry *Strings_Ptr;
97 Char_Code *String_Chars_Ptr;
98 struct List_Header *List_Headers_Ptr;
100 /* Current filename without path. */
101 const char *ref_filename;
103 /* True when gigi is being called on an analyzed but unexpanded
104 tree, and the only purpose of the call is to properly annotate
105 types with representation information. */
106 bool type_annotate_only;
108 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
109 of unconstrained array IN parameters to avoid emitting a great deal of
110 redundant instructions to recompute them each time. */
111 struct parm_attr GTY (())
113 int id; /* GTY doesn't like Entity_Id. */
120 typedef struct parm_attr *parm_attr;
122 DEF_VEC_P(parm_attr);
123 DEF_VEC_ALLOC_P(parm_attr,gc);
125 struct language_function GTY(())
127 VEC(parm_attr,gc) *parm_attr_cache;
130 #define f_parm_attr_cache \
131 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
133 /* A structure used to gather together information about a statement group.
134 We use this to gather related statements, for example the "then" part
135 of a IF. In the case where it represents a lexical scope, we may also
136 have a BLOCK node corresponding to it and/or cleanups. */
138 struct stmt_group GTY((chain_next ("%h.previous"))) {
139 struct stmt_group *previous; /* Previous code group. */
140 tree stmt_list; /* List of statements for this code group. */
141 tree block; /* BLOCK for this code group, if any. */
142 tree cleanups; /* Cleanups for this code group, if any. */
145 static GTY(()) struct stmt_group *current_stmt_group;
147 /* List of unused struct stmt_group nodes. */
148 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
150 /* A structure used to record information on elaboration procedures
151 we've made and need to process.
153 ??? gnat_node should be Node_Id, but gengtype gets confused. */
155 struct elab_info GTY((chain_next ("%h.next"))) {
156 struct elab_info *next; /* Pointer to next in chain. */
157 tree elab_proc; /* Elaboration procedure. */
158 int gnat_node; /* The N_Compilation_Unit. */
161 static GTY(()) struct elab_info *elab_info_list;
163 /* Free list of TREE_LIST nodes used for stacks. */
164 static GTY((deletable)) tree gnu_stack_free_list;
166 /* List of TREE_LIST nodes representing a stack of exception pointer
167 variables. TREE_VALUE is the VAR_DECL that stores the address of
168 the raised exception. Nonzero means we are in an exception
169 handler. Not used in the zero-cost case. */
170 static GTY(()) tree gnu_except_ptr_stack;
172 /* List of TREE_LIST nodes used to store the current elaboration procedure
173 decl. TREE_VALUE is the decl. */
174 static GTY(()) tree gnu_elab_proc_stack;
176 /* Variable that stores a list of labels to be used as a goto target instead of
177 a return in some functions. See processing for N_Subprogram_Body. */
178 static GTY(()) tree gnu_return_label_stack;
180 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
181 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
182 static GTY(()) tree gnu_loop_label_stack;
184 /* List of TREE_LIST nodes representing labels for switch statements.
185 TREE_VALUE of each entry is the label at the end of the switch. */
186 static GTY(()) tree gnu_switch_label_stack;
188 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
189 static GTY(()) tree gnu_constraint_error_label_stack;
190 static GTY(()) tree gnu_storage_error_label_stack;
191 static GTY(()) tree gnu_program_error_label_stack;
193 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
194 static enum tree_code gnu_codes[Number_Node_Kinds];
196 /* Current node being treated, in case abort called. */
197 Node_Id error_gnat_node;
199 static void init_code_table (void);
200 static void Compilation_Unit_to_gnu (Node_Id);
201 static void record_code_position (Node_Id);
202 static void insert_code_for (Node_Id);
203 static void add_cleanup (tree, Node_Id);
204 static tree unshare_save_expr (tree *, int *, void *);
205 static void add_stmt_list (List_Id);
206 static void push_exception_label_stack (tree *, Entity_Id);
207 static tree build_stmt_group (List_Id, bool);
208 static void push_stack (tree *, tree, tree);
209 static void pop_stack (tree *);
210 static enum gimplify_status gnat_gimplify_stmt (tree *);
211 static void elaborate_all_entities (Node_Id);
212 static void process_freeze_entity (Node_Id);
213 static void process_inlined_subprograms (Node_Id);
214 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
215 static tree emit_range_check (tree, Node_Id, Node_Id);
216 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
217 static tree emit_check (tree, tree, int, Node_Id);
218 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
219 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
220 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
221 static bool smaller_packable_type_p (tree, tree);
222 static bool addressable_p (tree, tree);
223 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
224 static tree extract_values (tree, tree);
225 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
226 static tree maybe_implicit_deref (tree);
227 static tree gnat_stabilize_reference (tree, bool);
228 static tree gnat_stabilize_reference_1 (tree, bool);
229 static void set_expr_location_from_node (tree, Node_Id);
230 static int lvalue_required_p (Node_Id, tree, int);
232 /* Hooks for debug info back-ends, only supported and used in a restricted set
233 of configurations. */
234 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
235 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
237 /* This is the main program of the back-end. It sets up all the table
238 structures and then generates code. */
241 gigi (Node_Id gnat_root, int max_gnat_node, int number_name,
242 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
243 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
244 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
245 struct List_Header *list_headers_ptr, Nat number_file,
246 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
247 Entity_Id standard_integer, Entity_Id standard_long_long_float,
248 Entity_Id standard_exception_type, Int gigi_operating_mode)
250 Entity_Id gnat_literal;
251 tree long_long_float_type, exception_type, t;
252 tree int64_type = gnat_type_for_size (64, 0);
253 struct elab_info *info;
256 max_gnat_nodes = max_gnat_node;
257 number_names = number_name;
258 number_files = number_file;
259 Nodes_Ptr = nodes_ptr;
260 Next_Node_Ptr = next_node_ptr;
261 Prev_Node_Ptr = prev_node_ptr;
262 Elists_Ptr = elists_ptr;
263 Elmts_Ptr = elmts_ptr;
264 Strings_Ptr = strings_ptr;
265 String_Chars_Ptr = string_chars_ptr;
266 List_Headers_Ptr = list_headers_ptr;
268 type_annotate_only = (gigi_operating_mode == 1);
270 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
272 /* Declare the name of the compilation unit as the first global
273 name in order to make the middle-end fully deterministic. */
274 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
275 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
277 for (i = 0; i < number_files; i++)
279 /* Use the identifier table to make a permanent copy of the filename as
280 the name table gets reallocated after Gigi returns but before all the
281 debugging information is output. The __gnat_to_canonical_file_spec
282 call translates filenames from pragmas Source_Reference that contain
283 host style syntax not understood by gdb. */
287 (__gnat_to_canonical_file_spec
288 (Get_Name_String (file_info_ptr[i].File_Name))));
290 /* We rely on the order isomorphism between files and line maps. */
291 gcc_assert ((int) line_table->used == i);
293 /* We create the line map for a source file at once, with a fixed number
294 of columns chosen to avoid jumping over the next power of 2. */
295 linemap_add (line_table, LC_ENTER, 0, filename, 1);
296 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
297 linemap_position_for_column (line_table, 252 - 1);
298 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
301 /* Initialize ourselves. */
304 gnat_compute_largest_alignment ();
307 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
309 if (type_annotate_only)
311 TYPE_SIZE (void_type_node) = bitsize_zero_node;
312 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
315 /* If the GNU type extensions to DWARF are available, setup the hooks. */
316 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
317 /* We condition the name demangling and the generation of type encoding
318 strings on -gdwarf+ and always set descriptive types on. */
319 if (use_gnu_debug_info_extensions)
321 dwarf2out_set_type_encoding_func (extract_encoding);
322 dwarf2out_set_demangle_name_func (decode_name);
324 dwarf2out_set_descriptive_type_func (get_parallel_type);
327 /* Enable GNAT stack checking method if needed */
328 if (!Stack_Check_Probes_On_Target)
329 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
331 /* Record the builtin types. Define `integer' and `unsigned char' first so
332 that dbx will output them first. */
333 record_builtin_type ("integer", integer_type_node);
334 record_builtin_type ("unsigned char", char_type_node);
335 record_builtin_type ("long integer", long_integer_type_node);
336 unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1);
337 record_builtin_type ("unsigned int", unsigned_type_node);
338 record_builtin_type (SIZE_TYPE, sizetype);
339 record_builtin_type ("boolean", boolean_type_node);
340 record_builtin_type ("void", void_type_node);
342 /* Save the type we made for integer as the type for Standard.Integer. */
343 save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node),
346 /* Save the type we made for boolean as the type for Standard.Boolean. */
347 save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node),
349 gnat_literal = First_Literal (Base_Type (standard_boolean));
350 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
351 gcc_assert (t == boolean_false_node);
352 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
353 boolean_type_node, t, true, false, false, false,
355 DECL_IGNORED_P (t) = 1;
356 save_gnu_tree (gnat_literal, t, false);
357 gnat_literal = Next_Literal (gnat_literal);
358 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
359 gcc_assert (t == boolean_true_node);
360 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
361 boolean_type_node, t, true, false, false, false,
363 DECL_IGNORED_P (t) = 1;
364 save_gnu_tree (gnat_literal, t, false);
366 void_ftype = build_function_type (void_type_node, NULL_TREE);
367 ptr_void_ftype = build_pointer_type (void_ftype);
369 /* Now declare runtime functions. */
370 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
372 /* malloc is a function declaration tree for a function to allocate
375 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
376 build_function_type (ptr_void_type_node,
377 tree_cons (NULL_TREE,
379 NULL_TREE, false, true, true, NULL, Empty);
380 DECL_IS_MALLOC (malloc_decl) = 1;
382 /* malloc32 is a function declaration tree for a function to allocate
383 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
385 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
386 build_function_type (ptr_void_type_node,
387 tree_cons (NULL_TREE,
389 NULL_TREE, false, true, true, NULL, Empty);
390 DECL_IS_MALLOC (malloc32_decl) = 1;
392 /* free is a function declaration tree for a function to free memory. */
394 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
395 build_function_type (void_type_node,
396 tree_cons (NULL_TREE,
399 NULL_TREE, false, true, true, NULL, Empty);
401 /* This is used for 64-bit multiplication with overflow checking. */
403 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
404 build_function_type_list (int64_type, int64_type,
405 int64_type, NULL_TREE),
406 NULL_TREE, false, true, true, NULL, Empty);
408 /* Make the types and functions used for exception processing. */
410 = build_array_type (gnat_type_for_mode (Pmode, 0),
411 build_index_type (build_int_cst (NULL_TREE, 5)));
412 record_builtin_type ("JMPBUF_T", jmpbuf_type);
413 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
415 /* Functions to get and set the jumpbuf pointer for the current thread. */
417 = create_subprog_decl
418 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
419 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
420 NULL_TREE, false, true, true, NULL, Empty);
421 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
422 DECL_PURE_P (get_jmpbuf_decl) = 1;
425 = create_subprog_decl
426 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
428 build_function_type (void_type_node,
429 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
430 NULL_TREE, false, true, true, NULL, Empty);
432 /* setjmp returns an integer and has one operand, which is a pointer to
435 = create_subprog_decl
436 (get_identifier ("__builtin_setjmp"), NULL_TREE,
437 build_function_type (integer_type_node,
438 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
439 NULL_TREE, false, true, true, NULL, Empty);
441 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
442 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
444 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
446 update_setjmp_buf_decl
447 = create_subprog_decl
448 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
449 build_function_type (void_type_node,
450 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
451 NULL_TREE, false, true, true, NULL, Empty);
453 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
454 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
456 /* Hooks to call when entering/leaving an exception handler. */
458 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
459 build_function_type (void_type_node,
460 tree_cons (NULL_TREE,
463 NULL_TREE, false, true, true, NULL, Empty);
466 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
467 build_function_type (void_type_node,
468 tree_cons (NULL_TREE,
471 NULL_TREE, false, true, true, NULL, Empty);
473 /* If in no exception handlers mode, all raise statements are redirected to
474 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
475 this procedure will never be called in this mode. */
476 if (No_Exception_Handlers_Set ())
479 = create_subprog_decl
480 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
481 build_function_type (void_type_node,
482 tree_cons (NULL_TREE,
483 build_pointer_type (char_type_node),
484 tree_cons (NULL_TREE,
487 NULL_TREE, false, true, true, NULL, Empty);
489 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
490 gnat_raise_decls[i] = decl;
493 /* Otherwise, make one decl for each exception reason. */
494 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
498 sprintf (name, "__gnat_rcheck_%.2d", i);
500 = create_subprog_decl
501 (get_identifier (name), NULL_TREE,
502 build_function_type (void_type_node,
503 tree_cons (NULL_TREE,
506 tree_cons (NULL_TREE,
509 NULL_TREE, false, true, true, NULL, Empty);
512 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
514 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
515 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
516 TREE_TYPE (gnat_raise_decls[i])
517 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
521 /* Set the types that GCC and Gigi use from the front end. We would
522 like to do this for char_type_node, but it needs to correspond to
525 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
526 except_type_node = TREE_TYPE (exception_type);
528 /* Make other functions used for exception processing. */
530 = create_subprog_decl
531 (get_identifier ("system__soft_links__get_gnat_exception"),
533 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
534 NULL_TREE, false, true, true, NULL, Empty);
535 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
536 DECL_PURE_P (get_excptr_decl) = 1;
539 = create_subprog_decl
540 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
541 build_function_type (void_type_node,
542 tree_cons (NULL_TREE,
543 build_pointer_type (except_type_node),
545 NULL_TREE, false, true, true, NULL, Empty);
547 /* Indicate that these never return. */
548 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
549 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
550 TREE_TYPE (raise_nodefer_decl)
551 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
554 /* Build the special descriptor type and its null node if needed. */
555 if (TARGET_VTABLE_USES_DESCRIPTORS)
557 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
558 tree field_list = NULL_TREE, null_list = NULL_TREE;
561 fdesc_type_node = make_node (RECORD_TYPE);
563 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
565 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
566 fdesc_type_node, 0, 0, 0, 1);
567 TREE_CHAIN (field) = field_list;
569 null_list = tree_cons (field, null_node, null_list);
572 finish_record_type (fdesc_type_node, nreverse (field_list), 0, true);
573 record_builtin_type ("descriptor", fdesc_type_node);
574 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
578 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
580 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
582 /* In this case, the builtin floating point types are VAX float,
583 so make up a type for use. */
584 longest_float_type_node = make_node (REAL_TYPE);
585 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
586 layout_type (longest_float_type_node);
587 record_builtin_type ("longest float type", longest_float_type_node);
590 longest_float_type_node = TREE_TYPE (long_long_float_type);
592 /* Dummy objects to materialize "others" and "all others" in the exception
593 tables. These are exported by a-exexpr.adb, so see this unit for the
596 = create_var_decl (get_identifier ("OTHERS"),
597 get_identifier ("__gnat_others_value"),
598 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
601 = create_var_decl (get_identifier ("ALL_OTHERS"),
602 get_identifier ("__gnat_all_others_value"),
603 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
605 main_identifier_node = get_identifier ("main");
607 /* Install the builtins we might need, either internally or as
608 user available facilities for Intrinsic imports. */
609 gnat_install_builtins ();
611 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
612 gnu_constraint_error_label_stack
613 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
614 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
615 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
617 /* Process any Pragma Ident for the main unit. */
618 #ifdef ASM_OUTPUT_IDENT
619 if (Present (Ident_String (Main_Unit)))
622 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
625 /* If we are using the GCC exception mechanism, let GCC know. */
626 if (Exception_Mechanism == Back_End_Exceptions)
629 /* Now translate the compilation unit proper. */
631 Compilation_Unit_to_gnu (gnat_root);
633 /* Finally see if we have any elaboration procedures to deal with. */
634 for (info = elab_info_list; info; info = info->next)
636 tree gnu_body = DECL_SAVED_TREE (info->elab_proc);
638 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
639 the gimplifier for obvious reasons, but it turns out that we need to
640 unshare them for the global level because of SAVE_EXPRs made around
641 checks for global objects and around allocators for global objects
642 of variable size, in order to prevent node sharing in the underlying
643 expression. Note that this implicitly assumes that the SAVE_EXPR
644 nodes themselves are not shared between subprograms, which would be
645 an upstream bug for which we would not change the outcome. */
646 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
648 /* Process the function as others, but for indicating this is an
649 elab proc, to be discarded if empty, then propagate the status
650 up to the GNAT tree node. */
651 begin_subprog_body (info->elab_proc);
652 end_subprog_body (gnu_body, true);
654 if (empty_body_p (gimple_body (info->elab_proc)))
655 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
658 /* We cannot track the location of errors past this point. */
659 error_gnat_node = Empty;
662 /* Return a positive value if an lvalue is required for GNAT_NODE.
663 GNU_TYPE is the type that will be used for GNAT_NODE in the
664 translated GNU tree. ALIASED indicates whether the underlying
665 object represented by GNAT_NODE is aliased in the Ada sense.
667 The function climbs up the GNAT tree starting from the node and
668 returns 1 upon encountering a node that effectively requires an
669 lvalue downstream. It returns int instead of bool to facilitate
670 usage in non purely binary logic contexts. */
673 lvalue_required_p (Node_Id gnat_node, tree gnu_type, int aliased)
675 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
677 switch (Nkind (gnat_parent))
682 case N_Attribute_Reference:
684 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
685 return id == Attr_Address
687 || id == Attr_Unchecked_Access
688 || id == Attr_Unrestricted_Access;
691 case N_Parameter_Association:
692 case N_Function_Call:
693 case N_Procedure_Call_Statement:
694 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
696 case N_Indexed_Component:
697 /* Only the array expression can require an lvalue. */
698 if (Prefix (gnat_parent) != gnat_node)
701 /* ??? Consider that referencing an indexed component with a
702 non-constant index forces the whole aggregate to memory.
703 Note that N_Integer_Literal is conservative, any static
704 expression in the RM sense could probably be accepted. */
705 for (gnat_temp = First (Expressions (gnat_parent));
707 gnat_temp = Next (gnat_temp))
708 if (Nkind (gnat_temp) != N_Integer_Literal)
711 /* ... fall through ... */
714 /* Only the array expression can require an lvalue. */
715 if (Prefix (gnat_parent) != gnat_node)
718 aliased |= Has_Aliased_Components (Etype (gnat_node));
719 return lvalue_required_p (gnat_parent, gnu_type, aliased);
721 case N_Selected_Component:
722 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
723 return lvalue_required_p (gnat_parent, gnu_type, aliased);
725 case N_Object_Renaming_Declaration:
726 /* We need to make a real renaming only if the constant object is
727 aliased or if we may use a renaming pointer; otherwise we can
728 optimize and return the rvalue. We make an exception if the object
729 is an identifier since in this case the rvalue can be propagated
730 attached to the CONST_DECL. */
732 /* This should match the constant case of the renaming code. */
734 (Underlying_Type (Etype (Name (gnat_parent))))
735 || Nkind (Name (gnat_parent)) == N_Identifier);
744 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
745 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
746 to where we should place the result type. */
749 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
751 Node_Id gnat_temp, gnat_temp_type;
752 tree gnu_result, gnu_result_type;
754 /* Whether we should require an lvalue for GNAT_NODE. Needed in
755 specific circumstances only, so evaluated lazily. < 0 means
756 unknown, > 0 means known true, 0 means known false. */
757 int require_lvalue = -1;
759 /* If GNAT_NODE is a constant, whether we should use the initialization
760 value instead of the constant entity, typically for scalars with an
761 address clause when the parent doesn't require an lvalue. */
762 bool use_constant_initializer = false;
764 /* If the Etype of this node does not equal the Etype of the Entity,
765 something is wrong with the entity map, probably in generic
766 instantiation. However, this does not apply to types. Since we sometime
767 have strange Ekind's, just do this test for objects. Also, if the Etype of
768 the Entity is private, the Etype of the N_Identifier is allowed to be the
769 full type and also we consider a packed array type to be the same as the
770 original type. Similarly, a class-wide type is equivalent to a subtype of
771 itself. Finally, if the types are Itypes, one may be a copy of the other,
772 which is also legal. */
773 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
774 ? gnat_node : Entity (gnat_node));
775 gnat_temp_type = Etype (gnat_temp);
777 gcc_assert (Etype (gnat_node) == gnat_temp_type
778 || (Is_Packed (gnat_temp_type)
779 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
780 || (Is_Class_Wide_Type (Etype (gnat_node)))
781 || (IN (Ekind (gnat_temp_type), Private_Kind)
782 && Present (Full_View (gnat_temp_type))
783 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
784 || (Is_Packed (Full_View (gnat_temp_type))
785 && (Etype (gnat_node)
786 == Packed_Array_Type (Full_View
787 (gnat_temp_type))))))
788 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
789 || !(Ekind (gnat_temp) == E_Variable
790 || Ekind (gnat_temp) == E_Component
791 || Ekind (gnat_temp) == E_Constant
792 || Ekind (gnat_temp) == E_Loop_Parameter
793 || IN (Ekind (gnat_temp), Formal_Kind)));
795 /* If this is a reference to a deferred constant whose partial view is an
796 unconstrained private type, the proper type is on the full view of the
797 constant, not on the full view of the type, which may be unconstrained.
799 This may be a reference to a type, for example in the prefix of the
800 attribute Position, generated for dispatching code (see Make_DT in
801 exp_disp,adb). In that case we need the type itself, not is parent,
802 in particular if it is a derived type */
803 if (Is_Private_Type (gnat_temp_type)
804 && Has_Unknown_Discriminants (gnat_temp_type)
805 && Ekind (gnat_temp) == E_Constant
806 && Present (Full_View (gnat_temp)))
808 gnat_temp = Full_View (gnat_temp);
809 gnat_temp_type = Etype (gnat_temp);
813 /* We want to use the Actual_Subtype if it has already been elaborated,
814 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
816 if ((Ekind (gnat_temp) == E_Constant
817 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
818 && !(Is_Array_Type (Etype (gnat_temp))
819 && Present (Packed_Array_Type (Etype (gnat_temp))))
820 && Present (Actual_Subtype (gnat_temp))
821 && present_gnu_tree (Actual_Subtype (gnat_temp)))
822 gnat_temp_type = Actual_Subtype (gnat_temp);
824 gnat_temp_type = Etype (gnat_node);
827 /* Expand the type of this identifier first, in case it is an enumeral
828 literal, which only get made when the type is expanded. There is no
829 order-of-elaboration issue here. */
830 gnu_result_type = get_unpadded_type (gnat_temp_type);
832 /* If this is a non-imported scalar constant with an address clause,
833 retrieve the value instead of a pointer to be dereferenced unless
834 an lvalue is required. This is generally more efficient and actually
835 required if this is a static expression because it might be used
836 in a context where a dereference is inappropriate, such as a case
837 statement alternative or a record discriminant. There is no possible
838 volatile-ness short-circuit here since Volatile constants must bei
840 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
841 && !Is_Imported (gnat_temp)
842 && Present (Address_Clause (gnat_temp)))
844 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
845 Is_Aliased (gnat_temp));
846 use_constant_initializer = !require_lvalue;
849 if (use_constant_initializer)
851 /* If this is a deferred constant, the initializer is attached to
853 if (Present (Full_View (gnat_temp)))
854 gnat_temp = Full_View (gnat_temp);
856 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
859 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
861 /* If we are in an exception handler, force this variable into memory to
862 ensure optimization does not remove stores that appear redundant but are
863 actually needed in case an exception occurs.
865 ??? Note that we need not do this if the variable is declared within the
866 handler, only if it is referenced in the handler and declared in an
867 enclosing block, but we have no way of testing that right now.
869 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
870 here, but it can now be removed by the Tree aliasing machinery if the
871 address of the variable is never taken. All we can do is to make the
872 variable volatile, which might incur the generation of temporaries just
873 to access the memory in some circumstances. This can be avoided for
874 variables of non-constant size because they are automatically allocated
875 to memory. There might be no way of allocating a proper temporary for
876 them in any case. We only do this for SJLJ though. */
877 if (TREE_VALUE (gnu_except_ptr_stack)
878 && TREE_CODE (gnu_result) == VAR_DECL
879 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
880 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
882 /* Some objects (such as parameters passed by reference, globals of
883 variable size, and renamed objects) actually represent the address
884 of the object. In that case, we must do the dereference. Likewise,
885 deal with parameters to foreign convention subprograms. */
886 if (DECL_P (gnu_result)
887 && (DECL_BY_REF_P (gnu_result)
888 || (TREE_CODE (gnu_result) == PARM_DECL
889 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
891 bool ro = DECL_POINTS_TO_READONLY_P (gnu_result);
894 if (TREE_CODE (gnu_result) == PARM_DECL
895 && DECL_BY_COMPONENT_PTR_P (gnu_result))
897 = build_unary_op (INDIRECT_REF, NULL_TREE,
898 convert (build_pointer_type (gnu_result_type),
901 /* If it's a renaming pointer and we are at the right binding level,
902 we can reference the renamed object directly, since the renamed
903 expression has been protected against multiple evaluations. */
904 else if (TREE_CODE (gnu_result) == VAR_DECL
905 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) != 0
906 && (! DECL_RENAMING_GLOBAL_P (gnu_result)
907 || global_bindings_p ()))
908 gnu_result = renamed_obj;
910 /* Return the underlying CST for a CONST_DECL like a few lines below,
911 after dereferencing in this case. */
912 else if (TREE_CODE (gnu_result) == CONST_DECL)
913 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
914 DECL_INITIAL (gnu_result));
917 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
919 TREE_READONLY (gnu_result) = TREE_STATIC (gnu_result) = ro;
922 /* The GNAT tree has the type of a function as the type of its result. Also
923 use the type of the result if the Etype is a subtype which is nominally
924 unconstrained. But remove any padding from the resulting type. */
925 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
926 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
928 gnu_result_type = TREE_TYPE (gnu_result);
929 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
930 && TYPE_IS_PADDING_P (gnu_result_type))
931 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
934 /* If we have a constant declaration and its initializer at hand,
935 try to return the latter to avoid the need to call fold in lots
936 of places and the need of elaboration code if this Id is used as
937 an initializer itself. */
938 if (TREE_CONSTANT (gnu_result)
939 && DECL_P (gnu_result)
940 && DECL_INITIAL (gnu_result))
943 = (TREE_CODE (gnu_result) == CONST_DECL
944 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
946 /* If there is a corresponding variable, we only want to return
947 the CST value if an lvalue is not required. Evaluate this
948 now if we have not already done so. */
949 if (object && require_lvalue < 0)
950 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
951 Is_Aliased (gnat_temp));
953 if (!object || !require_lvalue)
954 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
957 *gnu_result_type_p = gnu_result_type;
961 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
962 any statements we generate. */
965 Pragma_to_gnu (Node_Id gnat_node)
968 tree gnu_result = alloc_stmt_list ();
970 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
972 if (type_annotate_only
973 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
976 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
978 case Pragma_Inspection_Point:
979 /* Do nothing at top level: all such variables are already viewable. */
980 if (global_bindings_p ())
983 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
985 gnat_temp = Next (gnat_temp))
987 Node_Id gnat_expr = Expression (gnat_temp);
988 tree gnu_expr = gnat_to_gnu (gnat_expr);
990 enum machine_mode mode;
991 tree asm_constraint = NULL_TREE;
992 #ifdef ASM_COMMENT_START
996 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
997 gnu_expr = TREE_OPERAND (gnu_expr, 0);
999 /* Use the value only if it fits into a normal register,
1000 otherwise use the address. */
1001 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1002 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1003 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1004 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1007 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1009 #ifdef ASM_COMMENT_START
1010 comment = concat (ASM_COMMENT_START,
1011 " inspection point: ",
1012 Get_Name_String (Chars (gnat_expr)),
1013 use_address ? " address" : "",
1016 asm_constraint = build_string (strlen (comment), comment);
1019 gnu_expr = build4 (ASM_EXPR, void_type_node,
1023 (build_tree_list (NULL_TREE,
1024 build_string (1, "g")),
1025 gnu_expr, NULL_TREE),
1027 ASM_VOLATILE_P (gnu_expr) = 1;
1028 set_expr_location_from_node (gnu_expr, gnat_node);
1029 append_to_statement_list (gnu_expr, &gnu_result);
1033 case Pragma_Optimize:
1034 switch (Chars (Expression
1035 (First (Pragma_Argument_Associations (gnat_node)))))
1037 case Name_Time: case Name_Space:
1039 post_error ("insufficient -O value?", gnat_node);
1044 post_error ("must specify -O0?", gnat_node);
1052 case Pragma_Reviewable:
1053 if (write_symbols == NO_DEBUG)
1054 post_error ("must specify -g?", gnat_node);
1061 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Attribute,
1062 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1063 where we should place the result type. ATTRIBUTE is the attribute ID. */
1066 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1068 tree gnu_result = error_mark_node;
1069 tree gnu_result_type;
1071 bool prefix_unused = false;
1072 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1073 tree gnu_type = TREE_TYPE (gnu_prefix);
1075 /* If the input is a NULL_EXPR, make a new one. */
1076 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1078 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
1079 return build1 (NULL_EXPR, *gnu_result_type_p,
1080 TREE_OPERAND (gnu_prefix, 0));
1087 /* These are just conversions until since representation clauses for
1088 enumerations are handled in the front end. */
1090 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1092 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1093 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1094 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1095 checkp, checkp, true, gnat_node);
1101 /* These just add or subject the constant 1. Representation clauses for
1102 enumerations are handled in the front-end. */
1103 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1104 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1106 if (Do_Range_Check (First (Expressions (gnat_node))))
1108 gnu_expr = protect_multiple_eval (gnu_expr);
1111 (build_binary_op (EQ_EXPR, integer_type_node,
1113 attribute == Attr_Pred
1114 ? TYPE_MIN_VALUE (gnu_result_type)
1115 : TYPE_MAX_VALUE (gnu_result_type)),
1116 gnu_expr, CE_Range_Check_Failed, gnat_node);
1120 = build_binary_op (attribute == Attr_Pred
1121 ? MINUS_EXPR : PLUS_EXPR,
1122 gnu_result_type, gnu_expr,
1123 convert (gnu_result_type, integer_one_node));
1127 case Attr_Unrestricted_Access:
1128 /* Conversions don't change something's address but can cause us to miss
1129 the COMPONENT_REF case below, so strip them off. */
1130 gnu_prefix = remove_conversions (gnu_prefix,
1131 !Must_Be_Byte_Aligned (gnat_node));
1133 /* If we are taking 'Address of an unconstrained object, this is the
1134 pointer to the underlying array. */
1135 if (attribute == Attr_Address)
1136 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1138 /* If we are building a static dispatch table, we have to honor
1139 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1140 with the C++ ABI. We do it in the non-static case as well,
1141 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1142 else if (TARGET_VTABLE_USES_DESCRIPTORS
1143 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1145 tree gnu_field, gnu_list = NULL_TREE, t;
1146 /* Descriptors can only be built here for top-level functions. */
1147 bool build_descriptor = (global_bindings_p () != 0);
1150 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1152 /* If we're not going to build the descriptor, we have to retrieve
1153 the one which will be built by the linker (or by the compiler
1154 later if a static chain is requested). */
1155 if (!build_descriptor)
1157 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1158 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1160 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1163 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1164 i < TARGET_VTABLE_USES_DESCRIPTORS;
1165 gnu_field = TREE_CHAIN (gnu_field), i++)
1167 if (build_descriptor)
1169 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1170 build_int_cst (NULL_TREE, i));
1171 TREE_CONSTANT (t) = 1;
1174 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1175 gnu_field, NULL_TREE);
1177 gnu_list = tree_cons (gnu_field, t, gnu_list);
1180 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1184 /* ... fall through ... */
1187 case Attr_Unchecked_Access:
1188 case Attr_Code_Address:
1189 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1191 = build_unary_op (((attribute == Attr_Address
1192 || attribute == Attr_Unrestricted_Access)
1193 && !Must_Be_Byte_Aligned (gnat_node))
1194 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1195 gnu_result_type, gnu_prefix);
1197 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1198 don't try to build a trampoline. */
1199 if (attribute == Attr_Code_Address)
1201 for (gnu_expr = gnu_result;
1202 CONVERT_EXPR_P (gnu_expr);
1203 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1204 TREE_CONSTANT (gnu_expr) = 1;
1206 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1207 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1210 /* For other address attributes applied to a nested function,
1211 find an inner ADDR_EXPR and annotate it so that we can issue
1212 a useful warning with -Wtrampolines. */
1213 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1215 for (gnu_expr = gnu_result;
1216 CONVERT_EXPR_P (gnu_expr);
1217 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1220 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1221 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1223 set_expr_location_from_node (gnu_expr, gnat_node);
1225 /* Check that we're not violating the No_Implicit_Dynamic_Code
1226 restriction. Be conservative if we don't know anything
1227 about the trampoline strategy for the target. */
1228 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1233 case Attr_Pool_Address:
1236 tree gnu_ptr = gnu_prefix;
1238 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1240 /* If this is an unconstrained array, we know the object must have been
1241 allocated with the template in front of the object. So compute the
1243 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1245 = convert (build_pointer_type
1246 (TYPE_OBJECT_RECORD_TYPE
1247 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1250 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1251 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1252 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1254 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1255 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1256 tree gnu_byte_offset
1257 = convert (sizetype,
1258 size_diffop (size_zero_node, gnu_pos));
1259 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1261 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1262 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1263 gnu_ptr, gnu_byte_offset);
1266 gnu_result = convert (gnu_result_type, gnu_ptr);
1271 case Attr_Object_Size:
1272 case Attr_Value_Size:
1273 case Attr_Max_Size_In_Storage_Elements:
1274 gnu_expr = gnu_prefix;
1276 /* Remove NOPS from gnu_expr and conversions from gnu_prefix.
1277 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1278 while (TREE_CODE (gnu_expr) == NOP_EXPR)
1279 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1281 gnu_prefix = remove_conversions (gnu_prefix, true);
1282 prefix_unused = true;
1283 gnu_type = TREE_TYPE (gnu_prefix);
1285 /* Replace an unconstrained array type with the type of the underlying
1286 array. We can't do this with a call to maybe_unconstrained_array
1287 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1288 use the record type that will be used to allocate the object and its
1290 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1292 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1293 if (attribute != Attr_Max_Size_In_Storage_Elements)
1294 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1297 /* If we're looking for the size of a field, return the field size.
1298 Otherwise, if the prefix is an object, or if 'Object_Size or
1299 'Max_Size_In_Storage_Elements has been specified, the result is the
1300 GCC size of the type. Otherwise, the result is the RM size of the
1302 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1303 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1304 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1305 || attribute == Attr_Object_Size
1306 || attribute == Attr_Max_Size_In_Storage_Elements)
1308 /* If this is a padded type, the GCC size isn't relevant to the
1309 programmer. Normally, what we want is the RM size, which was set
1310 from the specified size, but if it was not set, we want the size
1311 of the relevant field. Using the MAX of those two produces the
1312 right result in all case. Don't use the size of the field if it's
1313 a self-referential type, since that's never what's wanted. */
1314 if (TREE_CODE (gnu_type) == RECORD_TYPE
1315 && TYPE_IS_PADDING_P (gnu_type)
1316 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1318 gnu_result = rm_size (gnu_type);
1319 if (!(CONTAINS_PLACEHOLDER_P
1320 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))))
1322 = size_binop (MAX_EXPR, gnu_result,
1323 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1325 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1327 Node_Id gnat_deref = Prefix (gnat_node);
1328 Node_Id gnat_actual_subtype
1329 = Actual_Designated_Subtype (gnat_deref);
1331 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1333 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1334 && Present (gnat_actual_subtype))
1336 tree gnu_actual_obj_type
1337 = gnat_to_gnu_type (gnat_actual_subtype);
1339 = build_unc_object_type_from_ptr (gnu_ptr_type,
1340 gnu_actual_obj_type,
1341 get_identifier ("SIZE"));
1344 gnu_result = TYPE_SIZE (gnu_type);
1347 gnu_result = TYPE_SIZE (gnu_type);
1350 gnu_result = rm_size (gnu_type);
1352 gcc_assert (gnu_result);
1354 /* Deal with a self-referential size by returning the maximum size for a
1355 type and by qualifying the size with the object for 'Size of an
1357 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1359 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1360 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1362 gnu_result = max_size (gnu_result, true);
1365 /* If the type contains a template, subtract its size. */
1366 if (TREE_CODE (gnu_type) == RECORD_TYPE
1367 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1368 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1369 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1371 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1373 if (attribute == Attr_Max_Size_In_Storage_Elements)
1374 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1375 gnu_result, bitsize_unit_node);
1378 case Attr_Alignment:
1379 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1380 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1382 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1383 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1385 gnu_type = TREE_TYPE (gnu_prefix);
1386 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1387 prefix_unused = true;
1389 gnu_result = size_int ((TREE_CODE (gnu_prefix) == COMPONENT_REF
1390 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1))
1391 : TYPE_ALIGN (gnu_type)) / BITS_PER_UNIT);
1396 case Attr_Range_Length:
1397 prefix_unused = true;
1399 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1401 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1403 if (attribute == Attr_First)
1404 gnu_result = TYPE_MIN_VALUE (gnu_type);
1405 else if (attribute == Attr_Last)
1406 gnu_result = TYPE_MAX_VALUE (gnu_type);
1410 (MAX_EXPR, get_base_type (gnu_result_type),
1412 (PLUS_EXPR, get_base_type (gnu_result_type),
1413 build_binary_op (MINUS_EXPR,
1414 get_base_type (gnu_result_type),
1415 convert (gnu_result_type,
1416 TYPE_MAX_VALUE (gnu_type)),
1417 convert (gnu_result_type,
1418 TYPE_MIN_VALUE (gnu_type))),
1419 convert (gnu_result_type, integer_one_node)),
1420 convert (gnu_result_type, integer_zero_node));
1425 /* ... fall through ... */
1429 int Dimension = (Present (Expressions (gnat_node))
1430 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1432 struct parm_attr *pa = NULL;
1433 Entity_Id gnat_param = Empty;
1435 /* Make sure any implicit dereference gets done. */
1436 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1437 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1438 /* We treat unconstrained array In parameters specially. */
1439 if (Nkind (Prefix (gnat_node)) == N_Identifier
1440 && !Is_Constrained (Etype (Prefix (gnat_node)))
1441 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1442 gnat_param = Entity (Prefix (gnat_node));
1443 gnu_type = TREE_TYPE (gnu_prefix);
1444 prefix_unused = true;
1445 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1447 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1452 for (ndim = 1, gnu_type_temp = gnu_type;
1453 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1454 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1455 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1458 Dimension = ndim + 1 - Dimension;
1461 for (i = 1; i < Dimension; i++)
1462 gnu_type = TREE_TYPE (gnu_type);
1464 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1466 /* When not optimizing, look up the slot associated with the parameter
1467 and the dimension in the cache and create a new one on failure. */
1468 if (!optimize && Present (gnat_param))
1470 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1471 if (pa->id == gnat_param && pa->dim == Dimension)
1476 pa = GGC_CNEW (struct parm_attr);
1477 pa->id = gnat_param;
1478 pa->dim = Dimension;
1479 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1483 /* Return the cached expression or build a new one. */
1484 if (attribute == Attr_First)
1486 if (pa && pa->first)
1488 gnu_result = pa->first;
1493 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1496 else if (attribute == Attr_Last)
1500 gnu_result = pa->last;
1505 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1508 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1510 if (pa && pa->length)
1512 gnu_result = pa->length;
1517 /* We used to compute the length as max (hb - lb + 1, 0),
1518 which could overflow for some cases of empty arrays, e.g.
1519 when lb == index_type'first. We now compute the length as
1520 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1521 much rarer cases, for extremely large arrays we expect
1522 never to encounter in practice. In addition, the former
1523 computation required the use of potentially constraining
1524 signed arithmetic while the latter doesn't. Note that the
1525 comparison must be done in the original index base type,
1526 otherwise the conversion of either bound to gnu_compute_type
1529 tree gnu_compute_type = get_base_type (gnu_result_type);
1532 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1534 = convert (gnu_compute_type, TYPE_MIN_VALUE (index_type));
1536 = convert (gnu_compute_type, TYPE_MAX_VALUE (index_type));
1540 (COND_EXPR, gnu_compute_type,
1541 build_binary_op (LT_EXPR, get_base_type (index_type),
1542 TYPE_MAX_VALUE (index_type),
1543 TYPE_MIN_VALUE (index_type)),
1544 convert (gnu_compute_type, integer_zero_node),
1546 (PLUS_EXPR, gnu_compute_type,
1547 build_binary_op (MINUS_EXPR, gnu_compute_type, hb, lb),
1548 convert (gnu_compute_type, integer_one_node)));
1552 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1553 handling. Note that these attributes could not have been used on
1554 an unconstrained array type. */
1555 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result,
1558 /* Cache the expression we have just computed. Since we want to do it
1559 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1560 create the temporary. */
1564 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1565 TREE_SIDE_EFFECTS (gnu_result) = 1;
1566 if (attribute == Attr_First)
1567 pa->first = gnu_result;
1568 else if (attribute == Attr_Last)
1569 pa->last = gnu_result;
1571 pa->length = gnu_result;
1576 case Attr_Bit_Position:
1578 case Attr_First_Bit:
1582 HOST_WIDE_INT bitsize;
1583 HOST_WIDE_INT bitpos;
1585 tree gnu_field_bitpos;
1586 tree gnu_field_offset;
1588 enum machine_mode mode;
1589 int unsignedp, volatilep;
1591 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1592 gnu_prefix = remove_conversions (gnu_prefix, true);
1593 prefix_unused = true;
1595 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1596 the result is 0. Don't allow 'Bit on a bare component, though. */
1597 if (attribute == Attr_Bit
1598 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1599 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1601 gnu_result = integer_zero_node;
1606 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1607 || (attribute == Attr_Bit_Position
1608 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1610 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1611 &mode, &unsignedp, &volatilep, false);
1613 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1615 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1616 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1618 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1619 TREE_CODE (gnu_inner) == COMPONENT_REF
1620 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1621 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1624 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1625 bit_position (TREE_OPERAND (gnu_inner, 1)));
1627 = size_binop (PLUS_EXPR, gnu_field_offset,
1628 byte_position (TREE_OPERAND (gnu_inner, 1)));
1631 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1633 gnu_field_bitpos = bit_position (gnu_prefix);
1634 gnu_field_offset = byte_position (gnu_prefix);
1638 gnu_field_bitpos = bitsize_zero_node;
1639 gnu_field_offset = size_zero_node;
1645 gnu_result = gnu_field_offset;
1648 case Attr_First_Bit:
1650 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1654 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1655 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1656 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1657 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1661 case Attr_Bit_Position:
1662 gnu_result = gnu_field_bitpos;
1666 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1668 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1675 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1676 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1678 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1679 gnu_result = build_binary_op (attribute == Attr_Min
1680 ? MIN_EXPR : MAX_EXPR,
1681 gnu_result_type, gnu_lhs, gnu_rhs);
1685 case Attr_Passed_By_Reference:
1686 gnu_result = size_int (default_pass_by_ref (gnu_type)
1687 || must_pass_by_ref (gnu_type));
1688 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1691 case Attr_Component_Size:
1692 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1693 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1695 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1696 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1698 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1699 gnu_type = TREE_TYPE (gnu_prefix);
1701 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1702 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1704 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1705 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1706 gnu_type = TREE_TYPE (gnu_type);
1708 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1710 /* Note this size cannot be self-referential. */
1711 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1712 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1713 prefix_unused = true;
1716 case Attr_Null_Parameter:
1717 /* This is just a zero cast to the pointer type for
1718 our prefix and dereferenced. */
1719 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1721 = build_unary_op (INDIRECT_REF, NULL_TREE,
1722 convert (build_pointer_type (gnu_result_type),
1723 integer_zero_node));
1724 TREE_PRIVATE (gnu_result) = 1;
1727 case Attr_Mechanism_Code:
1730 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1732 prefix_unused = true;
1733 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1734 if (Present (Expressions (gnat_node)))
1736 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1738 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1739 i--, gnat_obj = Next_Formal (gnat_obj))
1743 code = Mechanism (gnat_obj);
1744 if (code == Default)
1745 code = ((present_gnu_tree (gnat_obj)
1746 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1747 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1749 && (DECL_BY_COMPONENT_PTR_P
1750 (get_gnu_tree (gnat_obj))))))
1751 ? By_Reference : By_Copy);
1752 gnu_result = convert (gnu_result_type, size_int (- code));
1757 /* Say we have an unimplemented attribute. Then set the value to be
1758 returned to be a zero and hope that's something we can convert to the
1759 type of this attribute. */
1760 post_error ("unimplemented attribute", gnat_node);
1761 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1762 gnu_result = integer_zero_node;
1766 /* If this is an attribute where the prefix was unused, force a use of it if
1767 it has a side-effect. But don't do it if the prefix is just an entity
1768 name. However, if an access check is needed, we must do it. See second
1769 example in AARM 11.6(5.e). */
1770 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1771 && !Is_Entity_Name (Prefix (gnat_node)))
1772 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1773 gnu_prefix, gnu_result);
1775 *gnu_result_type_p = gnu_result_type;
1779 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1780 to a GCC tree, which is returned. */
1783 Case_Statement_to_gnu (Node_Id gnat_node)
1789 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1790 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1792 /* The range of values in a case statement is determined by the rules in
1793 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1794 of the expression. One exception arises in the case of a simple name that
1795 is parenthesized. This still has the Etype of the name, but since it is
1796 not a name, para 7 does not apply, and we need to go to the base type.
1797 This is the only case where parenthesization affects the dynamic
1798 semantics (i.e. the range of possible values at runtime that is covered
1799 by the others alternative.
1801 Another exception is if the subtype of the expression is non-static. In
1802 that case, we also have to use the base type. */
1803 if (Paren_Count (Expression (gnat_node)) != 0
1804 || !Is_OK_Static_Subtype (Underlying_Type
1805 (Etype (Expression (gnat_node)))))
1806 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1808 /* We build a SWITCH_EXPR that contains the code with interspersed
1809 CASE_LABEL_EXPRs for each label. */
1811 push_stack (&gnu_switch_label_stack, NULL_TREE, create_artificial_label ());
1812 start_stmt_group ();
1813 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1814 Present (gnat_when);
1815 gnat_when = Next_Non_Pragma (gnat_when))
1817 Node_Id gnat_choice;
1818 int choices_added = 0;
1820 /* First compile all the different case choices for the current WHEN
1822 for (gnat_choice = First (Discrete_Choices (gnat_when));
1823 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1825 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1827 switch (Nkind (gnat_choice))
1830 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1831 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1834 case N_Subtype_Indication:
1835 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1836 (Constraint (gnat_choice))));
1837 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1838 (Constraint (gnat_choice))));
1842 case N_Expanded_Name:
1843 /* This represents either a subtype range or a static value of
1844 some kind; Ekind says which. */
1845 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1847 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1849 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1850 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1854 /* ... fall through ... */
1856 case N_Character_Literal:
1857 case N_Integer_Literal:
1858 gnu_low = gnat_to_gnu (gnat_choice);
1861 case N_Others_Choice:
1868 /* If the case value is a subtype that raises Constraint_Error at
1869 run-time because of a wrong bound, then gnu_low or gnu_high is
1870 not translated into an INTEGER_CST. In such a case, we need
1871 to ensure that the when statement is not added in the tree,
1872 otherwise it will crash the gimplifier. */
1873 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1874 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1876 add_stmt_with_node (build3 (CASE_LABEL_EXPR, void_type_node,
1878 create_artificial_label ()),
1884 /* Push a binding level here in case variables are declared as we want
1885 them to be local to this set of statements instead of to the block
1886 containing the Case statement. */
1887 if (choices_added > 0)
1889 add_stmt (build_stmt_group (Statements (gnat_when), true));
1890 add_stmt (build1 (GOTO_EXPR, void_type_node,
1891 TREE_VALUE (gnu_switch_label_stack)));
1895 /* Now emit a definition of the label all the cases branched to. */
1896 add_stmt (build1 (LABEL_EXPR, void_type_node,
1897 TREE_VALUE (gnu_switch_label_stack)));
1898 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1899 end_stmt_group (), NULL_TREE);
1900 pop_stack (&gnu_switch_label_stack);
1905 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1906 to a GCC tree, which is returned. */
1909 Loop_Statement_to_gnu (Node_Id gnat_node)
1911 /* ??? It would be nice to use "build" here, but there's no build5. */
1912 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1913 NULL_TREE, NULL_TREE, NULL_TREE);
1914 tree gnu_loop_var = NULL_TREE;
1915 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1916 tree gnu_cond_expr = NULL_TREE;
1919 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1920 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1921 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label ();
1922 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1923 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1924 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1926 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1927 N_Exit_Statement can find it. */
1928 push_stack (&gnu_loop_label_stack, NULL_TREE,
1929 LOOP_STMT_LABEL (gnu_loop_stmt));
1931 /* Set the condition under which the loop must keep going.
1932 For the case "LOOP .... END LOOP;" the condition is always true. */
1933 if (No (gnat_iter_scheme))
1936 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1937 else if (Present (Condition (gnat_iter_scheme)))
1938 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1939 = gnat_to_gnu (Condition (gnat_iter_scheme));
1941 /* Otherwise we have an iteration scheme and the condition is given by
1942 the bounds of the subtype of the iteration variable. */
1945 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1946 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1947 Entity_Id gnat_type = Etype (gnat_loop_var);
1948 tree gnu_type = get_unpadded_type (gnat_type);
1949 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1950 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1951 tree gnu_first, gnu_last, gnu_limit;
1952 enum tree_code update_code, end_code;
1953 tree gnu_base_type = get_base_type (gnu_type);
1955 /* We must disable modulo reduction for the loop variable, if any,
1956 in order for the loop comparison to be effective. */
1957 if (Reverse_Present (gnat_loop_spec))
1959 gnu_first = gnu_high;
1961 update_code = MINUS_NOMOD_EXPR;
1963 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
1967 gnu_first = gnu_low;
1968 gnu_last = gnu_high;
1969 update_code = PLUS_NOMOD_EXPR;
1971 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
1974 /* We know the loop variable will not overflow if GNU_LAST is a constant
1975 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1976 the limit test to the end of the loop. In that case, we have to test
1977 for an empty loop outside the loop. */
1978 if (TREE_CODE (gnu_last) != INTEGER_CST
1979 || TREE_CODE (gnu_limit) != INTEGER_CST
1980 || tree_int_cst_equal (gnu_last, gnu_limit))
1983 = build3 (COND_EXPR, void_type_node,
1984 build_binary_op (LE_EXPR, integer_type_node,
1986 NULL_TREE, alloc_stmt_list ());
1987 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
1990 /* Open a new nesting level that will surround the loop to declare the
1991 loop index variable. */
1992 start_stmt_group ();
1995 /* Declare the loop index and set it to its initial value. */
1996 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
1997 if (DECL_BY_REF_P (gnu_loop_var))
1998 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2000 /* The loop variable might be a padded type, so use `convert' to get a
2001 reference to the inner variable if so. */
2002 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2004 /* Set either the top or bottom exit condition as appropriate depending
2005 on whether or not we know an overflow cannot occur. */
2007 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2008 = build_binary_op (NE_EXPR, integer_type_node,
2009 gnu_loop_var, gnu_last);
2011 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2012 = build_binary_op (end_code, integer_type_node,
2013 gnu_loop_var, gnu_last);
2015 LOOP_STMT_UPDATE (gnu_loop_stmt)
2016 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2018 build_binary_op (update_code,
2019 TREE_TYPE (gnu_loop_var),
2021 convert (TREE_TYPE (gnu_loop_var),
2022 integer_one_node)));
2023 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2027 /* If the loop was named, have the name point to this loop. In this case,
2028 the association is not a ..._DECL node, but the end label from this
2030 if (Present (Identifier (gnat_node)))
2031 save_gnu_tree (Entity (Identifier (gnat_node)),
2032 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2034 /* Make the loop body into its own block, so any allocated storage will be
2035 released every iteration. This is needed for stack allocation. */
2036 LOOP_STMT_BODY (gnu_loop_stmt)
2037 = build_stmt_group (Statements (gnat_node), true);
2039 /* If we declared a variable, then we are in a statement group for that
2040 declaration. Add the LOOP_STMT to it and make that the "loop". */
2043 add_stmt (gnu_loop_stmt);
2045 gnu_loop_stmt = end_stmt_group ();
2048 /* If we have an outer COND_EXPR, that's our result and this loop is its
2049 "true" statement. Otherwise, the result is the LOOP_STMT. */
2052 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2053 gnu_result = gnu_cond_expr;
2054 recalculate_side_effects (gnu_cond_expr);
2057 gnu_result = gnu_loop_stmt;
2059 pop_stack (&gnu_loop_label_stack);
2064 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2065 handler for the current function. */
2067 /* This is implemented by issuing a call to the appropriate VMS specific
2068 builtin. To avoid having VMS specific sections in the global gigi decls
2069 array, we maintain the decls of interest here. We can't declare them
2070 inside the function because we must mark them never to be GC'd, which we
2071 can only do at the global level. */
2073 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2074 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2077 establish_gnat_vms_condition_handler (void)
2079 tree establish_stmt;
2081 /* Elaborate the required decls on the first call. Check on the decl for
2082 the gnat condition handler to decide, as this is one we create so we are
2083 sure that it will be non null on subsequent calls. The builtin decl is
2084 looked up so remains null on targets where it is not implemented yet. */
2085 if (gnat_vms_condition_handler_decl == NULL_TREE)
2087 vms_builtin_establish_handler_decl
2089 (get_identifier ("__builtin_establish_vms_condition_handler"));
2091 gnat_vms_condition_handler_decl
2092 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2094 build_function_type_list (integer_type_node,
2098 NULL_TREE, 0, 1, 1, 0, Empty);
2100 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2101 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2104 /* Do nothing if the establish builtin is not available, which might happen
2105 on targets where the facility is not implemented. */
2106 if (vms_builtin_establish_handler_decl == NULL_TREE)
2110 = build_call_1_expr (vms_builtin_establish_handler_decl,
2112 (ADDR_EXPR, NULL_TREE,
2113 gnat_vms_condition_handler_decl));
2115 add_stmt (establish_stmt);
2118 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2119 don't return anything. */
2122 Subprogram_Body_to_gnu (Node_Id gnat_node)
2124 /* Defining identifier of a parameter to the subprogram. */
2125 Entity_Id gnat_param;
2126 /* The defining identifier for the subprogram body. Note that if a
2127 specification has appeared before for this body, then the identifier
2128 occurring in that specification will also be a defining identifier and all
2129 the calls to this subprogram will point to that specification. */
2130 Entity_Id gnat_subprog_id
2131 = (Present (Corresponding_Spec (gnat_node))
2132 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2133 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2134 tree gnu_subprog_decl;
2135 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2136 tree gnu_subprog_type;
2139 VEC(parm_attr,gc) *cache;
2141 /* If this is a generic object or if it has been eliminated,
2143 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2144 || Ekind (gnat_subprog_id) == E_Generic_Function
2145 || Is_Eliminated (gnat_subprog_id))
2148 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2149 the already-elaborated tree node. However, if this subprogram had its
2150 elaboration deferred, we will already have made a tree node for it. So
2151 treat it as not being defined in that case. Such a subprogram cannot
2152 have an address clause or a freeze node, so this test is safe, though it
2153 does disable some otherwise-useful error checking. */
2155 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2156 Acts_As_Spec (gnat_node)
2157 && !present_gnu_tree (gnat_subprog_id));
2159 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2161 /* Propagate the debug mode. */
2162 if (!Needs_Debug_Info (gnat_subprog_id))
2163 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2165 /* Set the line number in the decl to correspond to that of the body so that
2166 the line number notes are written correctly. */
2167 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2169 /* Initialize the information structure for the function. */
2170 allocate_struct_function (gnu_subprog_decl, false);
2171 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2172 = GGC_CNEW (struct language_function);
2174 begin_subprog_body (gnu_subprog_decl);
2175 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2177 /* If there are Out parameters, we need to ensure that the return statement
2178 properly copies them out. We do this by making a new block and converting
2179 any inner return into a goto to a label at the end of the block. */
2180 push_stack (&gnu_return_label_stack, NULL_TREE,
2181 gnu_cico_list ? create_artificial_label () : NULL_TREE);
2183 /* Get a tree corresponding to the code for the subprogram. */
2184 start_stmt_group ();
2187 /* See if there are any parameters for which we don't yet have GCC entities.
2188 These must be for Out parameters for which we will be making VAR_DECL
2189 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2190 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2191 the order of the parameters. */
2192 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2193 Present (gnat_param);
2194 gnat_param = Next_Formal_With_Extras (gnat_param))
2195 if (!present_gnu_tree (gnat_param))
2197 /* Skip any entries that have been already filled in; they must
2198 correspond to In Out parameters. */
2199 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2200 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2203 /* Do any needed references for padded types. */
2204 TREE_VALUE (gnu_cico_list)
2205 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2206 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2209 /* On VMS, establish our condition handler to possibly turn a condition into
2210 the corresponding exception if the subprogram has a foreign convention or
2213 To ensure proper execution of local finalizations on condition instances,
2214 we must turn a condition into the corresponding exception even if there
2215 is no applicable Ada handler, and need at least one condition handler per
2216 possible call chain involving GNAT code. OTOH, establishing the handler
2217 has a cost so we want to minimize the number of subprograms into which
2218 this happens. The foreign or exported condition is expected to satisfy
2219 all the constraints. */
2220 if (TARGET_ABI_OPEN_VMS
2221 && (Has_Foreign_Convention (gnat_subprog_id)
2222 || Is_Exported (gnat_subprog_id)))
2223 establish_gnat_vms_condition_handler ();
2225 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2227 /* Generate the code of the subprogram itself. A return statement will be
2228 present and any Out parameters will be handled there. */
2229 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2231 gnu_result = end_stmt_group ();
2233 /* If we populated the parameter attributes cache, we need to make sure
2234 that the cached expressions are evaluated on all possible paths. */
2235 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2238 struct parm_attr *pa;
2241 start_stmt_group ();
2243 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2246 add_stmt_with_node (pa->first, gnat_node);
2248 add_stmt_with_node (pa->last, gnat_node);
2250 add_stmt_with_node (pa->length, gnat_node);
2253 add_stmt (gnu_result);
2254 gnu_result = end_stmt_group ();
2257 /* If we made a special return label, we need to make a block that contains
2258 the definition of that label and the copying to the return value. That
2259 block first contains the function, then the label and copy statement. */
2260 if (TREE_VALUE (gnu_return_label_stack))
2264 start_stmt_group ();
2266 add_stmt (gnu_result);
2267 add_stmt (build1 (LABEL_EXPR, void_type_node,
2268 TREE_VALUE (gnu_return_label_stack)));
2270 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2271 if (list_length (gnu_cico_list) == 1)
2272 gnu_retval = TREE_VALUE (gnu_cico_list);
2274 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2277 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2278 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2281 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2282 End_Label (Handled_Statement_Sequence (gnat_node)));
2284 gnu_result = end_stmt_group ();
2287 pop_stack (&gnu_return_label_stack);
2289 /* Set the end location. */
2291 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2292 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2293 : Sloc (gnat_node)),
2294 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2296 end_subprog_body (gnu_result, false);
2298 /* Disconnect the trees for parameters that we made variables for from the
2299 GNAT entities since these are unusable after we end the function. */
2300 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2301 Present (gnat_param);
2302 gnat_param = Next_Formal_With_Extras (gnat_param))
2303 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2304 save_gnu_tree (gnat_param, NULL_TREE, false);
2306 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2307 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2309 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2312 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2313 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2314 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2315 If GNU_TARGET is non-null, this must be a function call and the result
2316 of the call is to be placed into that object. */
2319 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2322 /* The GCC node corresponding to the GNAT subprogram name. This can either
2323 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2324 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2326 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2327 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2328 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2329 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2331 Entity_Id gnat_formal;
2332 Node_Id gnat_actual;
2333 tree gnu_actual_list = NULL_TREE;
2334 tree gnu_name_list = NULL_TREE;
2335 tree gnu_before_list = NULL_TREE;
2336 tree gnu_after_list = NULL_TREE;
2337 tree gnu_subprog_call;
2339 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2341 /* If we are calling a stubbed function, make this into a raise of
2342 Program_Error. Elaborate all our args first. */
2343 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2344 && DECL_STUBBED_P (gnu_subprog_node))
2346 for (gnat_actual = First_Actual (gnat_node);
2347 Present (gnat_actual);
2348 gnat_actual = Next_Actual (gnat_actual))
2349 add_stmt (gnat_to_gnu (gnat_actual));
2353 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2354 N_Raise_Program_Error);
2356 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2358 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2359 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2366 /* If we are calling by supplying a pointer to a target, set up that
2367 pointer as the first argument. Use GNU_TARGET if one was passed;
2368 otherwise, make a target by building a variable of the maximum size
2370 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2372 tree gnu_real_ret_type
2373 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2378 = maybe_pad_type (gnu_real_ret_type,
2379 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2380 0, Etype (Name (gnat_node)), "PAD", false,
2383 /* ??? We may be about to create a static temporary if we happen to
2384 be at the global binding level. That's a regression from what
2385 the 3.x back-end would generate in the same situation, but we
2386 don't have a mechanism in Gigi for creating automatic variables
2387 in the elaboration routines. */
2389 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2390 NULL, false, false, false, false, NULL,
2395 = tree_cons (NULL_TREE,
2396 build_unary_op (ADDR_EXPR, NULL_TREE,
2397 unchecked_convert (gnu_real_ret_type,
2404 /* The only way we can be making a call via an access type is if Name is an
2405 explicit dereference. In that case, get the list of formal args from the
2406 type the access type is pointing to. Otherwise, get the formals from
2407 entity being called. */
2408 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2409 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2410 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2411 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2414 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2416 /* Create the list of the actual parameters as GCC expects it, namely a chain
2417 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2418 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2419 parameters not passed by reference and don't need to be copied in. */
2420 for (gnat_actual = First_Actual (gnat_node);
2421 Present (gnat_actual);
2422 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2423 gnat_actual = Next_Actual (gnat_actual))
2426 = (present_gnu_tree (gnat_formal)
2427 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2428 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2429 /* We must suppress conversions that can cause the creation of a
2430 temporary in the Out or In Out case because we need the real
2431 object in this case, either to pass its address if it's passed
2432 by reference or as target of the back copy done after the call
2433 if it uses the copy-in copy-out mechanism. We do it in the In
2434 case too, except for an unchecked conversion because it alone
2435 can cause the actual to be misaligned and the addressability
2436 test is applied to the real object. */
2437 bool suppress_type_conversion
2438 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2439 && Ekind (gnat_formal) != E_In_Parameter)
2440 || (Nkind (gnat_actual) == N_Type_Conversion
2441 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2442 Node_Id gnat_name = (suppress_type_conversion
2443 ? Expression (gnat_actual) : gnat_actual);
2444 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2447 /* If it's possible we may need to use this expression twice, make sure
2448 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2449 to force side-effects before the call.
2450 ??? This is more conservative than we need since we don't need to do
2451 this for pass-by-ref with no conversion. */
2452 if (Ekind (gnat_formal) != E_In_Parameter)
2453 gnu_name = gnat_stabilize_reference (gnu_name, true);
2455 /* If we are passing a non-addressable parameter by reference, pass the
2456 address of a copy. In the Out or In Out case, set up to copy back
2457 out after the call. */
2459 && (DECL_BY_REF_P (gnu_formal)
2460 || (TREE_CODE (gnu_formal) == PARM_DECL
2461 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2462 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2463 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2464 && !addressable_p (gnu_name, gnu_name_type))
2466 tree gnu_copy = gnu_name, gnu_temp;
2468 /* If the type is by_reference, a copy is not allowed. */
2469 if (Is_By_Reference_Type (Etype (gnat_formal)))
2471 ("misaligned actual cannot be passed by reference", gnat_actual);
2473 /* For users of Starlet we issue a warning because the
2474 interface apparently assumes that by-ref parameters
2475 outlive the procedure invocation. The code still
2476 will not work as intended, but we cannot do much
2477 better since other low-level parts of the back-end
2478 would allocate temporaries at will because of the
2479 misalignment if we did not do so here. */
2480 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2483 ("?possible violation of implicit assumption", gnat_actual);
2485 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2486 Entity (Name (gnat_node)));
2487 post_error_ne ("?because of misalignment of &", gnat_actual,
2491 /* If the actual type of the object is already the nominal type,
2492 we have nothing to do, except if the size is self-referential
2493 in which case we'll remove the unpadding below. */
2494 if (TREE_TYPE (gnu_name) == gnu_name_type
2495 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2498 /* Otherwise remove unpadding from the object and reset the copy. */
2499 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2500 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2502 && (TYPE_IS_PADDING_P
2503 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2504 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2506 /* Otherwise convert to the nominal type of the object if it's
2507 a record type. There are several cases in which we need to
2508 make the temporary using this type instead of the actual type
2509 of the object if they are distinct, because the expectations
2510 of the callee would otherwise not be met:
2511 - if it's a justified modular type,
2512 - if the actual type is a smaller packable version of it. */
2513 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2514 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2515 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2517 gnu_name = convert (gnu_name_type, gnu_name);
2519 /* Make a SAVE_EXPR to both properly account for potential side
2520 effects and handle the creation of a temporary copy. Special
2521 code in gnat_gimplify_expr ensures that the same temporary is
2522 used as the object and copied back after the call if needed. */
2523 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2524 TREE_SIDE_EFFECTS (gnu_name) = 1;
2526 /* Set up to move the copy back to the original. */
2527 if (Ekind (gnat_formal) != E_In_Parameter)
2529 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2531 set_expr_location_from_node (gnu_temp, gnat_node);
2532 append_to_statement_list (gnu_temp, &gnu_after_list);
2536 /* Start from the real object and build the actual. */
2537 gnu_actual = gnu_name;
2539 /* If this was a procedure call, we may not have removed any padding.
2540 So do it here for the part we will use as an input, if any. */
2541 if (Ekind (gnat_formal) != E_Out_Parameter
2542 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2543 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2544 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2547 /* Do any needed conversions for the actual and make sure that it is
2548 in range of the formal's type. */
2549 if (suppress_type_conversion)
2551 /* Put back the conversion we suppressed above in the computation
2552 of the real object. Note that we treat a conversion between
2553 aggregate types as if it is an unchecked conversion here. */
2555 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2557 (Nkind (gnat_actual)
2558 == N_Unchecked_Type_Conversion)
2559 && No_Truncation (gnat_actual));
2561 if (Ekind (gnat_formal) != E_Out_Parameter
2562 && Do_Range_Check (gnat_actual))
2563 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2568 if (Ekind (gnat_formal) != E_Out_Parameter
2569 && Do_Range_Check (gnat_actual))
2570 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2573 /* We may have suppressed a conversion to the Etype of the actual
2574 since the parent is a procedure call. So put it back here.
2575 ??? We use the reverse order compared to the case above because
2576 of an awkward interaction with the check and actually don't put
2577 back the conversion at all if a check is emitted. This is also
2578 done for the conversion to the formal's type just below. */
2579 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2580 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2584 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2585 gnu_actual = convert (gnu_formal_type, gnu_actual);
2587 /* Unless this is an In parameter, we must remove any justified modular
2588 building from GNU_NAME to get an lvalue. */
2589 if (Ekind (gnat_formal) != E_In_Parameter
2590 && TREE_CODE (gnu_name) == CONSTRUCTOR
2591 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2592 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2593 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2596 /* If we have not saved a GCC object for the formal, it means it is an
2597 Out parameter not passed by reference and that does not need to be
2598 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2601 && TREE_CODE (gnu_formal) == PARM_DECL
2602 && DECL_BY_REF_P (gnu_formal))
2604 if (Ekind (gnat_formal) != E_In_Parameter)
2606 /* In Out or Out parameters passed by reference don't use the
2607 copy-in copy-out mechanism so the address of the real object
2608 must be passed to the function. */
2609 gnu_actual = gnu_name;
2611 /* If we have a padded type, be sure we've removed padding. */
2612 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2613 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2614 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2615 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2618 /* If we have the constructed subtype of an aliased object
2619 with an unconstrained nominal subtype, the type of the
2620 actual includes the template, although it is formally
2621 constrained. So we need to convert it back to the real
2622 constructed subtype to retrieve the constrained part
2623 and takes its address. */
2624 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2625 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2626 && TREE_CODE (gnu_actual) != SAVE_EXPR
2627 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2628 && Is_Array_Type (Etype (gnat_actual)))
2629 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2633 /* The symmetry of the paths to the type of an entity is broken here
2634 since arguments don't know that they will be passed by ref. */
2635 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2636 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2639 && TREE_CODE (gnu_formal) == PARM_DECL
2640 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2642 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2643 gnu_actual = maybe_implicit_deref (gnu_actual);
2644 gnu_actual = maybe_unconstrained_array (gnu_actual);
2646 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2647 && TYPE_IS_PADDING_P (gnu_formal_type))
2649 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2650 gnu_actual = convert (gnu_formal_type, gnu_actual);
2653 /* Take the address of the object and convert to the proper pointer
2654 type. We'd like to actually compute the address of the beginning
2655 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2656 possibility that the ARRAY_REF might return a constant and we'd be
2657 getting the wrong address. Neither approach is exactly correct,
2658 but this is the most likely to work in all cases. */
2659 gnu_actual = convert (gnu_formal_type,
2660 build_unary_op (ADDR_EXPR, NULL_TREE,
2664 && TREE_CODE (gnu_formal) == PARM_DECL
2665 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2667 /* If arg is 'Null_Parameter, pass zero descriptor. */
2668 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2669 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2670 && TREE_PRIVATE (gnu_actual))
2671 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2674 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2675 fill_vms_descriptor (gnu_actual,
2681 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2683 if (Ekind (gnat_formal) != E_In_Parameter)
2684 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2686 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2689 /* If this is 'Null_Parameter, pass a zero even though we are
2690 dereferencing it. */
2691 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2692 && TREE_PRIVATE (gnu_actual)
2693 && host_integerp (gnu_actual_size, 1)
2694 && 0 >= compare_tree_int (gnu_actual_size,
2697 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2698 convert (gnat_type_for_size
2699 (tree_low_cst (gnu_actual_size, 1),
2704 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2707 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2710 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2712 nreverse (gnu_actual_list));
2713 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2715 /* If we return by passing a target, the result is the target after the
2716 call. We must not emit the call directly here because this might be
2717 evaluated as part of an expression with conditions to control whether
2718 the call should be emitted or not. */
2719 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2721 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2722 by the target object converted to the proper type. Doing so would
2723 potentially be very inefficient, however, as this expression might
2724 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2725 pointless temporary copy of the whole object.
2727 What we do instead is build a COMPOUND_EXPR returning the address of
2728 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2729 SAVE_EXPR later on then only incurs a pointer copy. */
2731 tree gnu_result_type
2732 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2735 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2737 tree gnu_target_address
2738 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2739 set_expr_location_from_node (gnu_target_address, gnat_node);
2742 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2743 gnu_subprog_call, gnu_target_address);
2746 = unchecked_convert (gnu_result_type,
2747 build_unary_op (INDIRECT_REF, NULL_TREE,
2751 *gnu_result_type_p = gnu_result_type;
2755 /* If it is a function call, the result is the call expression unless
2756 a target is specified, in which case we copy the result into the target
2757 and return the assignment statement. */
2758 else if (Nkind (gnat_node) == N_Function_Call)
2760 gnu_result = gnu_subprog_call;
2762 /* If the function returns an unconstrained array or by reference,
2763 we have to de-dereference the pointer. */
2764 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2765 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2766 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2769 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2770 gnu_target, gnu_result);
2772 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2777 /* If this is the case where the GNAT tree contains a procedure call
2778 but the Ada procedure has copy in copy out parameters, the special
2779 parameter passing mechanism must be used. */
2780 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2782 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2783 in copy out parameters. */
2784 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2785 int length = list_length (scalar_return_list);
2791 gnu_subprog_call = save_expr (gnu_subprog_call);
2792 gnu_name_list = nreverse (gnu_name_list);
2794 /* If any of the names had side-effects, ensure they are all
2795 evaluated before the call. */
2796 for (gnu_name = gnu_name_list; gnu_name;
2797 gnu_name = TREE_CHAIN (gnu_name))
2798 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2799 append_to_statement_list (TREE_VALUE (gnu_name),
2803 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2804 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2806 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2808 for (gnat_actual = First_Actual (gnat_node);
2809 Present (gnat_actual);
2810 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2811 gnat_actual = Next_Actual (gnat_actual))
2812 /* If we are dealing with a copy in copy out parameter, we must
2813 retrieve its value from the record returned in the call. */
2814 if (!(present_gnu_tree (gnat_formal)
2815 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2816 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2817 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2818 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2819 || (DECL_BY_DESCRIPTOR_P
2820 (get_gnu_tree (gnat_formal))))))))
2821 && Ekind (gnat_formal) != E_In_Parameter)
2823 /* Get the value to assign to this Out or In Out parameter. It is
2824 either the result of the function if there is only a single such
2825 parameter or the appropriate field from the record returned. */
2827 = length == 1 ? gnu_subprog_call
2828 : build_component_ref (gnu_subprog_call, NULL_TREE,
2829 TREE_PURPOSE (scalar_return_list),
2832 /* If the actual is a conversion, get the inner expression, which
2833 will be the real destination, and convert the result to the
2834 type of the actual parameter. */
2836 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2838 /* If the result is a padded type, remove the padding. */
2839 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2840 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2841 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2842 (TREE_TYPE (gnu_result))),
2845 /* If the actual is a type conversion, the real target object is
2846 denoted by the inner Expression and we need to convert the
2847 result to the associated type.
2848 We also need to convert our gnu assignment target to this type
2849 if the corresponding GNU_NAME was constructed from the GNAT
2850 conversion node and not from the inner Expression. */
2851 if (Nkind (gnat_actual) == N_Type_Conversion)
2854 = convert_with_check
2855 (Etype (Expression (gnat_actual)), gnu_result,
2856 Do_Overflow_Check (gnat_actual),
2857 Do_Range_Check (Expression (gnat_actual)),
2858 Float_Truncate (gnat_actual), gnat_actual);
2860 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2861 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2864 /* Unchecked conversions as actuals for Out parameters are not
2865 allowed in user code because they are not variables, but do
2866 occur in front-end expansions. The associated GNU_NAME is
2867 always obtained from the inner expression in such cases. */
2868 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2869 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2871 No_Truncation (gnat_actual));
2874 if (Do_Range_Check (gnat_actual))
2876 = emit_range_check (gnu_result, Etype (gnat_actual),
2879 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2880 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2881 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2884 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2885 gnu_actual, gnu_result);
2886 set_expr_location_from_node (gnu_result, gnat_node);
2887 append_to_statement_list (gnu_result, &gnu_before_list);
2888 scalar_return_list = TREE_CHAIN (scalar_return_list);
2889 gnu_name_list = TREE_CHAIN (gnu_name_list);
2893 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2895 append_to_statement_list (gnu_after_list, &gnu_before_list);
2896 return gnu_before_list;
2899 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2900 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2903 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2905 tree gnu_jmpsave_decl = NULL_TREE;
2906 tree gnu_jmpbuf_decl = NULL_TREE;
2907 /* If just annotating, ignore all EH and cleanups. */
2908 bool gcc_zcx = (!type_annotate_only
2909 && Present (Exception_Handlers (gnat_node))
2910 && Exception_Mechanism == Back_End_Exceptions);
2912 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2913 && Exception_Mechanism == Setjmp_Longjmp);
2914 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2915 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2916 tree gnu_inner_block; /* The statement(s) for the block itself. */
2921 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2922 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2923 add_cleanup, and when we leave the binding, end_stmt_group will create
2924 the TRY_FINALLY_EXPR.
2926 ??? The region level calls down there have been specifically put in place
2927 for a ZCX context and currently the order in which things are emitted
2928 (region/handlers) is different from the SJLJ case. Instead of putting
2929 other calls with different conditions at other places for the SJLJ case,
2930 it seems cleaner to reorder things for the SJLJ case and generalize the
2931 condition to make it not ZCX specific.
2933 If there are any exceptions or cleanup processing involved, we need an
2934 outer statement group (for Setjmp_Longjmp) and binding level. */
2935 if (binding_for_block)
2937 start_stmt_group ();
2941 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2942 area for address of previous buffer. Do this first since we need to have
2943 the setjmp buf known for any decls in this block. */
2946 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2947 NULL_TREE, jmpbuf_ptr_type,
2948 build_call_0_expr (get_jmpbuf_decl),
2949 false, false, false, false, NULL,
2951 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2953 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2954 because of the unstructured form of EH used by setjmp_longjmp, there
2955 might be forward edges going to __builtin_setjmp receivers on which
2956 it is uninitialized, although they will never be actually taken. */
2957 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2958 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2959 NULL_TREE, jmpbuf_type,
2960 NULL_TREE, false, false, false, false,
2962 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2964 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2966 /* When we exit this block, restore the saved value. */
2967 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2968 End_Label (gnat_node));
2971 /* If we are to call a function when exiting this block, add a cleanup
2972 to the binding level we made above. Note that add_cleanup is FIFO
2973 so we must register this cleanup after the EH cleanup just above. */
2975 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2976 End_Label (gnat_node));
2978 /* Now build the tree for the declarations and statements inside this block.
2979 If this is SJLJ, set our jmp_buf as the current buffer. */
2980 start_stmt_group ();
2983 add_stmt (build_call_1_expr (set_jmpbuf_decl,
2984 build_unary_op (ADDR_EXPR, NULL_TREE,
2987 if (Present (First_Real_Statement (gnat_node)))
2988 process_decls (Statements (gnat_node), Empty,
2989 First_Real_Statement (gnat_node), true, true);
2991 /* Generate code for each statement in the block. */
2992 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
2993 ? First_Real_Statement (gnat_node)
2994 : First (Statements (gnat_node)));
2995 Present (gnat_temp); gnat_temp = Next (gnat_temp))
2996 add_stmt (gnat_to_gnu (gnat_temp));
2997 gnu_inner_block = end_stmt_group ();
2999 /* Now generate code for the two exception models, if either is relevant for
3003 tree *gnu_else_ptr = 0;
3006 /* Make a binding level for the exception handling declarations and code
3007 and set up gnu_except_ptr_stack for the handlers to use. */
3008 start_stmt_group ();
3011 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3012 create_var_decl (get_identifier ("EXCEPT_PTR"),
3014 build_pointer_type (except_type_node),
3015 build_call_0_expr (get_excptr_decl), false,
3016 false, false, false, NULL, gnat_node));
3018 /* Generate code for each handler. The N_Exception_Handler case does the
3019 real work and returns a COND_EXPR for each handler, which we chain
3021 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3022 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3024 gnu_expr = gnat_to_gnu (gnat_temp);
3026 /* If this is the first one, set it as the outer one. Otherwise,
3027 point the "else" part of the previous handler to us. Then point
3028 to our "else" part. */
3030 add_stmt (gnu_expr);
3032 *gnu_else_ptr = gnu_expr;
3034 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3037 /* If none of the exception handlers did anything, re-raise but do not
3039 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3040 TREE_VALUE (gnu_except_ptr_stack));
3041 set_expr_location_from_node (gnu_expr, gnat_node);
3044 *gnu_else_ptr = gnu_expr;
3046 add_stmt (gnu_expr);
3048 /* End the binding level dedicated to the exception handlers and get the
3049 whole statement group. */
3050 pop_stack (&gnu_except_ptr_stack);
3052 gnu_handler = end_stmt_group ();
3054 /* If the setjmp returns 1, we restore our incoming longjmp value and
3055 then check the handlers. */
3056 start_stmt_group ();
3057 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3060 add_stmt (gnu_handler);
3061 gnu_handler = end_stmt_group ();
3063 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3064 gnu_result = build3 (COND_EXPR, void_type_node,
3067 build_unary_op (ADDR_EXPR, NULL_TREE,
3069 gnu_handler, gnu_inner_block);
3075 /* First make a block containing the handlers. */
3076 start_stmt_group ();
3077 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3078 Present (gnat_temp);
3079 gnat_temp = Next_Non_Pragma (gnat_temp))
3080 add_stmt (gnat_to_gnu (gnat_temp));
3081 gnu_handlers = end_stmt_group ();
3083 /* Now make the TRY_CATCH_EXPR for the block. */
3084 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3085 gnu_inner_block, gnu_handlers);
3088 gnu_result = gnu_inner_block;
3090 /* Now close our outer block, if we had to make one. */
3091 if (binding_for_block)
3093 add_stmt (gnu_result);
3095 gnu_result = end_stmt_group ();
3101 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3102 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3103 exception handling. */
3106 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3108 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3109 an "if" statement to select the proper exceptions. For "Others", exclude
3110 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3111 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3112 tree gnu_choice = integer_zero_node;
3113 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3116 for (gnat_temp = First (Exception_Choices (gnat_node));
3117 gnat_temp; gnat_temp = Next (gnat_temp))
3121 if (Nkind (gnat_temp) == N_Others_Choice)
3123 if (All_Others (gnat_temp))
3124 this_choice = integer_one_node;
3128 (EQ_EXPR, integer_type_node,
3133 (INDIRECT_REF, NULL_TREE,
3134 TREE_VALUE (gnu_except_ptr_stack)),
3135 get_identifier ("not_handled_by_others"), NULL_TREE,
3140 else if (Nkind (gnat_temp) == N_Identifier
3141 || Nkind (gnat_temp) == N_Expanded_Name)
3143 Entity_Id gnat_ex_id = Entity (gnat_temp);
3146 /* Exception may be a renaming. Recover original exception which is
3147 the one elaborated and registered. */
3148 if (Present (Renamed_Object (gnat_ex_id)))
3149 gnat_ex_id = Renamed_Object (gnat_ex_id);
3151 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3155 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3156 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3157 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3159 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3160 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3162 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3165 = build_component_ref
3166 (build_unary_op (INDIRECT_REF, NULL_TREE,
3167 TREE_VALUE (gnu_except_ptr_stack)),
3168 get_identifier ("lang"), NULL_TREE, false);
3172 (TRUTH_ORIF_EXPR, integer_type_node,
3173 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3174 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3181 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3182 gnu_choice, this_choice);
3185 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3188 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3189 to a GCC tree, which is returned. This is the variant for ZCX. */
3192 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3194 tree gnu_etypes_list = NULL_TREE;
3197 tree gnu_current_exc_ptr;
3198 tree gnu_incoming_exc_ptr;
3201 /* We build a TREE_LIST of nodes representing what exception types this
3202 handler can catch, with special cases for others and all others cases.
3204 Each exception type is actually identified by a pointer to the exception
3205 id, or to a dummy object for "others" and "all others".
3207 Care should be taken to ensure that the control flow impact of "others"
3208 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3210 for (gnat_temp = First (Exception_Choices (gnat_node));
3211 gnat_temp; gnat_temp = Next (gnat_temp))
3213 if (Nkind (gnat_temp) == N_Others_Choice)
3216 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3219 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3221 else if (Nkind (gnat_temp) == N_Identifier
3222 || Nkind (gnat_temp) == N_Expanded_Name)
3224 Entity_Id gnat_ex_id = Entity (gnat_temp);
3226 /* Exception may be a renaming. Recover original exception which is
3227 the one elaborated and registered. */
3228 if (Present (Renamed_Object (gnat_ex_id)))
3229 gnat_ex_id = Renamed_Object (gnat_ex_id);
3231 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3232 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3234 /* The Non_Ada_Error case for VMS exceptions is handled
3235 by the personality routine. */
3240 /* The GCC interface expects NULL to be passed for catch all handlers, so
3241 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3242 is integer_zero_node. It would not work, however, because GCC's
3243 notion of "catch all" is stronger than our notion of "others". Until
3244 we correctly use the cleanup interface as well, doing that would
3245 prevent the "all others" handlers from being seen, because nothing
3246 can be caught beyond a catch all from GCC's point of view. */
3247 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3250 start_stmt_group ();
3253 /* Expand a call to the begin_handler hook at the beginning of the handler,
3254 and arrange for a call to the end_handler hook to occur on every possible
3257 The hooks expect a pointer to the low level occurrence. This is required
3258 for our stack management scheme because a raise inside the handler pushes
3259 a new occurrence on top of the stack, which means that this top does not
3260 necessarily match the occurrence this handler was dealing with.
3262 The EXC_PTR_EXPR object references the exception occurrence being
3263 propagated. Upon handler entry, this is the exception for which the
3264 handler is triggered. This might not be the case upon handler exit,
3265 however, as we might have a new occurrence propagated by the handler's
3266 body, and the end_handler hook called as a cleanup in this context.
3268 We use a local variable to retrieve the incoming value at handler entry
3269 time, and reuse it to feed the end_handler hook's argument at exit. */
3270 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3271 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3272 ptr_type_node, gnu_current_exc_ptr,
3273 false, false, false, false, NULL,
3276 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3277 gnu_incoming_exc_ptr),
3279 /* ??? We don't seem to have an End_Label at hand to set the location. */
3280 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3282 add_stmt_list (Statements (gnat_node));
3285 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3289 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3292 Compilation_Unit_to_gnu (Node_Id gnat_node)
3294 /* Make the decl for the elaboration procedure. */
3295 bool body_p = (Defining_Entity (Unit (gnat_node)),
3296 Nkind (Unit (gnat_node)) == N_Package_Body
3297 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3298 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3299 tree gnu_elab_proc_decl
3300 = create_subprog_decl
3301 (create_concat_name (gnat_unit_entity,
3302 body_p ? "elabb" : "elabs"),
3303 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3305 struct elab_info *info;
3307 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3309 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3310 allocate_struct_function (gnu_elab_proc_decl, false);
3311 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3314 /* For a body, first process the spec if there is one. */
3315 if (Nkind (Unit (gnat_node)) == N_Package_Body
3316 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3317 && !Acts_As_Spec (gnat_node)))
3319 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3320 finalize_from_with_types ();
3323 process_inlined_subprograms (gnat_node);
3325 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3327 elaborate_all_entities (gnat_node);
3329 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3330 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3331 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3335 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3337 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3339 /* Process any pragmas and actions following the unit. */
3340 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3341 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3342 finalize_from_with_types ();
3344 /* Save away what we've made so far and record this potential elaboration
3346 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3347 set_current_block_context (gnu_elab_proc_decl);
3349 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3350 info->next = elab_info_list;
3351 info->elab_proc = gnu_elab_proc_decl;
3352 info->gnat_node = gnat_node;
3353 elab_info_list = info;
3355 /* Generate elaboration code for this unit, if necessary, and say whether
3357 pop_stack (&gnu_elab_proc_stack);
3359 /* Invalidate the global renaming pointers. This is necessary because
3360 stabilization of the renamed entities may create SAVE_EXPRs which
3361 have been tied to a specific elaboration routine just above. */
3362 invalidate_global_renaming_pointers ();
3365 /* Return whether GNAT_NODE, an unchecked type conversion, is on the LHS
3366 of an assignment and a no-op as far as gigi is concerned. */
3369 unchecked_conversion_lhs_nop (Node_Id gnat_node)
3371 Entity_Id from_type, to_type;
3373 /* The conversion must be on the LHS of an assignment. Otherwise, even
3374 if the conversion was essentially a no-op, it could de facto ensure
3375 type consistency and this should be preserved. */
3376 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3377 && Name (Parent (gnat_node)) == gnat_node))
3380 from_type = Etype (Expression (gnat_node));
3382 /* We're interested in artificial conversions generated by the front-end
3383 to make private types explicit, e.g. in Expand_Assign_Array. */
3384 if (!Is_Private_Type (from_type))
3387 from_type = Underlying_Type (from_type);
3388 to_type = Etype (gnat_node);
3390 /* The direct conversion to the underlying type is a no-op. */
3391 if (to_type == from_type)
3394 /* For an array type, the conversion to the PAT is a no-op. */
3395 if (Ekind (from_type) == E_Array_Subtype
3396 && to_type == Packed_Array_Type (from_type))
3402 /* This function is the driver of the GNAT to GCC tree transformation
3403 process. It is the entry point of the tree transformer. GNAT_NODE is the
3404 root of some GNAT tree. Return the root of the corresponding GCC tree.
3405 If this is an expression, return the GCC equivalent of the expression. If
3406 it is a statement, return the statement. In the case when called for a
3407 statement, it may also add statements to the current statement group, in
3408 which case anything it returns is to be interpreted as occurring after
3409 anything `it already added. */
3412 gnat_to_gnu (Node_Id gnat_node)
3414 bool went_into_elab_proc = false;
3415 tree gnu_result = error_mark_node; /* Default to no value. */
3416 tree gnu_result_type = void_type_node;
3418 tree gnu_lhs, gnu_rhs;
3421 /* Save node number for error message and set location information. */
3422 error_gnat_node = gnat_node;
3423 Sloc_to_locus (Sloc (gnat_node), &input_location);
3425 if (type_annotate_only
3426 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3427 return alloc_stmt_list ();
3429 /* If this node is a non-static subexpression and we are only
3430 annotating types, make this into a NULL_EXPR. */
3431 if (type_annotate_only
3432 && IN (Nkind (gnat_node), N_Subexpr)
3433 && Nkind (gnat_node) != N_Identifier
3434 && !Compile_Time_Known_Value (gnat_node))
3435 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3436 build_call_raise (CE_Range_Check_Failed, gnat_node,
3437 N_Raise_Constraint_Error));
3439 /* If this is a Statement and we are at top level, it must be part of the
3440 elaboration procedure, so mark us as being in that procedure and push our
3443 If we are in the elaboration procedure, check if we are violating a
3444 No_Elaboration_Code restriction by having a statement there. */
3445 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3446 && Nkind (gnat_node) != N_Null_Statement)
3447 || Nkind (gnat_node) == N_Procedure_Call_Statement
3448 || Nkind (gnat_node) == N_Label
3449 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3450 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3451 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3452 || Nkind (gnat_node) == N_Raise_Storage_Error
3453 || Nkind (gnat_node) == N_Raise_Program_Error)
3454 && (Ekind (Etype (gnat_node)) == E_Void)))
3456 if (!current_function_decl)
3458 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3459 start_stmt_group ();
3461 went_into_elab_proc = true;
3464 /* Don't check for a possible No_Elaboration_Code restriction violation
3465 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3466 every nested real statement instead. This also avoids triggering
3467 spurious errors on dummy (empty) sequences created by the front-end
3468 for package bodies in some cases. */
3470 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3471 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3472 Check_Elaboration_Code_Allowed (gnat_node);
3475 switch (Nkind (gnat_node))
3477 /********************************/
3478 /* Chapter 2: Lexical Elements */
3479 /********************************/
3482 case N_Expanded_Name:
3483 case N_Operator_Symbol:
3484 case N_Defining_Identifier:
3485 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3488 case N_Integer_Literal:
3492 /* Get the type of the result, looking inside any padding and
3493 justified modular types. Then get the value in that type. */
3494 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3496 if (TREE_CODE (gnu_type) == RECORD_TYPE
3497 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3498 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3500 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3502 /* If the result overflows (meaning it doesn't fit in its base type),
3503 abort. We would like to check that the value is within the range
3504 of the subtype, but that causes problems with subtypes whose usage
3505 will raise Constraint_Error and with biased representation, so
3507 gcc_assert (!TREE_OVERFLOW (gnu_result));
3511 case N_Character_Literal:
3512 /* If a Entity is present, it means that this was one of the
3513 literals in a user-defined character type. In that case,
3514 just return the value in the CONST_DECL. Otherwise, use the
3515 character code. In that case, the base type should be an
3516 INTEGER_TYPE, but we won't bother checking for that. */
3517 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3518 if (Present (Entity (gnat_node)))
3519 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3522 = build_int_cst_type
3523 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3526 case N_Real_Literal:
3527 /* If this is of a fixed-point type, the value we want is the
3528 value of the corresponding integer. */
3529 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3531 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3532 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3534 gcc_assert (!TREE_OVERFLOW (gnu_result));
3537 /* We should never see a Vax_Float type literal, since the front end
3538 is supposed to transform these using appropriate conversions. */
3539 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3544 Ureal ur_realval = Realval (gnat_node);
3546 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3548 /* If the real value is zero, so is the result. Otherwise,
3549 convert it to a machine number if it isn't already. That
3550 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3551 if (UR_Is_Zero (ur_realval))
3552 gnu_result = convert (gnu_result_type, integer_zero_node);
3555 if (!Is_Machine_Number (gnat_node))
3557 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3558 ur_realval, Round_Even, gnat_node);
3561 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3563 /* If we have a base of zero, divide by the denominator.
3564 Otherwise, the base must be 2 and we scale the value, which
3565 we know can fit in the mantissa of the type (hence the use
3566 of that type above). */
3567 if (No (Rbase (ur_realval)))
3569 = build_binary_op (RDIV_EXPR,
3570 get_base_type (gnu_result_type),
3572 UI_To_gnu (Denominator (ur_realval),
3576 REAL_VALUE_TYPE tmp;
3578 gcc_assert (Rbase (ur_realval) == 2);
3579 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3580 - UI_To_Int (Denominator (ur_realval)));
3581 gnu_result = build_real (gnu_result_type, tmp);
3585 /* Now see if we need to negate the result. Do it this way to
3586 properly handle -0. */
3587 if (UR_Is_Negative (Realval (gnat_node)))
3589 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3595 case N_String_Literal:
3596 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3597 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3599 String_Id gnat_string = Strval (gnat_node);
3600 int length = String_Length (gnat_string);
3603 if (length >= ALLOCA_THRESHOLD)
3604 string = XNEWVEC (char, length + 1);
3606 string = (char *) alloca (length + 1);
3608 /* Build the string with the characters in the literal. Note
3609 that Ada strings are 1-origin. */
3610 for (i = 0; i < length; i++)
3611 string[i] = Get_String_Char (gnat_string, i + 1);
3613 /* Put a null at the end of the string in case it's in a context
3614 where GCC will want to treat it as a C string. */
3617 gnu_result = build_string (length, string);
3619 /* Strings in GCC don't normally have types, but we want
3620 this to not be converted to the array type. */
3621 TREE_TYPE (gnu_result) = gnu_result_type;
3623 if (length >= ALLOCA_THRESHOLD)
3628 /* Build a list consisting of each character, then make
3630 String_Id gnat_string = Strval (gnat_node);
3631 int length = String_Length (gnat_string);
3633 tree gnu_list = NULL_TREE;
3634 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3636 for (i = 0; i < length; i++)
3639 = tree_cons (gnu_idx,
3640 build_int_cst (TREE_TYPE (gnu_result_type),
3641 Get_String_Char (gnat_string,
3645 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3650 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3655 gnu_result = Pragma_to_gnu (gnat_node);
3658 /**************************************/
3659 /* Chapter 3: Declarations and Types */
3660 /**************************************/
3662 case N_Subtype_Declaration:
3663 case N_Full_Type_Declaration:
3664 case N_Incomplete_Type_Declaration:
3665 case N_Private_Type_Declaration:
3666 case N_Private_Extension_Declaration:
3667 case N_Task_Type_Declaration:
3668 process_type (Defining_Entity (gnat_node));
3669 gnu_result = alloc_stmt_list ();
3672 case N_Object_Declaration:
3673 case N_Exception_Declaration:
3674 gnat_temp = Defining_Entity (gnat_node);
3675 gnu_result = alloc_stmt_list ();
3677 /* If we are just annotating types and this object has an unconstrained
3678 or task type, don't elaborate it. */
3679 if (type_annotate_only
3680 && (((Is_Array_Type (Etype (gnat_temp))
3681 || Is_Record_Type (Etype (gnat_temp)))
3682 && !Is_Constrained (Etype (gnat_temp)))
3683 || Is_Concurrent_Type (Etype (gnat_temp))))
3686 if (Present (Expression (gnat_node))
3687 && !(Nkind (gnat_node) == N_Object_Declaration
3688 && No_Initialization (gnat_node))
3689 && (!type_annotate_only
3690 || Compile_Time_Known_Value (Expression (gnat_node))))
3692 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3693 if (Do_Range_Check (Expression (gnat_node)))
3695 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3697 /* If this object has its elaboration delayed, we must force
3698 evaluation of GNU_EXPR right now and save it for when the object
3700 if (Present (Freeze_Node (gnat_temp)))
3702 if ((Is_Public (gnat_temp) || global_bindings_p ())
3703 && !TREE_CONSTANT (gnu_expr))
3705 = create_var_decl (create_concat_name (gnat_temp, "init"),
3706 NULL_TREE, TREE_TYPE (gnu_expr),
3707 gnu_expr, false, Is_Public (gnat_temp),
3708 false, false, NULL, gnat_temp);
3710 gnu_expr = maybe_variable (gnu_expr);
3712 save_gnu_tree (gnat_node, gnu_expr, true);
3716 gnu_expr = NULL_TREE;
3718 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3719 gnu_expr = NULL_TREE;
3721 /* If this is a deferred constant with an address clause, we ignore the
3722 full view since the clause is on the partial view and we cannot have
3723 2 different GCC trees for the object. The only bits of the full view
3724 we will use is the initializer, but it will be directly fetched. */
3725 if (Ekind(gnat_temp) == E_Constant
3726 && Present (Address_Clause (gnat_temp))
3727 && Present (Full_View (gnat_temp)))
3728 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3730 if (No (Freeze_Node (gnat_temp)))
3731 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3734 case N_Object_Renaming_Declaration:
3735 gnat_temp = Defining_Entity (gnat_node);
3737 /* Don't do anything if this renaming is handled by the front end or if
3738 we are just annotating types and this object has a composite or task
3739 type, don't elaborate it. We return the result in case it has any
3740 SAVE_EXPRs in it that need to be evaluated here. */
3741 if (!Is_Renaming_Of_Object (gnat_temp)
3742 && ! (type_annotate_only
3743 && (Is_Array_Type (Etype (gnat_temp))
3744 || Is_Record_Type (Etype (gnat_temp))
3745 || Is_Concurrent_Type (Etype (gnat_temp)))))
3747 = gnat_to_gnu_entity (gnat_temp,
3748 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3750 gnu_result = alloc_stmt_list ();
3753 case N_Implicit_Label_Declaration:
3754 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3755 gnu_result = alloc_stmt_list ();
3758 case N_Exception_Renaming_Declaration:
3759 case N_Number_Declaration:
3760 case N_Package_Renaming_Declaration:
3761 case N_Subprogram_Renaming_Declaration:
3762 /* These are fully handled in the front end. */
3763 gnu_result = alloc_stmt_list ();
3766 /*************************************/
3767 /* Chapter 4: Names and Expressions */
3768 /*************************************/
3770 case N_Explicit_Dereference:
3771 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3772 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3773 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3776 case N_Indexed_Component:
3778 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3782 Node_Id *gnat_expr_array;
3784 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3785 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3787 /* If we got a padded type, remove it too. */
3788 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3789 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3791 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3794 gnu_result = gnu_array_object;
3796 /* First compute the number of dimensions of the array, then
3797 fill the expression array, the order depending on whether
3798 this is a Convention_Fortran array or not. */
3799 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3800 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3801 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3802 ndim++, gnu_type = TREE_TYPE (gnu_type))
3805 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3807 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3808 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3810 i--, gnat_temp = Next (gnat_temp))
3811 gnat_expr_array[i] = gnat_temp;
3813 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3815 i++, gnat_temp = Next (gnat_temp))
3816 gnat_expr_array[i] = gnat_temp;
3818 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3819 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3821 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3822 gnat_temp = gnat_expr_array[i];
3823 gnu_expr = gnat_to_gnu (gnat_temp);
3825 if (Do_Range_Check (gnat_temp))
3828 (gnu_array_object, gnu_expr,
3829 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3830 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3833 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3834 gnu_result, gnu_expr);
3838 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3844 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3846 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3847 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3849 /* Do any implicit dereferences of the prefix and do any needed
3851 gnu_result = maybe_implicit_deref (gnu_result);
3852 gnu_result = maybe_unconstrained_array (gnu_result);
3853 gnu_type = TREE_TYPE (gnu_result);
3854 if (Do_Range_Check (gnat_range_node))
3856 /* Get the bounds of the slice. */
3858 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3859 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3860 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3861 /* Get the permitted bounds. */
3862 tree gnu_base_index_type
3863 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3864 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3865 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3866 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3867 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3868 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3870 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3871 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3873 /* Derive a good type to convert everything to. */
3874 gnu_expr_type = get_base_type (gnu_index_type);
3876 /* Test whether the minimum slice value is too small. */
3877 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3878 convert (gnu_expr_type,
3880 convert (gnu_expr_type,
3881 gnu_base_min_expr));
3883 /* Test whether the maximum slice value is too large. */
3884 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3885 convert (gnu_expr_type,
3887 convert (gnu_expr_type,
3888 gnu_base_max_expr));
3890 /* Build a slice index check that returns the low bound,
3891 assuming the slice is not empty. */
3892 gnu_expr = emit_check
3893 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3894 gnu_expr_l, gnu_expr_h),
3895 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3897 /* Build a conditional expression that does the index checks and
3898 returns the low bound if the slice is not empty (max >= min),
3899 and returns the naked low bound otherwise (max < min), unless
3900 it is non-constant and the high bound is; this prevents VRP
3901 from inferring bogus ranges on the unlikely path. */
3902 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3903 build_binary_op (GE_EXPR, gnu_expr_type,
3904 convert (gnu_expr_type,
3906 convert (gnu_expr_type,
3909 TREE_CODE (gnu_min_expr) != INTEGER_CST
3910 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3911 ? gnu_max_expr : gnu_min_expr);
3914 /* Simply return the naked low bound. */
3915 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3917 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3918 gnu_result, gnu_expr);
3922 case N_Selected_Component:
3924 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3925 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3926 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3929 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3930 || IN (Ekind (gnat_pref_type), Access_Kind))
3932 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3933 gnat_pref_type = Underlying_Type (gnat_pref_type);
3934 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3935 gnat_pref_type = Designated_Type (gnat_pref_type);
3938 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3940 /* For discriminant references in tagged types always substitute the
3941 corresponding discriminant as the actual selected component. */
3942 if (Is_Tagged_Type (gnat_pref_type))
3943 while (Present (Corresponding_Discriminant (gnat_field)))
3944 gnat_field = Corresponding_Discriminant (gnat_field);
3946 /* For discriminant references of untagged types always substitute the
3947 corresponding stored discriminant. */
3948 else if (Present (Corresponding_Discriminant (gnat_field)))
3949 gnat_field = Original_Record_Component (gnat_field);
3951 /* Handle extracting the real or imaginary part of a complex.
3952 The real part is the first field and the imaginary the last. */
3953 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3954 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3955 ? REALPART_EXPR : IMAGPART_EXPR,
3956 NULL_TREE, gnu_prefix);
3959 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3961 /* If there are discriminants, the prefix might be evaluated more
3962 than once, which is a problem if it has side-effects. */
3963 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3964 ? Designated_Type (Etype
3965 (Prefix (gnat_node)))
3966 : Etype (Prefix (gnat_node))))
3967 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3970 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3971 (Nkind (Parent (gnat_node))
3972 == N_Attribute_Reference));
3975 gcc_assert (gnu_result);
3976 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3980 case N_Attribute_Reference:
3982 /* The attribute designator (like an enumeration value). */
3983 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
3985 /* The Elab_Spec and Elab_Body attributes are special in that
3986 Prefix is a unit, not an object with a GCC equivalent. Similarly
3987 for Elaborated, since that variable isn't otherwise known. */
3988 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
3989 return (create_subprog_decl
3990 (create_concat_name (Entity (Prefix (gnat_node)),
3991 attribute == Attr_Elab_Body
3992 ? "elabb" : "elabs"),
3993 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
3996 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4001 /* Like 'Access as far as we are concerned. */
4002 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4003 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4004 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4008 case N_Extension_Aggregate:
4012 /* ??? It is wrong to evaluate the type now, but there doesn't
4013 seem to be any other practical way of doing it. */
4015 gcc_assert (!Expansion_Delayed (gnat_node));
4017 gnu_aggr_type = gnu_result_type
4018 = get_unpadded_type (Etype (gnat_node));
4020 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4021 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4023 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4025 if (Null_Record_Present (gnat_node))
4026 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4028 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4029 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4031 = assoc_to_constructor (Etype (gnat_node),
4032 First (Component_Associations (gnat_node)),
4034 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4035 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4037 Component_Type (Etype (gnat_node)));
4038 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4041 (COMPLEX_EXPR, gnu_aggr_type,
4042 gnat_to_gnu (Expression (First
4043 (Component_Associations (gnat_node)))),
4044 gnat_to_gnu (Expression
4046 (First (Component_Associations (gnat_node))))));
4050 gnu_result = convert (gnu_result_type, gnu_result);
4055 if (TARGET_VTABLE_USES_DESCRIPTORS
4056 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4057 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4058 gnu_result = null_fdesc_node;
4060 gnu_result = null_pointer_node;
4061 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4064 case N_Type_Conversion:
4065 case N_Qualified_Expression:
4066 /* Get the operand expression. */
4067 gnu_result = gnat_to_gnu (Expression (gnat_node));
4068 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4071 = convert_with_check (Etype (gnat_node), gnu_result,
4072 Do_Overflow_Check (gnat_node),
4073 Do_Range_Check (Expression (gnat_node)),
4074 Nkind (gnat_node) == N_Type_Conversion
4075 && Float_Truncate (gnat_node), gnat_node);
4078 case N_Unchecked_Type_Conversion:
4079 gnu_result = gnat_to_gnu (Expression (gnat_node));
4081 /* Skip further processing if the conversion is deemed a no-op. */
4082 if (unchecked_conversion_lhs_nop (gnat_node))
4084 gnu_result_type = TREE_TYPE (gnu_result);
4088 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4090 /* If the result is a pointer type, see if we are improperly
4091 converting to a stricter alignment. */
4092 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4093 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4095 unsigned int align = known_alignment (gnu_result);
4096 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4097 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4099 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4100 post_error_ne_tree_2
4101 ("?source alignment (^) '< alignment of & (^)",
4102 gnat_node, Designated_Type (Etype (gnat_node)),
4103 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4106 /* If we are converting a descriptor to a function pointer, first
4107 build the pointer. */
4108 if (TARGET_VTABLE_USES_DESCRIPTORS
4109 && TREE_TYPE (gnu_result) == fdesc_type_node
4110 && POINTER_TYPE_P (gnu_result_type))
4111 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4113 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4114 No_Truncation (gnat_node));
4120 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4121 Node_Id gnat_range = Right_Opnd (gnat_node);
4125 /* GNAT_RANGE is either an N_Range node or an identifier
4126 denoting a subtype. */
4127 if (Nkind (gnat_range) == N_Range)
4129 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4130 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4132 else if (Nkind (gnat_range) == N_Identifier
4133 || Nkind (gnat_range) == N_Expanded_Name)
4135 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4137 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4138 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4143 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4145 /* If LOW and HIGH are identical, perform an equality test.
4146 Otherwise, ensure that GNU_OBJECT is only evaluated once
4147 and perform a full range test. */
4148 if (operand_equal_p (gnu_low, gnu_high, 0))
4149 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4150 gnu_object, gnu_low);
4153 gnu_object = protect_multiple_eval (gnu_object);
4155 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4156 build_binary_op (GE_EXPR, gnu_result_type,
4157 gnu_object, gnu_low),
4158 build_binary_op (LE_EXPR, gnu_result_type,
4159 gnu_object, gnu_high));
4162 if (Nkind (gnat_node) == N_Not_In)
4163 gnu_result = invert_truthvalue (gnu_result);
4168 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4169 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4170 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4171 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4173 : (Rounded_Result (gnat_node)
4174 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4175 gnu_result_type, gnu_lhs, gnu_rhs);
4178 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4179 /* These can either be operations on booleans or on modular types.
4180 Fall through for boolean types since that's the way GNU_CODES is
4182 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4183 Modular_Integer_Kind))
4186 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4187 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4190 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4191 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4192 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4193 gnu_result = build_binary_op (code, gnu_result_type,
4198 /* ... fall through ... */
4200 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4201 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4202 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4203 case N_Op_Mod: case N_Op_Rem:
4204 case N_Op_Rotate_Left:
4205 case N_Op_Rotate_Right:
4206 case N_Op_Shift_Left:
4207 case N_Op_Shift_Right:
4208 case N_Op_Shift_Right_Arithmetic:
4209 case N_And_Then: case N_Or_Else:
4211 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4212 bool ignore_lhs_overflow = false;
4215 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4216 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4217 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4219 /* If this is a comparison operator, convert any references to
4220 an unconstrained array value into a reference to the
4222 if (TREE_CODE_CLASS (code) == tcc_comparison)
4224 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4225 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4228 /* If the result type is a private type, its full view may be a
4229 numeric subtype. The representation we need is that of its base
4230 type, given that it is the result of an arithmetic operation. */
4231 else if (Is_Private_Type (Etype (gnat_node)))
4232 gnu_type = gnu_result_type
4233 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4235 /* If this is a shift whose count is not guaranteed to be correct,
4236 we need to adjust the shift count. */
4237 if (IN (Nkind (gnat_node), N_Op_Shift)
4238 && !Shift_Count_OK (gnat_node))
4240 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4242 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4244 if (Nkind (gnat_node) == N_Op_Rotate_Left
4245 || Nkind (gnat_node) == N_Op_Rotate_Right)
4246 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4247 gnu_rhs, gnu_max_shift);
4248 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4251 (MIN_EXPR, gnu_count_type,
4252 build_binary_op (MINUS_EXPR,
4255 convert (gnu_count_type,
4260 /* For right shifts, the type says what kind of shift to do,
4261 so we may need to choose a different type. In this case,
4262 we have to ignore integer overflow lest it propagates all
4263 the way down and causes a CE to be explicitly raised. */
4264 if (Nkind (gnat_node) == N_Op_Shift_Right
4265 && !TYPE_UNSIGNED (gnu_type))
4267 gnu_type = gnat_unsigned_type (gnu_type);
4268 ignore_lhs_overflow = true;
4270 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4271 && TYPE_UNSIGNED (gnu_type))
4273 gnu_type = gnat_signed_type (gnu_type);
4274 ignore_lhs_overflow = true;
4277 if (gnu_type != gnu_result_type)
4279 tree gnu_old_lhs = gnu_lhs;
4280 gnu_lhs = convert (gnu_type, gnu_lhs);
4281 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4282 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4283 gnu_rhs = convert (gnu_type, gnu_rhs);
4286 /* Instead of expanding overflow checks for addition, subtraction
4287 and multiplication itself, the front end will leave this to
4288 the back end when Backend_Overflow_Checks_On_Target is set.
4289 As the GCC back end itself does not know yet how to properly
4290 do overflow checking, do it here. The goal is to push
4291 the expansions further into the back end over time. */
4292 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4293 && (Nkind (gnat_node) == N_Op_Add
4294 || Nkind (gnat_node) == N_Op_Subtract
4295 || Nkind (gnat_node) == N_Op_Multiply)
4296 && !TYPE_UNSIGNED (gnu_type)
4297 && !FLOAT_TYPE_P (gnu_type))
4298 gnu_result = build_binary_op_trapv (code, gnu_type,
4299 gnu_lhs, gnu_rhs, gnat_node);
4301 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4303 /* If this is a logical shift with the shift count not verified,
4304 we must return zero if it is too large. We cannot compensate
4305 above in this case. */
4306 if ((Nkind (gnat_node) == N_Op_Shift_Left
4307 || Nkind (gnat_node) == N_Op_Shift_Right)
4308 && !Shift_Count_OK (gnat_node))
4312 build_binary_op (GE_EXPR, integer_type_node,
4314 convert (TREE_TYPE (gnu_rhs),
4315 TYPE_SIZE (gnu_type))),
4316 convert (gnu_type, integer_zero_node),
4321 case N_Conditional_Expression:
4323 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4324 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4326 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4328 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4329 gnu_result = build_cond_expr (gnu_result_type,
4330 gnat_truthvalue_conversion (gnu_cond),
4331 gnu_true, gnu_false);
4336 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4337 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4341 /* This case can apply to a boolean or a modular type.
4342 Fall through for a boolean operand since GNU_CODES is set
4343 up to handle this. */
4344 if (Is_Modular_Integer_Type (Etype (gnat_node))
4345 || (Ekind (Etype (gnat_node)) == E_Private_Type
4346 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4348 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4349 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4350 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4355 /* ... fall through ... */
4357 case N_Op_Minus: case N_Op_Abs:
4358 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4360 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4361 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4363 gnu_result_type = get_unpadded_type (Base_Type
4364 (Full_View (Etype (gnat_node))));
4366 if (Do_Overflow_Check (gnat_node)
4367 && !TYPE_UNSIGNED (gnu_result_type)
4368 && !FLOAT_TYPE_P (gnu_result_type))
4370 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4371 gnu_result_type, gnu_expr, gnat_node);
4373 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4374 gnu_result_type, gnu_expr);
4381 bool ignore_init_type = false;
4383 gnat_temp = Expression (gnat_node);
4385 /* The Expression operand can either be an N_Identifier or
4386 Expanded_Name, which must represent a type, or a
4387 N_Qualified_Expression, which contains both the object type and an
4388 initial value for the object. */
4389 if (Nkind (gnat_temp) == N_Identifier
4390 || Nkind (gnat_temp) == N_Expanded_Name)
4391 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4392 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4394 Entity_Id gnat_desig_type
4395 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4397 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4398 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4400 gnu_init = maybe_unconstrained_array (gnu_init);
4401 if (Do_Range_Check (Expression (gnat_temp)))
4403 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4405 if (Is_Elementary_Type (gnat_desig_type)
4406 || Is_Constrained (gnat_desig_type))
4408 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4409 gnu_init = convert (gnu_type, gnu_init);
4413 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4414 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4415 gnu_type = TREE_TYPE (gnu_init);
4417 gnu_init = convert (gnu_type, gnu_init);
4423 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4424 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4425 Procedure_To_Call (gnat_node),
4426 Storage_Pool (gnat_node), gnat_node,
4431 /**************************/
4432 /* Chapter 5: Statements */
4433 /**************************/
4436 gnu_result = build1 (LABEL_EXPR, void_type_node,
4437 gnat_to_gnu (Identifier (gnat_node)));
4440 case N_Null_Statement:
4441 gnu_result = alloc_stmt_list ();
4444 case N_Assignment_Statement:
4445 /* Get the LHS and RHS of the statement and convert any reference to an
4446 unconstrained array into a reference to the underlying array.
4447 If we are not to do range checking and the RHS is an N_Function_Call,
4448 pass the LHS to the call function. */
4449 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4451 /* If the type has a size that overflows, convert this into raise of
4452 Storage_Error: execution shouldn't have gotten here anyway. */
4453 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4454 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4455 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4456 N_Raise_Storage_Error);
4457 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4458 && !Do_Range_Check (Expression (gnat_node)))
4459 gnu_result = call_to_gnu (Expression (gnat_node),
4460 &gnu_result_type, gnu_lhs);
4464 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4466 /* If range check is needed, emit code to generate it. */
4467 if (Do_Range_Check (Expression (gnat_node)))
4468 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4472 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4474 /* If the type being assigned is an array type and the two sides
4475 are not completely disjoint, play safe and use memmove. */
4476 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4477 && Is_Array_Type (Etype (Name (gnat_node)))
4478 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4480 tree to, from, size, to_ptr, from_ptr, t;
4482 to = TREE_OPERAND (gnu_result, 0);
4483 from = TREE_OPERAND (gnu_result, 1);
4485 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4486 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4488 to_ptr = build_fold_addr_expr (to);
4489 from_ptr = build_fold_addr_expr (from);
4491 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4492 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4497 case N_If_Statement:
4499 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4501 /* Make the outer COND_EXPR. Avoid non-determinism. */
4502 gnu_result = build3 (COND_EXPR, void_type_node,
4503 gnat_to_gnu (Condition (gnat_node)),
4504 NULL_TREE, NULL_TREE);
4505 COND_EXPR_THEN (gnu_result)
4506 = build_stmt_group (Then_Statements (gnat_node), false);
4507 TREE_SIDE_EFFECTS (gnu_result) = 1;
4508 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4510 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4511 into the previous "else" part and point to where to put any
4512 outer "else". Also avoid non-determinism. */
4513 if (Present (Elsif_Parts (gnat_node)))
4514 for (gnat_temp = First (Elsif_Parts (gnat_node));
4515 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4517 gnu_expr = build3 (COND_EXPR, void_type_node,
4518 gnat_to_gnu (Condition (gnat_temp)),
4519 NULL_TREE, NULL_TREE);
4520 COND_EXPR_THEN (gnu_expr)
4521 = build_stmt_group (Then_Statements (gnat_temp), false);
4522 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4523 set_expr_location_from_node (gnu_expr, gnat_temp);
4524 *gnu_else_ptr = gnu_expr;
4525 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4528 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4532 case N_Case_Statement:
4533 gnu_result = Case_Statement_to_gnu (gnat_node);
4536 case N_Loop_Statement:
4537 gnu_result = Loop_Statement_to_gnu (gnat_node);
4540 case N_Block_Statement:
4541 start_stmt_group ();
4543 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4544 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4546 gnu_result = end_stmt_group ();
4548 if (Present (Identifier (gnat_node)))
4549 mark_out_of_scope (Entity (Identifier (gnat_node)));
4552 case N_Exit_Statement:
4554 = build2 (EXIT_STMT, void_type_node,
4555 (Present (Condition (gnat_node))
4556 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4557 (Present (Name (gnat_node))
4558 ? get_gnu_tree (Entity (Name (gnat_node)))
4559 : TREE_VALUE (gnu_loop_label_stack)));
4562 case N_Return_Statement:
4564 /* The gnu function type of the subprogram currently processed. */
4565 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4566 /* The return value from the subprogram. */
4567 tree gnu_ret_val = NULL_TREE;
4568 /* The place to put the return value. */
4571 /* If we are dealing with a "return;" from an Ada procedure with
4572 parameters passed by copy in copy out, we need to return a record
4573 containing the final values of these parameters. If the list
4574 contains only one entry, return just that entry.
4576 For a full description of the copy in copy out parameter mechanism,
4577 see the part of the gnat_to_gnu_entity routine dealing with the
4578 translation of subprograms.
4580 But if we have a return label defined, convert this into
4581 a branch to that label. */
4583 if (TREE_VALUE (gnu_return_label_stack))
4585 gnu_result = build1 (GOTO_EXPR, void_type_node,
4586 TREE_VALUE (gnu_return_label_stack));
4590 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4592 gnu_lhs = DECL_RESULT (current_function_decl);
4593 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4594 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4597 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4598 TYPE_CI_CO_LIST (gnu_subprog_type));
4601 /* If the Ada subprogram is a function, we just need to return the
4602 expression. If the subprogram returns an unconstrained
4603 array, we have to allocate a new version of the result and
4604 return it. If we return by reference, return a pointer. */
4606 else if (Present (Expression (gnat_node)))
4608 /* If the current function returns by target pointer and we
4609 are doing a call, pass that target to the call. */
4610 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4611 && Nkind (Expression (gnat_node)) == N_Function_Call)
4614 = build_unary_op (INDIRECT_REF, NULL_TREE,
4615 DECL_ARGUMENTS (current_function_decl));
4616 gnu_result = call_to_gnu (Expression (gnat_node),
4617 &gnu_result_type, gnu_lhs);
4621 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4623 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4624 /* The original return type was unconstrained so dereference
4625 the TARGET pointer in the actual return value's type. */
4627 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4628 DECL_ARGUMENTS (current_function_decl));
4630 gnu_lhs = DECL_RESULT (current_function_decl);
4632 /* Do not remove the padding from GNU_RET_VAL if the inner
4633 type is self-referential since we want to allocate the fixed
4634 size in that case. */
4635 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4636 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4638 && (TYPE_IS_PADDING_P
4639 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4640 && (CONTAINS_PLACEHOLDER_P
4641 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4642 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4644 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4645 || By_Ref (gnat_node))
4647 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4649 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4651 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4653 = build_allocator (TREE_TYPE (gnu_ret_val),
4655 TREE_TYPE (gnu_subprog_type),
4656 Procedure_To_Call (gnat_node),
4657 Storage_Pool (gnat_node),
4663 /* If the Ada subprogram is a regular procedure, just return. */
4664 gnu_lhs = NULL_TREE;
4666 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4669 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4670 gnu_lhs, gnu_ret_val);
4671 add_stmt_with_node (gnu_result, gnat_node);
4672 gnu_lhs = NULL_TREE;
4675 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4679 case N_Goto_Statement:
4680 gnu_result = build1 (GOTO_EXPR, void_type_node,
4681 gnat_to_gnu (Name (gnat_node)));
4684 /***************************/
4685 /* Chapter 6: Subprograms */
4686 /***************************/
4688 case N_Subprogram_Declaration:
4689 /* Unless there is a freeze node, declare the subprogram. We consider
4690 this a "definition" even though we're not generating code for
4691 the subprogram because we will be making the corresponding GCC
4694 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4695 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4697 gnu_result = alloc_stmt_list ();
4700 case N_Abstract_Subprogram_Declaration:
4701 /* This subprogram doesn't exist for code generation purposes, but we
4702 have to elaborate the types of any parameters and result, unless
4703 they are imported types (nothing to generate in this case). */
4705 /* Process the parameter types first. */
4708 = First_Formal_With_Extras
4709 (Defining_Entity (Specification (gnat_node)));
4710 Present (gnat_temp);
4711 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4712 if (Is_Itype (Etype (gnat_temp))
4713 && !From_With_Type (Etype (gnat_temp)))
4714 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4717 /* Then the result type, set to Standard_Void_Type for procedures. */
4720 Entity_Id gnat_temp_type
4721 = Etype (Defining_Entity (Specification (gnat_node)));
4723 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4724 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4727 gnu_result = alloc_stmt_list ();
4730 case N_Defining_Program_Unit_Name:
4731 /* For a child unit identifier go up a level to get the specification.
4732 We get this when we try to find the spec of a child unit package
4733 that is the compilation unit being compiled. */
4734 gnu_result = gnat_to_gnu (Parent (gnat_node));
4737 case N_Subprogram_Body:
4738 Subprogram_Body_to_gnu (gnat_node);
4739 gnu_result = alloc_stmt_list ();
4742 case N_Function_Call:
4743 case N_Procedure_Call_Statement:
4744 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4747 /************************/
4748 /* Chapter 7: Packages */
4749 /************************/
4751 case N_Package_Declaration:
4752 gnu_result = gnat_to_gnu (Specification (gnat_node));
4755 case N_Package_Specification:
4757 start_stmt_group ();
4758 process_decls (Visible_Declarations (gnat_node),
4759 Private_Declarations (gnat_node), Empty, true, true);
4760 gnu_result = end_stmt_group ();
4763 case N_Package_Body:
4765 /* If this is the body of a generic package - do nothing. */
4766 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4768 gnu_result = alloc_stmt_list ();
4772 start_stmt_group ();
4773 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4775 if (Present (Handled_Statement_Sequence (gnat_node)))
4776 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4778 gnu_result = end_stmt_group ();
4781 /********************************/
4782 /* Chapter 8: Visibility Rules */
4783 /********************************/
4785 case N_Use_Package_Clause:
4786 case N_Use_Type_Clause:
4787 /* Nothing to do here - but these may appear in list of declarations. */
4788 gnu_result = alloc_stmt_list ();
4791 /*********************/
4792 /* Chapter 9: Tasks */
4793 /*********************/
4795 case N_Protected_Type_Declaration:
4796 gnu_result = alloc_stmt_list ();
4799 case N_Single_Task_Declaration:
4800 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4801 gnu_result = alloc_stmt_list ();
4804 /*********************************************************/
4805 /* Chapter 10: Program Structure and Compilation Issues */
4806 /*********************************************************/
4808 case N_Compilation_Unit:
4810 /* This is not called for the main unit, which is handled in function
4812 start_stmt_group ();
4815 Compilation_Unit_to_gnu (gnat_node);
4816 gnu_result = alloc_stmt_list ();
4819 case N_Subprogram_Body_Stub:
4820 case N_Package_Body_Stub:
4821 case N_Protected_Body_Stub:
4822 case N_Task_Body_Stub:
4823 /* Simply process whatever unit is being inserted. */
4824 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4828 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4831 /***************************/
4832 /* Chapter 11: Exceptions */
4833 /***************************/
4835 case N_Handled_Sequence_Of_Statements:
4836 /* If there is an At_End procedure attached to this node, and the EH
4837 mechanism is SJLJ, we must have at least a corresponding At_End
4838 handler, unless the No_Exception_Handlers restriction is set. */
4839 gcc_assert (type_annotate_only
4840 || Exception_Mechanism != Setjmp_Longjmp
4841 || No (At_End_Proc (gnat_node))
4842 || Present (Exception_Handlers (gnat_node))
4843 || No_Exception_Handlers_Set ());
4845 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4848 case N_Exception_Handler:
4849 if (Exception_Mechanism == Setjmp_Longjmp)
4850 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4851 else if (Exception_Mechanism == Back_End_Exceptions)
4852 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4858 case N_Push_Constraint_Error_Label:
4859 push_exception_label_stack (&gnu_constraint_error_label_stack,
4860 Exception_Label (gnat_node));
4863 case N_Push_Storage_Error_Label:
4864 push_exception_label_stack (&gnu_storage_error_label_stack,
4865 Exception_Label (gnat_node));
4868 case N_Push_Program_Error_Label:
4869 push_exception_label_stack (&gnu_program_error_label_stack,
4870 Exception_Label (gnat_node));
4873 case N_Pop_Constraint_Error_Label:
4874 gnu_constraint_error_label_stack
4875 = TREE_CHAIN (gnu_constraint_error_label_stack);
4878 case N_Pop_Storage_Error_Label:
4879 gnu_storage_error_label_stack
4880 = TREE_CHAIN (gnu_storage_error_label_stack);
4883 case N_Pop_Program_Error_Label:
4884 gnu_program_error_label_stack
4885 = TREE_CHAIN (gnu_program_error_label_stack);
4888 /******************************/
4889 /* Chapter 12: Generic Units */
4890 /******************************/
4892 case N_Generic_Function_Renaming_Declaration:
4893 case N_Generic_Package_Renaming_Declaration:
4894 case N_Generic_Procedure_Renaming_Declaration:
4895 case N_Generic_Package_Declaration:
4896 case N_Generic_Subprogram_Declaration:
4897 case N_Package_Instantiation:
4898 case N_Procedure_Instantiation:
4899 case N_Function_Instantiation:
4900 /* These nodes can appear on a declaration list but there is nothing to
4901 to be done with them. */
4902 gnu_result = alloc_stmt_list ();
4905 /**************************************************/
4906 /* Chapter 13: Representation Clauses and */
4907 /* Implementation-Dependent Features */
4908 /**************************************************/
4910 case N_Attribute_Definition_Clause:
4911 gnu_result = alloc_stmt_list ();
4913 /* The only one we need to deal with is 'Address since, for the others,
4914 the front-end puts the information elsewhere. */
4915 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4918 /* And we only deal with 'Address if the object has a Freeze node. */
4919 gnat_temp = Entity (Name (gnat_node));
4920 if (No (Freeze_Node (gnat_temp)))
4923 /* Get the value to use as the address and save it as the equivalent
4924 for the object. When it is frozen, gnat_to_gnu_entity will do the
4926 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4929 case N_Enumeration_Representation_Clause:
4930 case N_Record_Representation_Clause:
4932 /* We do nothing with these. SEM puts the information elsewhere. */
4933 gnu_result = alloc_stmt_list ();
4936 case N_Code_Statement:
4937 if (!type_annotate_only)
4939 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4940 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4941 tree gnu_clobbers = NULL_TREE, tail;
4942 bool allows_mem, allows_reg, fake;
4943 int ninputs, noutputs, i;
4944 const char **oconstraints;
4945 const char *constraint;
4948 /* First retrieve the 3 operand lists built by the front-end. */
4949 Setup_Asm_Outputs (gnat_node);
4950 while (Present (gnat_temp = Asm_Output_Variable ()))
4952 tree gnu_value = gnat_to_gnu (gnat_temp);
4953 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4954 (Asm_Output_Constraint ()));
4956 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4960 Setup_Asm_Inputs (gnat_node);
4961 while (Present (gnat_temp = Asm_Input_Value ()))
4963 tree gnu_value = gnat_to_gnu (gnat_temp);
4964 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4965 (Asm_Input_Constraint ()));
4967 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4971 Clobber_Setup (gnat_node);
4972 while ((clobber = Clobber_Get_Next ()))
4974 = tree_cons (NULL_TREE,
4975 build_string (strlen (clobber) + 1, clobber),
4978 /* Then perform some standard checking and processing on the
4979 operands. In particular, mark them addressable if needed. */
4980 gnu_outputs = nreverse (gnu_outputs);
4981 noutputs = list_length (gnu_outputs);
4982 gnu_inputs = nreverse (gnu_inputs);
4983 ninputs = list_length (gnu_inputs);
4985 = (const char **) alloca (noutputs * sizeof (const char *));
4987 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4989 tree output = TREE_VALUE (tail);
4991 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4992 oconstraints[i] = constraint;
4994 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4995 &allows_mem, &allows_reg, &fake))
4997 /* If the operand is going to end up in memory,
4998 mark it addressable. Note that we don't test
4999 allows_mem like in the input case below; this
5000 is modelled on the C front-end. */
5002 && !gnat_mark_addressable (output))
5003 output = error_mark_node;
5006 output = error_mark_node;
5008 TREE_VALUE (tail) = output;
5011 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5013 tree input = TREE_VALUE (tail);
5015 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5017 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5019 &allows_mem, &allows_reg))
5021 /* If the operand is going to end up in memory,
5022 mark it addressable. */
5023 if (!allows_reg && allows_mem
5024 && !gnat_mark_addressable (input))
5025 input = error_mark_node;
5028 input = error_mark_node;
5030 TREE_VALUE (tail) = input;
5033 gnu_result = build4 (ASM_EXPR, void_type_node,
5034 gnu_template, gnu_outputs,
5035 gnu_inputs, gnu_clobbers);
5036 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5039 gnu_result = alloc_stmt_list ();
5047 case N_Freeze_Entity:
5048 start_stmt_group ();
5049 process_freeze_entity (gnat_node);
5050 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5051 gnu_result = end_stmt_group ();
5054 case N_Itype_Reference:
5055 if (!present_gnu_tree (Itype (gnat_node)))
5056 process_type (Itype (gnat_node));
5058 gnu_result = alloc_stmt_list ();
5061 case N_Free_Statement:
5062 if (!type_annotate_only)
5064 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5065 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5067 tree gnu_actual_obj_type = 0;
5070 unsigned int default_allocator_alignment
5071 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
5073 /* If this is a thin pointer, we must dereference it to create
5074 a fat pointer, then go back below to a thin pointer. The
5075 reason for this is that we need a fat pointer someplace in
5076 order to properly compute the size. */
5077 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5078 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5079 build_unary_op (INDIRECT_REF, NULL_TREE,
5082 /* If this is an unconstrained array, we know the object must
5083 have been allocated with the template in front of the object.
5084 So pass the template address, but get the total size. Do this
5085 by converting to a thin pointer. */
5086 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5088 = convert (build_pointer_type
5089 (TYPE_OBJECT_RECORD_TYPE
5090 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5093 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5095 if (Present (Actual_Designated_Subtype (gnat_node)))
5098 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5100 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5102 = build_unc_object_type_from_ptr (gnu_ptr_type,
5103 gnu_actual_obj_type,
5104 get_identifier ("DEALLOC"));
5107 gnu_actual_obj_type = gnu_obj_type;
5109 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5110 align = TYPE_ALIGN (gnu_obj_type);
5112 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5113 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5115 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5116 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5117 tree gnu_byte_offset
5118 = convert (sizetype,
5119 size_diffop (size_zero_node, gnu_pos));
5120 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5122 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5123 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5124 gnu_ptr, gnu_byte_offset);
5127 /* If the object was allocated from the default storage pool, the
5128 alignment was greater than what the allocator provides, and this
5129 is not a fat or thin pointer, what we have in gnu_ptr here is an
5130 address dynamically adjusted to match the alignment requirement
5131 (see build_allocator). What we need to pass to free is the
5132 initial allocator's return value, which has been stored just in
5133 front of the block we have. */
5135 if (No (Procedure_To_Call (gnat_node))
5136 && align > default_allocator_alignment
5137 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5140 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
5144 = (void *)GNU_PTR - (void *)sizeof (void *)) */
5147 (POINTER_PLUS_EXPR, ptr_void_type_node,
5148 convert (ptr_void_type_node, gnu_ptr),
5149 size_int (-POINTER_SIZE/BITS_PER_UNIT));
5151 /* GNU_PTR (void *) = *(void **)GNU_PTR */
5154 (INDIRECT_REF, NULL_TREE,
5155 convert (build_pointer_type (ptr_void_type_node),
5159 gnu_result = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, align,
5160 Procedure_To_Call (gnat_node),
5161 Storage_Pool (gnat_node),
5166 case N_Raise_Constraint_Error:
5167 case N_Raise_Program_Error:
5168 case N_Raise_Storage_Error:
5169 if (type_annotate_only)
5171 gnu_result = alloc_stmt_list ();
5175 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5177 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5180 /* If the type is VOID, this is a statement, so we need to
5181 generate the code for the call. Handle a Condition, if there
5183 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5185 set_expr_location_from_node (gnu_result, gnat_node);
5187 if (Present (Condition (gnat_node)))
5188 gnu_result = build3 (COND_EXPR, void_type_node,
5189 gnat_to_gnu (Condition (gnat_node)),
5190 gnu_result, alloc_stmt_list ());
5193 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5196 case N_Validate_Unchecked_Conversion:
5198 Entity_Id gnat_target_type = Target_Type (gnat_node);
5199 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5200 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5202 /* No need for any warning in this case. */
5203 if (!flag_strict_aliasing)
5206 /* If the result is a pointer type, see if we are either converting
5207 from a non-pointer or from a pointer to a type with a different
5208 alias set and warn if so. If the result is defined in the same
5209 unit as this unchecked conversion, we can allow this because we
5210 can know to make the pointer type behave properly. */
5211 else if (POINTER_TYPE_P (gnu_target_type)
5212 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5213 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5215 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5216 ? TREE_TYPE (gnu_source_type)
5218 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5220 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5221 || get_alias_set (gnu_target_desig_type) != 0)
5222 && (!POINTER_TYPE_P (gnu_source_type)
5223 || (TYPE_DUMMY_P (gnu_source_desig_type)
5224 != TYPE_DUMMY_P (gnu_target_desig_type))
5225 || (TYPE_DUMMY_P (gnu_source_desig_type)
5226 && gnu_source_desig_type != gnu_target_desig_type)
5227 || !alias_sets_conflict_p
5228 (get_alias_set (gnu_source_desig_type),
5229 get_alias_set (gnu_target_desig_type))))
5232 ("?possible aliasing problem for type&",
5233 gnat_node, Target_Type (gnat_node));
5235 ("\\?use -fno-strict-aliasing switch for references",
5238 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5239 gnat_node, Target_Type (gnat_node));
5243 /* But if the result is a fat pointer type, we have no mechanism to
5244 do that, so we unconditionally warn in problematic cases. */
5245 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5247 tree gnu_source_array_type
5248 = TYPE_FAT_POINTER_P (gnu_source_type)
5249 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5251 tree gnu_target_array_type
5252 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5254 if ((TYPE_DUMMY_P (gnu_target_array_type)
5255 || get_alias_set (gnu_target_array_type) != 0)
5256 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5257 || (TYPE_DUMMY_P (gnu_source_array_type)
5258 != TYPE_DUMMY_P (gnu_target_array_type))
5259 || (TYPE_DUMMY_P (gnu_source_array_type)
5260 && gnu_source_array_type != gnu_target_array_type)
5261 || !alias_sets_conflict_p
5262 (get_alias_set (gnu_source_array_type),
5263 get_alias_set (gnu_target_array_type))))
5266 ("?possible aliasing problem for type&",
5267 gnat_node, Target_Type (gnat_node));
5269 ("\\?use -fno-strict-aliasing switch for references",
5274 gnu_result = alloc_stmt_list ();
5277 case N_Raise_Statement:
5278 case N_Function_Specification:
5279 case N_Procedure_Specification:
5281 case N_Component_Association:
5284 gcc_assert (type_annotate_only);
5285 gnu_result = alloc_stmt_list ();
5288 /* If we pushed our level as part of processing the elaboration routine,
5290 if (went_into_elab_proc)
5292 add_stmt (gnu_result);
5294 gnu_result = end_stmt_group ();
5295 current_function_decl = NULL_TREE;
5298 /* Set the location information on the result if it is a real expression.
5299 References can be reused for multiple GNAT nodes and they would get
5300 the location information of their last use. Note that we may have
5301 no result if we tried to build a CALL_EXPR node to a procedure with
5302 no side-effects and optimization is enabled. */
5304 && EXPR_P (gnu_result)
5305 && TREE_CODE (gnu_result) != NOP_EXPR
5306 && !REFERENCE_CLASS_P (gnu_result)
5307 && !EXPR_HAS_LOCATION (gnu_result))
5308 set_expr_location_from_node (gnu_result, gnat_node);
5310 /* If we're supposed to return something of void_type, it means we have
5311 something we're elaborating for effect, so just return. */
5312 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5315 /* If the result is a constant that overflows, raise constraint error. */
5316 else if (TREE_CODE (gnu_result) == INTEGER_CST
5317 && TREE_OVERFLOW (gnu_result))
5319 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5322 = build1 (NULL_EXPR, gnu_result_type,
5323 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5324 N_Raise_Constraint_Error));
5327 /* If our result has side-effects and is of an unconstrained type,
5328 make a SAVE_EXPR so that we can be sure it will only be referenced
5329 once. Note we must do this before any conversions. */
5330 if (TREE_SIDE_EFFECTS (gnu_result)
5331 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5332 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5333 gnu_result = gnat_stabilize_reference (gnu_result, false);
5335 /* Now convert the result to the result type, unless we are in one of the
5338 1. If this is the Name of an assignment statement or a parameter of
5339 a procedure call, return the result almost unmodified since the
5340 RHS will have to be converted to our type in that case, unless
5341 the result type has a simpler size. Likewise if there is just
5342 a no-op unchecked conversion in-between. Similarly, don't convert
5343 integral types that are the operands of an unchecked conversion
5344 since we need to ignore those conversions (for 'Valid).
5346 2. If we have a label (which doesn't have any well-defined type), a
5347 field or an error, return the result almost unmodified. Also don't
5348 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5349 its size since those are the cases where the front end may have the
5350 type wrong due to "instantiating" the unconstrained record with
5351 discriminant values. Similarly, if the two types are record types
5352 with the same name don't convert. This will be the case when we are
5353 converting from a packable version of a type to its original type and
5354 we need those conversions to be NOPs in order for assignments into
5355 these types to work properly.
5357 3. If the type is void or if we have no result, return error_mark_node
5358 to show we have no result.
5360 4. Finally, if the type of the result is already correct. */
5362 if (Present (Parent (gnat_node))
5363 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5364 && Name (Parent (gnat_node)) == gnat_node)
5365 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5366 && unchecked_conversion_lhs_nop (Parent (gnat_node)))
5367 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5368 && Name (Parent (gnat_node)) != gnat_node)
5369 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5370 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5371 && !AGGREGATE_TYPE_P (gnu_result_type)
5372 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5373 && !(TYPE_SIZE (gnu_result_type)
5374 && TYPE_SIZE (TREE_TYPE (gnu_result))
5375 && (AGGREGATE_TYPE_P (gnu_result_type)
5376 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5377 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5378 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5380 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5381 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5382 && (CONTAINS_PLACEHOLDER_P
5383 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5384 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5385 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5387 /* Remove padding only if the inner object is of self-referential
5388 size: in that case it must be an object of unconstrained type
5389 with a default discriminant and we want to avoid copying too
5391 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5392 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5393 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5394 (TREE_TYPE (gnu_result))))))
5395 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5399 else if (TREE_CODE (gnu_result) == LABEL_DECL
5400 || TREE_CODE (gnu_result) == FIELD_DECL
5401 || TREE_CODE (gnu_result) == ERROR_MARK
5402 || (TYPE_SIZE (gnu_result_type)
5403 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5404 && TREE_CODE (gnu_result) != INDIRECT_REF
5405 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5406 || ((TYPE_NAME (gnu_result_type)
5407 == TYPE_NAME (TREE_TYPE (gnu_result)))
5408 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5409 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5411 /* Remove any padding. */
5412 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5413 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5414 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5418 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5419 gnu_result = error_mark_node;
5421 else if (gnu_result_type != TREE_TYPE (gnu_result))
5422 gnu_result = convert (gnu_result_type, gnu_result);
5424 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5425 while ((TREE_CODE (gnu_result) == NOP_EXPR
5426 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5427 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5428 gnu_result = TREE_OPERAND (gnu_result, 0);
5433 /* Subroutine of above to push the exception label stack. GNU_STACK is
5434 a pointer to the stack to update and GNAT_LABEL, if present, is the
5435 label to push onto the stack. */
5438 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5440 tree gnu_label = (Present (gnat_label)
5441 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5444 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5447 /* Record the current code position in GNAT_NODE. */
5450 record_code_position (Node_Id gnat_node)
5452 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5454 add_stmt_with_node (stmt_stmt, gnat_node);
5455 save_gnu_tree (gnat_node, stmt_stmt, true);
5458 /* Insert the code for GNAT_NODE at the position saved for that node. */
5461 insert_code_for (Node_Id gnat_node)
5463 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5464 save_gnu_tree (gnat_node, NULL_TREE, true);
5467 /* Start a new statement group chained to the previous group. */
5470 start_stmt_group (void)
5472 struct stmt_group *group = stmt_group_free_list;
5474 /* First see if we can get one from the free list. */
5476 stmt_group_free_list = group->previous;
5478 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5480 group->previous = current_stmt_group;
5481 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5482 current_stmt_group = group;
5485 /* Add GNU_STMT to the current statement group. */
5488 add_stmt (tree gnu_stmt)
5490 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5493 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5496 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5498 if (Present (gnat_node))
5499 set_expr_location_from_node (gnu_stmt, gnat_node);
5500 add_stmt (gnu_stmt);
5503 /* Add a declaration statement for GNU_DECL to the current statement group.
5504 Get SLOC from Entity_Id. */
5507 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5509 tree type = TREE_TYPE (gnu_decl);
5510 tree gnu_stmt, gnu_init, t;
5512 /* If this is a variable that Gigi is to ignore, we may have been given
5513 an ERROR_MARK. So test for it. We also might have been given a
5514 reference for a renaming. So only do something for a decl. Also
5515 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5516 if (!DECL_P (gnu_decl)
5517 || (TREE_CODE (gnu_decl) == TYPE_DECL
5518 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5521 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5523 /* If we are global, we don't want to actually output the DECL_EXPR for
5524 this decl since we already have evaluated the expressions in the
5525 sizes and positions as globals and doing it again would be wrong. */
5526 if (global_bindings_p ())
5528 /* Mark everything as used to prevent node sharing with subprograms.
5529 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5530 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5531 mark_visited (&gnu_stmt);
5532 if (TREE_CODE (gnu_decl) == VAR_DECL
5533 || TREE_CODE (gnu_decl) == CONST_DECL)
5535 mark_visited (&DECL_SIZE (gnu_decl));
5536 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5537 mark_visited (&DECL_INITIAL (gnu_decl));
5539 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5540 if (TREE_CODE (gnu_decl) == TYPE_DECL
5541 && (TREE_CODE (type) == RECORD_TYPE
5542 || TREE_CODE (type) == UNION_TYPE
5543 || TREE_CODE (type) == QUAL_UNION_TYPE)
5544 && (t = TYPE_ADA_SIZE (type)))
5548 add_stmt_with_node (gnu_stmt, gnat_entity);
5550 /* If this is a variable and an initializer is attached to it, it must be
5551 valid for the context. Similar to init_const in create_var_decl_1. */
5552 if (TREE_CODE (gnu_decl) == VAR_DECL
5553 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5554 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5555 || (TREE_STATIC (gnu_decl)
5556 && !initializer_constant_valid_p (gnu_init,
5557 TREE_TYPE (gnu_init)))))
5559 /* If GNU_DECL has a padded type, convert it to the unpadded
5560 type so the assignment is done properly. */
5561 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5562 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5566 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5568 DECL_INITIAL (gnu_decl) = NULL_TREE;
5569 if (TREE_READONLY (gnu_decl))
5571 TREE_READONLY (gnu_decl) = 0;
5572 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5575 add_stmt_with_node (gnu_stmt, gnat_entity);
5579 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5582 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5584 if (TREE_VISITED (*tp))
5587 /* Don't mark a dummy type as visited because we want to mark its sizes
5588 and fields once it's filled in. */
5589 else if (!TYPE_IS_DUMMY_P (*tp))
5590 TREE_VISITED (*tp) = 1;
5593 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5598 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5601 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5602 void *data ATTRIBUTE_UNUSED)
5606 if (TREE_CODE (t) == SAVE_EXPR)
5607 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5612 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5613 sized gimplified. We use this to indicate all variable sizes and
5614 positions in global types may not be shared by any subprogram. */
5617 mark_visited (tree *tp)
5619 walk_tree (tp, mark_visited_r, NULL, NULL);
5622 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5623 set its location to that of GNAT_NODE if present. */
5626 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5628 if (Present (gnat_node))
5629 set_expr_location_from_node (gnu_cleanup, gnat_node);
5630 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5633 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5636 set_block_for_group (tree gnu_block)
5638 gcc_assert (!current_stmt_group->block);
5639 current_stmt_group->block = gnu_block;
5642 /* Return code corresponding to the current code group. It is normally
5643 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5644 BLOCK or cleanups were set. */
5647 end_stmt_group (void)
5649 struct stmt_group *group = current_stmt_group;
5650 tree gnu_retval = group->stmt_list;
5652 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5653 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5654 make a BIND_EXPR. Note that we nest in that because the cleanup may
5655 reference variables in the block. */
5656 if (gnu_retval == NULL_TREE)
5657 gnu_retval = alloc_stmt_list ();
5659 if (group->cleanups)
5660 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5663 if (current_stmt_group->block)
5664 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5665 gnu_retval, group->block);
5667 /* Remove this group from the stack and add it to the free list. */
5668 current_stmt_group = group->previous;
5669 group->previous = stmt_group_free_list;
5670 stmt_group_free_list = group;
5675 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5679 add_stmt_list (List_Id gnat_list)
5683 if (Present (gnat_list))
5684 for (gnat_node = First (gnat_list); Present (gnat_node);
5685 gnat_node = Next (gnat_node))
5686 add_stmt (gnat_to_gnu (gnat_node));
5689 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5690 If BINDING_P is true, push and pop a binding level around the list. */
5693 build_stmt_group (List_Id gnat_list, bool binding_p)
5695 start_stmt_group ();
5699 add_stmt_list (gnat_list);
5703 return end_stmt_group ();
5706 /* Push and pop routines for stacks. We keep a free list around so we
5707 don't waste tree nodes. */
5710 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5712 tree gnu_node = gnu_stack_free_list;
5716 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5717 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5718 TREE_PURPOSE (gnu_node) = gnu_purpose;
5719 TREE_VALUE (gnu_node) = gnu_value;
5722 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5724 *gnu_stack_ptr = gnu_node;
5728 pop_stack (tree *gnu_stack_ptr)
5730 tree gnu_node = *gnu_stack_ptr;
5732 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5733 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5734 gnu_stack_free_list = gnu_node;
5737 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5740 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5741 gimple_seq *post_p ATTRIBUTE_UNUSED)
5743 tree expr = *expr_p;
5746 if (IS_ADA_STMT (expr))
5747 return gnat_gimplify_stmt (expr_p);
5749 switch (TREE_CODE (expr))
5752 /* If this is for a scalar, just make a VAR_DECL for it. If for
5753 an aggregate, get a null pointer of the appropriate type and
5755 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5756 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5757 convert (build_pointer_type (TREE_TYPE (expr)),
5758 integer_zero_node));
5761 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5762 TREE_NO_WARNING (*expr_p) = 1;
5765 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5768 case UNCONSTRAINED_ARRAY_REF:
5769 /* We should only do this if we are just elaborating for side-effects,
5770 but we can't know that yet. */
5771 *expr_p = TREE_OPERAND (*expr_p, 0);
5775 op = TREE_OPERAND (expr, 0);
5777 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5778 be put into static memory. We know it's going to be readonly given
5779 the semantics we have and it's required to be static memory in
5780 the case when the reference is in an elaboration procedure. */
5781 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5783 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5785 TREE_READONLY (new_var) = 1;
5786 TREE_STATIC (new_var) = 1;
5787 TREE_ADDRESSABLE (new_var) = 1;
5788 DECL_INITIAL (new_var) = op;
5790 TREE_OPERAND (expr, 0) = new_var;
5791 recompute_tree_invariant_for_addr_expr (expr);
5795 /* If we are taking the address of a SAVE_EXPR, we are typically
5796 processing a misaligned argument to be passed by reference in a
5797 procedure call. We just mark the operand as addressable + not
5798 readonly here and let the common gimplifier code perform the
5799 temporary creation, initialization, and "instantiation" in place of
5800 the SAVE_EXPR in further operands, in particular in the copy back
5801 code inserted after the call. */
5802 else if (TREE_CODE (op) == SAVE_EXPR)
5804 TREE_ADDRESSABLE (op) = 1;
5805 TREE_READONLY (op) = 0;
5808 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5809 address of the selected operand when it is addressable. Besides, we
5810 also expect addressable_p to only let COND_EXPRs where both arms are
5811 addressable reach here. */
5812 else if (TREE_CODE (op) == COND_EXPR)
5815 /* Otherwise, if we are taking the address of something that is neither
5816 reference, declaration, or constant, make a variable for the operand
5817 here and then take its address. If we don't do it this way, we may
5818 confuse the gimplifier because it needs to know the variable is
5819 addressable at this point. This duplicates code in
5820 internal_get_tmp_var, which is unfortunate. */
5821 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5822 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5823 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5825 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5828 TREE_ADDRESSABLE (new_var) = 1;
5830 stmt = gimplify_assign (new_var, op, pre_p);
5831 if (EXPR_HAS_LOCATION (op))
5832 gimple_set_location (stmt, *EXPR_LOCUS (op));
5834 TREE_OPERAND (expr, 0) = new_var;
5835 recompute_tree_invariant_for_addr_expr (expr);
5839 /* ... fall through ... */
5842 return GS_UNHANDLED;
5846 /* Generate GIMPLE in place for the statement at *STMT_P. */
5848 static enum gimplify_status
5849 gnat_gimplify_stmt (tree *stmt_p)
5851 tree stmt = *stmt_p;
5853 switch (TREE_CODE (stmt))
5856 *stmt_p = STMT_STMT_STMT (stmt);
5861 tree gnu_start_label = create_artificial_label ();
5862 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5865 /* Set to emit the statements of the loop. */
5866 *stmt_p = NULL_TREE;
5868 /* We first emit the start label and then a conditional jump to
5869 the end label if there's a top condition, then the body of the
5870 loop, then a conditional branch to the end label, then the update,
5871 if any, and finally a jump to the start label and the definition
5872 of the end label. */
5873 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5877 if (LOOP_STMT_TOP_COND (stmt))
5878 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5879 LOOP_STMT_TOP_COND (stmt),
5886 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5888 if (LOOP_STMT_BOT_COND (stmt))
5889 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5890 LOOP_STMT_BOT_COND (stmt),
5897 if (LOOP_STMT_UPDATE (stmt))
5898 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5900 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5901 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5902 append_to_statement_list (t, stmt_p);
5904 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5911 /* Build a statement to jump to the corresponding end label, then
5912 see if it needs to be conditional. */
5913 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5914 if (EXIT_STMT_COND (stmt))
5915 *stmt_p = build3 (COND_EXPR, void_type_node,
5916 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5924 /* Force references to each of the entities in packages withed by GNAT_NODE.
5925 Operate recursively but check that we aren't elaborating something more
5928 This routine is exclusively called in type_annotate mode, to compute DDA
5929 information for types in withed units, for ASIS use. */
5932 elaborate_all_entities (Node_Id gnat_node)
5934 Entity_Id gnat_with_clause, gnat_entity;
5936 /* Process each unit only once. As we trace the context of all relevant
5937 units transitively, including generic bodies, we may encounter the
5938 same generic unit repeatedly. */
5939 if (!present_gnu_tree (gnat_node))
5940 save_gnu_tree (gnat_node, integer_zero_node, true);
5942 /* Save entities in all context units. A body may have an implicit_with
5943 on its own spec, if the context includes a child unit, so don't save
5945 for (gnat_with_clause = First (Context_Items (gnat_node));
5946 Present (gnat_with_clause);
5947 gnat_with_clause = Next (gnat_with_clause))
5948 if (Nkind (gnat_with_clause) == N_With_Clause
5949 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5950 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5952 elaborate_all_entities (Library_Unit (gnat_with_clause));
5954 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5956 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5957 Present (gnat_entity);
5958 gnat_entity = Next_Entity (gnat_entity))
5959 if (Is_Public (gnat_entity)
5960 && Convention (gnat_entity) != Convention_Intrinsic
5961 && Ekind (gnat_entity) != E_Package
5962 && Ekind (gnat_entity) != E_Package_Body
5963 && Ekind (gnat_entity) != E_Operator
5964 && !(IN (Ekind (gnat_entity), Type_Kind)
5965 && !Is_Frozen (gnat_entity))
5966 && !((Ekind (gnat_entity) == E_Procedure
5967 || Ekind (gnat_entity) == E_Function)
5968 && Is_Intrinsic_Subprogram (gnat_entity))
5969 && !IN (Ekind (gnat_entity), Named_Kind)
5970 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5971 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5973 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5976 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5978 /* Retrieve compilation unit node of generic body. */
5979 while (Present (gnat_body)
5980 && Nkind (gnat_body) != N_Compilation_Unit)
5981 gnat_body = Parent (gnat_body);
5983 /* If body is available, elaborate its context. */
5984 if (Present (gnat_body))
5985 elaborate_all_entities (gnat_body);
5989 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5990 elaborate_all_entities (Library_Unit (gnat_node));
5993 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5996 process_freeze_entity (Node_Id gnat_node)
5998 Entity_Id gnat_entity = Entity (gnat_node);
6002 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6003 && present_gnu_tree (Declaration_Node (gnat_entity)))
6004 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6006 /* If this is a package, need to generate code for the package. */
6007 if (Ekind (gnat_entity) == E_Package)
6010 (Parent (Corresponding_Body
6011 (Parent (Declaration_Node (gnat_entity)))));
6015 /* Check for old definition after the above call. This Freeze_Node
6016 might be for one its Itypes. */
6018 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6020 /* If this entity has an Address representation clause, GNU_OLD is the
6021 address, so discard it here. */
6022 if (Present (Address_Clause (gnat_entity)))
6025 /* Don't do anything for class-wide types they are always
6026 transformed into their root type. */
6027 if (Ekind (gnat_entity) == E_Class_Wide_Type
6028 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
6029 && Present (Equivalent_Type (gnat_entity))))
6032 /* Don't do anything for subprograms that may have been elaborated before
6033 their freeze nodes. This can happen, for example because of an inner call
6034 in an instance body, or a previous compilation of a spec for inlining
6037 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6038 && (Ekind (gnat_entity) == E_Function
6039 || Ekind (gnat_entity) == E_Procedure))
6041 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6042 && Ekind (gnat_entity) == E_Subprogram_Type)))
6045 /* If we have a non-dummy type old tree, we have nothing to do, except
6046 aborting if this is the public view of a private type whose full view was
6047 not delayed, as this node was never delayed as it should have been. We
6048 let this happen for concurrent types and their Corresponding_Record_Type,
6049 however, because each might legitimately be elaborated before it's own
6050 freeze node, e.g. while processing the other. */
6052 && !(TREE_CODE (gnu_old) == TYPE_DECL
6053 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6055 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6056 && Present (Full_View (gnat_entity))
6057 && No (Freeze_Node (Full_View (gnat_entity))))
6058 || Is_Concurrent_Type (gnat_entity)
6059 || (IN (Ekind (gnat_entity), Record_Kind)
6060 && Is_Concurrent_Record_Type (gnat_entity)));
6064 /* Reset the saved tree, if any, and elaborate the object or type for real.
6065 If there is a full declaration, elaborate it and copy the type to
6066 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6067 a class wide type or subtype. */
6070 save_gnu_tree (gnat_entity, NULL_TREE, false);
6071 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6072 && Present (Full_View (gnat_entity))
6073 && present_gnu_tree (Full_View (gnat_entity)))
6074 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6075 if (Present (Class_Wide_Type (gnat_entity))
6076 && Class_Wide_Type (gnat_entity) != gnat_entity)
6077 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6080 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6081 && Present (Full_View (gnat_entity)))
6083 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6085 /* Propagate back-annotations from full view to partial view. */
6086 if (Unknown_Alignment (gnat_entity))
6087 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6089 if (Unknown_Esize (gnat_entity))
6090 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6092 if (Unknown_RM_Size (gnat_entity))
6093 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6095 /* The above call may have defined this entity (the simplest example
6096 of this is when we have a private enumeral type since the bounds
6097 will have the public view. */
6098 if (!present_gnu_tree (gnat_entity))
6099 save_gnu_tree (gnat_entity, gnu_new, false);
6100 if (Present (Class_Wide_Type (gnat_entity))
6101 && Class_Wide_Type (gnat_entity) != gnat_entity)
6102 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6105 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6107 /* If we've made any pointers to the old version of this type, we
6108 have to update them. */
6110 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6111 TREE_TYPE (gnu_new));
6114 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6115 N_Compilation_Unit. */
6118 process_inlined_subprograms (Node_Id gnat_node)
6120 Entity_Id gnat_entity;
6123 /* If we can inline, generate Gimple for all the inlined subprograms.
6124 Define the entity first so we set DECL_EXTERNAL. */
6126 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6127 Present (gnat_entity);
6128 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6130 gnat_body = Parent (Declaration_Node (gnat_entity));
6132 if (Nkind (gnat_body) != N_Subprogram_Body)
6134 /* ??? This really should always be Present. */
6135 if (No (Corresponding_Body (gnat_body)))
6139 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6142 if (Present (gnat_body))
6144 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6145 add_stmt (gnat_to_gnu (gnat_body));
6150 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6151 We make two passes, one to elaborate anything other than bodies (but
6152 we declare a function if there was no spec). The second pass
6153 elaborates the bodies.
6155 GNAT_END_LIST gives the element in the list past the end. Normally,
6156 this is Empty, but can be First_Real_Statement for a
6157 Handled_Sequence_Of_Statements.
6159 We make a complete pass through both lists if PASS1P is true, then make
6160 the second pass over both lists if PASS2P is true. The lists usually
6161 correspond to the public and private parts of a package. */
6164 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6165 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6167 List_Id gnat_decl_array[2];
6171 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6174 for (i = 0; i <= 1; i++)
6175 if (Present (gnat_decl_array[i]))
6176 for (gnat_decl = First (gnat_decl_array[i]);
6177 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6179 /* For package specs, we recurse inside the declarations,
6180 thus taking the two pass approach inside the boundary. */
6181 if (Nkind (gnat_decl) == N_Package_Declaration
6182 && (Nkind (Specification (gnat_decl)
6183 == N_Package_Specification)))
6184 process_decls (Visible_Declarations (Specification (gnat_decl)),
6185 Private_Declarations (Specification (gnat_decl)),
6186 Empty, true, false);
6188 /* Similarly for any declarations in the actions of a
6190 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6192 process_freeze_entity (gnat_decl);
6193 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6196 /* Package bodies with freeze nodes get their elaboration deferred
6197 until the freeze node, but the code must be placed in the right
6198 place, so record the code position now. */
6199 else if (Nkind (gnat_decl) == N_Package_Body
6200 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6201 record_code_position (gnat_decl);
6203 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6204 && Present (Library_Unit (gnat_decl))
6205 && Present (Freeze_Node
6208 (Library_Unit (gnat_decl)))))))
6209 record_code_position
6210 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6212 /* We defer most subprogram bodies to the second pass. */
6213 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6215 if (Acts_As_Spec (gnat_decl))
6217 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6219 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6220 && Ekind (gnat_subprog_id) != E_Generic_Function)
6221 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6225 /* For bodies and stubs that act as their own specs, the entity
6226 itself must be elaborated in the first pass, because it may
6227 be used in other declarations. */
6228 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6230 Node_Id gnat_subprog_id
6231 = Defining_Entity (Specification (gnat_decl));
6233 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6234 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6235 && Ekind (gnat_subprog_id) != E_Generic_Function)
6236 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6239 /* Concurrent stubs stand for the corresponding subprogram bodies,
6240 which are deferred like other bodies. */
6241 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6242 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6246 add_stmt (gnat_to_gnu (gnat_decl));
6249 /* Here we elaborate everything we deferred above except for package bodies,
6250 which are elaborated at their freeze nodes. Note that we must also
6251 go inside things (package specs and freeze nodes) the first pass did. */
6253 for (i = 0; i <= 1; i++)
6254 if (Present (gnat_decl_array[i]))
6255 for (gnat_decl = First (gnat_decl_array[i]);
6256 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6258 if (Nkind (gnat_decl) == N_Subprogram_Body
6259 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6260 || Nkind (gnat_decl) == N_Task_Body_Stub
6261 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6262 add_stmt (gnat_to_gnu (gnat_decl));
6264 else if (Nkind (gnat_decl) == N_Package_Declaration
6265 && (Nkind (Specification (gnat_decl)
6266 == N_Package_Specification)))
6267 process_decls (Visible_Declarations (Specification (gnat_decl)),
6268 Private_Declarations (Specification (gnat_decl)),
6269 Empty, false, true);
6271 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6272 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6276 /* Make a unary operation of kind CODE using build_unary_op, but guard
6277 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6278 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6279 the operation is to be performed in that type. GNAT_NODE is the gnat
6280 node conveying the source location for which the error should be
6284 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6287 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6289 operand = protect_multiple_eval (operand);
6291 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6292 operand, TYPE_MIN_VALUE (gnu_type)),
6293 build_unary_op (code, gnu_type, operand),
6294 CE_Overflow_Check_Failed, gnat_node);
6297 /* Make a binary operation of kind CODE using build_binary_op, but guard
6298 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6299 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6300 Usually the operation is to be performed in that type. GNAT_NODE is
6301 the GNAT node conveying the source location for which the error should
6305 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6306 tree right, Node_Id gnat_node)
6308 tree lhs = protect_multiple_eval (left);
6309 tree rhs = protect_multiple_eval (right);
6310 tree type_max = TYPE_MAX_VALUE (gnu_type);
6311 tree type_min = TYPE_MIN_VALUE (gnu_type);
6314 tree zero = convert (gnu_type, integer_zero_node);
6319 int precision = TYPE_PRECISION (gnu_type);
6321 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6323 /* Prefer a constant or known-positive rhs to simplify checks. */
6324 if (!TREE_CONSTANT (rhs)
6325 && commutative_tree_code (code)
6326 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6327 && tree_expr_nonnegative_p (lhs))))
6334 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6336 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6338 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6340 /* Try a few strategies that may be cheaper than the general
6341 code at the end of the function, if the rhs is not known.
6343 - Call library function for 64-bit multiplication (complex)
6344 - Widen, if input arguments are sufficiently small
6345 - Determine overflow using wrapped result for addition/subtraction. */
6347 if (!TREE_CONSTANT (rhs))
6349 /* Even for add/subtract double size to get another base type. */
6350 int needed_precision = precision * 2;
6352 if (code == MULT_EXPR && precision == 64)
6354 tree int_64 = gnat_type_for_size (64, 0);
6356 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6357 convert (int_64, lhs),
6358 convert (int_64, rhs)));
6361 else if (needed_precision <= BITS_PER_WORD
6362 || (code == MULT_EXPR
6363 && needed_precision <= LONG_LONG_TYPE_SIZE))
6365 tree wide_type = gnat_type_for_size (needed_precision, 0);
6367 tree wide_result = build_binary_op (code, wide_type,
6368 convert (wide_type, lhs),
6369 convert (wide_type, rhs));
6371 tree check = build_binary_op
6372 (TRUTH_ORIF_EXPR, integer_type_node,
6373 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6374 convert (wide_type, type_min)),
6375 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6376 convert (wide_type, type_max)));
6378 tree result = convert (gnu_type, wide_result);
6381 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6384 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6386 tree unsigned_type = gnat_type_for_size (precision, 1);
6387 tree wrapped_expr = convert
6388 (gnu_type, build_binary_op (code, unsigned_type,
6389 convert (unsigned_type, lhs),
6390 convert (unsigned_type, rhs)));
6392 tree result = convert
6393 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6395 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6396 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6397 tree check = build_binary_op
6398 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6399 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6400 integer_type_node, wrapped_expr, lhs));
6403 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6410 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6411 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6412 build_binary_op (MINUS_EXPR, gnu_type,
6415 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6416 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6417 build_binary_op (MINUS_EXPR, gnu_type,
6422 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6423 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6424 build_binary_op (PLUS_EXPR, gnu_type,
6427 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6428 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6429 build_binary_op (PLUS_EXPR, gnu_type,
6434 /* The check here is designed to be efficient if the rhs is constant,
6435 but it will work for any rhs by using integer division.
6436 Four different check expressions determine wether X * C overflows,
6439 C > 0 => X > type_max / C || X < type_min / C
6440 C == -1 => X == type_min
6441 C < -1 => X > type_min / C || X < type_max / C */
6443 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6444 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6446 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6447 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6448 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6449 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6450 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6452 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6453 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6454 build_int_cst (gnu_type, -1)),
6455 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6456 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6457 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6458 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6465 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6467 /* If we can fold the expression to a constant, just return it.
6468 The caller will deal with overflow, no need to generate a check. */
6469 if (TREE_CONSTANT (gnu_expr))
6472 check = fold_build3 (COND_EXPR, integer_type_node,
6473 rhs_lt_zero, check_neg, check_pos);
6475 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6478 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6479 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6480 which we have to check. GNAT_NODE is the GNAT node conveying the source
6481 location for which the error should be signaled. */
6484 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6486 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6487 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6488 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6489 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6491 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6492 This can for example happen when translating 'Val or 'Value. */
6493 if (gnu_compare_type == gnu_range_type)
6496 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6497 we can't do anything since we might be truncating the bounds. No
6498 check is needed in this case. */
6499 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6500 && (TYPE_PRECISION (gnu_compare_type)
6501 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6504 /* Checked expressions must be evaluated only once. */
6505 gnu_expr = protect_multiple_eval (gnu_expr);
6507 /* There's no good type to use here, so we might as well use
6508 integer_type_node. Note that the form of the check is
6509 (not (expr >= lo)) or (not (expr <= hi))
6510 the reason for this slightly convoluted form is that NaNs
6511 are not considered to be in range in the float case. */
6513 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6515 (build_binary_op (GE_EXPR, integer_type_node,
6516 convert (gnu_compare_type, gnu_expr),
6517 convert (gnu_compare_type, gnu_low))),
6519 (build_binary_op (LE_EXPR, integer_type_node,
6520 convert (gnu_compare_type, gnu_expr),
6521 convert (gnu_compare_type,
6523 gnu_expr, CE_Range_Check_Failed, gnat_node);
6526 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6527 we are about to index, GNU_EXPR is the index expression to be checked,
6528 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6529 has to be checked. Note that for index checking we cannot simply use the
6530 emit_range_check function (although very similar code needs to be generated
6531 in both cases) since for index checking the array type against which we are
6532 checking the indices may be unconstrained and consequently we need to get
6533 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6534 The place where we need to do that is in subprograms having unconstrained
6535 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6536 location for which the error should be signaled. */
6539 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6540 tree gnu_high, Node_Id gnat_node)
6542 tree gnu_expr_check;
6544 /* Checked expressions must be evaluated only once. */
6545 gnu_expr = protect_multiple_eval (gnu_expr);
6547 /* Must do this computation in the base type in case the expression's
6548 type is an unsigned subtypes. */
6549 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6551 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6552 the object we are handling. */
6553 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6554 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6556 /* There's no good type to use here, so we might as well use
6557 integer_type_node. */
6559 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6560 build_binary_op (LT_EXPR, integer_type_node,
6562 convert (TREE_TYPE (gnu_expr_check),
6564 build_binary_op (GT_EXPR, integer_type_node,
6566 convert (TREE_TYPE (gnu_expr_check),
6568 gnu_expr, CE_Index_Check_Failed, gnat_node);
6571 /* GNU_COND contains the condition corresponding to an access, discriminant or
6572 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6573 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6574 REASON is the code that says why the exception was raised. GNAT_NODE is
6575 the GNAT node conveying the source location for which the error should be
6579 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6582 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6584 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6585 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6586 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6589 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6590 we don't need to evaluate it just for the check. */
6591 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6593 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6594 we will repeatedly do the test and, at compile time, we will repeatedly
6595 visit it during unsharing, which leads to an exponential explosion. */
6596 return save_expr (gnu_result);
6599 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6600 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6601 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6602 float to integer conversion with truncation; otherwise round.
6603 GNAT_NODE is the GNAT node conveying the source location for which the
6604 error should be signaled. */
6607 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6608 bool rangep, bool truncatep, Node_Id gnat_node)
6610 tree gnu_type = get_unpadded_type (gnat_type);
6611 tree gnu_in_type = TREE_TYPE (gnu_expr);
6612 tree gnu_in_basetype = get_base_type (gnu_in_type);
6613 tree gnu_base_type = get_base_type (gnu_type);
6614 tree gnu_result = gnu_expr;
6616 /* If we are not doing any checks, the output is an integral type, and
6617 the input is not a floating type, just do the conversion. This
6618 shortcut is required to avoid problems with packed array types
6619 and simplifies code in all cases anyway. */
6620 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6621 && !FLOAT_TYPE_P (gnu_in_type))
6622 return convert (gnu_type, gnu_expr);
6624 /* First convert the expression to its base type. This
6625 will never generate code, but makes the tests below much simpler.
6626 But don't do this if converting from an integer type to an unconstrained
6627 array type since then we need to get the bounds from the original
6629 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6630 gnu_result = convert (gnu_in_basetype, gnu_result);
6632 /* If overflow checks are requested, we need to be sure the result will
6633 fit in the output base type. But don't do this if the input
6634 is integer and the output floating-point. */
6636 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6638 /* Ensure GNU_EXPR only gets evaluated once. */
6639 tree gnu_input = protect_multiple_eval (gnu_result);
6640 tree gnu_cond = integer_zero_node;
6641 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6642 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6643 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6644 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6646 /* Convert the lower bounds to signed types, so we're sure we're
6647 comparing them properly. Likewise, convert the upper bounds
6648 to unsigned types. */
6649 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6650 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6652 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6653 && !TYPE_UNSIGNED (gnu_in_basetype))
6654 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6656 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6657 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6659 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6660 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6662 /* Check each bound separately and only if the result bound
6663 is tighter than the bound on the input type. Note that all the
6664 types are base types, so the bounds must be constant. Also,
6665 the comparison is done in the base type of the input, which
6666 always has the proper signedness. First check for input
6667 integer (which means output integer), output float (which means
6668 both float), or mixed, in which case we always compare.
6669 Note that we have to do the comparison which would *fail* in the
6670 case of an error since if it's an FP comparison and one of the
6671 values is a NaN or Inf, the comparison will fail. */
6672 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6673 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6674 : (FLOAT_TYPE_P (gnu_base_type)
6675 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6676 TREE_REAL_CST (gnu_out_lb))
6680 (build_binary_op (GE_EXPR, integer_type_node,
6681 gnu_input, convert (gnu_in_basetype,
6684 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6685 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6686 : (FLOAT_TYPE_P (gnu_base_type)
6687 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6688 TREE_REAL_CST (gnu_in_lb))
6691 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6693 (build_binary_op (LE_EXPR, integer_type_node,
6695 convert (gnu_in_basetype,
6698 if (!integer_zerop (gnu_cond))
6699 gnu_result = emit_check (gnu_cond, gnu_input,
6700 CE_Overflow_Check_Failed, gnat_node);
6703 /* Now convert to the result base type. If this is a non-truncating
6704 float-to-integer conversion, round. */
6705 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6708 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6709 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6710 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6711 const struct real_format *fmt;
6713 /* The following calculations depend on proper rounding to even
6714 of each arithmetic operation. In order to prevent excess
6715 precision from spoiling this property, use the widest hardware
6716 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6718 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6720 /* FIXME: Should not have padding in the first place. */
6721 if (TREE_CODE (calc_type) == RECORD_TYPE
6722 && TYPE_IS_PADDING_P (calc_type))
6723 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6725 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6726 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6727 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6728 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6729 half_minus_pred_half);
6730 gnu_pred_half = build_real (calc_type, pred_half);
6732 /* If the input is strictly negative, subtract this value
6733 and otherwise add it from the input. For 0.5, the result
6734 is exactly between 1.0 and the machine number preceding 1.0
6735 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6736 will round to 1.0, while all other number with an absolute
6737 value less than 0.5 round to 0.0. For larger numbers exactly
6738 halfway between integers, rounding will always be correct as
6739 the true mathematical result will be closer to the higher
6740 integer compared to the lower one. So, this constant works
6741 for all floating-point numbers.
6743 The reason to use the same constant with subtract/add instead
6744 of a positive and negative constant is to allow the comparison
6745 to be scheduled in parallel with retrieval of the constant and
6746 conversion of the input to the calc_type (if necessary). */
6748 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6749 gnu_saved_result = save_expr (gnu_result);
6750 gnu_conv = convert (calc_type, gnu_saved_result);
6751 gnu_comp = build2 (GE_EXPR, integer_type_node,
6752 gnu_saved_result, gnu_zero);
6754 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6755 gnu_subtract_pred_half
6756 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6757 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6758 gnu_add_pred_half, gnu_subtract_pred_half);
6761 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6762 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6763 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6764 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6766 gnu_result = convert (gnu_base_type, gnu_result);
6768 /* Finally, do the range check if requested. Note that if the
6769 result type is a modular type, the range check is actually
6770 an overflow check. */
6773 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6774 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6775 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6777 return convert (gnu_type, gnu_result);
6780 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6783 smaller_packable_type_p (tree type, tree record_type)
6787 /* We're not interested in variants here. */
6788 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6791 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6792 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6795 size = TYPE_SIZE (type);
6796 rsize = TYPE_SIZE (record_type);
6798 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6801 return tree_int_cst_lt (size, rsize) != 0;
6804 /* Return true if GNU_EXPR can be directly addressed. This is the case
6805 unless it is an expression involving computation or if it involves a
6806 reference to a bitfield or to an object not sufficiently aligned for
6807 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6808 be directly addressed as an object of this type.
6810 *** Notes on addressability issues in the Ada compiler ***
6812 This predicate is necessary in order to bridge the gap between Gigi
6813 and the middle-end about addressability of GENERIC trees. A tree
6814 is said to be addressable if it can be directly addressed, i.e. if
6815 its address can be taken, is a multiple of the type's alignment on
6816 strict-alignment architectures and returns the first storage unit
6817 assigned to the object represented by the tree.
6819 In the C family of languages, everything is in practice addressable
6820 at the language level, except for bit-fields. This means that these
6821 compilers will take the address of any tree that doesn't represent
6822 a bit-field reference and expect the result to be the first storage
6823 unit assigned to the object. Even in cases where this will result
6824 in unaligned accesses at run time, nothing is supposed to be done
6825 and the program is considered as erroneous instead (see PR c/18287).
6827 The implicit assumptions made in the middle-end are in keeping with
6828 the C viewpoint described above:
6829 - the address of a bit-field reference is supposed to be never
6830 taken; the compiler (generally) will stop on such a construct,
6831 - any other tree is addressable if it is formally addressable,
6832 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6834 In Ada, the viewpoint is the opposite one: nothing is addressable
6835 at the language level unless explicitly declared so. This means
6836 that the compiler will both make sure that the trees representing
6837 references to addressable ("aliased" in Ada parlance) objects are
6838 addressable and make no real attempts at ensuring that the trees
6839 representing references to non-addressable objects are addressable.
6841 In the first case, Ada is effectively equivalent to C and handing
6842 down the direct result of applying ADDR_EXPR to these trees to the
6843 middle-end works flawlessly. In the second case, Ada cannot afford
6844 to consider the program as erroneous if the address of trees that
6845 are not addressable is requested for technical reasons, unlike C;
6846 as a consequence, the Ada compiler must arrange for either making
6847 sure that this address is not requested in the middle-end or for
6848 compensating by inserting temporaries if it is requested in Gigi.
6850 The first goal can be achieved because the middle-end should not
6851 request the address of non-addressable trees on its own; the only
6852 exception is for the invocation of low-level block operations like
6853 memcpy, for which the addressability requirements are lower since
6854 the type's alignment can be disregarded. In practice, this means
6855 that Gigi must make sure that such operations cannot be applied to
6856 non-BLKmode bit-fields.
6858 The second goal is achieved by means of the addressable_p predicate
6859 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6860 They will be turned during gimplification into proper temporaries
6861 whose address will be used in lieu of that of the original tree. */
6864 addressable_p (tree gnu_expr, tree gnu_type)
6866 /* The size of the real type of the object must not be smaller than
6867 that of the expected type, otherwise an indirect access in the
6868 latter type would be larger than the object. Only records need
6869 to be considered in practice. */
6871 && TREE_CODE (gnu_type) == RECORD_TYPE
6872 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6875 switch (TREE_CODE (gnu_expr))
6881 /* All DECLs are addressable: if they are in a register, we can force
6885 case UNCONSTRAINED_ARRAY_REF:
6896 /* We accept &COND_EXPR as soon as both operands are addressable and
6897 expect the outcome to be the address of the selected operand. */
6898 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6899 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6902 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6903 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6904 the field is sufficiently aligned, in case it is subject
6905 to a pragma Component_Alignment. But we don't need to
6906 check the alignment of the containing record, as it is
6907 guaranteed to be not smaller than that of its most
6908 aligned field that is not a bit-field. */
6909 && (!STRICT_ALIGNMENT
6910 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6911 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6912 /* The field of a padding record is always addressable. */
6913 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6914 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6916 case ARRAY_REF: case ARRAY_RANGE_REF:
6917 case REALPART_EXPR: case IMAGPART_EXPR:
6919 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6922 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6923 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6925 case VIEW_CONVERT_EXPR:
6927 /* This is addressable if we can avoid a copy. */
6928 tree type = TREE_TYPE (gnu_expr);
6929 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6930 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6931 && (!STRICT_ALIGNMENT
6932 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6933 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6934 || ((TYPE_MODE (type) == BLKmode
6935 || TYPE_MODE (inner_type) == BLKmode)
6936 && (!STRICT_ALIGNMENT
6937 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6938 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6939 || TYPE_ALIGN_OK (type)
6940 || TYPE_ALIGN_OK (inner_type))))
6941 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6949 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6950 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6951 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6954 process_type (Entity_Id gnat_entity)
6957 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6960 /* If we are to delay elaboration of this type, just do any
6961 elaborations needed for expressions within the declaration and
6962 make a dummy type entry for this node and its Full_View (if
6963 any) in case something points to it. Don't do this if it
6964 has already been done (the only way that can happen is if
6965 the private completion is also delayed). */
6966 if (Present (Freeze_Node (gnat_entity))
6967 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6968 && Present (Full_View (gnat_entity))
6969 && Freeze_Node (Full_View (gnat_entity))
6970 && !present_gnu_tree (Full_View (gnat_entity))))
6972 elaborate_entity (gnat_entity);
6976 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6977 save_gnu_tree (gnat_entity, gnu_decl, false);
6978 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6979 && Present (Full_View (gnat_entity)))
6980 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6986 /* If we saved away a dummy type for this node it means that this
6987 made the type that corresponds to the full type of an incomplete
6988 type. Clear that type for now and then update the type in the
6992 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6993 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6995 save_gnu_tree (gnat_entity, NULL_TREE, false);
6998 /* Now fully elaborate the type. */
6999 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7000 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7002 /* If we have an old type and we've made pointers to this type,
7003 update those pointers. */
7005 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7006 TREE_TYPE (gnu_new));
7008 /* If this is a record type corresponding to a task or protected type
7009 that is a completion of an incomplete type, perform a similar update
7010 on the type. ??? Including protected types here is a guess. */
7011 if (IN (Ekind (gnat_entity), Record_Kind)
7012 && Is_Concurrent_Record_Type (gnat_entity)
7013 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7016 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7018 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7020 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7023 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7024 TREE_TYPE (gnu_new));
7028 /* GNAT_ENTITY is the type of the resulting constructors,
7029 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7030 and GNU_TYPE is the GCC type of the corresponding record.
7032 Return a CONSTRUCTOR to build the record. */
7035 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7037 tree gnu_list, gnu_result;
7039 /* We test for GNU_FIELD being empty in the case where a variant
7040 was the last thing since we don't take things off GNAT_ASSOC in
7041 that case. We check GNAT_ASSOC in case we have a variant, but it
7044 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7045 gnat_assoc = Next (gnat_assoc))
7047 Node_Id gnat_field = First (Choices (gnat_assoc));
7048 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7049 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7051 /* The expander is supposed to put a single component selector name
7052 in every record component association. */
7053 gcc_assert (No (Next (gnat_field)));
7055 /* Ignore fields that have Corresponding_Discriminants since we'll
7056 be setting that field in the parent. */
7057 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7058 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7061 /* Also ignore discriminants of Unchecked_Unions. */
7062 else if (Is_Unchecked_Union (gnat_entity)
7063 && Ekind (Entity (gnat_field)) == E_Discriminant)
7066 /* Before assigning a value in an aggregate make sure range checks
7067 are done if required. Then convert to the type of the field. */
7068 if (Do_Range_Check (Expression (gnat_assoc)))
7069 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7071 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7073 /* Add the field and expression to the list. */
7074 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7077 gnu_result = extract_values (gnu_list, gnu_type);
7079 #ifdef ENABLE_CHECKING
7083 /* Verify every entry in GNU_LIST was used. */
7084 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7085 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7092 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7093 the first element of an array aggregate. It may itself be an aggregate.
7094 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7095 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7096 for range checking. */
7099 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7100 Entity_Id gnat_component_type)
7102 tree gnu_expr_list = NULL_TREE;
7103 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7106 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7108 /* If the expression is itself an array aggregate then first build the
7109 innermost constructor if it is part of our array (multi-dimensional
7111 if (Nkind (gnat_expr) == N_Aggregate
7112 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7113 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7114 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7115 TREE_TYPE (gnu_array_type),
7116 gnat_component_type);
7119 gnu_expr = gnat_to_gnu (gnat_expr);
7121 /* Before assigning the element to the array, make sure it is
7123 if (Do_Range_Check (gnat_expr))
7124 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7128 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7131 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7134 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7137 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7138 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7139 of the associations that are from RECORD_TYPE. If we see an internal
7140 record, make a recursive call to fill it in as well. */
7143 extract_values (tree values, tree record_type)
7145 tree result = NULL_TREE;
7148 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7152 /* _Parent is an internal field, but may have values in the aggregate,
7153 so check for values first. */
7154 if ((tem = purpose_member (field, values)))
7156 value = TREE_VALUE (tem);
7157 TREE_ADDRESSABLE (tem) = 1;
7160 else if (DECL_INTERNAL_P (field))
7162 value = extract_values (values, TREE_TYPE (field));
7163 if (TREE_CODE (value) == CONSTRUCTOR
7164 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7168 /* If we have a record subtype, the names will match, but not the
7169 actual FIELD_DECLs. */
7170 for (tem = values; tem; tem = TREE_CHAIN (tem))
7171 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7173 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7174 TREE_ADDRESSABLE (tem) = 1;
7180 result = tree_cons (field, value, result);
7183 return gnat_build_constructor (record_type, nreverse (result));
7186 /* EXP is to be treated as an array or record. Handle the cases when it is
7187 an access object and perform the required dereferences. */
7190 maybe_implicit_deref (tree exp)
7192 /* If the type is a pointer, dereference it. */
7194 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7195 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7197 /* If we got a padded type, remove it too. */
7198 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7199 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7200 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7205 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7208 protect_multiple_eval (tree exp)
7210 tree type = TREE_TYPE (exp);
7212 /* If this has no side effects, we don't need to do anything. */
7213 if (!TREE_SIDE_EFFECTS (exp))
7216 /* If it is a conversion, protect what's inside the conversion.
7217 Similarly, if we're indirectly referencing something, we only
7218 actually need to protect the address since the data itself can't
7219 change in these situations. */
7220 else if (TREE_CODE (exp) == NON_LVALUE_EXPR
7221 || CONVERT_EXPR_P (exp)
7222 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7223 || TREE_CODE (exp) == INDIRECT_REF
7224 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7225 return build1 (TREE_CODE (exp), type,
7226 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7228 /* If EXP is a fat pointer or something that can be placed into a register,
7229 just make a SAVE_EXPR. */
7230 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7231 return save_expr (exp);
7233 /* Otherwise, dereference, protect the address, and re-reference. */
7236 build_unary_op (INDIRECT_REF, type,
7237 save_expr (build_unary_op (ADDR_EXPR,
7238 build_reference_type (type),
7242 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7243 handle our own nodes and we take extra arguments. FORCE says whether to
7244 force evaluation of everything. We set SUCCESS to true unless we walk
7245 through something we don't know how to stabilize. */
7248 maybe_stabilize_reference (tree ref, bool force, bool *success)
7250 tree type = TREE_TYPE (ref);
7251 enum tree_code code = TREE_CODE (ref);
7254 /* Assume we'll success unless proven otherwise. */
7263 /* No action is needed in this case. */
7269 case FIX_TRUNC_EXPR:
7270 case VIEW_CONVERT_EXPR:
7272 = build1 (code, type,
7273 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7278 case UNCONSTRAINED_ARRAY_REF:
7279 result = build1 (code, type,
7280 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7285 result = build3 (COMPONENT_REF, type,
7286 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7288 TREE_OPERAND (ref, 1), NULL_TREE);
7292 result = build3 (BIT_FIELD_REF, type,
7293 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7295 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7297 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7302 case ARRAY_RANGE_REF:
7303 result = build4 (code, type,
7304 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7306 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7308 NULL_TREE, NULL_TREE);
7312 result = gnat_stabilize_reference_1 (ref, force);
7316 /* This generates better code than the scheme in protect_multiple_eval
7317 because large objects will be returned via invisible reference in
7318 most ABIs so the temporary will directly be filled by the callee. */
7319 result = gnat_stabilize_reference_1 (ref, force);
7323 /* Constructors with 1 element are used extensively to formally
7324 convert objects to special wrapping types. */
7325 if (TREE_CODE (type) == RECORD_TYPE
7326 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7329 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7331 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7333 = build_constructor_single (type, index,
7334 gnat_stabilize_reference_1 (value,
7345 ref = error_mark_node;
7347 /* ... fall through to failure ... */
7349 /* If arg isn't a kind of lvalue we recognize, make no change.
7350 Caller should recognize the error for an invalid lvalue. */
7356 TREE_READONLY (result) = TREE_READONLY (ref);
7358 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7359 expression may not be sustained across some paths, such as the way via
7360 build1 for INDIRECT_REF. We re-populate those flags here for the general
7361 case, which is consistent with the GCC version of this routine.
7363 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7364 paths introduce side effects where there was none initially (e.g. calls
7365 to save_expr), and we also want to keep track of that. */
7367 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7368 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7373 /* Wrapper around maybe_stabilize_reference, for common uses without
7374 lvalue restrictions and without need to examine the success
7378 gnat_stabilize_reference (tree ref, bool force)
7381 return maybe_stabilize_reference (ref, force, &dummy);
7384 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7385 arg to force a SAVE_EXPR for everything. */
7388 gnat_stabilize_reference_1 (tree e, bool force)
7390 enum tree_code code = TREE_CODE (e);
7391 tree type = TREE_TYPE (e);
7394 /* We cannot ignore const expressions because it might be a reference
7395 to a const array but whose index contains side-effects. But we can
7396 ignore things that are actual constant or that already have been
7397 handled by this function. */
7399 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7402 switch (TREE_CODE_CLASS (code))
7404 case tcc_exceptional:
7406 case tcc_declaration:
7407 case tcc_comparison:
7409 case tcc_expression:
7412 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7413 fat pointer. This may be more efficient, but will also allow
7414 us to more easily find the match for the PLACEHOLDER_EXPR. */
7415 if (code == COMPONENT_REF
7416 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7417 result = build3 (COMPONENT_REF, type,
7418 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7420 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7421 else if (TREE_SIDE_EFFECTS (e) || force)
7422 return save_expr (e);
7428 /* Constants need no processing. In fact, we should never reach
7433 /* Recursively stabilize each operand. */
7434 result = build2 (code, type,
7435 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7436 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7441 /* Recursively stabilize each operand. */
7442 result = build1 (code, type,
7443 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7451 TREE_READONLY (result) = TREE_READONLY (e);
7453 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7454 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7458 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7459 location and false if it doesn't. In the former case, set the Gigi global
7460 variable REF_FILENAME to the simple debug file name as given by sinput. */
7463 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7465 if (Sloc == No_Location)
7468 if (Sloc <= Standard_Location)
7470 *locus = BUILTINS_LOCATION;
7475 Source_File_Index file = Get_Source_File_Index (Sloc);
7476 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7477 Column_Number column = Get_Column_Number (Sloc);
7478 struct line_map *map = &line_table->maps[file - 1];
7480 /* Translate the location according to the line-map.h formula. */
7481 *locus = map->start_location
7482 + ((line - map->to_line) << map->column_bits)
7483 + (column & ((1 << map->column_bits) - 1));
7487 = IDENTIFIER_POINTER
7489 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7494 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7495 don't do anything if it doesn't correspond to a source location. */
7498 set_expr_location_from_node (tree node, Node_Id gnat_node)
7502 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7505 SET_EXPR_LOCATION (node, locus);
7508 /* Return a colon-separated list of encodings contained in encoded Ada
7512 extract_encoding (const char *name)
7514 char *encoding = GGC_NEWVEC (char, strlen (name));
7515 get_encoding (name, encoding);
7519 /* Extract the Ada name from an encoded name. */
7522 decode_name (const char *name)
7524 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7525 __gnat_decode (name, decoded, 0);
7529 /* Post an error message. MSG is the error message, properly annotated.
7530 NODE is the node at which to post the error and the node to use for the
7531 "&" substitution. */
7534 post_error (const char *msg, Node_Id node)
7536 String_Template temp;
7539 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7540 fp.Array = msg, fp.Bounds = &temp;
7542 Error_Msg_N (fp, node);
7545 /* Similar, but NODE is the node at which to post the error and ENT
7546 is the node to use for the "&" substitution. */
7549 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7551 String_Template temp;
7554 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7555 fp.Array = msg, fp.Bounds = &temp;
7557 Error_Msg_NE (fp, node, ent);
7560 /* Similar, but NODE is the node at which to post the error, ENT is the node
7561 to use for the "&" substitution, and N is the number to use for the ^. */
7564 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7566 String_Template temp;
7569 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7570 fp.Array = msg, fp.Bounds = &temp;
7571 Error_Msg_Uint_1 = UI_From_Int (n);
7574 Error_Msg_NE (fp, node, ent);
7577 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7578 number to write. If the tree represents a constant that fits within
7579 a host integer, the text inside curly brackets in MSG will be output
7580 (presumably including a '^'). Otherwise that text will not be output
7581 and the text inside square brackets will be output instead. */
7584 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7586 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7587 String_Template temp = {1, 0};
7589 char start_yes, end_yes, start_no, end_no;
7593 fp.Array = newmsg, fp.Bounds = &temp;
7595 if (host_integerp (t, 1)
7596 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7599 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7603 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7604 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7607 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7609 for (p = msg, q = newmsg; *p; p++)
7611 if (*p == start_yes)
7612 for (p++; *p != end_yes; p++)
7614 else if (*p == start_no)
7615 for (p++; *p != end_no; p++)
7623 temp.High_Bound = strlen (newmsg);
7625 Error_Msg_NE (fp, node, ent);
7628 /* Similar to post_error_ne_tree, except that NUM is a second
7629 integer to write in the message. */
7632 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7635 Error_Msg_Uint_2 = UI_From_Int (num);
7636 post_error_ne_tree (msg, node, ent, t);
7639 /* Initialize the table that maps GNAT codes to GCC codes for simple
7640 binary and unary operations. */
7643 init_code_table (void)
7645 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7646 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7648 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7649 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7650 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7651 gnu_codes[N_Op_Eq] = EQ_EXPR;
7652 gnu_codes[N_Op_Ne] = NE_EXPR;
7653 gnu_codes[N_Op_Lt] = LT_EXPR;
7654 gnu_codes[N_Op_Le] = LE_EXPR;
7655 gnu_codes[N_Op_Gt] = GT_EXPR;
7656 gnu_codes[N_Op_Ge] = GE_EXPR;
7657 gnu_codes[N_Op_Add] = PLUS_EXPR;
7658 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7659 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7660 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7661 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7662 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7663 gnu_codes[N_Op_Abs] = ABS_EXPR;
7664 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7665 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7666 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7667 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7668 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7669 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7672 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7676 get_exception_label (char kind)
7678 if (kind == N_Raise_Constraint_Error)
7679 return TREE_VALUE (gnu_constraint_error_label_stack);
7680 else if (kind == N_Raise_Storage_Error)
7681 return TREE_VALUE (gnu_storage_error_label_stack);
7682 else if (kind == N_Raise_Program_Error)
7683 return TREE_VALUE (gnu_program_error_label_stack);
7688 #include "gt-ada-trans.h"