1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2010, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
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, bool, bool);
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, false);
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), gnu_stmts;
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 /* We should have a BIND_EXPR but it may not have any statements in it.
642 If it doesn't have any, we have nothing to do except for setting the
643 flag on the GNAT node. Otherwise, process the function as others. */
644 gnu_stmts = gnu_body;
645 if (TREE_CODE (gnu_stmts) == BIND_EXPR)
646 gnu_stmts = BIND_EXPR_BODY (gnu_stmts);
647 if (!gnu_stmts || !STATEMENT_LIST_HEAD (gnu_stmts))
648 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
651 begin_subprog_body (info->elab_proc);
652 end_subprog_body (gnu_body);
656 /* We cannot track the location of errors past this point. */
657 error_gnat_node = Empty;
660 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
661 is the type that will be used for GNAT_NODE in the translated GNU tree.
662 CONSTANT indicates whether the underlying object represented by GNAT_NODE
663 is constant in the Ada sense, ALIASED whether it is aliased (but the latter
664 doesn't affect the outcome if CONSTANT is not true).
666 The function climbs up the GNAT tree starting from the node and returns 1
667 upon encountering a node that effectively requires an lvalue downstream.
668 It returns int instead of bool to facilitate usage in non-purely binary
672 lvalue_required_p (Node_Id gnat_node, tree gnu_type, bool constant,
675 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
677 switch (Nkind (gnat_parent))
682 case N_Attribute_Reference:
684 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
685 return id == Attr_Address
687 || id == Attr_Unchecked_Access
688 || id == Attr_Unrestricted_Access
689 || id == Attr_Bit_Position
690 || id == Attr_Position
691 || id == Attr_First_Bit
692 || id == Attr_Last_Bit
696 case N_Parameter_Association:
697 case N_Function_Call:
698 case N_Procedure_Call_Statement:
699 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
701 case N_Indexed_Component:
702 /* Only the array expression can require an lvalue. */
703 if (Prefix (gnat_parent) != gnat_node)
706 /* ??? Consider that referencing an indexed component with a
707 non-constant index forces the whole aggregate to memory.
708 Note that N_Integer_Literal is conservative, any static
709 expression in the RM sense could probably be accepted. */
710 for (gnat_temp = First (Expressions (gnat_parent));
712 gnat_temp = Next (gnat_temp))
713 if (Nkind (gnat_temp) != N_Integer_Literal)
716 /* ... fall through ... */
719 /* Only the array expression can require an lvalue. */
720 if (Prefix (gnat_parent) != gnat_node)
723 aliased |= Has_Aliased_Components (Etype (gnat_node));
724 return lvalue_required_p (gnat_parent, gnu_type, constant, aliased);
726 case N_Selected_Component:
727 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
728 return lvalue_required_p (gnat_parent, gnu_type, constant, aliased);
730 case N_Object_Renaming_Declaration:
731 /* We need to make a real renaming only if the constant object is
732 aliased or if we may use a renaming pointer; otherwise we can
733 optimize and return the rvalue. We make an exception if the object
734 is an identifier since in this case the rvalue can be propagated
735 attached to the CONST_DECL. */
738 /* This should match the constant case of the renaming code. */
740 (Underlying_Type (Etype (Name (gnat_parent))))
741 || Nkind (Name (gnat_parent)) == N_Identifier);
743 case N_Object_Declaration:
744 /* We cannot use a constructor if this is an atomic object because
745 the actual assignment might end up being done component-wise. */
746 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
747 && Is_Atomic (Defining_Entity (gnat_parent));
749 case N_Assignment_Statement:
750 /* We cannot use a constructor if the LHS is an atomic object because
751 the actual assignment might end up being done component-wise. */
752 return (Name (gnat_parent) == gnat_node
753 || (Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
754 && Is_Atomic (Entity (Name (gnat_parent)))));
756 case N_Unchecked_Type_Conversion:
757 /* Returning 0 is very likely correct but we get better code if we
758 go through the conversion. */
759 return lvalue_required_p (gnat_parent,
760 get_unpadded_type (Etype (gnat_parent)),
770 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
771 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
772 to where we should place the result type. */
775 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
777 Node_Id gnat_temp, gnat_temp_type;
778 tree gnu_result, gnu_result_type;
780 /* Whether we should require an lvalue for GNAT_NODE. Needed in
781 specific circumstances only, so evaluated lazily. < 0 means
782 unknown, > 0 means known true, 0 means known false. */
783 int require_lvalue = -1;
785 /* If GNAT_NODE is a constant, whether we should use the initialization
786 value instead of the constant entity, typically for scalars with an
787 address clause when the parent doesn't require an lvalue. */
788 bool use_constant_initializer = false;
790 /* If the Etype of this node does not equal the Etype of the Entity,
791 something is wrong with the entity map, probably in generic
792 instantiation. However, this does not apply to types. Since we sometime
793 have strange Ekind's, just do this test for objects. Also, if the Etype of
794 the Entity is private, the Etype of the N_Identifier is allowed to be the
795 full type and also we consider a packed array type to be the same as the
796 original type. Similarly, a class-wide type is equivalent to a subtype of
797 itself. Finally, if the types are Itypes, one may be a copy of the other,
798 which is also legal. */
799 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
800 ? gnat_node : Entity (gnat_node));
801 gnat_temp_type = Etype (gnat_temp);
803 gcc_assert (Etype (gnat_node) == gnat_temp_type
804 || (Is_Packed (gnat_temp_type)
805 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
806 || (Is_Class_Wide_Type (Etype (gnat_node)))
807 || (IN (Ekind (gnat_temp_type), Private_Kind)
808 && Present (Full_View (gnat_temp_type))
809 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
810 || (Is_Packed (Full_View (gnat_temp_type))
811 && (Etype (gnat_node)
812 == Packed_Array_Type (Full_View
813 (gnat_temp_type))))))
814 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
815 || !(Ekind (gnat_temp) == E_Variable
816 || Ekind (gnat_temp) == E_Component
817 || Ekind (gnat_temp) == E_Constant
818 || Ekind (gnat_temp) == E_Loop_Parameter
819 || IN (Ekind (gnat_temp), Formal_Kind)));
821 /* If this is a reference to a deferred constant whose partial view is an
822 unconstrained private type, the proper type is on the full view of the
823 constant, not on the full view of the type, which may be unconstrained.
825 This may be a reference to a type, for example in the prefix of the
826 attribute Position, generated for dispatching code (see Make_DT in
827 exp_disp,adb). In that case we need the type itself, not is parent,
828 in particular if it is a derived type */
829 if (Is_Private_Type (gnat_temp_type)
830 && Has_Unknown_Discriminants (gnat_temp_type)
831 && Ekind (gnat_temp) == E_Constant
832 && Present (Full_View (gnat_temp)))
834 gnat_temp = Full_View (gnat_temp);
835 gnat_temp_type = Etype (gnat_temp);
839 /* We want to use the Actual_Subtype if it has already been elaborated,
840 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
842 if ((Ekind (gnat_temp) == E_Constant
843 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
844 && !(Is_Array_Type (Etype (gnat_temp))
845 && Present (Packed_Array_Type (Etype (gnat_temp))))
846 && Present (Actual_Subtype (gnat_temp))
847 && present_gnu_tree (Actual_Subtype (gnat_temp)))
848 gnat_temp_type = Actual_Subtype (gnat_temp);
850 gnat_temp_type = Etype (gnat_node);
853 /* Expand the type of this identifier first, in case it is an enumeral
854 literal, which only get made when the type is expanded. There is no
855 order-of-elaboration issue here. */
856 gnu_result_type = get_unpadded_type (gnat_temp_type);
858 /* If this is a non-imported scalar constant with an address clause,
859 retrieve the value instead of a pointer to be dereferenced unless
860 an lvalue is required. This is generally more efficient and actually
861 required if this is a static expression because it might be used
862 in a context where a dereference is inappropriate, such as a case
863 statement alternative or a record discriminant. There is no possible
864 volatile-ness short-circuit here since Volatile constants must bei
866 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
867 && !Is_Imported (gnat_temp)
868 && Present (Address_Clause (gnat_temp)))
870 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
871 Is_Aliased (gnat_temp));
872 use_constant_initializer = !require_lvalue;
875 if (use_constant_initializer)
877 /* If this is a deferred constant, the initializer is attached to
879 if (Present (Full_View (gnat_temp)))
880 gnat_temp = Full_View (gnat_temp);
882 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
885 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
887 /* If we are in an exception handler, force this variable into memory to
888 ensure optimization does not remove stores that appear redundant but are
889 actually needed in case an exception occurs.
891 ??? Note that we need not do this if the variable is declared within the
892 handler, only if it is referenced in the handler and declared in an
893 enclosing block, but we have no way of testing that right now.
895 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
896 here, but it can now be removed by the Tree aliasing machinery if the
897 address of the variable is never taken. All we can do is to make the
898 variable volatile, which might incur the generation of temporaries just
899 to access the memory in some circumstances. This can be avoided for
900 variables of non-constant size because they are automatically allocated
901 to memory. There might be no way of allocating a proper temporary for
902 them in any case. We only do this for SJLJ though. */
903 if (TREE_VALUE (gnu_except_ptr_stack)
904 && TREE_CODE (gnu_result) == VAR_DECL
905 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
906 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
908 /* Some objects (such as parameters passed by reference, globals of
909 variable size, and renamed objects) actually represent the address
910 of the object. In that case, we must do the dereference. Likewise,
911 deal with parameters to foreign convention subprograms. */
912 if (DECL_P (gnu_result)
913 && (DECL_BY_REF_P (gnu_result)
914 || (TREE_CODE (gnu_result) == PARM_DECL
915 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
917 const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result);
920 if (TREE_CODE (gnu_result) == PARM_DECL
921 && DECL_BY_COMPONENT_PTR_P (gnu_result))
923 = build_unary_op (INDIRECT_REF, NULL_TREE,
924 convert (build_pointer_type (gnu_result_type),
927 /* If it's a renaming pointer and we are at the right binding level,
928 we can reference the renamed object directly, since the renamed
929 expression has been protected against multiple evaluations. */
930 else if (TREE_CODE (gnu_result) == VAR_DECL
931 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result))
932 && (!DECL_RENAMING_GLOBAL_P (gnu_result)
933 || global_bindings_p ()))
934 gnu_result = renamed_obj;
936 /* Return the underlying CST for a CONST_DECL like a few lines below,
937 after dereferencing in this case. */
938 else if (TREE_CODE (gnu_result) == CONST_DECL)
939 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
940 DECL_INITIAL (gnu_result));
943 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
946 TREE_READONLY (gnu_result) = 1;
949 /* The GNAT tree has the type of a function as the type of its result. Also
950 use the type of the result if the Etype is a subtype which is nominally
951 unconstrained. But remove any padding from the resulting type. */
952 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
953 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
955 gnu_result_type = TREE_TYPE (gnu_result);
956 if (TYPE_IS_PADDING_P (gnu_result_type))
957 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
960 /* If we have a constant declaration and its initializer at hand,
961 try to return the latter to avoid the need to call fold in lots
962 of places and the need of elaboration code if this Id is used as
963 an initializer itself. */
964 if (TREE_CONSTANT (gnu_result)
965 && DECL_P (gnu_result)
966 && DECL_INITIAL (gnu_result))
969 = (TREE_CODE (gnu_result) == CONST_DECL
970 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
972 /* If there is a corresponding variable, we only want to return
973 the CST value if an lvalue is not required. Evaluate this
974 now if we have not already done so. */
975 if (object && require_lvalue < 0)
976 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
977 Is_Aliased (gnat_temp));
979 if (!object || !require_lvalue)
980 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
983 *gnu_result_type_p = gnu_result_type;
987 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
988 any statements we generate. */
991 Pragma_to_gnu (Node_Id gnat_node)
994 tree gnu_result = alloc_stmt_list ();
996 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
998 if (type_annotate_only
999 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
1002 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
1004 case Pragma_Inspection_Point:
1005 /* Do nothing at top level: all such variables are already viewable. */
1006 if (global_bindings_p ())
1009 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
1010 Present (gnat_temp);
1011 gnat_temp = Next (gnat_temp))
1013 Node_Id gnat_expr = Expression (gnat_temp);
1014 tree gnu_expr = gnat_to_gnu (gnat_expr);
1016 enum machine_mode mode;
1017 tree asm_constraint = NULL_TREE;
1018 #ifdef ASM_COMMENT_START
1022 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1023 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1025 /* Use the value only if it fits into a normal register,
1026 otherwise use the address. */
1027 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1028 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1029 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1030 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1033 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1035 #ifdef ASM_COMMENT_START
1036 comment = concat (ASM_COMMENT_START,
1037 " inspection point: ",
1038 Get_Name_String (Chars (gnat_expr)),
1039 use_address ? " address" : "",
1042 asm_constraint = build_string (strlen (comment), comment);
1045 gnu_expr = build5 (ASM_EXPR, void_type_node,
1049 (build_tree_list (NULL_TREE,
1050 build_string (1, "g")),
1051 gnu_expr, NULL_TREE),
1052 NULL_TREE, NULL_TREE);
1053 ASM_VOLATILE_P (gnu_expr) = 1;
1054 set_expr_location_from_node (gnu_expr, gnat_node);
1055 append_to_statement_list (gnu_expr, &gnu_result);
1059 case Pragma_Optimize:
1060 switch (Chars (Expression
1061 (First (Pragma_Argument_Associations (gnat_node)))))
1063 case Name_Time: case Name_Space:
1065 post_error ("insufficient -O value?", gnat_node);
1070 post_error ("must specify -O0?", gnat_node);
1078 case Pragma_Reviewable:
1079 if (write_symbols == NO_DEBUG)
1080 post_error ("must specify -g?", gnat_node);
1087 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1088 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1089 where we should place the result type. ATTRIBUTE is the attribute ID. */
1092 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1094 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1095 tree gnu_type = TREE_TYPE (gnu_prefix);
1096 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1097 bool prefix_unused = false;
1099 /* If the input is a NULL_EXPR, make a new one. */
1100 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1102 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1103 *gnu_result_type_p = gnu_result_type;
1104 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1111 /* These are just conversions since representation clauses for
1112 enumeration types are handled in the front-end. */
1114 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1115 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1116 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1117 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1118 checkp, checkp, true, gnat_node);
1124 /* These just add or subtract the constant 1 since representation
1125 clauses for enumeration types are handled in the front-end. */
1126 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1127 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1129 if (Do_Range_Check (First (Expressions (gnat_node))))
1131 gnu_expr = protect_multiple_eval (gnu_expr);
1134 (build_binary_op (EQ_EXPR, integer_type_node,
1136 attribute == Attr_Pred
1137 ? TYPE_MIN_VALUE (gnu_result_type)
1138 : TYPE_MAX_VALUE (gnu_result_type)),
1139 gnu_expr, CE_Range_Check_Failed, gnat_node);
1143 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1144 gnu_result_type, gnu_expr,
1145 convert (gnu_result_type, integer_one_node));
1149 case Attr_Unrestricted_Access:
1150 /* Conversions don't change addresses but can cause us to miss the
1151 COMPONENT_REF case below, so strip them off. */
1152 gnu_prefix = remove_conversions (gnu_prefix,
1153 !Must_Be_Byte_Aligned (gnat_node));
1155 /* If we are taking 'Address of an unconstrained object, this is the
1156 pointer to the underlying array. */
1157 if (attribute == Attr_Address)
1158 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1160 /* If we are building a static dispatch table, we have to honor
1161 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1162 with the C++ ABI. We do it in the non-static case as well,
1163 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1164 else if (TARGET_VTABLE_USES_DESCRIPTORS
1165 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1167 tree gnu_field, gnu_list = NULL_TREE, t;
1168 /* Descriptors can only be built here for top-level functions. */
1169 bool build_descriptor = (global_bindings_p () != 0);
1172 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1174 /* If we're not going to build the descriptor, we have to retrieve
1175 the one which will be built by the linker (or by the compiler
1176 later if a static chain is requested). */
1177 if (!build_descriptor)
1179 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1180 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1182 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1185 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1186 i < TARGET_VTABLE_USES_DESCRIPTORS;
1187 gnu_field = TREE_CHAIN (gnu_field), i++)
1189 if (build_descriptor)
1191 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1192 build_int_cst (NULL_TREE, i));
1193 TREE_CONSTANT (t) = 1;
1196 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1197 gnu_field, NULL_TREE);
1199 gnu_list = tree_cons (gnu_field, t, gnu_list);
1202 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1206 /* ... fall through ... */
1209 case Attr_Unchecked_Access:
1210 case Attr_Code_Address:
1211 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1213 = build_unary_op (((attribute == Attr_Address
1214 || attribute == Attr_Unrestricted_Access)
1215 && !Must_Be_Byte_Aligned (gnat_node))
1216 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1217 gnu_result_type, gnu_prefix);
1219 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1220 don't try to build a trampoline. */
1221 if (attribute == Attr_Code_Address)
1223 for (gnu_expr = gnu_result;
1224 CONVERT_EXPR_P (gnu_expr);
1225 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1226 TREE_CONSTANT (gnu_expr) = 1;
1228 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1229 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1232 /* For other address attributes applied to a nested function,
1233 find an inner ADDR_EXPR and annotate it so that we can issue
1234 a useful warning with -Wtrampolines. */
1235 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1237 for (gnu_expr = gnu_result;
1238 CONVERT_EXPR_P (gnu_expr);
1239 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1242 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1243 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1245 set_expr_location_from_node (gnu_expr, gnat_node);
1247 /* Check that we're not violating the No_Implicit_Dynamic_Code
1248 restriction. Be conservative if we don't know anything
1249 about the trampoline strategy for the target. */
1250 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1255 case Attr_Pool_Address:
1258 tree gnu_ptr = gnu_prefix;
1260 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1262 /* If this is an unconstrained array, we know the object has been
1263 allocated with the template in front of the object. So compute
1264 the template address. */
1265 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1267 = convert (build_pointer_type
1268 (TYPE_OBJECT_RECORD_TYPE
1269 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1272 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1273 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1274 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1276 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1277 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1278 tree gnu_byte_offset
1279 = convert (sizetype,
1280 size_diffop (size_zero_node, gnu_pos));
1281 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1283 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1284 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1285 gnu_ptr, gnu_byte_offset);
1288 gnu_result = convert (gnu_result_type, gnu_ptr);
1293 case Attr_Object_Size:
1294 case Attr_Value_Size:
1295 case Attr_Max_Size_In_Storage_Elements:
1296 gnu_expr = gnu_prefix;
1298 /* Remove NOPs and conversions between original and packable version
1299 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1300 to see if a COMPONENT_REF was involved. */
1301 while (TREE_CODE (gnu_expr) == NOP_EXPR
1302 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1303 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1304 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1306 && TYPE_NAME (TREE_TYPE (gnu_expr))
1307 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1308 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1310 gnu_prefix = remove_conversions (gnu_prefix, true);
1311 prefix_unused = true;
1312 gnu_type = TREE_TYPE (gnu_prefix);
1314 /* Replace an unconstrained array type with the type of the underlying
1315 array. We can't do this with a call to maybe_unconstrained_array
1316 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1317 use the record type that will be used to allocate the object and its
1319 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1321 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1322 if (attribute != Attr_Max_Size_In_Storage_Elements)
1323 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1326 /* If we're looking for the size of a field, return the field size.
1327 Otherwise, if the prefix is an object, or if we're looking for
1328 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1329 GCC size of the type. Otherwise, it is the RM size of the type. */
1330 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1331 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1332 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1333 || attribute == Attr_Object_Size
1334 || attribute == Attr_Max_Size_In_Storage_Elements)
1336 /* If the prefix is an object of a padded type, the GCC size isn't
1337 relevant to the programmer. Normally what we want is the RM size,
1338 which was set from the specified size, but if it was not set, we
1339 want the size of the field. Using the MAX of those two produces
1340 the right result in all cases. Don't use the size of the field
1341 if it's self-referential, since that's never what's wanted. */
1342 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1343 && TYPE_IS_PADDING_P (gnu_type)
1344 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1346 gnu_result = rm_size (gnu_type);
1347 if (!CONTAINS_PLACEHOLDER_P
1348 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1350 = size_binop (MAX_EXPR, gnu_result,
1351 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1353 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1355 Node_Id gnat_deref = Prefix (gnat_node);
1356 Node_Id gnat_actual_subtype
1357 = Actual_Designated_Subtype (gnat_deref);
1359 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1361 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1362 && Present (gnat_actual_subtype))
1364 tree gnu_actual_obj_type
1365 = gnat_to_gnu_type (gnat_actual_subtype);
1367 = build_unc_object_type_from_ptr (gnu_ptr_type,
1368 gnu_actual_obj_type,
1369 get_identifier ("SIZE"));
1372 gnu_result = TYPE_SIZE (gnu_type);
1375 gnu_result = TYPE_SIZE (gnu_type);
1378 gnu_result = rm_size (gnu_type);
1380 gcc_assert (gnu_result);
1382 /* Deal with a self-referential size by returning the maximum size for
1383 a type and by qualifying the size with the object for 'Size of an
1385 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1387 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1388 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1390 gnu_result = max_size (gnu_result, true);
1393 /* If the type contains a template, subtract its size. */
1394 if (TREE_CODE (gnu_type) == RECORD_TYPE
1395 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1396 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1397 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1399 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1401 if (attribute == Attr_Max_Size_In_Storage_Elements)
1402 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1403 gnu_result, bitsize_unit_node);
1406 case Attr_Alignment:
1410 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1411 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1412 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1414 gnu_type = TREE_TYPE (gnu_prefix);
1415 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1416 prefix_unused = true;
1418 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1419 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1422 Node_Id gnat_prefix = Prefix (gnat_node);
1423 Entity_Id gnat_type = Etype (gnat_prefix);
1424 unsigned int double_align;
1425 bool is_capped_double, align_clause;
1427 /* If the default alignment of "double" or larger scalar types is
1428 specifically capped and there is an alignment clause neither
1429 on the type nor on the prefix itself, return the cap. */
1430 if ((double_align = double_float_alignment) > 0)
1432 = is_double_float_or_array (gnat_type, &align_clause);
1433 else if ((double_align = double_scalar_alignment) > 0)
1435 = is_double_scalar_or_array (gnat_type, &align_clause);
1437 is_capped_double = align_clause = false;
1439 if (is_capped_double
1440 && Nkind (gnat_prefix) == N_Identifier
1441 && Present (Alignment_Clause (Entity (gnat_prefix))))
1442 align_clause = true;
1444 if (is_capped_double && !align_clause)
1445 align = double_align;
1447 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1450 gnu_result = size_int (align);
1456 case Attr_Range_Length:
1457 prefix_unused = true;
1459 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1461 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1463 if (attribute == Attr_First)
1464 gnu_result = TYPE_MIN_VALUE (gnu_type);
1465 else if (attribute == Attr_Last)
1466 gnu_result = TYPE_MAX_VALUE (gnu_type);
1470 (MAX_EXPR, get_base_type (gnu_result_type),
1472 (PLUS_EXPR, get_base_type (gnu_result_type),
1473 build_binary_op (MINUS_EXPR,
1474 get_base_type (gnu_result_type),
1475 convert (gnu_result_type,
1476 TYPE_MAX_VALUE (gnu_type)),
1477 convert (gnu_result_type,
1478 TYPE_MIN_VALUE (gnu_type))),
1479 convert (gnu_result_type, integer_one_node)),
1480 convert (gnu_result_type, integer_zero_node));
1485 /* ... fall through ... */
1489 int Dimension = (Present (Expressions (gnat_node))
1490 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1492 struct parm_attr_d *pa = NULL;
1493 Entity_Id gnat_param = Empty;
1495 /* Make sure any implicit dereference gets done. */
1496 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1497 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1498 /* We treat unconstrained array In parameters specially. */
1499 if (Nkind (Prefix (gnat_node)) == N_Identifier
1500 && !Is_Constrained (Etype (Prefix (gnat_node)))
1501 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1502 gnat_param = Entity (Prefix (gnat_node));
1503 gnu_type = TREE_TYPE (gnu_prefix);
1504 prefix_unused = true;
1505 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1507 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1512 for (ndim = 1, gnu_type_temp = gnu_type;
1513 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1514 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1515 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1518 Dimension = ndim + 1 - Dimension;
1521 for (i = 1; i < Dimension; i++)
1522 gnu_type = TREE_TYPE (gnu_type);
1524 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1526 /* When not optimizing, look up the slot associated with the parameter
1527 and the dimension in the cache and create a new one on failure. */
1528 if (!optimize && Present (gnat_param))
1530 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1531 if (pa->id == gnat_param && pa->dim == Dimension)
1536 pa = GGC_CNEW (struct parm_attr_d);
1537 pa->id = gnat_param;
1538 pa->dim = Dimension;
1539 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1543 /* Return the cached expression or build a new one. */
1544 if (attribute == Attr_First)
1546 if (pa && pa->first)
1548 gnu_result = pa->first;
1553 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1556 else if (attribute == Attr_Last)
1560 gnu_result = pa->last;
1565 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1568 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1570 if (pa && pa->length)
1572 gnu_result = pa->length;
1577 /* We used to compute the length as max (hb - lb + 1, 0),
1578 which could overflow for some cases of empty arrays, e.g.
1579 when lb == index_type'first. We now compute the length as
1580 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1581 much rarer cases, for extremely large arrays we expect
1582 never to encounter in practice. In addition, the former
1583 computation required the use of potentially constraining
1584 signed arithmetic while the latter doesn't. Note that
1585 the comparison must be done in the original index type,
1586 to avoid any overflow during the conversion. */
1587 tree comp_type = get_base_type (gnu_result_type);
1588 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1589 tree lb = TYPE_MIN_VALUE (index_type);
1590 tree hb = TYPE_MAX_VALUE (index_type);
1592 = build_binary_op (PLUS_EXPR, comp_type,
1593 build_binary_op (MINUS_EXPR,
1595 convert (comp_type, hb),
1596 convert (comp_type, lb)),
1597 convert (comp_type, integer_one_node));
1599 = build_cond_expr (comp_type,
1600 build_binary_op (GE_EXPR,
1604 convert (comp_type, integer_zero_node));
1608 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1609 handling. Note that these attributes could not have been used on
1610 an unconstrained array type. */
1611 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1613 /* Cache the expression we have just computed. Since we want to do it
1614 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1615 create the temporary. */
1619 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1620 TREE_SIDE_EFFECTS (gnu_result) = 1;
1621 if (attribute == Attr_First)
1622 pa->first = gnu_result;
1623 else if (attribute == Attr_Last)
1624 pa->last = gnu_result;
1626 pa->length = gnu_result;
1629 /* Set the source location onto the predicate of the condition in the
1630 'Length case but do not do it if the expression is cached to avoid
1631 messing up the debug info. */
1632 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1633 && TREE_CODE (gnu_result) == COND_EXPR
1634 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1635 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1641 case Attr_Bit_Position:
1643 case Attr_First_Bit:
1647 HOST_WIDE_INT bitsize;
1648 HOST_WIDE_INT bitpos;
1650 tree gnu_field_bitpos;
1651 tree gnu_field_offset;
1653 enum machine_mode mode;
1654 int unsignedp, volatilep;
1656 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1657 gnu_prefix = remove_conversions (gnu_prefix, true);
1658 prefix_unused = true;
1660 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1661 the result is 0. Don't allow 'Bit on a bare component, though. */
1662 if (attribute == Attr_Bit
1663 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1664 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1666 gnu_result = integer_zero_node;
1671 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1672 || (attribute == Attr_Bit_Position
1673 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1675 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1676 &mode, &unsignedp, &volatilep, false);
1678 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1680 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1681 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1683 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1684 TREE_CODE (gnu_inner) == COMPONENT_REF
1685 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1686 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1689 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1690 bit_position (TREE_OPERAND (gnu_inner, 1)));
1692 = size_binop (PLUS_EXPR, gnu_field_offset,
1693 byte_position (TREE_OPERAND (gnu_inner, 1)));
1696 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1698 gnu_field_bitpos = bit_position (gnu_prefix);
1699 gnu_field_offset = byte_position (gnu_prefix);
1703 gnu_field_bitpos = bitsize_zero_node;
1704 gnu_field_offset = size_zero_node;
1710 gnu_result = gnu_field_offset;
1713 case Attr_First_Bit:
1715 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1719 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1720 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1721 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1722 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1726 case Attr_Bit_Position:
1727 gnu_result = gnu_field_bitpos;
1731 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1733 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1740 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1741 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1743 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1744 gnu_result = build_binary_op (attribute == Attr_Min
1745 ? MIN_EXPR : MAX_EXPR,
1746 gnu_result_type, gnu_lhs, gnu_rhs);
1750 case Attr_Passed_By_Reference:
1751 gnu_result = size_int (default_pass_by_ref (gnu_type)
1752 || must_pass_by_ref (gnu_type));
1753 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1756 case Attr_Component_Size:
1757 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1758 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1759 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1761 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1762 gnu_type = TREE_TYPE (gnu_prefix);
1764 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1765 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1767 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1768 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1769 gnu_type = TREE_TYPE (gnu_type);
1771 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1773 /* Note this size cannot be self-referential. */
1774 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1775 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1776 prefix_unused = true;
1779 case Attr_Null_Parameter:
1780 /* This is just a zero cast to the pointer type for our prefix and
1782 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1784 = build_unary_op (INDIRECT_REF, NULL_TREE,
1785 convert (build_pointer_type (gnu_result_type),
1786 integer_zero_node));
1787 TREE_PRIVATE (gnu_result) = 1;
1790 case Attr_Mechanism_Code:
1793 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1795 prefix_unused = true;
1796 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1797 if (Present (Expressions (gnat_node)))
1799 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1801 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1802 i--, gnat_obj = Next_Formal (gnat_obj))
1806 code = Mechanism (gnat_obj);
1807 if (code == Default)
1808 code = ((present_gnu_tree (gnat_obj)
1809 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1810 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1812 && (DECL_BY_COMPONENT_PTR_P
1813 (get_gnu_tree (gnat_obj))))))
1814 ? By_Reference : By_Copy);
1815 gnu_result = convert (gnu_result_type, size_int (- code));
1820 /* Say we have an unimplemented attribute. Then set the value to be
1821 returned to be a zero and hope that's something we can convert to
1822 the type of this attribute. */
1823 post_error ("unimplemented attribute", gnat_node);
1824 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1825 gnu_result = integer_zero_node;
1829 /* If this is an attribute where the prefix was unused, force a use of it if
1830 it has a side-effect. But don't do it if the prefix is just an entity
1831 name. However, if an access check is needed, we must do it. See second
1832 example in AARM 11.6(5.e). */
1833 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1834 && !Is_Entity_Name (Prefix (gnat_node)))
1835 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1836 gnu_prefix, gnu_result);
1838 *gnu_result_type_p = gnu_result_type;
1842 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1843 to a GCC tree, which is returned. */
1846 Case_Statement_to_gnu (Node_Id gnat_node)
1852 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1853 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1855 /* The range of values in a case statement is determined by the rules in
1856 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1857 of the expression. One exception arises in the case of a simple name that
1858 is parenthesized. This still has the Etype of the name, but since it is
1859 not a name, para 7 does not apply, and we need to go to the base type.
1860 This is the only case where parenthesization affects the dynamic
1861 semantics (i.e. the range of possible values at runtime that is covered
1862 by the others alternative.
1864 Another exception is if the subtype of the expression is non-static. In
1865 that case, we also have to use the base type. */
1866 if (Paren_Count (Expression (gnat_node)) != 0
1867 || !Is_OK_Static_Subtype (Underlying_Type
1868 (Etype (Expression (gnat_node)))))
1869 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1871 /* We build a SWITCH_EXPR that contains the code with interspersed
1872 CASE_LABEL_EXPRs for each label. */
1874 push_stack (&gnu_switch_label_stack, NULL_TREE,
1875 create_artificial_label (input_location));
1876 start_stmt_group ();
1877 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1878 Present (gnat_when);
1879 gnat_when = Next_Non_Pragma (gnat_when))
1881 Node_Id gnat_choice;
1882 int choices_added = 0;
1884 /* First compile all the different case choices for the current WHEN
1886 for (gnat_choice = First (Discrete_Choices (gnat_when));
1887 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1889 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1891 switch (Nkind (gnat_choice))
1894 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1895 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1898 case N_Subtype_Indication:
1899 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1900 (Constraint (gnat_choice))));
1901 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1902 (Constraint (gnat_choice))));
1906 case N_Expanded_Name:
1907 /* This represents either a subtype range or a static value of
1908 some kind; Ekind says which. */
1909 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1911 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1913 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1914 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1918 /* ... fall through ... */
1920 case N_Character_Literal:
1921 case N_Integer_Literal:
1922 gnu_low = gnat_to_gnu (gnat_choice);
1925 case N_Others_Choice:
1932 /* If the case value is a subtype that raises Constraint_Error at
1933 run-time because of a wrong bound, then gnu_low or gnu_high is
1934 not translated into an INTEGER_CST. In such a case, we need
1935 to ensure that the when statement is not added in the tree,
1936 otherwise it will crash the gimplifier. */
1937 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1938 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1940 add_stmt_with_node (build3
1941 (CASE_LABEL_EXPR, void_type_node,
1943 create_artificial_label (input_location)),
1949 /* Push a binding level here in case variables are declared as we want
1950 them to be local to this set of statements instead of to the block
1951 containing the Case statement. */
1952 if (choices_added > 0)
1954 add_stmt (build_stmt_group (Statements (gnat_when), true));
1955 add_stmt (build1 (GOTO_EXPR, void_type_node,
1956 TREE_VALUE (gnu_switch_label_stack)));
1960 /* Now emit a definition of the label all the cases branched to. */
1961 add_stmt (build1 (LABEL_EXPR, void_type_node,
1962 TREE_VALUE (gnu_switch_label_stack)));
1963 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1964 end_stmt_group (), NULL_TREE);
1965 pop_stack (&gnu_switch_label_stack);
1970 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1971 to a GCC tree, which is returned. */
1974 Loop_Statement_to_gnu (Node_Id gnat_node)
1976 /* ??? It would be nice to use "build" here, but there's no build5. */
1977 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1978 NULL_TREE, NULL_TREE, NULL_TREE);
1979 tree gnu_loop_var = NULL_TREE;
1980 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1981 tree gnu_cond_expr = NULL_TREE;
1984 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1985 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1986 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label (input_location);
1987 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1988 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1989 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1991 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1992 N_Exit_Statement can find it. */
1993 push_stack (&gnu_loop_label_stack, NULL_TREE,
1994 LOOP_STMT_LABEL (gnu_loop_stmt));
1996 /* Set the condition under which the loop must keep going.
1997 For the case "LOOP .... END LOOP;" the condition is always true. */
1998 if (No (gnat_iter_scheme))
2001 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2002 else if (Present (Condition (gnat_iter_scheme)))
2003 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2004 = gnat_to_gnu (Condition (gnat_iter_scheme));
2006 /* Otherwise we have an iteration scheme and the condition is given by
2007 the bounds of the subtype of the iteration variable. */
2010 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2011 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2012 Entity_Id gnat_type = Etype (gnat_loop_var);
2013 tree gnu_type = get_unpadded_type (gnat_type);
2014 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
2015 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
2016 tree gnu_first, gnu_last, gnu_limit;
2017 enum tree_code update_code, end_code;
2018 tree gnu_base_type = get_base_type (gnu_type);
2020 /* We must disable modulo reduction for the loop variable, if any,
2021 in order for the loop comparison to be effective. */
2022 if (Reverse_Present (gnat_loop_spec))
2024 gnu_first = gnu_high;
2026 update_code = MINUS_NOMOD_EXPR;
2028 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
2032 gnu_first = gnu_low;
2033 gnu_last = gnu_high;
2034 update_code = PLUS_NOMOD_EXPR;
2036 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
2039 /* We know the loop variable will not overflow if GNU_LAST is a constant
2040 and is not equal to GNU_LIMIT. If it might overflow, we have to move
2041 the limit test to the end of the loop. In that case, we have to test
2042 for an empty loop outside the loop. */
2043 if (TREE_CODE (gnu_last) != INTEGER_CST
2044 || TREE_CODE (gnu_limit) != INTEGER_CST
2045 || tree_int_cst_equal (gnu_last, gnu_limit))
2048 = build3 (COND_EXPR, void_type_node,
2049 build_binary_op (LE_EXPR, integer_type_node,
2051 NULL_TREE, alloc_stmt_list ());
2052 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2055 /* Open a new nesting level that will surround the loop to declare the
2056 loop index variable. */
2057 start_stmt_group ();
2060 /* Declare the loop index and set it to its initial value. */
2061 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2062 if (DECL_BY_REF_P (gnu_loop_var))
2063 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2065 /* The loop variable might be a padded type, so use `convert' to get a
2066 reference to the inner variable if so. */
2067 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2069 /* Set either the top or bottom exit condition as appropriate depending
2070 on whether or not we know an overflow cannot occur. */
2072 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2073 = build_binary_op (NE_EXPR, integer_type_node,
2074 gnu_loop_var, gnu_last);
2076 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2077 = build_binary_op (end_code, integer_type_node,
2078 gnu_loop_var, gnu_last);
2080 LOOP_STMT_UPDATE (gnu_loop_stmt)
2081 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2083 build_binary_op (update_code,
2084 TREE_TYPE (gnu_loop_var),
2086 convert (TREE_TYPE (gnu_loop_var),
2087 integer_one_node)));
2088 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2092 /* If the loop was named, have the name point to this loop. In this case,
2093 the association is not a ..._DECL node, but the end label from this
2095 if (Present (Identifier (gnat_node)))
2096 save_gnu_tree (Entity (Identifier (gnat_node)),
2097 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2099 /* Make the loop body into its own block, so any allocated storage will be
2100 released every iteration. This is needed for stack allocation. */
2101 LOOP_STMT_BODY (gnu_loop_stmt)
2102 = build_stmt_group (Statements (gnat_node), true);
2104 /* If we declared a variable, then we are in a statement group for that
2105 declaration. Add the LOOP_STMT to it and make that the "loop". */
2108 add_stmt (gnu_loop_stmt);
2110 gnu_loop_stmt = end_stmt_group ();
2113 /* If we have an outer COND_EXPR, that's our result and this loop is its
2114 "true" statement. Otherwise, the result is the LOOP_STMT. */
2117 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2118 gnu_result = gnu_cond_expr;
2119 recalculate_side_effects (gnu_cond_expr);
2122 gnu_result = gnu_loop_stmt;
2124 pop_stack (&gnu_loop_label_stack);
2129 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2130 handler for the current function. */
2132 /* This is implemented by issuing a call to the appropriate VMS specific
2133 builtin. To avoid having VMS specific sections in the global gigi decls
2134 array, we maintain the decls of interest here. We can't declare them
2135 inside the function because we must mark them never to be GC'd, which we
2136 can only do at the global level. */
2138 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2139 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2142 establish_gnat_vms_condition_handler (void)
2144 tree establish_stmt;
2146 /* Elaborate the required decls on the first call. Check on the decl for
2147 the gnat condition handler to decide, as this is one we create so we are
2148 sure that it will be non null on subsequent calls. The builtin decl is
2149 looked up so remains null on targets where it is not implemented yet. */
2150 if (gnat_vms_condition_handler_decl == NULL_TREE)
2152 vms_builtin_establish_handler_decl
2154 (get_identifier ("__builtin_establish_vms_condition_handler"));
2156 gnat_vms_condition_handler_decl
2157 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2159 build_function_type_list (integer_type_node,
2163 NULL_TREE, 0, 1, 1, 0, Empty);
2165 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2166 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2169 /* Do nothing if the establish builtin is not available, which might happen
2170 on targets where the facility is not implemented. */
2171 if (vms_builtin_establish_handler_decl == NULL_TREE)
2175 = build_call_1_expr (vms_builtin_establish_handler_decl,
2177 (ADDR_EXPR, NULL_TREE,
2178 gnat_vms_condition_handler_decl));
2180 add_stmt (establish_stmt);
2183 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2184 don't return anything. */
2187 Subprogram_Body_to_gnu (Node_Id gnat_node)
2189 /* Defining identifier of a parameter to the subprogram. */
2190 Entity_Id gnat_param;
2191 /* The defining identifier for the subprogram body. Note that if a
2192 specification has appeared before for this body, then the identifier
2193 occurring in that specification will also be a defining identifier and all
2194 the calls to this subprogram will point to that specification. */
2195 Entity_Id gnat_subprog_id
2196 = (Present (Corresponding_Spec (gnat_node))
2197 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2198 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2199 tree gnu_subprog_decl;
2200 /* Its RESULT_DECL node. */
2201 tree gnu_result_decl;
2202 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2203 tree gnu_subprog_type;
2206 VEC(parm_attr,gc) *cache;
2208 /* If this is a generic object or if it has been eliminated,
2210 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2211 || Ekind (gnat_subprog_id) == E_Generic_Function
2212 || Is_Eliminated (gnat_subprog_id))
2215 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2216 the already-elaborated tree node. However, if this subprogram had its
2217 elaboration deferred, we will already have made a tree node for it. So
2218 treat it as not being defined in that case. Such a subprogram cannot
2219 have an address clause or a freeze node, so this test is safe, though it
2220 does disable some otherwise-useful error checking. */
2222 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2223 Acts_As_Spec (gnat_node)
2224 && !present_gnu_tree (gnat_subprog_id));
2225 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
2226 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2228 /* If the function returns by invisible reference, make it explicit in the
2229 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
2230 if (TREE_ADDRESSABLE (gnu_subprog_type))
2232 TREE_TYPE (gnu_result_decl)
2233 = build_reference_type (TREE_TYPE (gnu_result_decl));
2234 relayout_decl (gnu_result_decl);
2237 /* Propagate the debug mode. */
2238 if (!Needs_Debug_Info (gnat_subprog_id))
2239 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2241 /* Set the line number in the decl to correspond to that of the body so that
2242 the line number notes are written correctly. */
2243 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2245 /* Initialize the information structure for the function. */
2246 allocate_struct_function (gnu_subprog_decl, false);
2247 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2248 = GGC_CNEW (struct language_function);
2250 begin_subprog_body (gnu_subprog_decl);
2251 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2253 /* If there are Out parameters, we need to ensure that the return statement
2254 properly copies them out. We do this by making a new block and converting
2255 any inner return into a goto to a label at the end of the block. */
2256 push_stack (&gnu_return_label_stack, NULL_TREE,
2257 gnu_cico_list ? create_artificial_label (input_location)
2260 /* Get a tree corresponding to the code for the subprogram. */
2261 start_stmt_group ();
2264 /* See if there are any parameters for which we don't yet have GCC entities.
2265 These must be for Out parameters for which we will be making VAR_DECL
2266 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2267 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2268 the order of the parameters. */
2269 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2270 Present (gnat_param);
2271 gnat_param = Next_Formal_With_Extras (gnat_param))
2272 if (!present_gnu_tree (gnat_param))
2274 /* Skip any entries that have been already filled in; they must
2275 correspond to In Out parameters. */
2276 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2277 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2280 /* Do any needed references for padded types. */
2281 TREE_VALUE (gnu_cico_list)
2282 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2283 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2286 /* On VMS, establish our condition handler to possibly turn a condition into
2287 the corresponding exception if the subprogram has a foreign convention or
2290 To ensure proper execution of local finalizations on condition instances,
2291 we must turn a condition into the corresponding exception even if there
2292 is no applicable Ada handler, and need at least one condition handler per
2293 possible call chain involving GNAT code. OTOH, establishing the handler
2294 has a cost so we want to minimize the number of subprograms into which
2295 this happens. The foreign or exported condition is expected to satisfy
2296 all the constraints. */
2297 if (TARGET_ABI_OPEN_VMS
2298 && (Has_Foreign_Convention (gnat_subprog_id)
2299 || Is_Exported (gnat_subprog_id)))
2300 establish_gnat_vms_condition_handler ();
2302 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2304 /* Generate the code of the subprogram itself. A return statement will be
2305 present and any Out parameters will be handled there. */
2306 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2308 gnu_result = end_stmt_group ();
2310 /* If we populated the parameter attributes cache, we need to make sure
2311 that the cached expressions are evaluated on all possible paths. */
2312 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2315 struct parm_attr_d *pa;
2318 start_stmt_group ();
2320 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2323 add_stmt_with_node (pa->first, gnat_node);
2325 add_stmt_with_node (pa->last, gnat_node);
2327 add_stmt_with_node (pa->length, gnat_node);
2330 add_stmt (gnu_result);
2331 gnu_result = end_stmt_group ();
2334 /* If we are dealing with a return from an Ada procedure with parameters
2335 passed by copy-in/copy-out, we need to return a record containing the
2336 final values of these parameters. If the list contains only one entry,
2337 return just that entry though.
2339 For a full description of the copy-in/copy-out parameter mechanism, see
2340 the part of the gnat_to_gnu_entity routine dealing with the translation
2343 We need to make a block that contains the definition of that label and
2344 the copying of the return value. It first contains the function, then
2345 the label and copy statement. */
2346 if (TREE_VALUE (gnu_return_label_stack))
2350 start_stmt_group ();
2352 add_stmt (gnu_result);
2353 add_stmt (build1 (LABEL_EXPR, void_type_node,
2354 TREE_VALUE (gnu_return_label_stack)));
2356 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2357 if (list_length (gnu_cico_list) == 1)
2358 gnu_retval = TREE_VALUE (gnu_cico_list);
2360 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2363 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
2364 End_Label (Handled_Statement_Sequence (gnat_node)));
2366 gnu_result = end_stmt_group ();
2369 pop_stack (&gnu_return_label_stack);
2371 /* Set the end location. */
2373 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2374 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2375 : Sloc (gnat_node)),
2376 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2378 end_subprog_body (gnu_result);
2380 /* Finally annotate the parameters and disconnect the trees for parameters
2381 that we have turned into variables since they are now unusable. */
2382 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2383 Present (gnat_param);
2384 gnat_param = Next_Formal_With_Extras (gnat_param))
2386 tree gnu_param = get_gnu_tree (gnat_param);
2387 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
2388 DECL_BY_REF_P (gnu_param));
2389 if (TREE_CODE (gnu_param) == VAR_DECL)
2390 save_gnu_tree (gnat_param, NULL_TREE, false);
2393 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2394 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2396 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2399 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2400 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2401 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2402 If GNU_TARGET is non-null, this must be a function call and the result
2403 of the call is to be placed into that object. */
2406 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2408 /* The GCC node corresponding to the GNAT subprogram name. This can either
2409 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2410 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2412 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
2413 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2414 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
2415 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
2416 Entity_Id gnat_formal;
2417 Node_Id gnat_actual;
2418 tree gnu_actual_list = NULL_TREE;
2419 tree gnu_name_list = NULL_TREE;
2420 tree gnu_before_list = NULL_TREE;
2421 tree gnu_after_list = NULL_TREE;
2424 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2426 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
2427 all our args first. */
2428 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
2430 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
2431 gnat_node, N_Raise_Program_Error);
2433 for (gnat_actual = First_Actual (gnat_node);
2434 Present (gnat_actual);
2435 gnat_actual = Next_Actual (gnat_actual))
2436 add_stmt (gnat_to_gnu (gnat_actual));
2438 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2440 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2441 return build1 (NULL_EXPR, TREE_TYPE (gnu_subprog_type), call_expr);
2447 /* The only way we can be making a call via an access type is if Name is an
2448 explicit dereference. In that case, get the list of formal args from the
2449 type the access type is pointing to. Otherwise, get the formals from the
2450 entity being called. */
2451 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2452 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2453 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2454 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2455 gnat_formal = Empty;
2457 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2459 /* Create the list of the actual parameters as GCC expects it, namely a
2460 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
2461 is an expression and the TREE_PURPOSE field is null. But skip Out
2462 parameters not passed by reference and that need not be copied in. */
2463 for (gnat_actual = First_Actual (gnat_node);
2464 Present (gnat_actual);
2465 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2466 gnat_actual = Next_Actual (gnat_actual))
2468 tree gnu_formal = present_gnu_tree (gnat_formal)
2469 ? get_gnu_tree (gnat_formal) : NULL_TREE;
2470 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2471 /* We must suppress conversions that can cause the creation of a
2472 temporary in the Out or In Out case because we need the real
2473 object in this case, either to pass its address if it's passed
2474 by reference or as target of the back copy done after the call
2475 if it uses the copy-in copy-out mechanism. We do it in the In
2476 case too, except for an unchecked conversion because it alone
2477 can cause the actual to be misaligned and the addressability
2478 test is applied to the real object. */
2479 bool suppress_type_conversion
2480 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2481 && Ekind (gnat_formal) != E_In_Parameter)
2482 || (Nkind (gnat_actual) == N_Type_Conversion
2483 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2484 Node_Id gnat_name = suppress_type_conversion
2485 ? Expression (gnat_actual) : gnat_actual;
2486 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2489 /* If it's possible we may need to use this expression twice, make sure
2490 that any side-effects are handled via SAVE_EXPRs; likewise if we need
2491 to force side-effects before the call.
2492 ??? This is more conservative than we need since we don't need to do
2493 this for pass-by-ref with no conversion. */
2494 if (Ekind (gnat_formal) != E_In_Parameter)
2495 gnu_name = gnat_stabilize_reference (gnu_name, true);
2497 /* If we are passing a non-addressable parameter by reference, pass the
2498 address of a copy. In the Out or In Out case, set up to copy back
2499 out after the call. */
2501 && (DECL_BY_REF_P (gnu_formal)
2502 || (TREE_CODE (gnu_formal) == PARM_DECL
2503 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2504 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2505 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2506 && !addressable_p (gnu_name, gnu_name_type))
2508 tree gnu_copy = gnu_name;
2510 /* If the type is by_reference, a copy is not allowed. */
2511 if (Is_By_Reference_Type (Etype (gnat_formal)))
2513 ("misaligned actual cannot be passed by reference", gnat_actual);
2515 /* For users of Starlet we issue a warning because the interface
2516 apparently assumes that by-ref parameters outlive the procedure
2517 invocation. The code still will not work as intended, but we
2518 cannot do much better since low-level parts of the back-end
2519 would allocate temporaries at will because of the misalignment
2520 if we did not do so here. */
2521 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2524 ("?possible violation of implicit assumption", gnat_actual);
2526 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2527 Entity (Name (gnat_node)));
2528 post_error_ne ("?because of misalignment of &", gnat_actual,
2532 /* If the actual type of the object is already the nominal type,
2533 we have nothing to do, except if the size is self-referential
2534 in which case we'll remove the unpadding below. */
2535 if (TREE_TYPE (gnu_name) == gnu_name_type
2536 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2539 /* Otherwise remove unpadding from the object and reset the copy. */
2540 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2541 && TYPE_IS_PADDING_P
2542 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
2543 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2545 /* Otherwise convert to the nominal type of the object if it's
2546 a record type. There are several cases in which we need to
2547 make the temporary using this type instead of the actual type
2548 of the object if they are distinct, because the expectations
2549 of the callee would otherwise not be met:
2550 - if it's a justified modular type,
2551 - if the actual type is a smaller packable version of it. */
2552 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2553 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2554 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2556 gnu_name = convert (gnu_name_type, gnu_name);
2558 /* Make a SAVE_EXPR to both properly account for potential side
2559 effects and handle the creation of a temporary. Special code
2560 in gnat_gimplify_expr ensures that the same temporary is used
2561 as the object and copied back after the call if needed. */
2562 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2563 TREE_SIDE_EFFECTS (gnu_name) = 1;
2565 /* Set up to move the copy back to the original if needed. */
2566 if (Ekind (gnat_formal) != E_In_Parameter)
2568 tree stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2570 set_expr_location_from_node (stmt, gnat_node);
2571 append_to_statement_list (stmt, &gnu_after_list);
2575 /* Start from the real object and build the actual. */
2576 gnu_actual = gnu_name;
2578 /* If this was a procedure call, we may not have removed any padding.
2579 So do it here for the part we will use as an input, if any. */
2580 if (Ekind (gnat_formal) != E_Out_Parameter
2581 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2582 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2585 /* Do any needed conversions for the actual and make sure that it is
2586 in range of the formal's type. */
2587 if (suppress_type_conversion)
2589 /* Put back the conversion we suppressed above in the computation
2590 of the real object. Note that we treat a conversion between
2591 aggregate types as if it is an unchecked conversion here. */
2593 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2595 (Nkind (gnat_actual)
2596 == N_Unchecked_Type_Conversion)
2597 && No_Truncation (gnat_actual));
2599 if (Ekind (gnat_formal) != E_Out_Parameter
2600 && Do_Range_Check (gnat_actual))
2601 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2606 if (Ekind (gnat_formal) != E_Out_Parameter
2607 && Do_Range_Check (gnat_actual))
2608 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2611 /* We may have suppressed a conversion to the Etype of the actual
2612 since the parent is a procedure call. So put it back here.
2613 ??? We use the reverse order compared to the case above because
2614 of an awkward interaction with the check. */
2615 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2616 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2620 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2621 gnu_actual = convert (gnu_formal_type, gnu_actual);
2623 /* Unless this is an In parameter, we must remove any justified modular
2624 building from GNU_NAME to get an lvalue. */
2625 if (Ekind (gnat_formal) != E_In_Parameter
2626 && TREE_CODE (gnu_name) == CONSTRUCTOR
2627 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2628 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2629 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2632 /* If we have not saved a GCC object for the formal, it means it is an
2633 Out parameter not passed by reference and that need not be copied in.
2634 Otherwise, first see if the PARM_DECL is passed by reference. */
2636 && TREE_CODE (gnu_formal) == PARM_DECL
2637 && DECL_BY_REF_P (gnu_formal))
2639 if (Ekind (gnat_formal) != E_In_Parameter)
2641 /* In Out or Out parameters passed by reference don't use the
2642 copy-in copy-out mechanism so the address of the real object
2643 must be passed to the function. */
2644 gnu_actual = gnu_name;
2646 /* If we have a padded type, be sure we've removed padding. */
2647 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2648 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2649 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2652 /* If we have the constructed subtype of an aliased object
2653 with an unconstrained nominal subtype, the type of the
2654 actual includes the template, although it is formally
2655 constrained. So we need to convert it back to the real
2656 constructed subtype to retrieve the constrained part
2657 and takes its address. */
2658 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2659 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2660 && TREE_CODE (gnu_actual) != SAVE_EXPR
2661 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2662 && Is_Array_Type (Etype (gnat_actual)))
2663 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2667 /* The symmetry of the paths to the type of an entity is broken here
2668 since arguments don't know that they will be passed by ref. */
2669 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2670 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2673 && TREE_CODE (gnu_formal) == PARM_DECL
2674 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2676 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2677 gnu_actual = maybe_implicit_deref (gnu_actual);
2678 gnu_actual = maybe_unconstrained_array (gnu_actual);
2680 if (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 this is 'Null_Parameter, pass a zero descriptor. */
2701 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2702 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2703 && TREE_PRIVATE (gnu_actual))
2705 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
2707 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2708 fill_vms_descriptor (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 if (TREE_CODE (gnu_actual) == INDIRECT_REF
2725 && TREE_PRIVATE (gnu_actual)
2726 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
2727 && TREE_CODE (gnu_size) == INTEGER_CST
2728 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
2730 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2731 convert (gnat_type_for_size
2732 (TREE_INT_CST_LOW (gnu_size), 1),
2736 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2739 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2742 gnu_call = build_call_list (TREE_TYPE (gnu_subprog_type), gnu_subprog_addr,
2743 nreverse (gnu_actual_list));
2744 set_expr_location_from_node (gnu_call, gnat_node);
2746 /* If it's a function call, the result is the call expression unless a target
2747 is specified, in which case we copy the result into the target and return
2748 the assignment statement. */
2749 if (Nkind (gnat_node) == N_Function_Call)
2751 tree gnu_result = gnu_call;
2752 enum tree_code op_code;
2754 /* If the function returns an unconstrained array or by direct reference,
2755 we have to dereference the pointer. */
2756 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
2757 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
2758 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2762 /* ??? If the return type has non-constant size, then force the
2763 return slot optimization as we would not be able to generate
2764 a temporary. That's what has been done historically. */
2765 if (TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_subprog_type))))
2766 op_code = MODIFY_EXPR;
2768 op_code = INIT_EXPR;
2771 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_result);
2774 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2779 /* If this is the case where the GNAT tree contains a procedure call but the
2780 Ada procedure has copy-in/copy-out parameters, then the special parameter
2781 passing mechanism must be used. */
2782 if (TYPE_CI_CO_LIST (gnu_subprog_type))
2784 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2785 in copy out parameters. */
2786 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2787 int length = list_length (scalar_return_list);
2793 /* The call sequence must contain one and only one call, even though
2794 the function is const or pure. So force a SAVE_EXPR. */
2795 gnu_call = build1 (SAVE_EXPR, TREE_TYPE (gnu_call), gnu_call);
2796 TREE_SIDE_EFFECTS (gnu_call) = 1;
2797 gnu_name_list = nreverse (gnu_name_list);
2799 /* If any of the names had side-effects, ensure they are all
2800 evaluated before the call. */
2801 for (gnu_name = gnu_name_list;
2803 gnu_name = TREE_CHAIN (gnu_name))
2804 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2805 append_to_statement_list (TREE_VALUE (gnu_name),
2809 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2810 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2812 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2814 for (gnat_actual = First_Actual (gnat_node);
2815 Present (gnat_actual);
2816 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2817 gnat_actual = Next_Actual (gnat_actual))
2818 /* If we are dealing with a copy in copy out parameter, we must
2819 retrieve its value from the record returned in the call. */
2820 if (!(present_gnu_tree (gnat_formal)
2821 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2822 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2823 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2824 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2825 || (DECL_BY_DESCRIPTOR_P
2826 (get_gnu_tree (gnat_formal))))))))
2827 && Ekind (gnat_formal) != E_In_Parameter)
2829 /* Get the value to assign to this Out or In Out parameter. It is
2830 either the result of the function if there is only a single such
2831 parameter or the appropriate field from the record returned. */
2835 : build_component_ref (gnu_call, NULL_TREE,
2836 TREE_PURPOSE (scalar_return_list),
2839 /* If the actual is a conversion, get the inner expression, which
2840 will be the real destination, and convert the result to the
2841 type of the actual parameter. */
2843 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2845 /* If the result is a padded type, remove the padding. */
2846 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2848 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
2851 /* If the actual is a type conversion, the real target object is
2852 denoted by the inner Expression and we need to convert the
2853 result to the associated type.
2854 We also need to convert our gnu assignment target to this type
2855 if the corresponding GNU_NAME was constructed from the GNAT
2856 conversion node and not from the inner Expression. */
2857 if (Nkind (gnat_actual) == N_Type_Conversion)
2860 = convert_with_check
2861 (Etype (Expression (gnat_actual)), gnu_result,
2862 Do_Overflow_Check (gnat_actual),
2863 Do_Range_Check (Expression (gnat_actual)),
2864 Float_Truncate (gnat_actual), gnat_actual);
2866 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2867 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2870 /* Unchecked conversions as actuals for Out parameters are not
2871 allowed in user code because they are not variables, but do
2872 occur in front-end expansions. The associated GNU_NAME is
2873 always obtained from the inner expression in such cases. */
2874 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2875 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2877 No_Truncation (gnat_actual));
2880 if (Do_Range_Check (gnat_actual))
2882 = emit_range_check (gnu_result, Etype (gnat_actual),
2885 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2886 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2887 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2890 /* Undo wrapping of boolean rvalues. */
2891 if (TREE_CODE (gnu_actual) == NE_EXPR
2892 && TREE_CODE (get_base_type (TREE_TYPE (gnu_actual)))
2894 && integer_zerop (TREE_OPERAND (gnu_actual, 1)))
2895 gnu_actual = TREE_OPERAND (gnu_actual, 0);
2896 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2897 gnu_actual, gnu_result);
2898 set_expr_location_from_node (gnu_result, gnat_node);
2899 append_to_statement_list (gnu_result, &gnu_before_list);
2900 scalar_return_list = TREE_CHAIN (scalar_return_list);
2901 gnu_name_list = TREE_CHAIN (gnu_name_list);
2905 append_to_statement_list (gnu_call, &gnu_before_list);
2907 append_to_statement_list (gnu_after_list, &gnu_before_list);
2909 return gnu_before_list;
2912 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2913 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2916 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2918 tree gnu_jmpsave_decl = NULL_TREE;
2919 tree gnu_jmpbuf_decl = NULL_TREE;
2920 /* If just annotating, ignore all EH and cleanups. */
2921 bool gcc_zcx = (!type_annotate_only
2922 && Present (Exception_Handlers (gnat_node))
2923 && Exception_Mechanism == Back_End_Exceptions);
2925 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2926 && Exception_Mechanism == Setjmp_Longjmp);
2927 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2928 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2929 tree gnu_inner_block; /* The statement(s) for the block itself. */
2934 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2935 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2936 add_cleanup, and when we leave the binding, end_stmt_group will create
2937 the TRY_FINALLY_EXPR.
2939 ??? The region level calls down there have been specifically put in place
2940 for a ZCX context and currently the order in which things are emitted
2941 (region/handlers) is different from the SJLJ case. Instead of putting
2942 other calls with different conditions at other places for the SJLJ case,
2943 it seems cleaner to reorder things for the SJLJ case and generalize the
2944 condition to make it not ZCX specific.
2946 If there are any exceptions or cleanup processing involved, we need an
2947 outer statement group (for Setjmp_Longjmp) and binding level. */
2948 if (binding_for_block)
2950 start_stmt_group ();
2954 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2955 area for address of previous buffer. Do this first since we need to have
2956 the setjmp buf known for any decls in this block. */
2959 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2960 NULL_TREE, jmpbuf_ptr_type,
2961 build_call_0_expr (get_jmpbuf_decl),
2962 false, false, false, false, NULL,
2964 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2966 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2967 because of the unstructured form of EH used by setjmp_longjmp, there
2968 might be forward edges going to __builtin_setjmp receivers on which
2969 it is uninitialized, although they will never be actually taken. */
2970 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2971 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2972 NULL_TREE, jmpbuf_type,
2973 NULL_TREE, false, false, false, false,
2975 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2977 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2979 /* When we exit this block, restore the saved value. */
2980 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2981 End_Label (gnat_node));
2984 /* If we are to call a function when exiting this block, add a cleanup
2985 to the binding level we made above. Note that add_cleanup is FIFO
2986 so we must register this cleanup after the EH cleanup just above. */
2988 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2989 End_Label (gnat_node));
2991 /* Now build the tree for the declarations and statements inside this block.
2992 If this is SJLJ, set our jmp_buf as the current buffer. */
2993 start_stmt_group ();
2996 add_stmt (build_call_1_expr (set_jmpbuf_decl,
2997 build_unary_op (ADDR_EXPR, NULL_TREE,
3000 if (Present (First_Real_Statement (gnat_node)))
3001 process_decls (Statements (gnat_node), Empty,
3002 First_Real_Statement (gnat_node), true, true);
3004 /* Generate code for each statement in the block. */
3005 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3006 ? First_Real_Statement (gnat_node)
3007 : First (Statements (gnat_node)));
3008 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3009 add_stmt (gnat_to_gnu (gnat_temp));
3010 gnu_inner_block = end_stmt_group ();
3012 /* Now generate code for the two exception models, if either is relevant for
3016 tree *gnu_else_ptr = 0;
3019 /* Make a binding level for the exception handling declarations and code
3020 and set up gnu_except_ptr_stack for the handlers to use. */
3021 start_stmt_group ();
3024 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3025 create_var_decl (get_identifier ("EXCEPT_PTR"),
3027 build_pointer_type (except_type_node),
3028 build_call_0_expr (get_excptr_decl), false,
3029 false, false, false, NULL, gnat_node));
3031 /* Generate code for each handler. The N_Exception_Handler case does the
3032 real work and returns a COND_EXPR for each handler, which we chain
3034 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3035 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3037 gnu_expr = gnat_to_gnu (gnat_temp);
3039 /* If this is the first one, set it as the outer one. Otherwise,
3040 point the "else" part of the previous handler to us. Then point
3041 to our "else" part. */
3043 add_stmt (gnu_expr);
3045 *gnu_else_ptr = gnu_expr;
3047 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3050 /* If none of the exception handlers did anything, re-raise but do not
3052 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3053 TREE_VALUE (gnu_except_ptr_stack));
3054 set_expr_location_from_node
3056 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
3059 *gnu_else_ptr = gnu_expr;
3061 add_stmt (gnu_expr);
3063 /* End the binding level dedicated to the exception handlers and get the
3064 whole statement group. */
3065 pop_stack (&gnu_except_ptr_stack);
3067 gnu_handler = end_stmt_group ();
3069 /* If the setjmp returns 1, we restore our incoming longjmp value and
3070 then check the handlers. */
3071 start_stmt_group ();
3072 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3075 add_stmt (gnu_handler);
3076 gnu_handler = end_stmt_group ();
3078 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3079 gnu_result = build3 (COND_EXPR, void_type_node,
3082 build_unary_op (ADDR_EXPR, NULL_TREE,
3084 gnu_handler, gnu_inner_block);
3090 /* First make a block containing the handlers. */
3091 start_stmt_group ();
3092 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3093 Present (gnat_temp);
3094 gnat_temp = Next_Non_Pragma (gnat_temp))
3095 add_stmt (gnat_to_gnu (gnat_temp));
3096 gnu_handlers = end_stmt_group ();
3098 /* Now make the TRY_CATCH_EXPR for the block. */
3099 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3100 gnu_inner_block, gnu_handlers);
3103 gnu_result = gnu_inner_block;
3105 /* Now close our outer block, if we had to make one. */
3106 if (binding_for_block)
3108 add_stmt (gnu_result);
3110 gnu_result = end_stmt_group ();
3116 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3117 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3118 exception handling. */
3121 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3123 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3124 an "if" statement to select the proper exceptions. For "Others", exclude
3125 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3126 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3127 tree gnu_choice = integer_zero_node;
3128 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3131 for (gnat_temp = First (Exception_Choices (gnat_node));
3132 gnat_temp; gnat_temp = Next (gnat_temp))
3136 if (Nkind (gnat_temp) == N_Others_Choice)
3138 if (All_Others (gnat_temp))
3139 this_choice = integer_one_node;
3143 (EQ_EXPR, integer_type_node,
3148 (INDIRECT_REF, NULL_TREE,
3149 TREE_VALUE (gnu_except_ptr_stack)),
3150 get_identifier ("not_handled_by_others"), NULL_TREE,
3155 else if (Nkind (gnat_temp) == N_Identifier
3156 || Nkind (gnat_temp) == N_Expanded_Name)
3158 Entity_Id gnat_ex_id = Entity (gnat_temp);
3161 /* Exception may be a renaming. Recover original exception which is
3162 the one elaborated and registered. */
3163 if (Present (Renamed_Object (gnat_ex_id)))
3164 gnat_ex_id = Renamed_Object (gnat_ex_id);
3166 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3170 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3171 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3172 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3174 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3175 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3177 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3180 = build_component_ref
3181 (build_unary_op (INDIRECT_REF, NULL_TREE,
3182 TREE_VALUE (gnu_except_ptr_stack)),
3183 get_identifier ("lang"), NULL_TREE, false);
3187 (TRUTH_ORIF_EXPR, integer_type_node,
3188 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3189 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3196 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3197 gnu_choice, this_choice);
3200 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3203 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3204 to a GCC tree, which is returned. This is the variant for ZCX. */
3207 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3209 tree gnu_etypes_list = NULL_TREE;
3212 tree gnu_current_exc_ptr;
3213 tree gnu_incoming_exc_ptr;
3216 /* We build a TREE_LIST of nodes representing what exception types this
3217 handler can catch, with special cases for others and all others cases.
3219 Each exception type is actually identified by a pointer to the exception
3220 id, or to a dummy object for "others" and "all others".
3222 Care should be taken to ensure that the control flow impact of "others"
3223 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3225 for (gnat_temp = First (Exception_Choices (gnat_node));
3226 gnat_temp; gnat_temp = Next (gnat_temp))
3228 if (Nkind (gnat_temp) == N_Others_Choice)
3231 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3234 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3236 else if (Nkind (gnat_temp) == N_Identifier
3237 || Nkind (gnat_temp) == N_Expanded_Name)
3239 Entity_Id gnat_ex_id = Entity (gnat_temp);
3241 /* Exception may be a renaming. Recover original exception which is
3242 the one elaborated and registered. */
3243 if (Present (Renamed_Object (gnat_ex_id)))
3244 gnat_ex_id = Renamed_Object (gnat_ex_id);
3246 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3247 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3249 /* The Non_Ada_Error case for VMS exceptions is handled
3250 by the personality routine. */
3255 /* The GCC interface expects NULL to be passed for catch all handlers, so
3256 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3257 is integer_zero_node. It would not work, however, because GCC's
3258 notion of "catch all" is stronger than our notion of "others". Until
3259 we correctly use the cleanup interface as well, doing that would
3260 prevent the "all others" handlers from being seen, because nothing
3261 can be caught beyond a catch all from GCC's point of view. */
3262 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3265 start_stmt_group ();
3268 /* Expand a call to the begin_handler hook at the beginning of the handler,
3269 and arrange for a call to the end_handler hook to occur on every possible
3272 The hooks expect a pointer to the low level occurrence. This is required
3273 for our stack management scheme because a raise inside the handler pushes
3274 a new occurrence on top of the stack, which means that this top does not
3275 necessarily match the occurrence this handler was dealing with.
3277 __builtin_eh_pointer references the exception occurrence being
3278 propagated. Upon handler entry, this is the exception for which the
3279 handler is triggered. This might not be the case upon handler exit,
3280 however, as we might have a new occurrence propagated by the handler's
3281 body, and the end_handler hook called as a cleanup in this context.
3283 We use a local variable to retrieve the incoming value at handler entry
3284 time, and reuse it to feed the end_handler hook's argument at exit. */
3287 = build_call_expr (built_in_decls [BUILT_IN_EH_POINTER],
3288 1, integer_zero_node);
3289 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3290 ptr_type_node, gnu_current_exc_ptr,
3291 false, false, false, false, NULL,
3294 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3295 gnu_incoming_exc_ptr),
3297 /* ??? We don't seem to have an End_Label at hand to set the location. */
3298 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3300 add_stmt_list (Statements (gnat_node));
3303 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3307 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3310 Compilation_Unit_to_gnu (Node_Id gnat_node)
3312 /* Make the decl for the elaboration procedure. */
3313 bool body_p = (Defining_Entity (Unit (gnat_node)),
3314 Nkind (Unit (gnat_node)) == N_Package_Body
3315 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3316 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3317 tree gnu_elab_proc_decl
3318 = create_subprog_decl
3319 (create_concat_name (gnat_unit_entity,
3320 body_p ? "elabb" : "elabs"),
3321 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3323 struct elab_info *info;
3325 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3327 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3328 allocate_struct_function (gnu_elab_proc_decl, false);
3329 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3332 /* For a body, first process the spec if there is one. */
3333 if (Nkind (Unit (gnat_node)) == N_Package_Body
3334 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3335 && !Acts_As_Spec (gnat_node)))
3337 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3338 finalize_from_with_types ();
3341 process_inlined_subprograms (gnat_node);
3343 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3345 elaborate_all_entities (gnat_node);
3347 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3348 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3349 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3353 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3355 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3357 /* Process any pragmas and actions following the unit. */
3358 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3359 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3360 finalize_from_with_types ();
3362 /* Save away what we've made so far and record this potential elaboration
3364 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3365 set_current_block_context (gnu_elab_proc_decl);
3367 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3368 info->next = elab_info_list;
3369 info->elab_proc = gnu_elab_proc_decl;
3370 info->gnat_node = gnat_node;
3371 elab_info_list = info;
3373 /* Generate elaboration code for this unit, if necessary, and say whether
3375 pop_stack (&gnu_elab_proc_stack);
3377 /* Invalidate the global renaming pointers. This is necessary because
3378 stabilization of the renamed entities may create SAVE_EXPRs which
3379 have been tied to a specific elaboration routine just above. */
3380 invalidate_global_renaming_pointers ();
3383 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
3384 as gigi is concerned. This is used to avoid conversions on the LHS. */
3387 unchecked_conversion_nop (Node_Id gnat_node)
3389 Entity_Id from_type, to_type;
3391 /* The conversion must be on the LHS of an assignment or an actual parameter
3392 of a call. Otherwise, even if the conversion was essentially a no-op, it
3393 could de facto ensure type consistency and this should be preserved. */
3394 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3395 && Name (Parent (gnat_node)) == gnat_node)
3396 && !(Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
3397 && Name (Parent (gnat_node)) != gnat_node))
3400 from_type = Etype (Expression (gnat_node));
3402 /* We're interested in artificial conversions generated by the front-end
3403 to make private types explicit, e.g. in Expand_Assign_Array. */
3404 if (!Is_Private_Type (from_type))
3407 from_type = Underlying_Type (from_type);
3408 to_type = Etype (gnat_node);
3410 /* The direct conversion to the underlying type is a no-op. */
3411 if (to_type == from_type)
3414 /* For an array type, the conversion to the PAT is a no-op. */
3415 if (Ekind (from_type) == E_Array_Subtype
3416 && to_type == Packed_Array_Type (from_type))
3422 /* This function is the driver of the GNAT to GCC tree transformation process.
3423 It is the entry point of the tree transformer. GNAT_NODE is the root of
3424 some GNAT tree. Return the root of the corresponding GCC tree. If this
3425 is an expression, return the GCC equivalent of the expression. If this
3426 is a statement, return the statement or add it to the current statement
3427 group, in which case anything returned is to be interpreted as occurring
3428 after anything added. */
3431 gnat_to_gnu (Node_Id gnat_node)
3433 const Node_Kind kind = Nkind (gnat_node);
3434 bool went_into_elab_proc = false;
3435 tree gnu_result = error_mark_node; /* Default to no value. */
3436 tree gnu_result_type = void_type_node;
3437 tree gnu_expr, gnu_lhs, gnu_rhs;
3440 /* Save node number for error message and set location information. */
3441 error_gnat_node = gnat_node;
3442 Sloc_to_locus (Sloc (gnat_node), &input_location);
3444 /* If this node is a statement and we are only annotating types, return an
3445 empty statement list. */
3446 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
3447 return alloc_stmt_list ();
3449 /* If this node is a non-static subexpression and we are only annotating
3450 types, make this into a NULL_EXPR. */
3451 if (type_annotate_only
3452 && IN (kind, N_Subexpr)
3453 && kind != N_Identifier
3454 && !Compile_Time_Known_Value (gnat_node))
3455 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3456 build_call_raise (CE_Range_Check_Failed, gnat_node,
3457 N_Raise_Constraint_Error));
3459 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
3460 && !IN (kind, N_SCIL_Node)
3461 && kind != N_Null_Statement)
3462 || kind == N_Procedure_Call_Statement
3464 || kind == N_Implicit_Label_Declaration
3465 || kind == N_Handled_Sequence_Of_Statements
3466 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
3468 /* If this is a statement and we are at top level, it must be part of
3469 the elaboration procedure, so mark us as being in that procedure
3470 and push our context. */
3471 if (!current_function_decl)
3473 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3474 start_stmt_group ();
3476 went_into_elab_proc = true;
3479 /* If we are in the elaboration procedure, check if we are violating a
3480 No_Elaboration_Code restriction by having a statement there. Don't
3481 check for a possible No_Elaboration_Code restriction violation on
3482 N_Handled_Sequence_Of_Statements, as we want to signal an error on
3483 every nested real statement instead. This also avoids triggering
3484 spurious errors on dummy (empty) sequences created by the front-end
3485 for package bodies in some cases. */
3486 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3487 && kind != N_Handled_Sequence_Of_Statements)
3488 Check_Elaboration_Code_Allowed (gnat_node);
3493 /********************************/
3494 /* Chapter 2: Lexical Elements */
3495 /********************************/
3498 case N_Expanded_Name:
3499 case N_Operator_Symbol:
3500 case N_Defining_Identifier:
3501 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3504 case N_Integer_Literal:
3508 /* Get the type of the result, looking inside any padding and
3509 justified modular types. Then get the value in that type. */
3510 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3512 if (TREE_CODE (gnu_type) == RECORD_TYPE
3513 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3514 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3516 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3518 /* If the result overflows (meaning it doesn't fit in its base type),
3519 abort. We would like to check that the value is within the range
3520 of the subtype, but that causes problems with subtypes whose usage
3521 will raise Constraint_Error and with biased representation, so
3523 gcc_assert (!TREE_OVERFLOW (gnu_result));
3527 case N_Character_Literal:
3528 /* If a Entity is present, it means that this was one of the
3529 literals in a user-defined character type. In that case,
3530 just return the value in the CONST_DECL. Otherwise, use the
3531 character code. In that case, the base type should be an
3532 INTEGER_TYPE, but we won't bother checking for that. */
3533 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3534 if (Present (Entity (gnat_node)))
3535 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3538 = build_int_cst_type
3539 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3542 case N_Real_Literal:
3543 /* If this is of a fixed-point type, the value we want is the
3544 value of the corresponding integer. */
3545 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3547 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3548 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3550 gcc_assert (!TREE_OVERFLOW (gnu_result));
3553 /* We should never see a Vax_Float type literal, since the front end
3554 is supposed to transform these using appropriate conversions. */
3555 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3560 Ureal ur_realval = Realval (gnat_node);
3562 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3564 /* If the real value is zero, so is the result. Otherwise,
3565 convert it to a machine number if it isn't already. That
3566 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3567 if (UR_Is_Zero (ur_realval))
3568 gnu_result = convert (gnu_result_type, integer_zero_node);
3571 if (!Is_Machine_Number (gnat_node))
3573 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3574 ur_realval, Round_Even, gnat_node);
3577 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3579 /* If we have a base of zero, divide by the denominator.
3580 Otherwise, the base must be 2 and we scale the value, which
3581 we know can fit in the mantissa of the type (hence the use
3582 of that type above). */
3583 if (No (Rbase (ur_realval)))
3585 = build_binary_op (RDIV_EXPR,
3586 get_base_type (gnu_result_type),
3588 UI_To_gnu (Denominator (ur_realval),
3592 REAL_VALUE_TYPE tmp;
3594 gcc_assert (Rbase (ur_realval) == 2);
3595 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3596 - UI_To_Int (Denominator (ur_realval)));
3597 gnu_result = build_real (gnu_result_type, tmp);
3601 /* Now see if we need to negate the result. Do it this way to
3602 properly handle -0. */
3603 if (UR_Is_Negative (Realval (gnat_node)))
3605 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3611 case N_String_Literal:
3612 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3613 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3615 String_Id gnat_string = Strval (gnat_node);
3616 int length = String_Length (gnat_string);
3619 if (length >= ALLOCA_THRESHOLD)
3620 string = XNEWVEC (char, length + 1);
3622 string = (char *) alloca (length + 1);
3624 /* Build the string with the characters in the literal. Note
3625 that Ada strings are 1-origin. */
3626 for (i = 0; i < length; i++)
3627 string[i] = Get_String_Char (gnat_string, i + 1);
3629 /* Put a null at the end of the string in case it's in a context
3630 where GCC will want to treat it as a C string. */
3633 gnu_result = build_string (length, string);
3635 /* Strings in GCC don't normally have types, but we want
3636 this to not be converted to the array type. */
3637 TREE_TYPE (gnu_result) = gnu_result_type;
3639 if (length >= ALLOCA_THRESHOLD)
3644 /* Build a list consisting of each character, then make
3646 String_Id gnat_string = Strval (gnat_node);
3647 int length = String_Length (gnat_string);
3649 tree gnu_list = NULL_TREE;
3650 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3652 for (i = 0; i < length; i++)
3655 = tree_cons (gnu_idx,
3656 build_int_cst (TREE_TYPE (gnu_result_type),
3657 Get_String_Char (gnat_string,
3661 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3666 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3671 gnu_result = Pragma_to_gnu (gnat_node);
3674 /**************************************/
3675 /* Chapter 3: Declarations and Types */
3676 /**************************************/
3678 case N_Subtype_Declaration:
3679 case N_Full_Type_Declaration:
3680 case N_Incomplete_Type_Declaration:
3681 case N_Private_Type_Declaration:
3682 case N_Private_Extension_Declaration:
3683 case N_Task_Type_Declaration:
3684 process_type (Defining_Entity (gnat_node));
3685 gnu_result = alloc_stmt_list ();
3688 case N_Object_Declaration:
3689 case N_Exception_Declaration:
3690 gnat_temp = Defining_Entity (gnat_node);
3691 gnu_result = alloc_stmt_list ();
3693 /* If we are just annotating types and this object has an unconstrained
3694 or task type, don't elaborate it. */
3695 if (type_annotate_only
3696 && (((Is_Array_Type (Etype (gnat_temp))
3697 || Is_Record_Type (Etype (gnat_temp)))
3698 && !Is_Constrained (Etype (gnat_temp)))
3699 || Is_Concurrent_Type (Etype (gnat_temp))))
3702 if (Present (Expression (gnat_node))
3703 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
3704 && (!type_annotate_only
3705 || Compile_Time_Known_Value (Expression (gnat_node))))
3707 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3708 if (Do_Range_Check (Expression (gnat_node)))
3710 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3712 /* If this object has its elaboration delayed, we must force
3713 evaluation of GNU_EXPR right now and save it for when the object
3715 if (Present (Freeze_Node (gnat_temp)))
3717 if ((Is_Public (gnat_temp) || global_bindings_p ())
3718 && !TREE_CONSTANT (gnu_expr))
3720 = create_var_decl (create_concat_name (gnat_temp, "init"),
3721 NULL_TREE, TREE_TYPE (gnu_expr),
3722 gnu_expr, false, Is_Public (gnat_temp),
3723 false, false, NULL, gnat_temp);
3725 gnu_expr = maybe_variable (gnu_expr);
3727 save_gnu_tree (gnat_node, gnu_expr, true);
3731 gnu_expr = NULL_TREE;
3733 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3734 gnu_expr = NULL_TREE;
3736 /* If this is a deferred constant with an address clause, we ignore the
3737 full view since the clause is on the partial view and we cannot have
3738 2 different GCC trees for the object. The only bits of the full view
3739 we will use is the initializer, but it will be directly fetched. */
3740 if (Ekind(gnat_temp) == E_Constant
3741 && Present (Address_Clause (gnat_temp))
3742 && Present (Full_View (gnat_temp)))
3743 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3745 if (No (Freeze_Node (gnat_temp)))
3746 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3749 case N_Object_Renaming_Declaration:
3750 gnat_temp = Defining_Entity (gnat_node);
3752 /* Don't do anything if this renaming is handled by the front end or if
3753 we are just annotating types and this object has a composite or task
3754 type, don't elaborate it. We return the result in case it has any
3755 SAVE_EXPRs in it that need to be evaluated here. */
3756 if (!Is_Renaming_Of_Object (gnat_temp)
3757 && ! (type_annotate_only
3758 && (Is_Array_Type (Etype (gnat_temp))
3759 || Is_Record_Type (Etype (gnat_temp))
3760 || Is_Concurrent_Type (Etype (gnat_temp)))))
3762 = gnat_to_gnu_entity (gnat_temp,
3763 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3765 gnu_result = alloc_stmt_list ();
3768 case N_Implicit_Label_Declaration:
3769 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3770 gnu_result = alloc_stmt_list ();
3773 case N_Exception_Renaming_Declaration:
3774 case N_Number_Declaration:
3775 case N_Package_Renaming_Declaration:
3776 case N_Subprogram_Renaming_Declaration:
3777 /* These are fully handled in the front end. */
3778 gnu_result = alloc_stmt_list ();
3781 /*************************************/
3782 /* Chapter 4: Names and Expressions */
3783 /*************************************/
3785 case N_Explicit_Dereference:
3786 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3787 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3788 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3791 case N_Indexed_Component:
3793 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3797 Node_Id *gnat_expr_array;
3799 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3801 /* Convert vector inputs to their representative array type, to fit
3802 what the code below expects. */
3803 gnu_array_object = maybe_vector_array (gnu_array_object);
3805 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3807 /* If we got a padded type, remove it too. */
3808 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3810 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3813 gnu_result = gnu_array_object;
3815 /* First compute the number of dimensions of the array, then
3816 fill the expression array, the order depending on whether
3817 this is a Convention_Fortran array or not. */
3818 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3819 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3820 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3821 ndim++, gnu_type = TREE_TYPE (gnu_type))
3824 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3826 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3827 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3829 i--, gnat_temp = Next (gnat_temp))
3830 gnat_expr_array[i] = gnat_temp;
3832 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3834 i++, gnat_temp = Next (gnat_temp))
3835 gnat_expr_array[i] = gnat_temp;
3837 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3838 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3840 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3841 gnat_temp = gnat_expr_array[i];
3842 gnu_expr = gnat_to_gnu (gnat_temp);
3844 if (Do_Range_Check (gnat_temp))
3847 (gnu_array_object, gnu_expr,
3848 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3849 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3852 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3853 gnu_result, gnu_expr);
3857 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3862 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3865 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3866 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3868 /* Do any implicit dereferences of the prefix and do any needed
3870 gnu_result = maybe_implicit_deref (gnu_result);
3871 gnu_result = maybe_unconstrained_array (gnu_result);
3872 gnu_type = TREE_TYPE (gnu_result);
3873 if (Do_Range_Check (gnat_range_node))
3875 /* Get the bounds of the slice. */
3877 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3878 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3879 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3880 /* Get the permitted bounds. */
3881 tree gnu_base_index_type
3882 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3883 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3884 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3885 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3886 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3887 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3889 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3890 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3892 /* Derive a good type to convert everything to. */
3893 gnu_expr_type = get_base_type (gnu_index_type);
3895 /* Test whether the minimum slice value is too small. */
3896 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3897 convert (gnu_expr_type,
3899 convert (gnu_expr_type,
3900 gnu_base_min_expr));
3902 /* Test whether the maximum slice value is too large. */
3903 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3904 convert (gnu_expr_type,
3906 convert (gnu_expr_type,
3907 gnu_base_max_expr));
3909 /* Build a slice index check that returns the low bound,
3910 assuming the slice is not empty. */
3911 gnu_expr = emit_check
3912 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3913 gnu_expr_l, gnu_expr_h),
3914 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3916 /* Build a conditional expression that does the index checks and
3917 returns the low bound if the slice is not empty (max >= min),
3918 and returns the naked low bound otherwise (max < min), unless
3919 it is non-constant and the high bound is; this prevents VRP
3920 from inferring bogus ranges on the unlikely path. */
3921 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3922 build_binary_op (GE_EXPR, gnu_expr_type,
3923 convert (gnu_expr_type,
3925 convert (gnu_expr_type,
3928 TREE_CODE (gnu_min_expr) != INTEGER_CST
3929 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3930 ? gnu_max_expr : gnu_min_expr);
3933 /* Simply return the naked low bound. */
3934 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3936 /* If this is a slice with non-constant size of an array with constant
3937 size, set the maximum size for the allocation of temporaries. */
3938 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
3939 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
3940 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
3942 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3943 gnu_result, gnu_expr);
3947 case N_Selected_Component:
3949 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3950 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3951 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3954 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3955 || IN (Ekind (gnat_pref_type), Access_Kind))
3957 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3958 gnat_pref_type = Underlying_Type (gnat_pref_type);
3959 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3960 gnat_pref_type = Designated_Type (gnat_pref_type);
3963 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3965 /* For discriminant references in tagged types always substitute the
3966 corresponding discriminant as the actual selected component. */
3967 if (Is_Tagged_Type (gnat_pref_type))
3968 while (Present (Corresponding_Discriminant (gnat_field)))
3969 gnat_field = Corresponding_Discriminant (gnat_field);
3971 /* For discriminant references of untagged types always substitute the
3972 corresponding stored discriminant. */
3973 else if (Present (Corresponding_Discriminant (gnat_field)))
3974 gnat_field = Original_Record_Component (gnat_field);
3976 /* Handle extracting the real or imaginary part of a complex.
3977 The real part is the first field and the imaginary the last. */
3978 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3979 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3980 ? REALPART_EXPR : IMAGPART_EXPR,
3981 NULL_TREE, gnu_prefix);
3984 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3986 /* If there are discriminants, the prefix might be evaluated more
3987 than once, which is a problem if it has side-effects. */
3988 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3989 ? Designated_Type (Etype
3990 (Prefix (gnat_node)))
3991 : Etype (Prefix (gnat_node))))
3992 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3995 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3996 (Nkind (Parent (gnat_node))
3997 == N_Attribute_Reference));
4000 gcc_assert (gnu_result);
4001 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4005 case N_Attribute_Reference:
4007 /* The attribute designator (like an enumeration value). */
4008 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
4010 /* The Elab_Spec and Elab_Body attributes are special in that
4011 Prefix is a unit, not an object with a GCC equivalent. Similarly
4012 for Elaborated, since that variable isn't otherwise known. */
4013 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
4014 return (create_subprog_decl
4015 (create_concat_name (Entity (Prefix (gnat_node)),
4016 attribute == Attr_Elab_Body
4017 ? "elabb" : "elabs"),
4018 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
4021 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4026 /* Like 'Access as far as we are concerned. */
4027 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4028 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4029 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4033 case N_Extension_Aggregate:
4037 /* ??? It is wrong to evaluate the type now, but there doesn't
4038 seem to be any other practical way of doing it. */
4040 gcc_assert (!Expansion_Delayed (gnat_node));
4042 gnu_aggr_type = gnu_result_type
4043 = get_unpadded_type (Etype (gnat_node));
4045 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4046 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4048 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4049 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
4050 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
4052 if (Null_Record_Present (gnat_node))
4053 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4055 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4056 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4058 = assoc_to_constructor (Etype (gnat_node),
4059 First (Component_Associations (gnat_node)),
4061 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4062 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4064 Component_Type (Etype (gnat_node)));
4065 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4068 (COMPLEX_EXPR, gnu_aggr_type,
4069 gnat_to_gnu (Expression (First
4070 (Component_Associations (gnat_node)))),
4071 gnat_to_gnu (Expression
4073 (First (Component_Associations (gnat_node))))));
4077 gnu_result = convert (gnu_result_type, gnu_result);
4082 if (TARGET_VTABLE_USES_DESCRIPTORS
4083 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4084 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4085 gnu_result = null_fdesc_node;
4087 gnu_result = null_pointer_node;
4088 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4091 case N_Type_Conversion:
4092 case N_Qualified_Expression:
4093 /* Get the operand expression. */
4094 gnu_result = gnat_to_gnu (Expression (gnat_node));
4095 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4098 = convert_with_check (Etype (gnat_node), gnu_result,
4099 Do_Overflow_Check (gnat_node),
4100 Do_Range_Check (Expression (gnat_node)),
4101 kind == N_Type_Conversion
4102 && Float_Truncate (gnat_node), gnat_node);
4105 case N_Unchecked_Type_Conversion:
4106 gnu_result = gnat_to_gnu (Expression (gnat_node));
4108 /* Skip further processing if the conversion is deemed a no-op. */
4109 if (unchecked_conversion_nop (gnat_node))
4111 gnu_result_type = TREE_TYPE (gnu_result);
4115 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4117 /* If the result is a pointer type, see if we are improperly
4118 converting to a stricter alignment. */
4119 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4120 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4122 unsigned int align = known_alignment (gnu_result);
4123 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4124 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4126 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4127 post_error_ne_tree_2
4128 ("?source alignment (^) '< alignment of & (^)",
4129 gnat_node, Designated_Type (Etype (gnat_node)),
4130 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4133 /* If we are converting a descriptor to a function pointer, first
4134 build the pointer. */
4135 if (TARGET_VTABLE_USES_DESCRIPTORS
4136 && TREE_TYPE (gnu_result) == fdesc_type_node
4137 && POINTER_TYPE_P (gnu_result_type))
4138 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4140 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4141 No_Truncation (gnat_node));
4147 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
4148 Node_Id gnat_range = Right_Opnd (gnat_node);
4149 tree gnu_low, gnu_high;
4151 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
4153 if (Nkind (gnat_range) == N_Range)
4155 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4156 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4158 else if (Nkind (gnat_range) == N_Identifier
4159 || Nkind (gnat_range) == N_Expanded_Name)
4161 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4163 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4164 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4169 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4171 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
4172 ensure that GNU_OBJ is evaluated only once and perform a full range
4174 if (operand_equal_p (gnu_low, gnu_high, 0))
4176 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
4180 gnu_obj = protect_multiple_eval (gnu_obj);
4181 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
4183 set_expr_location_from_node (t1, gnat_node);
4184 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
4186 set_expr_location_from_node (t2, gnat_node);
4188 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
4191 if (kind == N_Not_In)
4192 gnu_result = invert_truthvalue (gnu_result);
4197 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4198 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4199 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4200 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4202 : (Rounded_Result (gnat_node)
4203 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4204 gnu_result_type, gnu_lhs, gnu_rhs);
4207 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4208 /* These can either be operations on booleans or on modular types.
4209 Fall through for boolean types since that's the way GNU_CODES is
4211 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4212 Modular_Integer_Kind))
4215 = (kind == N_Op_Or ? BIT_IOR_EXPR
4216 : kind == N_Op_And ? BIT_AND_EXPR
4219 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4220 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4221 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4222 gnu_result = build_binary_op (code, gnu_result_type,
4227 /* ... fall through ... */
4229 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4230 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4231 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4232 case N_Op_Mod: case N_Op_Rem:
4233 case N_Op_Rotate_Left:
4234 case N_Op_Rotate_Right:
4235 case N_Op_Shift_Left:
4236 case N_Op_Shift_Right:
4237 case N_Op_Shift_Right_Arithmetic:
4238 case N_And_Then: case N_Or_Else:
4240 enum tree_code code = gnu_codes[kind];
4241 bool ignore_lhs_overflow = false;
4244 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4245 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4246 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4248 /* Pending generic support for efficient vector logical operations in
4249 GCC, convert vectors to their representative array type view and
4251 gnu_lhs = maybe_vector_array (gnu_lhs);
4252 gnu_rhs = maybe_vector_array (gnu_rhs);
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 (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
4274 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4276 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4278 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
4279 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4280 gnu_rhs, gnu_max_shift);
4281 else if (kind == N_Op_Shift_Right_Arithmetic)
4284 (MIN_EXPR, gnu_count_type,
4285 build_binary_op (MINUS_EXPR,
4288 convert (gnu_count_type,
4293 /* For right shifts, the type says what kind of shift to do,
4294 so we may need to choose a different type. In this case,
4295 we have to ignore integer overflow lest it propagates all
4296 the way down and causes a CE to be explicitly raised. */
4297 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
4299 gnu_type = gnat_unsigned_type (gnu_type);
4300 ignore_lhs_overflow = true;
4302 else if (kind == N_Op_Shift_Right_Arithmetic
4303 && TYPE_UNSIGNED (gnu_type))
4305 gnu_type = gnat_signed_type (gnu_type);
4306 ignore_lhs_overflow = true;
4309 if (gnu_type != gnu_result_type)
4311 tree gnu_old_lhs = gnu_lhs;
4312 gnu_lhs = convert (gnu_type, gnu_lhs);
4313 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4314 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4315 gnu_rhs = convert (gnu_type, gnu_rhs);
4318 /* Instead of expanding overflow checks for addition, subtraction
4319 and multiplication itself, the front end will leave this to
4320 the back end when Backend_Overflow_Checks_On_Target is set.
4321 As the GCC back end itself does not know yet how to properly
4322 do overflow checking, do it here. The goal is to push
4323 the expansions further into the back end over time. */
4324 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4325 && (kind == N_Op_Add
4326 || kind == N_Op_Subtract
4327 || kind == N_Op_Multiply)
4328 && !TYPE_UNSIGNED (gnu_type)
4329 && !FLOAT_TYPE_P (gnu_type))
4330 gnu_result = build_binary_op_trapv (code, gnu_type,
4331 gnu_lhs, gnu_rhs, gnat_node);
4333 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4335 /* If this is a logical shift with the shift count not verified,
4336 we must return zero if it is too large. We cannot compensate
4337 above in this case. */
4338 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
4339 && !Shift_Count_OK (gnat_node))
4343 build_binary_op (GE_EXPR, integer_type_node,
4345 convert (TREE_TYPE (gnu_rhs),
4346 TYPE_SIZE (gnu_type))),
4347 convert (gnu_type, integer_zero_node),
4352 case N_Conditional_Expression:
4354 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4355 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4357 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4359 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4361 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
4366 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4367 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4371 /* This case can apply to a boolean or a modular type.
4372 Fall through for a boolean operand since GNU_CODES is set
4373 up to handle this. */
4374 if (Is_Modular_Integer_Type (Etype (gnat_node))
4375 || (Ekind (Etype (gnat_node)) == E_Private_Type
4376 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4378 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4379 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4380 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4385 /* ... fall through ... */
4387 case N_Op_Minus: case N_Op_Abs:
4388 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4390 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4391 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4393 gnu_result_type = get_unpadded_type (Base_Type
4394 (Full_View (Etype (gnat_node))));
4396 if (Do_Overflow_Check (gnat_node)
4397 && !TYPE_UNSIGNED (gnu_result_type)
4398 && !FLOAT_TYPE_P (gnu_result_type))
4400 = build_unary_op_trapv (gnu_codes[kind],
4401 gnu_result_type, gnu_expr, gnat_node);
4403 gnu_result = build_unary_op (gnu_codes[kind],
4404 gnu_result_type, gnu_expr);
4411 bool ignore_init_type = false;
4413 gnat_temp = Expression (gnat_node);
4415 /* The Expression operand can either be an N_Identifier or
4416 Expanded_Name, which must represent a type, or a
4417 N_Qualified_Expression, which contains both the object type and an
4418 initial value for the object. */
4419 if (Nkind (gnat_temp) == N_Identifier
4420 || Nkind (gnat_temp) == N_Expanded_Name)
4421 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4422 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4424 Entity_Id gnat_desig_type
4425 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4427 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4428 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4430 gnu_init = maybe_unconstrained_array (gnu_init);
4431 if (Do_Range_Check (Expression (gnat_temp)))
4433 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4435 if (Is_Elementary_Type (gnat_desig_type)
4436 || Is_Constrained (gnat_desig_type))
4438 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4439 gnu_init = convert (gnu_type, gnu_init);
4443 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4444 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4445 gnu_type = TREE_TYPE (gnu_init);
4447 gnu_init = convert (gnu_type, gnu_init);
4453 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4454 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4455 Procedure_To_Call (gnat_node),
4456 Storage_Pool (gnat_node), gnat_node,
4461 /**************************/
4462 /* Chapter 5: Statements */
4463 /**************************/
4466 gnu_result = build1 (LABEL_EXPR, void_type_node,
4467 gnat_to_gnu (Identifier (gnat_node)));
4470 case N_Null_Statement:
4471 gnu_result = alloc_stmt_list ();
4474 case N_Assignment_Statement:
4475 /* Get the LHS and RHS of the statement and convert any reference to an
4476 unconstrained array into a reference to the underlying array.
4477 If we are not to do range checking and the RHS is an N_Function_Call,
4478 pass the LHS to the call function. */
4479 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4481 /* If the type has a size that overflows, convert this into raise of
4482 Storage_Error: execution shouldn't have gotten here anyway. */
4483 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4484 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4485 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4486 N_Raise_Storage_Error);
4487 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4488 && !Do_Range_Check (Expression (gnat_node)))
4489 gnu_result = call_to_gnu (Expression (gnat_node),
4490 &gnu_result_type, gnu_lhs);
4494 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4496 /* If range check is needed, emit code to generate it. */
4497 if (Do_Range_Check (Expression (gnat_node)))
4498 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4502 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4504 /* If the type being assigned is an array type and the two sides
4505 are not completely disjoint, play safe and use memmove. */
4506 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4507 && Is_Array_Type (Etype (Name (gnat_node)))
4508 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4510 tree to, from, size, to_ptr, from_ptr, t;
4512 to = TREE_OPERAND (gnu_result, 0);
4513 from = TREE_OPERAND (gnu_result, 1);
4515 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4516 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4518 to_ptr = build_fold_addr_expr (to);
4519 from_ptr = build_fold_addr_expr (from);
4521 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4522 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4527 case N_If_Statement:
4529 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4531 /* Make the outer COND_EXPR. Avoid non-determinism. */
4532 gnu_result = build3 (COND_EXPR, void_type_node,
4533 gnat_to_gnu (Condition (gnat_node)),
4534 NULL_TREE, NULL_TREE);
4535 COND_EXPR_THEN (gnu_result)
4536 = build_stmt_group (Then_Statements (gnat_node), false);
4537 TREE_SIDE_EFFECTS (gnu_result) = 1;
4538 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4540 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4541 into the previous "else" part and point to where to put any
4542 outer "else". Also avoid non-determinism. */
4543 if (Present (Elsif_Parts (gnat_node)))
4544 for (gnat_temp = First (Elsif_Parts (gnat_node));
4545 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4547 gnu_expr = build3 (COND_EXPR, void_type_node,
4548 gnat_to_gnu (Condition (gnat_temp)),
4549 NULL_TREE, NULL_TREE);
4550 COND_EXPR_THEN (gnu_expr)
4551 = build_stmt_group (Then_Statements (gnat_temp), false);
4552 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4553 set_expr_location_from_node (gnu_expr, gnat_temp);
4554 *gnu_else_ptr = gnu_expr;
4555 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4558 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4562 case N_Case_Statement:
4563 gnu_result = Case_Statement_to_gnu (gnat_node);
4566 case N_Loop_Statement:
4567 gnu_result = Loop_Statement_to_gnu (gnat_node);
4570 case N_Block_Statement:
4571 start_stmt_group ();
4573 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4574 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4576 gnu_result = end_stmt_group ();
4578 if (Present (Identifier (gnat_node)))
4579 mark_out_of_scope (Entity (Identifier (gnat_node)));
4582 case N_Exit_Statement:
4584 = build2 (EXIT_STMT, void_type_node,
4585 (Present (Condition (gnat_node))
4586 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4587 (Present (Name (gnat_node))
4588 ? get_gnu_tree (Entity (Name (gnat_node)))
4589 : TREE_VALUE (gnu_loop_label_stack)));
4592 case N_Return_Statement:
4594 tree gnu_ret_val, gnu_ret_obj;
4596 /* If we have a return label defined, convert this into a branch to
4597 that label. The return proper will be handled elsewhere. */
4598 if (TREE_VALUE (gnu_return_label_stack))
4600 gnu_result = build1 (GOTO_EXPR, void_type_node,
4601 TREE_VALUE (gnu_return_label_stack));
4605 /* If the subprogram is a function, we must return the expression. */
4606 if (Present (Expression (gnat_node)))
4608 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4609 tree gnu_result_decl = DECL_RESULT (current_function_decl);
4610 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4612 /* Do not remove the padding from GNU_RET_VAL if the inner type is
4613 self-referential since we want to allocate the fixed size. */
4614 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4615 && TYPE_IS_PADDING_P
4616 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4617 && CONTAINS_PLACEHOLDER_P
4618 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
4619 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4621 /* If the subprogram returns by direct reference, return a pointer
4622 to the return value. */
4623 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
4624 || By_Ref (gnat_node))
4625 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4627 /* Otherwise, if it returns an unconstrained array, we have to
4628 allocate a new version of the result and return it. */
4629 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
4631 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4632 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
4634 TREE_TYPE (gnu_subprog_type),
4635 Procedure_To_Call (gnat_node),
4636 Storage_Pool (gnat_node),
4640 /* If the subprogram returns by invisible reference, dereference
4641 the pointer it is passed using the type of the return value
4642 and build the copy operation manually. This ensures that we
4643 don't copy too much data, for example if the return type is
4644 unconstrained with a maximum size. */
4645 if (TREE_ADDRESSABLE (gnu_subprog_type))
4648 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4650 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4651 gnu_ret_obj, gnu_ret_val);
4652 add_stmt_with_node (gnu_result, gnat_node);
4653 gnu_ret_val = NULL_TREE;
4654 gnu_ret_obj = gnu_result_decl;
4657 /* Otherwise, build a regular return. */
4659 gnu_ret_obj = gnu_result_decl;
4663 gnu_ret_val = NULL_TREE;
4664 gnu_ret_obj = NULL_TREE;
4667 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
4671 case N_Goto_Statement:
4672 gnu_result = build1 (GOTO_EXPR, void_type_node,
4673 gnat_to_gnu (Name (gnat_node)));
4676 /***************************/
4677 /* Chapter 6: Subprograms */
4678 /***************************/
4680 case N_Subprogram_Declaration:
4681 /* Unless there is a freeze node, declare the subprogram. We consider
4682 this a "definition" even though we're not generating code for
4683 the subprogram because we will be making the corresponding GCC
4686 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4687 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4689 gnu_result = alloc_stmt_list ();
4692 case N_Abstract_Subprogram_Declaration:
4693 /* This subprogram doesn't exist for code generation purposes, but we
4694 have to elaborate the types of any parameters and result, unless
4695 they are imported types (nothing to generate in this case). */
4697 /* Process the parameter types first. */
4700 = First_Formal_With_Extras
4701 (Defining_Entity (Specification (gnat_node)));
4702 Present (gnat_temp);
4703 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4704 if (Is_Itype (Etype (gnat_temp))
4705 && !From_With_Type (Etype (gnat_temp)))
4706 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4709 /* Then the result type, set to Standard_Void_Type for procedures. */
4712 Entity_Id gnat_temp_type
4713 = Etype (Defining_Entity (Specification (gnat_node)));
4715 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4716 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4719 gnu_result = alloc_stmt_list ();
4722 case N_Defining_Program_Unit_Name:
4723 /* For a child unit identifier go up a level to get the specification.
4724 We get this when we try to find the spec of a child unit package
4725 that is the compilation unit being compiled. */
4726 gnu_result = gnat_to_gnu (Parent (gnat_node));
4729 case N_Subprogram_Body:
4730 Subprogram_Body_to_gnu (gnat_node);
4731 gnu_result = alloc_stmt_list ();
4734 case N_Function_Call:
4735 case N_Procedure_Call_Statement:
4736 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4739 /************************/
4740 /* Chapter 7: Packages */
4741 /************************/
4743 case N_Package_Declaration:
4744 gnu_result = gnat_to_gnu (Specification (gnat_node));
4747 case N_Package_Specification:
4749 start_stmt_group ();
4750 process_decls (Visible_Declarations (gnat_node),
4751 Private_Declarations (gnat_node), Empty, true, true);
4752 gnu_result = end_stmt_group ();
4755 case N_Package_Body:
4757 /* If this is the body of a generic package - do nothing. */
4758 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4760 gnu_result = alloc_stmt_list ();
4764 start_stmt_group ();
4765 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4767 if (Present (Handled_Statement_Sequence (gnat_node)))
4768 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4770 gnu_result = end_stmt_group ();
4773 /********************************/
4774 /* Chapter 8: Visibility Rules */
4775 /********************************/
4777 case N_Use_Package_Clause:
4778 case N_Use_Type_Clause:
4779 /* Nothing to do here - but these may appear in list of declarations. */
4780 gnu_result = alloc_stmt_list ();
4783 /*********************/
4784 /* Chapter 9: Tasks */
4785 /*********************/
4787 case N_Protected_Type_Declaration:
4788 gnu_result = alloc_stmt_list ();
4791 case N_Single_Task_Declaration:
4792 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4793 gnu_result = alloc_stmt_list ();
4796 /*********************************************************/
4797 /* Chapter 10: Program Structure and Compilation Issues */
4798 /*********************************************************/
4800 case N_Compilation_Unit:
4802 /* This is not called for the main unit, which is handled in function
4804 start_stmt_group ();
4807 Compilation_Unit_to_gnu (gnat_node);
4808 gnu_result = alloc_stmt_list ();
4811 case N_Subprogram_Body_Stub:
4812 case N_Package_Body_Stub:
4813 case N_Protected_Body_Stub:
4814 case N_Task_Body_Stub:
4815 /* Simply process whatever unit is being inserted. */
4816 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4820 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4823 /***************************/
4824 /* Chapter 11: Exceptions */
4825 /***************************/
4827 case N_Handled_Sequence_Of_Statements:
4828 /* If there is an At_End procedure attached to this node, and the EH
4829 mechanism is SJLJ, we must have at least a corresponding At_End
4830 handler, unless the No_Exception_Handlers restriction is set. */
4831 gcc_assert (type_annotate_only
4832 || Exception_Mechanism != Setjmp_Longjmp
4833 || No (At_End_Proc (gnat_node))
4834 || Present (Exception_Handlers (gnat_node))
4835 || No_Exception_Handlers_Set ());
4837 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4840 case N_Exception_Handler:
4841 if (Exception_Mechanism == Setjmp_Longjmp)
4842 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4843 else if (Exception_Mechanism == Back_End_Exceptions)
4844 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4850 case N_Push_Constraint_Error_Label:
4851 push_exception_label_stack (&gnu_constraint_error_label_stack,
4852 Exception_Label (gnat_node));
4855 case N_Push_Storage_Error_Label:
4856 push_exception_label_stack (&gnu_storage_error_label_stack,
4857 Exception_Label (gnat_node));
4860 case N_Push_Program_Error_Label:
4861 push_exception_label_stack (&gnu_program_error_label_stack,
4862 Exception_Label (gnat_node));
4865 case N_Pop_Constraint_Error_Label:
4866 gnu_constraint_error_label_stack
4867 = TREE_CHAIN (gnu_constraint_error_label_stack);
4870 case N_Pop_Storage_Error_Label:
4871 gnu_storage_error_label_stack
4872 = TREE_CHAIN (gnu_storage_error_label_stack);
4875 case N_Pop_Program_Error_Label:
4876 gnu_program_error_label_stack
4877 = TREE_CHAIN (gnu_program_error_label_stack);
4880 /******************************/
4881 /* Chapter 12: Generic Units */
4882 /******************************/
4884 case N_Generic_Function_Renaming_Declaration:
4885 case N_Generic_Package_Renaming_Declaration:
4886 case N_Generic_Procedure_Renaming_Declaration:
4887 case N_Generic_Package_Declaration:
4888 case N_Generic_Subprogram_Declaration:
4889 case N_Package_Instantiation:
4890 case N_Procedure_Instantiation:
4891 case N_Function_Instantiation:
4892 /* These nodes can appear on a declaration list but there is nothing to
4893 to be done with them. */
4894 gnu_result = alloc_stmt_list ();
4897 /**************************************************/
4898 /* Chapter 13: Representation Clauses and */
4899 /* Implementation-Dependent Features */
4900 /**************************************************/
4902 case N_Attribute_Definition_Clause:
4903 gnu_result = alloc_stmt_list ();
4905 /* The only one we need to deal with is 'Address since, for the others,
4906 the front-end puts the information elsewhere. */
4907 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4910 /* And we only deal with 'Address if the object has a Freeze node. */
4911 gnat_temp = Entity (Name (gnat_node));
4912 if (No (Freeze_Node (gnat_temp)))
4915 /* Get the value to use as the address and save it as the equivalent
4916 for the object. When it is frozen, gnat_to_gnu_entity will do the
4918 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4921 case N_Enumeration_Representation_Clause:
4922 case N_Record_Representation_Clause:
4924 /* We do nothing with these. SEM puts the information elsewhere. */
4925 gnu_result = alloc_stmt_list ();
4928 case N_Code_Statement:
4929 if (!type_annotate_only)
4931 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4932 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4933 tree gnu_clobbers = NULL_TREE, tail;
4934 bool allows_mem, allows_reg, fake;
4935 int ninputs, noutputs, i;
4936 const char **oconstraints;
4937 const char *constraint;
4940 /* First retrieve the 3 operand lists built by the front-end. */
4941 Setup_Asm_Outputs (gnat_node);
4942 while (Present (gnat_temp = Asm_Output_Variable ()))
4944 tree gnu_value = gnat_to_gnu (gnat_temp);
4945 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4946 (Asm_Output_Constraint ()));
4948 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4952 Setup_Asm_Inputs (gnat_node);
4953 while (Present (gnat_temp = Asm_Input_Value ()))
4955 tree gnu_value = gnat_to_gnu (gnat_temp);
4956 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4957 (Asm_Input_Constraint ()));
4959 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4963 Clobber_Setup (gnat_node);
4964 while ((clobber = Clobber_Get_Next ()))
4966 = tree_cons (NULL_TREE,
4967 build_string (strlen (clobber) + 1, clobber),
4970 /* Then perform some standard checking and processing on the
4971 operands. In particular, mark them addressable if needed. */
4972 gnu_outputs = nreverse (gnu_outputs);
4973 noutputs = list_length (gnu_outputs);
4974 gnu_inputs = nreverse (gnu_inputs);
4975 ninputs = list_length (gnu_inputs);
4977 = (const char **) alloca (noutputs * sizeof (const char *));
4979 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4981 tree output = TREE_VALUE (tail);
4983 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4984 oconstraints[i] = constraint;
4986 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4987 &allows_mem, &allows_reg, &fake))
4989 /* If the operand is going to end up in memory,
4990 mark it addressable. Note that we don't test
4991 allows_mem like in the input case below; this
4992 is modelled on the C front-end. */
4994 && !gnat_mark_addressable (output))
4995 output = error_mark_node;
4998 output = error_mark_node;
5000 TREE_VALUE (tail) = output;
5003 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5005 tree input = TREE_VALUE (tail);
5007 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5009 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5011 &allows_mem, &allows_reg))
5013 /* If the operand is going to end up in memory,
5014 mark it addressable. */
5015 if (!allows_reg && allows_mem
5016 && !gnat_mark_addressable (input))
5017 input = error_mark_node;
5020 input = error_mark_node;
5022 TREE_VALUE (tail) = input;
5025 gnu_result = build5 (ASM_EXPR, void_type_node,
5026 gnu_template, gnu_outputs,
5027 gnu_inputs, gnu_clobbers, NULL_TREE);
5028 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5031 gnu_result = alloc_stmt_list ();
5039 case N_Freeze_Entity:
5040 start_stmt_group ();
5041 process_freeze_entity (gnat_node);
5042 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5043 gnu_result = end_stmt_group ();
5046 case N_Itype_Reference:
5047 if (!present_gnu_tree (Itype (gnat_node)))
5048 process_type (Itype (gnat_node));
5050 gnu_result = alloc_stmt_list ();
5053 case N_Free_Statement:
5054 if (!type_annotate_only)
5056 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5057 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5059 tree gnu_actual_obj_type = 0;
5062 /* If this is a thin pointer, we must dereference it to create
5063 a fat pointer, then go back below to a thin pointer. The
5064 reason for this is that we need a fat pointer someplace in
5065 order to properly compute the size. */
5066 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5067 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5068 build_unary_op (INDIRECT_REF, NULL_TREE,
5071 /* If this is an unconstrained array, we know the object must
5072 have been allocated with the template in front of the object.
5073 So pass the template address, but get the total size. Do this
5074 by converting to a thin pointer. */
5075 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5077 = convert (build_pointer_type
5078 (TYPE_OBJECT_RECORD_TYPE
5079 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5082 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5084 if (Present (Actual_Designated_Subtype (gnat_node)))
5087 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5089 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5091 = build_unc_object_type_from_ptr (gnu_ptr_type,
5092 gnu_actual_obj_type,
5093 get_identifier ("DEALLOC"));
5096 gnu_actual_obj_type = gnu_obj_type;
5098 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5100 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5101 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5103 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5104 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5105 tree gnu_byte_offset
5106 = convert (sizetype,
5107 size_diffop (size_zero_node, gnu_pos));
5108 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5110 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5111 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5112 gnu_ptr, gnu_byte_offset);
5116 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
5117 Procedure_To_Call (gnat_node),
5118 Storage_Pool (gnat_node),
5123 case N_Raise_Constraint_Error:
5124 case N_Raise_Program_Error:
5125 case N_Raise_Storage_Error:
5126 if (type_annotate_only)
5128 gnu_result = alloc_stmt_list ();
5132 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5134 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node, kind);
5136 /* If the type is VOID, this is a statement, so we need to
5137 generate the code for the call. Handle a Condition, if there
5139 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5141 set_expr_location_from_node (gnu_result, gnat_node);
5143 if (Present (Condition (gnat_node)))
5144 gnu_result = build3 (COND_EXPR, void_type_node,
5145 gnat_to_gnu (Condition (gnat_node)),
5146 gnu_result, alloc_stmt_list ());
5149 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5152 case N_Validate_Unchecked_Conversion:
5154 Entity_Id gnat_target_type = Target_Type (gnat_node);
5155 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5156 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5158 /* No need for any warning in this case. */
5159 if (!flag_strict_aliasing)
5162 /* If the result is a pointer type, see if we are either converting
5163 from a non-pointer or from a pointer to a type with a different
5164 alias set and warn if so. If the result is defined in the same
5165 unit as this unchecked conversion, we can allow this because we
5166 can know to make the pointer type behave properly. */
5167 else if (POINTER_TYPE_P (gnu_target_type)
5168 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5169 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5171 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5172 ? TREE_TYPE (gnu_source_type)
5174 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5176 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5177 || get_alias_set (gnu_target_desig_type) != 0)
5178 && (!POINTER_TYPE_P (gnu_source_type)
5179 || (TYPE_DUMMY_P (gnu_source_desig_type)
5180 != TYPE_DUMMY_P (gnu_target_desig_type))
5181 || (TYPE_DUMMY_P (gnu_source_desig_type)
5182 && gnu_source_desig_type != gnu_target_desig_type)
5183 || !alias_sets_conflict_p
5184 (get_alias_set (gnu_source_desig_type),
5185 get_alias_set (gnu_target_desig_type))))
5188 ("?possible aliasing problem for type&",
5189 gnat_node, Target_Type (gnat_node));
5191 ("\\?use -fno-strict-aliasing switch for references",
5194 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5195 gnat_node, Target_Type (gnat_node));
5199 /* But if the result is a fat pointer type, we have no mechanism to
5200 do that, so we unconditionally warn in problematic cases. */
5201 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
5203 tree gnu_source_array_type
5204 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
5205 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5207 tree gnu_target_array_type
5208 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5210 if ((TYPE_DUMMY_P (gnu_target_array_type)
5211 || get_alias_set (gnu_target_array_type) != 0)
5212 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
5213 || (TYPE_DUMMY_P (gnu_source_array_type)
5214 != TYPE_DUMMY_P (gnu_target_array_type))
5215 || (TYPE_DUMMY_P (gnu_source_array_type)
5216 && gnu_source_array_type != gnu_target_array_type)
5217 || !alias_sets_conflict_p
5218 (get_alias_set (gnu_source_array_type),
5219 get_alias_set (gnu_target_array_type))))
5222 ("?possible aliasing problem for type&",
5223 gnat_node, Target_Type (gnat_node));
5225 ("\\?use -fno-strict-aliasing switch for references",
5230 gnu_result = alloc_stmt_list ();
5233 case N_SCIL_Dispatch_Table_Object_Init:
5234 case N_SCIL_Dispatch_Table_Tag_Init:
5235 case N_SCIL_Dispatching_Call:
5236 case N_SCIL_Membership_Test:
5237 case N_SCIL_Tag_Init:
5238 /* SCIL nodes require no processing for GCC. */
5239 gnu_result = alloc_stmt_list ();
5242 case N_Raise_Statement:
5243 case N_Function_Specification:
5244 case N_Procedure_Specification:
5246 case N_Component_Association:
5249 gcc_assert (type_annotate_only);
5250 gnu_result = alloc_stmt_list ();
5253 /* If we pushed our level as part of processing the elaboration routine,
5255 if (went_into_elab_proc)
5257 add_stmt (gnu_result);
5259 gnu_result = end_stmt_group ();
5260 current_function_decl = NULL_TREE;
5263 /* Set the location information on the result if it is a real expression.
5264 References can be reused for multiple GNAT nodes and they would get
5265 the location information of their last use. Note that we may have
5266 no result if we tried to build a CALL_EXPR node to a procedure with
5267 no side-effects and optimization is enabled. */
5269 && EXPR_P (gnu_result)
5270 && TREE_CODE (gnu_result) != NOP_EXPR
5271 && !REFERENCE_CLASS_P (gnu_result)
5272 && !EXPR_HAS_LOCATION (gnu_result))
5273 set_expr_location_from_node (gnu_result, gnat_node);
5275 /* If we're supposed to return something of void_type, it means we have
5276 something we're elaborating for effect, so just return. */
5277 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5280 /* If the result is a constant that overflowed, raise Constraint_Error. */
5281 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5283 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5285 = build1 (NULL_EXPR, gnu_result_type,
5286 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5287 N_Raise_Constraint_Error));
5290 /* If our result has side-effects and is of an unconstrained type,
5291 make a SAVE_EXPR so that we can be sure it will only be referenced
5292 once. Note we must do this before any conversions. */
5293 if (TREE_SIDE_EFFECTS (gnu_result)
5294 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5295 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5296 gnu_result = gnat_stabilize_reference (gnu_result, false);
5298 /* Now convert the result to the result type, unless we are in one of the
5301 1. If this is the Name of an assignment statement or a parameter of
5302 a procedure call, return the result almost unmodified since the
5303 RHS will have to be converted to our type in that case, unless
5304 the result type has a simpler size. Likewise if there is just
5305 a no-op unchecked conversion in-between. Similarly, don't convert
5306 integral types that are the operands of an unchecked conversion
5307 since we need to ignore those conversions (for 'Valid).
5309 2. If we have a label (which doesn't have any well-defined type), a
5310 field or an error, return the result almost unmodified. Also don't
5311 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5312 its size since those are the cases where the front end may have the
5313 type wrong due to "instantiating" the unconstrained record with
5314 discriminant values. Similarly, if the two types are record types
5315 with the same name don't convert. This will be the case when we are
5316 converting from a packable version of a type to its original type and
5317 we need those conversions to be NOPs in order for assignments into
5318 these types to work properly.
5320 3. If the type is void or if we have no result, return error_mark_node
5321 to show we have no result.
5323 4. Finally, if the type of the result is already correct. */
5325 if (Present (Parent (gnat_node))
5326 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5327 && Name (Parent (gnat_node)) == gnat_node)
5328 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5329 && unchecked_conversion_nop (Parent (gnat_node)))
5330 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5331 && Name (Parent (gnat_node)) != gnat_node)
5332 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5333 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5334 && !AGGREGATE_TYPE_P (gnu_result_type)
5335 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5336 && !(TYPE_SIZE (gnu_result_type)
5337 && TYPE_SIZE (TREE_TYPE (gnu_result))
5338 && (AGGREGATE_TYPE_P (gnu_result_type)
5339 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5340 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5341 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5343 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5344 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5345 && (CONTAINS_PLACEHOLDER_P
5346 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5347 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5348 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5350 /* Remove padding only if the inner object is of self-referential
5351 size: in that case it must be an object of unconstrained type
5352 with a default discriminant and we want to avoid copying too
5354 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5355 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5356 (TREE_TYPE (gnu_result))))))
5357 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5361 else if (TREE_CODE (gnu_result) == LABEL_DECL
5362 || TREE_CODE (gnu_result) == FIELD_DECL
5363 || TREE_CODE (gnu_result) == ERROR_MARK
5364 || (TYPE_SIZE (gnu_result_type)
5365 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5366 && TREE_CODE (gnu_result) != INDIRECT_REF
5367 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5368 || ((TYPE_NAME (gnu_result_type)
5369 == TYPE_NAME (TREE_TYPE (gnu_result)))
5370 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5371 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5373 /* Remove any padding. */
5374 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5375 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5379 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5380 gnu_result = error_mark_node;
5382 else if (gnu_result_type != TREE_TYPE (gnu_result))
5383 gnu_result = convert (gnu_result_type, gnu_result);
5385 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5386 while ((TREE_CODE (gnu_result) == NOP_EXPR
5387 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5388 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5389 gnu_result = TREE_OPERAND (gnu_result, 0);
5394 /* Subroutine of above to push the exception label stack. GNU_STACK is
5395 a pointer to the stack to update and GNAT_LABEL, if present, is the
5396 label to push onto the stack. */
5399 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5401 tree gnu_label = (Present (gnat_label)
5402 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5405 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5408 /* Record the current code position in GNAT_NODE. */
5411 record_code_position (Node_Id gnat_node)
5413 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5415 add_stmt_with_node (stmt_stmt, gnat_node);
5416 save_gnu_tree (gnat_node, stmt_stmt, true);
5419 /* Insert the code for GNAT_NODE at the position saved for that node. */
5422 insert_code_for (Node_Id gnat_node)
5424 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5425 save_gnu_tree (gnat_node, NULL_TREE, true);
5428 /* Start a new statement group chained to the previous group. */
5431 start_stmt_group (void)
5433 struct stmt_group *group = stmt_group_free_list;
5435 /* First see if we can get one from the free list. */
5437 stmt_group_free_list = group->previous;
5439 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5441 group->previous = current_stmt_group;
5442 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5443 current_stmt_group = group;
5446 /* Add GNU_STMT to the current statement group. */
5449 add_stmt (tree gnu_stmt)
5451 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5454 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5457 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5459 if (Present (gnat_node))
5460 set_expr_location_from_node (gnu_stmt, gnat_node);
5461 add_stmt (gnu_stmt);
5464 /* Add a declaration statement for GNU_DECL to the current statement group.
5465 Get SLOC from Entity_Id. */
5468 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5470 tree type = TREE_TYPE (gnu_decl);
5471 tree gnu_stmt, gnu_init, t;
5473 /* If this is a variable that Gigi is to ignore, we may have been given
5474 an ERROR_MARK. So test for it. We also might have been given a
5475 reference for a renaming. So only do something for a decl. Also
5476 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5477 if (!DECL_P (gnu_decl)
5478 || (TREE_CODE (gnu_decl) == TYPE_DECL
5479 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5482 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5484 /* If we are global, we don't want to actually output the DECL_EXPR for
5485 this decl since we already have evaluated the expressions in the
5486 sizes and positions as globals and doing it again would be wrong. */
5487 if (global_bindings_p ())
5489 /* Mark everything as used to prevent node sharing with subprograms.
5490 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5491 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5492 MARK_VISITED (gnu_stmt);
5493 if (TREE_CODE (gnu_decl) == VAR_DECL
5494 || TREE_CODE (gnu_decl) == CONST_DECL)
5496 MARK_VISITED (DECL_SIZE (gnu_decl));
5497 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
5498 MARK_VISITED (DECL_INITIAL (gnu_decl));
5500 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5501 else if (TREE_CODE (gnu_decl) == TYPE_DECL
5502 && ((TREE_CODE (type) == RECORD_TYPE
5503 && !TYPE_FAT_POINTER_P (type))
5504 || TREE_CODE (type) == UNION_TYPE
5505 || TREE_CODE (type) == QUAL_UNION_TYPE))
5506 MARK_VISITED (TYPE_ADA_SIZE (type));
5509 add_stmt_with_node (gnu_stmt, gnat_entity);
5511 /* If this is a variable and an initializer is attached to it, it must be
5512 valid for the context. Similar to init_const in create_var_decl_1. */
5513 if (TREE_CODE (gnu_decl) == VAR_DECL
5514 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5515 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5516 || (TREE_STATIC (gnu_decl)
5517 && !initializer_constant_valid_p (gnu_init,
5518 TREE_TYPE (gnu_init)))))
5520 /* If GNU_DECL has a padded type, convert it to the unpadded
5521 type so the assignment is done properly. */
5522 if (TYPE_IS_PADDING_P (type))
5523 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5527 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
5529 DECL_INITIAL (gnu_decl) = NULL_TREE;
5530 if (TREE_READONLY (gnu_decl))
5532 TREE_READONLY (gnu_decl) = 0;
5533 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5536 add_stmt_with_node (gnu_stmt, gnat_entity);
5540 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5543 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5547 if (TREE_VISITED (t))
5550 /* Don't mark a dummy type as visited because we want to mark its sizes
5551 and fields once it's filled in. */
5552 else if (!TYPE_IS_DUMMY_P (t))
5553 TREE_VISITED (t) = 1;
5556 TYPE_SIZES_GIMPLIFIED (t) = 1;
5561 /* Mark nodes rooted at T with TREE_VISITED and types as having their
5562 sized gimplified. We use this to indicate all variable sizes and
5563 positions in global types may not be shared by any subprogram. */
5566 mark_visited (tree t)
5568 walk_tree (&t, mark_visited_r, NULL, NULL);
5571 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5574 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5575 void *data ATTRIBUTE_UNUSED)
5579 if (TREE_CODE (t) == SAVE_EXPR)
5580 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5585 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5586 set its location to that of GNAT_NODE if present. */
5589 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5591 if (Present (gnat_node))
5592 set_expr_location_from_node (gnu_cleanup, gnat_node);
5593 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5596 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5599 set_block_for_group (tree gnu_block)
5601 gcc_assert (!current_stmt_group->block);
5602 current_stmt_group->block = gnu_block;
5605 /* Return code corresponding to the current code group. It is normally
5606 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5607 BLOCK or cleanups were set. */
5610 end_stmt_group (void)
5612 struct stmt_group *group = current_stmt_group;
5613 tree gnu_retval = group->stmt_list;
5615 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5616 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5617 make a BIND_EXPR. Note that we nest in that because the cleanup may
5618 reference variables in the block. */
5619 if (gnu_retval == NULL_TREE)
5620 gnu_retval = alloc_stmt_list ();
5622 if (group->cleanups)
5623 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5626 if (current_stmt_group->block)
5627 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5628 gnu_retval, group->block);
5630 /* Remove this group from the stack and add it to the free list. */
5631 current_stmt_group = group->previous;
5632 group->previous = stmt_group_free_list;
5633 stmt_group_free_list = group;
5638 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5642 add_stmt_list (List_Id gnat_list)
5646 if (Present (gnat_list))
5647 for (gnat_node = First (gnat_list); Present (gnat_node);
5648 gnat_node = Next (gnat_node))
5649 add_stmt (gnat_to_gnu (gnat_node));
5652 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5653 If BINDING_P is true, push and pop a binding level around the list. */
5656 build_stmt_group (List_Id gnat_list, bool binding_p)
5658 start_stmt_group ();
5662 add_stmt_list (gnat_list);
5666 return end_stmt_group ();
5669 /* Push and pop routines for stacks. We keep a free list around so we
5670 don't waste tree nodes. */
5673 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5675 tree gnu_node = gnu_stack_free_list;
5679 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5680 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5681 TREE_PURPOSE (gnu_node) = gnu_purpose;
5682 TREE_VALUE (gnu_node) = gnu_value;
5685 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5687 *gnu_stack_ptr = gnu_node;
5691 pop_stack (tree *gnu_stack_ptr)
5693 tree gnu_node = *gnu_stack_ptr;
5695 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5696 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5697 gnu_stack_free_list = gnu_node;
5700 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5703 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5704 gimple_seq *post_p ATTRIBUTE_UNUSED)
5706 tree expr = *expr_p;
5709 if (IS_ADA_STMT (expr))
5710 return gnat_gimplify_stmt (expr_p);
5712 switch (TREE_CODE (expr))
5715 /* If this is for a scalar, just make a VAR_DECL for it. If for
5716 an aggregate, get a null pointer of the appropriate type and
5718 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5719 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5720 convert (build_pointer_type (TREE_TYPE (expr)),
5721 integer_zero_node));
5724 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5725 TREE_NO_WARNING (*expr_p) = 1;
5728 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5731 case UNCONSTRAINED_ARRAY_REF:
5732 /* We should only do this if we are just elaborating for side-effects,
5733 but we can't know that yet. */
5734 *expr_p = TREE_OPERAND (*expr_p, 0);
5738 op = TREE_OPERAND (expr, 0);
5740 /* If we are taking the address of a constant CONSTRUCTOR, force it to
5741 be put into static memory. We know it's going to be readonly given
5742 the semantics we have and it's required to be in static memory when
5743 the reference is in an elaboration procedure. */
5744 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5746 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5747 TREE_ADDRESSABLE (new_var) = 1;
5749 TREE_READONLY (new_var) = 1;
5750 TREE_STATIC (new_var) = 1;
5751 DECL_INITIAL (new_var) = op;
5753 TREE_OPERAND (expr, 0) = new_var;
5754 recompute_tree_invariant_for_addr_expr (expr);
5758 /* If we are taking the address of a SAVE_EXPR, we are typically dealing
5759 with a misaligned argument to be passed by reference in a subprogram
5760 call. We cannot let the common gimplifier code perform the creation
5761 of the temporary and its initialization because, in order to ensure
5762 that the final copy operation is a store and since the temporary made
5763 for a SAVE_EXPR is not addressable, it may create another temporary,
5764 addressable this time, which would break the back copy mechanism for
5765 an IN OUT parameter. */
5766 if (TREE_CODE (op) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (op))
5768 tree mod, val = TREE_OPERAND (op, 0);
5769 tree new_var = create_tmp_var (TREE_TYPE (op), "S");
5770 TREE_ADDRESSABLE (new_var) = 1;
5772 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, val);
5773 if (EXPR_HAS_LOCATION (val))
5774 SET_EXPR_LOCATION (mod, EXPR_LOCATION (val));
5775 gimplify_and_add (mod, pre_p);
5778 TREE_OPERAND (op, 0) = new_var;
5779 SAVE_EXPR_RESOLVED_P (op) = 1;
5781 TREE_OPERAND (expr, 0) = new_var;
5782 recompute_tree_invariant_for_addr_expr (expr);
5786 return GS_UNHANDLED;
5789 op = DECL_EXPR_DECL (expr);
5791 /* The expressions for the RM bounds must be gimplified to ensure that
5792 they are properly elaborated. See gimplify_decl_expr. */
5793 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
5794 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
5795 switch (TREE_CODE (TREE_TYPE (op)))
5802 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
5804 val = TYPE_RM_MIN_VALUE (type);
5807 gimplify_one_sizepos (&val, pre_p);
5808 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
5809 SET_TYPE_RM_MIN_VALUE (t, val);
5812 val = TYPE_RM_MAX_VALUE (type);
5815 gimplify_one_sizepos (&val, pre_p);
5816 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
5817 SET_TYPE_RM_MAX_VALUE (t, val);
5827 /* ... fall through ... */
5830 return GS_UNHANDLED;
5834 /* Generate GIMPLE in place for the statement at *STMT_P. */
5836 static enum gimplify_status
5837 gnat_gimplify_stmt (tree *stmt_p)
5839 tree stmt = *stmt_p;
5841 switch (TREE_CODE (stmt))
5844 *stmt_p = STMT_STMT_STMT (stmt);
5849 tree gnu_start_label = create_artificial_label (input_location);
5850 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5853 /* Set to emit the statements of the loop. */
5854 *stmt_p = NULL_TREE;
5856 /* We first emit the start label and then a conditional jump to
5857 the end label if there's a top condition, then the body of the
5858 loop, then a conditional branch to the end label, then the update,
5859 if any, and finally a jump to the start label and the definition
5860 of the end label. */
5861 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5865 if (LOOP_STMT_TOP_COND (stmt))
5866 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5867 LOOP_STMT_TOP_COND (stmt),
5874 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5876 if (LOOP_STMT_BOT_COND (stmt))
5877 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5878 LOOP_STMT_BOT_COND (stmt),
5885 if (LOOP_STMT_UPDATE (stmt))
5886 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5888 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5889 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5890 append_to_statement_list (t, stmt_p);
5892 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5899 /* Build a statement to jump to the corresponding end label, then
5900 see if it needs to be conditional. */
5901 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5902 if (EXIT_STMT_COND (stmt))
5903 *stmt_p = build3 (COND_EXPR, void_type_node,
5904 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5912 /* Force references to each of the entities in packages withed by GNAT_NODE.
5913 Operate recursively but check that we aren't elaborating something more
5916 This routine is exclusively called in type_annotate mode, to compute DDA
5917 information for types in withed units, for ASIS use. */
5920 elaborate_all_entities (Node_Id gnat_node)
5922 Entity_Id gnat_with_clause, gnat_entity;
5924 /* Process each unit only once. As we trace the context of all relevant
5925 units transitively, including generic bodies, we may encounter the
5926 same generic unit repeatedly. */
5927 if (!present_gnu_tree (gnat_node))
5928 save_gnu_tree (gnat_node, integer_zero_node, true);
5930 /* Save entities in all context units. A body may have an implicit_with
5931 on its own spec, if the context includes a child unit, so don't save
5933 for (gnat_with_clause = First (Context_Items (gnat_node));
5934 Present (gnat_with_clause);
5935 gnat_with_clause = Next (gnat_with_clause))
5936 if (Nkind (gnat_with_clause) == N_With_Clause
5937 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5938 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5940 elaborate_all_entities (Library_Unit (gnat_with_clause));
5942 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5944 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5945 Present (gnat_entity);
5946 gnat_entity = Next_Entity (gnat_entity))
5947 if (Is_Public (gnat_entity)
5948 && Convention (gnat_entity) != Convention_Intrinsic
5949 && Ekind (gnat_entity) != E_Package
5950 && Ekind (gnat_entity) != E_Package_Body
5951 && Ekind (gnat_entity) != E_Operator
5952 && !(IN (Ekind (gnat_entity), Type_Kind)
5953 && !Is_Frozen (gnat_entity))
5954 && !((Ekind (gnat_entity) == E_Procedure
5955 || Ekind (gnat_entity) == E_Function)
5956 && Is_Intrinsic_Subprogram (gnat_entity))
5957 && !IN (Ekind (gnat_entity), Named_Kind)
5958 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5959 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5961 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5964 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5966 /* Retrieve compilation unit node of generic body. */
5967 while (Present (gnat_body)
5968 && Nkind (gnat_body) != N_Compilation_Unit)
5969 gnat_body = Parent (gnat_body);
5971 /* If body is available, elaborate its context. */
5972 if (Present (gnat_body))
5973 elaborate_all_entities (gnat_body);
5977 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5978 elaborate_all_entities (Library_Unit (gnat_node));
5981 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5984 process_freeze_entity (Node_Id gnat_node)
5986 Entity_Id gnat_entity = Entity (gnat_node);
5990 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
5991 && present_gnu_tree (Declaration_Node (gnat_entity)))
5992 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
5994 /* If this is a package, need to generate code for the package. */
5995 if (Ekind (gnat_entity) == E_Package)
5998 (Parent (Corresponding_Body
5999 (Parent (Declaration_Node (gnat_entity)))));
6003 /* Check for old definition after the above call. This Freeze_Node
6004 might be for one its Itypes. */
6006 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6008 /* If this entity has an Address representation clause, GNU_OLD is the
6009 address, so discard it here. */
6010 if (Present (Address_Clause (gnat_entity)))
6013 /* Don't do anything for class-wide types as they are always transformed
6014 into their root type. */
6015 if (Ekind (gnat_entity) == E_Class_Wide_Type)
6018 /* Don't do anything for subprograms that may have been elaborated before
6019 their freeze nodes. This can happen, for example because of an inner call
6020 in an instance body, or a previous compilation of a spec for inlining
6023 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6024 && (Ekind (gnat_entity) == E_Function
6025 || Ekind (gnat_entity) == E_Procedure))
6027 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6028 && Ekind (gnat_entity) == E_Subprogram_Type)))
6031 /* If we have a non-dummy type old tree, we have nothing to do, except
6032 aborting if this is the public view of a private type whose full view was
6033 not delayed, as this node was never delayed as it should have been. We
6034 let this happen for concurrent types and their Corresponding_Record_Type,
6035 however, because each might legitimately be elaborated before it's own
6036 freeze node, e.g. while processing the other. */
6038 && !(TREE_CODE (gnu_old) == TYPE_DECL
6039 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6041 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6042 && Present (Full_View (gnat_entity))
6043 && No (Freeze_Node (Full_View (gnat_entity))))
6044 || Is_Concurrent_Type (gnat_entity)
6045 || (IN (Ekind (gnat_entity), Record_Kind)
6046 && Is_Concurrent_Record_Type (gnat_entity)));
6050 /* Reset the saved tree, if any, and elaborate the object or type for real.
6051 If there is a full declaration, elaborate it and copy the type to
6052 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6053 a class wide type or subtype. */
6056 save_gnu_tree (gnat_entity, NULL_TREE, false);
6057 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6058 && Present (Full_View (gnat_entity))
6059 && present_gnu_tree (Full_View (gnat_entity)))
6060 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6061 if (Present (Class_Wide_Type (gnat_entity))
6062 && Class_Wide_Type (gnat_entity) != gnat_entity)
6063 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6066 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6067 && Present (Full_View (gnat_entity)))
6069 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6071 /* Propagate back-annotations from full view to partial view. */
6072 if (Unknown_Alignment (gnat_entity))
6073 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6075 if (Unknown_Esize (gnat_entity))
6076 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6078 if (Unknown_RM_Size (gnat_entity))
6079 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6081 /* The above call may have defined this entity (the simplest example
6082 of this is when we have a private enumeral type since the bounds
6083 will have the public view. */
6084 if (!present_gnu_tree (gnat_entity))
6085 save_gnu_tree (gnat_entity, gnu_new, false);
6086 if (Present (Class_Wide_Type (gnat_entity))
6087 && Class_Wide_Type (gnat_entity) != gnat_entity)
6088 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6091 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6093 /* If we've made any pointers to the old version of this type, we
6094 have to update them. */
6096 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6097 TREE_TYPE (gnu_new));
6100 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6101 N_Compilation_Unit. */
6104 process_inlined_subprograms (Node_Id gnat_node)
6106 Entity_Id gnat_entity;
6109 /* If we can inline, generate Gimple for all the inlined subprograms.
6110 Define the entity first so we set DECL_EXTERNAL. */
6112 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6113 Present (gnat_entity);
6114 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6116 gnat_body = Parent (Declaration_Node (gnat_entity));
6118 if (Nkind (gnat_body) != N_Subprogram_Body)
6120 /* ??? This really should always be Present. */
6121 if (No (Corresponding_Body (gnat_body)))
6125 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6128 if (Present (gnat_body))
6130 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6131 add_stmt (gnat_to_gnu (gnat_body));
6136 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6137 We make two passes, one to elaborate anything other than bodies (but
6138 we declare a function if there was no spec). The second pass
6139 elaborates the bodies.
6141 GNAT_END_LIST gives the element in the list past the end. Normally,
6142 this is Empty, but can be First_Real_Statement for a
6143 Handled_Sequence_Of_Statements.
6145 We make a complete pass through both lists if PASS1P is true, then make
6146 the second pass over both lists if PASS2P is true. The lists usually
6147 correspond to the public and private parts of a package. */
6150 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6151 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6153 List_Id gnat_decl_array[2];
6157 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6160 for (i = 0; i <= 1; i++)
6161 if (Present (gnat_decl_array[i]))
6162 for (gnat_decl = First (gnat_decl_array[i]);
6163 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6165 /* For package specs, we recurse inside the declarations,
6166 thus taking the two pass approach inside the boundary. */
6167 if (Nkind (gnat_decl) == N_Package_Declaration
6168 && (Nkind (Specification (gnat_decl)
6169 == N_Package_Specification)))
6170 process_decls (Visible_Declarations (Specification (gnat_decl)),
6171 Private_Declarations (Specification (gnat_decl)),
6172 Empty, true, false);
6174 /* Similarly for any declarations in the actions of a
6176 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6178 process_freeze_entity (gnat_decl);
6179 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6182 /* Package bodies with freeze nodes get their elaboration deferred
6183 until the freeze node, but the code must be placed in the right
6184 place, so record the code position now. */
6185 else if (Nkind (gnat_decl) == N_Package_Body
6186 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6187 record_code_position (gnat_decl);
6189 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6190 && Present (Library_Unit (gnat_decl))
6191 && Present (Freeze_Node
6194 (Library_Unit (gnat_decl)))))))
6195 record_code_position
6196 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6198 /* We defer most subprogram bodies to the second pass. */
6199 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6201 if (Acts_As_Spec (gnat_decl))
6203 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6205 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6206 && Ekind (gnat_subprog_id) != E_Generic_Function)
6207 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6211 /* For bodies and stubs that act as their own specs, the entity
6212 itself must be elaborated in the first pass, because it may
6213 be used in other declarations. */
6214 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6216 Node_Id gnat_subprog_id
6217 = Defining_Entity (Specification (gnat_decl));
6219 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6220 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6221 && Ekind (gnat_subprog_id) != E_Generic_Function)
6222 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6225 /* Concurrent stubs stand for the corresponding subprogram bodies,
6226 which are deferred like other bodies. */
6227 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6228 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6232 add_stmt (gnat_to_gnu (gnat_decl));
6235 /* Here we elaborate everything we deferred above except for package bodies,
6236 which are elaborated at their freeze nodes. Note that we must also
6237 go inside things (package specs and freeze nodes) the first pass did. */
6239 for (i = 0; i <= 1; i++)
6240 if (Present (gnat_decl_array[i]))
6241 for (gnat_decl = First (gnat_decl_array[i]);
6242 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6244 if (Nkind (gnat_decl) == N_Subprogram_Body
6245 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6246 || Nkind (gnat_decl) == N_Task_Body_Stub
6247 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6248 add_stmt (gnat_to_gnu (gnat_decl));
6250 else if (Nkind (gnat_decl) == N_Package_Declaration
6251 && (Nkind (Specification (gnat_decl)
6252 == N_Package_Specification)))
6253 process_decls (Visible_Declarations (Specification (gnat_decl)),
6254 Private_Declarations (Specification (gnat_decl)),
6255 Empty, false, true);
6257 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6258 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6262 /* Make a unary operation of kind CODE using build_unary_op, but guard
6263 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6264 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6265 the operation is to be performed in that type. GNAT_NODE is the gnat
6266 node conveying the source location for which the error should be
6270 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6273 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6275 operand = protect_multiple_eval (operand);
6277 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6278 operand, TYPE_MIN_VALUE (gnu_type)),
6279 build_unary_op (code, gnu_type, operand),
6280 CE_Overflow_Check_Failed, gnat_node);
6283 /* Make a binary operation of kind CODE using build_binary_op, but guard
6284 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6285 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6286 Usually the operation is to be performed in that type. GNAT_NODE is
6287 the GNAT node conveying the source location for which the error should
6291 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6292 tree right, Node_Id gnat_node)
6294 tree lhs = protect_multiple_eval (left);
6295 tree rhs = protect_multiple_eval (right);
6296 tree type_max = TYPE_MAX_VALUE (gnu_type);
6297 tree type_min = TYPE_MIN_VALUE (gnu_type);
6300 tree zero = convert (gnu_type, integer_zero_node);
6305 int precision = TYPE_PRECISION (gnu_type);
6307 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6309 /* Prefer a constant or known-positive rhs to simplify checks. */
6310 if (!TREE_CONSTANT (rhs)
6311 && commutative_tree_code (code)
6312 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6313 && tree_expr_nonnegative_p (lhs))))
6320 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6322 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6324 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6326 /* Try a few strategies that may be cheaper than the general
6327 code at the end of the function, if the rhs is not known.
6329 - Call library function for 64-bit multiplication (complex)
6330 - Widen, if input arguments are sufficiently small
6331 - Determine overflow using wrapped result for addition/subtraction. */
6333 if (!TREE_CONSTANT (rhs))
6335 /* Even for add/subtract double size to get another base type. */
6336 int needed_precision = precision * 2;
6338 if (code == MULT_EXPR && precision == 64)
6340 tree int_64 = gnat_type_for_size (64, 0);
6342 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6343 convert (int_64, lhs),
6344 convert (int_64, rhs)));
6347 else if (needed_precision <= BITS_PER_WORD
6348 || (code == MULT_EXPR
6349 && needed_precision <= LONG_LONG_TYPE_SIZE))
6351 tree wide_type = gnat_type_for_size (needed_precision, 0);
6353 tree wide_result = build_binary_op (code, wide_type,
6354 convert (wide_type, lhs),
6355 convert (wide_type, rhs));
6357 tree check = build_binary_op
6358 (TRUTH_ORIF_EXPR, integer_type_node,
6359 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6360 convert (wide_type, type_min)),
6361 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6362 convert (wide_type, type_max)));
6364 tree result = convert (gnu_type, wide_result);
6367 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6370 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6372 tree unsigned_type = gnat_type_for_size (precision, 1);
6373 tree wrapped_expr = convert
6374 (gnu_type, build_binary_op (code, unsigned_type,
6375 convert (unsigned_type, lhs),
6376 convert (unsigned_type, rhs)));
6378 tree result = convert
6379 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6381 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6382 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6383 tree check = build_binary_op
6384 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6385 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6386 integer_type_node, wrapped_expr, lhs));
6389 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6396 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6397 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6398 build_binary_op (MINUS_EXPR, gnu_type,
6401 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6402 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6403 build_binary_op (MINUS_EXPR, gnu_type,
6408 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6409 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6410 build_binary_op (PLUS_EXPR, gnu_type,
6413 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6414 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6415 build_binary_op (PLUS_EXPR, gnu_type,
6420 /* The check here is designed to be efficient if the rhs is constant,
6421 but it will work for any rhs by using integer division.
6422 Four different check expressions determine wether X * C overflows,
6425 C > 0 => X > type_max / C || X < type_min / C
6426 C == -1 => X == type_min
6427 C < -1 => X > type_min / C || X < type_max / C */
6429 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6430 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6432 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6433 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6434 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6435 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6436 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6438 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6439 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6440 build_int_cst (gnu_type, -1)),
6441 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6442 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6443 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6444 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6451 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6453 /* If we can fold the expression to a constant, just return it.
6454 The caller will deal with overflow, no need to generate a check. */
6455 if (TREE_CONSTANT (gnu_expr))
6458 check = fold_build3 (COND_EXPR, integer_type_node,
6459 rhs_lt_zero, check_neg, check_pos);
6461 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6464 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6465 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6466 which we have to check. GNAT_NODE is the GNAT node conveying the source
6467 location for which the error should be signaled. */
6470 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6472 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6473 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6474 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6475 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6477 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6478 This can for example happen when translating 'Val or 'Value. */
6479 if (gnu_compare_type == gnu_range_type)
6482 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6483 we can't do anything since we might be truncating the bounds. No
6484 check is needed in this case. */
6485 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6486 && (TYPE_PRECISION (gnu_compare_type)
6487 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6490 /* Checked expressions must be evaluated only once. */
6491 gnu_expr = protect_multiple_eval (gnu_expr);
6493 /* There's no good type to use here, so we might as well use
6494 integer_type_node. Note that the form of the check is
6495 (not (expr >= lo)) or (not (expr <= hi))
6496 the reason for this slightly convoluted form is that NaNs
6497 are not considered to be in range in the float case. */
6499 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6501 (build_binary_op (GE_EXPR, integer_type_node,
6502 convert (gnu_compare_type, gnu_expr),
6503 convert (gnu_compare_type, gnu_low))),
6505 (build_binary_op (LE_EXPR, integer_type_node,
6506 convert (gnu_compare_type, gnu_expr),
6507 convert (gnu_compare_type,
6509 gnu_expr, CE_Range_Check_Failed, gnat_node);
6512 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6513 we are about to index, GNU_EXPR is the index expression to be checked,
6514 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6515 has to be checked. Note that for index checking we cannot simply use the
6516 emit_range_check function (although very similar code needs to be generated
6517 in both cases) since for index checking the array type against which we are
6518 checking the indices may be unconstrained and consequently we need to get
6519 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6520 The place where we need to do that is in subprograms having unconstrained
6521 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6522 location for which the error should be signaled. */
6525 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6526 tree gnu_high, Node_Id gnat_node)
6528 tree gnu_expr_check;
6530 /* Checked expressions must be evaluated only once. */
6531 gnu_expr = protect_multiple_eval (gnu_expr);
6533 /* Must do this computation in the base type in case the expression's
6534 type is an unsigned subtypes. */
6535 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6537 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6538 the object we are handling. */
6539 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6540 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6542 /* There's no good type to use here, so we might as well use
6543 integer_type_node. */
6545 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6546 build_binary_op (LT_EXPR, integer_type_node,
6548 convert (TREE_TYPE (gnu_expr_check),
6550 build_binary_op (GT_EXPR, integer_type_node,
6552 convert (TREE_TYPE (gnu_expr_check),
6554 gnu_expr, CE_Index_Check_Failed, gnat_node);
6557 /* GNU_COND contains the condition corresponding to an access, discriminant or
6558 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6559 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6560 REASON is the code that says why the exception was raised. GNAT_NODE is
6561 the GNAT node conveying the source location for which the error should be
6565 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6568 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6570 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6571 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6572 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6575 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6576 we don't need to evaluate it just for the check. */
6577 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6582 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6583 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6584 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6585 float to integer conversion with truncation; otherwise round.
6586 GNAT_NODE is the GNAT node conveying the source location for which the
6587 error should be signaled. */
6590 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6591 bool rangep, bool truncatep, Node_Id gnat_node)
6593 tree gnu_type = get_unpadded_type (gnat_type);
6594 tree gnu_in_type = TREE_TYPE (gnu_expr);
6595 tree gnu_in_basetype = get_base_type (gnu_in_type);
6596 tree gnu_base_type = get_base_type (gnu_type);
6597 tree gnu_result = gnu_expr;
6599 /* If we are not doing any checks, the output is an integral type, and
6600 the input is not a floating type, just do the conversion. This
6601 shortcut is required to avoid problems with packed array types
6602 and simplifies code in all cases anyway. */
6603 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6604 && !FLOAT_TYPE_P (gnu_in_type))
6605 return convert (gnu_type, gnu_expr);
6607 /* First convert the expression to its base type. This
6608 will never generate code, but makes the tests below much simpler.
6609 But don't do this if converting from an integer type to an unconstrained
6610 array type since then we need to get the bounds from the original
6612 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6613 gnu_result = convert (gnu_in_basetype, gnu_result);
6615 /* If overflow checks are requested, we need to be sure the result will
6616 fit in the output base type. But don't do this if the input
6617 is integer and the output floating-point. */
6619 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6621 /* Ensure GNU_EXPR only gets evaluated once. */
6622 tree gnu_input = protect_multiple_eval (gnu_result);
6623 tree gnu_cond = integer_zero_node;
6624 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6625 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6626 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6627 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6629 /* Convert the lower bounds to signed types, so we're sure we're
6630 comparing them properly. Likewise, convert the upper bounds
6631 to unsigned types. */
6632 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6633 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6635 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6636 && !TYPE_UNSIGNED (gnu_in_basetype))
6637 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6639 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6640 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6642 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6643 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6645 /* Check each bound separately and only if the result bound
6646 is tighter than the bound on the input type. Note that all the
6647 types are base types, so the bounds must be constant. Also,
6648 the comparison is done in the base type of the input, which
6649 always has the proper signedness. First check for input
6650 integer (which means output integer), output float (which means
6651 both float), or mixed, in which case we always compare.
6652 Note that we have to do the comparison which would *fail* in the
6653 case of an error since if it's an FP comparison and one of the
6654 values is a NaN or Inf, the comparison will fail. */
6655 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6656 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6657 : (FLOAT_TYPE_P (gnu_base_type)
6658 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6659 TREE_REAL_CST (gnu_out_lb))
6663 (build_binary_op (GE_EXPR, integer_type_node,
6664 gnu_input, convert (gnu_in_basetype,
6667 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6668 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6669 : (FLOAT_TYPE_P (gnu_base_type)
6670 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6671 TREE_REAL_CST (gnu_in_lb))
6674 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6676 (build_binary_op (LE_EXPR, integer_type_node,
6678 convert (gnu_in_basetype,
6681 if (!integer_zerop (gnu_cond))
6682 gnu_result = emit_check (gnu_cond, gnu_input,
6683 CE_Overflow_Check_Failed, gnat_node);
6686 /* Now convert to the result base type. If this is a non-truncating
6687 float-to-integer conversion, round. */
6688 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6691 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6692 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
6693 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6694 const struct real_format *fmt;
6696 /* The following calculations depend on proper rounding to even
6697 of each arithmetic operation. In order to prevent excess
6698 precision from spoiling this property, use the widest hardware
6699 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6701 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6703 /* FIXME: Should not have padding in the first place. */
6704 if (TYPE_IS_PADDING_P (calc_type))
6705 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6707 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6708 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6709 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6710 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6711 half_minus_pred_half);
6712 gnu_pred_half = build_real (calc_type, pred_half);
6714 /* If the input is strictly negative, subtract this value
6715 and otherwise add it from the input. For 0.5, the result
6716 is exactly between 1.0 and the machine number preceding 1.0
6717 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6718 will round to 1.0, while all other number with an absolute
6719 value less than 0.5 round to 0.0. For larger numbers exactly
6720 halfway between integers, rounding will always be correct as
6721 the true mathematical result will be closer to the higher
6722 integer compared to the lower one. So, this constant works
6723 for all floating-point numbers.
6725 The reason to use the same constant with subtract/add instead
6726 of a positive and negative constant is to allow the comparison
6727 to be scheduled in parallel with retrieval of the constant and
6728 conversion of the input to the calc_type (if necessary). */
6730 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6731 gnu_result = protect_multiple_eval (gnu_result);
6732 gnu_conv = convert (calc_type, gnu_result);
6734 = fold_build2 (GE_EXPR, integer_type_node, gnu_result, gnu_zero);
6736 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6737 gnu_subtract_pred_half
6738 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6739 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
6740 gnu_add_pred_half, gnu_subtract_pred_half);
6743 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6744 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6745 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6746 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6748 gnu_result = convert (gnu_base_type, gnu_result);
6750 /* Finally, do the range check if requested. Note that if the result type
6751 is a modular type, the range check is actually an overflow check. */
6753 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6754 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6755 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6757 return convert (gnu_type, gnu_result);
6760 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6763 smaller_packable_type_p (tree type, tree record_type)
6767 /* We're not interested in variants here. */
6768 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6771 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6772 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6775 size = TYPE_SIZE (type);
6776 rsize = TYPE_SIZE (record_type);
6778 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6781 return tree_int_cst_lt (size, rsize) != 0;
6784 /* Return true if GNU_EXPR can be directly addressed. This is the case
6785 unless it is an expression involving computation or if it involves a
6786 reference to a bitfield or to an object not sufficiently aligned for
6787 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6788 be directly addressed as an object of this type.
6790 *** Notes on addressability issues in the Ada compiler ***
6792 This predicate is necessary in order to bridge the gap between Gigi
6793 and the middle-end about addressability of GENERIC trees. A tree
6794 is said to be addressable if it can be directly addressed, i.e. if
6795 its address can be taken, is a multiple of the type's alignment on
6796 strict-alignment architectures and returns the first storage unit
6797 assigned to the object represented by the tree.
6799 In the C family of languages, everything is in practice addressable
6800 at the language level, except for bit-fields. This means that these
6801 compilers will take the address of any tree that doesn't represent
6802 a bit-field reference and expect the result to be the first storage
6803 unit assigned to the object. Even in cases where this will result
6804 in unaligned accesses at run time, nothing is supposed to be done
6805 and the program is considered as erroneous instead (see PR c/18287).
6807 The implicit assumptions made in the middle-end are in keeping with
6808 the C viewpoint described above:
6809 - the address of a bit-field reference is supposed to be never
6810 taken; the compiler (generally) will stop on such a construct,
6811 - any other tree is addressable if it is formally addressable,
6812 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6814 In Ada, the viewpoint is the opposite one: nothing is addressable
6815 at the language level unless explicitly declared so. This means
6816 that the compiler will both make sure that the trees representing
6817 references to addressable ("aliased" in Ada parlance) objects are
6818 addressable and make no real attempts at ensuring that the trees
6819 representing references to non-addressable objects are addressable.
6821 In the first case, Ada is effectively equivalent to C and handing
6822 down the direct result of applying ADDR_EXPR to these trees to the
6823 middle-end works flawlessly. In the second case, Ada cannot afford
6824 to consider the program as erroneous if the address of trees that
6825 are not addressable is requested for technical reasons, unlike C;
6826 as a consequence, the Ada compiler must arrange for either making
6827 sure that this address is not requested in the middle-end or for
6828 compensating by inserting temporaries if it is requested in Gigi.
6830 The first goal can be achieved because the middle-end should not
6831 request the address of non-addressable trees on its own; the only
6832 exception is for the invocation of low-level block operations like
6833 memcpy, for which the addressability requirements are lower since
6834 the type's alignment can be disregarded. In practice, this means
6835 that Gigi must make sure that such operations cannot be applied to
6836 non-BLKmode bit-fields.
6838 The second goal is achieved by means of the addressable_p predicate
6839 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6840 They will be turned during gimplification into proper temporaries
6841 whose address will be used in lieu of that of the original tree. */
6844 addressable_p (tree gnu_expr, tree gnu_type)
6846 /* The size of the real type of the object must not be smaller than
6847 that of the expected type, otherwise an indirect access in the
6848 latter type would be larger than the object. Only records need
6849 to be considered in practice. */
6851 && TREE_CODE (gnu_type) == RECORD_TYPE
6852 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6855 switch (TREE_CODE (gnu_expr))
6861 /* All DECLs are addressable: if they are in a register, we can force
6865 case UNCONSTRAINED_ARRAY_REF:
6881 /* All rvalues are deemed addressable since taking their address will
6882 force a temporary to be created by the middle-end. */
6886 /* We accept &COND_EXPR as soon as both operands are addressable and
6887 expect the outcome to be the address of the selected operand. */
6888 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6889 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6892 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6893 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6894 the field is sufficiently aligned, in case it is subject
6895 to a pragma Component_Alignment. But we don't need to
6896 check the alignment of the containing record, as it is
6897 guaranteed to be not smaller than that of its most
6898 aligned field that is not a bit-field. */
6899 && (!STRICT_ALIGNMENT
6900 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6901 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6902 /* The field of a padding record is always addressable. */
6903 || TYPE_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6904 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6906 case ARRAY_REF: case ARRAY_RANGE_REF:
6907 case REALPART_EXPR: case IMAGPART_EXPR:
6909 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6912 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6913 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6915 case VIEW_CONVERT_EXPR:
6917 /* This is addressable if we can avoid a copy. */
6918 tree type = TREE_TYPE (gnu_expr);
6919 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6920 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6921 && (!STRICT_ALIGNMENT
6922 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6923 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6924 || ((TYPE_MODE (type) == BLKmode
6925 || TYPE_MODE (inner_type) == BLKmode)
6926 && (!STRICT_ALIGNMENT
6927 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6928 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6929 || TYPE_ALIGN_OK (type)
6930 || TYPE_ALIGN_OK (inner_type))))
6931 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6939 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6940 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6941 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6944 process_type (Entity_Id gnat_entity)
6947 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6950 /* If we are to delay elaboration of this type, just do any
6951 elaborations needed for expressions within the declaration and
6952 make a dummy type entry for this node and its Full_View (if
6953 any) in case something points to it. Don't do this if it
6954 has already been done (the only way that can happen is if
6955 the private completion is also delayed). */
6956 if (Present (Freeze_Node (gnat_entity))
6957 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6958 && Present (Full_View (gnat_entity))
6959 && Freeze_Node (Full_View (gnat_entity))
6960 && !present_gnu_tree (Full_View (gnat_entity))))
6962 elaborate_entity (gnat_entity);
6966 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6967 save_gnu_tree (gnat_entity, gnu_decl, false);
6968 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6969 && Present (Full_View (gnat_entity)))
6970 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6976 /* If we saved away a dummy type for this node it means that this
6977 made the type that corresponds to the full type of an incomplete
6978 type. Clear that type for now and then update the type in the
6982 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6983 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6985 save_gnu_tree (gnat_entity, NULL_TREE, false);
6988 /* Now fully elaborate the type. */
6989 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
6990 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
6992 /* If we have an old type and we've made pointers to this type,
6993 update those pointers. */
6995 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6996 TREE_TYPE (gnu_new));
6998 /* If this is a record type corresponding to a task or protected type
6999 that is a completion of an incomplete type, perform a similar update
7000 on the type. ??? Including protected types here is a guess. */
7001 if (IN (Ekind (gnat_entity), Record_Kind)
7002 && Is_Concurrent_Record_Type (gnat_entity)
7003 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7006 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7008 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7010 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7013 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7014 TREE_TYPE (gnu_new));
7018 /* GNAT_ENTITY is the type of the resulting constructors,
7019 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7020 and GNU_TYPE is the GCC type of the corresponding record.
7022 Return a CONSTRUCTOR to build the record. */
7025 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7027 tree gnu_list, gnu_result;
7029 /* We test for GNU_FIELD being empty in the case where a variant
7030 was the last thing since we don't take things off GNAT_ASSOC in
7031 that case. We check GNAT_ASSOC in case we have a variant, but it
7034 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7035 gnat_assoc = Next (gnat_assoc))
7037 Node_Id gnat_field = First (Choices (gnat_assoc));
7038 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7039 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7041 /* The expander is supposed to put a single component selector name
7042 in every record component association. */
7043 gcc_assert (No (Next (gnat_field)));
7045 /* Ignore fields that have Corresponding_Discriminants since we'll
7046 be setting that field in the parent. */
7047 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7048 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7051 /* Also ignore discriminants of Unchecked_Unions. */
7052 else if (Is_Unchecked_Union (gnat_entity)
7053 && Ekind (Entity (gnat_field)) == E_Discriminant)
7056 /* Before assigning a value in an aggregate make sure range checks
7057 are done if required. Then convert to the type of the field. */
7058 if (Do_Range_Check (Expression (gnat_assoc)))
7059 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7061 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7063 /* Add the field and expression to the list. */
7064 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7067 gnu_result = extract_values (gnu_list, gnu_type);
7069 #ifdef ENABLE_CHECKING
7073 /* Verify every entry in GNU_LIST was used. */
7074 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7075 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7082 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7083 the first element of an array aggregate. It may itself be an aggregate.
7084 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7085 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7086 for range checking. */
7089 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7090 Entity_Id gnat_component_type)
7092 tree gnu_expr_list = NULL_TREE;
7093 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7096 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7098 /* If the expression is itself an array aggregate then first build the
7099 innermost constructor if it is part of our array (multi-dimensional
7101 if (Nkind (gnat_expr) == N_Aggregate
7102 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7103 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7104 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7105 TREE_TYPE (gnu_array_type),
7106 gnat_component_type);
7109 gnu_expr = gnat_to_gnu (gnat_expr);
7111 /* Before assigning the element to the array, make sure it is
7113 if (Do_Range_Check (gnat_expr))
7114 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7118 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7121 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7124 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7127 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7128 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7129 of the associations that are from RECORD_TYPE. If we see an internal
7130 record, make a recursive call to fill it in as well. */
7133 extract_values (tree values, tree record_type)
7135 tree result = NULL_TREE;
7138 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7142 /* _Parent is an internal field, but may have values in the aggregate,
7143 so check for values first. */
7144 if ((tem = purpose_member (field, values)))
7146 value = TREE_VALUE (tem);
7147 TREE_ADDRESSABLE (tem) = 1;
7150 else if (DECL_INTERNAL_P (field))
7152 value = extract_values (values, TREE_TYPE (field));
7153 if (TREE_CODE (value) == CONSTRUCTOR
7154 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7158 /* If we have a record subtype, the names will match, but not the
7159 actual FIELD_DECLs. */
7160 for (tem = values; tem; tem = TREE_CHAIN (tem))
7161 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7163 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7164 TREE_ADDRESSABLE (tem) = 1;
7170 result = tree_cons (field, value, result);
7173 return gnat_build_constructor (record_type, nreverse (result));
7176 /* EXP is to be treated as an array or record. Handle the cases when it is
7177 an access object and perform the required dereferences. */
7180 maybe_implicit_deref (tree exp)
7182 /* If the type is a pointer, dereference it. */
7183 if (POINTER_TYPE_P (TREE_TYPE (exp))
7184 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
7185 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7187 /* If we got a padded type, remove it too. */
7188 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7189 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7194 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7197 protect_multiple_eval (tree exp)
7199 tree type = TREE_TYPE (exp);
7200 enum tree_code code = TREE_CODE (exp);
7202 /* If EXP has no side effects, we theoritically don't need to do anything.
7203 However, we may be recursively passed more and more complex expressions
7204 involving checks which will be reused multiple times and eventually be
7205 unshared for gimplification; in order to avoid a complexity explosion
7206 at that point, we protect any expressions more complex than a simple
7207 arithmetic expression. */
7208 if (!TREE_SIDE_EFFECTS (exp)
7209 && (CONSTANT_CLASS_P (exp)
7210 || !EXPRESSION_CLASS_P (skip_simple_arithmetic (exp))))
7213 /* If this is a conversion, protect what's inside the conversion.
7214 Similarly, if we're indirectly referencing something, we only
7215 need to protect the address since the data itself can't change
7216 in these situations. */
7217 if (code == NON_LVALUE_EXPR
7218 || CONVERT_EXPR_CODE_P (code)
7219 || code == VIEW_CONVERT_EXPR
7220 || code == INDIRECT_REF
7221 || code == UNCONSTRAINED_ARRAY_REF)
7222 return build1 (code, type, protect_multiple_eval (TREE_OPERAND (exp, 0)));
7224 /* If this is a COMPONENT_REF of a fat pointer, save the entire fat pointer.
7225 This may be more efficient, but will also allow us to more easily find
7226 the match for the PLACEHOLDER_EXPR. */
7227 if (code == COMPONENT_REF
7228 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
7229 return build3 (code, type, protect_multiple_eval (TREE_OPERAND (exp, 0)),
7230 TREE_OPERAND (exp, 1), TREE_OPERAND (exp, 2));
7232 /* If this is a fat pointer or something that can be placed in a register,
7233 just make a SAVE_EXPR. Likewise for a CALL_EXPR as large objects are
7234 returned via invisible reference in most ABIs so the temporary will
7235 directly be filled by the callee. */
7236 if (TYPE_IS_FAT_POINTER_P (type)
7237 || TYPE_MODE (type) != BLKmode
7238 || code == CALL_EXPR)
7239 return save_expr (exp);
7241 /* Otherwise reference, protect the address and dereference. */
7243 build_unary_op (INDIRECT_REF, type,
7244 save_expr (build_unary_op (ADDR_EXPR,
7245 build_reference_type (type),
7249 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7250 handle our own nodes and we take extra arguments. FORCE says whether to
7251 force evaluation of everything. We set SUCCESS to true unless we walk
7252 through something we don't know how to stabilize. */
7255 maybe_stabilize_reference (tree ref, bool force, bool *success)
7257 tree type = TREE_TYPE (ref);
7258 enum tree_code code = TREE_CODE (ref);
7261 /* Assume we'll success unless proven otherwise. */
7270 /* No action is needed in this case. */
7276 case FIX_TRUNC_EXPR:
7277 case VIEW_CONVERT_EXPR:
7279 = build1 (code, type,
7280 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7285 case UNCONSTRAINED_ARRAY_REF:
7286 result = build1 (code, type,
7287 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7292 result = build3 (COMPONENT_REF, type,
7293 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7295 TREE_OPERAND (ref, 1), NULL_TREE);
7299 result = build3 (BIT_FIELD_REF, type,
7300 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7302 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7304 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7309 case ARRAY_RANGE_REF:
7310 result = build4 (code, type,
7311 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7313 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7315 NULL_TREE, NULL_TREE);
7320 result = gnat_stabilize_reference_1 (ref, force);
7324 /* Constructors with 1 element are used extensively to formally
7325 convert objects to special wrapping types. */
7326 if (TREE_CODE (type) == RECORD_TYPE
7327 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7330 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7332 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7334 = build_constructor_single (type, index,
7335 gnat_stabilize_reference_1 (value,
7346 ref = error_mark_node;
7348 /* ... fall through to failure ... */
7350 /* If arg isn't a kind of lvalue we recognize, make no change.
7351 Caller should recognize the error for an invalid lvalue. */
7357 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS set on the initial expression
7358 may not be sustained across some paths, such as the way via build1 for
7359 INDIRECT_REF. We reset those flags here in the general case, which is
7360 consistent with the GCC version of this routine.
7362 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7363 paths introduce side-effects where there was none initially (e.g. if a
7364 SAVE_EXPR is built) and we also want to keep track of that. */
7365 TREE_READONLY (result) = TREE_READONLY (ref);
7366 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7367 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7372 /* Wrapper around maybe_stabilize_reference, for common uses without lvalue
7373 restrictions and without the need to examine the success indication. */
7376 gnat_stabilize_reference (tree ref, bool force)
7379 return maybe_stabilize_reference (ref, force, &dummy);
7382 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7383 arg to force a SAVE_EXPR for everything. */
7386 gnat_stabilize_reference_1 (tree e, bool force)
7388 enum tree_code code = TREE_CODE (e);
7389 tree type = TREE_TYPE (e);
7392 /* We cannot ignore const expressions because it might be a reference
7393 to a const array but whose index contains side-effects. But we can
7394 ignore things that are actual constant or that already have been
7395 handled by this function. */
7396 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7399 switch (TREE_CODE_CLASS (code))
7401 case tcc_exceptional:
7402 case tcc_declaration:
7403 case tcc_comparison:
7404 case tcc_expression:
7407 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7408 fat pointer. This may be more efficient, but will also allow
7409 us to more easily find the match for the PLACEHOLDER_EXPR. */
7410 if (code == COMPONENT_REF
7411 && TYPE_IS_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7413 = build3 (code, type,
7414 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7415 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7416 /* If the expression has side-effects, then encase it in a SAVE_EXPR
7417 so that it will only be evaluated once. */
7418 /* The tcc_reference and tcc_comparison classes could be handled as
7419 below, but it is generally faster to only evaluate them once. */
7420 else if (TREE_SIDE_EFFECTS (e) || force)
7421 return save_expr (e);
7427 /* Recursively stabilize each operand. */
7429 = build2 (code, type,
7430 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7431 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1), force));
7435 /* Recursively stabilize each operand. */
7437 = build1 (code, type,
7438 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force));
7445 /* See similar handling in maybe_stabilize_reference. */
7446 TREE_READONLY (result) = TREE_READONLY (e);
7447 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7448 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7453 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7454 location and false if it doesn't. In the former case, set the Gigi global
7455 variable REF_FILENAME to the simple debug file name as given by sinput. */
7458 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7460 if (Sloc == No_Location)
7463 if (Sloc <= Standard_Location)
7465 *locus = BUILTINS_LOCATION;
7470 Source_File_Index file = Get_Source_File_Index (Sloc);
7471 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7472 Column_Number column = Get_Column_Number (Sloc);
7473 struct line_map *map = &line_table->maps[file - 1];
7475 /* Translate the location according to the line-map.h formula. */
7476 *locus = map->start_location
7477 + ((line - map->to_line) << map->column_bits)
7478 + (column & ((1 << map->column_bits) - 1));
7482 = IDENTIFIER_POINTER
7484 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7489 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7490 don't do anything if it doesn't correspond to a source location. */
7493 set_expr_location_from_node (tree node, Node_Id gnat_node)
7497 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7500 SET_EXPR_LOCATION (node, locus);
7503 /* Return a colon-separated list of encodings contained in encoded Ada
7507 extract_encoding (const char *name)
7509 char *encoding = GGC_NEWVEC (char, strlen (name));
7510 get_encoding (name, encoding);
7514 /* Extract the Ada name from an encoded name. */
7517 decode_name (const char *name)
7519 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7520 __gnat_decode (name, decoded, 0);
7524 /* Post an error message. MSG is the error message, properly annotated.
7525 NODE is the node at which to post the error and the node to use for the
7526 "&" substitution. */
7529 post_error (const char *msg, Node_Id node)
7531 String_Template temp;
7534 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7535 fp.Array = msg, fp.Bounds = &temp;
7537 Error_Msg_N (fp, node);
7540 /* Similar, but NODE is the node at which to post the error and ENT
7541 is the node to use for the "&" substitution. */
7544 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7546 String_Template temp;
7549 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7550 fp.Array = msg, fp.Bounds = &temp;
7552 Error_Msg_NE (fp, node, ent);
7555 /* Similar, but NODE is the node at which to post the error, ENT is the node
7556 to use for the "&" substitution, and N is the number to use for the ^. */
7559 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7561 String_Template temp;
7564 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7565 fp.Array = msg, fp.Bounds = &temp;
7566 Error_Msg_Uint_1 = UI_From_Int (n);
7569 Error_Msg_NE (fp, node, ent);
7572 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7573 number to write. If the tree represents a constant that fits within
7574 a host integer, the text inside curly brackets in MSG will be output
7575 (presumably including a '^'). Otherwise that text will not be output
7576 and the text inside square brackets will be output instead. */
7579 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7581 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7582 String_Template temp = {1, 0};
7584 char start_yes, end_yes, start_no, end_no;
7588 fp.Array = newmsg, fp.Bounds = &temp;
7590 if (host_integerp (t, 1)
7591 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7594 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7598 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7599 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7602 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7604 for (p = msg, q = newmsg; *p; p++)
7606 if (*p == start_yes)
7607 for (p++; *p != end_yes; p++)
7609 else if (*p == start_no)
7610 for (p++; *p != end_no; p++)
7618 temp.High_Bound = strlen (newmsg);
7620 Error_Msg_NE (fp, node, ent);
7623 /* Similar to post_error_ne_tree, except that NUM is a second
7624 integer to write in the message. */
7627 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7630 Error_Msg_Uint_2 = UI_From_Int (num);
7631 post_error_ne_tree (msg, node, ent, t);
7634 /* Initialize the table that maps GNAT codes to GCC codes for simple
7635 binary and unary operations. */
7638 init_code_table (void)
7640 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7641 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7643 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7644 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7645 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7646 gnu_codes[N_Op_Eq] = EQ_EXPR;
7647 gnu_codes[N_Op_Ne] = NE_EXPR;
7648 gnu_codes[N_Op_Lt] = LT_EXPR;
7649 gnu_codes[N_Op_Le] = LE_EXPR;
7650 gnu_codes[N_Op_Gt] = GT_EXPR;
7651 gnu_codes[N_Op_Ge] = GE_EXPR;
7652 gnu_codes[N_Op_Add] = PLUS_EXPR;
7653 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7654 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7655 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7656 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7657 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7658 gnu_codes[N_Op_Abs] = ABS_EXPR;
7659 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7660 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7661 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7662 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7663 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7664 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7667 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7671 get_exception_label (char kind)
7673 if (kind == N_Raise_Constraint_Error)
7674 return TREE_VALUE (gnu_constraint_error_label_stack);
7675 else if (kind == N_Raise_Storage_Error)
7676 return TREE_VALUE (gnu_storage_error_label_stack);
7677 else if (kind == N_Raise_Program_Error)
7678 return TREE_VALUE (gnu_program_error_label_stack);
7683 #include "gt-ada-trans.h"