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"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
55 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
56 for fear of running out of stack space. If we need more, we use xmalloc
58 #define ALLOCA_THRESHOLD 1000
60 /* Let code below know whether we are targetting VMS without need of
61 intrusive preprocessor directives. */
62 #ifndef TARGET_ABI_OPEN_VMS
63 #define TARGET_ABI_OPEN_VMS 0
66 /* For efficient float-to-int rounding, it is necessary to know whether
67 floating-point arithmetic may use wider intermediate results. When
68 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
69 that arithmetic does not widen if double precision is emulated. */
70 #ifndef FP_ARITH_MAY_WIDEN
71 #if defined(HAVE_extendsfdf2)
72 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
74 #define FP_ARITH_MAY_WIDEN 0
78 extern char *__gnat_to_canonical_file_spec (char *);
83 struct Node *Nodes_Ptr;
84 Node_Id *Next_Node_Ptr;
85 Node_Id *Prev_Node_Ptr;
86 struct Elist_Header *Elists_Ptr;
87 struct Elmt_Item *Elmts_Ptr;
88 struct String_Entry *Strings_Ptr;
89 Char_Code *String_Chars_Ptr;
90 struct List_Header *List_Headers_Ptr;
92 /* Current filename without path. */
93 const char *ref_filename;
95 /* True when gigi is being called on an analyzed but unexpanded
96 tree, and the only purpose of the call is to properly annotate
97 types with representation information. */
98 bool type_annotate_only;
100 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
101 of unconstrained array IN parameters to avoid emitting a great deal of
102 redundant instructions to recompute them each time. */
103 struct GTY (()) parm_attr_d {
104 int id; /* GTY doesn't like Entity_Id. */
111 typedef struct parm_attr_d *parm_attr;
113 DEF_VEC_P(parm_attr);
114 DEF_VEC_ALLOC_P(parm_attr,gc);
116 struct GTY(()) language_function {
117 VEC(parm_attr,gc) *parm_attr_cache;
120 #define f_parm_attr_cache \
121 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
123 /* A structure used to gather together information about a statement group.
124 We use this to gather related statements, for example the "then" part
125 of a IF. In the case where it represents a lexical scope, we may also
126 have a BLOCK node corresponding to it and/or cleanups. */
128 struct GTY((chain_next ("%h.previous"))) stmt_group {
129 struct stmt_group *previous; /* Previous code group. */
130 tree stmt_list; /* List of statements for this code group. */
131 tree block; /* BLOCK for this code group, if any. */
132 tree cleanups; /* Cleanups for this code group, if any. */
135 static GTY(()) struct stmt_group *current_stmt_group;
137 /* List of unused struct stmt_group nodes. */
138 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
140 /* A structure used to record information on elaboration procedures
141 we've made and need to process.
143 ??? gnat_node should be Node_Id, but gengtype gets confused. */
145 struct GTY((chain_next ("%h.next"))) elab_info {
146 struct elab_info *next; /* Pointer to next in chain. */
147 tree elab_proc; /* Elaboration procedure. */
148 int gnat_node; /* The N_Compilation_Unit. */
151 static GTY(()) struct elab_info *elab_info_list;
153 /* Free list of TREE_LIST nodes used for stacks. */
154 static GTY((deletable)) tree gnu_stack_free_list;
156 /* List of TREE_LIST nodes representing a stack of exception pointer
157 variables. TREE_VALUE is the VAR_DECL that stores the address of
158 the raised exception. Nonzero means we are in an exception
159 handler. Not used in the zero-cost case. */
160 static GTY(()) tree gnu_except_ptr_stack;
162 /* List of TREE_LIST nodes used to store the current elaboration procedure
163 decl. TREE_VALUE is the decl. */
164 static GTY(()) tree gnu_elab_proc_stack;
166 /* Variable that stores a list of labels to be used as a goto target instead of
167 a return in some functions. See processing for N_Subprogram_Body. */
168 static GTY(()) tree gnu_return_label_stack;
170 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
171 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
172 static GTY(()) tree gnu_loop_label_stack;
174 /* List of TREE_LIST nodes representing labels for switch statements.
175 TREE_VALUE of each entry is the label at the end of the switch. */
176 static GTY(()) tree gnu_switch_label_stack;
178 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
179 static GTY(()) tree gnu_constraint_error_label_stack;
180 static GTY(()) tree gnu_storage_error_label_stack;
181 static GTY(()) tree gnu_program_error_label_stack;
183 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
184 static enum tree_code gnu_codes[Number_Node_Kinds];
186 /* Current node being treated, in case abort called. */
187 Node_Id error_gnat_node;
189 static void init_code_table (void);
190 static void Compilation_Unit_to_gnu (Node_Id);
191 static void record_code_position (Node_Id);
192 static void insert_code_for (Node_Id);
193 static void add_cleanup (tree, Node_Id);
194 static tree unshare_save_expr (tree *, int *, void *);
195 static void add_stmt_list (List_Id);
196 static void push_exception_label_stack (tree *, Entity_Id);
197 static tree build_stmt_group (List_Id, bool);
198 static void push_stack (tree *, tree, tree);
199 static void pop_stack (tree *);
200 static enum gimplify_status gnat_gimplify_stmt (tree *);
201 static void elaborate_all_entities (Node_Id);
202 static void process_freeze_entity (Node_Id);
203 static void process_inlined_subprograms (Node_Id);
204 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
205 static tree emit_range_check (tree, Node_Id, Node_Id);
206 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
207 static tree emit_check (tree, tree, int, Node_Id);
208 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
209 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
210 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
211 static bool smaller_packable_type_p (tree, tree);
212 static bool addressable_p (tree, tree);
213 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
214 static tree extract_values (tree, tree);
215 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
216 static tree maybe_implicit_deref (tree);
217 static tree gnat_stabilize_reference (tree, bool);
218 static tree gnat_stabilize_reference_1 (tree, bool);
219 static void set_expr_location_from_node (tree, Node_Id);
220 static int lvalue_required_p (Node_Id, tree, int);
222 /* Hooks for debug info back-ends, only supported and used in a restricted set
223 of configurations. */
224 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
225 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
227 /* This is the main program of the back-end. It sets up all the table
228 structures and then generates code. */
231 gigi (Node_Id gnat_root, int max_gnat_node, int number_name,
232 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
233 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
234 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
235 struct List_Header *list_headers_ptr, Nat number_file,
236 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
237 Entity_Id standard_integer, Entity_Id standard_long_long_float,
238 Entity_Id standard_exception_type, Int gigi_operating_mode)
240 Entity_Id gnat_literal;
241 tree long_long_float_type, exception_type, t;
242 tree int64_type = gnat_type_for_size (64, 0);
243 struct elab_info *info;
246 max_gnat_nodes = max_gnat_node;
247 number_names = number_name;
248 number_files = number_file;
249 Nodes_Ptr = nodes_ptr;
250 Next_Node_Ptr = next_node_ptr;
251 Prev_Node_Ptr = prev_node_ptr;
252 Elists_Ptr = elists_ptr;
253 Elmts_Ptr = elmts_ptr;
254 Strings_Ptr = strings_ptr;
255 String_Chars_Ptr = string_chars_ptr;
256 List_Headers_Ptr = list_headers_ptr;
258 type_annotate_only = (gigi_operating_mode == 1);
260 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
262 /* Declare the name of the compilation unit as the first global
263 name in order to make the middle-end fully deterministic. */
264 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
265 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
267 for (i = 0; i < number_files; i++)
269 /* Use the identifier table to make a permanent copy of the filename as
270 the name table gets reallocated after Gigi returns but before all the
271 debugging information is output. The __gnat_to_canonical_file_spec
272 call translates filenames from pragmas Source_Reference that contain
273 host style syntax not understood by gdb. */
277 (__gnat_to_canonical_file_spec
278 (Get_Name_String (file_info_ptr[i].File_Name))));
280 /* We rely on the order isomorphism between files and line maps. */
281 gcc_assert ((int) line_table->used == i);
283 /* We create the line map for a source file at once, with a fixed number
284 of columns chosen to avoid jumping over the next power of 2. */
285 linemap_add (line_table, LC_ENTER, 0, filename, 1);
286 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
287 linemap_position_for_column (line_table, 252 - 1);
288 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
291 /* Initialize ourselves. */
296 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
298 if (type_annotate_only)
300 TYPE_SIZE (void_type_node) = bitsize_zero_node;
301 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
304 /* If the GNU type extensions to DWARF are available, setup the hooks. */
305 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
306 /* We condition the name demangling and the generation of type encoding
307 strings on -gdwarf+ and always set descriptive types on. */
308 if (use_gnu_debug_info_extensions)
310 dwarf2out_set_type_encoding_func (extract_encoding);
311 dwarf2out_set_demangle_name_func (decode_name);
313 dwarf2out_set_descriptive_type_func (get_parallel_type);
316 /* Enable GNAT stack checking method if needed */
317 if (!Stack_Check_Probes_On_Target)
318 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
320 /* Retrieve alignment settings. */
321 double_float_alignment = get_target_double_float_alignment ();
322 double_scalar_alignment = get_target_double_scalar_alignment ();
324 /* Record the builtin types. Define `integer' and `unsigned char' first so
325 that dbx will output them first. */
326 record_builtin_type ("integer", integer_type_node);
327 record_builtin_type ("unsigned char", char_type_node);
328 record_builtin_type ("long integer", long_integer_type_node);
329 unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1);
330 record_builtin_type ("unsigned int", unsigned_type_node);
331 record_builtin_type (SIZE_TYPE, sizetype);
332 record_builtin_type ("boolean", boolean_type_node);
333 record_builtin_type ("void", void_type_node);
335 /* Save the type we made for integer as the type for Standard.Integer. */
336 save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node),
339 /* Save the type we made for boolean as the type for Standard.Boolean. */
340 save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node),
342 gnat_literal = First_Literal (Base_Type (standard_boolean));
343 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
344 gcc_assert (t == boolean_false_node);
345 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
346 boolean_type_node, t, true, false, false, false,
348 DECL_IGNORED_P (t) = 1;
349 save_gnu_tree (gnat_literal, t, false);
350 gnat_literal = Next_Literal (gnat_literal);
351 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
352 gcc_assert (t == boolean_true_node);
353 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
354 boolean_type_node, t, true, false, false, false,
356 DECL_IGNORED_P (t) = 1;
357 save_gnu_tree (gnat_literal, t, false);
359 void_ftype = build_function_type (void_type_node, NULL_TREE);
360 ptr_void_ftype = build_pointer_type (void_ftype);
362 /* Now declare runtime functions. */
363 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
365 /* malloc is a function declaration tree for a function to allocate
368 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
369 build_function_type (ptr_void_type_node,
370 tree_cons (NULL_TREE,
372 NULL_TREE, false, true, true, NULL, Empty);
373 DECL_IS_MALLOC (malloc_decl) = 1;
375 /* malloc32 is a function declaration tree for a function to allocate
376 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
378 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
379 build_function_type (ptr_void_type_node,
380 tree_cons (NULL_TREE,
382 NULL_TREE, false, true, true, NULL, Empty);
383 DECL_IS_MALLOC (malloc32_decl) = 1;
385 /* free is a function declaration tree for a function to free memory. */
387 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
388 build_function_type (void_type_node,
389 tree_cons (NULL_TREE,
392 NULL_TREE, false, true, true, NULL, Empty);
394 /* This is used for 64-bit multiplication with overflow checking. */
396 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
397 build_function_type_list (int64_type, int64_type,
398 int64_type, NULL_TREE),
399 NULL_TREE, false, true, true, NULL, Empty);
401 /* Make the types and functions used for exception processing. */
403 = build_array_type (gnat_type_for_mode (Pmode, 0),
404 build_index_type (size_int (5)));
405 record_builtin_type ("JMPBUF_T", jmpbuf_type);
406 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
408 /* Functions to get and set the jumpbuf pointer for the current thread. */
410 = create_subprog_decl
411 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
412 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
413 NULL_TREE, false, true, true, NULL, Empty);
414 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
415 DECL_PURE_P (get_jmpbuf_decl) = 1;
418 = create_subprog_decl
419 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
421 build_function_type (void_type_node,
422 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
423 NULL_TREE, false, true, true, NULL, Empty);
425 /* setjmp returns an integer and has one operand, which is a pointer to
428 = create_subprog_decl
429 (get_identifier ("__builtin_setjmp"), NULL_TREE,
430 build_function_type (integer_type_node,
431 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
432 NULL_TREE, false, true, true, NULL, Empty);
434 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
435 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
437 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
439 update_setjmp_buf_decl
440 = create_subprog_decl
441 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
442 build_function_type (void_type_node,
443 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
444 NULL_TREE, false, true, true, NULL, Empty);
446 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
447 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
449 /* Hooks to call when entering/leaving an exception handler. */
451 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
452 build_function_type (void_type_node,
453 tree_cons (NULL_TREE,
456 NULL_TREE, false, true, true, NULL, Empty);
459 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
460 build_function_type (void_type_node,
461 tree_cons (NULL_TREE,
464 NULL_TREE, false, true, true, NULL, Empty);
466 /* If in no exception handlers mode, all raise statements are redirected to
467 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
468 this procedure will never be called in this mode. */
469 if (No_Exception_Handlers_Set ())
472 = create_subprog_decl
473 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
474 build_function_type (void_type_node,
475 tree_cons (NULL_TREE,
476 build_pointer_type (char_type_node),
477 tree_cons (NULL_TREE,
480 NULL_TREE, false, true, true, NULL, Empty);
482 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
483 gnat_raise_decls[i] = decl;
486 /* Otherwise, make one decl for each exception reason. */
487 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
491 sprintf (name, "__gnat_rcheck_%.2d", i);
493 = create_subprog_decl
494 (get_identifier (name), NULL_TREE,
495 build_function_type (void_type_node,
496 tree_cons (NULL_TREE,
499 tree_cons (NULL_TREE,
502 NULL_TREE, false, true, true, NULL, Empty);
505 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
507 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
508 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
509 TREE_TYPE (gnat_raise_decls[i])
510 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
514 /* Set the types that GCC and Gigi use from the front end. We would
515 like to do this for char_type_node, but it needs to correspond to
518 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
519 except_type_node = TREE_TYPE (exception_type);
521 /* Make other functions used for exception processing. */
523 = create_subprog_decl
524 (get_identifier ("system__soft_links__get_gnat_exception"),
526 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
527 NULL_TREE, false, true, true, NULL, Empty);
528 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
529 DECL_PURE_P (get_excptr_decl) = 1;
532 = create_subprog_decl
533 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
534 build_function_type (void_type_node,
535 tree_cons (NULL_TREE,
536 build_pointer_type (except_type_node),
538 NULL_TREE, false, true, true, NULL, Empty);
540 /* Indicate that these never return. */
541 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
542 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
543 TREE_TYPE (raise_nodefer_decl)
544 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
547 /* Build the special descriptor type and its null node if needed. */
548 if (TARGET_VTABLE_USES_DESCRIPTORS)
550 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
551 tree field_list = NULL_TREE, null_list = NULL_TREE;
554 fdesc_type_node = make_node (RECORD_TYPE);
556 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
558 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
559 fdesc_type_node, 0, 0, 0, 1);
560 TREE_CHAIN (field) = field_list;
562 null_list = tree_cons (field, null_node, null_list);
565 finish_record_type (fdesc_type_node, nreverse (field_list), 0, true);
566 record_builtin_type ("descriptor", fdesc_type_node);
567 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
571 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
573 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
575 /* In this case, the builtin floating point types are VAX float,
576 so make up a type for use. */
577 longest_float_type_node = make_node (REAL_TYPE);
578 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
579 layout_type (longest_float_type_node);
580 record_builtin_type ("longest float type", longest_float_type_node);
583 longest_float_type_node = TREE_TYPE (long_long_float_type);
585 /* Dummy objects to materialize "others" and "all others" in the exception
586 tables. These are exported by a-exexpr.adb, so see this unit for the
589 = create_var_decl (get_identifier ("OTHERS"),
590 get_identifier ("__gnat_others_value"),
591 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
594 = create_var_decl (get_identifier ("ALL_OTHERS"),
595 get_identifier ("__gnat_all_others_value"),
596 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
598 main_identifier_node = get_identifier ("main");
600 /* Install the builtins we might need, either internally or as
601 user available facilities for Intrinsic imports. */
602 gnat_install_builtins ();
604 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
605 gnu_constraint_error_label_stack
606 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
607 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
608 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
610 /* Process any Pragma Ident for the main unit. */
611 #ifdef ASM_OUTPUT_IDENT
612 if (Present (Ident_String (Main_Unit)))
615 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
618 /* If we are using the GCC exception mechanism, let GCC know. */
619 if (Exception_Mechanism == Back_End_Exceptions)
622 /* Now translate the compilation unit proper. */
624 Compilation_Unit_to_gnu (gnat_root);
626 /* Finally see if we have any elaboration procedures to deal with. */
627 for (info = elab_info_list; info; info = info->next)
629 tree gnu_body = DECL_SAVED_TREE (info->elab_proc);
631 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
632 the gimplifier for obvious reasons, but it turns out that we need to
633 unshare them for the global level because of SAVE_EXPRs made around
634 checks for global objects and around allocators for global objects
635 of variable size, in order to prevent node sharing in the underlying
636 expression. Note that this implicitly assumes that the SAVE_EXPR
637 nodes themselves are not shared between subprograms, which would be
638 an upstream bug for which we would not change the outcome. */
639 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
641 /* Process the function as others, but for indicating this is an
642 elab proc, to be discarded if empty, then propagate the status
643 up to the GNAT tree node. */
644 begin_subprog_body (info->elab_proc);
645 end_subprog_body (gnu_body, true);
647 if (empty_body_p (gimple_body (info->elab_proc)))
648 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
651 /* We cannot track the location of errors past this point. */
652 error_gnat_node = Empty;
655 /* Return a positive value if an lvalue is required for GNAT_NODE.
656 GNU_TYPE is the type that will be used for GNAT_NODE in the
657 translated GNU tree. ALIASED indicates whether the underlying
658 object represented by GNAT_NODE is aliased in the Ada sense.
660 The function climbs up the GNAT tree starting from the node and
661 returns 1 upon encountering a node that effectively requires an
662 lvalue downstream. It returns int instead of bool to facilitate
663 usage in non purely binary logic contexts. */
666 lvalue_required_p (Node_Id gnat_node, tree gnu_type, int aliased)
668 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
670 switch (Nkind (gnat_parent))
675 case N_Attribute_Reference:
677 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
678 return id == Attr_Address
680 || id == Attr_Unchecked_Access
681 || id == Attr_Unrestricted_Access;
684 case N_Parameter_Association:
685 case N_Function_Call:
686 case N_Procedure_Call_Statement:
687 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
689 case N_Indexed_Component:
690 /* Only the array expression can require an lvalue. */
691 if (Prefix (gnat_parent) != gnat_node)
694 /* ??? Consider that referencing an indexed component with a
695 non-constant index forces the whole aggregate to memory.
696 Note that N_Integer_Literal is conservative, any static
697 expression in the RM sense could probably be accepted. */
698 for (gnat_temp = First (Expressions (gnat_parent));
700 gnat_temp = Next (gnat_temp))
701 if (Nkind (gnat_temp) != N_Integer_Literal)
704 /* ... fall through ... */
707 /* Only the array expression can require an lvalue. */
708 if (Prefix (gnat_parent) != gnat_node)
711 aliased |= Has_Aliased_Components (Etype (gnat_node));
712 return lvalue_required_p (gnat_parent, gnu_type, aliased);
714 case N_Selected_Component:
715 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
716 return lvalue_required_p (gnat_parent, gnu_type, aliased);
718 case N_Object_Renaming_Declaration:
719 /* We need to make a real renaming only if the constant object is
720 aliased or if we may use a renaming pointer; otherwise we can
721 optimize and return the rvalue. We make an exception if the object
722 is an identifier since in this case the rvalue can be propagated
723 attached to the CONST_DECL. */
725 /* This should match the constant case of the renaming code. */
727 (Underlying_Type (Etype (Name (gnat_parent))))
728 || Nkind (Name (gnat_parent)) == N_Identifier);
730 case N_Object_Declaration:
731 /* We cannot use a constructor if this is an atomic object because
732 the actual assignment might end up being done component-wise. */
733 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
734 && Is_Atomic (Defining_Entity (gnat_parent));
736 case N_Assignment_Statement:
737 /* We cannot use a constructor if the LHS is an atomic object because
738 the actual assignment might end up being done component-wise. */
739 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
740 && Is_Atomic (Entity (Name (gnat_parent)));
749 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
750 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
751 to where we should place the result type. */
754 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
756 Node_Id gnat_temp, gnat_temp_type;
757 tree gnu_result, gnu_result_type;
759 /* Whether we should require an lvalue for GNAT_NODE. Needed in
760 specific circumstances only, so evaluated lazily. < 0 means
761 unknown, > 0 means known true, 0 means known false. */
762 int require_lvalue = -1;
764 /* If GNAT_NODE is a constant, whether we should use the initialization
765 value instead of the constant entity, typically for scalars with an
766 address clause when the parent doesn't require an lvalue. */
767 bool use_constant_initializer = false;
769 /* If the Etype of this node does not equal the Etype of the Entity,
770 something is wrong with the entity map, probably in generic
771 instantiation. However, this does not apply to types. Since we sometime
772 have strange Ekind's, just do this test for objects. Also, if the Etype of
773 the Entity is private, the Etype of the N_Identifier is allowed to be the
774 full type and also we consider a packed array type to be the same as the
775 original type. Similarly, a class-wide type is equivalent to a subtype of
776 itself. Finally, if the types are Itypes, one may be a copy of the other,
777 which is also legal. */
778 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
779 ? gnat_node : Entity (gnat_node));
780 gnat_temp_type = Etype (gnat_temp);
782 gcc_assert (Etype (gnat_node) == gnat_temp_type
783 || (Is_Packed (gnat_temp_type)
784 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
785 || (Is_Class_Wide_Type (Etype (gnat_node)))
786 || (IN (Ekind (gnat_temp_type), Private_Kind)
787 && Present (Full_View (gnat_temp_type))
788 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
789 || (Is_Packed (Full_View (gnat_temp_type))
790 && (Etype (gnat_node)
791 == Packed_Array_Type (Full_View
792 (gnat_temp_type))))))
793 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
794 || !(Ekind (gnat_temp) == E_Variable
795 || Ekind (gnat_temp) == E_Component
796 || Ekind (gnat_temp) == E_Constant
797 || Ekind (gnat_temp) == E_Loop_Parameter
798 || IN (Ekind (gnat_temp), Formal_Kind)));
800 /* If this is a reference to a deferred constant whose partial view is an
801 unconstrained private type, the proper type is on the full view of the
802 constant, not on the full view of the type, which may be unconstrained.
804 This may be a reference to a type, for example in the prefix of the
805 attribute Position, generated for dispatching code (see Make_DT in
806 exp_disp,adb). In that case we need the type itself, not is parent,
807 in particular if it is a derived type */
808 if (Is_Private_Type (gnat_temp_type)
809 && Has_Unknown_Discriminants (gnat_temp_type)
810 && Ekind (gnat_temp) == E_Constant
811 && Present (Full_View (gnat_temp)))
813 gnat_temp = Full_View (gnat_temp);
814 gnat_temp_type = Etype (gnat_temp);
818 /* We want to use the Actual_Subtype if it has already been elaborated,
819 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
821 if ((Ekind (gnat_temp) == E_Constant
822 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
823 && !(Is_Array_Type (Etype (gnat_temp))
824 && Present (Packed_Array_Type (Etype (gnat_temp))))
825 && Present (Actual_Subtype (gnat_temp))
826 && present_gnu_tree (Actual_Subtype (gnat_temp)))
827 gnat_temp_type = Actual_Subtype (gnat_temp);
829 gnat_temp_type = Etype (gnat_node);
832 /* Expand the type of this identifier first, in case it is an enumeral
833 literal, which only get made when the type is expanded. There is no
834 order-of-elaboration issue here. */
835 gnu_result_type = get_unpadded_type (gnat_temp_type);
837 /* If this is a non-imported scalar constant with an address clause,
838 retrieve the value instead of a pointer to be dereferenced unless
839 an lvalue is required. This is generally more efficient and actually
840 required if this is a static expression because it might be used
841 in a context where a dereference is inappropriate, such as a case
842 statement alternative or a record discriminant. There is no possible
843 volatile-ness short-circuit here since Volatile constants must bei
845 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
846 && !Is_Imported (gnat_temp)
847 && Present (Address_Clause (gnat_temp)))
849 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
850 Is_Aliased (gnat_temp));
851 use_constant_initializer = !require_lvalue;
854 if (use_constant_initializer)
856 /* If this is a deferred constant, the initializer is attached to
858 if (Present (Full_View (gnat_temp)))
859 gnat_temp = Full_View (gnat_temp);
861 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
864 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
866 /* If we are in an exception handler, force this variable into memory to
867 ensure optimization does not remove stores that appear redundant but are
868 actually needed in case an exception occurs.
870 ??? Note that we need not do this if the variable is declared within the
871 handler, only if it is referenced in the handler and declared in an
872 enclosing block, but we have no way of testing that right now.
874 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
875 here, but it can now be removed by the Tree aliasing machinery if the
876 address of the variable is never taken. All we can do is to make the
877 variable volatile, which might incur the generation of temporaries just
878 to access the memory in some circumstances. This can be avoided for
879 variables of non-constant size because they are automatically allocated
880 to memory. There might be no way of allocating a proper temporary for
881 them in any case. We only do this for SJLJ though. */
882 if (TREE_VALUE (gnu_except_ptr_stack)
883 && TREE_CODE (gnu_result) == VAR_DECL
884 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
885 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
887 /* Some objects (such as parameters passed by reference, globals of
888 variable size, and renamed objects) actually represent the address
889 of the object. In that case, we must do the dereference. Likewise,
890 deal with parameters to foreign convention subprograms. */
891 if (DECL_P (gnu_result)
892 && (DECL_BY_REF_P (gnu_result)
893 || (TREE_CODE (gnu_result) == PARM_DECL
894 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
896 bool ro = DECL_POINTS_TO_READONLY_P (gnu_result);
899 if (TREE_CODE (gnu_result) == PARM_DECL
900 && DECL_BY_COMPONENT_PTR_P (gnu_result))
902 = build_unary_op (INDIRECT_REF, NULL_TREE,
903 convert (build_pointer_type (gnu_result_type),
906 /* If it's a renaming pointer and we are at the right binding level,
907 we can reference the renamed object directly, since the renamed
908 expression has been protected against multiple evaluations. */
909 else if (TREE_CODE (gnu_result) == VAR_DECL
910 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) != 0
911 && (! DECL_RENAMING_GLOBAL_P (gnu_result)
912 || global_bindings_p ()))
913 gnu_result = renamed_obj;
915 /* Return the underlying CST for a CONST_DECL like a few lines below,
916 after dereferencing in this case. */
917 else if (TREE_CODE (gnu_result) == CONST_DECL)
918 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
919 DECL_INITIAL (gnu_result));
922 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
924 TREE_READONLY (gnu_result) = TREE_STATIC (gnu_result) = ro;
927 /* The GNAT tree has the type of a function as the type of its result. Also
928 use the type of the result if the Etype is a subtype which is nominally
929 unconstrained. But remove any padding from the resulting type. */
930 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
931 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
933 gnu_result_type = TREE_TYPE (gnu_result);
934 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
935 && TYPE_IS_PADDING_P (gnu_result_type))
936 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
939 /* If we have a constant declaration and its initializer at hand,
940 try to return the latter to avoid the need to call fold in lots
941 of places and the need of elaboration code if this Id is used as
942 an initializer itself. */
943 if (TREE_CONSTANT (gnu_result)
944 && DECL_P (gnu_result)
945 && DECL_INITIAL (gnu_result))
948 = (TREE_CODE (gnu_result) == CONST_DECL
949 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
951 /* If there is a corresponding variable, we only want to return
952 the CST value if an lvalue is not required. Evaluate this
953 now if we have not already done so. */
954 if (object && require_lvalue < 0)
955 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
956 Is_Aliased (gnat_temp));
958 if (!object || !require_lvalue)
959 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
962 *gnu_result_type_p = gnu_result_type;
966 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
967 any statements we generate. */
970 Pragma_to_gnu (Node_Id gnat_node)
973 tree gnu_result = alloc_stmt_list ();
975 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
977 if (type_annotate_only
978 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
981 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
983 case Pragma_Inspection_Point:
984 /* Do nothing at top level: all such variables are already viewable. */
985 if (global_bindings_p ())
988 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
990 gnat_temp = Next (gnat_temp))
992 Node_Id gnat_expr = Expression (gnat_temp);
993 tree gnu_expr = gnat_to_gnu (gnat_expr);
995 enum machine_mode mode;
996 tree asm_constraint = NULL_TREE;
997 #ifdef ASM_COMMENT_START
1001 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1002 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1004 /* Use the value only if it fits into a normal register,
1005 otherwise use the address. */
1006 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1007 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1008 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1009 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1012 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1014 #ifdef ASM_COMMENT_START
1015 comment = concat (ASM_COMMENT_START,
1016 " inspection point: ",
1017 Get_Name_String (Chars (gnat_expr)),
1018 use_address ? " address" : "",
1021 asm_constraint = build_string (strlen (comment), comment);
1024 gnu_expr = build4 (ASM_EXPR, void_type_node,
1028 (build_tree_list (NULL_TREE,
1029 build_string (1, "g")),
1030 gnu_expr, NULL_TREE),
1032 ASM_VOLATILE_P (gnu_expr) = 1;
1033 set_expr_location_from_node (gnu_expr, gnat_node);
1034 append_to_statement_list (gnu_expr, &gnu_result);
1038 case Pragma_Optimize:
1039 switch (Chars (Expression
1040 (First (Pragma_Argument_Associations (gnat_node)))))
1042 case Name_Time: case Name_Space:
1044 post_error ("insufficient -O value?", gnat_node);
1049 post_error ("must specify -O0?", gnat_node);
1057 case Pragma_Reviewable:
1058 if (write_symbols == NO_DEBUG)
1059 post_error ("must specify -g?", gnat_node);
1066 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1067 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1068 where we should place the result type. ATTRIBUTE is the attribute ID. */
1071 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1073 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1074 tree gnu_type = TREE_TYPE (gnu_prefix);
1075 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1076 bool prefix_unused = false;
1078 /* If the input is a NULL_EXPR, make a new one. */
1079 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1081 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1082 *gnu_result_type_p = gnu_result_type;
1083 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1090 /* These are just conversions since representation clauses for
1091 enumeration types are handled in the front-end. */
1093 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1094 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1095 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1096 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1097 checkp, checkp, true, gnat_node);
1103 /* These just add or subtract the constant 1 since representation
1104 clauses for enumeration types are handled in the front-end. */
1105 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1106 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1108 if (Do_Range_Check (First (Expressions (gnat_node))))
1110 gnu_expr = protect_multiple_eval (gnu_expr);
1113 (build_binary_op (EQ_EXPR, integer_type_node,
1115 attribute == Attr_Pred
1116 ? TYPE_MIN_VALUE (gnu_result_type)
1117 : TYPE_MAX_VALUE (gnu_result_type)),
1118 gnu_expr, CE_Range_Check_Failed, gnat_node);
1122 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1123 gnu_result_type, gnu_expr,
1124 convert (gnu_result_type, integer_one_node));
1128 case Attr_Unrestricted_Access:
1129 /* Conversions don't change addresses but can cause us to miss the
1130 COMPONENT_REF case below, so strip them off. */
1131 gnu_prefix = remove_conversions (gnu_prefix,
1132 !Must_Be_Byte_Aligned (gnat_node));
1134 /* If we are taking 'Address of an unconstrained object, this is the
1135 pointer to the underlying array. */
1136 if (attribute == Attr_Address)
1137 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1139 /* If we are building a static dispatch table, we have to honor
1140 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1141 with the C++ ABI. We do it in the non-static case as well,
1142 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1143 else if (TARGET_VTABLE_USES_DESCRIPTORS
1144 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1146 tree gnu_field, gnu_list = NULL_TREE, t;
1147 /* Descriptors can only be built here for top-level functions. */
1148 bool build_descriptor = (global_bindings_p () != 0);
1151 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1153 /* If we're not going to build the descriptor, we have to retrieve
1154 the one which will be built by the linker (or by the compiler
1155 later if a static chain is requested). */
1156 if (!build_descriptor)
1158 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1159 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1161 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1164 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1165 i < TARGET_VTABLE_USES_DESCRIPTORS;
1166 gnu_field = TREE_CHAIN (gnu_field), i++)
1168 if (build_descriptor)
1170 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1171 build_int_cst (NULL_TREE, i));
1172 TREE_CONSTANT (t) = 1;
1175 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1176 gnu_field, NULL_TREE);
1178 gnu_list = tree_cons (gnu_field, t, gnu_list);
1181 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1185 /* ... fall through ... */
1188 case Attr_Unchecked_Access:
1189 case Attr_Code_Address:
1190 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1192 = build_unary_op (((attribute == Attr_Address
1193 || attribute == Attr_Unrestricted_Access)
1194 && !Must_Be_Byte_Aligned (gnat_node))
1195 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1196 gnu_result_type, gnu_prefix);
1198 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1199 don't try to build a trampoline. */
1200 if (attribute == Attr_Code_Address)
1202 for (gnu_expr = gnu_result;
1203 CONVERT_EXPR_P (gnu_expr);
1204 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1205 TREE_CONSTANT (gnu_expr) = 1;
1207 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1208 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1211 /* For other address attributes applied to a nested function,
1212 find an inner ADDR_EXPR and annotate it so that we can issue
1213 a useful warning with -Wtrampolines. */
1214 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1216 for (gnu_expr = gnu_result;
1217 CONVERT_EXPR_P (gnu_expr);
1218 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1221 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1222 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1224 set_expr_location_from_node (gnu_expr, gnat_node);
1226 /* Check that we're not violating the No_Implicit_Dynamic_Code
1227 restriction. Be conservative if we don't know anything
1228 about the trampoline strategy for the target. */
1229 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1234 case Attr_Pool_Address:
1237 tree gnu_ptr = gnu_prefix;
1239 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1241 /* If this is an unconstrained array, we know the object has been
1242 allocated with the template in front of the object. So compute
1243 the template address. */
1244 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1246 = convert (build_pointer_type
1247 (TYPE_OBJECT_RECORD_TYPE
1248 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1251 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1252 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1253 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1255 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1256 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1257 tree gnu_byte_offset
1258 = convert (sizetype,
1259 size_diffop (size_zero_node, gnu_pos));
1260 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1262 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1263 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1264 gnu_ptr, gnu_byte_offset);
1267 gnu_result = convert (gnu_result_type, gnu_ptr);
1272 case Attr_Object_Size:
1273 case Attr_Value_Size:
1274 case Attr_Max_Size_In_Storage_Elements:
1275 gnu_expr = gnu_prefix;
1277 /* Remove NOPs from GNU_EXPR and conversions from GNU_PREFIX.
1278 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1279 while (TREE_CODE (gnu_expr) == NOP_EXPR)
1280 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1282 gnu_prefix = remove_conversions (gnu_prefix, true);
1283 prefix_unused = true;
1284 gnu_type = TREE_TYPE (gnu_prefix);
1286 /* Replace an unconstrained array type with the type of the underlying
1287 array. We can't do this with a call to maybe_unconstrained_array
1288 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1289 use the record type that will be used to allocate the object and its
1291 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1293 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1294 if (attribute != Attr_Max_Size_In_Storage_Elements)
1295 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1298 /* If we're looking for the size of a field, return the field size.
1299 Otherwise, if the prefix is an object, or if 'Object_Size or
1300 'Max_Size_In_Storage_Elements has been specified, the result is the
1301 GCC size of the type. Otherwise, the result is the RM size of the
1303 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1304 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1305 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1306 || attribute == Attr_Object_Size
1307 || attribute == Attr_Max_Size_In_Storage_Elements)
1309 /* If this is a padded type, the GCC size isn't relevant to the
1310 programmer. Normally, what we want is the RM size, which was set
1311 from the specified size, but if it was not set, we want the size
1312 of the relevant field. Using the MAX of those two produces the
1313 right result in all case. Don't use the size of the field if it's
1314 a self-referential type, since that's never what's wanted. */
1315 if (TREE_CODE (gnu_type) == RECORD_TYPE
1316 && TYPE_IS_PADDING_P (gnu_type)
1317 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1319 gnu_result = rm_size (gnu_type);
1320 if (!(CONTAINS_PLACEHOLDER_P
1321 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))))
1323 = size_binop (MAX_EXPR, gnu_result,
1324 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1326 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1328 Node_Id gnat_deref = Prefix (gnat_node);
1329 Node_Id gnat_actual_subtype
1330 = Actual_Designated_Subtype (gnat_deref);
1332 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1334 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1335 && Present (gnat_actual_subtype))
1337 tree gnu_actual_obj_type
1338 = gnat_to_gnu_type (gnat_actual_subtype);
1340 = build_unc_object_type_from_ptr (gnu_ptr_type,
1341 gnu_actual_obj_type,
1342 get_identifier ("SIZE"));
1345 gnu_result = TYPE_SIZE (gnu_type);
1348 gnu_result = TYPE_SIZE (gnu_type);
1351 gnu_result = rm_size (gnu_type);
1353 gcc_assert (gnu_result);
1355 /* Deal with a self-referential size by returning the maximum size for
1356 a type and by qualifying the size with the object for 'Size of an
1358 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1360 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1361 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1363 gnu_result = max_size (gnu_result, true);
1366 /* If the type contains a template, subtract its size. */
1367 if (TREE_CODE (gnu_type) == RECORD_TYPE
1368 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1369 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1370 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1372 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1374 if (attribute == Attr_Max_Size_In_Storage_Elements)
1375 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1376 gnu_result, bitsize_unit_node);
1379 case Attr_Alignment:
1383 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1384 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1386 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1387 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1389 gnu_type = TREE_TYPE (gnu_prefix);
1390 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1391 prefix_unused = true;
1393 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1394 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1397 Node_Id gnat_prefix = Prefix (gnat_node);
1398 Entity_Id gnat_type = Etype (gnat_prefix);
1399 unsigned int double_align;
1400 bool is_capped_double, align_clause;
1402 /* If the default alignment of "double" or larger scalar types is
1403 specifically capped and there is an alignment clause neither
1404 on the type nor on the prefix itself, return the cap. */
1405 if ((double_align = double_float_alignment) > 0)
1407 = is_double_float_or_array (gnat_type, &align_clause);
1408 else if ((double_align = double_scalar_alignment) > 0)
1410 = is_double_scalar_or_array (gnat_type, &align_clause);
1412 is_capped_double = align_clause = false;
1414 if (is_capped_double
1415 && Nkind (gnat_prefix) == N_Identifier
1416 && Present (Alignment_Clause (Entity (gnat_prefix))))
1417 align_clause = true;
1419 if (is_capped_double && !align_clause)
1420 align = double_align;
1422 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1425 gnu_result = size_int (align);
1431 case Attr_Range_Length:
1432 prefix_unused = true;
1434 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1436 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1438 if (attribute == Attr_First)
1439 gnu_result = TYPE_MIN_VALUE (gnu_type);
1440 else if (attribute == Attr_Last)
1441 gnu_result = TYPE_MAX_VALUE (gnu_type);
1445 (MAX_EXPR, get_base_type (gnu_result_type),
1447 (PLUS_EXPR, get_base_type (gnu_result_type),
1448 build_binary_op (MINUS_EXPR,
1449 get_base_type (gnu_result_type),
1450 convert (gnu_result_type,
1451 TYPE_MAX_VALUE (gnu_type)),
1452 convert (gnu_result_type,
1453 TYPE_MIN_VALUE (gnu_type))),
1454 convert (gnu_result_type, integer_one_node)),
1455 convert (gnu_result_type, integer_zero_node));
1460 /* ... fall through ... */
1464 int Dimension = (Present (Expressions (gnat_node))
1465 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1467 struct parm_attr_d *pa = NULL;
1468 Entity_Id gnat_param = Empty;
1470 /* Make sure any implicit dereference gets done. */
1471 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1472 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1473 /* We treat unconstrained array In parameters specially. */
1474 if (Nkind (Prefix (gnat_node)) == N_Identifier
1475 && !Is_Constrained (Etype (Prefix (gnat_node)))
1476 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1477 gnat_param = Entity (Prefix (gnat_node));
1478 gnu_type = TREE_TYPE (gnu_prefix);
1479 prefix_unused = true;
1480 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1482 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1487 for (ndim = 1, gnu_type_temp = gnu_type;
1488 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1489 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1490 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1493 Dimension = ndim + 1 - Dimension;
1496 for (i = 1; i < Dimension; i++)
1497 gnu_type = TREE_TYPE (gnu_type);
1499 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1501 /* When not optimizing, look up the slot associated with the parameter
1502 and the dimension in the cache and create a new one on failure. */
1503 if (!optimize && Present (gnat_param))
1505 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1506 if (pa->id == gnat_param && pa->dim == Dimension)
1511 pa = GGC_CNEW (struct parm_attr_d);
1512 pa->id = gnat_param;
1513 pa->dim = Dimension;
1514 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1518 /* Return the cached expression or build a new one. */
1519 if (attribute == Attr_First)
1521 if (pa && pa->first)
1523 gnu_result = pa->first;
1528 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1531 else if (attribute == Attr_Last)
1535 gnu_result = pa->last;
1540 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1543 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1545 if (pa && pa->length)
1547 gnu_result = pa->length;
1552 /* We used to compute the length as max (hb - lb + 1, 0),
1553 which could overflow for some cases of empty arrays, e.g.
1554 when lb == index_type'first. We now compute the length as
1555 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1556 much rarer cases, for extremely large arrays we expect
1557 never to encounter in practice. In addition, the former
1558 computation required the use of potentially constraining
1559 signed arithmetic while the latter doesn't. Note that
1560 the comparison must be done in the original index type,
1561 to avoid any overflow during the conversion. */
1562 tree comp_type = get_base_type (gnu_result_type);
1563 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1564 tree lb = TYPE_MIN_VALUE (index_type);
1565 tree hb = TYPE_MAX_VALUE (index_type);
1567 = build_binary_op (PLUS_EXPR, comp_type,
1568 build_binary_op (MINUS_EXPR,
1570 convert (comp_type, hb),
1571 convert (comp_type, lb)),
1572 convert (comp_type, integer_one_node));
1574 = build_cond_expr (comp_type,
1575 build_binary_op (GE_EXPR,
1579 convert (comp_type, integer_zero_node));
1583 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1584 handling. Note that these attributes could not have been used on
1585 an unconstrained array type. */
1586 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1588 /* Cache the expression we have just computed. Since we want to do it
1589 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1590 create the temporary. */
1594 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1595 TREE_SIDE_EFFECTS (gnu_result) = 1;
1596 if (attribute == Attr_First)
1597 pa->first = gnu_result;
1598 else if (attribute == Attr_Last)
1599 pa->last = gnu_result;
1601 pa->length = gnu_result;
1606 case Attr_Bit_Position:
1608 case Attr_First_Bit:
1612 HOST_WIDE_INT bitsize;
1613 HOST_WIDE_INT bitpos;
1615 tree gnu_field_bitpos;
1616 tree gnu_field_offset;
1618 enum machine_mode mode;
1619 int unsignedp, volatilep;
1621 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1622 gnu_prefix = remove_conversions (gnu_prefix, true);
1623 prefix_unused = true;
1625 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1626 the result is 0. Don't allow 'Bit on a bare component, though. */
1627 if (attribute == Attr_Bit
1628 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1629 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1631 gnu_result = integer_zero_node;
1636 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1637 || (attribute == Attr_Bit_Position
1638 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1640 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1641 &mode, &unsignedp, &volatilep, false);
1643 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1645 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1646 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1648 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1649 TREE_CODE (gnu_inner) == COMPONENT_REF
1650 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1651 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1654 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1655 bit_position (TREE_OPERAND (gnu_inner, 1)));
1657 = size_binop (PLUS_EXPR, gnu_field_offset,
1658 byte_position (TREE_OPERAND (gnu_inner, 1)));
1661 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1663 gnu_field_bitpos = bit_position (gnu_prefix);
1664 gnu_field_offset = byte_position (gnu_prefix);
1668 gnu_field_bitpos = bitsize_zero_node;
1669 gnu_field_offset = size_zero_node;
1675 gnu_result = gnu_field_offset;
1678 case Attr_First_Bit:
1680 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1684 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1685 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1686 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1687 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1691 case Attr_Bit_Position:
1692 gnu_result = gnu_field_bitpos;
1696 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1698 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1705 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1706 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1708 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1709 gnu_result = build_binary_op (attribute == Attr_Min
1710 ? MIN_EXPR : MAX_EXPR,
1711 gnu_result_type, gnu_lhs, gnu_rhs);
1715 case Attr_Passed_By_Reference:
1716 gnu_result = size_int (default_pass_by_ref (gnu_type)
1717 || must_pass_by_ref (gnu_type));
1718 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1721 case Attr_Component_Size:
1722 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1723 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1725 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1726 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1728 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1729 gnu_type = TREE_TYPE (gnu_prefix);
1731 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1732 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1734 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1735 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1736 gnu_type = TREE_TYPE (gnu_type);
1738 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1740 /* Note this size cannot be self-referential. */
1741 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1742 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1743 prefix_unused = true;
1746 case Attr_Null_Parameter:
1747 /* This is just a zero cast to the pointer type for our prefix and
1749 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1751 = build_unary_op (INDIRECT_REF, NULL_TREE,
1752 convert (build_pointer_type (gnu_result_type),
1753 integer_zero_node));
1754 TREE_PRIVATE (gnu_result) = 1;
1757 case Attr_Mechanism_Code:
1760 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1762 prefix_unused = true;
1763 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1764 if (Present (Expressions (gnat_node)))
1766 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1768 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1769 i--, gnat_obj = Next_Formal (gnat_obj))
1773 code = Mechanism (gnat_obj);
1774 if (code == Default)
1775 code = ((present_gnu_tree (gnat_obj)
1776 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1777 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1779 && (DECL_BY_COMPONENT_PTR_P
1780 (get_gnu_tree (gnat_obj))))))
1781 ? By_Reference : By_Copy);
1782 gnu_result = convert (gnu_result_type, size_int (- code));
1787 /* Say we have an unimplemented attribute. Then set the value to be
1788 returned to be a zero and hope that's something we can convert to
1789 the type of this attribute. */
1790 post_error ("unimplemented attribute", gnat_node);
1791 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1792 gnu_result = integer_zero_node;
1796 /* If this is an attribute where the prefix was unused, force a use of it if
1797 it has a side-effect. But don't do it if the prefix is just an entity
1798 name. However, if an access check is needed, we must do it. See second
1799 example in AARM 11.6(5.e). */
1800 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1801 && !Is_Entity_Name (Prefix (gnat_node)))
1802 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1803 gnu_prefix, gnu_result);
1805 *gnu_result_type_p = gnu_result_type;
1809 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1810 to a GCC tree, which is returned. */
1813 Case_Statement_to_gnu (Node_Id gnat_node)
1819 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1820 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1822 /* The range of values in a case statement is determined by the rules in
1823 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1824 of the expression. One exception arises in the case of a simple name that
1825 is parenthesized. This still has the Etype of the name, but since it is
1826 not a name, para 7 does not apply, and we need to go to the base type.
1827 This is the only case where parenthesization affects the dynamic
1828 semantics (i.e. the range of possible values at runtime that is covered
1829 by the others alternative.
1831 Another exception is if the subtype of the expression is non-static. In
1832 that case, we also have to use the base type. */
1833 if (Paren_Count (Expression (gnat_node)) != 0
1834 || !Is_OK_Static_Subtype (Underlying_Type
1835 (Etype (Expression (gnat_node)))))
1836 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1838 /* We build a SWITCH_EXPR that contains the code with interspersed
1839 CASE_LABEL_EXPRs for each label. */
1841 push_stack (&gnu_switch_label_stack, NULL_TREE,
1842 create_artificial_label (input_location));
1843 start_stmt_group ();
1844 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1845 Present (gnat_when);
1846 gnat_when = Next_Non_Pragma (gnat_when))
1848 Node_Id gnat_choice;
1849 int choices_added = 0;
1851 /* First compile all the different case choices for the current WHEN
1853 for (gnat_choice = First (Discrete_Choices (gnat_when));
1854 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1856 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1858 switch (Nkind (gnat_choice))
1861 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1862 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1865 case N_Subtype_Indication:
1866 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1867 (Constraint (gnat_choice))));
1868 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1869 (Constraint (gnat_choice))));
1873 case N_Expanded_Name:
1874 /* This represents either a subtype range or a static value of
1875 some kind; Ekind says which. */
1876 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1878 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1880 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1881 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1885 /* ... fall through ... */
1887 case N_Character_Literal:
1888 case N_Integer_Literal:
1889 gnu_low = gnat_to_gnu (gnat_choice);
1892 case N_Others_Choice:
1899 /* If the case value is a subtype that raises Constraint_Error at
1900 run-time because of a wrong bound, then gnu_low or gnu_high is
1901 not translated into an INTEGER_CST. In such a case, we need
1902 to ensure that the when statement is not added in the tree,
1903 otherwise it will crash the gimplifier. */
1904 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1905 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1907 add_stmt_with_node (build3
1908 (CASE_LABEL_EXPR, void_type_node,
1910 create_artificial_label (input_location)),
1916 /* Push a binding level here in case variables are declared as we want
1917 them to be local to this set of statements instead of to the block
1918 containing the Case statement. */
1919 if (choices_added > 0)
1921 add_stmt (build_stmt_group (Statements (gnat_when), true));
1922 add_stmt (build1 (GOTO_EXPR, void_type_node,
1923 TREE_VALUE (gnu_switch_label_stack)));
1927 /* Now emit a definition of the label all the cases branched to. */
1928 add_stmt (build1 (LABEL_EXPR, void_type_node,
1929 TREE_VALUE (gnu_switch_label_stack)));
1930 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1931 end_stmt_group (), NULL_TREE);
1932 pop_stack (&gnu_switch_label_stack);
1937 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1938 to a GCC tree, which is returned. */
1941 Loop_Statement_to_gnu (Node_Id gnat_node)
1943 /* ??? It would be nice to use "build" here, but there's no build5. */
1944 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1945 NULL_TREE, NULL_TREE, NULL_TREE);
1946 tree gnu_loop_var = NULL_TREE;
1947 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1948 tree gnu_cond_expr = NULL_TREE;
1951 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1952 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1953 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label (input_location);
1954 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1955 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1956 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1958 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1959 N_Exit_Statement can find it. */
1960 push_stack (&gnu_loop_label_stack, NULL_TREE,
1961 LOOP_STMT_LABEL (gnu_loop_stmt));
1963 /* Set the condition under which the loop must keep going.
1964 For the case "LOOP .... END LOOP;" the condition is always true. */
1965 if (No (gnat_iter_scheme))
1968 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1969 else if (Present (Condition (gnat_iter_scheme)))
1970 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1971 = gnat_to_gnu (Condition (gnat_iter_scheme));
1973 /* Otherwise we have an iteration scheme and the condition is given by
1974 the bounds of the subtype of the iteration variable. */
1977 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1978 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1979 Entity_Id gnat_type = Etype (gnat_loop_var);
1980 tree gnu_type = get_unpadded_type (gnat_type);
1981 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1982 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1983 tree gnu_first, gnu_last, gnu_limit;
1984 enum tree_code update_code, end_code;
1985 tree gnu_base_type = get_base_type (gnu_type);
1987 /* We must disable modulo reduction for the loop variable, if any,
1988 in order for the loop comparison to be effective. */
1989 if (Reverse_Present (gnat_loop_spec))
1991 gnu_first = gnu_high;
1993 update_code = MINUS_NOMOD_EXPR;
1995 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
1999 gnu_first = gnu_low;
2000 gnu_last = gnu_high;
2001 update_code = PLUS_NOMOD_EXPR;
2003 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
2006 /* We know the loop variable will not overflow if GNU_LAST is a constant
2007 and is not equal to GNU_LIMIT. If it might overflow, we have to move
2008 the limit test to the end of the loop. In that case, we have to test
2009 for an empty loop outside the loop. */
2010 if (TREE_CODE (gnu_last) != INTEGER_CST
2011 || TREE_CODE (gnu_limit) != INTEGER_CST
2012 || tree_int_cst_equal (gnu_last, gnu_limit))
2015 = build3 (COND_EXPR, void_type_node,
2016 build_binary_op (LE_EXPR, integer_type_node,
2018 NULL_TREE, alloc_stmt_list ());
2019 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2022 /* Open a new nesting level that will surround the loop to declare the
2023 loop index variable. */
2024 start_stmt_group ();
2027 /* Declare the loop index and set it to its initial value. */
2028 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2029 if (DECL_BY_REF_P (gnu_loop_var))
2030 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2032 /* The loop variable might be a padded type, so use `convert' to get a
2033 reference to the inner variable if so. */
2034 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2036 /* Set either the top or bottom exit condition as appropriate depending
2037 on whether or not we know an overflow cannot occur. */
2039 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2040 = build_binary_op (NE_EXPR, integer_type_node,
2041 gnu_loop_var, gnu_last);
2043 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2044 = build_binary_op (end_code, integer_type_node,
2045 gnu_loop_var, gnu_last);
2047 LOOP_STMT_UPDATE (gnu_loop_stmt)
2048 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2050 build_binary_op (update_code,
2051 TREE_TYPE (gnu_loop_var),
2053 convert (TREE_TYPE (gnu_loop_var),
2054 integer_one_node)));
2055 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2059 /* If the loop was named, have the name point to this loop. In this case,
2060 the association is not a ..._DECL node, but the end label from this
2062 if (Present (Identifier (gnat_node)))
2063 save_gnu_tree (Entity (Identifier (gnat_node)),
2064 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2066 /* Make the loop body into its own block, so any allocated storage will be
2067 released every iteration. This is needed for stack allocation. */
2068 LOOP_STMT_BODY (gnu_loop_stmt)
2069 = build_stmt_group (Statements (gnat_node), true);
2071 /* If we declared a variable, then we are in a statement group for that
2072 declaration. Add the LOOP_STMT to it and make that the "loop". */
2075 add_stmt (gnu_loop_stmt);
2077 gnu_loop_stmt = end_stmt_group ();
2080 /* If we have an outer COND_EXPR, that's our result and this loop is its
2081 "true" statement. Otherwise, the result is the LOOP_STMT. */
2084 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2085 gnu_result = gnu_cond_expr;
2086 recalculate_side_effects (gnu_cond_expr);
2089 gnu_result = gnu_loop_stmt;
2091 pop_stack (&gnu_loop_label_stack);
2096 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2097 handler for the current function. */
2099 /* This is implemented by issuing a call to the appropriate VMS specific
2100 builtin. To avoid having VMS specific sections in the global gigi decls
2101 array, we maintain the decls of interest here. We can't declare them
2102 inside the function because we must mark them never to be GC'd, which we
2103 can only do at the global level. */
2105 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2106 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2109 establish_gnat_vms_condition_handler (void)
2111 tree establish_stmt;
2113 /* Elaborate the required decls on the first call. Check on the decl for
2114 the gnat condition handler to decide, as this is one we create so we are
2115 sure that it will be non null on subsequent calls. The builtin decl is
2116 looked up so remains null on targets where it is not implemented yet. */
2117 if (gnat_vms_condition_handler_decl == NULL_TREE)
2119 vms_builtin_establish_handler_decl
2121 (get_identifier ("__builtin_establish_vms_condition_handler"));
2123 gnat_vms_condition_handler_decl
2124 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2126 build_function_type_list (integer_type_node,
2130 NULL_TREE, 0, 1, 1, 0, Empty);
2132 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2133 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2136 /* Do nothing if the establish builtin is not available, which might happen
2137 on targets where the facility is not implemented. */
2138 if (vms_builtin_establish_handler_decl == NULL_TREE)
2142 = build_call_1_expr (vms_builtin_establish_handler_decl,
2144 (ADDR_EXPR, NULL_TREE,
2145 gnat_vms_condition_handler_decl));
2147 add_stmt (establish_stmt);
2150 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2151 don't return anything. */
2154 Subprogram_Body_to_gnu (Node_Id gnat_node)
2156 /* Defining identifier of a parameter to the subprogram. */
2157 Entity_Id gnat_param;
2158 /* The defining identifier for the subprogram body. Note that if a
2159 specification has appeared before for this body, then the identifier
2160 occurring in that specification will also be a defining identifier and all
2161 the calls to this subprogram will point to that specification. */
2162 Entity_Id gnat_subprog_id
2163 = (Present (Corresponding_Spec (gnat_node))
2164 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2165 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2166 tree gnu_subprog_decl;
2167 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2168 tree gnu_subprog_type;
2171 VEC(parm_attr,gc) *cache;
2173 /* If this is a generic object or if it has been eliminated,
2175 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2176 || Ekind (gnat_subprog_id) == E_Generic_Function
2177 || Is_Eliminated (gnat_subprog_id))
2180 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2181 the already-elaborated tree node. However, if this subprogram had its
2182 elaboration deferred, we will already have made a tree node for it. So
2183 treat it as not being defined in that case. Such a subprogram cannot
2184 have an address clause or a freeze node, so this test is safe, though it
2185 does disable some otherwise-useful error checking. */
2187 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2188 Acts_As_Spec (gnat_node)
2189 && !present_gnu_tree (gnat_subprog_id));
2191 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2193 /* Propagate the debug mode. */
2194 if (!Needs_Debug_Info (gnat_subprog_id))
2195 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2197 /* Set the line number in the decl to correspond to that of the body so that
2198 the line number notes are written correctly. */
2199 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2201 /* Initialize the information structure for the function. */
2202 allocate_struct_function (gnu_subprog_decl, false);
2203 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2204 = GGC_CNEW (struct language_function);
2206 begin_subprog_body (gnu_subprog_decl);
2207 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2209 /* If there are Out parameters, we need to ensure that the return statement
2210 properly copies them out. We do this by making a new block and converting
2211 any inner return into a goto to a label at the end of the block. */
2212 push_stack (&gnu_return_label_stack, NULL_TREE,
2213 gnu_cico_list ? create_artificial_label (input_location)
2216 /* Get a tree corresponding to the code for the subprogram. */
2217 start_stmt_group ();
2220 /* See if there are any parameters for which we don't yet have GCC entities.
2221 These must be for Out parameters for which we will be making VAR_DECL
2222 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2223 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2224 the order of the parameters. */
2225 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2226 Present (gnat_param);
2227 gnat_param = Next_Formal_With_Extras (gnat_param))
2228 if (!present_gnu_tree (gnat_param))
2230 /* Skip any entries that have been already filled in; they must
2231 correspond to In Out parameters. */
2232 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2233 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2236 /* Do any needed references for padded types. */
2237 TREE_VALUE (gnu_cico_list)
2238 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2239 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2242 /* On VMS, establish our condition handler to possibly turn a condition into
2243 the corresponding exception if the subprogram has a foreign convention or
2246 To ensure proper execution of local finalizations on condition instances,
2247 we must turn a condition into the corresponding exception even if there
2248 is no applicable Ada handler, and need at least one condition handler per
2249 possible call chain involving GNAT code. OTOH, establishing the handler
2250 has a cost so we want to minimize the number of subprograms into which
2251 this happens. The foreign or exported condition is expected to satisfy
2252 all the constraints. */
2253 if (TARGET_ABI_OPEN_VMS
2254 && (Has_Foreign_Convention (gnat_subprog_id)
2255 || Is_Exported (gnat_subprog_id)))
2256 establish_gnat_vms_condition_handler ();
2258 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2260 /* Generate the code of the subprogram itself. A return statement will be
2261 present and any Out parameters will be handled there. */
2262 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2264 gnu_result = end_stmt_group ();
2266 /* If we populated the parameter attributes cache, we need to make sure
2267 that the cached expressions are evaluated on all possible paths. */
2268 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2271 struct parm_attr_d *pa;
2274 start_stmt_group ();
2276 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2279 add_stmt_with_node (pa->first, gnat_node);
2281 add_stmt_with_node (pa->last, gnat_node);
2283 add_stmt_with_node (pa->length, gnat_node);
2286 add_stmt (gnu_result);
2287 gnu_result = end_stmt_group ();
2290 /* If we made a special return label, we need to make a block that contains
2291 the definition of that label and the copying to the return value. That
2292 block first contains the function, then the label and copy statement. */
2293 if (TREE_VALUE (gnu_return_label_stack))
2297 start_stmt_group ();
2299 add_stmt (gnu_result);
2300 add_stmt (build1 (LABEL_EXPR, void_type_node,
2301 TREE_VALUE (gnu_return_label_stack)));
2303 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2304 if (list_length (gnu_cico_list) == 1)
2305 gnu_retval = TREE_VALUE (gnu_cico_list);
2307 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2310 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2311 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2314 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2315 End_Label (Handled_Statement_Sequence (gnat_node)));
2317 gnu_result = end_stmt_group ();
2320 pop_stack (&gnu_return_label_stack);
2322 /* Set the end location. */
2324 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2325 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2326 : Sloc (gnat_node)),
2327 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2329 end_subprog_body (gnu_result, false);
2331 /* Disconnect the trees for parameters that we made variables for from the
2332 GNAT entities since these are unusable after we end the function. */
2333 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2334 Present (gnat_param);
2335 gnat_param = Next_Formal_With_Extras (gnat_param))
2336 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2337 save_gnu_tree (gnat_param, NULL_TREE, false);
2339 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2340 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2342 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2345 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2346 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2347 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2348 If GNU_TARGET is non-null, this must be a function call and the result
2349 of the call is to be placed into that object. */
2352 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2355 /* The GCC node corresponding to the GNAT subprogram name. This can either
2356 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2357 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2359 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2360 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2361 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2362 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2364 Entity_Id gnat_formal;
2365 Node_Id gnat_actual;
2366 tree gnu_actual_list = NULL_TREE;
2367 tree gnu_name_list = NULL_TREE;
2368 tree gnu_before_list = NULL_TREE;
2369 tree gnu_after_list = NULL_TREE;
2370 tree gnu_subprog_call;
2372 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2374 /* If we are calling a stubbed function, make this into a raise of
2375 Program_Error. Elaborate all our args first. */
2376 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2377 && DECL_STUBBED_P (gnu_subprog_node))
2379 for (gnat_actual = First_Actual (gnat_node);
2380 Present (gnat_actual);
2381 gnat_actual = Next_Actual (gnat_actual))
2382 add_stmt (gnat_to_gnu (gnat_actual));
2386 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2387 N_Raise_Program_Error);
2389 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2391 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2392 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2399 /* If we are calling by supplying a pointer to a target, set up that
2400 pointer as the first argument. Use GNU_TARGET if one was passed;
2401 otherwise, make a target by building a variable of the maximum size
2403 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2405 tree gnu_real_ret_type
2406 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2411 = maybe_pad_type (gnu_real_ret_type,
2412 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2413 0, Etype (Name (gnat_node)), "PAD", false,
2416 /* ??? We may be about to create a static temporary if we happen to
2417 be at the global binding level. That's a regression from what
2418 the 3.x back-end would generate in the same situation, but we
2419 don't have a mechanism in Gigi for creating automatic variables
2420 in the elaboration routines. */
2422 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2423 NULL, false, false, false, false, NULL,
2428 = tree_cons (NULL_TREE,
2429 build_unary_op (ADDR_EXPR, NULL_TREE,
2430 unchecked_convert (gnu_real_ret_type,
2437 /* The only way we can be making a call via an access type is if Name is an
2438 explicit dereference. In that case, get the list of formal args from the
2439 type the access type is pointing to. Otherwise, get the formals from
2440 entity being called. */
2441 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2442 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2443 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2444 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2447 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2449 /* Create the list of the actual parameters as GCC expects it, namely a chain
2450 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2451 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2452 parameters not passed by reference and don't need to be copied in. */
2453 for (gnat_actual = First_Actual (gnat_node);
2454 Present (gnat_actual);
2455 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2456 gnat_actual = Next_Actual (gnat_actual))
2459 = (present_gnu_tree (gnat_formal)
2460 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2461 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2462 /* We must suppress conversions that can cause the creation of a
2463 temporary in the Out or In Out case because we need the real
2464 object in this case, either to pass its address if it's passed
2465 by reference or as target of the back copy done after the call
2466 if it uses the copy-in copy-out mechanism. We do it in the In
2467 case too, except for an unchecked conversion because it alone
2468 can cause the actual to be misaligned and the addressability
2469 test is applied to the real object. */
2470 bool suppress_type_conversion
2471 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2472 && Ekind (gnat_formal) != E_In_Parameter)
2473 || (Nkind (gnat_actual) == N_Type_Conversion
2474 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2475 Node_Id gnat_name = (suppress_type_conversion
2476 ? Expression (gnat_actual) : gnat_actual);
2477 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2480 /* If it's possible we may need to use this expression twice, make sure
2481 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2482 to force side-effects before the call.
2483 ??? This is more conservative than we need since we don't need to do
2484 this for pass-by-ref with no conversion. */
2485 if (Ekind (gnat_formal) != E_In_Parameter)
2486 gnu_name = gnat_stabilize_reference (gnu_name, true);
2488 /* If we are passing a non-addressable parameter by reference, pass the
2489 address of a copy. In the Out or In Out case, set up to copy back
2490 out after the call. */
2492 && (DECL_BY_REF_P (gnu_formal)
2493 || (TREE_CODE (gnu_formal) == PARM_DECL
2494 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2495 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2496 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2497 && !addressable_p (gnu_name, gnu_name_type))
2499 tree gnu_copy = gnu_name, gnu_temp;
2501 /* If the type is by_reference, a copy is not allowed. */
2502 if (Is_By_Reference_Type (Etype (gnat_formal)))
2504 ("misaligned actual cannot be passed by reference", gnat_actual);
2506 /* For users of Starlet we issue a warning because the
2507 interface apparently assumes that by-ref parameters
2508 outlive the procedure invocation. The code still
2509 will not work as intended, but we cannot do much
2510 better since other low-level parts of the back-end
2511 would allocate temporaries at will because of the
2512 misalignment if we did not do so here. */
2513 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2516 ("?possible violation of implicit assumption", gnat_actual);
2518 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2519 Entity (Name (gnat_node)));
2520 post_error_ne ("?because of misalignment of &", gnat_actual,
2524 /* If the actual type of the object is already the nominal type,
2525 we have nothing to do, except if the size is self-referential
2526 in which case we'll remove the unpadding below. */
2527 if (TREE_TYPE (gnu_name) == gnu_name_type
2528 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2531 /* Otherwise remove unpadding from the object and reset the copy. */
2532 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2533 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2535 && (TYPE_IS_PADDING_P
2536 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2537 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2539 /* Otherwise convert to the nominal type of the object if it's
2540 a record type. There are several cases in which we need to
2541 make the temporary using this type instead of the actual type
2542 of the object if they are distinct, because the expectations
2543 of the callee would otherwise not be met:
2544 - if it's a justified modular type,
2545 - if the actual type is a smaller packable version of it. */
2546 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2547 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2548 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2550 gnu_name = convert (gnu_name_type, gnu_name);
2552 /* Make a SAVE_EXPR to both properly account for potential side
2553 effects and handle the creation of a temporary copy. Special
2554 code in gnat_gimplify_expr ensures that the same temporary is
2555 used as the object and copied back after the call if needed. */
2556 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2557 TREE_SIDE_EFFECTS (gnu_name) = 1;
2559 /* Set up to move the copy back to the original. */
2560 if (Ekind (gnat_formal) != E_In_Parameter)
2562 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2564 set_expr_location_from_node (gnu_temp, gnat_node);
2565 append_to_statement_list (gnu_temp, &gnu_after_list);
2569 /* Start from the real object and build the actual. */
2570 gnu_actual = gnu_name;
2572 /* If this was a procedure call, we may not have removed any padding.
2573 So do it here for the part we will use as an input, if any. */
2574 if (Ekind (gnat_formal) != E_Out_Parameter
2575 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2576 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2577 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2580 /* Do any needed conversions for the actual and make sure that it is
2581 in range of the formal's type. */
2582 if (suppress_type_conversion)
2584 /* Put back the conversion we suppressed above in the computation
2585 of the real object. Note that we treat a conversion between
2586 aggregate types as if it is an unchecked conversion here. */
2588 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2590 (Nkind (gnat_actual)
2591 == N_Unchecked_Type_Conversion)
2592 && No_Truncation (gnat_actual));
2594 if (Ekind (gnat_formal) != E_Out_Parameter
2595 && Do_Range_Check (gnat_actual))
2596 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2601 if (Ekind (gnat_formal) != E_Out_Parameter
2602 && Do_Range_Check (gnat_actual))
2603 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2606 /* We may have suppressed a conversion to the Etype of the actual
2607 since the parent is a procedure call. So put it back here.
2608 ??? We use the reverse order compared to the case above because
2609 of an awkward interaction with the check and actually don't put
2610 back the conversion at all if a check is emitted. This is also
2611 done for the conversion to the formal's type just below. */
2612 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2613 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2617 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2618 gnu_actual = convert (gnu_formal_type, gnu_actual);
2620 /* Unless this is an In parameter, we must remove any justified modular
2621 building from GNU_NAME to get an lvalue. */
2622 if (Ekind (gnat_formal) != E_In_Parameter
2623 && TREE_CODE (gnu_name) == CONSTRUCTOR
2624 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2625 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2626 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2629 /* If we have not saved a GCC object for the formal, it means it is an
2630 Out parameter not passed by reference and that does not need to be
2631 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2634 && TREE_CODE (gnu_formal) == PARM_DECL
2635 && DECL_BY_REF_P (gnu_formal))
2637 if (Ekind (gnat_formal) != E_In_Parameter)
2639 /* In Out or Out parameters passed by reference don't use the
2640 copy-in copy-out mechanism so the address of the real object
2641 must be passed to the function. */
2642 gnu_actual = gnu_name;
2644 /* If we have a padded type, be sure we've removed padding. */
2645 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2646 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2647 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2648 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2651 /* If we have the constructed subtype of an aliased object
2652 with an unconstrained nominal subtype, the type of the
2653 actual includes the template, although it is formally
2654 constrained. So we need to convert it back to the real
2655 constructed subtype to retrieve the constrained part
2656 and takes its address. */
2657 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2658 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2659 && TREE_CODE (gnu_actual) != SAVE_EXPR
2660 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2661 && Is_Array_Type (Etype (gnat_actual)))
2662 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2666 /* The symmetry of the paths to the type of an entity is broken here
2667 since arguments don't know that they will be passed by ref. */
2668 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2669 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2672 && TREE_CODE (gnu_formal) == PARM_DECL
2673 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2675 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2676 gnu_actual = maybe_implicit_deref (gnu_actual);
2677 gnu_actual = maybe_unconstrained_array (gnu_actual);
2679 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2680 && TYPE_IS_PADDING_P (gnu_formal_type))
2682 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2683 gnu_actual = convert (gnu_formal_type, gnu_actual);
2686 /* Take the address of the object and convert to the proper pointer
2687 type. We'd like to actually compute the address of the beginning
2688 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2689 possibility that the ARRAY_REF might return a constant and we'd be
2690 getting the wrong address. Neither approach is exactly correct,
2691 but this is the most likely to work in all cases. */
2692 gnu_actual = convert (gnu_formal_type,
2693 build_unary_op (ADDR_EXPR, NULL_TREE,
2697 && TREE_CODE (gnu_formal) == PARM_DECL
2698 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2700 /* If arg is 'Null_Parameter, pass zero descriptor. */
2701 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2702 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2703 && TREE_PRIVATE (gnu_actual))
2704 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2707 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2708 fill_vms_descriptor (gnu_actual,
2714 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2716 if (Ekind (gnat_formal) != E_In_Parameter)
2717 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2719 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2722 /* If this is 'Null_Parameter, pass a zero even though we are
2723 dereferencing it. */
2724 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2725 && TREE_PRIVATE (gnu_actual)
2726 && host_integerp (gnu_actual_size, 1)
2727 && 0 >= compare_tree_int (gnu_actual_size,
2730 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2731 convert (gnat_type_for_size
2732 (tree_low_cst (gnu_actual_size, 1),
2737 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2740 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2743 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2745 nreverse (gnu_actual_list));
2746 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2748 /* If we return by passing a target, the result is the target after the
2749 call. We must not emit the call directly here because this might be
2750 evaluated as part of an expression with conditions to control whether
2751 the call should be emitted or not. */
2752 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2754 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2755 by the target object converted to the proper type. Doing so would
2756 potentially be very inefficient, however, as this expression might
2757 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2758 pointless temporary copy of the whole object.
2760 What we do instead is build a COMPOUND_EXPR returning the address of
2761 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2762 SAVE_EXPR later on then only incurs a pointer copy. */
2764 tree gnu_result_type
2765 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2768 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2770 tree gnu_target_address
2771 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2772 set_expr_location_from_node (gnu_target_address, gnat_node);
2775 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2776 gnu_subprog_call, gnu_target_address);
2779 = unchecked_convert (gnu_result_type,
2780 build_unary_op (INDIRECT_REF, NULL_TREE,
2784 *gnu_result_type_p = gnu_result_type;
2788 /* If it is a function call, the result is the call expression unless
2789 a target is specified, in which case we copy the result into the target
2790 and return the assignment statement. */
2791 else if (Nkind (gnat_node) == N_Function_Call)
2793 gnu_result = gnu_subprog_call;
2795 /* If the function returns an unconstrained array or by reference,
2796 we have to de-dereference the pointer. */
2797 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2798 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2799 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2802 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2803 gnu_target, gnu_result);
2805 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2810 /* If this is the case where the GNAT tree contains a procedure call
2811 but the Ada procedure has copy in copy out parameters, the special
2812 parameter passing mechanism must be used. */
2813 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2815 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2816 in copy out parameters. */
2817 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2818 int length = list_length (scalar_return_list);
2824 gnu_subprog_call = save_expr (gnu_subprog_call);
2825 gnu_name_list = nreverse (gnu_name_list);
2827 /* If any of the names had side-effects, ensure they are all
2828 evaluated before the call. */
2829 for (gnu_name = gnu_name_list; gnu_name;
2830 gnu_name = TREE_CHAIN (gnu_name))
2831 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2832 append_to_statement_list (TREE_VALUE (gnu_name),
2836 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2837 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2839 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2841 for (gnat_actual = First_Actual (gnat_node);
2842 Present (gnat_actual);
2843 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2844 gnat_actual = Next_Actual (gnat_actual))
2845 /* If we are dealing with a copy in copy out parameter, we must
2846 retrieve its value from the record returned in the call. */
2847 if (!(present_gnu_tree (gnat_formal)
2848 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2849 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2850 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2851 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2852 || (DECL_BY_DESCRIPTOR_P
2853 (get_gnu_tree (gnat_formal))))))))
2854 && Ekind (gnat_formal) != E_In_Parameter)
2856 /* Get the value to assign to this Out or In Out parameter. It is
2857 either the result of the function if there is only a single such
2858 parameter or the appropriate field from the record returned. */
2860 = length == 1 ? gnu_subprog_call
2861 : build_component_ref (gnu_subprog_call, NULL_TREE,
2862 TREE_PURPOSE (scalar_return_list),
2865 /* If the actual is a conversion, get the inner expression, which
2866 will be the real destination, and convert the result to the
2867 type of the actual parameter. */
2869 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2871 /* If the result is a padded type, remove the padding. */
2872 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2873 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2874 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2875 (TREE_TYPE (gnu_result))),
2878 /* If the actual is a type conversion, the real target object is
2879 denoted by the inner Expression and we need to convert the
2880 result to the associated type.
2881 We also need to convert our gnu assignment target to this type
2882 if the corresponding GNU_NAME was constructed from the GNAT
2883 conversion node and not from the inner Expression. */
2884 if (Nkind (gnat_actual) == N_Type_Conversion)
2887 = convert_with_check
2888 (Etype (Expression (gnat_actual)), gnu_result,
2889 Do_Overflow_Check (gnat_actual),
2890 Do_Range_Check (Expression (gnat_actual)),
2891 Float_Truncate (gnat_actual), gnat_actual);
2893 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2894 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2897 /* Unchecked conversions as actuals for Out parameters are not
2898 allowed in user code because they are not variables, but do
2899 occur in front-end expansions. The associated GNU_NAME is
2900 always obtained from the inner expression in such cases. */
2901 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2902 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2904 No_Truncation (gnat_actual));
2907 if (Do_Range_Check (gnat_actual))
2909 = emit_range_check (gnu_result, Etype (gnat_actual),
2912 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2913 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2914 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2917 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2918 gnu_actual, gnu_result);
2919 set_expr_location_from_node (gnu_result, gnat_node);
2920 append_to_statement_list (gnu_result, &gnu_before_list);
2921 scalar_return_list = TREE_CHAIN (scalar_return_list);
2922 gnu_name_list = TREE_CHAIN (gnu_name_list);
2926 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2928 append_to_statement_list (gnu_after_list, &gnu_before_list);
2929 return gnu_before_list;
2932 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2933 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2936 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2938 tree gnu_jmpsave_decl = NULL_TREE;
2939 tree gnu_jmpbuf_decl = NULL_TREE;
2940 /* If just annotating, ignore all EH and cleanups. */
2941 bool gcc_zcx = (!type_annotate_only
2942 && Present (Exception_Handlers (gnat_node))
2943 && Exception_Mechanism == Back_End_Exceptions);
2945 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2946 && Exception_Mechanism == Setjmp_Longjmp);
2947 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2948 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2949 tree gnu_inner_block; /* The statement(s) for the block itself. */
2954 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2955 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2956 add_cleanup, and when we leave the binding, end_stmt_group will create
2957 the TRY_FINALLY_EXPR.
2959 ??? The region level calls down there have been specifically put in place
2960 for a ZCX context and currently the order in which things are emitted
2961 (region/handlers) is different from the SJLJ case. Instead of putting
2962 other calls with different conditions at other places for the SJLJ case,
2963 it seems cleaner to reorder things for the SJLJ case and generalize the
2964 condition to make it not ZCX specific.
2966 If there are any exceptions or cleanup processing involved, we need an
2967 outer statement group (for Setjmp_Longjmp) and binding level. */
2968 if (binding_for_block)
2970 start_stmt_group ();
2974 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2975 area for address of previous buffer. Do this first since we need to have
2976 the setjmp buf known for any decls in this block. */
2979 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2980 NULL_TREE, jmpbuf_ptr_type,
2981 build_call_0_expr (get_jmpbuf_decl),
2982 false, false, false, false, NULL,
2984 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2986 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2987 because of the unstructured form of EH used by setjmp_longjmp, there
2988 might be forward edges going to __builtin_setjmp receivers on which
2989 it is uninitialized, although they will never be actually taken. */
2990 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2991 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2992 NULL_TREE, jmpbuf_type,
2993 NULL_TREE, false, false, false, false,
2995 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2997 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2999 /* When we exit this block, restore the saved value. */
3000 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
3001 End_Label (gnat_node));
3004 /* If we are to call a function when exiting this block, add a cleanup
3005 to the binding level we made above. Note that add_cleanup is FIFO
3006 so we must register this cleanup after the EH cleanup just above. */
3008 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
3009 End_Label (gnat_node));
3011 /* Now build the tree for the declarations and statements inside this block.
3012 If this is SJLJ, set our jmp_buf as the current buffer. */
3013 start_stmt_group ();
3016 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3017 build_unary_op (ADDR_EXPR, NULL_TREE,
3020 if (Present (First_Real_Statement (gnat_node)))
3021 process_decls (Statements (gnat_node), Empty,
3022 First_Real_Statement (gnat_node), true, true);
3024 /* Generate code for each statement in the block. */
3025 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3026 ? First_Real_Statement (gnat_node)
3027 : First (Statements (gnat_node)));
3028 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3029 add_stmt (gnat_to_gnu (gnat_temp));
3030 gnu_inner_block = end_stmt_group ();
3032 /* Now generate code for the two exception models, if either is relevant for
3036 tree *gnu_else_ptr = 0;
3039 /* Make a binding level for the exception handling declarations and code
3040 and set up gnu_except_ptr_stack for the handlers to use. */
3041 start_stmt_group ();
3044 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3045 create_var_decl (get_identifier ("EXCEPT_PTR"),
3047 build_pointer_type (except_type_node),
3048 build_call_0_expr (get_excptr_decl), false,
3049 false, false, false, NULL, gnat_node));
3051 /* Generate code for each handler. The N_Exception_Handler case does the
3052 real work and returns a COND_EXPR for each handler, which we chain
3054 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3055 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3057 gnu_expr = gnat_to_gnu (gnat_temp);
3059 /* If this is the first one, set it as the outer one. Otherwise,
3060 point the "else" part of the previous handler to us. Then point
3061 to our "else" part. */
3063 add_stmt (gnu_expr);
3065 *gnu_else_ptr = gnu_expr;
3067 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3070 /* If none of the exception handlers did anything, re-raise but do not
3072 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3073 TREE_VALUE (gnu_except_ptr_stack));
3074 set_expr_location_from_node
3076 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
3079 *gnu_else_ptr = gnu_expr;
3081 add_stmt (gnu_expr);
3083 /* End the binding level dedicated to the exception handlers and get the
3084 whole statement group. */
3085 pop_stack (&gnu_except_ptr_stack);
3087 gnu_handler = end_stmt_group ();
3089 /* If the setjmp returns 1, we restore our incoming longjmp value and
3090 then check the handlers. */
3091 start_stmt_group ();
3092 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3095 add_stmt (gnu_handler);
3096 gnu_handler = end_stmt_group ();
3098 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3099 gnu_result = build3 (COND_EXPR, void_type_node,
3102 build_unary_op (ADDR_EXPR, NULL_TREE,
3104 gnu_handler, gnu_inner_block);
3110 /* First make a block containing the handlers. */
3111 start_stmt_group ();
3112 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3113 Present (gnat_temp);
3114 gnat_temp = Next_Non_Pragma (gnat_temp))
3115 add_stmt (gnat_to_gnu (gnat_temp));
3116 gnu_handlers = end_stmt_group ();
3118 /* Now make the TRY_CATCH_EXPR for the block. */
3119 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3120 gnu_inner_block, gnu_handlers);
3123 gnu_result = gnu_inner_block;
3125 /* Now close our outer block, if we had to make one. */
3126 if (binding_for_block)
3128 add_stmt (gnu_result);
3130 gnu_result = end_stmt_group ();
3136 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3137 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3138 exception handling. */
3141 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3143 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3144 an "if" statement to select the proper exceptions. For "Others", exclude
3145 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3146 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3147 tree gnu_choice = integer_zero_node;
3148 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3151 for (gnat_temp = First (Exception_Choices (gnat_node));
3152 gnat_temp; gnat_temp = Next (gnat_temp))
3156 if (Nkind (gnat_temp) == N_Others_Choice)
3158 if (All_Others (gnat_temp))
3159 this_choice = integer_one_node;
3163 (EQ_EXPR, integer_type_node,
3168 (INDIRECT_REF, NULL_TREE,
3169 TREE_VALUE (gnu_except_ptr_stack)),
3170 get_identifier ("not_handled_by_others"), NULL_TREE,
3175 else if (Nkind (gnat_temp) == N_Identifier
3176 || Nkind (gnat_temp) == N_Expanded_Name)
3178 Entity_Id gnat_ex_id = Entity (gnat_temp);
3181 /* Exception may be a renaming. Recover original exception which is
3182 the one elaborated and registered. */
3183 if (Present (Renamed_Object (gnat_ex_id)))
3184 gnat_ex_id = Renamed_Object (gnat_ex_id);
3186 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3190 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3191 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3192 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3194 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3195 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3197 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3200 = build_component_ref
3201 (build_unary_op (INDIRECT_REF, NULL_TREE,
3202 TREE_VALUE (gnu_except_ptr_stack)),
3203 get_identifier ("lang"), NULL_TREE, false);
3207 (TRUTH_ORIF_EXPR, integer_type_node,
3208 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3209 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3216 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3217 gnu_choice, this_choice);
3220 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3223 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3224 to a GCC tree, which is returned. This is the variant for ZCX. */
3227 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3229 tree gnu_etypes_list = NULL_TREE;
3232 tree gnu_current_exc_ptr;
3233 tree gnu_incoming_exc_ptr;
3236 /* We build a TREE_LIST of nodes representing what exception types this
3237 handler can catch, with special cases for others and all others cases.
3239 Each exception type is actually identified by a pointer to the exception
3240 id, or to a dummy object for "others" and "all others".
3242 Care should be taken to ensure that the control flow impact of "others"
3243 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3245 for (gnat_temp = First (Exception_Choices (gnat_node));
3246 gnat_temp; gnat_temp = Next (gnat_temp))
3248 if (Nkind (gnat_temp) == N_Others_Choice)
3251 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3254 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3256 else if (Nkind (gnat_temp) == N_Identifier
3257 || Nkind (gnat_temp) == N_Expanded_Name)
3259 Entity_Id gnat_ex_id = Entity (gnat_temp);
3261 /* Exception may be a renaming. Recover original exception which is
3262 the one elaborated and registered. */
3263 if (Present (Renamed_Object (gnat_ex_id)))
3264 gnat_ex_id = Renamed_Object (gnat_ex_id);
3266 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3267 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3269 /* The Non_Ada_Error case for VMS exceptions is handled
3270 by the personality routine. */
3275 /* The GCC interface expects NULL to be passed for catch all handlers, so
3276 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3277 is integer_zero_node. It would not work, however, because GCC's
3278 notion of "catch all" is stronger than our notion of "others". Until
3279 we correctly use the cleanup interface as well, doing that would
3280 prevent the "all others" handlers from being seen, because nothing
3281 can be caught beyond a catch all from GCC's point of view. */
3282 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3285 start_stmt_group ();
3288 /* Expand a call to the begin_handler hook at the beginning of the handler,
3289 and arrange for a call to the end_handler hook to occur on every possible
3292 The hooks expect a pointer to the low level occurrence. This is required
3293 for our stack management scheme because a raise inside the handler pushes
3294 a new occurrence on top of the stack, which means that this top does not
3295 necessarily match the occurrence this handler was dealing with.
3297 The EXC_PTR_EXPR object references the exception occurrence being
3298 propagated. Upon handler entry, this is the exception for which the
3299 handler is triggered. This might not be the case upon handler exit,
3300 however, as we might have a new occurrence propagated by the handler's
3301 body, and the end_handler hook called as a cleanup in this context.
3303 We use a local variable to retrieve the incoming value at handler entry
3304 time, and reuse it to feed the end_handler hook's argument at exit. */
3305 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3306 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3307 ptr_type_node, gnu_current_exc_ptr,
3308 false, false, false, false, NULL,
3311 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3312 gnu_incoming_exc_ptr),
3314 /* ??? We don't seem to have an End_Label at hand to set the location. */
3315 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3317 add_stmt_list (Statements (gnat_node));
3320 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3324 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3327 Compilation_Unit_to_gnu (Node_Id gnat_node)
3329 /* Make the decl for the elaboration procedure. */
3330 bool body_p = (Defining_Entity (Unit (gnat_node)),
3331 Nkind (Unit (gnat_node)) == N_Package_Body
3332 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3333 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3334 tree gnu_elab_proc_decl
3335 = create_subprog_decl
3336 (create_concat_name (gnat_unit_entity,
3337 body_p ? "elabb" : "elabs"),
3338 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3340 struct elab_info *info;
3342 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3344 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3345 allocate_struct_function (gnu_elab_proc_decl, false);
3346 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3349 /* For a body, first process the spec if there is one. */
3350 if (Nkind (Unit (gnat_node)) == N_Package_Body
3351 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3352 && !Acts_As_Spec (gnat_node)))
3354 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3355 finalize_from_with_types ();
3358 process_inlined_subprograms (gnat_node);
3360 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3362 elaborate_all_entities (gnat_node);
3364 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3365 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3366 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3370 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3372 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3374 /* Process any pragmas and actions following the unit. */
3375 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3376 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3377 finalize_from_with_types ();
3379 /* Save away what we've made so far and record this potential elaboration
3381 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3382 set_current_block_context (gnu_elab_proc_decl);
3384 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3385 info->next = elab_info_list;
3386 info->elab_proc = gnu_elab_proc_decl;
3387 info->gnat_node = gnat_node;
3388 elab_info_list = info;
3390 /* Generate elaboration code for this unit, if necessary, and say whether
3392 pop_stack (&gnu_elab_proc_stack);
3394 /* Invalidate the global renaming pointers. This is necessary because
3395 stabilization of the renamed entities may create SAVE_EXPRs which
3396 have been tied to a specific elaboration routine just above. */
3397 invalidate_global_renaming_pointers ();
3400 /* Return whether GNAT_NODE, an unchecked type conversion, is on the LHS
3401 of an assignment and a no-op as far as gigi is concerned. */
3404 unchecked_conversion_lhs_nop (Node_Id gnat_node)
3406 Entity_Id from_type, to_type;
3408 /* The conversion must be on the LHS of an assignment. Otherwise, even
3409 if the conversion was essentially a no-op, it could de facto ensure
3410 type consistency and this should be preserved. */
3411 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3412 && Name (Parent (gnat_node)) == gnat_node))
3415 from_type = Etype (Expression (gnat_node));
3417 /* We're interested in artificial conversions generated by the front-end
3418 to make private types explicit, e.g. in Expand_Assign_Array. */
3419 if (!Is_Private_Type (from_type))
3422 from_type = Underlying_Type (from_type);
3423 to_type = Etype (gnat_node);
3425 /* The direct conversion to the underlying type is a no-op. */
3426 if (to_type == from_type)
3429 /* For an array type, the conversion to the PAT is a no-op. */
3430 if (Ekind (from_type) == E_Array_Subtype
3431 && to_type == Packed_Array_Type (from_type))
3437 /* This function is the driver of the GNAT to GCC tree transformation
3438 process. It is the entry point of the tree transformer. GNAT_NODE is the
3439 root of some GNAT tree. Return the root of the corresponding GCC tree.
3440 If this is an expression, return the GCC equivalent of the expression. If
3441 it is a statement, return the statement. In the case when called for a
3442 statement, it may also add statements to the current statement group, in
3443 which case anything it returns is to be interpreted as occurring after
3444 anything `it already added. */
3447 gnat_to_gnu (Node_Id gnat_node)
3449 bool went_into_elab_proc = false;
3450 tree gnu_result = error_mark_node; /* Default to no value. */
3451 tree gnu_result_type = void_type_node;
3453 tree gnu_lhs, gnu_rhs;
3456 /* Save node number for error message and set location information. */
3457 error_gnat_node = gnat_node;
3458 Sloc_to_locus (Sloc (gnat_node), &input_location);
3460 if (type_annotate_only
3461 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3462 return alloc_stmt_list ();
3464 /* If this node is a non-static subexpression and we are only
3465 annotating types, make this into a NULL_EXPR. */
3466 if (type_annotate_only
3467 && IN (Nkind (gnat_node), N_Subexpr)
3468 && Nkind (gnat_node) != N_Identifier
3469 && !Compile_Time_Known_Value (gnat_node))
3470 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3471 build_call_raise (CE_Range_Check_Failed, gnat_node,
3472 N_Raise_Constraint_Error));
3474 /* If this is a Statement and we are at top level, it must be part of the
3475 elaboration procedure, so mark us as being in that procedure and push our
3478 If we are in the elaboration procedure, check if we are violating a
3479 No_Elaboration_Code restriction by having a statement there. */
3480 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3481 && Nkind (gnat_node) != N_Null_Statement)
3482 || Nkind (gnat_node) == N_Procedure_Call_Statement
3483 || Nkind (gnat_node) == N_Label
3484 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3485 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3486 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3487 || Nkind (gnat_node) == N_Raise_Storage_Error
3488 || Nkind (gnat_node) == N_Raise_Program_Error)
3489 && (Ekind (Etype (gnat_node)) == E_Void)))
3491 if (!current_function_decl)
3493 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3494 start_stmt_group ();
3496 went_into_elab_proc = true;
3499 /* Don't check for a possible No_Elaboration_Code restriction violation
3500 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3501 every nested real statement instead. This also avoids triggering
3502 spurious errors on dummy (empty) sequences created by the front-end
3503 for package bodies in some cases. */
3505 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3506 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3507 Check_Elaboration_Code_Allowed (gnat_node);
3510 switch (Nkind (gnat_node))
3512 /********************************/
3513 /* Chapter 2: Lexical Elements */
3514 /********************************/
3517 case N_Expanded_Name:
3518 case N_Operator_Symbol:
3519 case N_Defining_Identifier:
3520 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3523 case N_Integer_Literal:
3527 /* Get the type of the result, looking inside any padding and
3528 justified modular types. Then get the value in that type. */
3529 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3531 if (TREE_CODE (gnu_type) == RECORD_TYPE
3532 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3533 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3535 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3537 /* If the result overflows (meaning it doesn't fit in its base type),
3538 abort. We would like to check that the value is within the range
3539 of the subtype, but that causes problems with subtypes whose usage
3540 will raise Constraint_Error and with biased representation, so
3542 gcc_assert (!TREE_OVERFLOW (gnu_result));
3546 case N_Character_Literal:
3547 /* If a Entity is present, it means that this was one of the
3548 literals in a user-defined character type. In that case,
3549 just return the value in the CONST_DECL. Otherwise, use the
3550 character code. In that case, the base type should be an
3551 INTEGER_TYPE, but we won't bother checking for that. */
3552 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3553 if (Present (Entity (gnat_node)))
3554 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3557 = build_int_cst_type
3558 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3561 case N_Real_Literal:
3562 /* If this is of a fixed-point type, the value we want is the
3563 value of the corresponding integer. */
3564 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3566 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3567 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3569 gcc_assert (!TREE_OVERFLOW (gnu_result));
3572 /* We should never see a Vax_Float type literal, since the front end
3573 is supposed to transform these using appropriate conversions. */
3574 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3579 Ureal ur_realval = Realval (gnat_node);
3581 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3583 /* If the real value is zero, so is the result. Otherwise,
3584 convert it to a machine number if it isn't already. That
3585 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3586 if (UR_Is_Zero (ur_realval))
3587 gnu_result = convert (gnu_result_type, integer_zero_node);
3590 if (!Is_Machine_Number (gnat_node))
3592 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3593 ur_realval, Round_Even, gnat_node);
3596 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3598 /* If we have a base of zero, divide by the denominator.
3599 Otherwise, the base must be 2 and we scale the value, which
3600 we know can fit in the mantissa of the type (hence the use
3601 of that type above). */
3602 if (No (Rbase (ur_realval)))
3604 = build_binary_op (RDIV_EXPR,
3605 get_base_type (gnu_result_type),
3607 UI_To_gnu (Denominator (ur_realval),
3611 REAL_VALUE_TYPE tmp;
3613 gcc_assert (Rbase (ur_realval) == 2);
3614 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3615 - UI_To_Int (Denominator (ur_realval)));
3616 gnu_result = build_real (gnu_result_type, tmp);
3620 /* Now see if we need to negate the result. Do it this way to
3621 properly handle -0. */
3622 if (UR_Is_Negative (Realval (gnat_node)))
3624 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3630 case N_String_Literal:
3631 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3632 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3634 String_Id gnat_string = Strval (gnat_node);
3635 int length = String_Length (gnat_string);
3638 if (length >= ALLOCA_THRESHOLD)
3639 string = XNEWVEC (char, length + 1);
3641 string = (char *) alloca (length + 1);
3643 /* Build the string with the characters in the literal. Note
3644 that Ada strings are 1-origin. */
3645 for (i = 0; i < length; i++)
3646 string[i] = Get_String_Char (gnat_string, i + 1);
3648 /* Put a null at the end of the string in case it's in a context
3649 where GCC will want to treat it as a C string. */
3652 gnu_result = build_string (length, string);
3654 /* Strings in GCC don't normally have types, but we want
3655 this to not be converted to the array type. */
3656 TREE_TYPE (gnu_result) = gnu_result_type;
3658 if (length >= ALLOCA_THRESHOLD)
3663 /* Build a list consisting of each character, then make
3665 String_Id gnat_string = Strval (gnat_node);
3666 int length = String_Length (gnat_string);
3668 tree gnu_list = NULL_TREE;
3669 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3671 for (i = 0; i < length; i++)
3674 = tree_cons (gnu_idx,
3675 build_int_cst (TREE_TYPE (gnu_result_type),
3676 Get_String_Char (gnat_string,
3680 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3685 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3690 gnu_result = Pragma_to_gnu (gnat_node);
3693 /**************************************/
3694 /* Chapter 3: Declarations and Types */
3695 /**************************************/
3697 case N_Subtype_Declaration:
3698 case N_Full_Type_Declaration:
3699 case N_Incomplete_Type_Declaration:
3700 case N_Private_Type_Declaration:
3701 case N_Private_Extension_Declaration:
3702 case N_Task_Type_Declaration:
3703 process_type (Defining_Entity (gnat_node));
3704 gnu_result = alloc_stmt_list ();
3707 case N_Object_Declaration:
3708 case N_Exception_Declaration:
3709 gnat_temp = Defining_Entity (gnat_node);
3710 gnu_result = alloc_stmt_list ();
3712 /* If we are just annotating types and this object has an unconstrained
3713 or task type, don't elaborate it. */
3714 if (type_annotate_only
3715 && (((Is_Array_Type (Etype (gnat_temp))
3716 || Is_Record_Type (Etype (gnat_temp)))
3717 && !Is_Constrained (Etype (gnat_temp)))
3718 || Is_Concurrent_Type (Etype (gnat_temp))))
3721 if (Present (Expression (gnat_node))
3722 && !(Nkind (gnat_node) == N_Object_Declaration
3723 && No_Initialization (gnat_node))
3724 && (!type_annotate_only
3725 || Compile_Time_Known_Value (Expression (gnat_node))))
3727 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3728 if (Do_Range_Check (Expression (gnat_node)))
3730 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3732 /* If this object has its elaboration delayed, we must force
3733 evaluation of GNU_EXPR right now and save it for when the object
3735 if (Present (Freeze_Node (gnat_temp)))
3737 if ((Is_Public (gnat_temp) || global_bindings_p ())
3738 && !TREE_CONSTANT (gnu_expr))
3740 = create_var_decl (create_concat_name (gnat_temp, "init"),
3741 NULL_TREE, TREE_TYPE (gnu_expr),
3742 gnu_expr, false, Is_Public (gnat_temp),
3743 false, false, NULL, gnat_temp);
3745 gnu_expr = maybe_variable (gnu_expr);
3747 save_gnu_tree (gnat_node, gnu_expr, true);
3751 gnu_expr = NULL_TREE;
3753 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3754 gnu_expr = NULL_TREE;
3756 /* If this is a deferred constant with an address clause, we ignore the
3757 full view since the clause is on the partial view and we cannot have
3758 2 different GCC trees for the object. The only bits of the full view
3759 we will use is the initializer, but it will be directly fetched. */
3760 if (Ekind(gnat_temp) == E_Constant
3761 && Present (Address_Clause (gnat_temp))
3762 && Present (Full_View (gnat_temp)))
3763 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3765 if (No (Freeze_Node (gnat_temp)))
3766 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3769 case N_Object_Renaming_Declaration:
3770 gnat_temp = Defining_Entity (gnat_node);
3772 /* Don't do anything if this renaming is handled by the front end or if
3773 we are just annotating types and this object has a composite or task
3774 type, don't elaborate it. We return the result in case it has any
3775 SAVE_EXPRs in it that need to be evaluated here. */
3776 if (!Is_Renaming_Of_Object (gnat_temp)
3777 && ! (type_annotate_only
3778 && (Is_Array_Type (Etype (gnat_temp))
3779 || Is_Record_Type (Etype (gnat_temp))
3780 || Is_Concurrent_Type (Etype (gnat_temp)))))
3782 = gnat_to_gnu_entity (gnat_temp,
3783 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3785 gnu_result = alloc_stmt_list ();
3788 case N_Implicit_Label_Declaration:
3789 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3790 gnu_result = alloc_stmt_list ();
3793 case N_Exception_Renaming_Declaration:
3794 case N_Number_Declaration:
3795 case N_Package_Renaming_Declaration:
3796 case N_Subprogram_Renaming_Declaration:
3797 /* These are fully handled in the front end. */
3798 gnu_result = alloc_stmt_list ();
3801 /*************************************/
3802 /* Chapter 4: Names and Expressions */
3803 /*************************************/
3805 case N_Explicit_Dereference:
3806 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3807 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3808 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3811 case N_Indexed_Component:
3813 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3817 Node_Id *gnat_expr_array;
3819 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3820 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3822 /* If we got a padded type, remove it too. */
3823 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3824 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3826 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3829 gnu_result = gnu_array_object;
3831 /* First compute the number of dimensions of the array, then
3832 fill the expression array, the order depending on whether
3833 this is a Convention_Fortran array or not. */
3834 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3835 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3836 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3837 ndim++, gnu_type = TREE_TYPE (gnu_type))
3840 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3842 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3843 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3845 i--, gnat_temp = Next (gnat_temp))
3846 gnat_expr_array[i] = gnat_temp;
3848 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3850 i++, gnat_temp = Next (gnat_temp))
3851 gnat_expr_array[i] = gnat_temp;
3853 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3854 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3856 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3857 gnat_temp = gnat_expr_array[i];
3858 gnu_expr = gnat_to_gnu (gnat_temp);
3860 if (Do_Range_Check (gnat_temp))
3863 (gnu_array_object, gnu_expr,
3864 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3865 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3868 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3869 gnu_result, gnu_expr);
3873 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3879 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3881 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3882 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3884 /* Do any implicit dereferences of the prefix and do any needed
3886 gnu_result = maybe_implicit_deref (gnu_result);
3887 gnu_result = maybe_unconstrained_array (gnu_result);
3888 gnu_type = TREE_TYPE (gnu_result);
3889 if (Do_Range_Check (gnat_range_node))
3891 /* Get the bounds of the slice. */
3893 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3894 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3895 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3896 /* Get the permitted bounds. */
3897 tree gnu_base_index_type
3898 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3899 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3900 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3901 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3902 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3903 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3905 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3906 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3908 /* Derive a good type to convert everything to. */
3909 gnu_expr_type = get_base_type (gnu_index_type);
3911 /* Test whether the minimum slice value is too small. */
3912 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3913 convert (gnu_expr_type,
3915 convert (gnu_expr_type,
3916 gnu_base_min_expr));
3918 /* Test whether the maximum slice value is too large. */
3919 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3920 convert (gnu_expr_type,
3922 convert (gnu_expr_type,
3923 gnu_base_max_expr));
3925 /* Build a slice index check that returns the low bound,
3926 assuming the slice is not empty. */
3927 gnu_expr = emit_check
3928 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3929 gnu_expr_l, gnu_expr_h),
3930 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3932 /* Build a conditional expression that does the index checks and
3933 returns the low bound if the slice is not empty (max >= min),
3934 and returns the naked low bound otherwise (max < min), unless
3935 it is non-constant and the high bound is; this prevents VRP
3936 from inferring bogus ranges on the unlikely path. */
3937 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3938 build_binary_op (GE_EXPR, gnu_expr_type,
3939 convert (gnu_expr_type,
3941 convert (gnu_expr_type,
3944 TREE_CODE (gnu_min_expr) != INTEGER_CST
3945 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3946 ? gnu_max_expr : gnu_min_expr);
3949 /* Simply return the naked low bound. */
3950 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3952 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3953 gnu_result, gnu_expr);
3957 case N_Selected_Component:
3959 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3960 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3961 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3964 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3965 || IN (Ekind (gnat_pref_type), Access_Kind))
3967 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3968 gnat_pref_type = Underlying_Type (gnat_pref_type);
3969 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3970 gnat_pref_type = Designated_Type (gnat_pref_type);
3973 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3975 /* For discriminant references in tagged types always substitute the
3976 corresponding discriminant as the actual selected component. */
3977 if (Is_Tagged_Type (gnat_pref_type))
3978 while (Present (Corresponding_Discriminant (gnat_field)))
3979 gnat_field = Corresponding_Discriminant (gnat_field);
3981 /* For discriminant references of untagged types always substitute the
3982 corresponding stored discriminant. */
3983 else if (Present (Corresponding_Discriminant (gnat_field)))
3984 gnat_field = Original_Record_Component (gnat_field);
3986 /* Handle extracting the real or imaginary part of a complex.
3987 The real part is the first field and the imaginary the last. */
3988 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3989 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3990 ? REALPART_EXPR : IMAGPART_EXPR,
3991 NULL_TREE, gnu_prefix);
3994 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3996 /* If there are discriminants, the prefix might be evaluated more
3997 than once, which is a problem if it has side-effects. */
3998 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3999 ? Designated_Type (Etype
4000 (Prefix (gnat_node)))
4001 : Etype (Prefix (gnat_node))))
4002 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
4005 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
4006 (Nkind (Parent (gnat_node))
4007 == N_Attribute_Reference));
4010 gcc_assert (gnu_result);
4011 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4015 case N_Attribute_Reference:
4017 /* The attribute designator (like an enumeration value). */
4018 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
4020 /* The Elab_Spec and Elab_Body attributes are special in that
4021 Prefix is a unit, not an object with a GCC equivalent. Similarly
4022 for Elaborated, since that variable isn't otherwise known. */
4023 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
4024 return (create_subprog_decl
4025 (create_concat_name (Entity (Prefix (gnat_node)),
4026 attribute == Attr_Elab_Body
4027 ? "elabb" : "elabs"),
4028 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
4031 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4036 /* Like 'Access as far as we are concerned. */
4037 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4038 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4039 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4043 case N_Extension_Aggregate:
4047 /* ??? It is wrong to evaluate the type now, but there doesn't
4048 seem to be any other practical way of doing it. */
4050 gcc_assert (!Expansion_Delayed (gnat_node));
4052 gnu_aggr_type = gnu_result_type
4053 = get_unpadded_type (Etype (gnat_node));
4055 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4056 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4058 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4060 if (Null_Record_Present (gnat_node))
4061 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4063 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4064 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4066 = assoc_to_constructor (Etype (gnat_node),
4067 First (Component_Associations (gnat_node)),
4069 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4070 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4072 Component_Type (Etype (gnat_node)));
4073 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4076 (COMPLEX_EXPR, gnu_aggr_type,
4077 gnat_to_gnu (Expression (First
4078 (Component_Associations (gnat_node)))),
4079 gnat_to_gnu (Expression
4081 (First (Component_Associations (gnat_node))))));
4085 gnu_result = convert (gnu_result_type, gnu_result);
4090 if (TARGET_VTABLE_USES_DESCRIPTORS
4091 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4092 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4093 gnu_result = null_fdesc_node;
4095 gnu_result = null_pointer_node;
4096 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4099 case N_Type_Conversion:
4100 case N_Qualified_Expression:
4101 /* Get the operand expression. */
4102 gnu_result = gnat_to_gnu (Expression (gnat_node));
4103 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4106 = convert_with_check (Etype (gnat_node), gnu_result,
4107 Do_Overflow_Check (gnat_node),
4108 Do_Range_Check (Expression (gnat_node)),
4109 Nkind (gnat_node) == N_Type_Conversion
4110 && Float_Truncate (gnat_node), gnat_node);
4113 case N_Unchecked_Type_Conversion:
4114 gnu_result = gnat_to_gnu (Expression (gnat_node));
4116 /* Skip further processing if the conversion is deemed a no-op. */
4117 if (unchecked_conversion_lhs_nop (gnat_node))
4119 gnu_result_type = TREE_TYPE (gnu_result);
4123 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4125 /* If the result is a pointer type, see if we are improperly
4126 converting to a stricter alignment. */
4127 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4128 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4130 unsigned int align = known_alignment (gnu_result);
4131 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4132 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4134 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4135 post_error_ne_tree_2
4136 ("?source alignment (^) '< alignment of & (^)",
4137 gnat_node, Designated_Type (Etype (gnat_node)),
4138 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4141 /* If we are converting a descriptor to a function pointer, first
4142 build the pointer. */
4143 if (TARGET_VTABLE_USES_DESCRIPTORS
4144 && TREE_TYPE (gnu_result) == fdesc_type_node
4145 && POINTER_TYPE_P (gnu_result_type))
4146 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4148 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4149 No_Truncation (gnat_node));
4155 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4156 Node_Id gnat_range = Right_Opnd (gnat_node);
4160 /* GNAT_RANGE is either an N_Range node or an identifier
4161 denoting a subtype. */
4162 if (Nkind (gnat_range) == N_Range)
4164 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4165 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4167 else if (Nkind (gnat_range) == N_Identifier
4168 || Nkind (gnat_range) == N_Expanded_Name)
4170 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4172 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4173 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4178 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4180 /* If LOW and HIGH are identical, perform an equality test.
4181 Otherwise, ensure that GNU_OBJECT is only evaluated once
4182 and perform a full range test. */
4183 if (operand_equal_p (gnu_low, gnu_high, 0))
4184 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4185 gnu_object, gnu_low);
4188 gnu_object = protect_multiple_eval (gnu_object);
4190 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4191 build_binary_op (GE_EXPR, gnu_result_type,
4192 gnu_object, gnu_low),
4193 build_binary_op (LE_EXPR, gnu_result_type,
4194 gnu_object, gnu_high));
4197 if (Nkind (gnat_node) == N_Not_In)
4198 gnu_result = invert_truthvalue (gnu_result);
4203 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4204 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4205 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4206 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4208 : (Rounded_Result (gnat_node)
4209 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4210 gnu_result_type, gnu_lhs, gnu_rhs);
4213 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4214 /* These can either be operations on booleans or on modular types.
4215 Fall through for boolean types since that's the way GNU_CODES is
4217 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4218 Modular_Integer_Kind))
4221 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4222 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4225 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4226 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4227 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4228 gnu_result = build_binary_op (code, gnu_result_type,
4233 /* ... fall through ... */
4235 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4236 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4237 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4238 case N_Op_Mod: case N_Op_Rem:
4239 case N_Op_Rotate_Left:
4240 case N_Op_Rotate_Right:
4241 case N_Op_Shift_Left:
4242 case N_Op_Shift_Right:
4243 case N_Op_Shift_Right_Arithmetic:
4244 case N_And_Then: case N_Or_Else:
4246 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4247 bool ignore_lhs_overflow = false;
4250 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4251 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4252 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4254 /* If this is a comparison operator, convert any references to
4255 an unconstrained array value into a reference to the
4257 if (TREE_CODE_CLASS (code) == tcc_comparison)
4259 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4260 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4263 /* If the result type is a private type, its full view may be a
4264 numeric subtype. The representation we need is that of its base
4265 type, given that it is the result of an arithmetic operation. */
4266 else if (Is_Private_Type (Etype (gnat_node)))
4267 gnu_type = gnu_result_type
4268 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4270 /* If this is a shift whose count is not guaranteed to be correct,
4271 we need to adjust the shift count. */
4272 if (IN (Nkind (gnat_node), N_Op_Shift)
4273 && !Shift_Count_OK (gnat_node))
4275 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4277 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4279 if (Nkind (gnat_node) == N_Op_Rotate_Left
4280 || Nkind (gnat_node) == N_Op_Rotate_Right)
4281 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4282 gnu_rhs, gnu_max_shift);
4283 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4286 (MIN_EXPR, gnu_count_type,
4287 build_binary_op (MINUS_EXPR,
4290 convert (gnu_count_type,
4295 /* For right shifts, the type says what kind of shift to do,
4296 so we may need to choose a different type. In this case,
4297 we have to ignore integer overflow lest it propagates all
4298 the way down and causes a CE to be explicitly raised. */
4299 if (Nkind (gnat_node) == N_Op_Shift_Right
4300 && !TYPE_UNSIGNED (gnu_type))
4302 gnu_type = gnat_unsigned_type (gnu_type);
4303 ignore_lhs_overflow = true;
4305 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4306 && TYPE_UNSIGNED (gnu_type))
4308 gnu_type = gnat_signed_type (gnu_type);
4309 ignore_lhs_overflow = true;
4312 if (gnu_type != gnu_result_type)
4314 tree gnu_old_lhs = gnu_lhs;
4315 gnu_lhs = convert (gnu_type, gnu_lhs);
4316 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4317 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4318 gnu_rhs = convert (gnu_type, gnu_rhs);
4321 /* Instead of expanding overflow checks for addition, subtraction
4322 and multiplication itself, the front end will leave this to
4323 the back end when Backend_Overflow_Checks_On_Target is set.
4324 As the GCC back end itself does not know yet how to properly
4325 do overflow checking, do it here. The goal is to push
4326 the expansions further into the back end over time. */
4327 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4328 && (Nkind (gnat_node) == N_Op_Add
4329 || Nkind (gnat_node) == N_Op_Subtract
4330 || Nkind (gnat_node) == N_Op_Multiply)
4331 && !TYPE_UNSIGNED (gnu_type)
4332 && !FLOAT_TYPE_P (gnu_type))
4333 gnu_result = build_binary_op_trapv (code, gnu_type,
4334 gnu_lhs, gnu_rhs, gnat_node);
4336 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4338 /* If this is a logical shift with the shift count not verified,
4339 we must return zero if it is too large. We cannot compensate
4340 above in this case. */
4341 if ((Nkind (gnat_node) == N_Op_Shift_Left
4342 || Nkind (gnat_node) == N_Op_Shift_Right)
4343 && !Shift_Count_OK (gnat_node))
4347 build_binary_op (GE_EXPR, integer_type_node,
4349 convert (TREE_TYPE (gnu_rhs),
4350 TYPE_SIZE (gnu_type))),
4351 convert (gnu_type, integer_zero_node),
4356 case N_Conditional_Expression:
4358 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4359 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4361 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4363 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4364 gnu_result = build_cond_expr (gnu_result_type,
4365 gnat_truthvalue_conversion (gnu_cond),
4366 gnu_true, gnu_false);
4371 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4372 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4376 /* This case can apply to a boolean or a modular type.
4377 Fall through for a boolean operand since GNU_CODES is set
4378 up to handle this. */
4379 if (Is_Modular_Integer_Type (Etype (gnat_node))
4380 || (Ekind (Etype (gnat_node)) == E_Private_Type
4381 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4383 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4384 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4385 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4390 /* ... fall through ... */
4392 case N_Op_Minus: case N_Op_Abs:
4393 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4395 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4396 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4398 gnu_result_type = get_unpadded_type (Base_Type
4399 (Full_View (Etype (gnat_node))));
4401 if (Do_Overflow_Check (gnat_node)
4402 && !TYPE_UNSIGNED (gnu_result_type)
4403 && !FLOAT_TYPE_P (gnu_result_type))
4405 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4406 gnu_result_type, gnu_expr, gnat_node);
4408 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4409 gnu_result_type, gnu_expr);
4416 bool ignore_init_type = false;
4418 gnat_temp = Expression (gnat_node);
4420 /* The Expression operand can either be an N_Identifier or
4421 Expanded_Name, which must represent a type, or a
4422 N_Qualified_Expression, which contains both the object type and an
4423 initial value for the object. */
4424 if (Nkind (gnat_temp) == N_Identifier
4425 || Nkind (gnat_temp) == N_Expanded_Name)
4426 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4427 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4429 Entity_Id gnat_desig_type
4430 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4432 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4433 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4435 gnu_init = maybe_unconstrained_array (gnu_init);
4436 if (Do_Range_Check (Expression (gnat_temp)))
4438 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4440 if (Is_Elementary_Type (gnat_desig_type)
4441 || Is_Constrained (gnat_desig_type))
4443 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4444 gnu_init = convert (gnu_type, gnu_init);
4448 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4449 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4450 gnu_type = TREE_TYPE (gnu_init);
4452 gnu_init = convert (gnu_type, gnu_init);
4458 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4459 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4460 Procedure_To_Call (gnat_node),
4461 Storage_Pool (gnat_node), gnat_node,
4466 /**************************/
4467 /* Chapter 5: Statements */
4468 /**************************/
4471 gnu_result = build1 (LABEL_EXPR, void_type_node,
4472 gnat_to_gnu (Identifier (gnat_node)));
4475 case N_Null_Statement:
4476 gnu_result = alloc_stmt_list ();
4479 case N_Assignment_Statement:
4480 /* Get the LHS and RHS of the statement and convert any reference to an
4481 unconstrained array into a reference to the underlying array.
4482 If we are not to do range checking and the RHS is an N_Function_Call,
4483 pass the LHS to the call function. */
4484 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4486 /* If the type has a size that overflows, convert this into raise of
4487 Storage_Error: execution shouldn't have gotten here anyway. */
4488 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4489 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4490 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4491 N_Raise_Storage_Error);
4492 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4493 && !Do_Range_Check (Expression (gnat_node)))
4494 gnu_result = call_to_gnu (Expression (gnat_node),
4495 &gnu_result_type, gnu_lhs);
4499 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4501 /* If range check is needed, emit code to generate it. */
4502 if (Do_Range_Check (Expression (gnat_node)))
4503 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4507 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4509 /* If the type being assigned is an array type and the two sides
4510 are not completely disjoint, play safe and use memmove. */
4511 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4512 && Is_Array_Type (Etype (Name (gnat_node)))
4513 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4515 tree to, from, size, to_ptr, from_ptr, t;
4517 to = TREE_OPERAND (gnu_result, 0);
4518 from = TREE_OPERAND (gnu_result, 1);
4520 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4521 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4523 to_ptr = build_fold_addr_expr (to);
4524 from_ptr = build_fold_addr_expr (from);
4526 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4527 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4532 case N_If_Statement:
4534 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4536 /* Make the outer COND_EXPR. Avoid non-determinism. */
4537 gnu_result = build3 (COND_EXPR, void_type_node,
4538 gnat_to_gnu (Condition (gnat_node)),
4539 NULL_TREE, NULL_TREE);
4540 COND_EXPR_THEN (gnu_result)
4541 = build_stmt_group (Then_Statements (gnat_node), false);
4542 TREE_SIDE_EFFECTS (gnu_result) = 1;
4543 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4545 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4546 into the previous "else" part and point to where to put any
4547 outer "else". Also avoid non-determinism. */
4548 if (Present (Elsif_Parts (gnat_node)))
4549 for (gnat_temp = First (Elsif_Parts (gnat_node));
4550 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4552 gnu_expr = build3 (COND_EXPR, void_type_node,
4553 gnat_to_gnu (Condition (gnat_temp)),
4554 NULL_TREE, NULL_TREE);
4555 COND_EXPR_THEN (gnu_expr)
4556 = build_stmt_group (Then_Statements (gnat_temp), false);
4557 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4558 set_expr_location_from_node (gnu_expr, gnat_temp);
4559 *gnu_else_ptr = gnu_expr;
4560 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4563 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4567 case N_Case_Statement:
4568 gnu_result = Case_Statement_to_gnu (gnat_node);
4571 case N_Loop_Statement:
4572 gnu_result = Loop_Statement_to_gnu (gnat_node);
4575 case N_Block_Statement:
4576 start_stmt_group ();
4578 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4579 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4581 gnu_result = end_stmt_group ();
4583 if (Present (Identifier (gnat_node)))
4584 mark_out_of_scope (Entity (Identifier (gnat_node)));
4587 case N_Exit_Statement:
4589 = build2 (EXIT_STMT, void_type_node,
4590 (Present (Condition (gnat_node))
4591 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4592 (Present (Name (gnat_node))
4593 ? get_gnu_tree (Entity (Name (gnat_node)))
4594 : TREE_VALUE (gnu_loop_label_stack)));
4597 case N_Return_Statement:
4599 /* The gnu function type of the subprogram currently processed. */
4600 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4601 /* The return value from the subprogram. */
4602 tree gnu_ret_val = NULL_TREE;
4603 /* The place to put the return value. */
4606 /* If we are dealing with a "return;" from an Ada procedure with
4607 parameters passed by copy in copy out, we need to return a record
4608 containing the final values of these parameters. If the list
4609 contains only one entry, return just that entry.
4611 For a full description of the copy in copy out parameter mechanism,
4612 see the part of the gnat_to_gnu_entity routine dealing with the
4613 translation of subprograms.
4615 But if we have a return label defined, convert this into
4616 a branch to that label. */
4618 if (TREE_VALUE (gnu_return_label_stack))
4620 gnu_result = build1 (GOTO_EXPR, void_type_node,
4621 TREE_VALUE (gnu_return_label_stack));
4625 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4627 gnu_lhs = DECL_RESULT (current_function_decl);
4628 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4629 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4632 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4633 TYPE_CI_CO_LIST (gnu_subprog_type));
4636 /* If the Ada subprogram is a function, we just need to return the
4637 expression. If the subprogram returns an unconstrained
4638 array, we have to allocate a new version of the result and
4639 return it. If we return by reference, return a pointer. */
4641 else if (Present (Expression (gnat_node)))
4643 /* If the current function returns by target pointer and we
4644 are doing a call, pass that target to the call. */
4645 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4646 && Nkind (Expression (gnat_node)) == N_Function_Call)
4649 = build_unary_op (INDIRECT_REF, NULL_TREE,
4650 DECL_ARGUMENTS (current_function_decl));
4651 gnu_result = call_to_gnu (Expression (gnat_node),
4652 &gnu_result_type, gnu_lhs);
4656 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4658 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4659 /* The original return type was unconstrained so dereference
4660 the TARGET pointer in the actual return value's type. */
4662 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4663 DECL_ARGUMENTS (current_function_decl));
4665 gnu_lhs = DECL_RESULT (current_function_decl);
4667 /* Do not remove the padding from GNU_RET_VAL if the inner
4668 type is self-referential since we want to allocate the fixed
4669 size in that case. */
4670 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4671 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4673 && (TYPE_IS_PADDING_P
4674 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4675 && (CONTAINS_PLACEHOLDER_P
4676 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4677 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4679 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4680 || By_Ref (gnat_node))
4682 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4684 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4686 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4688 = build_allocator (TREE_TYPE (gnu_ret_val),
4690 TREE_TYPE (gnu_subprog_type),
4691 Procedure_To_Call (gnat_node),
4692 Storage_Pool (gnat_node),
4698 /* If the Ada subprogram is a regular procedure, just return. */
4699 gnu_lhs = NULL_TREE;
4701 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4704 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4705 gnu_lhs, gnu_ret_val);
4706 add_stmt_with_node (gnu_result, gnat_node);
4707 gnu_lhs = NULL_TREE;
4710 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4714 case N_Goto_Statement:
4715 gnu_result = build1 (GOTO_EXPR, void_type_node,
4716 gnat_to_gnu (Name (gnat_node)));
4719 /***************************/
4720 /* Chapter 6: Subprograms */
4721 /***************************/
4723 case N_Subprogram_Declaration:
4724 /* Unless there is a freeze node, declare the subprogram. We consider
4725 this a "definition" even though we're not generating code for
4726 the subprogram because we will be making the corresponding GCC
4729 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4730 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4732 gnu_result = alloc_stmt_list ();
4735 case N_Abstract_Subprogram_Declaration:
4736 /* This subprogram doesn't exist for code generation purposes, but we
4737 have to elaborate the types of any parameters and result, unless
4738 they are imported types (nothing to generate in this case). */
4740 /* Process the parameter types first. */
4743 = First_Formal_With_Extras
4744 (Defining_Entity (Specification (gnat_node)));
4745 Present (gnat_temp);
4746 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4747 if (Is_Itype (Etype (gnat_temp))
4748 && !From_With_Type (Etype (gnat_temp)))
4749 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4752 /* Then the result type, set to Standard_Void_Type for procedures. */
4755 Entity_Id gnat_temp_type
4756 = Etype (Defining_Entity (Specification (gnat_node)));
4758 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4759 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4762 gnu_result = alloc_stmt_list ();
4765 case N_Defining_Program_Unit_Name:
4766 /* For a child unit identifier go up a level to get the specification.
4767 We get this when we try to find the spec of a child unit package
4768 that is the compilation unit being compiled. */
4769 gnu_result = gnat_to_gnu (Parent (gnat_node));
4772 case N_Subprogram_Body:
4773 Subprogram_Body_to_gnu (gnat_node);
4774 gnu_result = alloc_stmt_list ();
4777 case N_Function_Call:
4778 case N_Procedure_Call_Statement:
4779 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4782 /************************/
4783 /* Chapter 7: Packages */
4784 /************************/
4786 case N_Package_Declaration:
4787 gnu_result = gnat_to_gnu (Specification (gnat_node));
4790 case N_Package_Specification:
4792 start_stmt_group ();
4793 process_decls (Visible_Declarations (gnat_node),
4794 Private_Declarations (gnat_node), Empty, true, true);
4795 gnu_result = end_stmt_group ();
4798 case N_Package_Body:
4800 /* If this is the body of a generic package - do nothing. */
4801 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4803 gnu_result = alloc_stmt_list ();
4807 start_stmt_group ();
4808 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4810 if (Present (Handled_Statement_Sequence (gnat_node)))
4811 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4813 gnu_result = end_stmt_group ();
4816 /********************************/
4817 /* Chapter 8: Visibility Rules */
4818 /********************************/
4820 case N_Use_Package_Clause:
4821 case N_Use_Type_Clause:
4822 /* Nothing to do here - but these may appear in list of declarations. */
4823 gnu_result = alloc_stmt_list ();
4826 /*********************/
4827 /* Chapter 9: Tasks */
4828 /*********************/
4830 case N_Protected_Type_Declaration:
4831 gnu_result = alloc_stmt_list ();
4834 case N_Single_Task_Declaration:
4835 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4836 gnu_result = alloc_stmt_list ();
4839 /*********************************************************/
4840 /* Chapter 10: Program Structure and Compilation Issues */
4841 /*********************************************************/
4843 case N_Compilation_Unit:
4845 /* This is not called for the main unit, which is handled in function
4847 start_stmt_group ();
4850 Compilation_Unit_to_gnu (gnat_node);
4851 gnu_result = alloc_stmt_list ();
4854 case N_Subprogram_Body_Stub:
4855 case N_Package_Body_Stub:
4856 case N_Protected_Body_Stub:
4857 case N_Task_Body_Stub:
4858 /* Simply process whatever unit is being inserted. */
4859 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4863 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4866 /***************************/
4867 /* Chapter 11: Exceptions */
4868 /***************************/
4870 case N_Handled_Sequence_Of_Statements:
4871 /* If there is an At_End procedure attached to this node, and the EH
4872 mechanism is SJLJ, we must have at least a corresponding At_End
4873 handler, unless the No_Exception_Handlers restriction is set. */
4874 gcc_assert (type_annotate_only
4875 || Exception_Mechanism != Setjmp_Longjmp
4876 || No (At_End_Proc (gnat_node))
4877 || Present (Exception_Handlers (gnat_node))
4878 || No_Exception_Handlers_Set ());
4880 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4883 case N_Exception_Handler:
4884 if (Exception_Mechanism == Setjmp_Longjmp)
4885 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4886 else if (Exception_Mechanism == Back_End_Exceptions)
4887 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4893 case N_Push_Constraint_Error_Label:
4894 push_exception_label_stack (&gnu_constraint_error_label_stack,
4895 Exception_Label (gnat_node));
4898 case N_Push_Storage_Error_Label:
4899 push_exception_label_stack (&gnu_storage_error_label_stack,
4900 Exception_Label (gnat_node));
4903 case N_Push_Program_Error_Label:
4904 push_exception_label_stack (&gnu_program_error_label_stack,
4905 Exception_Label (gnat_node));
4908 case N_Pop_Constraint_Error_Label:
4909 gnu_constraint_error_label_stack
4910 = TREE_CHAIN (gnu_constraint_error_label_stack);
4913 case N_Pop_Storage_Error_Label:
4914 gnu_storage_error_label_stack
4915 = TREE_CHAIN (gnu_storage_error_label_stack);
4918 case N_Pop_Program_Error_Label:
4919 gnu_program_error_label_stack
4920 = TREE_CHAIN (gnu_program_error_label_stack);
4923 /******************************/
4924 /* Chapter 12: Generic Units */
4925 /******************************/
4927 case N_Generic_Function_Renaming_Declaration:
4928 case N_Generic_Package_Renaming_Declaration:
4929 case N_Generic_Procedure_Renaming_Declaration:
4930 case N_Generic_Package_Declaration:
4931 case N_Generic_Subprogram_Declaration:
4932 case N_Package_Instantiation:
4933 case N_Procedure_Instantiation:
4934 case N_Function_Instantiation:
4935 /* These nodes can appear on a declaration list but there is nothing to
4936 to be done with them. */
4937 gnu_result = alloc_stmt_list ();
4940 /**************************************************/
4941 /* Chapter 13: Representation Clauses and */
4942 /* Implementation-Dependent Features */
4943 /**************************************************/
4945 case N_Attribute_Definition_Clause:
4946 gnu_result = alloc_stmt_list ();
4948 /* The only one we need to deal with is 'Address since, for the others,
4949 the front-end puts the information elsewhere. */
4950 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4953 /* And we only deal with 'Address if the object has a Freeze node. */
4954 gnat_temp = Entity (Name (gnat_node));
4955 if (No (Freeze_Node (gnat_temp)))
4958 /* Get the value to use as the address and save it as the equivalent
4959 for the object. When it is frozen, gnat_to_gnu_entity will do the
4961 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4964 case N_Enumeration_Representation_Clause:
4965 case N_Record_Representation_Clause:
4967 /* We do nothing with these. SEM puts the information elsewhere. */
4968 gnu_result = alloc_stmt_list ();
4971 case N_Code_Statement:
4972 if (!type_annotate_only)
4974 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4975 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4976 tree gnu_clobbers = NULL_TREE, tail;
4977 bool allows_mem, allows_reg, fake;
4978 int ninputs, noutputs, i;
4979 const char **oconstraints;
4980 const char *constraint;
4983 /* First retrieve the 3 operand lists built by the front-end. */
4984 Setup_Asm_Outputs (gnat_node);
4985 while (Present (gnat_temp = Asm_Output_Variable ()))
4987 tree gnu_value = gnat_to_gnu (gnat_temp);
4988 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4989 (Asm_Output_Constraint ()));
4991 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4995 Setup_Asm_Inputs (gnat_node);
4996 while (Present (gnat_temp = Asm_Input_Value ()))
4998 tree gnu_value = gnat_to_gnu (gnat_temp);
4999 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5000 (Asm_Input_Constraint ()));
5002 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
5006 Clobber_Setup (gnat_node);
5007 while ((clobber = Clobber_Get_Next ()))
5009 = tree_cons (NULL_TREE,
5010 build_string (strlen (clobber) + 1, clobber),
5013 /* Then perform some standard checking and processing on the
5014 operands. In particular, mark them addressable if needed. */
5015 gnu_outputs = nreverse (gnu_outputs);
5016 noutputs = list_length (gnu_outputs);
5017 gnu_inputs = nreverse (gnu_inputs);
5018 ninputs = list_length (gnu_inputs);
5020 = (const char **) alloca (noutputs * sizeof (const char *));
5022 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
5024 tree output = TREE_VALUE (tail);
5026 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5027 oconstraints[i] = constraint;
5029 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
5030 &allows_mem, &allows_reg, &fake))
5032 /* If the operand is going to end up in memory,
5033 mark it addressable. Note that we don't test
5034 allows_mem like in the input case below; this
5035 is modelled on the C front-end. */
5037 && !gnat_mark_addressable (output))
5038 output = error_mark_node;
5041 output = error_mark_node;
5043 TREE_VALUE (tail) = output;
5046 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5048 tree input = TREE_VALUE (tail);
5050 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5052 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5054 &allows_mem, &allows_reg))
5056 /* If the operand is going to end up in memory,
5057 mark it addressable. */
5058 if (!allows_reg && allows_mem
5059 && !gnat_mark_addressable (input))
5060 input = error_mark_node;
5063 input = error_mark_node;
5065 TREE_VALUE (tail) = input;
5068 gnu_result = build4 (ASM_EXPR, void_type_node,
5069 gnu_template, gnu_outputs,
5070 gnu_inputs, gnu_clobbers);
5071 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5074 gnu_result = alloc_stmt_list ();
5082 case N_Freeze_Entity:
5083 start_stmt_group ();
5084 process_freeze_entity (gnat_node);
5085 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5086 gnu_result = end_stmt_group ();
5089 case N_Itype_Reference:
5090 if (!present_gnu_tree (Itype (gnat_node)))
5091 process_type (Itype (gnat_node));
5093 gnu_result = alloc_stmt_list ();
5096 case N_Free_Statement:
5097 if (!type_annotate_only)
5099 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5100 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5102 tree gnu_actual_obj_type = 0;
5105 /* If this is a thin pointer, we must dereference it to create
5106 a fat pointer, then go back below to a thin pointer. The
5107 reason for this is that we need a fat pointer someplace in
5108 order to properly compute the size. */
5109 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5110 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5111 build_unary_op (INDIRECT_REF, NULL_TREE,
5114 /* If this is an unconstrained array, we know the object must
5115 have been allocated with the template in front of the object.
5116 So pass the template address, but get the total size. Do this
5117 by converting to a thin pointer. */
5118 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5120 = convert (build_pointer_type
5121 (TYPE_OBJECT_RECORD_TYPE
5122 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5125 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5127 if (Present (Actual_Designated_Subtype (gnat_node)))
5130 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5132 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5134 = build_unc_object_type_from_ptr (gnu_ptr_type,
5135 gnu_actual_obj_type,
5136 get_identifier ("DEALLOC"));
5139 gnu_actual_obj_type = gnu_obj_type;
5141 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5143 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5144 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5146 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5147 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5148 tree gnu_byte_offset
5149 = convert (sizetype,
5150 size_diffop (size_zero_node, gnu_pos));
5151 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5153 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5154 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5155 gnu_ptr, gnu_byte_offset);
5159 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
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 overflowed, raise Constraint_Error. */
5316 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5318 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5320 = build1 (NULL_EXPR, gnu_result_type,
5321 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5322 N_Raise_Constraint_Error));
5325 /* If our result has side-effects and is of an unconstrained type,
5326 make a SAVE_EXPR so that we can be sure it will only be referenced
5327 once. Note we must do this before any conversions. */
5328 if (TREE_SIDE_EFFECTS (gnu_result)
5329 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5330 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5331 gnu_result = gnat_stabilize_reference (gnu_result, false);
5333 /* Now convert the result to the result type, unless we are in one of the
5336 1. If this is the Name of an assignment statement or a parameter of
5337 a procedure call, return the result almost unmodified since the
5338 RHS will have to be converted to our type in that case, unless
5339 the result type has a simpler size. Likewise if there is just
5340 a no-op unchecked conversion in-between. Similarly, don't convert
5341 integral types that are the operands of an unchecked conversion
5342 since we need to ignore those conversions (for 'Valid).
5344 2. If we have a label (which doesn't have any well-defined type), a
5345 field or an error, return the result almost unmodified. Also don't
5346 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5347 its size since those are the cases where the front end may have the
5348 type wrong due to "instantiating" the unconstrained record with
5349 discriminant values. Similarly, if the two types are record types
5350 with the same name don't convert. This will be the case when we are
5351 converting from a packable version of a type to its original type and
5352 we need those conversions to be NOPs in order for assignments into
5353 these types to work properly.
5355 3. If the type is void or if we have no result, return error_mark_node
5356 to show we have no result.
5358 4. Finally, if the type of the result is already correct. */
5360 if (Present (Parent (gnat_node))
5361 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5362 && Name (Parent (gnat_node)) == gnat_node)
5363 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5364 && unchecked_conversion_lhs_nop (Parent (gnat_node)))
5365 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5366 && Name (Parent (gnat_node)) != gnat_node)
5367 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5368 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5369 && !AGGREGATE_TYPE_P (gnu_result_type)
5370 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5371 && !(TYPE_SIZE (gnu_result_type)
5372 && TYPE_SIZE (TREE_TYPE (gnu_result))
5373 && (AGGREGATE_TYPE_P (gnu_result_type)
5374 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5375 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5376 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5378 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5379 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5380 && (CONTAINS_PLACEHOLDER_P
5381 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5382 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5383 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5385 /* Remove padding only if the inner object is of self-referential
5386 size: in that case it must be an object of unconstrained type
5387 with a default discriminant and we want to avoid copying too
5389 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5390 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5391 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5392 (TREE_TYPE (gnu_result))))))
5393 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5397 else if (TREE_CODE (gnu_result) == LABEL_DECL
5398 || TREE_CODE (gnu_result) == FIELD_DECL
5399 || TREE_CODE (gnu_result) == ERROR_MARK
5400 || (TYPE_SIZE (gnu_result_type)
5401 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5402 && TREE_CODE (gnu_result) != INDIRECT_REF
5403 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5404 || ((TYPE_NAME (gnu_result_type)
5405 == TYPE_NAME (TREE_TYPE (gnu_result)))
5406 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5407 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5409 /* Remove any padding. */
5410 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5411 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5412 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5416 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5417 gnu_result = error_mark_node;
5419 else if (gnu_result_type != TREE_TYPE (gnu_result))
5420 gnu_result = convert (gnu_result_type, gnu_result);
5422 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5423 while ((TREE_CODE (gnu_result) == NOP_EXPR
5424 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5425 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5426 gnu_result = TREE_OPERAND (gnu_result, 0);
5431 /* Subroutine of above to push the exception label stack. GNU_STACK is
5432 a pointer to the stack to update and GNAT_LABEL, if present, is the
5433 label to push onto the stack. */
5436 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5438 tree gnu_label = (Present (gnat_label)
5439 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5442 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5445 /* Record the current code position in GNAT_NODE. */
5448 record_code_position (Node_Id gnat_node)
5450 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5452 add_stmt_with_node (stmt_stmt, gnat_node);
5453 save_gnu_tree (gnat_node, stmt_stmt, true);
5456 /* Insert the code for GNAT_NODE at the position saved for that node. */
5459 insert_code_for (Node_Id gnat_node)
5461 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5462 save_gnu_tree (gnat_node, NULL_TREE, true);
5465 /* Start a new statement group chained to the previous group. */
5468 start_stmt_group (void)
5470 struct stmt_group *group = stmt_group_free_list;
5472 /* First see if we can get one from the free list. */
5474 stmt_group_free_list = group->previous;
5476 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5478 group->previous = current_stmt_group;
5479 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5480 current_stmt_group = group;
5483 /* Add GNU_STMT to the current statement group. */
5486 add_stmt (tree gnu_stmt)
5488 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5491 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5494 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5496 if (Present (gnat_node))
5497 set_expr_location_from_node (gnu_stmt, gnat_node);
5498 add_stmt (gnu_stmt);
5501 /* Add a declaration statement for GNU_DECL to the current statement group.
5502 Get SLOC from Entity_Id. */
5505 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5507 tree type = TREE_TYPE (gnu_decl);
5508 tree gnu_stmt, gnu_init, t;
5510 /* If this is a variable that Gigi is to ignore, we may have been given
5511 an ERROR_MARK. So test for it. We also might have been given a
5512 reference for a renaming. So only do something for a decl. Also
5513 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5514 if (!DECL_P (gnu_decl)
5515 || (TREE_CODE (gnu_decl) == TYPE_DECL
5516 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5519 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5521 /* If we are global, we don't want to actually output the DECL_EXPR for
5522 this decl since we already have evaluated the expressions in the
5523 sizes and positions as globals and doing it again would be wrong. */
5524 if (global_bindings_p ())
5526 /* Mark everything as used to prevent node sharing with subprograms.
5527 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5528 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5529 mark_visited (&gnu_stmt);
5531 if (TREE_CODE (gnu_decl) == VAR_DECL
5532 || TREE_CODE (gnu_decl) == CONST_DECL)
5534 mark_visited (&DECL_SIZE (gnu_decl));
5535 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5536 mark_visited (&DECL_INITIAL (gnu_decl));
5539 /* In any case, we have to deal with our own fields. */
5540 else if (TREE_CODE (gnu_decl) == TYPE_DECL)
5541 switch (TREE_CODE (type))
5545 case QUAL_UNION_TYPE:
5546 if ((t = TYPE_ADA_SIZE (type)))
5554 if ((t = TYPE_RM_MIN_VALUE (type)))
5556 if ((t = TYPE_RM_MAX_VALUE (type)))
5565 add_stmt_with_node (gnu_stmt, gnat_entity);
5567 /* If this is a variable and an initializer is attached to it, it must be
5568 valid for the context. Similar to init_const in create_var_decl_1. */
5569 if (TREE_CODE (gnu_decl) == VAR_DECL
5570 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5571 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5572 || (TREE_STATIC (gnu_decl)
5573 && !initializer_constant_valid_p (gnu_init,
5574 TREE_TYPE (gnu_init)))))
5576 /* If GNU_DECL has a padded type, convert it to the unpadded
5577 type so the assignment is done properly. */
5578 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5579 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5583 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5585 DECL_INITIAL (gnu_decl) = NULL_TREE;
5586 if (TREE_READONLY (gnu_decl))
5588 TREE_READONLY (gnu_decl) = 0;
5589 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5592 add_stmt_with_node (gnu_stmt, gnat_entity);
5596 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5599 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5601 if (TREE_VISITED (*tp))
5604 /* Don't mark a dummy type as visited because we want to mark its sizes
5605 and fields once it's filled in. */
5606 else if (!TYPE_IS_DUMMY_P (*tp))
5607 TREE_VISITED (*tp) = 1;
5610 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5615 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5618 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5619 void *data ATTRIBUTE_UNUSED)
5623 if (TREE_CODE (t) == SAVE_EXPR)
5624 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5629 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5630 sized gimplified. We use this to indicate all variable sizes and
5631 positions in global types may not be shared by any subprogram. */
5634 mark_visited (tree *tp)
5636 walk_tree (tp, mark_visited_r, NULL, NULL);
5639 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5640 set its location to that of GNAT_NODE if present. */
5643 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5645 if (Present (gnat_node))
5646 set_expr_location_from_node (gnu_cleanup, gnat_node);
5647 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5650 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5653 set_block_for_group (tree gnu_block)
5655 gcc_assert (!current_stmt_group->block);
5656 current_stmt_group->block = gnu_block;
5659 /* Return code corresponding to the current code group. It is normally
5660 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5661 BLOCK or cleanups were set. */
5664 end_stmt_group (void)
5666 struct stmt_group *group = current_stmt_group;
5667 tree gnu_retval = group->stmt_list;
5669 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5670 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5671 make a BIND_EXPR. Note that we nest in that because the cleanup may
5672 reference variables in the block. */
5673 if (gnu_retval == NULL_TREE)
5674 gnu_retval = alloc_stmt_list ();
5676 if (group->cleanups)
5677 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5680 if (current_stmt_group->block)
5681 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5682 gnu_retval, group->block);
5684 /* Remove this group from the stack and add it to the free list. */
5685 current_stmt_group = group->previous;
5686 group->previous = stmt_group_free_list;
5687 stmt_group_free_list = group;
5692 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5696 add_stmt_list (List_Id gnat_list)
5700 if (Present (gnat_list))
5701 for (gnat_node = First (gnat_list); Present (gnat_node);
5702 gnat_node = Next (gnat_node))
5703 add_stmt (gnat_to_gnu (gnat_node));
5706 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5707 If BINDING_P is true, push and pop a binding level around the list. */
5710 build_stmt_group (List_Id gnat_list, bool binding_p)
5712 start_stmt_group ();
5716 add_stmt_list (gnat_list);
5720 return end_stmt_group ();
5723 /* Push and pop routines for stacks. We keep a free list around so we
5724 don't waste tree nodes. */
5727 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5729 tree gnu_node = gnu_stack_free_list;
5733 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5734 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5735 TREE_PURPOSE (gnu_node) = gnu_purpose;
5736 TREE_VALUE (gnu_node) = gnu_value;
5739 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5741 *gnu_stack_ptr = gnu_node;
5745 pop_stack (tree *gnu_stack_ptr)
5747 tree gnu_node = *gnu_stack_ptr;
5749 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5750 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5751 gnu_stack_free_list = gnu_node;
5754 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5757 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5758 gimple_seq *post_p ATTRIBUTE_UNUSED)
5760 tree expr = *expr_p;
5763 if (IS_ADA_STMT (expr))
5764 return gnat_gimplify_stmt (expr_p);
5766 switch (TREE_CODE (expr))
5769 /* If this is for a scalar, just make a VAR_DECL for it. If for
5770 an aggregate, get a null pointer of the appropriate type and
5772 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5773 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5774 convert (build_pointer_type (TREE_TYPE (expr)),
5775 integer_zero_node));
5778 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5779 TREE_NO_WARNING (*expr_p) = 1;
5782 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5785 case UNCONSTRAINED_ARRAY_REF:
5786 /* We should only do this if we are just elaborating for side-effects,
5787 but we can't know that yet. */
5788 *expr_p = TREE_OPERAND (*expr_p, 0);
5792 op = TREE_OPERAND (expr, 0);
5794 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5795 be put into static memory. We know it's going to be readonly given
5796 the semantics we have and it's required to be static memory in
5797 the case when the reference is in an elaboration procedure. */
5798 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5800 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5802 TREE_READONLY (new_var) = 1;
5803 TREE_STATIC (new_var) = 1;
5804 TREE_ADDRESSABLE (new_var) = 1;
5805 DECL_INITIAL (new_var) = op;
5807 TREE_OPERAND (expr, 0) = new_var;
5808 recompute_tree_invariant_for_addr_expr (expr);
5812 /* If we are taking the address of a SAVE_EXPR, we are typically
5813 processing a misaligned argument to be passed by reference in a
5814 procedure call. We just mark the operand as addressable + not
5815 readonly here and let the common gimplifier code perform the
5816 temporary creation, initialization, and "instantiation" in place of
5817 the SAVE_EXPR in further operands, in particular in the copy back
5818 code inserted after the call. */
5819 else if (TREE_CODE (op) == SAVE_EXPR)
5821 TREE_ADDRESSABLE (op) = 1;
5822 TREE_READONLY (op) = 0;
5825 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5826 address of the selected operand when it is addressable. Besides, we
5827 also expect addressable_p to only let COND_EXPRs where both arms are
5828 addressable reach here. */
5829 else if (TREE_CODE (op) == COND_EXPR)
5832 /* Otherwise, if we are taking the address of something that is neither
5833 reference, declaration, or constant, make a variable for the operand
5834 here and then take its address. If we don't do it this way, we may
5835 confuse the gimplifier because it needs to know the variable is
5836 addressable at this point. This duplicates code in
5837 internal_get_tmp_var, which is unfortunate. */
5838 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5839 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5840 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5842 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5845 TREE_ADDRESSABLE (new_var) = 1;
5847 stmt = gimplify_assign (new_var, op, pre_p);
5848 if (EXPR_HAS_LOCATION (op))
5849 gimple_set_location (stmt, *EXPR_LOCUS (op));
5851 TREE_OPERAND (expr, 0) = new_var;
5852 recompute_tree_invariant_for_addr_expr (expr);
5856 /* ... fall through ... */
5859 return GS_UNHANDLED;
5863 /* Generate GIMPLE in place for the statement at *STMT_P. */
5865 static enum gimplify_status
5866 gnat_gimplify_stmt (tree *stmt_p)
5868 tree stmt = *stmt_p;
5870 switch (TREE_CODE (stmt))
5873 *stmt_p = STMT_STMT_STMT (stmt);
5878 tree gnu_start_label = create_artificial_label (input_location);
5879 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5882 /* Set to emit the statements of the loop. */
5883 *stmt_p = NULL_TREE;
5885 /* We first emit the start label and then a conditional jump to
5886 the end label if there's a top condition, then the body of the
5887 loop, then a conditional branch to the end label, then the update,
5888 if any, and finally a jump to the start label and the definition
5889 of the end label. */
5890 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5894 if (LOOP_STMT_TOP_COND (stmt))
5895 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5896 LOOP_STMT_TOP_COND (stmt),
5903 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5905 if (LOOP_STMT_BOT_COND (stmt))
5906 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5907 LOOP_STMT_BOT_COND (stmt),
5914 if (LOOP_STMT_UPDATE (stmt))
5915 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5917 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5918 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5919 append_to_statement_list (t, stmt_p);
5921 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5928 /* Build a statement to jump to the corresponding end label, then
5929 see if it needs to be conditional. */
5930 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5931 if (EXIT_STMT_COND (stmt))
5932 *stmt_p = build3 (COND_EXPR, void_type_node,
5933 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5941 /* Force references to each of the entities in packages withed by GNAT_NODE.
5942 Operate recursively but check that we aren't elaborating something more
5945 This routine is exclusively called in type_annotate mode, to compute DDA
5946 information for types in withed units, for ASIS use. */
5949 elaborate_all_entities (Node_Id gnat_node)
5951 Entity_Id gnat_with_clause, gnat_entity;
5953 /* Process each unit only once. As we trace the context of all relevant
5954 units transitively, including generic bodies, we may encounter the
5955 same generic unit repeatedly. */
5956 if (!present_gnu_tree (gnat_node))
5957 save_gnu_tree (gnat_node, integer_zero_node, true);
5959 /* Save entities in all context units. A body may have an implicit_with
5960 on its own spec, if the context includes a child unit, so don't save
5962 for (gnat_with_clause = First (Context_Items (gnat_node));
5963 Present (gnat_with_clause);
5964 gnat_with_clause = Next (gnat_with_clause))
5965 if (Nkind (gnat_with_clause) == N_With_Clause
5966 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5967 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5969 elaborate_all_entities (Library_Unit (gnat_with_clause));
5971 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5973 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5974 Present (gnat_entity);
5975 gnat_entity = Next_Entity (gnat_entity))
5976 if (Is_Public (gnat_entity)
5977 && Convention (gnat_entity) != Convention_Intrinsic
5978 && Ekind (gnat_entity) != E_Package
5979 && Ekind (gnat_entity) != E_Package_Body
5980 && Ekind (gnat_entity) != E_Operator
5981 && !(IN (Ekind (gnat_entity), Type_Kind)
5982 && !Is_Frozen (gnat_entity))
5983 && !((Ekind (gnat_entity) == E_Procedure
5984 || Ekind (gnat_entity) == E_Function)
5985 && Is_Intrinsic_Subprogram (gnat_entity))
5986 && !IN (Ekind (gnat_entity), Named_Kind)
5987 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5988 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5990 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5993 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5995 /* Retrieve compilation unit node of generic body. */
5996 while (Present (gnat_body)
5997 && Nkind (gnat_body) != N_Compilation_Unit)
5998 gnat_body = Parent (gnat_body);
6000 /* If body is available, elaborate its context. */
6001 if (Present (gnat_body))
6002 elaborate_all_entities (gnat_body);
6006 if (Nkind (Unit (gnat_node)) == N_Package_Body)
6007 elaborate_all_entities (Library_Unit (gnat_node));
6010 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
6013 process_freeze_entity (Node_Id gnat_node)
6015 Entity_Id gnat_entity = Entity (gnat_node);
6019 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6020 && present_gnu_tree (Declaration_Node (gnat_entity)))
6021 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6023 /* If this is a package, need to generate code for the package. */
6024 if (Ekind (gnat_entity) == E_Package)
6027 (Parent (Corresponding_Body
6028 (Parent (Declaration_Node (gnat_entity)))));
6032 /* Check for old definition after the above call. This Freeze_Node
6033 might be for one its Itypes. */
6035 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6037 /* If this entity has an Address representation clause, GNU_OLD is the
6038 address, so discard it here. */
6039 if (Present (Address_Clause (gnat_entity)))
6042 /* Don't do anything for class-wide types they are always
6043 transformed into their root type. */
6044 if (Ekind (gnat_entity) == E_Class_Wide_Type
6045 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
6046 && Present (Equivalent_Type (gnat_entity))))
6049 /* Don't do anything for subprograms that may have been elaborated before
6050 their freeze nodes. This can happen, for example because of an inner call
6051 in an instance body, or a previous compilation of a spec for inlining
6054 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6055 && (Ekind (gnat_entity) == E_Function
6056 || Ekind (gnat_entity) == E_Procedure))
6058 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6059 && Ekind (gnat_entity) == E_Subprogram_Type)))
6062 /* If we have a non-dummy type old tree, we have nothing to do, except
6063 aborting if this is the public view of a private type whose full view was
6064 not delayed, as this node was never delayed as it should have been. We
6065 let this happen for concurrent types and their Corresponding_Record_Type,
6066 however, because each might legitimately be elaborated before it's own
6067 freeze node, e.g. while processing the other. */
6069 && !(TREE_CODE (gnu_old) == TYPE_DECL
6070 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6072 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6073 && Present (Full_View (gnat_entity))
6074 && No (Freeze_Node (Full_View (gnat_entity))))
6075 || Is_Concurrent_Type (gnat_entity)
6076 || (IN (Ekind (gnat_entity), Record_Kind)
6077 && Is_Concurrent_Record_Type (gnat_entity)));
6081 /* Reset the saved tree, if any, and elaborate the object or type for real.
6082 If there is a full declaration, elaborate it and copy the type to
6083 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6084 a class wide type or subtype. */
6087 save_gnu_tree (gnat_entity, NULL_TREE, false);
6088 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6089 && Present (Full_View (gnat_entity))
6090 && present_gnu_tree (Full_View (gnat_entity)))
6091 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6092 if (Present (Class_Wide_Type (gnat_entity))
6093 && Class_Wide_Type (gnat_entity) != gnat_entity)
6094 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6097 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6098 && Present (Full_View (gnat_entity)))
6100 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6102 /* Propagate back-annotations from full view to partial view. */
6103 if (Unknown_Alignment (gnat_entity))
6104 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6106 if (Unknown_Esize (gnat_entity))
6107 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6109 if (Unknown_RM_Size (gnat_entity))
6110 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6112 /* The above call may have defined this entity (the simplest example
6113 of this is when we have a private enumeral type since the bounds
6114 will have the public view. */
6115 if (!present_gnu_tree (gnat_entity))
6116 save_gnu_tree (gnat_entity, gnu_new, false);
6117 if (Present (Class_Wide_Type (gnat_entity))
6118 && Class_Wide_Type (gnat_entity) != gnat_entity)
6119 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6122 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6124 /* If we've made any pointers to the old version of this type, we
6125 have to update them. */
6127 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6128 TREE_TYPE (gnu_new));
6131 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6132 N_Compilation_Unit. */
6135 process_inlined_subprograms (Node_Id gnat_node)
6137 Entity_Id gnat_entity;
6140 /* If we can inline, generate Gimple for all the inlined subprograms.
6141 Define the entity first so we set DECL_EXTERNAL. */
6143 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6144 Present (gnat_entity);
6145 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6147 gnat_body = Parent (Declaration_Node (gnat_entity));
6149 if (Nkind (gnat_body) != N_Subprogram_Body)
6151 /* ??? This really should always be Present. */
6152 if (No (Corresponding_Body (gnat_body)))
6156 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6159 if (Present (gnat_body))
6161 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6162 add_stmt (gnat_to_gnu (gnat_body));
6167 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6168 We make two passes, one to elaborate anything other than bodies (but
6169 we declare a function if there was no spec). The second pass
6170 elaborates the bodies.
6172 GNAT_END_LIST gives the element in the list past the end. Normally,
6173 this is Empty, but can be First_Real_Statement for a
6174 Handled_Sequence_Of_Statements.
6176 We make a complete pass through both lists if PASS1P is true, then make
6177 the second pass over both lists if PASS2P is true. The lists usually
6178 correspond to the public and private parts of a package. */
6181 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6182 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6184 List_Id gnat_decl_array[2];
6188 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6191 for (i = 0; i <= 1; i++)
6192 if (Present (gnat_decl_array[i]))
6193 for (gnat_decl = First (gnat_decl_array[i]);
6194 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6196 /* For package specs, we recurse inside the declarations,
6197 thus taking the two pass approach inside the boundary. */
6198 if (Nkind (gnat_decl) == N_Package_Declaration
6199 && (Nkind (Specification (gnat_decl)
6200 == N_Package_Specification)))
6201 process_decls (Visible_Declarations (Specification (gnat_decl)),
6202 Private_Declarations (Specification (gnat_decl)),
6203 Empty, true, false);
6205 /* Similarly for any declarations in the actions of a
6207 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6209 process_freeze_entity (gnat_decl);
6210 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6213 /* Package bodies with freeze nodes get their elaboration deferred
6214 until the freeze node, but the code must be placed in the right
6215 place, so record the code position now. */
6216 else if (Nkind (gnat_decl) == N_Package_Body
6217 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6218 record_code_position (gnat_decl);
6220 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6221 && Present (Library_Unit (gnat_decl))
6222 && Present (Freeze_Node
6225 (Library_Unit (gnat_decl)))))))
6226 record_code_position
6227 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6229 /* We defer most subprogram bodies to the second pass. */
6230 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6232 if (Acts_As_Spec (gnat_decl))
6234 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6236 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6237 && Ekind (gnat_subprog_id) != E_Generic_Function)
6238 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6242 /* For bodies and stubs that act as their own specs, the entity
6243 itself must be elaborated in the first pass, because it may
6244 be used in other declarations. */
6245 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6247 Node_Id gnat_subprog_id
6248 = Defining_Entity (Specification (gnat_decl));
6250 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6251 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6252 && Ekind (gnat_subprog_id) != E_Generic_Function)
6253 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6256 /* Concurrent stubs stand for the corresponding subprogram bodies,
6257 which are deferred like other bodies. */
6258 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6259 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6263 add_stmt (gnat_to_gnu (gnat_decl));
6266 /* Here we elaborate everything we deferred above except for package bodies,
6267 which are elaborated at their freeze nodes. Note that we must also
6268 go inside things (package specs and freeze nodes) the first pass did. */
6270 for (i = 0; i <= 1; i++)
6271 if (Present (gnat_decl_array[i]))
6272 for (gnat_decl = First (gnat_decl_array[i]);
6273 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6275 if (Nkind (gnat_decl) == N_Subprogram_Body
6276 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6277 || Nkind (gnat_decl) == N_Task_Body_Stub
6278 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6279 add_stmt (gnat_to_gnu (gnat_decl));
6281 else if (Nkind (gnat_decl) == N_Package_Declaration
6282 && (Nkind (Specification (gnat_decl)
6283 == N_Package_Specification)))
6284 process_decls (Visible_Declarations (Specification (gnat_decl)),
6285 Private_Declarations (Specification (gnat_decl)),
6286 Empty, false, true);
6288 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6289 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6293 /* Make a unary operation of kind CODE using build_unary_op, but guard
6294 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6295 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6296 the operation is to be performed in that type. GNAT_NODE is the gnat
6297 node conveying the source location for which the error should be
6301 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6304 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6306 operand = protect_multiple_eval (operand);
6308 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6309 operand, TYPE_MIN_VALUE (gnu_type)),
6310 build_unary_op (code, gnu_type, operand),
6311 CE_Overflow_Check_Failed, gnat_node);
6314 /* Make a binary operation of kind CODE using build_binary_op, but guard
6315 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6316 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6317 Usually the operation is to be performed in that type. GNAT_NODE is
6318 the GNAT node conveying the source location for which the error should
6322 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6323 tree right, Node_Id gnat_node)
6325 tree lhs = protect_multiple_eval (left);
6326 tree rhs = protect_multiple_eval (right);
6327 tree type_max = TYPE_MAX_VALUE (gnu_type);
6328 tree type_min = TYPE_MIN_VALUE (gnu_type);
6331 tree zero = convert (gnu_type, integer_zero_node);
6336 int precision = TYPE_PRECISION (gnu_type);
6338 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6340 /* Prefer a constant or known-positive rhs to simplify checks. */
6341 if (!TREE_CONSTANT (rhs)
6342 && commutative_tree_code (code)
6343 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6344 && tree_expr_nonnegative_p (lhs))))
6351 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6353 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6355 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6357 /* Try a few strategies that may be cheaper than the general
6358 code at the end of the function, if the rhs is not known.
6360 - Call library function for 64-bit multiplication (complex)
6361 - Widen, if input arguments are sufficiently small
6362 - Determine overflow using wrapped result for addition/subtraction. */
6364 if (!TREE_CONSTANT (rhs))
6366 /* Even for add/subtract double size to get another base type. */
6367 int needed_precision = precision * 2;
6369 if (code == MULT_EXPR && precision == 64)
6371 tree int_64 = gnat_type_for_size (64, 0);
6373 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6374 convert (int_64, lhs),
6375 convert (int_64, rhs)));
6378 else if (needed_precision <= BITS_PER_WORD
6379 || (code == MULT_EXPR
6380 && needed_precision <= LONG_LONG_TYPE_SIZE))
6382 tree wide_type = gnat_type_for_size (needed_precision, 0);
6384 tree wide_result = build_binary_op (code, wide_type,
6385 convert (wide_type, lhs),
6386 convert (wide_type, rhs));
6388 tree check = build_binary_op
6389 (TRUTH_ORIF_EXPR, integer_type_node,
6390 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6391 convert (wide_type, type_min)),
6392 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6393 convert (wide_type, type_max)));
6395 tree result = convert (gnu_type, wide_result);
6398 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6401 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6403 tree unsigned_type = gnat_type_for_size (precision, 1);
6404 tree wrapped_expr = convert
6405 (gnu_type, build_binary_op (code, unsigned_type,
6406 convert (unsigned_type, lhs),
6407 convert (unsigned_type, rhs)));
6409 tree result = convert
6410 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6412 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6413 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6414 tree check = build_binary_op
6415 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6416 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6417 integer_type_node, wrapped_expr, lhs));
6420 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6427 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6428 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6429 build_binary_op (MINUS_EXPR, gnu_type,
6432 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6433 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6434 build_binary_op (MINUS_EXPR, gnu_type,
6439 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6440 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6441 build_binary_op (PLUS_EXPR, gnu_type,
6444 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6445 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6446 build_binary_op (PLUS_EXPR, gnu_type,
6451 /* The check here is designed to be efficient if the rhs is constant,
6452 but it will work for any rhs by using integer division.
6453 Four different check expressions determine wether X * C overflows,
6456 C > 0 => X > type_max / C || X < type_min / C
6457 C == -1 => X == type_min
6458 C < -1 => X > type_min / C || X < type_max / C */
6460 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6461 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6463 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6464 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6465 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6466 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6467 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6469 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6470 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6471 build_int_cst (gnu_type, -1)),
6472 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6473 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6474 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6475 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6482 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6484 /* If we can fold the expression to a constant, just return it.
6485 The caller will deal with overflow, no need to generate a check. */
6486 if (TREE_CONSTANT (gnu_expr))
6489 check = fold_build3 (COND_EXPR, integer_type_node,
6490 rhs_lt_zero, check_neg, check_pos);
6492 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6495 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6496 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6497 which we have to check. GNAT_NODE is the GNAT node conveying the source
6498 location for which the error should be signaled. */
6501 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6503 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6504 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6505 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6506 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6508 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6509 This can for example happen when translating 'Val or 'Value. */
6510 if (gnu_compare_type == gnu_range_type)
6513 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6514 we can't do anything since we might be truncating the bounds. No
6515 check is needed in this case. */
6516 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6517 && (TYPE_PRECISION (gnu_compare_type)
6518 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6521 /* Checked expressions must be evaluated only once. */
6522 gnu_expr = protect_multiple_eval (gnu_expr);
6524 /* There's no good type to use here, so we might as well use
6525 integer_type_node. Note that the form of the check is
6526 (not (expr >= lo)) or (not (expr <= hi))
6527 the reason for this slightly convoluted form is that NaNs
6528 are not considered to be in range in the float case. */
6530 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6532 (build_binary_op (GE_EXPR, integer_type_node,
6533 convert (gnu_compare_type, gnu_expr),
6534 convert (gnu_compare_type, gnu_low))),
6536 (build_binary_op (LE_EXPR, integer_type_node,
6537 convert (gnu_compare_type, gnu_expr),
6538 convert (gnu_compare_type,
6540 gnu_expr, CE_Range_Check_Failed, gnat_node);
6543 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6544 we are about to index, GNU_EXPR is the index expression to be checked,
6545 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6546 has to be checked. Note that for index checking we cannot simply use the
6547 emit_range_check function (although very similar code needs to be generated
6548 in both cases) since for index checking the array type against which we are
6549 checking the indices may be unconstrained and consequently we need to get
6550 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6551 The place where we need to do that is in subprograms having unconstrained
6552 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6553 location for which the error should be signaled. */
6556 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6557 tree gnu_high, Node_Id gnat_node)
6559 tree gnu_expr_check;
6561 /* Checked expressions must be evaluated only once. */
6562 gnu_expr = protect_multiple_eval (gnu_expr);
6564 /* Must do this computation in the base type in case the expression's
6565 type is an unsigned subtypes. */
6566 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6568 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6569 the object we are handling. */
6570 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6571 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6573 /* There's no good type to use here, so we might as well use
6574 integer_type_node. */
6576 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6577 build_binary_op (LT_EXPR, integer_type_node,
6579 convert (TREE_TYPE (gnu_expr_check),
6581 build_binary_op (GT_EXPR, integer_type_node,
6583 convert (TREE_TYPE (gnu_expr_check),
6585 gnu_expr, CE_Index_Check_Failed, gnat_node);
6588 /* GNU_COND contains the condition corresponding to an access, discriminant or
6589 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6590 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6591 REASON is the code that says why the exception was raised. GNAT_NODE is
6592 the GNAT node conveying the source location for which the error should be
6596 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6599 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6601 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6602 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6603 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6606 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6607 we don't need to evaluate it just for the check. */
6608 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6613 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6614 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6615 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6616 float to integer conversion with truncation; otherwise round.
6617 GNAT_NODE is the GNAT node conveying the source location for which the
6618 error should be signaled. */
6621 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6622 bool rangep, bool truncatep, Node_Id gnat_node)
6624 tree gnu_type = get_unpadded_type (gnat_type);
6625 tree gnu_in_type = TREE_TYPE (gnu_expr);
6626 tree gnu_in_basetype = get_base_type (gnu_in_type);
6627 tree gnu_base_type = get_base_type (gnu_type);
6628 tree gnu_result = gnu_expr;
6630 /* If we are not doing any checks, the output is an integral type, and
6631 the input is not a floating type, just do the conversion. This
6632 shortcut is required to avoid problems with packed array types
6633 and simplifies code in all cases anyway. */
6634 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6635 && !FLOAT_TYPE_P (gnu_in_type))
6636 return convert (gnu_type, gnu_expr);
6638 /* First convert the expression to its base type. This
6639 will never generate code, but makes the tests below much simpler.
6640 But don't do this if converting from an integer type to an unconstrained
6641 array type since then we need to get the bounds from the original
6643 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6644 gnu_result = convert (gnu_in_basetype, gnu_result);
6646 /* If overflow checks are requested, we need to be sure the result will
6647 fit in the output base type. But don't do this if the input
6648 is integer and the output floating-point. */
6650 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6652 /* Ensure GNU_EXPR only gets evaluated once. */
6653 tree gnu_input = protect_multiple_eval (gnu_result);
6654 tree gnu_cond = integer_zero_node;
6655 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6656 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6657 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6658 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6660 /* Convert the lower bounds to signed types, so we're sure we're
6661 comparing them properly. Likewise, convert the upper bounds
6662 to unsigned types. */
6663 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6664 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6666 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6667 && !TYPE_UNSIGNED (gnu_in_basetype))
6668 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6670 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6671 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6673 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6674 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6676 /* Check each bound separately and only if the result bound
6677 is tighter than the bound on the input type. Note that all the
6678 types are base types, so the bounds must be constant. Also,
6679 the comparison is done in the base type of the input, which
6680 always has the proper signedness. First check for input
6681 integer (which means output integer), output float (which means
6682 both float), or mixed, in which case we always compare.
6683 Note that we have to do the comparison which would *fail* in the
6684 case of an error since if it's an FP comparison and one of the
6685 values is a NaN or Inf, the comparison will fail. */
6686 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6687 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6688 : (FLOAT_TYPE_P (gnu_base_type)
6689 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6690 TREE_REAL_CST (gnu_out_lb))
6694 (build_binary_op (GE_EXPR, integer_type_node,
6695 gnu_input, convert (gnu_in_basetype,
6698 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6699 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6700 : (FLOAT_TYPE_P (gnu_base_type)
6701 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6702 TREE_REAL_CST (gnu_in_lb))
6705 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6707 (build_binary_op (LE_EXPR, integer_type_node,
6709 convert (gnu_in_basetype,
6712 if (!integer_zerop (gnu_cond))
6713 gnu_result = emit_check (gnu_cond, gnu_input,
6714 CE_Overflow_Check_Failed, gnat_node);
6717 /* Now convert to the result base type. If this is a non-truncating
6718 float-to-integer conversion, round. */
6719 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6722 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6723 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6724 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6725 const struct real_format *fmt;
6727 /* The following calculations depend on proper rounding to even
6728 of each arithmetic operation. In order to prevent excess
6729 precision from spoiling this property, use the widest hardware
6730 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6732 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6734 /* FIXME: Should not have padding in the first place. */
6735 if (TREE_CODE (calc_type) == RECORD_TYPE
6736 && TYPE_IS_PADDING_P (calc_type))
6737 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6739 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6740 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6741 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6742 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6743 half_minus_pred_half);
6744 gnu_pred_half = build_real (calc_type, pred_half);
6746 /* If the input is strictly negative, subtract this value
6747 and otherwise add it from the input. For 0.5, the result
6748 is exactly between 1.0 and the machine number preceding 1.0
6749 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6750 will round to 1.0, while all other number with an absolute
6751 value less than 0.5 round to 0.0. For larger numbers exactly
6752 halfway between integers, rounding will always be correct as
6753 the true mathematical result will be closer to the higher
6754 integer compared to the lower one. So, this constant works
6755 for all floating-point numbers.
6757 The reason to use the same constant with subtract/add instead
6758 of a positive and negative constant is to allow the comparison
6759 to be scheduled in parallel with retrieval of the constant and
6760 conversion of the input to the calc_type (if necessary). */
6762 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6763 gnu_saved_result = save_expr (gnu_result);
6764 gnu_conv = convert (calc_type, gnu_saved_result);
6765 gnu_comp = build2 (GE_EXPR, integer_type_node,
6766 gnu_saved_result, gnu_zero);
6768 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6769 gnu_subtract_pred_half
6770 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6771 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6772 gnu_add_pred_half, gnu_subtract_pred_half);
6775 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6776 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6777 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6778 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6780 gnu_result = convert (gnu_base_type, gnu_result);
6782 /* Finally, do the range check if requested. Note that if the
6783 result type is a modular type, the range check is actually
6784 an overflow check. */
6787 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6788 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6789 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6791 return convert (gnu_type, gnu_result);
6794 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6797 smaller_packable_type_p (tree type, tree record_type)
6801 /* We're not interested in variants here. */
6802 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6805 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6806 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6809 size = TYPE_SIZE (type);
6810 rsize = TYPE_SIZE (record_type);
6812 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6815 return tree_int_cst_lt (size, rsize) != 0;
6818 /* Return true if GNU_EXPR can be directly addressed. This is the case
6819 unless it is an expression involving computation or if it involves a
6820 reference to a bitfield or to an object not sufficiently aligned for
6821 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6822 be directly addressed as an object of this type.
6824 *** Notes on addressability issues in the Ada compiler ***
6826 This predicate is necessary in order to bridge the gap between Gigi
6827 and the middle-end about addressability of GENERIC trees. A tree
6828 is said to be addressable if it can be directly addressed, i.e. if
6829 its address can be taken, is a multiple of the type's alignment on
6830 strict-alignment architectures and returns the first storage unit
6831 assigned to the object represented by the tree.
6833 In the C family of languages, everything is in practice addressable
6834 at the language level, except for bit-fields. This means that these
6835 compilers will take the address of any tree that doesn't represent
6836 a bit-field reference and expect the result to be the first storage
6837 unit assigned to the object. Even in cases where this will result
6838 in unaligned accesses at run time, nothing is supposed to be done
6839 and the program is considered as erroneous instead (see PR c/18287).
6841 The implicit assumptions made in the middle-end are in keeping with
6842 the C viewpoint described above:
6843 - the address of a bit-field reference is supposed to be never
6844 taken; the compiler (generally) will stop on such a construct,
6845 - any other tree is addressable if it is formally addressable,
6846 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6848 In Ada, the viewpoint is the opposite one: nothing is addressable
6849 at the language level unless explicitly declared so. This means
6850 that the compiler will both make sure that the trees representing
6851 references to addressable ("aliased" in Ada parlance) objects are
6852 addressable and make no real attempts at ensuring that the trees
6853 representing references to non-addressable objects are addressable.
6855 In the first case, Ada is effectively equivalent to C and handing
6856 down the direct result of applying ADDR_EXPR to these trees to the
6857 middle-end works flawlessly. In the second case, Ada cannot afford
6858 to consider the program as erroneous if the address of trees that
6859 are not addressable is requested for technical reasons, unlike C;
6860 as a consequence, the Ada compiler must arrange for either making
6861 sure that this address is not requested in the middle-end or for
6862 compensating by inserting temporaries if it is requested in Gigi.
6864 The first goal can be achieved because the middle-end should not
6865 request the address of non-addressable trees on its own; the only
6866 exception is for the invocation of low-level block operations like
6867 memcpy, for which the addressability requirements are lower since
6868 the type's alignment can be disregarded. In practice, this means
6869 that Gigi must make sure that such operations cannot be applied to
6870 non-BLKmode bit-fields.
6872 The second goal is achieved by means of the addressable_p predicate
6873 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6874 They will be turned during gimplification into proper temporaries
6875 whose address will be used in lieu of that of the original tree. */
6878 addressable_p (tree gnu_expr, tree gnu_type)
6880 /* The size of the real type of the object must not be smaller than
6881 that of the expected type, otherwise an indirect access in the
6882 latter type would be larger than the object. Only records need
6883 to be considered in practice. */
6885 && TREE_CODE (gnu_type) == RECORD_TYPE
6886 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6889 switch (TREE_CODE (gnu_expr))
6895 /* All DECLs are addressable: if they are in a register, we can force
6899 case UNCONSTRAINED_ARRAY_REF:
6910 /* We accept &COND_EXPR as soon as both operands are addressable and
6911 expect the outcome to be the address of the selected operand. */
6912 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6913 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6916 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6917 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6918 the field is sufficiently aligned, in case it is subject
6919 to a pragma Component_Alignment. But we don't need to
6920 check the alignment of the containing record, as it is
6921 guaranteed to be not smaller than that of its most
6922 aligned field that is not a bit-field. */
6923 && (!STRICT_ALIGNMENT
6924 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6925 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6926 /* The field of a padding record is always addressable. */
6927 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6928 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6930 case ARRAY_REF: case ARRAY_RANGE_REF:
6931 case REALPART_EXPR: case IMAGPART_EXPR:
6933 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6936 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6937 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6939 case VIEW_CONVERT_EXPR:
6941 /* This is addressable if we can avoid a copy. */
6942 tree type = TREE_TYPE (gnu_expr);
6943 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6944 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6945 && (!STRICT_ALIGNMENT
6946 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6947 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6948 || ((TYPE_MODE (type) == BLKmode
6949 || TYPE_MODE (inner_type) == BLKmode)
6950 && (!STRICT_ALIGNMENT
6951 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6952 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6953 || TYPE_ALIGN_OK (type)
6954 || TYPE_ALIGN_OK (inner_type))))
6955 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6963 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6964 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6965 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6968 process_type (Entity_Id gnat_entity)
6971 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6974 /* If we are to delay elaboration of this type, just do any
6975 elaborations needed for expressions within the declaration and
6976 make a dummy type entry for this node and its Full_View (if
6977 any) in case something points to it. Don't do this if it
6978 has already been done (the only way that can happen is if
6979 the private completion is also delayed). */
6980 if (Present (Freeze_Node (gnat_entity))
6981 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6982 && Present (Full_View (gnat_entity))
6983 && Freeze_Node (Full_View (gnat_entity))
6984 && !present_gnu_tree (Full_View (gnat_entity))))
6986 elaborate_entity (gnat_entity);
6990 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6991 save_gnu_tree (gnat_entity, gnu_decl, false);
6992 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6993 && Present (Full_View (gnat_entity)))
6994 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
7000 /* If we saved away a dummy type for this node it means that this
7001 made the type that corresponds to the full type of an incomplete
7002 type. Clear that type for now and then update the type in the
7006 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
7007 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
7009 save_gnu_tree (gnat_entity, NULL_TREE, false);
7012 /* Now fully elaborate the type. */
7013 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7014 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7016 /* If we have an old type and we've made pointers to this type,
7017 update those pointers. */
7019 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7020 TREE_TYPE (gnu_new));
7022 /* If this is a record type corresponding to a task or protected type
7023 that is a completion of an incomplete type, perform a similar update
7024 on the type. ??? Including protected types here is a guess. */
7025 if (IN (Ekind (gnat_entity), Record_Kind)
7026 && Is_Concurrent_Record_Type (gnat_entity)
7027 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7030 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7032 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7034 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7037 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7038 TREE_TYPE (gnu_new));
7042 /* GNAT_ENTITY is the type of the resulting constructors,
7043 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7044 and GNU_TYPE is the GCC type of the corresponding record.
7046 Return a CONSTRUCTOR to build the record. */
7049 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7051 tree gnu_list, gnu_result;
7053 /* We test for GNU_FIELD being empty in the case where a variant
7054 was the last thing since we don't take things off GNAT_ASSOC in
7055 that case. We check GNAT_ASSOC in case we have a variant, but it
7058 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7059 gnat_assoc = Next (gnat_assoc))
7061 Node_Id gnat_field = First (Choices (gnat_assoc));
7062 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7063 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7065 /* The expander is supposed to put a single component selector name
7066 in every record component association. */
7067 gcc_assert (No (Next (gnat_field)));
7069 /* Ignore fields that have Corresponding_Discriminants since we'll
7070 be setting that field in the parent. */
7071 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7072 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7075 /* Also ignore discriminants of Unchecked_Unions. */
7076 else if (Is_Unchecked_Union (gnat_entity)
7077 && Ekind (Entity (gnat_field)) == E_Discriminant)
7080 /* Before assigning a value in an aggregate make sure range checks
7081 are done if required. Then convert to the type of the field. */
7082 if (Do_Range_Check (Expression (gnat_assoc)))
7083 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7085 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7087 /* Add the field and expression to the list. */
7088 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7091 gnu_result = extract_values (gnu_list, gnu_type);
7093 #ifdef ENABLE_CHECKING
7097 /* Verify every entry in GNU_LIST was used. */
7098 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7099 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7106 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7107 the first element of an array aggregate. It may itself be an aggregate.
7108 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7109 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7110 for range checking. */
7113 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7114 Entity_Id gnat_component_type)
7116 tree gnu_expr_list = NULL_TREE;
7117 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7120 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7122 /* If the expression is itself an array aggregate then first build the
7123 innermost constructor if it is part of our array (multi-dimensional
7125 if (Nkind (gnat_expr) == N_Aggregate
7126 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7127 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7128 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7129 TREE_TYPE (gnu_array_type),
7130 gnat_component_type);
7133 gnu_expr = gnat_to_gnu (gnat_expr);
7135 /* Before assigning the element to the array, make sure it is
7137 if (Do_Range_Check (gnat_expr))
7138 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7142 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7145 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7148 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7151 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7152 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7153 of the associations that are from RECORD_TYPE. If we see an internal
7154 record, make a recursive call to fill it in as well. */
7157 extract_values (tree values, tree record_type)
7159 tree result = NULL_TREE;
7162 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7166 /* _Parent is an internal field, but may have values in the aggregate,
7167 so check for values first. */
7168 if ((tem = purpose_member (field, values)))
7170 value = TREE_VALUE (tem);
7171 TREE_ADDRESSABLE (tem) = 1;
7174 else if (DECL_INTERNAL_P (field))
7176 value = extract_values (values, TREE_TYPE (field));
7177 if (TREE_CODE (value) == CONSTRUCTOR
7178 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7182 /* If we have a record subtype, the names will match, but not the
7183 actual FIELD_DECLs. */
7184 for (tem = values; tem; tem = TREE_CHAIN (tem))
7185 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7187 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7188 TREE_ADDRESSABLE (tem) = 1;
7194 result = tree_cons (field, value, result);
7197 return gnat_build_constructor (record_type, nreverse (result));
7200 /* EXP is to be treated as an array or record. Handle the cases when it is
7201 an access object and perform the required dereferences. */
7204 maybe_implicit_deref (tree exp)
7206 /* If the type is a pointer, dereference it. */
7208 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7209 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7211 /* If we got a padded type, remove it too. */
7212 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7213 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7214 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7219 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7222 protect_multiple_eval (tree exp)
7224 tree type = TREE_TYPE (exp);
7226 /* If EXP has no side effects, we theoritically don't need to do anything.
7227 However, we may be recursively passed more and more complex expressions
7228 involving checks which will be reused multiple times and eventually be
7229 unshared for gimplification; in order to avoid a complexity explosion
7230 at that point, we protect any expressions more complex than a simple
7231 arithmetic expression. */
7232 if (!TREE_SIDE_EFFECTS (exp)
7233 && (CONSTANT_CLASS_P (exp)
7234 || !EXPRESSION_CLASS_P (skip_simple_arithmetic (exp))))
7237 /* If this is a conversion, protect what's inside the conversion.
7238 Similarly, if we're indirectly referencing something, we only
7239 need to protect the address since the data itself can't change
7240 in these situations. */
7241 if (TREE_CODE (exp) == NON_LVALUE_EXPR
7242 || CONVERT_EXPR_P (exp)
7243 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7244 || TREE_CODE (exp) == INDIRECT_REF
7245 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7246 return build1 (TREE_CODE (exp), type,
7247 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7249 /* If this is a fat pointer or something that can be placed into a
7250 register, just make a SAVE_EXPR. */
7251 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7252 return save_expr (exp);
7254 /* Otherwise, reference, protect the address and dereference. */
7256 build_unary_op (INDIRECT_REF, type,
7257 save_expr (build_unary_op (ADDR_EXPR,
7258 build_reference_type (type),
7262 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7263 handle our own nodes and we take extra arguments. FORCE says whether to
7264 force evaluation of everything. We set SUCCESS to true unless we walk
7265 through something we don't know how to stabilize. */
7268 maybe_stabilize_reference (tree ref, bool force, bool *success)
7270 tree type = TREE_TYPE (ref);
7271 enum tree_code code = TREE_CODE (ref);
7274 /* Assume we'll success unless proven otherwise. */
7283 /* No action is needed in this case. */
7289 case FIX_TRUNC_EXPR:
7290 case VIEW_CONVERT_EXPR:
7292 = build1 (code, type,
7293 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7298 case UNCONSTRAINED_ARRAY_REF:
7299 result = build1 (code, type,
7300 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7305 result = build3 (COMPONENT_REF, type,
7306 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7308 TREE_OPERAND (ref, 1), NULL_TREE);
7312 result = build3 (BIT_FIELD_REF, type,
7313 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7315 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7317 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7322 case ARRAY_RANGE_REF:
7323 result = build4 (code, type,
7324 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7326 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7328 NULL_TREE, NULL_TREE);
7332 result = gnat_stabilize_reference_1 (ref, force);
7336 /* This generates better code than the scheme in protect_multiple_eval
7337 because large objects will be returned via invisible reference in
7338 most ABIs so the temporary will directly be filled by the callee. */
7339 result = gnat_stabilize_reference_1 (ref, force);
7343 /* Constructors with 1 element are used extensively to formally
7344 convert objects to special wrapping types. */
7345 if (TREE_CODE (type) == RECORD_TYPE
7346 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7349 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7351 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7353 = build_constructor_single (type, index,
7354 gnat_stabilize_reference_1 (value,
7365 ref = error_mark_node;
7367 /* ... fall through to failure ... */
7369 /* If arg isn't a kind of lvalue we recognize, make no change.
7370 Caller should recognize the error for an invalid lvalue. */
7376 TREE_READONLY (result) = TREE_READONLY (ref);
7378 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7379 expression may not be sustained across some paths, such as the way via
7380 build1 for INDIRECT_REF. We re-populate those flags here for the general
7381 case, which is consistent with the GCC version of this routine.
7383 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7384 paths introduce side effects where there was none initially (e.g. calls
7385 to save_expr), and we also want to keep track of that. */
7387 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7388 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7393 /* Wrapper around maybe_stabilize_reference, for common uses without
7394 lvalue restrictions and without need to examine the success
7398 gnat_stabilize_reference (tree ref, bool force)
7401 return maybe_stabilize_reference (ref, force, &dummy);
7404 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7405 arg to force a SAVE_EXPR for everything. */
7408 gnat_stabilize_reference_1 (tree e, bool force)
7410 enum tree_code code = TREE_CODE (e);
7411 tree type = TREE_TYPE (e);
7414 /* We cannot ignore const expressions because it might be a reference
7415 to a const array but whose index contains side-effects. But we can
7416 ignore things that are actual constant or that already have been
7417 handled by this function. */
7419 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7422 switch (TREE_CODE_CLASS (code))
7424 case tcc_exceptional:
7426 case tcc_declaration:
7427 case tcc_comparison:
7429 case tcc_expression:
7432 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7433 fat pointer. This may be more efficient, but will also allow
7434 us to more easily find the match for the PLACEHOLDER_EXPR. */
7435 if (code == COMPONENT_REF
7436 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7437 result = build3 (COMPONENT_REF, type,
7438 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7440 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7441 else if (TREE_SIDE_EFFECTS (e) || force)
7442 return save_expr (e);
7448 /* Constants need no processing. In fact, we should never reach
7453 /* Recursively stabilize each operand. */
7454 result = build2 (code, type,
7455 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7456 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7461 /* Recursively stabilize each operand. */
7462 result = build1 (code, type,
7463 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7471 TREE_READONLY (result) = TREE_READONLY (e);
7473 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7474 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7478 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7479 location and false if it doesn't. In the former case, set the Gigi global
7480 variable REF_FILENAME to the simple debug file name as given by sinput. */
7483 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7485 if (Sloc == No_Location)
7488 if (Sloc <= Standard_Location)
7490 *locus = BUILTINS_LOCATION;
7495 Source_File_Index file = Get_Source_File_Index (Sloc);
7496 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7497 Column_Number column = Get_Column_Number (Sloc);
7498 struct line_map *map = &line_table->maps[file - 1];
7500 /* Translate the location according to the line-map.h formula. */
7501 *locus = map->start_location
7502 + ((line - map->to_line) << map->column_bits)
7503 + (column & ((1 << map->column_bits) - 1));
7507 = IDENTIFIER_POINTER
7509 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7514 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7515 don't do anything if it doesn't correspond to a source location. */
7518 set_expr_location_from_node (tree node, Node_Id gnat_node)
7522 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7525 SET_EXPR_LOCATION (node, locus);
7528 /* Return a colon-separated list of encodings contained in encoded Ada
7532 extract_encoding (const char *name)
7534 char *encoding = GGC_NEWVEC (char, strlen (name));
7535 get_encoding (name, encoding);
7539 /* Extract the Ada name from an encoded name. */
7542 decode_name (const char *name)
7544 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7545 __gnat_decode (name, decoded, 0);
7549 /* Post an error message. MSG is the error message, properly annotated.
7550 NODE is the node at which to post the error and the node to use for the
7551 "&" substitution. */
7554 post_error (const char *msg, Node_Id node)
7556 String_Template temp;
7559 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7560 fp.Array = msg, fp.Bounds = &temp;
7562 Error_Msg_N (fp, node);
7565 /* Similar, but NODE is the node at which to post the error and ENT
7566 is the node to use for the "&" substitution. */
7569 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7571 String_Template temp;
7574 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7575 fp.Array = msg, fp.Bounds = &temp;
7577 Error_Msg_NE (fp, node, ent);
7580 /* Similar, but NODE is the node at which to post the error, ENT is the node
7581 to use for the "&" substitution, and N is the number to use for the ^. */
7584 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7586 String_Template temp;
7589 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7590 fp.Array = msg, fp.Bounds = &temp;
7591 Error_Msg_Uint_1 = UI_From_Int (n);
7594 Error_Msg_NE (fp, node, ent);
7597 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7598 number to write. If the tree represents a constant that fits within
7599 a host integer, the text inside curly brackets in MSG will be output
7600 (presumably including a '^'). Otherwise that text will not be output
7601 and the text inside square brackets will be output instead. */
7604 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7606 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7607 String_Template temp = {1, 0};
7609 char start_yes, end_yes, start_no, end_no;
7613 fp.Array = newmsg, fp.Bounds = &temp;
7615 if (host_integerp (t, 1)
7616 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7619 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7623 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7624 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7627 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7629 for (p = msg, q = newmsg; *p; p++)
7631 if (*p == start_yes)
7632 for (p++; *p != end_yes; p++)
7634 else if (*p == start_no)
7635 for (p++; *p != end_no; p++)
7643 temp.High_Bound = strlen (newmsg);
7645 Error_Msg_NE (fp, node, ent);
7648 /* Similar to post_error_ne_tree, except that NUM is a second
7649 integer to write in the message. */
7652 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7655 Error_Msg_Uint_2 = UI_From_Int (num);
7656 post_error_ne_tree (msg, node, ent, t);
7659 /* Initialize the table that maps GNAT codes to GCC codes for simple
7660 binary and unary operations. */
7663 init_code_table (void)
7665 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7666 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7668 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7669 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7670 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7671 gnu_codes[N_Op_Eq] = EQ_EXPR;
7672 gnu_codes[N_Op_Ne] = NE_EXPR;
7673 gnu_codes[N_Op_Lt] = LT_EXPR;
7674 gnu_codes[N_Op_Le] = LE_EXPR;
7675 gnu_codes[N_Op_Gt] = GT_EXPR;
7676 gnu_codes[N_Op_Ge] = GE_EXPR;
7677 gnu_codes[N_Op_Add] = PLUS_EXPR;
7678 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7679 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7680 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7681 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7682 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7683 gnu_codes[N_Op_Abs] = ABS_EXPR;
7684 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7685 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7686 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7687 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7688 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7689 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7692 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7696 get_exception_label (char kind)
7698 if (kind == N_Raise_Constraint_Error)
7699 return TREE_VALUE (gnu_constraint_error_label_stack);
7700 else if (kind == N_Raise_Storage_Error)
7701 return TREE_VALUE (gnu_storage_error_label_stack);
7702 else if (kind == N_Raise_Program_Error)
7703 return TREE_VALUE (gnu_program_error_label_stack);
7708 #include "gt-ada-trans.h"