1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2009, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
55 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
56 for fear of running out of stack space. If we need more, we use xmalloc
58 #define ALLOCA_THRESHOLD 1000
60 /* Let code below know whether we are targetting VMS without need of
61 intrusive preprocessor directives. */
62 #ifndef TARGET_ABI_OPEN_VMS
63 #define TARGET_ABI_OPEN_VMS 0
66 /* For efficient float-to-int rounding, it is necessary to know whether
67 floating-point arithmetic may use wider intermediate results. When
68 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
69 that arithmetic does not widen if double precision is emulated. */
70 #ifndef FP_ARITH_MAY_WIDEN
71 #if defined(HAVE_extendsfdf2)
72 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
74 #define FP_ARITH_MAY_WIDEN 0
78 extern char *__gnat_to_canonical_file_spec (char *);
83 struct Node *Nodes_Ptr;
84 Node_Id *Next_Node_Ptr;
85 Node_Id *Prev_Node_Ptr;
86 struct Elist_Header *Elists_Ptr;
87 struct Elmt_Item *Elmts_Ptr;
88 struct String_Entry *Strings_Ptr;
89 Char_Code *String_Chars_Ptr;
90 struct List_Header *List_Headers_Ptr;
92 /* Current filename without path. */
93 const char *ref_filename;
95 /* True when gigi is being called on an analyzed but unexpanded
96 tree, and the only purpose of the call is to properly annotate
97 types with representation information. */
98 bool type_annotate_only;
100 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
101 of unconstrained array IN parameters to avoid emitting a great deal of
102 redundant instructions to recompute them each time. */
103 struct GTY (()) parm_attr {
104 int id; /* GTY doesn't like Entity_Id. */
111 typedef struct parm_attr *parm_attr;
113 DEF_VEC_P(parm_attr);
114 DEF_VEC_ALLOC_P(parm_attr,gc);
116 struct GTY(()) language_function {
117 VEC(parm_attr,gc) *parm_attr_cache;
120 #define f_parm_attr_cache \
121 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
123 /* A structure used to gather together information about a statement group.
124 We use this to gather related statements, for example the "then" part
125 of a IF. In the case where it represents a lexical scope, we may also
126 have a BLOCK node corresponding to it and/or cleanups. */
128 struct GTY((chain_next ("%h.previous"))) stmt_group {
129 struct stmt_group *previous; /* Previous code group. */
130 tree stmt_list; /* List of statements for this code group. */
131 tree block; /* BLOCK for this code group, if any. */
132 tree cleanups; /* Cleanups for this code group, if any. */
135 static GTY(()) struct stmt_group *current_stmt_group;
137 /* List of unused struct stmt_group nodes. */
138 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
140 /* A structure used to record information on elaboration procedures
141 we've made and need to process.
143 ??? gnat_node should be Node_Id, but gengtype gets confused. */
145 struct GTY((chain_next ("%h.next"))) elab_info {
146 struct elab_info *next; /* Pointer to next in chain. */
147 tree elab_proc; /* Elaboration procedure. */
148 int gnat_node; /* The N_Compilation_Unit. */
151 static GTY(()) struct elab_info *elab_info_list;
153 /* Free list of TREE_LIST nodes used for stacks. */
154 static GTY((deletable)) tree gnu_stack_free_list;
156 /* List of TREE_LIST nodes representing a stack of exception pointer
157 variables. TREE_VALUE is the VAR_DECL that stores the address of
158 the raised exception. Nonzero means we are in an exception
159 handler. Not used in the zero-cost case. */
160 static GTY(()) tree gnu_except_ptr_stack;
162 /* List of TREE_LIST nodes used to store the current elaboration procedure
163 decl. TREE_VALUE is the decl. */
164 static GTY(()) tree gnu_elab_proc_stack;
166 /* Variable that stores a list of labels to be used as a goto target instead of
167 a return in some functions. See processing for N_Subprogram_Body. */
168 static GTY(()) tree gnu_return_label_stack;
170 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
171 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
172 static GTY(()) tree gnu_loop_label_stack;
174 /* List of TREE_LIST nodes representing labels for switch statements.
175 TREE_VALUE of each entry is the label at the end of the switch. */
176 static GTY(()) tree gnu_switch_label_stack;
178 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
179 static GTY(()) tree gnu_constraint_error_label_stack;
180 static GTY(()) tree gnu_storage_error_label_stack;
181 static GTY(()) tree gnu_program_error_label_stack;
183 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
184 static enum tree_code gnu_codes[Number_Node_Kinds];
186 /* Current node being treated, in case abort called. */
187 Node_Id error_gnat_node;
189 static void init_code_table (void);
190 static void Compilation_Unit_to_gnu (Node_Id);
191 static void record_code_position (Node_Id);
192 static void insert_code_for (Node_Id);
193 static void add_cleanup (tree, Node_Id);
194 static tree unshare_save_expr (tree *, int *, void *);
195 static void add_stmt_list (List_Id);
196 static void push_exception_label_stack (tree *, Entity_Id);
197 static tree build_stmt_group (List_Id, bool);
198 static void push_stack (tree *, tree, tree);
199 static void pop_stack (tree *);
200 static enum gimplify_status gnat_gimplify_stmt (tree *);
201 static void elaborate_all_entities (Node_Id);
202 static void process_freeze_entity (Node_Id);
203 static void process_inlined_subprograms (Node_Id);
204 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
205 static tree emit_range_check (tree, Node_Id, Node_Id);
206 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
207 static tree emit_check (tree, tree, int, Node_Id);
208 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
209 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
210 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
211 static bool smaller_packable_type_p (tree, tree);
212 static bool addressable_p (tree, tree);
213 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
214 static tree extract_values (tree, tree);
215 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
216 static tree maybe_implicit_deref (tree);
217 static tree gnat_stabilize_reference (tree, bool);
218 static tree gnat_stabilize_reference_1 (tree, bool);
219 static void set_expr_location_from_node (tree, Node_Id);
220 static int lvalue_required_p (Node_Id, tree, int);
222 /* Hooks for debug info back-ends, only supported and used in a restricted set
223 of configurations. */
224 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
225 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
227 /* This is the main program of the back-end. It sets up all the table
228 structures and then generates code. */
231 gigi (Node_Id gnat_root, int max_gnat_node, int number_name,
232 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
233 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
234 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
235 struct List_Header *list_headers_ptr, Nat number_file,
236 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
237 Entity_Id standard_integer, Entity_Id standard_long_long_float,
238 Entity_Id standard_exception_type, Int gigi_operating_mode)
240 Entity_Id gnat_literal;
241 tree long_long_float_type, exception_type, t;
242 tree int64_type = gnat_type_for_size (64, 0);
243 struct elab_info *info;
246 max_gnat_nodes = max_gnat_node;
247 number_names = number_name;
248 number_files = number_file;
249 Nodes_Ptr = nodes_ptr;
250 Next_Node_Ptr = next_node_ptr;
251 Prev_Node_Ptr = prev_node_ptr;
252 Elists_Ptr = elists_ptr;
253 Elmts_Ptr = elmts_ptr;
254 Strings_Ptr = strings_ptr;
255 String_Chars_Ptr = string_chars_ptr;
256 List_Headers_Ptr = list_headers_ptr;
258 type_annotate_only = (gigi_operating_mode == 1);
260 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
262 /* Declare the name of the compilation unit as the first global
263 name in order to make the middle-end fully deterministic. */
264 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
265 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
267 for (i = 0; i < number_files; i++)
269 /* Use the identifier table to make a permanent copy of the filename as
270 the name table gets reallocated after Gigi returns but before all the
271 debugging information is output. The __gnat_to_canonical_file_spec
272 call translates filenames from pragmas Source_Reference that contain
273 host style syntax not understood by gdb. */
277 (__gnat_to_canonical_file_spec
278 (Get_Name_String (file_info_ptr[i].File_Name))));
280 /* We rely on the order isomorphism between files and line maps. */
281 gcc_assert ((int) line_table->used == i);
283 /* We create the line map for a source file at once, with a fixed number
284 of columns chosen to avoid jumping over the next power of 2. */
285 linemap_add (line_table, LC_ENTER, 0, filename, 1);
286 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
287 linemap_position_for_column (line_table, 252 - 1);
288 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
291 /* Initialize ourselves. */
296 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
298 if (type_annotate_only)
300 TYPE_SIZE (void_type_node) = bitsize_zero_node;
301 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
304 /* If the GNU type extensions to DWARF are available, setup the hooks. */
305 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
306 /* We condition the name demangling and the generation of type encoding
307 strings on -gdwarf+ and always set descriptive types on. */
308 if (use_gnu_debug_info_extensions)
310 dwarf2out_set_type_encoding_func (extract_encoding);
311 dwarf2out_set_demangle_name_func (decode_name);
313 dwarf2out_set_descriptive_type_func (get_parallel_type);
316 /* Enable GNAT stack checking method if needed */
317 if (!Stack_Check_Probes_On_Target)
318 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
320 /* Retrieve alignment settings. */
321 double_float_alignment = get_target_double_float_alignment ();
322 double_scalar_alignment = get_target_double_scalar_alignment ();
324 /* Record the builtin types. Define `integer' and `unsigned char' first so
325 that dbx will output them first. */
326 record_builtin_type ("integer", integer_type_node);
327 record_builtin_type ("unsigned char", char_type_node);
328 record_builtin_type ("long integer", long_integer_type_node);
329 unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1);
330 record_builtin_type ("unsigned int", unsigned_type_node);
331 record_builtin_type (SIZE_TYPE, sizetype);
332 record_builtin_type ("boolean", boolean_type_node);
333 record_builtin_type ("void", void_type_node);
335 /* Save the type we made for integer as the type for Standard.Integer. */
336 save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node),
339 /* Save the type we made for boolean as the type for Standard.Boolean. */
340 save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node),
342 gnat_literal = First_Literal (Base_Type (standard_boolean));
343 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
344 gcc_assert (t == boolean_false_node);
345 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
346 boolean_type_node, t, true, false, false, false,
348 DECL_IGNORED_P (t) = 1;
349 save_gnu_tree (gnat_literal, t, false);
350 gnat_literal = Next_Literal (gnat_literal);
351 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
352 gcc_assert (t == boolean_true_node);
353 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
354 boolean_type_node, t, true, false, false, false,
356 DECL_IGNORED_P (t) = 1;
357 save_gnu_tree (gnat_literal, t, false);
359 void_ftype = build_function_type (void_type_node, NULL_TREE);
360 ptr_void_ftype = build_pointer_type (void_ftype);
362 /* Now declare runtime functions. */
363 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
365 /* malloc is a function declaration tree for a function to allocate
368 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
369 build_function_type (ptr_void_type_node,
370 tree_cons (NULL_TREE,
372 NULL_TREE, false, true, true, NULL, Empty);
373 DECL_IS_MALLOC (malloc_decl) = 1;
375 /* malloc32 is a function declaration tree for a function to allocate
376 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
378 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
379 build_function_type (ptr_void_type_node,
380 tree_cons (NULL_TREE,
382 NULL_TREE, false, true, true, NULL, Empty);
383 DECL_IS_MALLOC (malloc32_decl) = 1;
385 /* free is a function declaration tree for a function to free memory. */
387 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
388 build_function_type (void_type_node,
389 tree_cons (NULL_TREE,
392 NULL_TREE, false, true, true, NULL, Empty);
394 /* This is used for 64-bit multiplication with overflow checking. */
396 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
397 build_function_type_list (int64_type, int64_type,
398 int64_type, NULL_TREE),
399 NULL_TREE, false, true, true, NULL, Empty);
401 /* Make the types and functions used for exception processing. */
403 = build_array_type (gnat_type_for_mode (Pmode, 0),
404 build_index_type (size_int (5)));
405 record_builtin_type ("JMPBUF_T", jmpbuf_type);
406 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
408 /* Functions to get and set the jumpbuf pointer for the current thread. */
410 = create_subprog_decl
411 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
412 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
413 NULL_TREE, false, true, true, NULL, Empty);
414 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
415 DECL_PURE_P (get_jmpbuf_decl) = 1;
418 = create_subprog_decl
419 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
421 build_function_type (void_type_node,
422 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
423 NULL_TREE, false, true, true, NULL, Empty);
425 /* setjmp returns an integer and has one operand, which is a pointer to
428 = create_subprog_decl
429 (get_identifier ("__builtin_setjmp"), NULL_TREE,
430 build_function_type (integer_type_node,
431 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
432 NULL_TREE, false, true, true, NULL, Empty);
434 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
435 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
437 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
439 update_setjmp_buf_decl
440 = create_subprog_decl
441 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
442 build_function_type (void_type_node,
443 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
444 NULL_TREE, false, true, true, NULL, Empty);
446 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
447 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
449 /* Hooks to call when entering/leaving an exception handler. */
451 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
452 build_function_type (void_type_node,
453 tree_cons (NULL_TREE,
456 NULL_TREE, false, true, true, NULL, Empty);
459 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
460 build_function_type (void_type_node,
461 tree_cons (NULL_TREE,
464 NULL_TREE, false, true, true, NULL, Empty);
466 /* If in no exception handlers mode, all raise statements are redirected to
467 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
468 this procedure will never be called in this mode. */
469 if (No_Exception_Handlers_Set ())
472 = create_subprog_decl
473 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
474 build_function_type (void_type_node,
475 tree_cons (NULL_TREE,
476 build_pointer_type (char_type_node),
477 tree_cons (NULL_TREE,
480 NULL_TREE, false, true, true, NULL, Empty);
482 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
483 gnat_raise_decls[i] = decl;
486 /* Otherwise, make one decl for each exception reason. */
487 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
491 sprintf (name, "__gnat_rcheck_%.2d", i);
493 = create_subprog_decl
494 (get_identifier (name), NULL_TREE,
495 build_function_type (void_type_node,
496 tree_cons (NULL_TREE,
499 tree_cons (NULL_TREE,
502 NULL_TREE, false, true, true, NULL, Empty);
505 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
507 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
508 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
509 TREE_TYPE (gnat_raise_decls[i])
510 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
514 /* Set the types that GCC and Gigi use from the front end. We would
515 like to do this for char_type_node, but it needs to correspond to
518 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
519 except_type_node = TREE_TYPE (exception_type);
521 /* Make other functions used for exception processing. */
523 = create_subprog_decl
524 (get_identifier ("system__soft_links__get_gnat_exception"),
526 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
527 NULL_TREE, false, true, true, NULL, Empty);
528 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
529 DECL_PURE_P (get_excptr_decl) = 1;
532 = create_subprog_decl
533 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
534 build_function_type (void_type_node,
535 tree_cons (NULL_TREE,
536 build_pointer_type (except_type_node),
538 NULL_TREE, false, true, true, NULL, Empty);
540 /* Indicate that these never return. */
541 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
542 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
543 TREE_TYPE (raise_nodefer_decl)
544 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
547 /* Build the special descriptor type and its null node if needed. */
548 if (TARGET_VTABLE_USES_DESCRIPTORS)
550 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
551 tree field_list = NULL_TREE, null_list = NULL_TREE;
554 fdesc_type_node = make_node (RECORD_TYPE);
556 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
558 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
559 fdesc_type_node, 0, 0, 0, 1);
560 TREE_CHAIN (field) = field_list;
562 null_list = tree_cons (field, null_node, null_list);
565 finish_record_type (fdesc_type_node, nreverse (field_list), 0, true);
566 record_builtin_type ("descriptor", fdesc_type_node);
567 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
571 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
573 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
575 /* In this case, the builtin floating point types are VAX float,
576 so make up a type for use. */
577 longest_float_type_node = make_node (REAL_TYPE);
578 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
579 layout_type (longest_float_type_node);
580 record_builtin_type ("longest float type", longest_float_type_node);
583 longest_float_type_node = TREE_TYPE (long_long_float_type);
585 /* Dummy objects to materialize "others" and "all others" in the exception
586 tables. These are exported by a-exexpr.adb, so see this unit for the
589 = create_var_decl (get_identifier ("OTHERS"),
590 get_identifier ("__gnat_others_value"),
591 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
594 = create_var_decl (get_identifier ("ALL_OTHERS"),
595 get_identifier ("__gnat_all_others_value"),
596 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
598 main_identifier_node = get_identifier ("main");
600 /* Install the builtins we might need, either internally or as
601 user available facilities for Intrinsic imports. */
602 gnat_install_builtins ();
604 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
605 gnu_constraint_error_label_stack
606 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
607 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
608 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
610 /* Process any Pragma Ident for the main unit. */
611 #ifdef ASM_OUTPUT_IDENT
612 if (Present (Ident_String (Main_Unit)))
615 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
618 /* If we are using the GCC exception mechanism, let GCC know. */
619 if (Exception_Mechanism == Back_End_Exceptions)
622 /* Now translate the compilation unit proper. */
624 Compilation_Unit_to_gnu (gnat_root);
626 /* Finally see if we have any elaboration procedures to deal with. */
627 for (info = elab_info_list; info; info = info->next)
629 tree gnu_body = DECL_SAVED_TREE (info->elab_proc);
631 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
632 the gimplifier for obvious reasons, but it turns out that we need to
633 unshare them for the global level because of SAVE_EXPRs made around
634 checks for global objects and around allocators for global objects
635 of variable size, in order to prevent node sharing in the underlying
636 expression. Note that this implicitly assumes that the SAVE_EXPR
637 nodes themselves are not shared between subprograms, which would be
638 an upstream bug for which we would not change the outcome. */
639 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
641 /* Process the function as others, but for indicating this is an
642 elab proc, to be discarded if empty, then propagate the status
643 up to the GNAT tree node. */
644 begin_subprog_body (info->elab_proc);
645 end_subprog_body (gnu_body, true);
647 if (empty_body_p (gimple_body (info->elab_proc)))
648 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
651 /* We cannot track the location of errors past this point. */
652 error_gnat_node = Empty;
655 /* Return a positive value if an lvalue is required for GNAT_NODE.
656 GNU_TYPE is the type that will be used for GNAT_NODE in the
657 translated GNU tree. ALIASED indicates whether the underlying
658 object represented by GNAT_NODE is aliased in the Ada sense.
660 The function climbs up the GNAT tree starting from the node and
661 returns 1 upon encountering a node that effectively requires an
662 lvalue downstream. It returns int instead of bool to facilitate
663 usage in non purely binary logic contexts. */
666 lvalue_required_p (Node_Id gnat_node, tree gnu_type, int aliased)
668 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
670 switch (Nkind (gnat_parent))
675 case N_Attribute_Reference:
677 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
678 return id == Attr_Address
680 || id == Attr_Unchecked_Access
681 || id == Attr_Unrestricted_Access;
684 case N_Parameter_Association:
685 case N_Function_Call:
686 case N_Procedure_Call_Statement:
687 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
689 case N_Indexed_Component:
690 /* Only the array expression can require an lvalue. */
691 if (Prefix (gnat_parent) != gnat_node)
694 /* ??? Consider that referencing an indexed component with a
695 non-constant index forces the whole aggregate to memory.
696 Note that N_Integer_Literal is conservative, any static
697 expression in the RM sense could probably be accepted. */
698 for (gnat_temp = First (Expressions (gnat_parent));
700 gnat_temp = Next (gnat_temp))
701 if (Nkind (gnat_temp) != N_Integer_Literal)
704 /* ... fall through ... */
707 /* Only the array expression can require an lvalue. */
708 if (Prefix (gnat_parent) != gnat_node)
711 aliased |= Has_Aliased_Components (Etype (gnat_node));
712 return lvalue_required_p (gnat_parent, gnu_type, aliased);
714 case N_Selected_Component:
715 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
716 return lvalue_required_p (gnat_parent, gnu_type, aliased);
718 case N_Object_Renaming_Declaration:
719 /* We need to make a real renaming only if the constant object is
720 aliased or if we may use a renaming pointer; otherwise we can
721 optimize and return the rvalue. We make an exception if the object
722 is an identifier since in this case the rvalue can be propagated
723 attached to the CONST_DECL. */
725 /* This should match the constant case of the renaming code. */
727 (Underlying_Type (Etype (Name (gnat_parent))))
728 || Nkind (Name (gnat_parent)) == N_Identifier);
730 case N_Object_Declaration:
731 /* We cannot use a constructor if this is an atomic object because
732 the actual assignment might end up being done component-wise. */
733 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
734 && Is_Atomic (Defining_Entity (gnat_parent));
736 case N_Assignment_Statement:
737 /* We cannot use a constructor if the LHS is an atomic object because
738 the actual assignment might end up being done component-wise. */
739 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
740 && Is_Atomic (Entity (Name (gnat_parent)));
749 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
750 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
751 to where we should place the result type. */
754 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
756 Node_Id gnat_temp, gnat_temp_type;
757 tree gnu_result, gnu_result_type;
759 /* Whether we should require an lvalue for GNAT_NODE. Needed in
760 specific circumstances only, so evaluated lazily. < 0 means
761 unknown, > 0 means known true, 0 means known false. */
762 int require_lvalue = -1;
764 /* If GNAT_NODE is a constant, whether we should use the initialization
765 value instead of the constant entity, typically for scalars with an
766 address clause when the parent doesn't require an lvalue. */
767 bool use_constant_initializer = false;
769 /* If the Etype of this node does not equal the Etype of the Entity,
770 something is wrong with the entity map, probably in generic
771 instantiation. However, this does not apply to types. Since we sometime
772 have strange Ekind's, just do this test for objects. Also, if the Etype of
773 the Entity is private, the Etype of the N_Identifier is allowed to be the
774 full type and also we consider a packed array type to be the same as the
775 original type. Similarly, a class-wide type is equivalent to a subtype of
776 itself. Finally, if the types are Itypes, one may be a copy of the other,
777 which is also legal. */
778 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
779 ? gnat_node : Entity (gnat_node));
780 gnat_temp_type = Etype (gnat_temp);
782 gcc_assert (Etype (gnat_node) == gnat_temp_type
783 || (Is_Packed (gnat_temp_type)
784 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
785 || (Is_Class_Wide_Type (Etype (gnat_node)))
786 || (IN (Ekind (gnat_temp_type), Private_Kind)
787 && Present (Full_View (gnat_temp_type))
788 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
789 || (Is_Packed (Full_View (gnat_temp_type))
790 && (Etype (gnat_node)
791 == Packed_Array_Type (Full_View
792 (gnat_temp_type))))))
793 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
794 || !(Ekind (gnat_temp) == E_Variable
795 || Ekind (gnat_temp) == E_Component
796 || Ekind (gnat_temp) == E_Constant
797 || Ekind (gnat_temp) == E_Loop_Parameter
798 || IN (Ekind (gnat_temp), Formal_Kind)));
800 /* If this is a reference to a deferred constant whose partial view is an
801 unconstrained private type, the proper type is on the full view of the
802 constant, not on the full view of the type, which may be unconstrained.
804 This may be a reference to a type, for example in the prefix of the
805 attribute Position, generated for dispatching code (see Make_DT in
806 exp_disp,adb). In that case we need the type itself, not is parent,
807 in particular if it is a derived type */
808 if (Is_Private_Type (gnat_temp_type)
809 && Has_Unknown_Discriminants (gnat_temp_type)
810 && Ekind (gnat_temp) == E_Constant
811 && Present (Full_View (gnat_temp)))
813 gnat_temp = Full_View (gnat_temp);
814 gnat_temp_type = Etype (gnat_temp);
818 /* We want to use the Actual_Subtype if it has already been elaborated,
819 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
821 if ((Ekind (gnat_temp) == E_Constant
822 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
823 && !(Is_Array_Type (Etype (gnat_temp))
824 && Present (Packed_Array_Type (Etype (gnat_temp))))
825 && Present (Actual_Subtype (gnat_temp))
826 && present_gnu_tree (Actual_Subtype (gnat_temp)))
827 gnat_temp_type = Actual_Subtype (gnat_temp);
829 gnat_temp_type = Etype (gnat_node);
832 /* Expand the type of this identifier first, in case it is an enumeral
833 literal, which only get made when the type is expanded. There is no
834 order-of-elaboration issue here. */
835 gnu_result_type = get_unpadded_type (gnat_temp_type);
837 /* If this is a non-imported scalar constant with an address clause,
838 retrieve the value instead of a pointer to be dereferenced unless
839 an lvalue is required. This is generally more efficient and actually
840 required if this is a static expression because it might be used
841 in a context where a dereference is inappropriate, such as a case
842 statement alternative or a record discriminant. There is no possible
843 volatile-ness short-circuit here since Volatile constants must bei
845 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
846 && !Is_Imported (gnat_temp)
847 && Present (Address_Clause (gnat_temp)))
849 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
850 Is_Aliased (gnat_temp));
851 use_constant_initializer = !require_lvalue;
854 if (use_constant_initializer)
856 /* If this is a deferred constant, the initializer is attached to
858 if (Present (Full_View (gnat_temp)))
859 gnat_temp = Full_View (gnat_temp);
861 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
864 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
866 /* If we are in an exception handler, force this variable into memory to
867 ensure optimization does not remove stores that appear redundant but are
868 actually needed in case an exception occurs.
870 ??? Note that we need not do this if the variable is declared within the
871 handler, only if it is referenced in the handler and declared in an
872 enclosing block, but we have no way of testing that right now.
874 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
875 here, but it can now be removed by the Tree aliasing machinery if the
876 address of the variable is never taken. All we can do is to make the
877 variable volatile, which might incur the generation of temporaries just
878 to access the memory in some circumstances. This can be avoided for
879 variables of non-constant size because they are automatically allocated
880 to memory. There might be no way of allocating a proper temporary for
881 them in any case. We only do this for SJLJ though. */
882 if (TREE_VALUE (gnu_except_ptr_stack)
883 && TREE_CODE (gnu_result) == VAR_DECL
884 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
885 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
887 /* Some objects (such as parameters passed by reference, globals of
888 variable size, and renamed objects) actually represent the address
889 of the object. In that case, we must do the dereference. Likewise,
890 deal with parameters to foreign convention subprograms. */
891 if (DECL_P (gnu_result)
892 && (DECL_BY_REF_P (gnu_result)
893 || (TREE_CODE (gnu_result) == PARM_DECL
894 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
896 bool ro = DECL_POINTS_TO_READONLY_P (gnu_result);
899 if (TREE_CODE (gnu_result) == PARM_DECL
900 && DECL_BY_COMPONENT_PTR_P (gnu_result))
902 = build_unary_op (INDIRECT_REF, NULL_TREE,
903 convert (build_pointer_type (gnu_result_type),
906 /* If it's a renaming pointer and we are at the right binding level,
907 we can reference the renamed object directly, since the renamed
908 expression has been protected against multiple evaluations. */
909 else if (TREE_CODE (gnu_result) == VAR_DECL
910 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) != 0
911 && (! DECL_RENAMING_GLOBAL_P (gnu_result)
912 || global_bindings_p ()))
913 gnu_result = renamed_obj;
915 /* Return the underlying CST for a CONST_DECL like a few lines below,
916 after dereferencing in this case. */
917 else if (TREE_CODE (gnu_result) == CONST_DECL)
918 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
919 DECL_INITIAL (gnu_result));
922 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
924 TREE_READONLY (gnu_result) = TREE_STATIC (gnu_result) = ro;
927 /* The GNAT tree has the type of a function as the type of its result. Also
928 use the type of the result if the Etype is a subtype which is nominally
929 unconstrained. But remove any padding from the resulting type. */
930 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
931 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
933 gnu_result_type = TREE_TYPE (gnu_result);
934 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
935 && TYPE_IS_PADDING_P (gnu_result_type))
936 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
939 /* If we have a constant declaration and its initializer at hand,
940 try to return the latter to avoid the need to call fold in lots
941 of places and the need of elaboration code if this Id is used as
942 an initializer itself. */
943 if (TREE_CONSTANT (gnu_result)
944 && DECL_P (gnu_result)
945 && DECL_INITIAL (gnu_result))
948 = (TREE_CODE (gnu_result) == CONST_DECL
949 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
951 /* If there is a corresponding variable, we only want to return
952 the CST value if an lvalue is not required. Evaluate this
953 now if we have not already done so. */
954 if (object && require_lvalue < 0)
955 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
956 Is_Aliased (gnat_temp));
958 if (!object || !require_lvalue)
959 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
962 *gnu_result_type_p = gnu_result_type;
966 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
967 any statements we generate. */
970 Pragma_to_gnu (Node_Id gnat_node)
973 tree gnu_result = alloc_stmt_list ();
975 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
977 if (type_annotate_only
978 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
981 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
983 case Pragma_Inspection_Point:
984 /* Do nothing at top level: all such variables are already viewable. */
985 if (global_bindings_p ())
988 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
990 gnat_temp = Next (gnat_temp))
992 Node_Id gnat_expr = Expression (gnat_temp);
993 tree gnu_expr = gnat_to_gnu (gnat_expr);
995 enum machine_mode mode;
996 tree asm_constraint = NULL_TREE;
997 #ifdef ASM_COMMENT_START
1001 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1002 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1004 /* Use the value only if it fits into a normal register,
1005 otherwise use the address. */
1006 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1007 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1008 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1009 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1012 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1014 #ifdef ASM_COMMENT_START
1015 comment = concat (ASM_COMMENT_START,
1016 " inspection point: ",
1017 Get_Name_String (Chars (gnat_expr)),
1018 use_address ? " address" : "",
1021 asm_constraint = build_string (strlen (comment), comment);
1024 gnu_expr = build4 (ASM_EXPR, void_type_node,
1028 (build_tree_list (NULL_TREE,
1029 build_string (1, "g")),
1030 gnu_expr, NULL_TREE),
1032 ASM_VOLATILE_P (gnu_expr) = 1;
1033 set_expr_location_from_node (gnu_expr, gnat_node);
1034 append_to_statement_list (gnu_expr, &gnu_result);
1038 case Pragma_Optimize:
1039 switch (Chars (Expression
1040 (First (Pragma_Argument_Associations (gnat_node)))))
1042 case Name_Time: case Name_Space:
1044 post_error ("insufficient -O value?", gnat_node);
1049 post_error ("must specify -O0?", gnat_node);
1057 case Pragma_Reviewable:
1058 if (write_symbols == NO_DEBUG)
1059 post_error ("must specify -g?", gnat_node);
1066 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1067 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1068 where we should place the result type. ATTRIBUTE is the attribute ID. */
1071 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1073 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1074 tree gnu_type = TREE_TYPE (gnu_prefix);
1075 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1076 bool prefix_unused = false;
1078 /* If the input is a NULL_EXPR, make a new one. */
1079 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1081 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1082 *gnu_result_type_p = gnu_result_type;
1083 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1090 /* These are just conversions since representation clauses for
1091 enumeration types are handled in the front-end. */
1093 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1094 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1095 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1096 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1097 checkp, checkp, true, gnat_node);
1103 /* These just add or subtract the constant 1 since representation
1104 clauses for enumeration types are handled in the front-end. */
1105 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1106 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1108 if (Do_Range_Check (First (Expressions (gnat_node))))
1110 gnu_expr = protect_multiple_eval (gnu_expr);
1113 (build_binary_op (EQ_EXPR, integer_type_node,
1115 attribute == Attr_Pred
1116 ? TYPE_MIN_VALUE (gnu_result_type)
1117 : TYPE_MAX_VALUE (gnu_result_type)),
1118 gnu_expr, CE_Range_Check_Failed, gnat_node);
1122 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1123 gnu_result_type, gnu_expr,
1124 convert (gnu_result_type, integer_one_node));
1128 case Attr_Unrestricted_Access:
1129 /* Conversions don't change addresses but can cause us to miss the
1130 COMPONENT_REF case below, so strip them off. */
1131 gnu_prefix = remove_conversions (gnu_prefix,
1132 !Must_Be_Byte_Aligned (gnat_node));
1134 /* If we are taking 'Address of an unconstrained object, this is the
1135 pointer to the underlying array. */
1136 if (attribute == Attr_Address)
1137 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1139 /* If we are building a static dispatch table, we have to honor
1140 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1141 with the C++ ABI. We do it in the non-static case as well,
1142 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1143 else if (TARGET_VTABLE_USES_DESCRIPTORS
1144 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1146 tree gnu_field, gnu_list = NULL_TREE, t;
1147 /* Descriptors can only be built here for top-level functions. */
1148 bool build_descriptor = (global_bindings_p () != 0);
1151 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1153 /* If we're not going to build the descriptor, we have to retrieve
1154 the one which will be built by the linker (or by the compiler
1155 later if a static chain is requested). */
1156 if (!build_descriptor)
1158 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1159 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1161 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1164 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1165 i < TARGET_VTABLE_USES_DESCRIPTORS;
1166 gnu_field = TREE_CHAIN (gnu_field), i++)
1168 if (build_descriptor)
1170 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1171 build_int_cst (NULL_TREE, i));
1172 TREE_CONSTANT (t) = 1;
1175 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1176 gnu_field, NULL_TREE);
1178 gnu_list = tree_cons (gnu_field, t, gnu_list);
1181 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1185 /* ... fall through ... */
1188 case Attr_Unchecked_Access:
1189 case Attr_Code_Address:
1190 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1192 = build_unary_op (((attribute == Attr_Address
1193 || attribute == Attr_Unrestricted_Access)
1194 && !Must_Be_Byte_Aligned (gnat_node))
1195 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1196 gnu_result_type, gnu_prefix);
1198 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1199 don't try to build a trampoline. */
1200 if (attribute == Attr_Code_Address)
1202 for (gnu_expr = gnu_result;
1203 CONVERT_EXPR_P (gnu_expr);
1204 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1205 TREE_CONSTANT (gnu_expr) = 1;
1207 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1208 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1211 /* For other address attributes applied to a nested function,
1212 find an inner ADDR_EXPR and annotate it so that we can issue
1213 a useful warning with -Wtrampolines. */
1214 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1216 for (gnu_expr = gnu_result;
1217 CONVERT_EXPR_P (gnu_expr);
1218 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1221 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1222 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1224 set_expr_location_from_node (gnu_expr, gnat_node);
1226 /* Check that we're not violating the No_Implicit_Dynamic_Code
1227 restriction. Be conservative if we don't know anything
1228 about the trampoline strategy for the target. */
1229 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1234 case Attr_Pool_Address:
1237 tree gnu_ptr = gnu_prefix;
1239 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1241 /* If this is an unconstrained array, we know the object has been
1242 allocated with the template in front of the object. So compute
1243 the template address. */
1244 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1246 = convert (build_pointer_type
1247 (TYPE_OBJECT_RECORD_TYPE
1248 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1251 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1252 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1253 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1255 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1256 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1257 tree gnu_byte_offset
1258 = convert (sizetype,
1259 size_diffop (size_zero_node, gnu_pos));
1260 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1262 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1263 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1264 gnu_ptr, gnu_byte_offset);
1267 gnu_result = convert (gnu_result_type, gnu_ptr);
1272 case Attr_Object_Size:
1273 case Attr_Value_Size:
1274 case Attr_Max_Size_In_Storage_Elements:
1275 gnu_expr = gnu_prefix;
1277 /* Remove NOPs from GNU_EXPR and conversions from GNU_PREFIX.
1278 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1279 while (TREE_CODE (gnu_expr) == NOP_EXPR)
1280 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1282 gnu_prefix = remove_conversions (gnu_prefix, true);
1283 prefix_unused = true;
1284 gnu_type = TREE_TYPE (gnu_prefix);
1286 /* Replace an unconstrained array type with the type of the underlying
1287 array. We can't do this with a call to maybe_unconstrained_array
1288 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1289 use the record type that will be used to allocate the object and its
1291 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1293 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1294 if (attribute != Attr_Max_Size_In_Storage_Elements)
1295 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1298 /* If we're looking for the size of a field, return the field size.
1299 Otherwise, if the prefix is an object, or if 'Object_Size or
1300 'Max_Size_In_Storage_Elements has been specified, the result is the
1301 GCC size of the type. Otherwise, the result is the RM size of the
1303 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1304 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1305 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1306 || attribute == Attr_Object_Size
1307 || attribute == Attr_Max_Size_In_Storage_Elements)
1309 /* If this is a padded type, the GCC size isn't relevant to the
1310 programmer. Normally, what we want is the RM size, which was set
1311 from the specified size, but if it was not set, we want the size
1312 of the relevant field. Using the MAX of those two produces the
1313 right result in all case. Don't use the size of the field if it's
1314 a self-referential type, since that's never what's wanted. */
1315 if (TREE_CODE (gnu_type) == RECORD_TYPE
1316 && TYPE_IS_PADDING_P (gnu_type)
1317 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1319 gnu_result = rm_size (gnu_type);
1320 if (!(CONTAINS_PLACEHOLDER_P
1321 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))))
1323 = size_binop (MAX_EXPR, gnu_result,
1324 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1326 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1328 Node_Id gnat_deref = Prefix (gnat_node);
1329 Node_Id gnat_actual_subtype
1330 = Actual_Designated_Subtype (gnat_deref);
1332 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1334 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1335 && Present (gnat_actual_subtype))
1337 tree gnu_actual_obj_type
1338 = gnat_to_gnu_type (gnat_actual_subtype);
1340 = build_unc_object_type_from_ptr (gnu_ptr_type,
1341 gnu_actual_obj_type,
1342 get_identifier ("SIZE"));
1345 gnu_result = TYPE_SIZE (gnu_type);
1348 gnu_result = TYPE_SIZE (gnu_type);
1351 gnu_result = rm_size (gnu_type);
1353 gcc_assert (gnu_result);
1355 /* Deal with a self-referential size by returning the maximum size for
1356 a type and by qualifying the size with the object for 'Size of an
1358 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1360 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1361 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1363 gnu_result = max_size (gnu_result, true);
1366 /* If the type contains a template, subtract its size. */
1367 if (TREE_CODE (gnu_type) == RECORD_TYPE
1368 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1369 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1370 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1372 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1374 if (attribute == Attr_Max_Size_In_Storage_Elements)
1375 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1376 gnu_result, bitsize_unit_node);
1379 case Attr_Alignment:
1383 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1384 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1386 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1387 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1389 gnu_type = TREE_TYPE (gnu_prefix);
1390 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1391 prefix_unused = true;
1393 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1394 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1397 Node_Id gnat_prefix = Prefix (gnat_node);
1398 Entity_Id gnat_type = Etype (gnat_prefix);
1399 unsigned int double_align;
1400 bool is_capped_double, align_clause;
1402 /* If the default alignment of "double" or larger scalar types is
1403 specifically capped and there is an alignment clause neither
1404 on the type nor on the prefix itself, return the cap. */
1405 if ((double_align = double_float_alignment) > 0)
1407 = is_double_float_or_array (gnat_type, &align_clause);
1408 else if ((double_align = double_scalar_alignment) > 0)
1410 = is_double_scalar_or_array (gnat_type, &align_clause);
1412 is_capped_double = align_clause = false;
1414 if (is_capped_double
1415 && Nkind (gnat_prefix) == N_Identifier
1416 && Present (Alignment_Clause (Entity (gnat_prefix))))
1417 align_clause = true;
1419 if (is_capped_double && !align_clause)
1420 align = double_align;
1422 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1425 gnu_result = size_int (align);
1431 case Attr_Range_Length:
1432 prefix_unused = true;
1434 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1436 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1438 if (attribute == Attr_First)
1439 gnu_result = TYPE_MIN_VALUE (gnu_type);
1440 else if (attribute == Attr_Last)
1441 gnu_result = TYPE_MAX_VALUE (gnu_type);
1445 (MAX_EXPR, get_base_type (gnu_result_type),
1447 (PLUS_EXPR, get_base_type (gnu_result_type),
1448 build_binary_op (MINUS_EXPR,
1449 get_base_type (gnu_result_type),
1450 convert (gnu_result_type,
1451 TYPE_MAX_VALUE (gnu_type)),
1452 convert (gnu_result_type,
1453 TYPE_MIN_VALUE (gnu_type))),
1454 convert (gnu_result_type, integer_one_node)),
1455 convert (gnu_result_type, integer_zero_node));
1460 /* ... fall through ... */
1464 int Dimension = (Present (Expressions (gnat_node))
1465 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1467 struct parm_attr *pa = NULL;
1468 Entity_Id gnat_param = Empty;
1470 /* Make sure any implicit dereference gets done. */
1471 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1472 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1473 /* We treat unconstrained array In parameters specially. */
1474 if (Nkind (Prefix (gnat_node)) == N_Identifier
1475 && !Is_Constrained (Etype (Prefix (gnat_node)))
1476 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1477 gnat_param = Entity (Prefix (gnat_node));
1478 gnu_type = TREE_TYPE (gnu_prefix);
1479 prefix_unused = true;
1480 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1482 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1487 for (ndim = 1, gnu_type_temp = gnu_type;
1488 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1489 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1490 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1493 Dimension = ndim + 1 - Dimension;
1496 for (i = 1; i < Dimension; i++)
1497 gnu_type = TREE_TYPE (gnu_type);
1499 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1501 /* When not optimizing, look up the slot associated with the parameter
1502 and the dimension in the cache and create a new one on failure. */
1503 if (!optimize && Present (gnat_param))
1505 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1506 if (pa->id == gnat_param && pa->dim == Dimension)
1511 pa = GGC_CNEW (struct parm_attr);
1512 pa->id = gnat_param;
1513 pa->dim = Dimension;
1514 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1518 /* Return the cached expression or build a new one. */
1519 if (attribute == Attr_First)
1521 if (pa && pa->first)
1523 gnu_result = pa->first;
1528 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1531 else if (attribute == Attr_Last)
1535 gnu_result = pa->last;
1540 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1543 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1545 if (pa && pa->length)
1547 gnu_result = pa->length;
1552 /* We used to compute the length as max (hb - lb + 1, 0),
1553 which could overflow for some cases of empty arrays, e.g.
1554 when lb == index_type'first. We now compute the length as
1555 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1556 much rarer cases, for extremely large arrays we expect
1557 never to encounter in practice. In addition, the former
1558 computation required the use of potentially constraining
1559 signed arithmetic while the latter doesn't. Note that the
1560 comparison must be done in the original index base type,
1561 otherwise the conversion of either bound to gnu_compute_type
1564 tree gnu_compute_type = get_base_type (gnu_result_type);
1567 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1569 = convert (gnu_compute_type, TYPE_MIN_VALUE (index_type));
1571 = convert (gnu_compute_type, TYPE_MAX_VALUE (index_type));
1575 (COND_EXPR, gnu_compute_type,
1576 build_binary_op (LT_EXPR, get_base_type (index_type),
1577 TYPE_MAX_VALUE (index_type),
1578 TYPE_MIN_VALUE (index_type)),
1579 convert (gnu_compute_type, integer_zero_node),
1581 (PLUS_EXPR, gnu_compute_type,
1582 build_binary_op (MINUS_EXPR, gnu_compute_type, hb, lb),
1583 convert (gnu_compute_type, integer_one_node)));
1587 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1588 handling. Note that these attributes could not have been used on
1589 an unconstrained array type. */
1590 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result,
1593 /* Cache the expression we have just computed. Since we want to do it
1594 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1595 create the temporary. */
1599 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1600 TREE_SIDE_EFFECTS (gnu_result) = 1;
1601 if (attribute == Attr_First)
1602 pa->first = gnu_result;
1603 else if (attribute == Attr_Last)
1604 pa->last = gnu_result;
1606 pa->length = gnu_result;
1611 case Attr_Bit_Position:
1613 case Attr_First_Bit:
1617 HOST_WIDE_INT bitsize;
1618 HOST_WIDE_INT bitpos;
1620 tree gnu_field_bitpos;
1621 tree gnu_field_offset;
1623 enum machine_mode mode;
1624 int unsignedp, volatilep;
1626 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1627 gnu_prefix = remove_conversions (gnu_prefix, true);
1628 prefix_unused = true;
1630 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1631 the result is 0. Don't allow 'Bit on a bare component, though. */
1632 if (attribute == Attr_Bit
1633 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1634 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1636 gnu_result = integer_zero_node;
1641 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1642 || (attribute == Attr_Bit_Position
1643 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1645 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1646 &mode, &unsignedp, &volatilep, false);
1648 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1650 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1651 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1653 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1654 TREE_CODE (gnu_inner) == COMPONENT_REF
1655 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1656 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1659 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1660 bit_position (TREE_OPERAND (gnu_inner, 1)));
1662 = size_binop (PLUS_EXPR, gnu_field_offset,
1663 byte_position (TREE_OPERAND (gnu_inner, 1)));
1666 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1668 gnu_field_bitpos = bit_position (gnu_prefix);
1669 gnu_field_offset = byte_position (gnu_prefix);
1673 gnu_field_bitpos = bitsize_zero_node;
1674 gnu_field_offset = size_zero_node;
1680 gnu_result = gnu_field_offset;
1683 case Attr_First_Bit:
1685 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1689 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1690 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1691 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1692 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1696 case Attr_Bit_Position:
1697 gnu_result = gnu_field_bitpos;
1701 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1703 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1710 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1711 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1713 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1714 gnu_result = build_binary_op (attribute == Attr_Min
1715 ? MIN_EXPR : MAX_EXPR,
1716 gnu_result_type, gnu_lhs, gnu_rhs);
1720 case Attr_Passed_By_Reference:
1721 gnu_result = size_int (default_pass_by_ref (gnu_type)
1722 || must_pass_by_ref (gnu_type));
1723 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1726 case Attr_Component_Size:
1727 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1728 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1730 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1731 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1733 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1734 gnu_type = TREE_TYPE (gnu_prefix);
1736 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1737 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1739 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1740 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1741 gnu_type = TREE_TYPE (gnu_type);
1743 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1745 /* Note this size cannot be self-referential. */
1746 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1747 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1748 prefix_unused = true;
1751 case Attr_Null_Parameter:
1752 /* This is just a zero cast to the pointer type for our prefix and
1754 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1756 = build_unary_op (INDIRECT_REF, NULL_TREE,
1757 convert (build_pointer_type (gnu_result_type),
1758 integer_zero_node));
1759 TREE_PRIVATE (gnu_result) = 1;
1762 case Attr_Mechanism_Code:
1765 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1767 prefix_unused = true;
1768 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1769 if (Present (Expressions (gnat_node)))
1771 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1773 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1774 i--, gnat_obj = Next_Formal (gnat_obj))
1778 code = Mechanism (gnat_obj);
1779 if (code == Default)
1780 code = ((present_gnu_tree (gnat_obj)
1781 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1782 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1784 && (DECL_BY_COMPONENT_PTR_P
1785 (get_gnu_tree (gnat_obj))))))
1786 ? By_Reference : By_Copy);
1787 gnu_result = convert (gnu_result_type, size_int (- code));
1792 /* Say we have an unimplemented attribute. Then set the value to be
1793 returned to be a zero and hope that's something we can convert to
1794 the type of this attribute. */
1795 post_error ("unimplemented attribute", gnat_node);
1796 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1797 gnu_result = integer_zero_node;
1801 /* If this is an attribute where the prefix was unused, force a use of it if
1802 it has a side-effect. But don't do it if the prefix is just an entity
1803 name. However, if an access check is needed, we must do it. See second
1804 example in AARM 11.6(5.e). */
1805 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1806 && !Is_Entity_Name (Prefix (gnat_node)))
1807 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1808 gnu_prefix, gnu_result);
1810 *gnu_result_type_p = gnu_result_type;
1814 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1815 to a GCC tree, which is returned. */
1818 Case_Statement_to_gnu (Node_Id gnat_node)
1824 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1825 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1827 /* The range of values in a case statement is determined by the rules in
1828 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1829 of the expression. One exception arises in the case of a simple name that
1830 is parenthesized. This still has the Etype of the name, but since it is
1831 not a name, para 7 does not apply, and we need to go to the base type.
1832 This is the only case where parenthesization affects the dynamic
1833 semantics (i.e. the range of possible values at runtime that is covered
1834 by the others alternative.
1836 Another exception is if the subtype of the expression is non-static. In
1837 that case, we also have to use the base type. */
1838 if (Paren_Count (Expression (gnat_node)) != 0
1839 || !Is_OK_Static_Subtype (Underlying_Type
1840 (Etype (Expression (gnat_node)))))
1841 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1843 /* We build a SWITCH_EXPR that contains the code with interspersed
1844 CASE_LABEL_EXPRs for each label. */
1846 push_stack (&gnu_switch_label_stack, NULL_TREE,
1847 create_artificial_label (input_location));
1848 start_stmt_group ();
1849 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1850 Present (gnat_when);
1851 gnat_when = Next_Non_Pragma (gnat_when))
1853 Node_Id gnat_choice;
1854 int choices_added = 0;
1856 /* First compile all the different case choices for the current WHEN
1858 for (gnat_choice = First (Discrete_Choices (gnat_when));
1859 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1861 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1863 switch (Nkind (gnat_choice))
1866 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1867 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1870 case N_Subtype_Indication:
1871 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1872 (Constraint (gnat_choice))));
1873 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1874 (Constraint (gnat_choice))));
1878 case N_Expanded_Name:
1879 /* This represents either a subtype range or a static value of
1880 some kind; Ekind says which. */
1881 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1883 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1885 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1886 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1890 /* ... fall through ... */
1892 case N_Character_Literal:
1893 case N_Integer_Literal:
1894 gnu_low = gnat_to_gnu (gnat_choice);
1897 case N_Others_Choice:
1904 /* If the case value is a subtype that raises Constraint_Error at
1905 run-time because of a wrong bound, then gnu_low or gnu_high is
1906 not translated into an INTEGER_CST. In such a case, we need
1907 to ensure that the when statement is not added in the tree,
1908 otherwise it will crash the gimplifier. */
1909 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1910 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1912 add_stmt_with_node (build3
1913 (CASE_LABEL_EXPR, void_type_node,
1915 create_artificial_label (input_location)),
1921 /* Push a binding level here in case variables are declared as we want
1922 them to be local to this set of statements instead of to the block
1923 containing the Case statement. */
1924 if (choices_added > 0)
1926 add_stmt (build_stmt_group (Statements (gnat_when), true));
1927 add_stmt (build1 (GOTO_EXPR, void_type_node,
1928 TREE_VALUE (gnu_switch_label_stack)));
1932 /* Now emit a definition of the label all the cases branched to. */
1933 add_stmt (build1 (LABEL_EXPR, void_type_node,
1934 TREE_VALUE (gnu_switch_label_stack)));
1935 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1936 end_stmt_group (), NULL_TREE);
1937 pop_stack (&gnu_switch_label_stack);
1942 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1943 to a GCC tree, which is returned. */
1946 Loop_Statement_to_gnu (Node_Id gnat_node)
1948 /* ??? It would be nice to use "build" here, but there's no build5. */
1949 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1950 NULL_TREE, NULL_TREE, NULL_TREE);
1951 tree gnu_loop_var = NULL_TREE;
1952 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1953 tree gnu_cond_expr = NULL_TREE;
1956 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1957 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1958 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label (input_location);
1959 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1960 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1961 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1963 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1964 N_Exit_Statement can find it. */
1965 push_stack (&gnu_loop_label_stack, NULL_TREE,
1966 LOOP_STMT_LABEL (gnu_loop_stmt));
1968 /* Set the condition under which the loop must keep going.
1969 For the case "LOOP .... END LOOP;" the condition is always true. */
1970 if (No (gnat_iter_scheme))
1973 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1974 else if (Present (Condition (gnat_iter_scheme)))
1975 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1976 = gnat_to_gnu (Condition (gnat_iter_scheme));
1978 /* Otherwise we have an iteration scheme and the condition is given by
1979 the bounds of the subtype of the iteration variable. */
1982 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1983 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1984 Entity_Id gnat_type = Etype (gnat_loop_var);
1985 tree gnu_type = get_unpadded_type (gnat_type);
1986 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1987 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1988 tree gnu_first, gnu_last, gnu_limit;
1989 enum tree_code update_code, end_code;
1990 tree gnu_base_type = get_base_type (gnu_type);
1992 /* We must disable modulo reduction for the loop variable, if any,
1993 in order for the loop comparison to be effective. */
1994 if (Reverse_Present (gnat_loop_spec))
1996 gnu_first = gnu_high;
1998 update_code = MINUS_NOMOD_EXPR;
2000 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
2004 gnu_first = gnu_low;
2005 gnu_last = gnu_high;
2006 update_code = PLUS_NOMOD_EXPR;
2008 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
2011 /* We know the loop variable will not overflow if GNU_LAST is a constant
2012 and is not equal to GNU_LIMIT. If it might overflow, we have to move
2013 the limit test to the end of the loop. In that case, we have to test
2014 for an empty loop outside the loop. */
2015 if (TREE_CODE (gnu_last) != INTEGER_CST
2016 || TREE_CODE (gnu_limit) != INTEGER_CST
2017 || tree_int_cst_equal (gnu_last, gnu_limit))
2020 = build3 (COND_EXPR, void_type_node,
2021 build_binary_op (LE_EXPR, integer_type_node,
2023 NULL_TREE, alloc_stmt_list ());
2024 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2027 /* Open a new nesting level that will surround the loop to declare the
2028 loop index variable. */
2029 start_stmt_group ();
2032 /* Declare the loop index and set it to its initial value. */
2033 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2034 if (DECL_BY_REF_P (gnu_loop_var))
2035 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2037 /* The loop variable might be a padded type, so use `convert' to get a
2038 reference to the inner variable if so. */
2039 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2041 /* Set either the top or bottom exit condition as appropriate depending
2042 on whether or not we know an overflow cannot occur. */
2044 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2045 = build_binary_op (NE_EXPR, integer_type_node,
2046 gnu_loop_var, gnu_last);
2048 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2049 = build_binary_op (end_code, integer_type_node,
2050 gnu_loop_var, gnu_last);
2052 LOOP_STMT_UPDATE (gnu_loop_stmt)
2053 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2055 build_binary_op (update_code,
2056 TREE_TYPE (gnu_loop_var),
2058 convert (TREE_TYPE (gnu_loop_var),
2059 integer_one_node)));
2060 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2064 /* If the loop was named, have the name point to this loop. In this case,
2065 the association is not a ..._DECL node, but the end label from this
2067 if (Present (Identifier (gnat_node)))
2068 save_gnu_tree (Entity (Identifier (gnat_node)),
2069 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2071 /* Make the loop body into its own block, so any allocated storage will be
2072 released every iteration. This is needed for stack allocation. */
2073 LOOP_STMT_BODY (gnu_loop_stmt)
2074 = build_stmt_group (Statements (gnat_node), true);
2076 /* If we declared a variable, then we are in a statement group for that
2077 declaration. Add the LOOP_STMT to it and make that the "loop". */
2080 add_stmt (gnu_loop_stmt);
2082 gnu_loop_stmt = end_stmt_group ();
2085 /* If we have an outer COND_EXPR, that's our result and this loop is its
2086 "true" statement. Otherwise, the result is the LOOP_STMT. */
2089 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2090 gnu_result = gnu_cond_expr;
2091 recalculate_side_effects (gnu_cond_expr);
2094 gnu_result = gnu_loop_stmt;
2096 pop_stack (&gnu_loop_label_stack);
2101 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2102 handler for the current function. */
2104 /* This is implemented by issuing a call to the appropriate VMS specific
2105 builtin. To avoid having VMS specific sections in the global gigi decls
2106 array, we maintain the decls of interest here. We can't declare them
2107 inside the function because we must mark them never to be GC'd, which we
2108 can only do at the global level. */
2110 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2111 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2114 establish_gnat_vms_condition_handler (void)
2116 tree establish_stmt;
2118 /* Elaborate the required decls on the first call. Check on the decl for
2119 the gnat condition handler to decide, as this is one we create so we are
2120 sure that it will be non null on subsequent calls. The builtin decl is
2121 looked up so remains null on targets where it is not implemented yet. */
2122 if (gnat_vms_condition_handler_decl == NULL_TREE)
2124 vms_builtin_establish_handler_decl
2126 (get_identifier ("__builtin_establish_vms_condition_handler"));
2128 gnat_vms_condition_handler_decl
2129 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2131 build_function_type_list (integer_type_node,
2135 NULL_TREE, 0, 1, 1, 0, Empty);
2137 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2138 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2141 /* Do nothing if the establish builtin is not available, which might happen
2142 on targets where the facility is not implemented. */
2143 if (vms_builtin_establish_handler_decl == NULL_TREE)
2147 = build_call_1_expr (vms_builtin_establish_handler_decl,
2149 (ADDR_EXPR, NULL_TREE,
2150 gnat_vms_condition_handler_decl));
2152 add_stmt (establish_stmt);
2155 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2156 don't return anything. */
2159 Subprogram_Body_to_gnu (Node_Id gnat_node)
2161 /* Defining identifier of a parameter to the subprogram. */
2162 Entity_Id gnat_param;
2163 /* The defining identifier for the subprogram body. Note that if a
2164 specification has appeared before for this body, then the identifier
2165 occurring in that specification will also be a defining identifier and all
2166 the calls to this subprogram will point to that specification. */
2167 Entity_Id gnat_subprog_id
2168 = (Present (Corresponding_Spec (gnat_node))
2169 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2170 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2171 tree gnu_subprog_decl;
2172 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2173 tree gnu_subprog_type;
2176 VEC(parm_attr,gc) *cache;
2178 /* If this is a generic object or if it has been eliminated,
2180 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2181 || Ekind (gnat_subprog_id) == E_Generic_Function
2182 || Is_Eliminated (gnat_subprog_id))
2185 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2186 the already-elaborated tree node. However, if this subprogram had its
2187 elaboration deferred, we will already have made a tree node for it. So
2188 treat it as not being defined in that case. Such a subprogram cannot
2189 have an address clause or a freeze node, so this test is safe, though it
2190 does disable some otherwise-useful error checking. */
2192 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2193 Acts_As_Spec (gnat_node)
2194 && !present_gnu_tree (gnat_subprog_id));
2196 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2198 /* Propagate the debug mode. */
2199 if (!Needs_Debug_Info (gnat_subprog_id))
2200 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2202 /* Set the line number in the decl to correspond to that of the body so that
2203 the line number notes are written correctly. */
2204 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2206 /* Initialize the information structure for the function. */
2207 allocate_struct_function (gnu_subprog_decl, false);
2208 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2209 = GGC_CNEW (struct language_function);
2211 begin_subprog_body (gnu_subprog_decl);
2212 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2214 /* If there are Out parameters, we need to ensure that the return statement
2215 properly copies them out. We do this by making a new block and converting
2216 any inner return into a goto to a label at the end of the block. */
2217 push_stack (&gnu_return_label_stack, NULL_TREE,
2218 gnu_cico_list ? create_artificial_label (input_location)
2221 /* Get a tree corresponding to the code for the subprogram. */
2222 start_stmt_group ();
2225 /* See if there are any parameters for which we don't yet have GCC entities.
2226 These must be for Out parameters for which we will be making VAR_DECL
2227 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2228 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2229 the order of the parameters. */
2230 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2231 Present (gnat_param);
2232 gnat_param = Next_Formal_With_Extras (gnat_param))
2233 if (!present_gnu_tree (gnat_param))
2235 /* Skip any entries that have been already filled in; they must
2236 correspond to In Out parameters. */
2237 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2238 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2241 /* Do any needed references for padded types. */
2242 TREE_VALUE (gnu_cico_list)
2243 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2244 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2247 /* On VMS, establish our condition handler to possibly turn a condition into
2248 the corresponding exception if the subprogram has a foreign convention or
2251 To ensure proper execution of local finalizations on condition instances,
2252 we must turn a condition into the corresponding exception even if there
2253 is no applicable Ada handler, and need at least one condition handler per
2254 possible call chain involving GNAT code. OTOH, establishing the handler
2255 has a cost so we want to minimize the number of subprograms into which
2256 this happens. The foreign or exported condition is expected to satisfy
2257 all the constraints. */
2258 if (TARGET_ABI_OPEN_VMS
2259 && (Has_Foreign_Convention (gnat_subprog_id)
2260 || Is_Exported (gnat_subprog_id)))
2261 establish_gnat_vms_condition_handler ();
2263 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2265 /* Generate the code of the subprogram itself. A return statement will be
2266 present and any Out parameters will be handled there. */
2267 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2269 gnu_result = end_stmt_group ();
2271 /* If we populated the parameter attributes cache, we need to make sure
2272 that the cached expressions are evaluated on all possible paths. */
2273 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2276 struct parm_attr *pa;
2279 start_stmt_group ();
2281 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2284 add_stmt_with_node (pa->first, gnat_node);
2286 add_stmt_with_node (pa->last, gnat_node);
2288 add_stmt_with_node (pa->length, gnat_node);
2291 add_stmt (gnu_result);
2292 gnu_result = end_stmt_group ();
2295 /* If we made a special return label, we need to make a block that contains
2296 the definition of that label and the copying to the return value. That
2297 block first contains the function, then the label and copy statement. */
2298 if (TREE_VALUE (gnu_return_label_stack))
2302 start_stmt_group ();
2304 add_stmt (gnu_result);
2305 add_stmt (build1 (LABEL_EXPR, void_type_node,
2306 TREE_VALUE (gnu_return_label_stack)));
2308 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2309 if (list_length (gnu_cico_list) == 1)
2310 gnu_retval = TREE_VALUE (gnu_cico_list);
2312 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2315 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2316 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2319 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2320 End_Label (Handled_Statement_Sequence (gnat_node)));
2322 gnu_result = end_stmt_group ();
2325 pop_stack (&gnu_return_label_stack);
2327 /* Set the end location. */
2329 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2330 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2331 : Sloc (gnat_node)),
2332 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2334 end_subprog_body (gnu_result, false);
2336 /* Disconnect the trees for parameters that we made variables for from the
2337 GNAT entities since these are unusable after we end the function. */
2338 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2339 Present (gnat_param);
2340 gnat_param = Next_Formal_With_Extras (gnat_param))
2341 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2342 save_gnu_tree (gnat_param, NULL_TREE, false);
2344 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2345 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2347 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2350 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2351 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2352 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2353 If GNU_TARGET is non-null, this must be a function call and the result
2354 of the call is to be placed into that object. */
2357 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2360 /* The GCC node corresponding to the GNAT subprogram name. This can either
2361 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2362 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2364 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2365 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2366 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2367 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2369 Entity_Id gnat_formal;
2370 Node_Id gnat_actual;
2371 tree gnu_actual_list = NULL_TREE;
2372 tree gnu_name_list = NULL_TREE;
2373 tree gnu_before_list = NULL_TREE;
2374 tree gnu_after_list = NULL_TREE;
2375 tree gnu_subprog_call;
2377 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2379 /* If we are calling a stubbed function, make this into a raise of
2380 Program_Error. Elaborate all our args first. */
2381 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2382 && DECL_STUBBED_P (gnu_subprog_node))
2384 for (gnat_actual = First_Actual (gnat_node);
2385 Present (gnat_actual);
2386 gnat_actual = Next_Actual (gnat_actual))
2387 add_stmt (gnat_to_gnu (gnat_actual));
2391 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2392 N_Raise_Program_Error);
2394 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2396 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2397 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2404 /* If we are calling by supplying a pointer to a target, set up that
2405 pointer as the first argument. Use GNU_TARGET if one was passed;
2406 otherwise, make a target by building a variable of the maximum size
2408 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2410 tree gnu_real_ret_type
2411 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2416 = maybe_pad_type (gnu_real_ret_type,
2417 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2418 0, Etype (Name (gnat_node)), "PAD", false,
2421 /* ??? We may be about to create a static temporary if we happen to
2422 be at the global binding level. That's a regression from what
2423 the 3.x back-end would generate in the same situation, but we
2424 don't have a mechanism in Gigi for creating automatic variables
2425 in the elaboration routines. */
2427 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2428 NULL, false, false, false, false, NULL,
2433 = tree_cons (NULL_TREE,
2434 build_unary_op (ADDR_EXPR, NULL_TREE,
2435 unchecked_convert (gnu_real_ret_type,
2442 /* The only way we can be making a call via an access type is if Name is an
2443 explicit dereference. In that case, get the list of formal args from the
2444 type the access type is pointing to. Otherwise, get the formals from
2445 entity being called. */
2446 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2447 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2448 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2449 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2452 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2454 /* Create the list of the actual parameters as GCC expects it, namely a chain
2455 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2456 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2457 parameters not passed by reference and don't need to be copied in. */
2458 for (gnat_actual = First_Actual (gnat_node);
2459 Present (gnat_actual);
2460 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2461 gnat_actual = Next_Actual (gnat_actual))
2464 = (present_gnu_tree (gnat_formal)
2465 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2466 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2467 /* We must suppress conversions that can cause the creation of a
2468 temporary in the Out or In Out case because we need the real
2469 object in this case, either to pass its address if it's passed
2470 by reference or as target of the back copy done after the call
2471 if it uses the copy-in copy-out mechanism. We do it in the In
2472 case too, except for an unchecked conversion because it alone
2473 can cause the actual to be misaligned and the addressability
2474 test is applied to the real object. */
2475 bool suppress_type_conversion
2476 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2477 && Ekind (gnat_formal) != E_In_Parameter)
2478 || (Nkind (gnat_actual) == N_Type_Conversion
2479 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2480 Node_Id gnat_name = (suppress_type_conversion
2481 ? Expression (gnat_actual) : gnat_actual);
2482 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2485 /* If it's possible we may need to use this expression twice, make sure
2486 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2487 to force side-effects before the call.
2488 ??? This is more conservative than we need since we don't need to do
2489 this for pass-by-ref with no conversion. */
2490 if (Ekind (gnat_formal) != E_In_Parameter)
2491 gnu_name = gnat_stabilize_reference (gnu_name, true);
2493 /* If we are passing a non-addressable parameter by reference, pass the
2494 address of a copy. In the Out or In Out case, set up to copy back
2495 out after the call. */
2497 && (DECL_BY_REF_P (gnu_formal)
2498 || (TREE_CODE (gnu_formal) == PARM_DECL
2499 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2500 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2501 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2502 && !addressable_p (gnu_name, gnu_name_type))
2504 tree gnu_copy = gnu_name, gnu_temp;
2506 /* If the type is by_reference, a copy is not allowed. */
2507 if (Is_By_Reference_Type (Etype (gnat_formal)))
2509 ("misaligned actual cannot be passed by reference", gnat_actual);
2511 /* For users of Starlet we issue a warning because the
2512 interface apparently assumes that by-ref parameters
2513 outlive the procedure invocation. The code still
2514 will not work as intended, but we cannot do much
2515 better since other low-level parts of the back-end
2516 would allocate temporaries at will because of the
2517 misalignment if we did not do so here. */
2518 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2521 ("?possible violation of implicit assumption", gnat_actual);
2523 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2524 Entity (Name (gnat_node)));
2525 post_error_ne ("?because of misalignment of &", gnat_actual,
2529 /* If the actual type of the object is already the nominal type,
2530 we have nothing to do, except if the size is self-referential
2531 in which case we'll remove the unpadding below. */
2532 if (TREE_TYPE (gnu_name) == gnu_name_type
2533 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2536 /* Otherwise remove unpadding from the object and reset the copy. */
2537 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2538 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2540 && (TYPE_IS_PADDING_P
2541 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2542 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2544 /* Otherwise convert to the nominal type of the object if it's
2545 a record type. There are several cases in which we need to
2546 make the temporary using this type instead of the actual type
2547 of the object if they are distinct, because the expectations
2548 of the callee would otherwise not be met:
2549 - if it's a justified modular type,
2550 - if the actual type is a smaller packable version of it. */
2551 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2552 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2553 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2555 gnu_name = convert (gnu_name_type, gnu_name);
2557 /* Make a SAVE_EXPR to both properly account for potential side
2558 effects and handle the creation of a temporary copy. Special
2559 code in gnat_gimplify_expr ensures that the same temporary is
2560 used as the object and copied back after the call if needed. */
2561 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2562 TREE_SIDE_EFFECTS (gnu_name) = 1;
2564 /* Set up to move the copy back to the original. */
2565 if (Ekind (gnat_formal) != E_In_Parameter)
2567 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2569 set_expr_location_from_node (gnu_temp, gnat_node);
2570 append_to_statement_list (gnu_temp, &gnu_after_list);
2574 /* Start from the real object and build the actual. */
2575 gnu_actual = gnu_name;
2577 /* If this was a procedure call, we may not have removed any padding.
2578 So do it here for the part we will use as an input, if any. */
2579 if (Ekind (gnat_formal) != E_Out_Parameter
2580 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
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 and actually don't put
2615 back the conversion at all if a check is emitted. This is also
2616 done for the conversion to the formal's type just below. */
2617 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2618 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2622 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2623 gnu_actual = convert (gnu_formal_type, gnu_actual);
2625 /* Unless this is an In parameter, we must remove any justified modular
2626 building from GNU_NAME to get an lvalue. */
2627 if (Ekind (gnat_formal) != E_In_Parameter
2628 && TREE_CODE (gnu_name) == CONSTRUCTOR
2629 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2630 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2631 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2634 /* If we have not saved a GCC object for the formal, it means it is an
2635 Out parameter not passed by reference and that does not need to be
2636 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2639 && TREE_CODE (gnu_formal) == PARM_DECL
2640 && DECL_BY_REF_P (gnu_formal))
2642 if (Ekind (gnat_formal) != E_In_Parameter)
2644 /* In Out or Out parameters passed by reference don't use the
2645 copy-in copy-out mechanism so the address of the real object
2646 must be passed to the function. */
2647 gnu_actual = gnu_name;
2649 /* If we have a padded type, be sure we've removed padding. */
2650 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2651 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2652 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2653 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2656 /* If we have the constructed subtype of an aliased object
2657 with an unconstrained nominal subtype, the type of the
2658 actual includes the template, although it is formally
2659 constrained. So we need to convert it back to the real
2660 constructed subtype to retrieve the constrained part
2661 and takes its address. */
2662 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2663 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2664 && TREE_CODE (gnu_actual) != SAVE_EXPR
2665 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2666 && Is_Array_Type (Etype (gnat_actual)))
2667 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2671 /* The symmetry of the paths to the type of an entity is broken here
2672 since arguments don't know that they will be passed by ref. */
2673 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2674 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2677 && TREE_CODE (gnu_formal) == PARM_DECL
2678 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2680 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2681 gnu_actual = maybe_implicit_deref (gnu_actual);
2682 gnu_actual = maybe_unconstrained_array (gnu_actual);
2684 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2685 && TYPE_IS_PADDING_P (gnu_formal_type))
2687 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2688 gnu_actual = convert (gnu_formal_type, gnu_actual);
2691 /* Take the address of the object and convert to the proper pointer
2692 type. We'd like to actually compute the address of the beginning
2693 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2694 possibility that the ARRAY_REF might return a constant and we'd be
2695 getting the wrong address. Neither approach is exactly correct,
2696 but this is the most likely to work in all cases. */
2697 gnu_actual = convert (gnu_formal_type,
2698 build_unary_op (ADDR_EXPR, NULL_TREE,
2702 && TREE_CODE (gnu_formal) == PARM_DECL
2703 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2705 /* If arg is 'Null_Parameter, pass zero descriptor. */
2706 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2707 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2708 && TREE_PRIVATE (gnu_actual))
2709 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2712 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2713 fill_vms_descriptor (gnu_actual,
2719 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2721 if (Ekind (gnat_formal) != E_In_Parameter)
2722 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2724 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2727 /* If this is 'Null_Parameter, pass a zero even though we are
2728 dereferencing it. */
2729 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2730 && TREE_PRIVATE (gnu_actual)
2731 && host_integerp (gnu_actual_size, 1)
2732 && 0 >= compare_tree_int (gnu_actual_size,
2735 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2736 convert (gnat_type_for_size
2737 (tree_low_cst (gnu_actual_size, 1),
2742 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2745 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2748 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2750 nreverse (gnu_actual_list));
2751 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2753 /* If we return by passing a target, the result is the target after the
2754 call. We must not emit the call directly here because this might be
2755 evaluated as part of an expression with conditions to control whether
2756 the call should be emitted or not. */
2757 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2759 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2760 by the target object converted to the proper type. Doing so would
2761 potentially be very inefficient, however, as this expression might
2762 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2763 pointless temporary copy of the whole object.
2765 What we do instead is build a COMPOUND_EXPR returning the address of
2766 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2767 SAVE_EXPR later on then only incurs a pointer copy. */
2769 tree gnu_result_type
2770 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2773 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2775 tree gnu_target_address
2776 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2777 set_expr_location_from_node (gnu_target_address, gnat_node);
2780 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2781 gnu_subprog_call, gnu_target_address);
2784 = unchecked_convert (gnu_result_type,
2785 build_unary_op (INDIRECT_REF, NULL_TREE,
2789 *gnu_result_type_p = gnu_result_type;
2793 /* If it is a function call, the result is the call expression unless
2794 a target is specified, in which case we copy the result into the target
2795 and return the assignment statement. */
2796 else if (Nkind (gnat_node) == N_Function_Call)
2798 gnu_result = gnu_subprog_call;
2800 /* If the function returns an unconstrained array or by reference,
2801 we have to de-dereference the pointer. */
2802 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2803 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2804 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2807 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2808 gnu_target, gnu_result);
2810 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2815 /* If this is the case where the GNAT tree contains a procedure call
2816 but the Ada procedure has copy in copy out parameters, the special
2817 parameter passing mechanism must be used. */
2818 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2820 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2821 in copy out parameters. */
2822 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2823 int length = list_length (scalar_return_list);
2829 gnu_subprog_call = save_expr (gnu_subprog_call);
2830 gnu_name_list = nreverse (gnu_name_list);
2832 /* If any of the names had side-effects, ensure they are all
2833 evaluated before the call. */
2834 for (gnu_name = gnu_name_list; gnu_name;
2835 gnu_name = TREE_CHAIN (gnu_name))
2836 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2837 append_to_statement_list (TREE_VALUE (gnu_name),
2841 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2842 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2844 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2846 for (gnat_actual = First_Actual (gnat_node);
2847 Present (gnat_actual);
2848 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2849 gnat_actual = Next_Actual (gnat_actual))
2850 /* If we are dealing with a copy in copy out parameter, we must
2851 retrieve its value from the record returned in the call. */
2852 if (!(present_gnu_tree (gnat_formal)
2853 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2854 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2855 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2856 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2857 || (DECL_BY_DESCRIPTOR_P
2858 (get_gnu_tree (gnat_formal))))))))
2859 && Ekind (gnat_formal) != E_In_Parameter)
2861 /* Get the value to assign to this Out or In Out parameter. It is
2862 either the result of the function if there is only a single such
2863 parameter or the appropriate field from the record returned. */
2865 = length == 1 ? gnu_subprog_call
2866 : build_component_ref (gnu_subprog_call, NULL_TREE,
2867 TREE_PURPOSE (scalar_return_list),
2870 /* If the actual is a conversion, get the inner expression, which
2871 will be the real destination, and convert the result to the
2872 type of the actual parameter. */
2874 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2876 /* If the result is a padded type, remove the padding. */
2877 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2878 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2879 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2880 (TREE_TYPE (gnu_result))),
2883 /* If the actual is a type conversion, the real target object is
2884 denoted by the inner Expression and we need to convert the
2885 result to the associated type.
2886 We also need to convert our gnu assignment target to this type
2887 if the corresponding GNU_NAME was constructed from the GNAT
2888 conversion node and not from the inner Expression. */
2889 if (Nkind (gnat_actual) == N_Type_Conversion)
2892 = convert_with_check
2893 (Etype (Expression (gnat_actual)), gnu_result,
2894 Do_Overflow_Check (gnat_actual),
2895 Do_Range_Check (Expression (gnat_actual)),
2896 Float_Truncate (gnat_actual), gnat_actual);
2898 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2899 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2902 /* Unchecked conversions as actuals for Out parameters are not
2903 allowed in user code because they are not variables, but do
2904 occur in front-end expansions. The associated GNU_NAME is
2905 always obtained from the inner expression in such cases. */
2906 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2907 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2909 No_Truncation (gnat_actual));
2912 if (Do_Range_Check (gnat_actual))
2914 = emit_range_check (gnu_result, Etype (gnat_actual),
2917 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2918 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2919 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2922 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2923 gnu_actual, gnu_result);
2924 set_expr_location_from_node (gnu_result, gnat_node);
2925 append_to_statement_list (gnu_result, &gnu_before_list);
2926 scalar_return_list = TREE_CHAIN (scalar_return_list);
2927 gnu_name_list = TREE_CHAIN (gnu_name_list);
2931 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2933 append_to_statement_list (gnu_after_list, &gnu_before_list);
2934 return gnu_before_list;
2937 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2938 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2941 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2943 tree gnu_jmpsave_decl = NULL_TREE;
2944 tree gnu_jmpbuf_decl = NULL_TREE;
2945 /* If just annotating, ignore all EH and cleanups. */
2946 bool gcc_zcx = (!type_annotate_only
2947 && Present (Exception_Handlers (gnat_node))
2948 && Exception_Mechanism == Back_End_Exceptions);
2950 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2951 && Exception_Mechanism == Setjmp_Longjmp);
2952 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2953 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2954 tree gnu_inner_block; /* The statement(s) for the block itself. */
2959 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2960 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2961 add_cleanup, and when we leave the binding, end_stmt_group will create
2962 the TRY_FINALLY_EXPR.
2964 ??? The region level calls down there have been specifically put in place
2965 for a ZCX context and currently the order in which things are emitted
2966 (region/handlers) is different from the SJLJ case. Instead of putting
2967 other calls with different conditions at other places for the SJLJ case,
2968 it seems cleaner to reorder things for the SJLJ case and generalize the
2969 condition to make it not ZCX specific.
2971 If there are any exceptions or cleanup processing involved, we need an
2972 outer statement group (for Setjmp_Longjmp) and binding level. */
2973 if (binding_for_block)
2975 start_stmt_group ();
2979 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2980 area for address of previous buffer. Do this first since we need to have
2981 the setjmp buf known for any decls in this block. */
2984 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2985 NULL_TREE, jmpbuf_ptr_type,
2986 build_call_0_expr (get_jmpbuf_decl),
2987 false, false, false, false, NULL,
2989 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2991 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2992 because of the unstructured form of EH used by setjmp_longjmp, there
2993 might be forward edges going to __builtin_setjmp receivers on which
2994 it is uninitialized, although they will never be actually taken. */
2995 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2996 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2997 NULL_TREE, jmpbuf_type,
2998 NULL_TREE, false, false, false, false,
3000 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
3002 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
3004 /* When we exit this block, restore the saved value. */
3005 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
3006 End_Label (gnat_node));
3009 /* If we are to call a function when exiting this block, add a cleanup
3010 to the binding level we made above. Note that add_cleanup is FIFO
3011 so we must register this cleanup after the EH cleanup just above. */
3013 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
3014 End_Label (gnat_node));
3016 /* Now build the tree for the declarations and statements inside this block.
3017 If this is SJLJ, set our jmp_buf as the current buffer. */
3018 start_stmt_group ();
3021 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3022 build_unary_op (ADDR_EXPR, NULL_TREE,
3025 if (Present (First_Real_Statement (gnat_node)))
3026 process_decls (Statements (gnat_node), Empty,
3027 First_Real_Statement (gnat_node), true, true);
3029 /* Generate code for each statement in the block. */
3030 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3031 ? First_Real_Statement (gnat_node)
3032 : First (Statements (gnat_node)));
3033 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3034 add_stmt (gnat_to_gnu (gnat_temp));
3035 gnu_inner_block = end_stmt_group ();
3037 /* Now generate code for the two exception models, if either is relevant for
3041 tree *gnu_else_ptr = 0;
3044 /* Make a binding level for the exception handling declarations and code
3045 and set up gnu_except_ptr_stack for the handlers to use. */
3046 start_stmt_group ();
3049 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3050 create_var_decl (get_identifier ("EXCEPT_PTR"),
3052 build_pointer_type (except_type_node),
3053 build_call_0_expr (get_excptr_decl), false,
3054 false, false, false, NULL, gnat_node));
3056 /* Generate code for each handler. The N_Exception_Handler case does the
3057 real work and returns a COND_EXPR for each handler, which we chain
3059 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3060 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3062 gnu_expr = gnat_to_gnu (gnat_temp);
3064 /* If this is the first one, set it as the outer one. Otherwise,
3065 point the "else" part of the previous handler to us. Then point
3066 to our "else" part. */
3068 add_stmt (gnu_expr);
3070 *gnu_else_ptr = gnu_expr;
3072 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3075 /* If none of the exception handlers did anything, re-raise but do not
3077 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3078 TREE_VALUE (gnu_except_ptr_stack));
3079 set_expr_location_from_node (gnu_expr, gnat_node);
3082 *gnu_else_ptr = gnu_expr;
3084 add_stmt (gnu_expr);
3086 /* End the binding level dedicated to the exception handlers and get the
3087 whole statement group. */
3088 pop_stack (&gnu_except_ptr_stack);
3090 gnu_handler = end_stmt_group ();
3092 /* If the setjmp returns 1, we restore our incoming longjmp value and
3093 then check the handlers. */
3094 start_stmt_group ();
3095 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3098 add_stmt (gnu_handler);
3099 gnu_handler = end_stmt_group ();
3101 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3102 gnu_result = build3 (COND_EXPR, void_type_node,
3105 build_unary_op (ADDR_EXPR, NULL_TREE,
3107 gnu_handler, gnu_inner_block);
3113 /* First make a block containing the handlers. */
3114 start_stmt_group ();
3115 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3116 Present (gnat_temp);
3117 gnat_temp = Next_Non_Pragma (gnat_temp))
3118 add_stmt (gnat_to_gnu (gnat_temp));
3119 gnu_handlers = end_stmt_group ();
3121 /* Now make the TRY_CATCH_EXPR for the block. */
3122 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3123 gnu_inner_block, gnu_handlers);
3126 gnu_result = gnu_inner_block;
3128 /* Now close our outer block, if we had to make one. */
3129 if (binding_for_block)
3131 add_stmt (gnu_result);
3133 gnu_result = end_stmt_group ();
3139 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3140 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3141 exception handling. */
3144 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3146 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3147 an "if" statement to select the proper exceptions. For "Others", exclude
3148 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3149 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3150 tree gnu_choice = integer_zero_node;
3151 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3154 for (gnat_temp = First (Exception_Choices (gnat_node));
3155 gnat_temp; gnat_temp = Next (gnat_temp))
3159 if (Nkind (gnat_temp) == N_Others_Choice)
3161 if (All_Others (gnat_temp))
3162 this_choice = integer_one_node;
3166 (EQ_EXPR, integer_type_node,
3171 (INDIRECT_REF, NULL_TREE,
3172 TREE_VALUE (gnu_except_ptr_stack)),
3173 get_identifier ("not_handled_by_others"), NULL_TREE,
3178 else if (Nkind (gnat_temp) == N_Identifier
3179 || Nkind (gnat_temp) == N_Expanded_Name)
3181 Entity_Id gnat_ex_id = Entity (gnat_temp);
3184 /* Exception may be a renaming. Recover original exception which is
3185 the one elaborated and registered. */
3186 if (Present (Renamed_Object (gnat_ex_id)))
3187 gnat_ex_id = Renamed_Object (gnat_ex_id);
3189 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3193 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3194 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3195 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3197 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3198 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3200 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3203 = build_component_ref
3204 (build_unary_op (INDIRECT_REF, NULL_TREE,
3205 TREE_VALUE (gnu_except_ptr_stack)),
3206 get_identifier ("lang"), NULL_TREE, false);
3210 (TRUTH_ORIF_EXPR, integer_type_node,
3211 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3212 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3219 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3220 gnu_choice, this_choice);
3223 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3226 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3227 to a GCC tree, which is returned. This is the variant for ZCX. */
3230 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3232 tree gnu_etypes_list = NULL_TREE;
3235 tree gnu_current_exc_ptr;
3236 tree gnu_incoming_exc_ptr;
3239 /* We build a TREE_LIST of nodes representing what exception types this
3240 handler can catch, with special cases for others and all others cases.
3242 Each exception type is actually identified by a pointer to the exception
3243 id, or to a dummy object for "others" and "all others".
3245 Care should be taken to ensure that the control flow impact of "others"
3246 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3248 for (gnat_temp = First (Exception_Choices (gnat_node));
3249 gnat_temp; gnat_temp = Next (gnat_temp))
3251 if (Nkind (gnat_temp) == N_Others_Choice)
3254 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3257 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3259 else if (Nkind (gnat_temp) == N_Identifier
3260 || Nkind (gnat_temp) == N_Expanded_Name)
3262 Entity_Id gnat_ex_id = Entity (gnat_temp);
3264 /* Exception may be a renaming. Recover original exception which is
3265 the one elaborated and registered. */
3266 if (Present (Renamed_Object (gnat_ex_id)))
3267 gnat_ex_id = Renamed_Object (gnat_ex_id);
3269 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3270 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3272 /* The Non_Ada_Error case for VMS exceptions is handled
3273 by the personality routine. */
3278 /* The GCC interface expects NULL to be passed for catch all handlers, so
3279 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3280 is integer_zero_node. It would not work, however, because GCC's
3281 notion of "catch all" is stronger than our notion of "others". Until
3282 we correctly use the cleanup interface as well, doing that would
3283 prevent the "all others" handlers from being seen, because nothing
3284 can be caught beyond a catch all from GCC's point of view. */
3285 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3288 start_stmt_group ();
3291 /* Expand a call to the begin_handler hook at the beginning of the handler,
3292 and arrange for a call to the end_handler hook to occur on every possible
3295 The hooks expect a pointer to the low level occurrence. This is required
3296 for our stack management scheme because a raise inside the handler pushes
3297 a new occurrence on top of the stack, which means that this top does not
3298 necessarily match the occurrence this handler was dealing with.
3300 The EXC_PTR_EXPR object references the exception occurrence being
3301 propagated. Upon handler entry, this is the exception for which the
3302 handler is triggered. This might not be the case upon handler exit,
3303 however, as we might have a new occurrence propagated by the handler's
3304 body, and the end_handler hook called as a cleanup in this context.
3306 We use a local variable to retrieve the incoming value at handler entry
3307 time, and reuse it to feed the end_handler hook's argument at exit. */
3308 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3309 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3310 ptr_type_node, gnu_current_exc_ptr,
3311 false, false, false, false, NULL,
3314 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3315 gnu_incoming_exc_ptr),
3317 /* ??? We don't seem to have an End_Label at hand to set the location. */
3318 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3320 add_stmt_list (Statements (gnat_node));
3323 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3327 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3330 Compilation_Unit_to_gnu (Node_Id gnat_node)
3332 /* Make the decl for the elaboration procedure. */
3333 bool body_p = (Defining_Entity (Unit (gnat_node)),
3334 Nkind (Unit (gnat_node)) == N_Package_Body
3335 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3336 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3337 tree gnu_elab_proc_decl
3338 = create_subprog_decl
3339 (create_concat_name (gnat_unit_entity,
3340 body_p ? "elabb" : "elabs"),
3341 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3343 struct elab_info *info;
3345 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3347 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3348 allocate_struct_function (gnu_elab_proc_decl, false);
3349 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3352 /* For a body, first process the spec if there is one. */
3353 if (Nkind (Unit (gnat_node)) == N_Package_Body
3354 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3355 && !Acts_As_Spec (gnat_node)))
3357 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3358 finalize_from_with_types ();
3361 process_inlined_subprograms (gnat_node);
3363 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3365 elaborate_all_entities (gnat_node);
3367 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3368 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3369 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3373 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3375 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3377 /* Process any pragmas and actions following the unit. */
3378 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3379 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3380 finalize_from_with_types ();
3382 /* Save away what we've made so far and record this potential elaboration
3384 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3385 set_current_block_context (gnu_elab_proc_decl);
3387 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3388 info->next = elab_info_list;
3389 info->elab_proc = gnu_elab_proc_decl;
3390 info->gnat_node = gnat_node;
3391 elab_info_list = info;
3393 /* Generate elaboration code for this unit, if necessary, and say whether
3395 pop_stack (&gnu_elab_proc_stack);
3397 /* Invalidate the global renaming pointers. This is necessary because
3398 stabilization of the renamed entities may create SAVE_EXPRs which
3399 have been tied to a specific elaboration routine just above. */
3400 invalidate_global_renaming_pointers ();
3403 /* Return whether GNAT_NODE, an unchecked type conversion, is on the LHS
3404 of an assignment and a no-op as far as gigi is concerned. */
3407 unchecked_conversion_lhs_nop (Node_Id gnat_node)
3409 Entity_Id from_type, to_type;
3411 /* The conversion must be on the LHS of an assignment. Otherwise, even
3412 if the conversion was essentially a no-op, it could de facto ensure
3413 type consistency and this should be preserved. */
3414 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3415 && Name (Parent (gnat_node)) == gnat_node))
3418 from_type = Etype (Expression (gnat_node));
3420 /* We're interested in artificial conversions generated by the front-end
3421 to make private types explicit, e.g. in Expand_Assign_Array. */
3422 if (!Is_Private_Type (from_type))
3425 from_type = Underlying_Type (from_type);
3426 to_type = Etype (gnat_node);
3428 /* The direct conversion to the underlying type is a no-op. */
3429 if (to_type == from_type)
3432 /* For an array type, the conversion to the PAT is a no-op. */
3433 if (Ekind (from_type) == E_Array_Subtype
3434 && to_type == Packed_Array_Type (from_type))
3440 /* This function is the driver of the GNAT to GCC tree transformation
3441 process. It is the entry point of the tree transformer. GNAT_NODE is the
3442 root of some GNAT tree. Return the root of the corresponding GCC tree.
3443 If this is an expression, return the GCC equivalent of the expression. If
3444 it is a statement, return the statement. In the case when called for a
3445 statement, it may also add statements to the current statement group, in
3446 which case anything it returns is to be interpreted as occurring after
3447 anything `it already added. */
3450 gnat_to_gnu (Node_Id gnat_node)
3452 bool went_into_elab_proc = false;
3453 tree gnu_result = error_mark_node; /* Default to no value. */
3454 tree gnu_result_type = void_type_node;
3456 tree gnu_lhs, gnu_rhs;
3459 /* Save node number for error message and set location information. */
3460 error_gnat_node = gnat_node;
3461 Sloc_to_locus (Sloc (gnat_node), &input_location);
3463 if (type_annotate_only
3464 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3465 return alloc_stmt_list ();
3467 /* If this node is a non-static subexpression and we are only
3468 annotating types, make this into a NULL_EXPR. */
3469 if (type_annotate_only
3470 && IN (Nkind (gnat_node), N_Subexpr)
3471 && Nkind (gnat_node) != N_Identifier
3472 && !Compile_Time_Known_Value (gnat_node))
3473 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3474 build_call_raise (CE_Range_Check_Failed, gnat_node,
3475 N_Raise_Constraint_Error));
3477 /* If this is a Statement and we are at top level, it must be part of the
3478 elaboration procedure, so mark us as being in that procedure and push our
3481 If we are in the elaboration procedure, check if we are violating a
3482 No_Elaboration_Code restriction by having a statement there. */
3483 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3484 && Nkind (gnat_node) != N_Null_Statement)
3485 || Nkind (gnat_node) == N_Procedure_Call_Statement
3486 || Nkind (gnat_node) == N_Label
3487 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3488 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3489 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3490 || Nkind (gnat_node) == N_Raise_Storage_Error
3491 || Nkind (gnat_node) == N_Raise_Program_Error)
3492 && (Ekind (Etype (gnat_node)) == E_Void)))
3494 if (!current_function_decl)
3496 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3497 start_stmt_group ();
3499 went_into_elab_proc = true;
3502 /* Don't check for a possible No_Elaboration_Code restriction violation
3503 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3504 every nested real statement instead. This also avoids triggering
3505 spurious errors on dummy (empty) sequences created by the front-end
3506 for package bodies in some cases. */
3508 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3509 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3510 Check_Elaboration_Code_Allowed (gnat_node);
3513 switch (Nkind (gnat_node))
3515 /********************************/
3516 /* Chapter 2: Lexical Elements */
3517 /********************************/
3520 case N_Expanded_Name:
3521 case N_Operator_Symbol:
3522 case N_Defining_Identifier:
3523 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3526 case N_Integer_Literal:
3530 /* Get the type of the result, looking inside any padding and
3531 justified modular types. Then get the value in that type. */
3532 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3534 if (TREE_CODE (gnu_type) == RECORD_TYPE
3535 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3536 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3538 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3540 /* If the result overflows (meaning it doesn't fit in its base type),
3541 abort. We would like to check that the value is within the range
3542 of the subtype, but that causes problems with subtypes whose usage
3543 will raise Constraint_Error and with biased representation, so
3545 gcc_assert (!TREE_OVERFLOW (gnu_result));
3549 case N_Character_Literal:
3550 /* If a Entity is present, it means that this was one of the
3551 literals in a user-defined character type. In that case,
3552 just return the value in the CONST_DECL. Otherwise, use the
3553 character code. In that case, the base type should be an
3554 INTEGER_TYPE, but we won't bother checking for that. */
3555 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3556 if (Present (Entity (gnat_node)))
3557 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3560 = build_int_cst_type
3561 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3564 case N_Real_Literal:
3565 /* If this is of a fixed-point type, the value we want is the
3566 value of the corresponding integer. */
3567 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3569 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3570 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3572 gcc_assert (!TREE_OVERFLOW (gnu_result));
3575 /* We should never see a Vax_Float type literal, since the front end
3576 is supposed to transform these using appropriate conversions. */
3577 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3582 Ureal ur_realval = Realval (gnat_node);
3584 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3586 /* If the real value is zero, so is the result. Otherwise,
3587 convert it to a machine number if it isn't already. That
3588 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3589 if (UR_Is_Zero (ur_realval))
3590 gnu_result = convert (gnu_result_type, integer_zero_node);
3593 if (!Is_Machine_Number (gnat_node))
3595 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3596 ur_realval, Round_Even, gnat_node);
3599 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3601 /* If we have a base of zero, divide by the denominator.
3602 Otherwise, the base must be 2 and we scale the value, which
3603 we know can fit in the mantissa of the type (hence the use
3604 of that type above). */
3605 if (No (Rbase (ur_realval)))
3607 = build_binary_op (RDIV_EXPR,
3608 get_base_type (gnu_result_type),
3610 UI_To_gnu (Denominator (ur_realval),
3614 REAL_VALUE_TYPE tmp;
3616 gcc_assert (Rbase (ur_realval) == 2);
3617 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3618 - UI_To_Int (Denominator (ur_realval)));
3619 gnu_result = build_real (gnu_result_type, tmp);
3623 /* Now see if we need to negate the result. Do it this way to
3624 properly handle -0. */
3625 if (UR_Is_Negative (Realval (gnat_node)))
3627 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3633 case N_String_Literal:
3634 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3635 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3637 String_Id gnat_string = Strval (gnat_node);
3638 int length = String_Length (gnat_string);
3641 if (length >= ALLOCA_THRESHOLD)
3642 string = XNEWVEC (char, length + 1);
3644 string = (char *) alloca (length + 1);
3646 /* Build the string with the characters in the literal. Note
3647 that Ada strings are 1-origin. */
3648 for (i = 0; i < length; i++)
3649 string[i] = Get_String_Char (gnat_string, i + 1);
3651 /* Put a null at the end of the string in case it's in a context
3652 where GCC will want to treat it as a C string. */
3655 gnu_result = build_string (length, string);
3657 /* Strings in GCC don't normally have types, but we want
3658 this to not be converted to the array type. */
3659 TREE_TYPE (gnu_result) = gnu_result_type;
3661 if (length >= ALLOCA_THRESHOLD)
3666 /* Build a list consisting of each character, then make
3668 String_Id gnat_string = Strval (gnat_node);
3669 int length = String_Length (gnat_string);
3671 tree gnu_list = NULL_TREE;
3672 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3674 for (i = 0; i < length; i++)
3677 = tree_cons (gnu_idx,
3678 build_int_cst (TREE_TYPE (gnu_result_type),
3679 Get_String_Char (gnat_string,
3683 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3688 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3693 gnu_result = Pragma_to_gnu (gnat_node);
3696 /**************************************/
3697 /* Chapter 3: Declarations and Types */
3698 /**************************************/
3700 case N_Subtype_Declaration:
3701 case N_Full_Type_Declaration:
3702 case N_Incomplete_Type_Declaration:
3703 case N_Private_Type_Declaration:
3704 case N_Private_Extension_Declaration:
3705 case N_Task_Type_Declaration:
3706 process_type (Defining_Entity (gnat_node));
3707 gnu_result = alloc_stmt_list ();
3710 case N_Object_Declaration:
3711 case N_Exception_Declaration:
3712 gnat_temp = Defining_Entity (gnat_node);
3713 gnu_result = alloc_stmt_list ();
3715 /* If we are just annotating types and this object has an unconstrained
3716 or task type, don't elaborate it. */
3717 if (type_annotate_only
3718 && (((Is_Array_Type (Etype (gnat_temp))
3719 || Is_Record_Type (Etype (gnat_temp)))
3720 && !Is_Constrained (Etype (gnat_temp)))
3721 || Is_Concurrent_Type (Etype (gnat_temp))))
3724 if (Present (Expression (gnat_node))
3725 && !(Nkind (gnat_node) == N_Object_Declaration
3726 && No_Initialization (gnat_node))
3727 && (!type_annotate_only
3728 || Compile_Time_Known_Value (Expression (gnat_node))))
3730 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3731 if (Do_Range_Check (Expression (gnat_node)))
3733 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3735 /* If this object has its elaboration delayed, we must force
3736 evaluation of GNU_EXPR right now and save it for when the object
3738 if (Present (Freeze_Node (gnat_temp)))
3740 if ((Is_Public (gnat_temp) || global_bindings_p ())
3741 && !TREE_CONSTANT (gnu_expr))
3743 = create_var_decl (create_concat_name (gnat_temp, "init"),
3744 NULL_TREE, TREE_TYPE (gnu_expr),
3745 gnu_expr, false, Is_Public (gnat_temp),
3746 false, false, NULL, gnat_temp);
3748 gnu_expr = maybe_variable (gnu_expr);
3750 save_gnu_tree (gnat_node, gnu_expr, true);
3754 gnu_expr = NULL_TREE;
3756 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3757 gnu_expr = NULL_TREE;
3759 /* If this is a deferred constant with an address clause, we ignore the
3760 full view since the clause is on the partial view and we cannot have
3761 2 different GCC trees for the object. The only bits of the full view
3762 we will use is the initializer, but it will be directly fetched. */
3763 if (Ekind(gnat_temp) == E_Constant
3764 && Present (Address_Clause (gnat_temp))
3765 && Present (Full_View (gnat_temp)))
3766 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3768 if (No (Freeze_Node (gnat_temp)))
3769 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3772 case N_Object_Renaming_Declaration:
3773 gnat_temp = Defining_Entity (gnat_node);
3775 /* Don't do anything if this renaming is handled by the front end or if
3776 we are just annotating types and this object has a composite or task
3777 type, don't elaborate it. We return the result in case it has any
3778 SAVE_EXPRs in it that need to be evaluated here. */
3779 if (!Is_Renaming_Of_Object (gnat_temp)
3780 && ! (type_annotate_only
3781 && (Is_Array_Type (Etype (gnat_temp))
3782 || Is_Record_Type (Etype (gnat_temp))
3783 || Is_Concurrent_Type (Etype (gnat_temp)))))
3785 = gnat_to_gnu_entity (gnat_temp,
3786 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3788 gnu_result = alloc_stmt_list ();
3791 case N_Implicit_Label_Declaration:
3792 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3793 gnu_result = alloc_stmt_list ();
3796 case N_Exception_Renaming_Declaration:
3797 case N_Number_Declaration:
3798 case N_Package_Renaming_Declaration:
3799 case N_Subprogram_Renaming_Declaration:
3800 /* These are fully handled in the front end. */
3801 gnu_result = alloc_stmt_list ();
3804 /*************************************/
3805 /* Chapter 4: Names and Expressions */
3806 /*************************************/
3808 case N_Explicit_Dereference:
3809 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3810 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3811 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3814 case N_Indexed_Component:
3816 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3820 Node_Id *gnat_expr_array;
3822 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3823 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3825 /* If we got a padded type, remove it too. */
3826 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3827 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3829 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3832 gnu_result = gnu_array_object;
3834 /* First compute the number of dimensions of the array, then
3835 fill the expression array, the order depending on whether
3836 this is a Convention_Fortran array or not. */
3837 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3838 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3839 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3840 ndim++, gnu_type = TREE_TYPE (gnu_type))
3843 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3845 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3846 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3848 i--, gnat_temp = Next (gnat_temp))
3849 gnat_expr_array[i] = gnat_temp;
3851 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3853 i++, gnat_temp = Next (gnat_temp))
3854 gnat_expr_array[i] = gnat_temp;
3856 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3857 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3859 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3860 gnat_temp = gnat_expr_array[i];
3861 gnu_expr = gnat_to_gnu (gnat_temp);
3863 if (Do_Range_Check (gnat_temp))
3866 (gnu_array_object, gnu_expr,
3867 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3868 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3871 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3872 gnu_result, gnu_expr);
3876 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3882 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3884 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3885 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3887 /* Do any implicit dereferences of the prefix and do any needed
3889 gnu_result = maybe_implicit_deref (gnu_result);
3890 gnu_result = maybe_unconstrained_array (gnu_result);
3891 gnu_type = TREE_TYPE (gnu_result);
3892 if (Do_Range_Check (gnat_range_node))
3894 /* Get the bounds of the slice. */
3896 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3897 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3898 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3899 /* Get the permitted bounds. */
3900 tree gnu_base_index_type
3901 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3902 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3903 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3904 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3905 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3906 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3908 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3909 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3911 /* Derive a good type to convert everything to. */
3912 gnu_expr_type = get_base_type (gnu_index_type);
3914 /* Test whether the minimum slice value is too small. */
3915 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3916 convert (gnu_expr_type,
3918 convert (gnu_expr_type,
3919 gnu_base_min_expr));
3921 /* Test whether the maximum slice value is too large. */
3922 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3923 convert (gnu_expr_type,
3925 convert (gnu_expr_type,
3926 gnu_base_max_expr));
3928 /* Build a slice index check that returns the low bound,
3929 assuming the slice is not empty. */
3930 gnu_expr = emit_check
3931 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3932 gnu_expr_l, gnu_expr_h),
3933 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3935 /* Build a conditional expression that does the index checks and
3936 returns the low bound if the slice is not empty (max >= min),
3937 and returns the naked low bound otherwise (max < min), unless
3938 it is non-constant and the high bound is; this prevents VRP
3939 from inferring bogus ranges on the unlikely path. */
3940 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3941 build_binary_op (GE_EXPR, gnu_expr_type,
3942 convert (gnu_expr_type,
3944 convert (gnu_expr_type,
3947 TREE_CODE (gnu_min_expr) != INTEGER_CST
3948 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3949 ? gnu_max_expr : gnu_min_expr);
3952 /* Simply return the naked low bound. */
3953 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3955 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3956 gnu_result, gnu_expr);
3960 case N_Selected_Component:
3962 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3963 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3964 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3967 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3968 || IN (Ekind (gnat_pref_type), Access_Kind))
3970 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3971 gnat_pref_type = Underlying_Type (gnat_pref_type);
3972 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3973 gnat_pref_type = Designated_Type (gnat_pref_type);
3976 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3978 /* For discriminant references in tagged types always substitute the
3979 corresponding discriminant as the actual selected component. */
3980 if (Is_Tagged_Type (gnat_pref_type))
3981 while (Present (Corresponding_Discriminant (gnat_field)))
3982 gnat_field = Corresponding_Discriminant (gnat_field);
3984 /* For discriminant references of untagged types always substitute the
3985 corresponding stored discriminant. */
3986 else if (Present (Corresponding_Discriminant (gnat_field)))
3987 gnat_field = Original_Record_Component (gnat_field);
3989 /* Handle extracting the real or imaginary part of a complex.
3990 The real part is the first field and the imaginary the last. */
3991 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3992 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3993 ? REALPART_EXPR : IMAGPART_EXPR,
3994 NULL_TREE, gnu_prefix);
3997 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3999 /* If there are discriminants, the prefix might be evaluated more
4000 than once, which is a problem if it has side-effects. */
4001 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
4002 ? Designated_Type (Etype
4003 (Prefix (gnat_node)))
4004 : Etype (Prefix (gnat_node))))
4005 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
4008 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
4009 (Nkind (Parent (gnat_node))
4010 == N_Attribute_Reference));
4013 gcc_assert (gnu_result);
4014 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4018 case N_Attribute_Reference:
4020 /* The attribute designator (like an enumeration value). */
4021 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
4023 /* The Elab_Spec and Elab_Body attributes are special in that
4024 Prefix is a unit, not an object with a GCC equivalent. Similarly
4025 for Elaborated, since that variable isn't otherwise known. */
4026 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
4027 return (create_subprog_decl
4028 (create_concat_name (Entity (Prefix (gnat_node)),
4029 attribute == Attr_Elab_Body
4030 ? "elabb" : "elabs"),
4031 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
4034 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4039 /* Like 'Access as far as we are concerned. */
4040 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4041 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4042 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4046 case N_Extension_Aggregate:
4050 /* ??? It is wrong to evaluate the type now, but there doesn't
4051 seem to be any other practical way of doing it. */
4053 gcc_assert (!Expansion_Delayed (gnat_node));
4055 gnu_aggr_type = gnu_result_type
4056 = get_unpadded_type (Etype (gnat_node));
4058 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4059 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4061 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4063 if (Null_Record_Present (gnat_node))
4064 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4066 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4067 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4069 = assoc_to_constructor (Etype (gnat_node),
4070 First (Component_Associations (gnat_node)),
4072 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4073 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4075 Component_Type (Etype (gnat_node)));
4076 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4079 (COMPLEX_EXPR, gnu_aggr_type,
4080 gnat_to_gnu (Expression (First
4081 (Component_Associations (gnat_node)))),
4082 gnat_to_gnu (Expression
4084 (First (Component_Associations (gnat_node))))));
4088 gnu_result = convert (gnu_result_type, gnu_result);
4093 if (TARGET_VTABLE_USES_DESCRIPTORS
4094 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4095 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4096 gnu_result = null_fdesc_node;
4098 gnu_result = null_pointer_node;
4099 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4102 case N_Type_Conversion:
4103 case N_Qualified_Expression:
4104 /* Get the operand expression. */
4105 gnu_result = gnat_to_gnu (Expression (gnat_node));
4106 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4109 = convert_with_check (Etype (gnat_node), gnu_result,
4110 Do_Overflow_Check (gnat_node),
4111 Do_Range_Check (Expression (gnat_node)),
4112 Nkind (gnat_node) == N_Type_Conversion
4113 && Float_Truncate (gnat_node), gnat_node);
4116 case N_Unchecked_Type_Conversion:
4117 gnu_result = gnat_to_gnu (Expression (gnat_node));
4119 /* Skip further processing if the conversion is deemed a no-op. */
4120 if (unchecked_conversion_lhs_nop (gnat_node))
4122 gnu_result_type = TREE_TYPE (gnu_result);
4126 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4128 /* If the result is a pointer type, see if we are improperly
4129 converting to a stricter alignment. */
4130 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4131 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4133 unsigned int align = known_alignment (gnu_result);
4134 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4135 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4137 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4138 post_error_ne_tree_2
4139 ("?source alignment (^) '< alignment of & (^)",
4140 gnat_node, Designated_Type (Etype (gnat_node)),
4141 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4144 /* If we are converting a descriptor to a function pointer, first
4145 build the pointer. */
4146 if (TARGET_VTABLE_USES_DESCRIPTORS
4147 && TREE_TYPE (gnu_result) == fdesc_type_node
4148 && POINTER_TYPE_P (gnu_result_type))
4149 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4151 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4152 No_Truncation (gnat_node));
4158 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4159 Node_Id gnat_range = Right_Opnd (gnat_node);
4163 /* GNAT_RANGE is either an N_Range node or an identifier
4164 denoting a subtype. */
4165 if (Nkind (gnat_range) == N_Range)
4167 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4168 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4170 else if (Nkind (gnat_range) == N_Identifier
4171 || Nkind (gnat_range) == N_Expanded_Name)
4173 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4175 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4176 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4181 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4183 /* If LOW and HIGH are identical, perform an equality test.
4184 Otherwise, ensure that GNU_OBJECT is only evaluated once
4185 and perform a full range test. */
4186 if (operand_equal_p (gnu_low, gnu_high, 0))
4187 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4188 gnu_object, gnu_low);
4191 gnu_object = protect_multiple_eval (gnu_object);
4193 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4194 build_binary_op (GE_EXPR, gnu_result_type,
4195 gnu_object, gnu_low),
4196 build_binary_op (LE_EXPR, gnu_result_type,
4197 gnu_object, gnu_high));
4200 if (Nkind (gnat_node) == N_Not_In)
4201 gnu_result = invert_truthvalue (gnu_result);
4206 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4207 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4208 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4209 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4211 : (Rounded_Result (gnat_node)
4212 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4213 gnu_result_type, gnu_lhs, gnu_rhs);
4216 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4217 /* These can either be operations on booleans or on modular types.
4218 Fall through for boolean types since that's the way GNU_CODES is
4220 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4221 Modular_Integer_Kind))
4224 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4225 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4228 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4229 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4230 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4231 gnu_result = build_binary_op (code, gnu_result_type,
4236 /* ... fall through ... */
4238 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4239 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4240 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4241 case N_Op_Mod: case N_Op_Rem:
4242 case N_Op_Rotate_Left:
4243 case N_Op_Rotate_Right:
4244 case N_Op_Shift_Left:
4245 case N_Op_Shift_Right:
4246 case N_Op_Shift_Right_Arithmetic:
4247 case N_And_Then: case N_Or_Else:
4249 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4250 bool ignore_lhs_overflow = false;
4253 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4254 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4255 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4257 /* If this is a comparison operator, convert any references to
4258 an unconstrained array value into a reference to the
4260 if (TREE_CODE_CLASS (code) == tcc_comparison)
4262 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4263 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4266 /* If the result type is a private type, its full view may be a
4267 numeric subtype. The representation we need is that of its base
4268 type, given that it is the result of an arithmetic operation. */
4269 else if (Is_Private_Type (Etype (gnat_node)))
4270 gnu_type = gnu_result_type
4271 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4273 /* If this is a shift whose count is not guaranteed to be correct,
4274 we need to adjust the shift count. */
4275 if (IN (Nkind (gnat_node), N_Op_Shift)
4276 && !Shift_Count_OK (gnat_node))
4278 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4280 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4282 if (Nkind (gnat_node) == N_Op_Rotate_Left
4283 || Nkind (gnat_node) == N_Op_Rotate_Right)
4284 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4285 gnu_rhs, gnu_max_shift);
4286 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4289 (MIN_EXPR, gnu_count_type,
4290 build_binary_op (MINUS_EXPR,
4293 convert (gnu_count_type,
4298 /* For right shifts, the type says what kind of shift to do,
4299 so we may need to choose a different type. In this case,
4300 we have to ignore integer overflow lest it propagates all
4301 the way down and causes a CE to be explicitly raised. */
4302 if (Nkind (gnat_node) == N_Op_Shift_Right
4303 && !TYPE_UNSIGNED (gnu_type))
4305 gnu_type = gnat_unsigned_type (gnu_type);
4306 ignore_lhs_overflow = true;
4308 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4309 && TYPE_UNSIGNED (gnu_type))
4311 gnu_type = gnat_signed_type (gnu_type);
4312 ignore_lhs_overflow = true;
4315 if (gnu_type != gnu_result_type)
4317 tree gnu_old_lhs = gnu_lhs;
4318 gnu_lhs = convert (gnu_type, gnu_lhs);
4319 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4320 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4321 gnu_rhs = convert (gnu_type, gnu_rhs);
4324 /* Instead of expanding overflow checks for addition, subtraction
4325 and multiplication itself, the front end will leave this to
4326 the back end when Backend_Overflow_Checks_On_Target is set.
4327 As the GCC back end itself does not know yet how to properly
4328 do overflow checking, do it here. The goal is to push
4329 the expansions further into the back end over time. */
4330 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4331 && (Nkind (gnat_node) == N_Op_Add
4332 || Nkind (gnat_node) == N_Op_Subtract
4333 || Nkind (gnat_node) == N_Op_Multiply)
4334 && !TYPE_UNSIGNED (gnu_type)
4335 && !FLOAT_TYPE_P (gnu_type))
4336 gnu_result = build_binary_op_trapv (code, gnu_type,
4337 gnu_lhs, gnu_rhs, gnat_node);
4339 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4341 /* If this is a logical shift with the shift count not verified,
4342 we must return zero if it is too large. We cannot compensate
4343 above in this case. */
4344 if ((Nkind (gnat_node) == N_Op_Shift_Left
4345 || Nkind (gnat_node) == N_Op_Shift_Right)
4346 && !Shift_Count_OK (gnat_node))
4350 build_binary_op (GE_EXPR, integer_type_node,
4352 convert (TREE_TYPE (gnu_rhs),
4353 TYPE_SIZE (gnu_type))),
4354 convert (gnu_type, integer_zero_node),
4359 case N_Conditional_Expression:
4361 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4362 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4364 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4366 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4367 gnu_result = build_cond_expr (gnu_result_type,
4368 gnat_truthvalue_conversion (gnu_cond),
4369 gnu_true, gnu_false);
4374 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4375 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4379 /* This case can apply to a boolean or a modular type.
4380 Fall through for a boolean operand since GNU_CODES is set
4381 up to handle this. */
4382 if (Is_Modular_Integer_Type (Etype (gnat_node))
4383 || (Ekind (Etype (gnat_node)) == E_Private_Type
4384 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4386 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4387 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4388 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4393 /* ... fall through ... */
4395 case N_Op_Minus: case N_Op_Abs:
4396 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4398 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4399 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4401 gnu_result_type = get_unpadded_type (Base_Type
4402 (Full_View (Etype (gnat_node))));
4404 if (Do_Overflow_Check (gnat_node)
4405 && !TYPE_UNSIGNED (gnu_result_type)
4406 && !FLOAT_TYPE_P (gnu_result_type))
4408 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4409 gnu_result_type, gnu_expr, gnat_node);
4411 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4412 gnu_result_type, gnu_expr);
4419 bool ignore_init_type = false;
4421 gnat_temp = Expression (gnat_node);
4423 /* The Expression operand can either be an N_Identifier or
4424 Expanded_Name, which must represent a type, or a
4425 N_Qualified_Expression, which contains both the object type and an
4426 initial value for the object. */
4427 if (Nkind (gnat_temp) == N_Identifier
4428 || Nkind (gnat_temp) == N_Expanded_Name)
4429 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4430 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4432 Entity_Id gnat_desig_type
4433 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4435 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4436 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4438 gnu_init = maybe_unconstrained_array (gnu_init);
4439 if (Do_Range_Check (Expression (gnat_temp)))
4441 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4443 if (Is_Elementary_Type (gnat_desig_type)
4444 || Is_Constrained (gnat_desig_type))
4446 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4447 gnu_init = convert (gnu_type, gnu_init);
4451 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4452 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4453 gnu_type = TREE_TYPE (gnu_init);
4455 gnu_init = convert (gnu_type, gnu_init);
4461 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4462 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4463 Procedure_To_Call (gnat_node),
4464 Storage_Pool (gnat_node), gnat_node,
4469 /**************************/
4470 /* Chapter 5: Statements */
4471 /**************************/
4474 gnu_result = build1 (LABEL_EXPR, void_type_node,
4475 gnat_to_gnu (Identifier (gnat_node)));
4478 case N_Null_Statement:
4479 gnu_result = alloc_stmt_list ();
4482 case N_Assignment_Statement:
4483 /* Get the LHS and RHS of the statement and convert any reference to an
4484 unconstrained array into a reference to the underlying array.
4485 If we are not to do range checking and the RHS is an N_Function_Call,
4486 pass the LHS to the call function. */
4487 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4489 /* If the type has a size that overflows, convert this into raise of
4490 Storage_Error: execution shouldn't have gotten here anyway. */
4491 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4492 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4493 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4494 N_Raise_Storage_Error);
4495 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4496 && !Do_Range_Check (Expression (gnat_node)))
4497 gnu_result = call_to_gnu (Expression (gnat_node),
4498 &gnu_result_type, gnu_lhs);
4502 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4504 /* If range check is needed, emit code to generate it. */
4505 if (Do_Range_Check (Expression (gnat_node)))
4506 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4510 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4512 /* If the type being assigned is an array type and the two sides
4513 are not completely disjoint, play safe and use memmove. */
4514 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4515 && Is_Array_Type (Etype (Name (gnat_node)))
4516 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4518 tree to, from, size, to_ptr, from_ptr, t;
4520 to = TREE_OPERAND (gnu_result, 0);
4521 from = TREE_OPERAND (gnu_result, 1);
4523 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4524 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4526 to_ptr = build_fold_addr_expr (to);
4527 from_ptr = build_fold_addr_expr (from);
4529 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4530 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4535 case N_If_Statement:
4537 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4539 /* Make the outer COND_EXPR. Avoid non-determinism. */
4540 gnu_result = build3 (COND_EXPR, void_type_node,
4541 gnat_to_gnu (Condition (gnat_node)),
4542 NULL_TREE, NULL_TREE);
4543 COND_EXPR_THEN (gnu_result)
4544 = build_stmt_group (Then_Statements (gnat_node), false);
4545 TREE_SIDE_EFFECTS (gnu_result) = 1;
4546 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4548 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4549 into the previous "else" part and point to where to put any
4550 outer "else". Also avoid non-determinism. */
4551 if (Present (Elsif_Parts (gnat_node)))
4552 for (gnat_temp = First (Elsif_Parts (gnat_node));
4553 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4555 gnu_expr = build3 (COND_EXPR, void_type_node,
4556 gnat_to_gnu (Condition (gnat_temp)),
4557 NULL_TREE, NULL_TREE);
4558 COND_EXPR_THEN (gnu_expr)
4559 = build_stmt_group (Then_Statements (gnat_temp), false);
4560 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4561 set_expr_location_from_node (gnu_expr, gnat_temp);
4562 *gnu_else_ptr = gnu_expr;
4563 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4566 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4570 case N_Case_Statement:
4571 gnu_result = Case_Statement_to_gnu (gnat_node);
4574 case N_Loop_Statement:
4575 gnu_result = Loop_Statement_to_gnu (gnat_node);
4578 case N_Block_Statement:
4579 start_stmt_group ();
4581 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4582 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4584 gnu_result = end_stmt_group ();
4586 if (Present (Identifier (gnat_node)))
4587 mark_out_of_scope (Entity (Identifier (gnat_node)));
4590 case N_Exit_Statement:
4592 = build2 (EXIT_STMT, void_type_node,
4593 (Present (Condition (gnat_node))
4594 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4595 (Present (Name (gnat_node))
4596 ? get_gnu_tree (Entity (Name (gnat_node)))
4597 : TREE_VALUE (gnu_loop_label_stack)));
4600 case N_Return_Statement:
4602 /* The gnu function type of the subprogram currently processed. */
4603 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4604 /* The return value from the subprogram. */
4605 tree gnu_ret_val = NULL_TREE;
4606 /* The place to put the return value. */
4609 /* If we are dealing with a "return;" from an Ada procedure with
4610 parameters passed by copy in copy out, we need to return a record
4611 containing the final values of these parameters. If the list
4612 contains only one entry, return just that entry.
4614 For a full description of the copy in copy out parameter mechanism,
4615 see the part of the gnat_to_gnu_entity routine dealing with the
4616 translation of subprograms.
4618 But if we have a return label defined, convert this into
4619 a branch to that label. */
4621 if (TREE_VALUE (gnu_return_label_stack))
4623 gnu_result = build1 (GOTO_EXPR, void_type_node,
4624 TREE_VALUE (gnu_return_label_stack));
4628 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4630 gnu_lhs = DECL_RESULT (current_function_decl);
4631 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4632 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4635 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4636 TYPE_CI_CO_LIST (gnu_subprog_type));
4639 /* If the Ada subprogram is a function, we just need to return the
4640 expression. If the subprogram returns an unconstrained
4641 array, we have to allocate a new version of the result and
4642 return it. If we return by reference, return a pointer. */
4644 else if (Present (Expression (gnat_node)))
4646 /* If the current function returns by target pointer and we
4647 are doing a call, pass that target to the call. */
4648 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4649 && Nkind (Expression (gnat_node)) == N_Function_Call)
4652 = build_unary_op (INDIRECT_REF, NULL_TREE,
4653 DECL_ARGUMENTS (current_function_decl));
4654 gnu_result = call_to_gnu (Expression (gnat_node),
4655 &gnu_result_type, gnu_lhs);
4659 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4661 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4662 /* The original return type was unconstrained so dereference
4663 the TARGET pointer in the actual return value's type. */
4665 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4666 DECL_ARGUMENTS (current_function_decl));
4668 gnu_lhs = DECL_RESULT (current_function_decl);
4670 /* Do not remove the padding from GNU_RET_VAL if the inner
4671 type is self-referential since we want to allocate the fixed
4672 size in that case. */
4673 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4674 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4676 && (TYPE_IS_PADDING_P
4677 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4678 && (CONTAINS_PLACEHOLDER_P
4679 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4680 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4682 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4683 || By_Ref (gnat_node))
4685 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4687 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4689 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4691 = build_allocator (TREE_TYPE (gnu_ret_val),
4693 TREE_TYPE (gnu_subprog_type),
4694 Procedure_To_Call (gnat_node),
4695 Storage_Pool (gnat_node),
4701 /* If the Ada subprogram is a regular procedure, just return. */
4702 gnu_lhs = NULL_TREE;
4704 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4707 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4708 gnu_lhs, gnu_ret_val);
4709 add_stmt_with_node (gnu_result, gnat_node);
4710 gnu_lhs = NULL_TREE;
4713 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4717 case N_Goto_Statement:
4718 gnu_result = build1 (GOTO_EXPR, void_type_node,
4719 gnat_to_gnu (Name (gnat_node)));
4722 /***************************/
4723 /* Chapter 6: Subprograms */
4724 /***************************/
4726 case N_Subprogram_Declaration:
4727 /* Unless there is a freeze node, declare the subprogram. We consider
4728 this a "definition" even though we're not generating code for
4729 the subprogram because we will be making the corresponding GCC
4732 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4733 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4735 gnu_result = alloc_stmt_list ();
4738 case N_Abstract_Subprogram_Declaration:
4739 /* This subprogram doesn't exist for code generation purposes, but we
4740 have to elaborate the types of any parameters and result, unless
4741 they are imported types (nothing to generate in this case). */
4743 /* Process the parameter types first. */
4746 = First_Formal_With_Extras
4747 (Defining_Entity (Specification (gnat_node)));
4748 Present (gnat_temp);
4749 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4750 if (Is_Itype (Etype (gnat_temp))
4751 && !From_With_Type (Etype (gnat_temp)))
4752 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4755 /* Then the result type, set to Standard_Void_Type for procedures. */
4758 Entity_Id gnat_temp_type
4759 = Etype (Defining_Entity (Specification (gnat_node)));
4761 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4762 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4765 gnu_result = alloc_stmt_list ();
4768 case N_Defining_Program_Unit_Name:
4769 /* For a child unit identifier go up a level to get the specification.
4770 We get this when we try to find the spec of a child unit package
4771 that is the compilation unit being compiled. */
4772 gnu_result = gnat_to_gnu (Parent (gnat_node));
4775 case N_Subprogram_Body:
4776 Subprogram_Body_to_gnu (gnat_node);
4777 gnu_result = alloc_stmt_list ();
4780 case N_Function_Call:
4781 case N_Procedure_Call_Statement:
4782 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4785 /************************/
4786 /* Chapter 7: Packages */
4787 /************************/
4789 case N_Package_Declaration:
4790 gnu_result = gnat_to_gnu (Specification (gnat_node));
4793 case N_Package_Specification:
4795 start_stmt_group ();
4796 process_decls (Visible_Declarations (gnat_node),
4797 Private_Declarations (gnat_node), Empty, true, true);
4798 gnu_result = end_stmt_group ();
4801 case N_Package_Body:
4803 /* If this is the body of a generic package - do nothing. */
4804 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4806 gnu_result = alloc_stmt_list ();
4810 start_stmt_group ();
4811 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4813 if (Present (Handled_Statement_Sequence (gnat_node)))
4814 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4816 gnu_result = end_stmt_group ();
4819 /********************************/
4820 /* Chapter 8: Visibility Rules */
4821 /********************************/
4823 case N_Use_Package_Clause:
4824 case N_Use_Type_Clause:
4825 /* Nothing to do here - but these may appear in list of declarations. */
4826 gnu_result = alloc_stmt_list ();
4829 /*********************/
4830 /* Chapter 9: Tasks */
4831 /*********************/
4833 case N_Protected_Type_Declaration:
4834 gnu_result = alloc_stmt_list ();
4837 case N_Single_Task_Declaration:
4838 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4839 gnu_result = alloc_stmt_list ();
4842 /*********************************************************/
4843 /* Chapter 10: Program Structure and Compilation Issues */
4844 /*********************************************************/
4846 case N_Compilation_Unit:
4848 /* This is not called for the main unit, which is handled in function
4850 start_stmt_group ();
4853 Compilation_Unit_to_gnu (gnat_node);
4854 gnu_result = alloc_stmt_list ();
4857 case N_Subprogram_Body_Stub:
4858 case N_Package_Body_Stub:
4859 case N_Protected_Body_Stub:
4860 case N_Task_Body_Stub:
4861 /* Simply process whatever unit is being inserted. */
4862 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4866 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4869 /***************************/
4870 /* Chapter 11: Exceptions */
4871 /***************************/
4873 case N_Handled_Sequence_Of_Statements:
4874 /* If there is an At_End procedure attached to this node, and the EH
4875 mechanism is SJLJ, we must have at least a corresponding At_End
4876 handler, unless the No_Exception_Handlers restriction is set. */
4877 gcc_assert (type_annotate_only
4878 || Exception_Mechanism != Setjmp_Longjmp
4879 || No (At_End_Proc (gnat_node))
4880 || Present (Exception_Handlers (gnat_node))
4881 || No_Exception_Handlers_Set ());
4883 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4886 case N_Exception_Handler:
4887 if (Exception_Mechanism == Setjmp_Longjmp)
4888 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4889 else if (Exception_Mechanism == Back_End_Exceptions)
4890 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4896 case N_Push_Constraint_Error_Label:
4897 push_exception_label_stack (&gnu_constraint_error_label_stack,
4898 Exception_Label (gnat_node));
4901 case N_Push_Storage_Error_Label:
4902 push_exception_label_stack (&gnu_storage_error_label_stack,
4903 Exception_Label (gnat_node));
4906 case N_Push_Program_Error_Label:
4907 push_exception_label_stack (&gnu_program_error_label_stack,
4908 Exception_Label (gnat_node));
4911 case N_Pop_Constraint_Error_Label:
4912 gnu_constraint_error_label_stack
4913 = TREE_CHAIN (gnu_constraint_error_label_stack);
4916 case N_Pop_Storage_Error_Label:
4917 gnu_storage_error_label_stack
4918 = TREE_CHAIN (gnu_storage_error_label_stack);
4921 case N_Pop_Program_Error_Label:
4922 gnu_program_error_label_stack
4923 = TREE_CHAIN (gnu_program_error_label_stack);
4926 /******************************/
4927 /* Chapter 12: Generic Units */
4928 /******************************/
4930 case N_Generic_Function_Renaming_Declaration:
4931 case N_Generic_Package_Renaming_Declaration:
4932 case N_Generic_Procedure_Renaming_Declaration:
4933 case N_Generic_Package_Declaration:
4934 case N_Generic_Subprogram_Declaration:
4935 case N_Package_Instantiation:
4936 case N_Procedure_Instantiation:
4937 case N_Function_Instantiation:
4938 /* These nodes can appear on a declaration list but there is nothing to
4939 to be done with them. */
4940 gnu_result = alloc_stmt_list ();
4943 /**************************************************/
4944 /* Chapter 13: Representation Clauses and */
4945 /* Implementation-Dependent Features */
4946 /**************************************************/
4948 case N_Attribute_Definition_Clause:
4949 gnu_result = alloc_stmt_list ();
4951 /* The only one we need to deal with is 'Address since, for the others,
4952 the front-end puts the information elsewhere. */
4953 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4956 /* And we only deal with 'Address if the object has a Freeze node. */
4957 gnat_temp = Entity (Name (gnat_node));
4958 if (No (Freeze_Node (gnat_temp)))
4961 /* Get the value to use as the address and save it as the equivalent
4962 for the object. When it is frozen, gnat_to_gnu_entity will do the
4964 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4967 case N_Enumeration_Representation_Clause:
4968 case N_Record_Representation_Clause:
4970 /* We do nothing with these. SEM puts the information elsewhere. */
4971 gnu_result = alloc_stmt_list ();
4974 case N_Code_Statement:
4975 if (!type_annotate_only)
4977 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4978 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4979 tree gnu_clobbers = NULL_TREE, tail;
4980 bool allows_mem, allows_reg, fake;
4981 int ninputs, noutputs, i;
4982 const char **oconstraints;
4983 const char *constraint;
4986 /* First retrieve the 3 operand lists built by the front-end. */
4987 Setup_Asm_Outputs (gnat_node);
4988 while (Present (gnat_temp = Asm_Output_Variable ()))
4990 tree gnu_value = gnat_to_gnu (gnat_temp);
4991 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4992 (Asm_Output_Constraint ()));
4994 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4998 Setup_Asm_Inputs (gnat_node);
4999 while (Present (gnat_temp = Asm_Input_Value ()))
5001 tree gnu_value = gnat_to_gnu (gnat_temp);
5002 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5003 (Asm_Input_Constraint ()));
5005 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
5009 Clobber_Setup (gnat_node);
5010 while ((clobber = Clobber_Get_Next ()))
5012 = tree_cons (NULL_TREE,
5013 build_string (strlen (clobber) + 1, clobber),
5016 /* Then perform some standard checking and processing on the
5017 operands. In particular, mark them addressable if needed. */
5018 gnu_outputs = nreverse (gnu_outputs);
5019 noutputs = list_length (gnu_outputs);
5020 gnu_inputs = nreverse (gnu_inputs);
5021 ninputs = list_length (gnu_inputs);
5023 = (const char **) alloca (noutputs * sizeof (const char *));
5025 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
5027 tree output = TREE_VALUE (tail);
5029 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5030 oconstraints[i] = constraint;
5032 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
5033 &allows_mem, &allows_reg, &fake))
5035 /* If the operand is going to end up in memory,
5036 mark it addressable. Note that we don't test
5037 allows_mem like in the input case below; this
5038 is modelled on the C front-end. */
5040 && !gnat_mark_addressable (output))
5041 output = error_mark_node;
5044 output = error_mark_node;
5046 TREE_VALUE (tail) = output;
5049 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5051 tree input = TREE_VALUE (tail);
5053 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5055 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5057 &allows_mem, &allows_reg))
5059 /* If the operand is going to end up in memory,
5060 mark it addressable. */
5061 if (!allows_reg && allows_mem
5062 && !gnat_mark_addressable (input))
5063 input = error_mark_node;
5066 input = error_mark_node;
5068 TREE_VALUE (tail) = input;
5071 gnu_result = build4 (ASM_EXPR, void_type_node,
5072 gnu_template, gnu_outputs,
5073 gnu_inputs, gnu_clobbers);
5074 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5077 gnu_result = alloc_stmt_list ();
5085 case N_Freeze_Entity:
5086 start_stmt_group ();
5087 process_freeze_entity (gnat_node);
5088 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5089 gnu_result = end_stmt_group ();
5092 case N_Itype_Reference:
5093 if (!present_gnu_tree (Itype (gnat_node)))
5094 process_type (Itype (gnat_node));
5096 gnu_result = alloc_stmt_list ();
5099 case N_Free_Statement:
5100 if (!type_annotate_only)
5102 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5103 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5105 tree gnu_actual_obj_type = 0;
5108 /* If this is a thin pointer, we must dereference it to create
5109 a fat pointer, then go back below to a thin pointer. The
5110 reason for this is that we need a fat pointer someplace in
5111 order to properly compute the size. */
5112 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5113 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5114 build_unary_op (INDIRECT_REF, NULL_TREE,
5117 /* If this is an unconstrained array, we know the object must
5118 have been allocated with the template in front of the object.
5119 So pass the template address, but get the total size. Do this
5120 by converting to a thin pointer. */
5121 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5123 = convert (build_pointer_type
5124 (TYPE_OBJECT_RECORD_TYPE
5125 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5128 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5130 if (Present (Actual_Designated_Subtype (gnat_node)))
5133 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5135 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5137 = build_unc_object_type_from_ptr (gnu_ptr_type,
5138 gnu_actual_obj_type,
5139 get_identifier ("DEALLOC"));
5142 gnu_actual_obj_type = gnu_obj_type;
5144 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5146 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5147 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5149 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5150 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5151 tree gnu_byte_offset
5152 = convert (sizetype,
5153 size_diffop (size_zero_node, gnu_pos));
5154 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5156 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5157 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5158 gnu_ptr, gnu_byte_offset);
5162 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
5163 Procedure_To_Call (gnat_node),
5164 Storage_Pool (gnat_node),
5169 case N_Raise_Constraint_Error:
5170 case N_Raise_Program_Error:
5171 case N_Raise_Storage_Error:
5172 if (type_annotate_only)
5174 gnu_result = alloc_stmt_list ();
5178 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5180 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5183 /* If the type is VOID, this is a statement, so we need to
5184 generate the code for the call. Handle a Condition, if there
5186 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5188 set_expr_location_from_node (gnu_result, gnat_node);
5190 if (Present (Condition (gnat_node)))
5191 gnu_result = build3 (COND_EXPR, void_type_node,
5192 gnat_to_gnu (Condition (gnat_node)),
5193 gnu_result, alloc_stmt_list ());
5196 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5199 case N_Validate_Unchecked_Conversion:
5201 Entity_Id gnat_target_type = Target_Type (gnat_node);
5202 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5203 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5205 /* No need for any warning in this case. */
5206 if (!flag_strict_aliasing)
5209 /* If the result is a pointer type, see if we are either converting
5210 from a non-pointer or from a pointer to a type with a different
5211 alias set and warn if so. If the result is defined in the same
5212 unit as this unchecked conversion, we can allow this because we
5213 can know to make the pointer type behave properly. */
5214 else if (POINTER_TYPE_P (gnu_target_type)
5215 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5216 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5218 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5219 ? TREE_TYPE (gnu_source_type)
5221 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5223 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5224 || get_alias_set (gnu_target_desig_type) != 0)
5225 && (!POINTER_TYPE_P (gnu_source_type)
5226 || (TYPE_DUMMY_P (gnu_source_desig_type)
5227 != TYPE_DUMMY_P (gnu_target_desig_type))
5228 || (TYPE_DUMMY_P (gnu_source_desig_type)
5229 && gnu_source_desig_type != gnu_target_desig_type)
5230 || !alias_sets_conflict_p
5231 (get_alias_set (gnu_source_desig_type),
5232 get_alias_set (gnu_target_desig_type))))
5235 ("?possible aliasing problem for type&",
5236 gnat_node, Target_Type (gnat_node));
5238 ("\\?use -fno-strict-aliasing switch for references",
5241 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5242 gnat_node, Target_Type (gnat_node));
5246 /* But if the result is a fat pointer type, we have no mechanism to
5247 do that, so we unconditionally warn in problematic cases. */
5248 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5250 tree gnu_source_array_type
5251 = TYPE_FAT_POINTER_P (gnu_source_type)
5252 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5254 tree gnu_target_array_type
5255 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5257 if ((TYPE_DUMMY_P (gnu_target_array_type)
5258 || get_alias_set (gnu_target_array_type) != 0)
5259 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5260 || (TYPE_DUMMY_P (gnu_source_array_type)
5261 != TYPE_DUMMY_P (gnu_target_array_type))
5262 || (TYPE_DUMMY_P (gnu_source_array_type)
5263 && gnu_source_array_type != gnu_target_array_type)
5264 || !alias_sets_conflict_p
5265 (get_alias_set (gnu_source_array_type),
5266 get_alias_set (gnu_target_array_type))))
5269 ("?possible aliasing problem for type&",
5270 gnat_node, Target_Type (gnat_node));
5272 ("\\?use -fno-strict-aliasing switch for references",
5277 gnu_result = alloc_stmt_list ();
5280 case N_Raise_Statement:
5281 case N_Function_Specification:
5282 case N_Procedure_Specification:
5284 case N_Component_Association:
5287 gcc_assert (type_annotate_only);
5288 gnu_result = alloc_stmt_list ();
5291 /* If we pushed our level as part of processing the elaboration routine,
5293 if (went_into_elab_proc)
5295 add_stmt (gnu_result);
5297 gnu_result = end_stmt_group ();
5298 current_function_decl = NULL_TREE;
5301 /* Set the location information on the result if it is a real expression.
5302 References can be reused for multiple GNAT nodes and they would get
5303 the location information of their last use. Note that we may have
5304 no result if we tried to build a CALL_EXPR node to a procedure with
5305 no side-effects and optimization is enabled. */
5307 && EXPR_P (gnu_result)
5308 && TREE_CODE (gnu_result) != NOP_EXPR
5309 && !REFERENCE_CLASS_P (gnu_result)
5310 && !EXPR_HAS_LOCATION (gnu_result))
5311 set_expr_location_from_node (gnu_result, gnat_node);
5313 /* If we're supposed to return something of void_type, it means we have
5314 something we're elaborating for effect, so just return. */
5315 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5318 /* If the result is a constant that overflowed, raise Constraint_Error. */
5319 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5321 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5323 = build1 (NULL_EXPR, gnu_result_type,
5324 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5325 N_Raise_Constraint_Error));
5328 /* If our result has side-effects and is of an unconstrained type,
5329 make a SAVE_EXPR so that we can be sure it will only be referenced
5330 once. Note we must do this before any conversions. */
5331 if (TREE_SIDE_EFFECTS (gnu_result)
5332 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5333 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5334 gnu_result = gnat_stabilize_reference (gnu_result, false);
5336 /* Now convert the result to the result type, unless we are in one of the
5339 1. If this is the Name of an assignment statement or a parameter of
5340 a procedure call, return the result almost unmodified since the
5341 RHS will have to be converted to our type in that case, unless
5342 the result type has a simpler size. Likewise if there is just
5343 a no-op unchecked conversion in-between. Similarly, don't convert
5344 integral types that are the operands of an unchecked conversion
5345 since we need to ignore those conversions (for 'Valid).
5347 2. If we have a label (which doesn't have any well-defined type), a
5348 field or an error, return the result almost unmodified. Also don't
5349 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5350 its size since those are the cases where the front end may have the
5351 type wrong due to "instantiating" the unconstrained record with
5352 discriminant values. Similarly, if the two types are record types
5353 with the same name don't convert. This will be the case when we are
5354 converting from a packable version of a type to its original type and
5355 we need those conversions to be NOPs in order for assignments into
5356 these types to work properly.
5358 3. If the type is void or if we have no result, return error_mark_node
5359 to show we have no result.
5361 4. Finally, if the type of the result is already correct. */
5363 if (Present (Parent (gnat_node))
5364 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5365 && Name (Parent (gnat_node)) == gnat_node)
5366 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5367 && unchecked_conversion_lhs_nop (Parent (gnat_node)))
5368 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5369 && Name (Parent (gnat_node)) != gnat_node)
5370 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5371 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5372 && !AGGREGATE_TYPE_P (gnu_result_type)
5373 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5374 && !(TYPE_SIZE (gnu_result_type)
5375 && TYPE_SIZE (TREE_TYPE (gnu_result))
5376 && (AGGREGATE_TYPE_P (gnu_result_type)
5377 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5378 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5379 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5381 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5382 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5383 && (CONTAINS_PLACEHOLDER_P
5384 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5385 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5386 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5388 /* Remove padding only if the inner object is of self-referential
5389 size: in that case it must be an object of unconstrained type
5390 with a default discriminant and we want to avoid copying too
5392 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5393 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5394 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5395 (TREE_TYPE (gnu_result))))))
5396 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5400 else if (TREE_CODE (gnu_result) == LABEL_DECL
5401 || TREE_CODE (gnu_result) == FIELD_DECL
5402 || TREE_CODE (gnu_result) == ERROR_MARK
5403 || (TYPE_SIZE (gnu_result_type)
5404 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5405 && TREE_CODE (gnu_result) != INDIRECT_REF
5406 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5407 || ((TYPE_NAME (gnu_result_type)
5408 == TYPE_NAME (TREE_TYPE (gnu_result)))
5409 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5410 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5412 /* Remove any padding. */
5413 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5414 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5415 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5419 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5420 gnu_result = error_mark_node;
5422 else if (gnu_result_type != TREE_TYPE (gnu_result))
5423 gnu_result = convert (gnu_result_type, gnu_result);
5425 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5426 while ((TREE_CODE (gnu_result) == NOP_EXPR
5427 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5428 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5429 gnu_result = TREE_OPERAND (gnu_result, 0);
5434 /* Subroutine of above to push the exception label stack. GNU_STACK is
5435 a pointer to the stack to update and GNAT_LABEL, if present, is the
5436 label to push onto the stack. */
5439 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5441 tree gnu_label = (Present (gnat_label)
5442 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5445 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5448 /* Record the current code position in GNAT_NODE. */
5451 record_code_position (Node_Id gnat_node)
5453 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5455 add_stmt_with_node (stmt_stmt, gnat_node);
5456 save_gnu_tree (gnat_node, stmt_stmt, true);
5459 /* Insert the code for GNAT_NODE at the position saved for that node. */
5462 insert_code_for (Node_Id gnat_node)
5464 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5465 save_gnu_tree (gnat_node, NULL_TREE, true);
5468 /* Start a new statement group chained to the previous group. */
5471 start_stmt_group (void)
5473 struct stmt_group *group = stmt_group_free_list;
5475 /* First see if we can get one from the free list. */
5477 stmt_group_free_list = group->previous;
5479 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5481 group->previous = current_stmt_group;
5482 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5483 current_stmt_group = group;
5486 /* Add GNU_STMT to the current statement group. */
5489 add_stmt (tree gnu_stmt)
5491 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5494 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5497 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5499 if (Present (gnat_node))
5500 set_expr_location_from_node (gnu_stmt, gnat_node);
5501 add_stmt (gnu_stmt);
5504 /* Add a declaration statement for GNU_DECL to the current statement group.
5505 Get SLOC from Entity_Id. */
5508 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5510 tree type = TREE_TYPE (gnu_decl);
5511 tree gnu_stmt, gnu_init, t;
5513 /* If this is a variable that Gigi is to ignore, we may have been given
5514 an ERROR_MARK. So test for it. We also might have been given a
5515 reference for a renaming. So only do something for a decl. Also
5516 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5517 if (!DECL_P (gnu_decl)
5518 || (TREE_CODE (gnu_decl) == TYPE_DECL
5519 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5522 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5524 /* If we are global, we don't want to actually output the DECL_EXPR for
5525 this decl since we already have evaluated the expressions in the
5526 sizes and positions as globals and doing it again would be wrong. */
5527 if (global_bindings_p ())
5529 /* Mark everything as used to prevent node sharing with subprograms.
5530 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5531 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5532 mark_visited (&gnu_stmt);
5534 if (TREE_CODE (gnu_decl) == VAR_DECL
5535 || TREE_CODE (gnu_decl) == CONST_DECL)
5537 mark_visited (&DECL_SIZE (gnu_decl));
5538 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5539 mark_visited (&DECL_INITIAL (gnu_decl));
5542 /* In any case, we have to deal with our own fields. */
5543 else if (TREE_CODE (gnu_decl) == TYPE_DECL)
5544 switch (TREE_CODE (type))
5548 case QUAL_UNION_TYPE:
5549 if ((t = TYPE_ADA_SIZE (type)))
5557 if ((t = TYPE_RM_MIN_VALUE (type)))
5559 if ((t = TYPE_RM_MAX_VALUE (type)))
5568 add_stmt_with_node (gnu_stmt, gnat_entity);
5570 /* If this is a variable and an initializer is attached to it, it must be
5571 valid for the context. Similar to init_const in create_var_decl_1. */
5572 if (TREE_CODE (gnu_decl) == VAR_DECL
5573 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5574 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5575 || (TREE_STATIC (gnu_decl)
5576 && !initializer_constant_valid_p (gnu_init,
5577 TREE_TYPE (gnu_init)))))
5579 /* If GNU_DECL has a padded type, convert it to the unpadded
5580 type so the assignment is done properly. */
5581 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5582 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5586 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5588 DECL_INITIAL (gnu_decl) = NULL_TREE;
5589 if (TREE_READONLY (gnu_decl))
5591 TREE_READONLY (gnu_decl) = 0;
5592 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5595 add_stmt_with_node (gnu_stmt, gnat_entity);
5599 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5602 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5604 if (TREE_VISITED (*tp))
5607 /* Don't mark a dummy type as visited because we want to mark its sizes
5608 and fields once it's filled in. */
5609 else if (!TYPE_IS_DUMMY_P (*tp))
5610 TREE_VISITED (*tp) = 1;
5613 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5618 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5621 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5622 void *data ATTRIBUTE_UNUSED)
5626 if (TREE_CODE (t) == SAVE_EXPR)
5627 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5632 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5633 sized gimplified. We use this to indicate all variable sizes and
5634 positions in global types may not be shared by any subprogram. */
5637 mark_visited (tree *tp)
5639 walk_tree (tp, mark_visited_r, NULL, NULL);
5642 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5643 set its location to that of GNAT_NODE if present. */
5646 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5648 if (Present (gnat_node))
5649 set_expr_location_from_node (gnu_cleanup, gnat_node);
5650 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5653 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5656 set_block_for_group (tree gnu_block)
5658 gcc_assert (!current_stmt_group->block);
5659 current_stmt_group->block = gnu_block;
5662 /* Return code corresponding to the current code group. It is normally
5663 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5664 BLOCK or cleanups were set. */
5667 end_stmt_group (void)
5669 struct stmt_group *group = current_stmt_group;
5670 tree gnu_retval = group->stmt_list;
5672 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5673 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5674 make a BIND_EXPR. Note that we nest in that because the cleanup may
5675 reference variables in the block. */
5676 if (gnu_retval == NULL_TREE)
5677 gnu_retval = alloc_stmt_list ();
5679 if (group->cleanups)
5680 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5683 if (current_stmt_group->block)
5684 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5685 gnu_retval, group->block);
5687 /* Remove this group from the stack and add it to the free list. */
5688 current_stmt_group = group->previous;
5689 group->previous = stmt_group_free_list;
5690 stmt_group_free_list = group;
5695 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5699 add_stmt_list (List_Id gnat_list)
5703 if (Present (gnat_list))
5704 for (gnat_node = First (gnat_list); Present (gnat_node);
5705 gnat_node = Next (gnat_node))
5706 add_stmt (gnat_to_gnu (gnat_node));
5709 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5710 If BINDING_P is true, push and pop a binding level around the list. */
5713 build_stmt_group (List_Id gnat_list, bool binding_p)
5715 start_stmt_group ();
5719 add_stmt_list (gnat_list);
5723 return end_stmt_group ();
5726 /* Push and pop routines for stacks. We keep a free list around so we
5727 don't waste tree nodes. */
5730 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5732 tree gnu_node = gnu_stack_free_list;
5736 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5737 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5738 TREE_PURPOSE (gnu_node) = gnu_purpose;
5739 TREE_VALUE (gnu_node) = gnu_value;
5742 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5744 *gnu_stack_ptr = gnu_node;
5748 pop_stack (tree *gnu_stack_ptr)
5750 tree gnu_node = *gnu_stack_ptr;
5752 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5753 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5754 gnu_stack_free_list = gnu_node;
5757 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5760 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5761 gimple_seq *post_p ATTRIBUTE_UNUSED)
5763 tree expr = *expr_p;
5766 if (IS_ADA_STMT (expr))
5767 return gnat_gimplify_stmt (expr_p);
5769 switch (TREE_CODE (expr))
5772 /* If this is for a scalar, just make a VAR_DECL for it. If for
5773 an aggregate, get a null pointer of the appropriate type and
5775 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5776 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5777 convert (build_pointer_type (TREE_TYPE (expr)),
5778 integer_zero_node));
5781 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5782 TREE_NO_WARNING (*expr_p) = 1;
5785 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5788 case UNCONSTRAINED_ARRAY_REF:
5789 /* We should only do this if we are just elaborating for side-effects,
5790 but we can't know that yet. */
5791 *expr_p = TREE_OPERAND (*expr_p, 0);
5795 op = TREE_OPERAND (expr, 0);
5797 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5798 be put into static memory. We know it's going to be readonly given
5799 the semantics we have and it's required to be static memory in
5800 the case when the reference is in an elaboration procedure. */
5801 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5803 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5805 TREE_READONLY (new_var) = 1;
5806 TREE_STATIC (new_var) = 1;
5807 TREE_ADDRESSABLE (new_var) = 1;
5808 DECL_INITIAL (new_var) = op;
5810 TREE_OPERAND (expr, 0) = new_var;
5811 recompute_tree_invariant_for_addr_expr (expr);
5815 /* If we are taking the address of a SAVE_EXPR, we are typically
5816 processing a misaligned argument to be passed by reference in a
5817 procedure call. We just mark the operand as addressable + not
5818 readonly here and let the common gimplifier code perform the
5819 temporary creation, initialization, and "instantiation" in place of
5820 the SAVE_EXPR in further operands, in particular in the copy back
5821 code inserted after the call. */
5822 else if (TREE_CODE (op) == SAVE_EXPR)
5824 TREE_ADDRESSABLE (op) = 1;
5825 TREE_READONLY (op) = 0;
5828 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5829 address of the selected operand when it is addressable. Besides, we
5830 also expect addressable_p to only let COND_EXPRs where both arms are
5831 addressable reach here. */
5832 else if (TREE_CODE (op) == COND_EXPR)
5835 /* Otherwise, if we are taking the address of something that is neither
5836 reference, declaration, or constant, make a variable for the operand
5837 here and then take its address. If we don't do it this way, we may
5838 confuse the gimplifier because it needs to know the variable is
5839 addressable at this point. This duplicates code in
5840 internal_get_tmp_var, which is unfortunate. */
5841 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5842 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5843 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5845 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5848 TREE_ADDRESSABLE (new_var) = 1;
5850 stmt = gimplify_assign (new_var, op, pre_p);
5851 if (EXPR_HAS_LOCATION (op))
5852 gimple_set_location (stmt, *EXPR_LOCUS (op));
5854 TREE_OPERAND (expr, 0) = new_var;
5855 recompute_tree_invariant_for_addr_expr (expr);
5859 /* ... fall through ... */
5862 return GS_UNHANDLED;
5866 /* Generate GIMPLE in place for the statement at *STMT_P. */
5868 static enum gimplify_status
5869 gnat_gimplify_stmt (tree *stmt_p)
5871 tree stmt = *stmt_p;
5873 switch (TREE_CODE (stmt))
5876 *stmt_p = STMT_STMT_STMT (stmt);
5881 tree gnu_start_label = create_artificial_label (input_location);
5882 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5885 /* Set to emit the statements of the loop. */
5886 *stmt_p = NULL_TREE;
5888 /* We first emit the start label and then a conditional jump to
5889 the end label if there's a top condition, then the body of the
5890 loop, then a conditional branch to the end label, then the update,
5891 if any, and finally a jump to the start label and the definition
5892 of the end label. */
5893 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5897 if (LOOP_STMT_TOP_COND (stmt))
5898 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5899 LOOP_STMT_TOP_COND (stmt),
5906 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5908 if (LOOP_STMT_BOT_COND (stmt))
5909 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5910 LOOP_STMT_BOT_COND (stmt),
5917 if (LOOP_STMT_UPDATE (stmt))
5918 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5920 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5921 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5922 append_to_statement_list (t, stmt_p);
5924 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5931 /* Build a statement to jump to the corresponding end label, then
5932 see if it needs to be conditional. */
5933 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5934 if (EXIT_STMT_COND (stmt))
5935 *stmt_p = build3 (COND_EXPR, void_type_node,
5936 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5944 /* Force references to each of the entities in packages withed by GNAT_NODE.
5945 Operate recursively but check that we aren't elaborating something more
5948 This routine is exclusively called in type_annotate mode, to compute DDA
5949 information for types in withed units, for ASIS use. */
5952 elaborate_all_entities (Node_Id gnat_node)
5954 Entity_Id gnat_with_clause, gnat_entity;
5956 /* Process each unit only once. As we trace the context of all relevant
5957 units transitively, including generic bodies, we may encounter the
5958 same generic unit repeatedly. */
5959 if (!present_gnu_tree (gnat_node))
5960 save_gnu_tree (gnat_node, integer_zero_node, true);
5962 /* Save entities in all context units. A body may have an implicit_with
5963 on its own spec, if the context includes a child unit, so don't save
5965 for (gnat_with_clause = First (Context_Items (gnat_node));
5966 Present (gnat_with_clause);
5967 gnat_with_clause = Next (gnat_with_clause))
5968 if (Nkind (gnat_with_clause) == N_With_Clause
5969 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5970 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5972 elaborate_all_entities (Library_Unit (gnat_with_clause));
5974 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5976 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5977 Present (gnat_entity);
5978 gnat_entity = Next_Entity (gnat_entity))
5979 if (Is_Public (gnat_entity)
5980 && Convention (gnat_entity) != Convention_Intrinsic
5981 && Ekind (gnat_entity) != E_Package
5982 && Ekind (gnat_entity) != E_Package_Body
5983 && Ekind (gnat_entity) != E_Operator
5984 && !(IN (Ekind (gnat_entity), Type_Kind)
5985 && !Is_Frozen (gnat_entity))
5986 && !((Ekind (gnat_entity) == E_Procedure
5987 || Ekind (gnat_entity) == E_Function)
5988 && Is_Intrinsic_Subprogram (gnat_entity))
5989 && !IN (Ekind (gnat_entity), Named_Kind)
5990 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5991 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5993 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5996 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5998 /* Retrieve compilation unit node of generic body. */
5999 while (Present (gnat_body)
6000 && Nkind (gnat_body) != N_Compilation_Unit)
6001 gnat_body = Parent (gnat_body);
6003 /* If body is available, elaborate its context. */
6004 if (Present (gnat_body))
6005 elaborate_all_entities (gnat_body);
6009 if (Nkind (Unit (gnat_node)) == N_Package_Body)
6010 elaborate_all_entities (Library_Unit (gnat_node));
6013 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
6016 process_freeze_entity (Node_Id gnat_node)
6018 Entity_Id gnat_entity = Entity (gnat_node);
6022 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6023 && present_gnu_tree (Declaration_Node (gnat_entity)))
6024 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6026 /* If this is a package, need to generate code for the package. */
6027 if (Ekind (gnat_entity) == E_Package)
6030 (Parent (Corresponding_Body
6031 (Parent (Declaration_Node (gnat_entity)))));
6035 /* Check for old definition after the above call. This Freeze_Node
6036 might be for one its Itypes. */
6038 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6040 /* If this entity has an Address representation clause, GNU_OLD is the
6041 address, so discard it here. */
6042 if (Present (Address_Clause (gnat_entity)))
6045 /* Don't do anything for class-wide types they are always
6046 transformed into their root type. */
6047 if (Ekind (gnat_entity) == E_Class_Wide_Type
6048 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
6049 && Present (Equivalent_Type (gnat_entity))))
6052 /* Don't do anything for subprograms that may have been elaborated before
6053 their freeze nodes. This can happen, for example because of an inner call
6054 in an instance body, or a previous compilation of a spec for inlining
6057 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6058 && (Ekind (gnat_entity) == E_Function
6059 || Ekind (gnat_entity) == E_Procedure))
6061 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6062 && Ekind (gnat_entity) == E_Subprogram_Type)))
6065 /* If we have a non-dummy type old tree, we have nothing to do, except
6066 aborting if this is the public view of a private type whose full view was
6067 not delayed, as this node was never delayed as it should have been. We
6068 let this happen for concurrent types and their Corresponding_Record_Type,
6069 however, because each might legitimately be elaborated before it's own
6070 freeze node, e.g. while processing the other. */
6072 && !(TREE_CODE (gnu_old) == TYPE_DECL
6073 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6075 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6076 && Present (Full_View (gnat_entity))
6077 && No (Freeze_Node (Full_View (gnat_entity))))
6078 || Is_Concurrent_Type (gnat_entity)
6079 || (IN (Ekind (gnat_entity), Record_Kind)
6080 && Is_Concurrent_Record_Type (gnat_entity)));
6084 /* Reset the saved tree, if any, and elaborate the object or type for real.
6085 If there is a full declaration, elaborate it and copy the type to
6086 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6087 a class wide type or subtype. */
6090 save_gnu_tree (gnat_entity, NULL_TREE, false);
6091 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6092 && Present (Full_View (gnat_entity))
6093 && present_gnu_tree (Full_View (gnat_entity)))
6094 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6095 if (Present (Class_Wide_Type (gnat_entity))
6096 && Class_Wide_Type (gnat_entity) != gnat_entity)
6097 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6100 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6101 && Present (Full_View (gnat_entity)))
6103 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6105 /* Propagate back-annotations from full view to partial view. */
6106 if (Unknown_Alignment (gnat_entity))
6107 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6109 if (Unknown_Esize (gnat_entity))
6110 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6112 if (Unknown_RM_Size (gnat_entity))
6113 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6115 /* The above call may have defined this entity (the simplest example
6116 of this is when we have a private enumeral type since the bounds
6117 will have the public view. */
6118 if (!present_gnu_tree (gnat_entity))
6119 save_gnu_tree (gnat_entity, gnu_new, false);
6120 if (Present (Class_Wide_Type (gnat_entity))
6121 && Class_Wide_Type (gnat_entity) != gnat_entity)
6122 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6125 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6127 /* If we've made any pointers to the old version of this type, we
6128 have to update them. */
6130 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6131 TREE_TYPE (gnu_new));
6134 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6135 N_Compilation_Unit. */
6138 process_inlined_subprograms (Node_Id gnat_node)
6140 Entity_Id gnat_entity;
6143 /* If we can inline, generate Gimple for all the inlined subprograms.
6144 Define the entity first so we set DECL_EXTERNAL. */
6146 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6147 Present (gnat_entity);
6148 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6150 gnat_body = Parent (Declaration_Node (gnat_entity));
6152 if (Nkind (gnat_body) != N_Subprogram_Body)
6154 /* ??? This really should always be Present. */
6155 if (No (Corresponding_Body (gnat_body)))
6159 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6162 if (Present (gnat_body))
6164 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6165 add_stmt (gnat_to_gnu (gnat_body));
6170 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6171 We make two passes, one to elaborate anything other than bodies (but
6172 we declare a function if there was no spec). The second pass
6173 elaborates the bodies.
6175 GNAT_END_LIST gives the element in the list past the end. Normally,
6176 this is Empty, but can be First_Real_Statement for a
6177 Handled_Sequence_Of_Statements.
6179 We make a complete pass through both lists if PASS1P is true, then make
6180 the second pass over both lists if PASS2P is true. The lists usually
6181 correspond to the public and private parts of a package. */
6184 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6185 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6187 List_Id gnat_decl_array[2];
6191 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6194 for (i = 0; i <= 1; i++)
6195 if (Present (gnat_decl_array[i]))
6196 for (gnat_decl = First (gnat_decl_array[i]);
6197 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6199 /* For package specs, we recurse inside the declarations,
6200 thus taking the two pass approach inside the boundary. */
6201 if (Nkind (gnat_decl) == N_Package_Declaration
6202 && (Nkind (Specification (gnat_decl)
6203 == N_Package_Specification)))
6204 process_decls (Visible_Declarations (Specification (gnat_decl)),
6205 Private_Declarations (Specification (gnat_decl)),
6206 Empty, true, false);
6208 /* Similarly for any declarations in the actions of a
6210 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6212 process_freeze_entity (gnat_decl);
6213 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6216 /* Package bodies with freeze nodes get their elaboration deferred
6217 until the freeze node, but the code must be placed in the right
6218 place, so record the code position now. */
6219 else if (Nkind (gnat_decl) == N_Package_Body
6220 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6221 record_code_position (gnat_decl);
6223 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6224 && Present (Library_Unit (gnat_decl))
6225 && Present (Freeze_Node
6228 (Library_Unit (gnat_decl)))))))
6229 record_code_position
6230 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6232 /* We defer most subprogram bodies to the second pass. */
6233 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6235 if (Acts_As_Spec (gnat_decl))
6237 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6239 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6240 && Ekind (gnat_subprog_id) != E_Generic_Function)
6241 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6245 /* For bodies and stubs that act as their own specs, the entity
6246 itself must be elaborated in the first pass, because it may
6247 be used in other declarations. */
6248 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6250 Node_Id gnat_subprog_id
6251 = Defining_Entity (Specification (gnat_decl));
6253 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6254 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6255 && Ekind (gnat_subprog_id) != E_Generic_Function)
6256 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6259 /* Concurrent stubs stand for the corresponding subprogram bodies,
6260 which are deferred like other bodies. */
6261 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6262 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6266 add_stmt (gnat_to_gnu (gnat_decl));
6269 /* Here we elaborate everything we deferred above except for package bodies,
6270 which are elaborated at their freeze nodes. Note that we must also
6271 go inside things (package specs and freeze nodes) the first pass did. */
6273 for (i = 0; i <= 1; i++)
6274 if (Present (gnat_decl_array[i]))
6275 for (gnat_decl = First (gnat_decl_array[i]);
6276 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6278 if (Nkind (gnat_decl) == N_Subprogram_Body
6279 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6280 || Nkind (gnat_decl) == N_Task_Body_Stub
6281 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6282 add_stmt (gnat_to_gnu (gnat_decl));
6284 else if (Nkind (gnat_decl) == N_Package_Declaration
6285 && (Nkind (Specification (gnat_decl)
6286 == N_Package_Specification)))
6287 process_decls (Visible_Declarations (Specification (gnat_decl)),
6288 Private_Declarations (Specification (gnat_decl)),
6289 Empty, false, true);
6291 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6292 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6296 /* Make a unary operation of kind CODE using build_unary_op, but guard
6297 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6298 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6299 the operation is to be performed in that type. GNAT_NODE is the gnat
6300 node conveying the source location for which the error should be
6304 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6307 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6309 operand = protect_multiple_eval (operand);
6311 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6312 operand, TYPE_MIN_VALUE (gnu_type)),
6313 build_unary_op (code, gnu_type, operand),
6314 CE_Overflow_Check_Failed, gnat_node);
6317 /* Make a binary operation of kind CODE using build_binary_op, but guard
6318 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6319 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6320 Usually the operation is to be performed in that type. GNAT_NODE is
6321 the GNAT node conveying the source location for which the error should
6325 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6326 tree right, Node_Id gnat_node)
6328 tree lhs = protect_multiple_eval (left);
6329 tree rhs = protect_multiple_eval (right);
6330 tree type_max = TYPE_MAX_VALUE (gnu_type);
6331 tree type_min = TYPE_MIN_VALUE (gnu_type);
6334 tree zero = convert (gnu_type, integer_zero_node);
6339 int precision = TYPE_PRECISION (gnu_type);
6341 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6343 /* Prefer a constant or known-positive rhs to simplify checks. */
6344 if (!TREE_CONSTANT (rhs)
6345 && commutative_tree_code (code)
6346 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6347 && tree_expr_nonnegative_p (lhs))))
6354 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6356 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6358 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6360 /* Try a few strategies that may be cheaper than the general
6361 code at the end of the function, if the rhs is not known.
6363 - Call library function for 64-bit multiplication (complex)
6364 - Widen, if input arguments are sufficiently small
6365 - Determine overflow using wrapped result for addition/subtraction. */
6367 if (!TREE_CONSTANT (rhs))
6369 /* Even for add/subtract double size to get another base type. */
6370 int needed_precision = precision * 2;
6372 if (code == MULT_EXPR && precision == 64)
6374 tree int_64 = gnat_type_for_size (64, 0);
6376 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6377 convert (int_64, lhs),
6378 convert (int_64, rhs)));
6381 else if (needed_precision <= BITS_PER_WORD
6382 || (code == MULT_EXPR
6383 && needed_precision <= LONG_LONG_TYPE_SIZE))
6385 tree wide_type = gnat_type_for_size (needed_precision, 0);
6387 tree wide_result = build_binary_op (code, wide_type,
6388 convert (wide_type, lhs),
6389 convert (wide_type, rhs));
6391 tree check = build_binary_op
6392 (TRUTH_ORIF_EXPR, integer_type_node,
6393 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6394 convert (wide_type, type_min)),
6395 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6396 convert (wide_type, type_max)));
6398 tree result = convert (gnu_type, wide_result);
6401 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6404 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6406 tree unsigned_type = gnat_type_for_size (precision, 1);
6407 tree wrapped_expr = convert
6408 (gnu_type, build_binary_op (code, unsigned_type,
6409 convert (unsigned_type, lhs),
6410 convert (unsigned_type, rhs)));
6412 tree result = convert
6413 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6415 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6416 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6417 tree check = build_binary_op
6418 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6419 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6420 integer_type_node, wrapped_expr, lhs));
6423 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6430 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6431 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6432 build_binary_op (MINUS_EXPR, gnu_type,
6435 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6436 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6437 build_binary_op (MINUS_EXPR, gnu_type,
6442 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6443 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6444 build_binary_op (PLUS_EXPR, gnu_type,
6447 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6448 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6449 build_binary_op (PLUS_EXPR, gnu_type,
6454 /* The check here is designed to be efficient if the rhs is constant,
6455 but it will work for any rhs by using integer division.
6456 Four different check expressions determine wether X * C overflows,
6459 C > 0 => X > type_max / C || X < type_min / C
6460 C == -1 => X == type_min
6461 C < -1 => X > type_min / C || X < type_max / C */
6463 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6464 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6466 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6467 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6468 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6469 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6470 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6472 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6473 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6474 build_int_cst (gnu_type, -1)),
6475 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6476 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6477 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6478 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6485 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6487 /* If we can fold the expression to a constant, just return it.
6488 The caller will deal with overflow, no need to generate a check. */
6489 if (TREE_CONSTANT (gnu_expr))
6492 check = fold_build3 (COND_EXPR, integer_type_node,
6493 rhs_lt_zero, check_neg, check_pos);
6495 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6498 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6499 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6500 which we have to check. GNAT_NODE is the GNAT node conveying the source
6501 location for which the error should be signaled. */
6504 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6506 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6507 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6508 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6509 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6511 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6512 This can for example happen when translating 'Val or 'Value. */
6513 if (gnu_compare_type == gnu_range_type)
6516 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6517 we can't do anything since we might be truncating the bounds. No
6518 check is needed in this case. */
6519 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6520 && (TYPE_PRECISION (gnu_compare_type)
6521 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6524 /* Checked expressions must be evaluated only once. */
6525 gnu_expr = protect_multiple_eval (gnu_expr);
6527 /* There's no good type to use here, so we might as well use
6528 integer_type_node. Note that the form of the check is
6529 (not (expr >= lo)) or (not (expr <= hi))
6530 the reason for this slightly convoluted form is that NaNs
6531 are not considered to be in range in the float case. */
6533 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6535 (build_binary_op (GE_EXPR, integer_type_node,
6536 convert (gnu_compare_type, gnu_expr),
6537 convert (gnu_compare_type, gnu_low))),
6539 (build_binary_op (LE_EXPR, integer_type_node,
6540 convert (gnu_compare_type, gnu_expr),
6541 convert (gnu_compare_type,
6543 gnu_expr, CE_Range_Check_Failed, gnat_node);
6546 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6547 we are about to index, GNU_EXPR is the index expression to be checked,
6548 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6549 has to be checked. Note that for index checking we cannot simply use the
6550 emit_range_check function (although very similar code needs to be generated
6551 in both cases) since for index checking the array type against which we are
6552 checking the indices may be unconstrained and consequently we need to get
6553 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6554 The place where we need to do that is in subprograms having unconstrained
6555 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6556 location for which the error should be signaled. */
6559 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6560 tree gnu_high, Node_Id gnat_node)
6562 tree gnu_expr_check;
6564 /* Checked expressions must be evaluated only once. */
6565 gnu_expr = protect_multiple_eval (gnu_expr);
6567 /* Must do this computation in the base type in case the expression's
6568 type is an unsigned subtypes. */
6569 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6571 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6572 the object we are handling. */
6573 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6574 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6576 /* There's no good type to use here, so we might as well use
6577 integer_type_node. */
6579 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6580 build_binary_op (LT_EXPR, integer_type_node,
6582 convert (TREE_TYPE (gnu_expr_check),
6584 build_binary_op (GT_EXPR, integer_type_node,
6586 convert (TREE_TYPE (gnu_expr_check),
6588 gnu_expr, CE_Index_Check_Failed, gnat_node);
6591 /* GNU_COND contains the condition corresponding to an access, discriminant or
6592 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6593 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6594 REASON is the code that says why the exception was raised. GNAT_NODE is
6595 the GNAT node conveying the source location for which the error should be
6599 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6602 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6604 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6605 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6606 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6609 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6610 we don't need to evaluate it just for the check. */
6611 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6616 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6617 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6618 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6619 float to integer conversion with truncation; otherwise round.
6620 GNAT_NODE is the GNAT node conveying the source location for which the
6621 error should be signaled. */
6624 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6625 bool rangep, bool truncatep, Node_Id gnat_node)
6627 tree gnu_type = get_unpadded_type (gnat_type);
6628 tree gnu_in_type = TREE_TYPE (gnu_expr);
6629 tree gnu_in_basetype = get_base_type (gnu_in_type);
6630 tree gnu_base_type = get_base_type (gnu_type);
6631 tree gnu_result = gnu_expr;
6633 /* If we are not doing any checks, the output is an integral type, and
6634 the input is not a floating type, just do the conversion. This
6635 shortcut is required to avoid problems with packed array types
6636 and simplifies code in all cases anyway. */
6637 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6638 && !FLOAT_TYPE_P (gnu_in_type))
6639 return convert (gnu_type, gnu_expr);
6641 /* First convert the expression to its base type. This
6642 will never generate code, but makes the tests below much simpler.
6643 But don't do this if converting from an integer type to an unconstrained
6644 array type since then we need to get the bounds from the original
6646 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6647 gnu_result = convert (gnu_in_basetype, gnu_result);
6649 /* If overflow checks are requested, we need to be sure the result will
6650 fit in the output base type. But don't do this if the input
6651 is integer and the output floating-point. */
6653 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6655 /* Ensure GNU_EXPR only gets evaluated once. */
6656 tree gnu_input = protect_multiple_eval (gnu_result);
6657 tree gnu_cond = integer_zero_node;
6658 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6659 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6660 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6661 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6663 /* Convert the lower bounds to signed types, so we're sure we're
6664 comparing them properly. Likewise, convert the upper bounds
6665 to unsigned types. */
6666 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6667 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6669 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6670 && !TYPE_UNSIGNED (gnu_in_basetype))
6671 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6673 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6674 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6676 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6677 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6679 /* Check each bound separately and only if the result bound
6680 is tighter than the bound on the input type. Note that all the
6681 types are base types, so the bounds must be constant. Also,
6682 the comparison is done in the base type of the input, which
6683 always has the proper signedness. First check for input
6684 integer (which means output integer), output float (which means
6685 both float), or mixed, in which case we always compare.
6686 Note that we have to do the comparison which would *fail* in the
6687 case of an error since if it's an FP comparison and one of the
6688 values is a NaN or Inf, the comparison will fail. */
6689 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6690 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6691 : (FLOAT_TYPE_P (gnu_base_type)
6692 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6693 TREE_REAL_CST (gnu_out_lb))
6697 (build_binary_op (GE_EXPR, integer_type_node,
6698 gnu_input, convert (gnu_in_basetype,
6701 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6702 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6703 : (FLOAT_TYPE_P (gnu_base_type)
6704 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6705 TREE_REAL_CST (gnu_in_lb))
6708 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6710 (build_binary_op (LE_EXPR, integer_type_node,
6712 convert (gnu_in_basetype,
6715 if (!integer_zerop (gnu_cond))
6716 gnu_result = emit_check (gnu_cond, gnu_input,
6717 CE_Overflow_Check_Failed, gnat_node);
6720 /* Now convert to the result base type. If this is a non-truncating
6721 float-to-integer conversion, round. */
6722 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6725 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6726 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6727 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6728 const struct real_format *fmt;
6730 /* The following calculations depend on proper rounding to even
6731 of each arithmetic operation. In order to prevent excess
6732 precision from spoiling this property, use the widest hardware
6733 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6735 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6737 /* FIXME: Should not have padding in the first place. */
6738 if (TREE_CODE (calc_type) == RECORD_TYPE
6739 && TYPE_IS_PADDING_P (calc_type))
6740 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6742 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6743 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6744 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6745 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6746 half_minus_pred_half);
6747 gnu_pred_half = build_real (calc_type, pred_half);
6749 /* If the input is strictly negative, subtract this value
6750 and otherwise add it from the input. For 0.5, the result
6751 is exactly between 1.0 and the machine number preceding 1.0
6752 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6753 will round to 1.0, while all other number with an absolute
6754 value less than 0.5 round to 0.0. For larger numbers exactly
6755 halfway between integers, rounding will always be correct as
6756 the true mathematical result will be closer to the higher
6757 integer compared to the lower one. So, this constant works
6758 for all floating-point numbers.
6760 The reason to use the same constant with subtract/add instead
6761 of a positive and negative constant is to allow the comparison
6762 to be scheduled in parallel with retrieval of the constant and
6763 conversion of the input to the calc_type (if necessary). */
6765 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6766 gnu_saved_result = save_expr (gnu_result);
6767 gnu_conv = convert (calc_type, gnu_saved_result);
6768 gnu_comp = build2 (GE_EXPR, integer_type_node,
6769 gnu_saved_result, gnu_zero);
6771 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6772 gnu_subtract_pred_half
6773 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6774 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6775 gnu_add_pred_half, gnu_subtract_pred_half);
6778 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6779 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6780 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6781 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6783 gnu_result = convert (gnu_base_type, gnu_result);
6785 /* Finally, do the range check if requested. Note that if the
6786 result type is a modular type, the range check is actually
6787 an overflow check. */
6790 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6791 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6792 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6794 return convert (gnu_type, gnu_result);
6797 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6800 smaller_packable_type_p (tree type, tree record_type)
6804 /* We're not interested in variants here. */
6805 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6808 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6809 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6812 size = TYPE_SIZE (type);
6813 rsize = TYPE_SIZE (record_type);
6815 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6818 return tree_int_cst_lt (size, rsize) != 0;
6821 /* Return true if GNU_EXPR can be directly addressed. This is the case
6822 unless it is an expression involving computation or if it involves a
6823 reference to a bitfield or to an object not sufficiently aligned for
6824 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6825 be directly addressed as an object of this type.
6827 *** Notes on addressability issues in the Ada compiler ***
6829 This predicate is necessary in order to bridge the gap between Gigi
6830 and the middle-end about addressability of GENERIC trees. A tree
6831 is said to be addressable if it can be directly addressed, i.e. if
6832 its address can be taken, is a multiple of the type's alignment on
6833 strict-alignment architectures and returns the first storage unit
6834 assigned to the object represented by the tree.
6836 In the C family of languages, everything is in practice addressable
6837 at the language level, except for bit-fields. This means that these
6838 compilers will take the address of any tree that doesn't represent
6839 a bit-field reference and expect the result to be the first storage
6840 unit assigned to the object. Even in cases where this will result
6841 in unaligned accesses at run time, nothing is supposed to be done
6842 and the program is considered as erroneous instead (see PR c/18287).
6844 The implicit assumptions made in the middle-end are in keeping with
6845 the C viewpoint described above:
6846 - the address of a bit-field reference is supposed to be never
6847 taken; the compiler (generally) will stop on such a construct,
6848 - any other tree is addressable if it is formally addressable,
6849 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6851 In Ada, the viewpoint is the opposite one: nothing is addressable
6852 at the language level unless explicitly declared so. This means
6853 that the compiler will both make sure that the trees representing
6854 references to addressable ("aliased" in Ada parlance) objects are
6855 addressable and make no real attempts at ensuring that the trees
6856 representing references to non-addressable objects are addressable.
6858 In the first case, Ada is effectively equivalent to C and handing
6859 down the direct result of applying ADDR_EXPR to these trees to the
6860 middle-end works flawlessly. In the second case, Ada cannot afford
6861 to consider the program as erroneous if the address of trees that
6862 are not addressable is requested for technical reasons, unlike C;
6863 as a consequence, the Ada compiler must arrange for either making
6864 sure that this address is not requested in the middle-end or for
6865 compensating by inserting temporaries if it is requested in Gigi.
6867 The first goal can be achieved because the middle-end should not
6868 request the address of non-addressable trees on its own; the only
6869 exception is for the invocation of low-level block operations like
6870 memcpy, for which the addressability requirements are lower since
6871 the type's alignment can be disregarded. In practice, this means
6872 that Gigi must make sure that such operations cannot be applied to
6873 non-BLKmode bit-fields.
6875 The second goal is achieved by means of the addressable_p predicate
6876 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6877 They will be turned during gimplification into proper temporaries
6878 whose address will be used in lieu of that of the original tree. */
6881 addressable_p (tree gnu_expr, tree gnu_type)
6883 /* The size of the real type of the object must not be smaller than
6884 that of the expected type, otherwise an indirect access in the
6885 latter type would be larger than the object. Only records need
6886 to be considered in practice. */
6888 && TREE_CODE (gnu_type) == RECORD_TYPE
6889 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6892 switch (TREE_CODE (gnu_expr))
6898 /* All DECLs are addressable: if they are in a register, we can force
6902 case UNCONSTRAINED_ARRAY_REF:
6913 /* We accept &COND_EXPR as soon as both operands are addressable and
6914 expect the outcome to be the address of the selected operand. */
6915 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6916 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6919 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6920 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6921 the field is sufficiently aligned, in case it is subject
6922 to a pragma Component_Alignment. But we don't need to
6923 check the alignment of the containing record, as it is
6924 guaranteed to be not smaller than that of its most
6925 aligned field that is not a bit-field. */
6926 && (!STRICT_ALIGNMENT
6927 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6928 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6929 /* The field of a padding record is always addressable. */
6930 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6931 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6933 case ARRAY_REF: case ARRAY_RANGE_REF:
6934 case REALPART_EXPR: case IMAGPART_EXPR:
6936 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6939 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6940 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6942 case VIEW_CONVERT_EXPR:
6944 /* This is addressable if we can avoid a copy. */
6945 tree type = TREE_TYPE (gnu_expr);
6946 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6947 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6948 && (!STRICT_ALIGNMENT
6949 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6950 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6951 || ((TYPE_MODE (type) == BLKmode
6952 || TYPE_MODE (inner_type) == BLKmode)
6953 && (!STRICT_ALIGNMENT
6954 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6955 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6956 || TYPE_ALIGN_OK (type)
6957 || TYPE_ALIGN_OK (inner_type))))
6958 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6966 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6967 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6968 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6971 process_type (Entity_Id gnat_entity)
6974 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6977 /* If we are to delay elaboration of this type, just do any
6978 elaborations needed for expressions within the declaration and
6979 make a dummy type entry for this node and its Full_View (if
6980 any) in case something points to it. Don't do this if it
6981 has already been done (the only way that can happen is if
6982 the private completion is also delayed). */
6983 if (Present (Freeze_Node (gnat_entity))
6984 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6985 && Present (Full_View (gnat_entity))
6986 && Freeze_Node (Full_View (gnat_entity))
6987 && !present_gnu_tree (Full_View (gnat_entity))))
6989 elaborate_entity (gnat_entity);
6993 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6994 save_gnu_tree (gnat_entity, gnu_decl, false);
6995 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6996 && Present (Full_View (gnat_entity)))
6997 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
7003 /* If we saved away a dummy type for this node it means that this
7004 made the type that corresponds to the full type of an incomplete
7005 type. Clear that type for now and then update the type in the
7009 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
7010 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
7012 save_gnu_tree (gnat_entity, NULL_TREE, false);
7015 /* Now fully elaborate the type. */
7016 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7017 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7019 /* If we have an old type and we've made pointers to this type,
7020 update those pointers. */
7022 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7023 TREE_TYPE (gnu_new));
7025 /* If this is a record type corresponding to a task or protected type
7026 that is a completion of an incomplete type, perform a similar update
7027 on the type. ??? Including protected types here is a guess. */
7028 if (IN (Ekind (gnat_entity), Record_Kind)
7029 && Is_Concurrent_Record_Type (gnat_entity)
7030 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7033 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7035 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7037 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7040 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7041 TREE_TYPE (gnu_new));
7045 /* GNAT_ENTITY is the type of the resulting constructors,
7046 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7047 and GNU_TYPE is the GCC type of the corresponding record.
7049 Return a CONSTRUCTOR to build the record. */
7052 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7054 tree gnu_list, gnu_result;
7056 /* We test for GNU_FIELD being empty in the case where a variant
7057 was the last thing since we don't take things off GNAT_ASSOC in
7058 that case. We check GNAT_ASSOC in case we have a variant, but it
7061 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7062 gnat_assoc = Next (gnat_assoc))
7064 Node_Id gnat_field = First (Choices (gnat_assoc));
7065 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7066 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7068 /* The expander is supposed to put a single component selector name
7069 in every record component association. */
7070 gcc_assert (No (Next (gnat_field)));
7072 /* Ignore fields that have Corresponding_Discriminants since we'll
7073 be setting that field in the parent. */
7074 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7075 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7078 /* Also ignore discriminants of Unchecked_Unions. */
7079 else if (Is_Unchecked_Union (gnat_entity)
7080 && Ekind (Entity (gnat_field)) == E_Discriminant)
7083 /* Before assigning a value in an aggregate make sure range checks
7084 are done if required. Then convert to the type of the field. */
7085 if (Do_Range_Check (Expression (gnat_assoc)))
7086 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7088 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7090 /* Add the field and expression to the list. */
7091 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7094 gnu_result = extract_values (gnu_list, gnu_type);
7096 #ifdef ENABLE_CHECKING
7100 /* Verify every entry in GNU_LIST was used. */
7101 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7102 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7109 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7110 the first element of an array aggregate. It may itself be an aggregate.
7111 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7112 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7113 for range checking. */
7116 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7117 Entity_Id gnat_component_type)
7119 tree gnu_expr_list = NULL_TREE;
7120 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7123 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7125 /* If the expression is itself an array aggregate then first build the
7126 innermost constructor if it is part of our array (multi-dimensional
7128 if (Nkind (gnat_expr) == N_Aggregate
7129 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7130 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7131 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7132 TREE_TYPE (gnu_array_type),
7133 gnat_component_type);
7136 gnu_expr = gnat_to_gnu (gnat_expr);
7138 /* Before assigning the element to the array, make sure it is
7140 if (Do_Range_Check (gnat_expr))
7141 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7145 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7148 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7151 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7154 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7155 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7156 of the associations that are from RECORD_TYPE. If we see an internal
7157 record, make a recursive call to fill it in as well. */
7160 extract_values (tree values, tree record_type)
7162 tree result = NULL_TREE;
7165 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7169 /* _Parent is an internal field, but may have values in the aggregate,
7170 so check for values first. */
7171 if ((tem = purpose_member (field, values)))
7173 value = TREE_VALUE (tem);
7174 TREE_ADDRESSABLE (tem) = 1;
7177 else if (DECL_INTERNAL_P (field))
7179 value = extract_values (values, TREE_TYPE (field));
7180 if (TREE_CODE (value) == CONSTRUCTOR
7181 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7185 /* If we have a record subtype, the names will match, but not the
7186 actual FIELD_DECLs. */
7187 for (tem = values; tem; tem = TREE_CHAIN (tem))
7188 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7190 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7191 TREE_ADDRESSABLE (tem) = 1;
7197 result = tree_cons (field, value, result);
7200 return gnat_build_constructor (record_type, nreverse (result));
7203 /* EXP is to be treated as an array or record. Handle the cases when it is
7204 an access object and perform the required dereferences. */
7207 maybe_implicit_deref (tree exp)
7209 /* If the type is a pointer, dereference it. */
7211 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7212 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7214 /* If we got a padded type, remove it too. */
7215 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7216 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7217 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7222 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7225 protect_multiple_eval (tree exp)
7227 tree type = TREE_TYPE (exp);
7229 /* If EXP has no side effects, we theoritically don't need to do anything.
7230 However, we may be recursively passed more and more complex expressions
7231 involving checks which will be reused multiple times and eventually be
7232 unshared for gimplification; in order to avoid a complexity explosion
7233 at that point, we protect any expressions more complex than a simple
7234 arithmetic expression. */
7235 if (!TREE_SIDE_EFFECTS (exp)
7236 && (CONSTANT_CLASS_P (exp)
7237 || !EXPRESSION_CLASS_P (skip_simple_arithmetic (exp))))
7240 /* If this is a conversion, protect what's inside the conversion.
7241 Similarly, if we're indirectly referencing something, we only
7242 need to protect the address since the data itself can't change
7243 in these situations. */
7244 if (TREE_CODE (exp) == NON_LVALUE_EXPR
7245 || CONVERT_EXPR_P (exp)
7246 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7247 || TREE_CODE (exp) == INDIRECT_REF
7248 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7249 return build1 (TREE_CODE (exp), type,
7250 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7252 /* If this is a fat pointer or something that can be placed into a
7253 register, just make a SAVE_EXPR. */
7254 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7255 return save_expr (exp);
7257 /* Otherwise, reference, protect the address and dereference. */
7259 build_unary_op (INDIRECT_REF, type,
7260 save_expr (build_unary_op (ADDR_EXPR,
7261 build_reference_type (type),
7265 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7266 handle our own nodes and we take extra arguments. FORCE says whether to
7267 force evaluation of everything. We set SUCCESS to true unless we walk
7268 through something we don't know how to stabilize. */
7271 maybe_stabilize_reference (tree ref, bool force, bool *success)
7273 tree type = TREE_TYPE (ref);
7274 enum tree_code code = TREE_CODE (ref);
7277 /* Assume we'll success unless proven otherwise. */
7286 /* No action is needed in this case. */
7292 case FIX_TRUNC_EXPR:
7293 case VIEW_CONVERT_EXPR:
7295 = build1 (code, type,
7296 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7301 case UNCONSTRAINED_ARRAY_REF:
7302 result = build1 (code, type,
7303 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7308 result = build3 (COMPONENT_REF, type,
7309 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7311 TREE_OPERAND (ref, 1), NULL_TREE);
7315 result = build3 (BIT_FIELD_REF, type,
7316 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7318 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7320 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7325 case ARRAY_RANGE_REF:
7326 result = build4 (code, type,
7327 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7329 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7331 NULL_TREE, NULL_TREE);
7335 result = gnat_stabilize_reference_1 (ref, force);
7339 /* This generates better code than the scheme in protect_multiple_eval
7340 because large objects will be returned via invisible reference in
7341 most ABIs so the temporary will directly be filled by the callee. */
7342 result = gnat_stabilize_reference_1 (ref, force);
7346 /* Constructors with 1 element are used extensively to formally
7347 convert objects to special wrapping types. */
7348 if (TREE_CODE (type) == RECORD_TYPE
7349 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7352 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7354 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7356 = build_constructor_single (type, index,
7357 gnat_stabilize_reference_1 (value,
7368 ref = error_mark_node;
7370 /* ... fall through to failure ... */
7372 /* If arg isn't a kind of lvalue we recognize, make no change.
7373 Caller should recognize the error for an invalid lvalue. */
7379 TREE_READONLY (result) = TREE_READONLY (ref);
7381 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7382 expression may not be sustained across some paths, such as the way via
7383 build1 for INDIRECT_REF. We re-populate those flags here for the general
7384 case, which is consistent with the GCC version of this routine.
7386 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7387 paths introduce side effects where there was none initially (e.g. calls
7388 to save_expr), and we also want to keep track of that. */
7390 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7391 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7396 /* Wrapper around maybe_stabilize_reference, for common uses without
7397 lvalue restrictions and without need to examine the success
7401 gnat_stabilize_reference (tree ref, bool force)
7404 return maybe_stabilize_reference (ref, force, &dummy);
7407 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7408 arg to force a SAVE_EXPR for everything. */
7411 gnat_stabilize_reference_1 (tree e, bool force)
7413 enum tree_code code = TREE_CODE (e);
7414 tree type = TREE_TYPE (e);
7417 /* We cannot ignore const expressions because it might be a reference
7418 to a const array but whose index contains side-effects. But we can
7419 ignore things that are actual constant or that already have been
7420 handled by this function. */
7422 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7425 switch (TREE_CODE_CLASS (code))
7427 case tcc_exceptional:
7429 case tcc_declaration:
7430 case tcc_comparison:
7432 case tcc_expression:
7435 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7436 fat pointer. This may be more efficient, but will also allow
7437 us to more easily find the match for the PLACEHOLDER_EXPR. */
7438 if (code == COMPONENT_REF
7439 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7440 result = build3 (COMPONENT_REF, type,
7441 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7443 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7444 else if (TREE_SIDE_EFFECTS (e) || force)
7445 return save_expr (e);
7451 /* Constants need no processing. In fact, we should never reach
7456 /* Recursively stabilize each operand. */
7457 result = build2 (code, type,
7458 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7459 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7464 /* Recursively stabilize each operand. */
7465 result = build1 (code, type,
7466 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7474 TREE_READONLY (result) = TREE_READONLY (e);
7476 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7477 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7481 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7482 location and false if it doesn't. In the former case, set the Gigi global
7483 variable REF_FILENAME to the simple debug file name as given by sinput. */
7486 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7488 if (Sloc == No_Location)
7491 if (Sloc <= Standard_Location)
7493 *locus = BUILTINS_LOCATION;
7498 Source_File_Index file = Get_Source_File_Index (Sloc);
7499 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7500 Column_Number column = Get_Column_Number (Sloc);
7501 struct line_map *map = &line_table->maps[file - 1];
7503 /* Translate the location according to the line-map.h formula. */
7504 *locus = map->start_location
7505 + ((line - map->to_line) << map->column_bits)
7506 + (column & ((1 << map->column_bits) - 1));
7510 = IDENTIFIER_POINTER
7512 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7517 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7518 don't do anything if it doesn't correspond to a source location. */
7521 set_expr_location_from_node (tree node, Node_Id gnat_node)
7525 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7528 SET_EXPR_LOCATION (node, locus);
7531 /* Return a colon-separated list of encodings contained in encoded Ada
7535 extract_encoding (const char *name)
7537 char *encoding = GGC_NEWVEC (char, strlen (name));
7538 get_encoding (name, encoding);
7542 /* Extract the Ada name from an encoded name. */
7545 decode_name (const char *name)
7547 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7548 __gnat_decode (name, decoded, 0);
7552 /* Post an error message. MSG is the error message, properly annotated.
7553 NODE is the node at which to post the error and the node to use for the
7554 "&" substitution. */
7557 post_error (const char *msg, Node_Id node)
7559 String_Template temp;
7562 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7563 fp.Array = msg, fp.Bounds = &temp;
7565 Error_Msg_N (fp, node);
7568 /* Similar, but NODE is the node at which to post the error and ENT
7569 is the node to use for the "&" substitution. */
7572 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7574 String_Template temp;
7577 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7578 fp.Array = msg, fp.Bounds = &temp;
7580 Error_Msg_NE (fp, node, ent);
7583 /* Similar, but NODE is the node at which to post the error, ENT is the node
7584 to use for the "&" substitution, and N is the number to use for the ^. */
7587 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7589 String_Template temp;
7592 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7593 fp.Array = msg, fp.Bounds = &temp;
7594 Error_Msg_Uint_1 = UI_From_Int (n);
7597 Error_Msg_NE (fp, node, ent);
7600 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7601 number to write. If the tree represents a constant that fits within
7602 a host integer, the text inside curly brackets in MSG will be output
7603 (presumably including a '^'). Otherwise that text will not be output
7604 and the text inside square brackets will be output instead. */
7607 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7609 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7610 String_Template temp = {1, 0};
7612 char start_yes, end_yes, start_no, end_no;
7616 fp.Array = newmsg, fp.Bounds = &temp;
7618 if (host_integerp (t, 1)
7619 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7622 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7626 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7627 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7630 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7632 for (p = msg, q = newmsg; *p; p++)
7634 if (*p == start_yes)
7635 for (p++; *p != end_yes; p++)
7637 else if (*p == start_no)
7638 for (p++; *p != end_no; p++)
7646 temp.High_Bound = strlen (newmsg);
7648 Error_Msg_NE (fp, node, ent);
7651 /* Similar to post_error_ne_tree, except that NUM is a second
7652 integer to write in the message. */
7655 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7658 Error_Msg_Uint_2 = UI_From_Int (num);
7659 post_error_ne_tree (msg, node, ent, t);
7662 /* Initialize the table that maps GNAT codes to GCC codes for simple
7663 binary and unary operations. */
7666 init_code_table (void)
7668 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7669 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7671 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7672 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7673 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7674 gnu_codes[N_Op_Eq] = EQ_EXPR;
7675 gnu_codes[N_Op_Ne] = NE_EXPR;
7676 gnu_codes[N_Op_Lt] = LT_EXPR;
7677 gnu_codes[N_Op_Le] = LE_EXPR;
7678 gnu_codes[N_Op_Gt] = GT_EXPR;
7679 gnu_codes[N_Op_Ge] = GE_EXPR;
7680 gnu_codes[N_Op_Add] = PLUS_EXPR;
7681 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7682 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7683 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7684 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7685 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7686 gnu_codes[N_Op_Abs] = ABS_EXPR;
7687 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7688 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7689 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7690 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7691 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7692 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7695 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7699 get_exception_label (char kind)
7701 if (kind == N_Raise_Constraint_Error)
7702 return TREE_VALUE (gnu_constraint_error_label_stack);
7703 else if (kind == N_Raise_Storage_Error)
7704 return TREE_VALUE (gnu_storage_error_label_stack);
7705 else if (kind == N_Raise_Program_Error)
7706 return TREE_VALUE (gnu_program_error_label_stack);
7711 #include "gt-ada-trans.h"