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 2, 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 COPYING. If not, write *
19 * to the Free Software Foundation, 51 Franklin Street, Fifth Floor, *
20 * Boston, MA 02110-1301, USA. *
22 * GNAT was originally developed by the GNAT team at New York University. *
23 * Extensive contributions were provided by Ada Core Technologies Inc. *
25 ****************************************************************************/
29 #include "coretypes.h"
43 #include "tree-iterator.h"
60 #include "adadecode.h"
62 #include "dwarf2out.h"
64 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
65 for fear of running out of stack space. If we need more, we use xmalloc
67 #define ALLOCA_THRESHOLD 1000
69 /* Let code below know whether we are targetting VMS without need of
70 intrusive preprocessor directives. */
71 #ifndef TARGET_ABI_OPEN_VMS
72 #define TARGET_ABI_OPEN_VMS 0
75 /* For efficient float-to-int rounding, it is necessary to know whether
76 floating-point arithmetic may use wider intermediate results. When
77 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
78 that arithmetic does not widen if double precision is emulated. */
79 #ifndef FP_ARITH_MAY_WIDEN
80 #if defined(HAVE_extendsfdf2)
81 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
83 #define FP_ARITH_MAY_WIDEN 0
87 extern char *__gnat_to_canonical_file_spec (char *);
92 struct Node *Nodes_Ptr;
93 Node_Id *Next_Node_Ptr;
94 Node_Id *Prev_Node_Ptr;
95 struct Elist_Header *Elists_Ptr;
96 struct Elmt_Item *Elmts_Ptr;
97 struct String_Entry *Strings_Ptr;
98 Char_Code *String_Chars_Ptr;
99 struct List_Header *List_Headers_Ptr;
101 /* Current filename without path. */
102 const char *ref_filename;
104 /* True when gigi is being called on an analyzed but unexpanded
105 tree, and the only purpose of the call is to properly annotate
106 types with representation information. */
107 bool type_annotate_only;
109 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
110 of unconstrained array IN parameters to avoid emitting a great deal of
111 redundant instructions to recompute them each time. */
112 struct parm_attr GTY (())
114 int id; /* GTY doesn't like Entity_Id. */
121 typedef struct parm_attr *parm_attr;
123 DEF_VEC_P(parm_attr);
124 DEF_VEC_ALLOC_P(parm_attr,gc);
126 struct language_function GTY(())
128 VEC(parm_attr,gc) *parm_attr_cache;
131 #define f_parm_attr_cache \
132 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
134 /* A structure used to gather together information about a statement group.
135 We use this to gather related statements, for example the "then" part
136 of a IF. In the case where it represents a lexical scope, we may also
137 have a BLOCK node corresponding to it and/or cleanups. */
139 struct stmt_group GTY((chain_next ("%h.previous"))) {
140 struct stmt_group *previous; /* Previous code group. */
141 tree stmt_list; /* List of statements for this code group. */
142 tree block; /* BLOCK for this code group, if any. */
143 tree cleanups; /* Cleanups for this code group, if any. */
146 static GTY(()) struct stmt_group *current_stmt_group;
148 /* List of unused struct stmt_group nodes. */
149 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
151 /* A structure used to record information on elaboration procedures
152 we've made and need to process.
154 ??? gnat_node should be Node_Id, but gengtype gets confused. */
156 struct elab_info GTY((chain_next ("%h.next"))) {
157 struct elab_info *next; /* Pointer to next in chain. */
158 tree elab_proc; /* Elaboration procedure. */
159 int gnat_node; /* The N_Compilation_Unit. */
162 static GTY(()) struct elab_info *elab_info_list;
164 /* Free list of TREE_LIST nodes used for stacks. */
165 static GTY((deletable)) tree gnu_stack_free_list;
167 /* List of TREE_LIST nodes representing a stack of exception pointer
168 variables. TREE_VALUE is the VAR_DECL that stores the address of
169 the raised exception. Nonzero means we are in an exception
170 handler. Not used in the zero-cost case. */
171 static GTY(()) tree gnu_except_ptr_stack;
173 /* List of TREE_LIST nodes used to store the current elaboration procedure
174 decl. TREE_VALUE is the decl. */
175 static GTY(()) tree gnu_elab_proc_stack;
177 /* Variable that stores a list of labels to be used as a goto target instead of
178 a return in some functions. See processing for N_Subprogram_Body. */
179 static GTY(()) tree gnu_return_label_stack;
181 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
182 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
183 static GTY(()) tree gnu_loop_label_stack;
185 /* List of TREE_LIST nodes representing labels for switch statements.
186 TREE_VALUE of each entry is the label at the end of the switch. */
187 static GTY(()) tree gnu_switch_label_stack;
189 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
190 static GTY(()) tree gnu_constraint_error_label_stack;
191 static GTY(()) tree gnu_storage_error_label_stack;
192 static GTY(()) tree gnu_program_error_label_stack;
194 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
195 static enum tree_code gnu_codes[Number_Node_Kinds];
197 /* Current node being treated, in case abort called. */
198 Node_Id error_gnat_node;
200 static void init_code_table (void);
201 static void Compilation_Unit_to_gnu (Node_Id);
202 static void record_code_position (Node_Id);
203 static void insert_code_for (Node_Id);
204 static void add_cleanup (tree, Node_Id);
205 static tree unshare_save_expr (tree *, int *, void *);
206 static void add_stmt_list (List_Id);
207 static void push_exception_label_stack (tree *, Entity_Id);
208 static tree build_stmt_group (List_Id, bool);
209 static void push_stack (tree *, tree, tree);
210 static void pop_stack (tree *);
211 static enum gimplify_status gnat_gimplify_stmt (tree *);
212 static void elaborate_all_entities (Node_Id);
213 static void process_freeze_entity (Node_Id);
214 static void process_inlined_subprograms (Node_Id);
215 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
216 static tree emit_range_check (tree, Node_Id, Node_Id);
217 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
218 static tree emit_check (tree, tree, int, Node_Id);
219 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
220 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
221 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
222 static bool smaller_packable_type_p (tree, tree);
223 static bool addressable_p (tree, tree);
224 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
225 static tree extract_values (tree, tree);
226 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
227 static tree maybe_implicit_deref (tree);
228 static tree gnat_stabilize_reference (tree, bool);
229 static tree gnat_stabilize_reference_1 (tree, bool);
230 static void set_expr_location_from_node (tree, Node_Id);
231 static int lvalue_required_p (Node_Id, tree, int);
233 /* Hooks for debug info back-ends, only supported and used in a restricted set
234 of configurations. */
235 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
236 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
238 /* This is the main program of the back-end. It sets up all the table
239 structures and then generates code. */
242 gigi (Node_Id gnat_root, int max_gnat_node, int number_name,
243 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
244 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
245 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
246 struct List_Header *list_headers_ptr, Nat number_file,
247 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
248 Entity_Id standard_integer, Entity_Id standard_long_long_float,
249 Entity_Id standard_exception_type, Int gigi_operating_mode)
251 Entity_Id gnat_literal;
252 tree long_long_float_type, exception_type, t;
253 tree int64_type = gnat_type_for_size (64, 0);
254 struct elab_info *info;
257 max_gnat_nodes = max_gnat_node;
258 number_names = number_name;
259 number_files = number_file;
260 Nodes_Ptr = nodes_ptr;
261 Next_Node_Ptr = next_node_ptr;
262 Prev_Node_Ptr = prev_node_ptr;
263 Elists_Ptr = elists_ptr;
264 Elmts_Ptr = elmts_ptr;
265 Strings_Ptr = strings_ptr;
266 String_Chars_Ptr = string_chars_ptr;
267 List_Headers_Ptr = list_headers_ptr;
269 type_annotate_only = (gigi_operating_mode == 1);
271 for (i = 0; i < number_files; i++)
273 /* Use the identifier table to make a permanent copy of the filename as
274 the name table gets reallocated after Gigi returns but before all the
275 debugging information is output. The __gnat_to_canonical_file_spec
276 call translates filenames from pragmas Source_Reference that contain
277 host style syntax not understood by gdb. */
281 (__gnat_to_canonical_file_spec
282 (Get_Name_String (file_info_ptr[i].File_Name))));
284 /* We rely on the order isomorphism between files and line maps. */
285 gcc_assert ((int) line_table->used == i);
287 /* We create the line map for a source file at once, with a fixed number
288 of columns chosen to avoid jumping over the next power of 2. */
289 linemap_add (line_table, LC_ENTER, 0, filename, 1);
290 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
291 linemap_position_for_column (line_table, 252 - 1);
292 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
295 /* Initialize ourselves. */
298 gnat_compute_largest_alignment ();
301 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
303 if (type_annotate_only)
305 TYPE_SIZE (void_type_node) = bitsize_zero_node;
306 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
309 /* If the GNU type extensions to DWARF are available, setup the hooks. */
310 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
311 /* We condition the name demangling and the generation of type encoding
312 strings on -gdwarf+ and always set descriptive types on. */
313 if (use_gnu_debug_info_extensions)
315 dwarf2out_set_type_encoding_func (extract_encoding);
316 dwarf2out_set_demangle_name_func (decode_name);
318 dwarf2out_set_descriptive_type_func (get_parallel_type);
321 /* Enable GNAT stack checking method if needed */
322 if (!Stack_Check_Probes_On_Target)
323 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
325 /* Record the builtin types. Define `integer' and `unsigned char' first so
326 that dbx will output them first. */
327 record_builtin_type ("integer", integer_type_node);
328 record_builtin_type ("unsigned char", char_type_node);
329 record_builtin_type ("long integer", long_integer_type_node);
330 unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1);
331 record_builtin_type ("unsigned int", unsigned_type_node);
332 record_builtin_type (SIZE_TYPE, sizetype);
333 record_builtin_type ("boolean", boolean_type_node);
334 record_builtin_type ("void", void_type_node);
336 /* Save the type we made for integer as the type for Standard.Integer. */
337 save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node),
340 /* Save the type we made for boolean as the type for Standard.Boolean. */
341 save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node),
343 gnat_literal = First_Literal (Base_Type (standard_boolean));
344 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
345 gcc_assert (t == boolean_false_node);
346 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
347 boolean_type_node, t, true, false, false, false,
349 DECL_IGNORED_P (t) = 1;
350 save_gnu_tree (gnat_literal, t, false);
351 gnat_literal = Next_Literal (gnat_literal);
352 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
353 gcc_assert (t == boolean_true_node);
354 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
355 boolean_type_node, t, true, false, false, false,
357 DECL_IGNORED_P (t) = 1;
358 save_gnu_tree (gnat_literal, t, false);
360 void_ftype = build_function_type (void_type_node, NULL_TREE);
361 ptr_void_ftype = build_pointer_type (void_ftype);
363 /* Now declare runtime functions. */
364 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
366 /* malloc is a function declaration tree for a function to allocate
369 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
370 build_function_type (ptr_void_type_node,
371 tree_cons (NULL_TREE,
373 NULL_TREE, false, true, true, NULL, Empty);
374 DECL_IS_MALLOC (malloc_decl) = 1;
376 /* malloc32 is a function declaration tree for a function to allocate
377 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
379 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
380 build_function_type (ptr_void_type_node,
381 tree_cons (NULL_TREE,
383 NULL_TREE, false, true, true, NULL, Empty);
384 DECL_IS_MALLOC (malloc32_decl) = 1;
386 /* free is a function declaration tree for a function to free memory. */
388 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
389 build_function_type (void_type_node,
390 tree_cons (NULL_TREE,
393 NULL_TREE, false, true, true, NULL, Empty);
395 /* This is used for 64-bit multiplication with overflow checking. */
397 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
398 build_function_type_list (int64_type, int64_type,
399 int64_type, NULL_TREE),
400 NULL_TREE, false, true, true, NULL, Empty);
402 /* Make the types and functions used for exception processing. */
404 = build_array_type (gnat_type_for_mode (Pmode, 0),
405 build_index_type (build_int_cst (NULL_TREE, 5)));
406 record_builtin_type ("JMPBUF_T", jmpbuf_type);
407 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
409 /* Functions to get and set the jumpbuf pointer for the current thread. */
411 = create_subprog_decl
412 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
413 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
414 NULL_TREE, false, true, true, NULL, Empty);
415 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
416 DECL_PURE_P (get_jmpbuf_decl) = 1;
419 = create_subprog_decl
420 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
422 build_function_type (void_type_node,
423 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
424 NULL_TREE, false, true, true, NULL, Empty);
426 /* setjmp returns an integer and has one operand, which is a pointer to
429 = create_subprog_decl
430 (get_identifier ("__builtin_setjmp"), NULL_TREE,
431 build_function_type (integer_type_node,
432 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
433 NULL_TREE, false, true, true, NULL, Empty);
435 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
436 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
438 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
440 update_setjmp_buf_decl
441 = create_subprog_decl
442 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
443 build_function_type (void_type_node,
444 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
445 NULL_TREE, false, true, true, NULL, Empty);
447 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
448 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
450 /* Hooks to call when entering/leaving an exception handler. */
452 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
453 build_function_type (void_type_node,
454 tree_cons (NULL_TREE,
457 NULL_TREE, false, true, true, NULL, Empty);
460 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
461 build_function_type (void_type_node,
462 tree_cons (NULL_TREE,
465 NULL_TREE, false, true, true, NULL, Empty);
467 /* If in no exception handlers mode, all raise statements are redirected to
468 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
469 this procedure will never be called in this mode. */
470 if (No_Exception_Handlers_Set ())
473 = create_subprog_decl
474 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
475 build_function_type (void_type_node,
476 tree_cons (NULL_TREE,
477 build_pointer_type (char_type_node),
478 tree_cons (NULL_TREE,
481 NULL_TREE, false, true, true, NULL, Empty);
483 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
484 gnat_raise_decls[i] = decl;
487 /* Otherwise, make one decl for each exception reason. */
488 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
492 sprintf (name, "__gnat_rcheck_%.2d", i);
494 = create_subprog_decl
495 (get_identifier (name), NULL_TREE,
496 build_function_type (void_type_node,
497 tree_cons (NULL_TREE,
500 tree_cons (NULL_TREE,
503 NULL_TREE, false, true, true, NULL, Empty);
506 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
508 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
509 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
510 TREE_TYPE (gnat_raise_decls[i])
511 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
515 /* Set the types that GCC and Gigi use from the front end. We would
516 like to do this for char_type_node, but it needs to correspond to
519 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
520 except_type_node = TREE_TYPE (exception_type);
522 /* Make other functions used for exception processing. */
524 = create_subprog_decl
525 (get_identifier ("system__soft_links__get_gnat_exception"),
527 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
528 NULL_TREE, false, true, true, NULL, Empty);
529 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
530 DECL_PURE_P (get_excptr_decl) = 1;
533 = create_subprog_decl
534 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
535 build_function_type (void_type_node,
536 tree_cons (NULL_TREE,
537 build_pointer_type (except_type_node),
539 NULL_TREE, false, true, true, NULL, Empty);
541 /* Indicate that these never return. */
542 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
543 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
544 TREE_TYPE (raise_nodefer_decl)
545 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
549 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
551 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
553 /* In this case, the builtin floating point types are VAX float,
554 so make up a type for use. */
555 longest_float_type_node = make_node (REAL_TYPE);
556 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
557 layout_type (longest_float_type_node);
558 record_builtin_type ("longest float type", longest_float_type_node);
561 longest_float_type_node = TREE_TYPE (long_long_float_type);
563 /* Build the special descriptor type and its null node if needed. */
564 if (TARGET_VTABLE_USES_DESCRIPTORS)
566 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
567 tree field_list = NULL_TREE, null_list = NULL_TREE;
570 fdesc_type_node = make_node (RECORD_TYPE);
572 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
574 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
575 fdesc_type_node, 0, 0, 0, 1);
576 TREE_CHAIN (field) = field_list;
578 null_list = tree_cons (field, null_node, null_list);
581 finish_record_type (fdesc_type_node, nreverse (field_list), 0, false);
582 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
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 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
624 /* Declare the name of the compilation unit as the first global
625 name in order to make the middle-end fully deterministic. */
626 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
627 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
629 /* Now translate the compilation unit proper. */
631 Compilation_Unit_to_gnu (gnat_root);
633 /* Finally see if we have any elaboration procedures to deal with. */
634 for (info = elab_info_list; info; info = info->next)
636 tree gnu_body = DECL_SAVED_TREE (info->elab_proc);
638 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
639 the gimplifier for obvious reasons, but it turns out that we need to
640 unshare them for the global level because of SAVE_EXPRs made around
641 checks for global objects and around allocators for global objects
642 of variable size, in order to prevent node sharing in the underlying
643 expression. Note that this implicitly assumes that the SAVE_EXPR
644 nodes themselves are not shared between subprograms, which would be
645 an upstream bug for which we would not change the outcome. */
646 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
648 /* Process the function as others, but for indicating this is an
649 elab proc, to be discarded if empty, then propagate the status
650 up to the GNAT tree node. */
651 begin_subprog_body (info->elab_proc);
652 end_subprog_body (gnu_body, true);
654 if (empty_body_p (gimple_body (info->elab_proc)))
655 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
658 /* We cannot track the location of errors past this point. */
659 error_gnat_node = Empty;
662 /* Return a positive value if an lvalue is required for GNAT_NODE.
663 GNU_TYPE is the type that will be used for GNAT_NODE in the
664 translated GNU tree. ALIASED indicates whether the underlying
665 object represented by GNAT_NODE is aliased in the Ada sense.
667 The function climbs up the GNAT tree starting from the node and
668 returns 1 upon encountering a node that effectively requires an
669 lvalue downstream. It returns int instead of bool to facilitate
670 usage in non purely binary logic contexts. */
673 lvalue_required_p (Node_Id gnat_node, tree gnu_type, int aliased)
675 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
677 switch (Nkind (gnat_parent))
682 case N_Attribute_Reference:
684 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
685 return id == Attr_Address
687 || id == Attr_Unchecked_Access
688 || id == Attr_Unrestricted_Access;
691 case N_Parameter_Association:
692 case N_Function_Call:
693 case N_Procedure_Call_Statement:
694 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
696 case N_Indexed_Component:
697 /* Only the array expression can require an lvalue. */
698 if (Prefix (gnat_parent) != gnat_node)
701 /* ??? Consider that referencing an indexed component with a
702 non-constant index forces the whole aggregate to memory.
703 Note that N_Integer_Literal is conservative, any static
704 expression in the RM sense could probably be accepted. */
705 for (gnat_temp = First (Expressions (gnat_parent));
707 gnat_temp = Next (gnat_temp))
708 if (Nkind (gnat_temp) != N_Integer_Literal)
711 /* ... fall through ... */
714 /* Only the array expression can require an lvalue. */
715 if (Prefix (gnat_parent) != gnat_node)
718 aliased |= Has_Aliased_Components (Etype (gnat_node));
719 return lvalue_required_p (gnat_parent, gnu_type, aliased);
721 case N_Selected_Component:
722 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
723 return lvalue_required_p (gnat_parent, gnu_type, aliased);
725 case N_Object_Renaming_Declaration:
726 /* We need to make a real renaming only if the constant object is
727 aliased or if we may use a renaming pointer; otherwise we can
728 optimize and return the rvalue. We make an exception if the object
729 is an identifier since in this case the rvalue can be propagated
730 attached to the CONST_DECL. */
732 /* This should match the constant case of the renaming code. */
733 || Is_Composite_Type (Etype (Name (gnat_parent)))
734 || Nkind (Name (gnat_parent)) == N_Identifier);
743 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
744 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
745 to where we should place the result type. */
748 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
750 Node_Id gnat_temp, gnat_temp_type;
751 tree gnu_result, gnu_result_type;
753 /* Whether we should require an lvalue for GNAT_NODE. Needed in
754 specific circumstances only, so evaluated lazily. < 0 means
755 unknown, > 0 means known true, 0 means known false. */
756 int require_lvalue = -1;
758 /* If GNAT_NODE is a constant, whether we should use the initialization
759 value instead of the constant entity, typically for scalars with an
760 address clause when the parent doesn't require an lvalue. */
761 bool use_constant_initializer = false;
763 /* If the Etype of this node does not equal the Etype of the Entity,
764 something is wrong with the entity map, probably in generic
765 instantiation. However, this does not apply to types. Since we sometime
766 have strange Ekind's, just do this test for objects. Also, if the Etype of
767 the Entity is private, the Etype of the N_Identifier is allowed to be the
768 full type and also we consider a packed array type to be the same as the
769 original type. Similarly, a class-wide type is equivalent to a subtype of
770 itself. Finally, if the types are Itypes, one may be a copy of the other,
771 which is also legal. */
772 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
773 ? gnat_node : Entity (gnat_node));
774 gnat_temp_type = Etype (gnat_temp);
776 gcc_assert (Etype (gnat_node) == gnat_temp_type
777 || (Is_Packed (gnat_temp_type)
778 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
779 || (Is_Class_Wide_Type (Etype (gnat_node)))
780 || (IN (Ekind (gnat_temp_type), Private_Kind)
781 && Present (Full_View (gnat_temp_type))
782 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
783 || (Is_Packed (Full_View (gnat_temp_type))
784 && (Etype (gnat_node)
785 == Packed_Array_Type (Full_View
786 (gnat_temp_type))))))
787 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
788 || !(Ekind (gnat_temp) == E_Variable
789 || Ekind (gnat_temp) == E_Component
790 || Ekind (gnat_temp) == E_Constant
791 || Ekind (gnat_temp) == E_Loop_Parameter
792 || IN (Ekind (gnat_temp), Formal_Kind)));
794 /* If this is a reference to a deferred constant whose partial view is an
795 unconstrained private type, the proper type is on the full view of the
796 constant, not on the full view of the type, which may be unconstrained.
798 This may be a reference to a type, for example in the prefix of the
799 attribute Position, generated for dispatching code (see Make_DT in
800 exp_disp,adb). In that case we need the type itself, not is parent,
801 in particular if it is a derived type */
802 if (Is_Private_Type (gnat_temp_type)
803 && Has_Unknown_Discriminants (gnat_temp_type)
804 && Ekind (gnat_temp) == E_Constant
805 && Present (Full_View (gnat_temp)))
807 gnat_temp = Full_View (gnat_temp);
808 gnat_temp_type = Etype (gnat_temp);
812 /* We want to use the Actual_Subtype if it has already been elaborated,
813 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
815 if ((Ekind (gnat_temp) == E_Constant
816 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
817 && !(Is_Array_Type (Etype (gnat_temp))
818 && Present (Packed_Array_Type (Etype (gnat_temp))))
819 && Present (Actual_Subtype (gnat_temp))
820 && present_gnu_tree (Actual_Subtype (gnat_temp)))
821 gnat_temp_type = Actual_Subtype (gnat_temp);
823 gnat_temp_type = Etype (gnat_node);
826 /* Expand the type of this identifier first, in case it is an enumeral
827 literal, which only get made when the type is expanded. There is no
828 order-of-elaboration issue here. */
829 gnu_result_type = get_unpadded_type (gnat_temp_type);
831 /* If this is a non-imported scalar constant with an address clause,
832 retrieve the value instead of a pointer to be dereferenced unless
833 an lvalue is required. This is generally more efficient and actually
834 required if this is a static expression because it might be used
835 in a context where a dereference is inappropriate, such as a case
836 statement alternative or a record discriminant. There is no possible
837 volatile-ness short-circuit here since Volatile constants must bei
839 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
840 && !Is_Imported (gnat_temp)
841 && Present (Address_Clause (gnat_temp)))
843 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
844 Is_Aliased (gnat_temp));
845 use_constant_initializer = !require_lvalue;
848 if (use_constant_initializer)
850 /* If this is a deferred constant, the initializer is attached to
852 if (Present (Full_View (gnat_temp)))
853 gnat_temp = Full_View (gnat_temp);
855 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
858 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
860 /* If we are in an exception handler, force this variable into memory to
861 ensure optimization does not remove stores that appear redundant but are
862 actually needed in case an exception occurs.
864 ??? Note that we need not do this if the variable is declared within the
865 handler, only if it is referenced in the handler and declared in an
866 enclosing block, but we have no way of testing that right now.
868 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
869 here, but it can now be removed by the Tree aliasing machinery if the
870 address of the variable is never taken. All we can do is to make the
871 variable volatile, which might incur the generation of temporaries just
872 to access the memory in some circumstances. This can be avoided for
873 variables of non-constant size because they are automatically allocated
874 to memory. There might be no way of allocating a proper temporary for
875 them in any case. We only do this for SJLJ though. */
876 if (TREE_VALUE (gnu_except_ptr_stack)
877 && TREE_CODE (gnu_result) == VAR_DECL
878 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
879 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
881 /* Some objects (such as parameters passed by reference, globals of
882 variable size, and renamed objects) actually represent the address
883 of the object. In that case, we must do the dereference. Likewise,
884 deal with parameters to foreign convention subprograms. */
885 if (DECL_P (gnu_result)
886 && (DECL_BY_REF_P (gnu_result)
887 || (TREE_CODE (gnu_result) == PARM_DECL
888 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
890 bool ro = DECL_POINTS_TO_READONLY_P (gnu_result);
893 if (TREE_CODE (gnu_result) == PARM_DECL
894 && DECL_BY_COMPONENT_PTR_P (gnu_result))
896 = build_unary_op (INDIRECT_REF, NULL_TREE,
897 convert (build_pointer_type (gnu_result_type),
900 /* If it's a renaming pointer and we are at the right binding level,
901 we can reference the renamed object directly, since the renamed
902 expression has been protected against multiple evaluations. */
903 else if (TREE_CODE (gnu_result) == VAR_DECL
904 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) != 0
905 && (! DECL_RENAMING_GLOBAL_P (gnu_result)
906 || global_bindings_p ()))
907 gnu_result = renamed_obj;
909 /* Return the underlying CST for a CONST_DECL like a few lines below,
910 after dereferencing in this case. */
911 else if (TREE_CODE (gnu_result) == CONST_DECL)
912 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
913 DECL_INITIAL (gnu_result));
916 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
918 TREE_READONLY (gnu_result) = TREE_STATIC (gnu_result) = ro;
921 /* The GNAT tree has the type of a function as the type of its result. Also
922 use the type of the result if the Etype is a subtype which is nominally
923 unconstrained. But remove any padding from the resulting type. */
924 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
925 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
927 gnu_result_type = TREE_TYPE (gnu_result);
928 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
929 && TYPE_IS_PADDING_P (gnu_result_type))
930 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
933 /* If we have a constant declaration and its initializer at hand,
934 try to return the latter to avoid the need to call fold in lots
935 of places and the need of elaboration code if this Id is used as
936 an initializer itself. */
937 if (TREE_CONSTANT (gnu_result)
938 && DECL_P (gnu_result)
939 && DECL_INITIAL (gnu_result))
942 = (TREE_CODE (gnu_result) == CONST_DECL
943 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
945 /* If there is a corresponding variable, we only want to return
946 the CST value if an lvalue is not required. Evaluate this
947 now if we have not already done so. */
948 if (object && require_lvalue < 0)
949 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
950 Is_Aliased (gnat_temp));
952 if (!object || !require_lvalue)
953 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
956 *gnu_result_type_p = gnu_result_type;
960 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
961 any statements we generate. */
964 Pragma_to_gnu (Node_Id gnat_node)
967 tree gnu_result = alloc_stmt_list ();
969 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
971 if (type_annotate_only
972 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
975 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
977 case Pragma_Inspection_Point:
978 /* Do nothing at top level: all such variables are already viewable. */
979 if (global_bindings_p ())
982 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
984 gnat_temp = Next (gnat_temp))
986 Node_Id gnat_expr = Expression (gnat_temp);
987 tree gnu_expr = gnat_to_gnu (gnat_expr);
989 enum machine_mode mode;
990 tree asm_constraint = NULL_TREE;
991 #ifdef ASM_COMMENT_START
995 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
996 gnu_expr = TREE_OPERAND (gnu_expr, 0);
998 /* Use the value only if it fits into a normal register,
999 otherwise use the address. */
1000 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1001 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1002 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1003 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1006 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1008 #ifdef ASM_COMMENT_START
1009 comment = concat (ASM_COMMENT_START,
1010 " inspection point: ",
1011 Get_Name_String (Chars (gnat_expr)),
1012 use_address ? " address" : "",
1015 asm_constraint = build_string (strlen (comment), comment);
1018 gnu_expr = build4 (ASM_EXPR, void_type_node,
1022 (build_tree_list (NULL_TREE,
1023 build_string (1, "g")),
1024 gnu_expr, NULL_TREE),
1026 ASM_VOLATILE_P (gnu_expr) = 1;
1027 set_expr_location_from_node (gnu_expr, gnat_node);
1028 append_to_statement_list (gnu_expr, &gnu_result);
1032 case Pragma_Optimize:
1033 switch (Chars (Expression
1034 (First (Pragma_Argument_Associations (gnat_node)))))
1036 case Name_Time: case Name_Space:
1038 post_error ("insufficient -O value?", gnat_node);
1043 post_error ("must specify -O0?", gnat_node);
1051 case Pragma_Reviewable:
1052 if (write_symbols == NO_DEBUG)
1053 post_error ("must specify -g?", gnat_node);
1060 /* Issue an error message if GNAT_NODE references an eliminated entity. */
1063 check_for_eliminated_entity (Node_Id gnat_node)
1065 switch (Nkind (gnat_node))
1068 case N_Operator_Symbol:
1069 case N_Expanded_Name:
1070 case N_Attribute_Reference:
1071 if (Is_Eliminated (Entity (gnat_node)))
1072 Eliminate_Error_Msg (gnat_node, Entity (gnat_node));
1077 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Attribute,
1078 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1079 where we should place the result type. ATTRIBUTE is the attribute ID. */
1082 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1084 tree gnu_result = error_mark_node;
1085 tree gnu_result_type;
1087 bool prefix_unused = false;
1088 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1089 tree gnu_type = TREE_TYPE (gnu_prefix);
1091 /* If the input is a NULL_EXPR, make a new one. */
1092 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1094 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
1095 return build1 (NULL_EXPR, *gnu_result_type_p,
1096 TREE_OPERAND (gnu_prefix, 0));
1103 /* These are just conversions until since representation clauses for
1104 enumerations are handled in the front end. */
1106 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1108 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1109 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1110 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1111 checkp, checkp, true, gnat_node);
1117 /* These just add or subject the constant 1. Representation clauses for
1118 enumerations are handled in the front-end. */
1119 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1120 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1122 if (Do_Range_Check (First (Expressions (gnat_node))))
1124 gnu_expr = protect_multiple_eval (gnu_expr);
1127 (build_binary_op (EQ_EXPR, integer_type_node,
1129 attribute == Attr_Pred
1130 ? TYPE_MIN_VALUE (gnu_result_type)
1131 : TYPE_MAX_VALUE (gnu_result_type)),
1132 gnu_expr, CE_Range_Check_Failed, gnat_node);
1136 = build_binary_op (attribute == Attr_Pred
1137 ? MINUS_EXPR : PLUS_EXPR,
1138 gnu_result_type, gnu_expr,
1139 convert (gnu_result_type, integer_one_node));
1143 case Attr_Unrestricted_Access:
1144 /* Conversions don't change something's address but can cause us to miss
1145 the COMPONENT_REF case below, so strip them off. */
1146 gnu_prefix = remove_conversions (gnu_prefix,
1147 !Must_Be_Byte_Aligned (gnat_node));
1149 /* If we are taking 'Address of an unconstrained object, this is the
1150 pointer to the underlying array. */
1151 if (attribute == Attr_Address)
1152 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1154 /* If we are building a static dispatch table, we have to honor
1155 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1156 with the C++ ABI. We do it in the non-static case as well,
1157 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1158 else if (TARGET_VTABLE_USES_DESCRIPTORS
1159 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1161 tree gnu_field, gnu_list = NULL_TREE, t;
1162 /* Descriptors can only be built here for top-level functions. */
1163 bool build_descriptor = (global_bindings_p () != 0);
1166 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1168 /* If we're not going to build the descriptor, we have to retrieve
1169 the one which will be built by the linker (or by the compiler
1170 later if a static chain is requested). */
1171 if (!build_descriptor)
1173 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1174 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1176 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1179 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1180 i < TARGET_VTABLE_USES_DESCRIPTORS;
1181 gnu_field = TREE_CHAIN (gnu_field), i++)
1183 if (build_descriptor)
1185 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1186 build_int_cst (NULL_TREE, i));
1187 TREE_CONSTANT (t) = 1;
1190 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1191 gnu_field, NULL_TREE);
1193 gnu_list = tree_cons (gnu_field, t, gnu_list);
1196 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1200 /* ... fall through ... */
1203 case Attr_Unchecked_Access:
1204 case Attr_Code_Address:
1205 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1207 = build_unary_op (((attribute == Attr_Address
1208 || attribute == Attr_Unrestricted_Access)
1209 && !Must_Be_Byte_Aligned (gnat_node))
1210 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1211 gnu_result_type, gnu_prefix);
1213 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1214 don't try to build a trampoline. */
1215 if (attribute == Attr_Code_Address)
1217 check_for_eliminated_entity (Prefix (gnat_node));
1219 for (gnu_expr = gnu_result;
1220 CONVERT_EXPR_P (gnu_expr);
1221 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1222 TREE_CONSTANT (gnu_expr) = 1;
1224 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1225 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1228 /* For other address attributes applied to a nested function,
1229 find an inner ADDR_EXPR and annotate it so that we can issue
1230 a useful warning with -Wtrampolines. */
1231 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1233 check_for_eliminated_entity (Prefix (gnat_node));
1235 for (gnu_expr = gnu_result;
1236 CONVERT_EXPR_P (gnu_expr);
1237 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1240 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1241 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1243 set_expr_location_from_node (gnu_expr, gnat_node);
1245 /* Check that we're not violating the No_Implicit_Dynamic_Code
1246 restriction. Be conservative if we don't know anything
1247 about the trampoline strategy for the target. */
1248 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1253 case Attr_Pool_Address:
1256 tree gnu_ptr = gnu_prefix;
1258 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1260 /* If this is an unconstrained array, we know the object must have been
1261 allocated with the template in front of the object. So compute the
1263 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1265 = convert (build_pointer_type
1266 (TYPE_OBJECT_RECORD_TYPE
1267 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1270 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1271 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1272 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1274 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1275 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1276 tree gnu_byte_offset
1277 = convert (sizetype,
1278 size_diffop (size_zero_node, gnu_pos));
1279 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1281 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1282 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1283 gnu_ptr, gnu_byte_offset);
1286 gnu_result = convert (gnu_result_type, gnu_ptr);
1291 case Attr_Object_Size:
1292 case Attr_Value_Size:
1293 case Attr_Max_Size_In_Storage_Elements:
1294 gnu_expr = gnu_prefix;
1296 /* Remove NOPS from gnu_expr and conversions from gnu_prefix.
1297 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1298 while (TREE_CODE (gnu_expr) == NOP_EXPR)
1299 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1301 gnu_prefix = remove_conversions (gnu_prefix, true);
1302 prefix_unused = true;
1303 gnu_type = TREE_TYPE (gnu_prefix);
1305 /* Replace an unconstrained array type with the type of the underlying
1306 array. We can't do this with a call to maybe_unconstrained_array
1307 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1308 use the record type that will be used to allocate the object and its
1310 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1312 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1313 if (attribute != Attr_Max_Size_In_Storage_Elements)
1314 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1317 /* If we're looking for the size of a field, return the field size.
1318 Otherwise, if the prefix is an object, or if 'Object_Size or
1319 'Max_Size_In_Storage_Elements has been specified, the result is the
1320 GCC size of the type. Otherwise, the result is the RM_Size of the
1322 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1323 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1324 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1325 || attribute == Attr_Object_Size
1326 || attribute == Attr_Max_Size_In_Storage_Elements)
1328 /* If this is a padded type, the GCC size isn't relevant to the
1329 programmer. Normally, what we want is the RM_Size, which was set
1330 from the specified size, but if it was not set, we want the size
1331 of the relevant field. Using the MAX of those two produces the
1332 right result in all case. Don't use the size of the field if it's
1333 a self-referential type, since that's never what's wanted. */
1334 if (TREE_CODE (gnu_type) == RECORD_TYPE
1335 && TYPE_IS_PADDING_P (gnu_type)
1336 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1338 gnu_result = rm_size (gnu_type);
1339 if (!(CONTAINS_PLACEHOLDER_P
1340 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))))
1342 = size_binop (MAX_EXPR, gnu_result,
1343 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1345 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1347 Node_Id gnat_deref = Prefix (gnat_node);
1348 Node_Id gnat_actual_subtype
1349 = Actual_Designated_Subtype (gnat_deref);
1351 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1353 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1354 && Present (gnat_actual_subtype))
1356 tree gnu_actual_obj_type
1357 = gnat_to_gnu_type (gnat_actual_subtype);
1359 = build_unc_object_type_from_ptr (gnu_ptr_type,
1360 gnu_actual_obj_type,
1361 get_identifier ("SIZE"));
1364 gnu_result = TYPE_SIZE (gnu_type);
1367 gnu_result = TYPE_SIZE (gnu_type);
1370 gnu_result = rm_size (gnu_type);
1372 gcc_assert (gnu_result);
1374 /* Deal with a self-referential size by returning the maximum size for a
1375 type and by qualifying the size with the object for 'Size of an
1377 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1379 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1380 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1382 gnu_result = max_size (gnu_result, true);
1385 /* If the type contains a template, subtract its size. */
1386 if (TREE_CODE (gnu_type) == RECORD_TYPE
1387 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1388 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1389 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1391 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1393 if (attribute == Attr_Max_Size_In_Storage_Elements)
1394 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1395 gnu_result, bitsize_unit_node);
1398 case Attr_Alignment:
1399 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1400 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1402 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1403 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1405 gnu_type = TREE_TYPE (gnu_prefix);
1406 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1407 prefix_unused = true;
1409 gnu_result = size_int ((TREE_CODE (gnu_prefix) == COMPONENT_REF
1410 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1))
1411 : TYPE_ALIGN (gnu_type)) / BITS_PER_UNIT);
1416 case Attr_Range_Length:
1417 prefix_unused = true;
1419 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1421 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1423 if (attribute == Attr_First)
1424 gnu_result = TYPE_MIN_VALUE (gnu_type);
1425 else if (attribute == Attr_Last)
1426 gnu_result = TYPE_MAX_VALUE (gnu_type);
1430 (MAX_EXPR, get_base_type (gnu_result_type),
1432 (PLUS_EXPR, get_base_type (gnu_result_type),
1433 build_binary_op (MINUS_EXPR,
1434 get_base_type (gnu_result_type),
1435 convert (gnu_result_type,
1436 TYPE_MAX_VALUE (gnu_type)),
1437 convert (gnu_result_type,
1438 TYPE_MIN_VALUE (gnu_type))),
1439 convert (gnu_result_type, integer_one_node)),
1440 convert (gnu_result_type, integer_zero_node));
1445 /* ... fall through ... */
1449 int Dimension = (Present (Expressions (gnat_node))
1450 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1452 struct parm_attr *pa = NULL;
1453 Entity_Id gnat_param = Empty;
1455 /* Make sure any implicit dereference gets done. */
1456 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1457 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1458 /* We treat unconstrained array In parameters specially. */
1459 if (Nkind (Prefix (gnat_node)) == N_Identifier
1460 && !Is_Constrained (Etype (Prefix (gnat_node)))
1461 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1462 gnat_param = Entity (Prefix (gnat_node));
1463 gnu_type = TREE_TYPE (gnu_prefix);
1464 prefix_unused = true;
1465 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1467 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1472 for (ndim = 1, gnu_type_temp = gnu_type;
1473 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1474 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1475 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1478 Dimension = ndim + 1 - Dimension;
1481 for (i = 1; i < Dimension; i++)
1482 gnu_type = TREE_TYPE (gnu_type);
1484 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1486 /* When not optimizing, look up the slot associated with the parameter
1487 and the dimension in the cache and create a new one on failure. */
1488 if (!optimize && Present (gnat_param))
1490 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1491 if (pa->id == gnat_param && pa->dim == Dimension)
1496 pa = GGC_CNEW (struct parm_attr);
1497 pa->id = gnat_param;
1498 pa->dim = Dimension;
1499 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1503 /* Return the cached expression or build a new one. */
1504 if (attribute == Attr_First)
1506 if (pa && pa->first)
1508 gnu_result = pa->first;
1513 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1516 else if (attribute == Attr_Last)
1520 gnu_result = pa->last;
1525 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1528 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1530 if (pa && pa->length)
1532 gnu_result = pa->length;
1537 /* We used to compute the length as max (hb - lb + 1, 0),
1538 which could overflow for some cases of empty arrays, e.g.
1539 when lb == index_type'first. We now compute the length as
1540 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1541 much rarer cases, for extremely large arrays we expect
1542 never to encounter in practice. In addition, the former
1543 computation required the use of potentially constraining
1544 signed arithmetic while the latter doesn't. Note that the
1545 comparison must be done in the original index base type,
1546 otherwise the conversion of either bound to gnu_compute_type
1549 tree gnu_compute_type = get_base_type (gnu_result_type);
1552 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1554 = convert (gnu_compute_type, TYPE_MIN_VALUE (index_type));
1556 = convert (gnu_compute_type, TYPE_MAX_VALUE (index_type));
1560 (COND_EXPR, gnu_compute_type,
1561 build_binary_op (LT_EXPR, get_base_type (index_type),
1562 TYPE_MAX_VALUE (index_type),
1563 TYPE_MIN_VALUE (index_type)),
1564 convert (gnu_compute_type, integer_zero_node),
1566 (PLUS_EXPR, gnu_compute_type,
1567 build_binary_op (MINUS_EXPR, gnu_compute_type, hb, lb),
1568 convert (gnu_compute_type, integer_one_node)));
1572 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1573 handling. Note that these attributes could not have been used on
1574 an unconstrained array type. */
1575 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result,
1578 /* Cache the expression we have just computed. Since we want to do it
1579 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1580 create the temporary. */
1584 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1585 TREE_SIDE_EFFECTS (gnu_result) = 1;
1586 if (attribute == Attr_First)
1587 pa->first = gnu_result;
1588 else if (attribute == Attr_Last)
1589 pa->last = gnu_result;
1591 pa->length = gnu_result;
1596 case Attr_Bit_Position:
1598 case Attr_First_Bit:
1602 HOST_WIDE_INT bitsize;
1603 HOST_WIDE_INT bitpos;
1605 tree gnu_field_bitpos;
1606 tree gnu_field_offset;
1608 enum machine_mode mode;
1609 int unsignedp, volatilep;
1611 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1612 gnu_prefix = remove_conversions (gnu_prefix, true);
1613 prefix_unused = true;
1615 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1616 the result is 0. Don't allow 'Bit on a bare component, though. */
1617 if (attribute == Attr_Bit
1618 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1619 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1621 gnu_result = integer_zero_node;
1626 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1627 || (attribute == Attr_Bit_Position
1628 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1630 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1631 &mode, &unsignedp, &volatilep, false);
1633 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1635 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1636 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1638 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1639 TREE_CODE (gnu_inner) == COMPONENT_REF
1640 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1641 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1644 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1645 bit_position (TREE_OPERAND (gnu_inner, 1)));
1647 = size_binop (PLUS_EXPR, gnu_field_offset,
1648 byte_position (TREE_OPERAND (gnu_inner, 1)));
1651 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1653 gnu_field_bitpos = bit_position (gnu_prefix);
1654 gnu_field_offset = byte_position (gnu_prefix);
1658 gnu_field_bitpos = bitsize_zero_node;
1659 gnu_field_offset = size_zero_node;
1665 gnu_result = gnu_field_offset;
1668 case Attr_First_Bit:
1670 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1674 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1675 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1676 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1677 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1681 case Attr_Bit_Position:
1682 gnu_result = gnu_field_bitpos;
1686 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1688 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1695 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1696 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1698 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1699 gnu_result = build_binary_op (attribute == Attr_Min
1700 ? MIN_EXPR : MAX_EXPR,
1701 gnu_result_type, gnu_lhs, gnu_rhs);
1705 case Attr_Passed_By_Reference:
1706 gnu_result = size_int (default_pass_by_ref (gnu_type)
1707 || must_pass_by_ref (gnu_type));
1708 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1711 case Attr_Component_Size:
1712 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1713 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1715 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1716 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1718 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1719 gnu_type = TREE_TYPE (gnu_prefix);
1721 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1722 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1724 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1725 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1726 gnu_type = TREE_TYPE (gnu_type);
1728 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1730 /* Note this size cannot be self-referential. */
1731 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1732 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1733 prefix_unused = true;
1736 case Attr_Null_Parameter:
1737 /* This is just a zero cast to the pointer type for
1738 our prefix and dereferenced. */
1739 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1741 = build_unary_op (INDIRECT_REF, NULL_TREE,
1742 convert (build_pointer_type (gnu_result_type),
1743 integer_zero_node));
1744 TREE_PRIVATE (gnu_result) = 1;
1747 case Attr_Mechanism_Code:
1750 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1752 prefix_unused = true;
1753 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1754 if (Present (Expressions (gnat_node)))
1756 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1758 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1759 i--, gnat_obj = Next_Formal (gnat_obj))
1763 code = Mechanism (gnat_obj);
1764 if (code == Default)
1765 code = ((present_gnu_tree (gnat_obj)
1766 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1767 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1769 && (DECL_BY_COMPONENT_PTR_P
1770 (get_gnu_tree (gnat_obj))))))
1771 ? By_Reference : By_Copy);
1772 gnu_result = convert (gnu_result_type, size_int (- code));
1777 /* Say we have an unimplemented attribute. Then set the value to be
1778 returned to be a zero and hope that's something we can convert to the
1779 type of this attribute. */
1780 post_error ("unimplemented attribute", gnat_node);
1781 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1782 gnu_result = integer_zero_node;
1786 /* If this is an attribute where the prefix was unused, force a use of it if
1787 it has a side-effect. But don't do it if the prefix is just an entity
1788 name. However, if an access check is needed, we must do it. See second
1789 example in AARM 11.6(5.e). */
1790 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1791 && !Is_Entity_Name (Prefix (gnat_node)))
1792 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1793 gnu_prefix, gnu_result);
1795 *gnu_result_type_p = gnu_result_type;
1799 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1800 to a GCC tree, which is returned. */
1803 Case_Statement_to_gnu (Node_Id gnat_node)
1809 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1810 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1812 /* The range of values in a case statement is determined by the rules in
1813 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1814 of the expression. One exception arises in the case of a simple name that
1815 is parenthesized. This still has the Etype of the name, but since it is
1816 not a name, para 7 does not apply, and we need to go to the base type.
1817 This is the only case where parenthesization affects the dynamic
1818 semantics (i.e. the range of possible values at runtime that is covered
1819 by the others alternative.
1821 Another exception is if the subtype of the expression is non-static. In
1822 that case, we also have to use the base type. */
1823 if (Paren_Count (Expression (gnat_node)) != 0
1824 || !Is_OK_Static_Subtype (Underlying_Type
1825 (Etype (Expression (gnat_node)))))
1826 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1828 /* We build a SWITCH_EXPR that contains the code with interspersed
1829 CASE_LABEL_EXPRs for each label. */
1831 push_stack (&gnu_switch_label_stack, NULL_TREE, create_artificial_label ());
1832 start_stmt_group ();
1833 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1834 Present (gnat_when);
1835 gnat_when = Next_Non_Pragma (gnat_when))
1837 Node_Id gnat_choice;
1838 int choices_added = 0;
1840 /* First compile all the different case choices for the current WHEN
1842 for (gnat_choice = First (Discrete_Choices (gnat_when));
1843 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1845 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1847 switch (Nkind (gnat_choice))
1850 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1851 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1854 case N_Subtype_Indication:
1855 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1856 (Constraint (gnat_choice))));
1857 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1858 (Constraint (gnat_choice))));
1862 case N_Expanded_Name:
1863 /* This represents either a subtype range or a static value of
1864 some kind; Ekind says which. */
1865 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1867 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1869 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1870 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1874 /* ... fall through ... */
1876 case N_Character_Literal:
1877 case N_Integer_Literal:
1878 gnu_low = gnat_to_gnu (gnat_choice);
1881 case N_Others_Choice:
1888 /* If the case value is a subtype that raises Constraint_Error at
1889 run-time because of a wrong bound, then gnu_low or gnu_high is
1890 not translated into an INTEGER_CST. In such a case, we need
1891 to ensure that the when statement is not added in the tree,
1892 otherwise it will crash the gimplifier. */
1893 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1894 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1896 add_stmt_with_node (build3 (CASE_LABEL_EXPR, void_type_node,
1898 create_artificial_label ()),
1904 /* Push a binding level here in case variables are declared as we want
1905 them to be local to this set of statements instead of to the block
1906 containing the Case statement. */
1907 if (choices_added > 0)
1909 add_stmt (build_stmt_group (Statements (gnat_when), true));
1910 add_stmt (build1 (GOTO_EXPR, void_type_node,
1911 TREE_VALUE (gnu_switch_label_stack)));
1915 /* Now emit a definition of the label all the cases branched to. */
1916 add_stmt (build1 (LABEL_EXPR, void_type_node,
1917 TREE_VALUE (gnu_switch_label_stack)));
1918 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1919 end_stmt_group (), NULL_TREE);
1920 pop_stack (&gnu_switch_label_stack);
1925 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1926 to a GCC tree, which is returned. */
1929 Loop_Statement_to_gnu (Node_Id gnat_node)
1931 /* ??? It would be nice to use "build" here, but there's no build5. */
1932 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1933 NULL_TREE, NULL_TREE, NULL_TREE);
1934 tree gnu_loop_var = NULL_TREE;
1935 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1936 tree gnu_cond_expr = NULL_TREE;
1939 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1940 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1941 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label ();
1942 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1943 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1944 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1946 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1947 N_Exit_Statement can find it. */
1948 push_stack (&gnu_loop_label_stack, NULL_TREE,
1949 LOOP_STMT_LABEL (gnu_loop_stmt));
1951 /* Set the condition under which the loop must keep going.
1952 For the case "LOOP .... END LOOP;" the condition is always true. */
1953 if (No (gnat_iter_scheme))
1956 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1957 else if (Present (Condition (gnat_iter_scheme)))
1958 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1959 = gnat_to_gnu (Condition (gnat_iter_scheme));
1961 /* Otherwise we have an iteration scheme and the condition is given by
1962 the bounds of the subtype of the iteration variable. */
1965 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1966 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1967 Entity_Id gnat_type = Etype (gnat_loop_var);
1968 tree gnu_type = get_unpadded_type (gnat_type);
1969 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1970 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1971 tree gnu_first, gnu_last, gnu_limit;
1972 enum tree_code update_code, end_code;
1973 tree gnu_base_type = get_base_type (gnu_type);
1975 /* We must disable modulo reduction for the loop variable, if any,
1976 in order for the loop comparison to be effective. */
1977 if (Reverse_Present (gnat_loop_spec))
1979 gnu_first = gnu_high;
1981 update_code = MINUS_NOMOD_EXPR;
1983 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
1987 gnu_first = gnu_low;
1988 gnu_last = gnu_high;
1989 update_code = PLUS_NOMOD_EXPR;
1991 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
1994 /* We know the loop variable will not overflow if GNU_LAST is a constant
1995 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1996 the limit test to the end of the loop. In that case, we have to test
1997 for an empty loop outside the loop. */
1998 if (TREE_CODE (gnu_last) != INTEGER_CST
1999 || TREE_CODE (gnu_limit) != INTEGER_CST
2000 || tree_int_cst_equal (gnu_last, gnu_limit))
2003 = build3 (COND_EXPR, void_type_node,
2004 build_binary_op (LE_EXPR, integer_type_node,
2006 NULL_TREE, alloc_stmt_list ());
2007 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2010 /* Open a new nesting level that will surround the loop to declare the
2011 loop index variable. */
2012 start_stmt_group ();
2015 /* Declare the loop index and set it to its initial value. */
2016 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2017 if (DECL_BY_REF_P (gnu_loop_var))
2018 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2020 /* The loop variable might be a padded type, so use `convert' to get a
2021 reference to the inner variable if so. */
2022 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2024 /* Set either the top or bottom exit condition as appropriate depending
2025 on whether or not we know an overflow cannot occur. */
2027 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2028 = build_binary_op (NE_EXPR, integer_type_node,
2029 gnu_loop_var, gnu_last);
2031 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2032 = build_binary_op (end_code, integer_type_node,
2033 gnu_loop_var, gnu_last);
2035 LOOP_STMT_UPDATE (gnu_loop_stmt)
2036 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2038 build_binary_op (update_code,
2039 TREE_TYPE (gnu_loop_var),
2041 convert (TREE_TYPE (gnu_loop_var),
2042 integer_one_node)));
2043 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2047 /* If the loop was named, have the name point to this loop. In this case,
2048 the association is not a ..._DECL node, but the end label from this
2050 if (Present (Identifier (gnat_node)))
2051 save_gnu_tree (Entity (Identifier (gnat_node)),
2052 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2054 /* Make the loop body into its own block, so any allocated storage will be
2055 released every iteration. This is needed for stack allocation. */
2056 LOOP_STMT_BODY (gnu_loop_stmt)
2057 = build_stmt_group (Statements (gnat_node), true);
2059 /* If we declared a variable, then we are in a statement group for that
2060 declaration. Add the LOOP_STMT to it and make that the "loop". */
2063 add_stmt (gnu_loop_stmt);
2065 gnu_loop_stmt = end_stmt_group ();
2068 /* If we have an outer COND_EXPR, that's our result and this loop is its
2069 "true" statement. Otherwise, the result is the LOOP_STMT. */
2072 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2073 gnu_result = gnu_cond_expr;
2074 recalculate_side_effects (gnu_cond_expr);
2077 gnu_result = gnu_loop_stmt;
2079 pop_stack (&gnu_loop_label_stack);
2084 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2085 handler for the current function. */
2087 /* This is implemented by issuing a call to the appropriate VMS specific
2088 builtin. To avoid having VMS specific sections in the global gigi decls
2089 array, we maintain the decls of interest here. We can't declare them
2090 inside the function because we must mark them never to be GC'd, which we
2091 can only do at the global level. */
2093 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2094 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2097 establish_gnat_vms_condition_handler (void)
2099 tree establish_stmt;
2101 /* Elaborate the required decls on the first call. Check on the decl for
2102 the gnat condition handler to decide, as this is one we create so we are
2103 sure that it will be non null on subsequent calls. The builtin decl is
2104 looked up so remains null on targets where it is not implemented yet. */
2105 if (gnat_vms_condition_handler_decl == NULL_TREE)
2107 vms_builtin_establish_handler_decl
2109 (get_identifier ("__builtin_establish_vms_condition_handler"));
2111 gnat_vms_condition_handler_decl
2112 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2114 build_function_type_list (integer_type_node,
2118 NULL_TREE, 0, 1, 1, 0, Empty);
2120 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2121 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2124 /* Do nothing if the establish builtin is not available, which might happen
2125 on targets where the facility is not implemented. */
2126 if (vms_builtin_establish_handler_decl == NULL_TREE)
2130 = build_call_1_expr (vms_builtin_establish_handler_decl,
2132 (ADDR_EXPR, NULL_TREE,
2133 gnat_vms_condition_handler_decl));
2135 add_stmt (establish_stmt);
2138 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2139 don't return anything. */
2142 Subprogram_Body_to_gnu (Node_Id gnat_node)
2144 /* Defining identifier of a parameter to the subprogram. */
2145 Entity_Id gnat_param;
2146 /* The defining identifier for the subprogram body. Note that if a
2147 specification has appeared before for this body, then the identifier
2148 occurring in that specification will also be a defining identifier and all
2149 the calls to this subprogram will point to that specification. */
2150 Entity_Id gnat_subprog_id
2151 = (Present (Corresponding_Spec (gnat_node))
2152 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2153 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2154 tree gnu_subprog_decl;
2155 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2156 tree gnu_subprog_type;
2159 VEC(parm_attr,gc) *cache;
2161 /* If this is a generic object or if it has been eliminated,
2163 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2164 || Ekind (gnat_subprog_id) == E_Generic_Function
2165 || Is_Eliminated (gnat_subprog_id))
2168 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2169 the already-elaborated tree node. However, if this subprogram had its
2170 elaboration deferred, we will already have made a tree node for it. So
2171 treat it as not being defined in that case. Such a subprogram cannot
2172 have an address clause or a freeze node, so this test is safe, though it
2173 does disable some otherwise-useful error checking. */
2175 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2176 Acts_As_Spec (gnat_node)
2177 && !present_gnu_tree (gnat_subprog_id));
2179 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2181 /* Propagate the debug mode. */
2182 if (!Needs_Debug_Info (gnat_subprog_id))
2183 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2185 /* Set the line number in the decl to correspond to that of the body so that
2186 the line number notes are written correctly. */
2187 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2189 /* Initialize the information structure for the function. */
2190 allocate_struct_function (gnu_subprog_decl, false);
2191 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2192 = GGC_CNEW (struct language_function);
2194 begin_subprog_body (gnu_subprog_decl);
2195 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2197 /* If there are Out parameters, we need to ensure that the return statement
2198 properly copies them out. We do this by making a new block and converting
2199 any inner return into a goto to a label at the end of the block. */
2200 push_stack (&gnu_return_label_stack, NULL_TREE,
2201 gnu_cico_list ? create_artificial_label () : NULL_TREE);
2203 /* Get a tree corresponding to the code for the subprogram. */
2204 start_stmt_group ();
2207 /* See if there are any parameters for which we don't yet have GCC entities.
2208 These must be for Out parameters for which we will be making VAR_DECL
2209 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2210 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2211 the order of the parameters. */
2212 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2213 Present (gnat_param);
2214 gnat_param = Next_Formal_With_Extras (gnat_param))
2215 if (!present_gnu_tree (gnat_param))
2217 /* Skip any entries that have been already filled in; they must
2218 correspond to In Out parameters. */
2219 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2220 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2223 /* Do any needed references for padded types. */
2224 TREE_VALUE (gnu_cico_list)
2225 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2226 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2229 /* On VMS, establish our condition handler to possibly turn a condition into
2230 the corresponding exception if the subprogram has a foreign convention or
2233 To ensure proper execution of local finalizations on condition instances,
2234 we must turn a condition into the corresponding exception even if there
2235 is no applicable Ada handler, and need at least one condition handler per
2236 possible call chain involving GNAT code. OTOH, establishing the handler
2237 has a cost so we want to minimize the number of subprograms into which
2238 this happens. The foreign or exported condition is expected to satisfy
2239 all the constraints. */
2240 if (TARGET_ABI_OPEN_VMS
2241 && (Has_Foreign_Convention (gnat_subprog_id)
2242 || Is_Exported (gnat_subprog_id)))
2243 establish_gnat_vms_condition_handler ();
2245 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2247 /* Generate the code of the subprogram itself. A return statement will be
2248 present and any Out parameters will be handled there. */
2249 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2251 gnu_result = end_stmt_group ();
2253 /* If we populated the parameter attributes cache, we need to make sure
2254 that the cached expressions are evaluated on all possible paths. */
2255 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2258 struct parm_attr *pa;
2261 start_stmt_group ();
2263 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2266 add_stmt_with_node (pa->first, gnat_node);
2268 add_stmt_with_node (pa->last, gnat_node);
2270 add_stmt_with_node (pa->length, gnat_node);
2273 add_stmt (gnu_result);
2274 gnu_result = end_stmt_group ();
2277 /* If we made a special return label, we need to make a block that contains
2278 the definition of that label and the copying to the return value. That
2279 block first contains the function, then the label and copy statement. */
2280 if (TREE_VALUE (gnu_return_label_stack))
2284 start_stmt_group ();
2286 add_stmt (gnu_result);
2287 add_stmt (build1 (LABEL_EXPR, void_type_node,
2288 TREE_VALUE (gnu_return_label_stack)));
2290 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2291 if (list_length (gnu_cico_list) == 1)
2292 gnu_retval = TREE_VALUE (gnu_cico_list);
2294 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2297 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2298 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2301 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2302 End_Label (Handled_Statement_Sequence (gnat_node)));
2304 gnu_result = end_stmt_group ();
2307 pop_stack (&gnu_return_label_stack);
2309 /* Set the end location. */
2311 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2312 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2313 : Sloc (gnat_node)),
2314 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2316 end_subprog_body (gnu_result, false);
2318 /* Disconnect the trees for parameters that we made variables for from the
2319 GNAT entities since these are unusable after we end the function. */
2320 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2321 Present (gnat_param);
2322 gnat_param = Next_Formal_With_Extras (gnat_param))
2323 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2324 save_gnu_tree (gnat_param, NULL_TREE, false);
2326 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2327 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2329 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2332 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2333 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2334 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2335 If GNU_TARGET is non-null, this must be a function call and the result
2336 of the call is to be placed into that object. */
2339 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2342 /* The GCC node corresponding to the GNAT subprogram name. This can either
2343 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2344 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2346 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2347 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2348 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2349 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2351 Entity_Id gnat_formal;
2352 Node_Id gnat_actual;
2353 tree gnu_actual_list = NULL_TREE;
2354 tree gnu_name_list = NULL_TREE;
2355 tree gnu_before_list = NULL_TREE;
2356 tree gnu_after_list = NULL_TREE;
2357 tree gnu_subprog_call;
2359 check_for_eliminated_entity (Name (gnat_node));
2361 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2363 /* If we are calling a stubbed function, make this into a raise of
2364 Program_Error. Elaborate all our args first. */
2365 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2366 && DECL_STUBBED_P (gnu_subprog_node))
2368 for (gnat_actual = First_Actual (gnat_node);
2369 Present (gnat_actual);
2370 gnat_actual = Next_Actual (gnat_actual))
2371 add_stmt (gnat_to_gnu (gnat_actual));
2375 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2376 N_Raise_Program_Error);
2378 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2380 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2381 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2388 /* If we are calling by supplying a pointer to a target, set up that
2389 pointer as the first argument. Use GNU_TARGET if one was passed;
2390 otherwise, make a target by building a variable of the maximum size
2392 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2394 tree gnu_real_ret_type
2395 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2400 = maybe_pad_type (gnu_real_ret_type,
2401 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2402 0, Etype (Name (gnat_node)), "PAD", false,
2405 /* ??? We may be about to create a static temporary if we happen to
2406 be at the global binding level. That's a regression from what
2407 the 3.x back-end would generate in the same situation, but we
2408 don't have a mechanism in Gigi for creating automatic variables
2409 in the elaboration routines. */
2411 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2412 NULL, false, false, false, false, NULL,
2417 = tree_cons (NULL_TREE,
2418 build_unary_op (ADDR_EXPR, NULL_TREE,
2419 unchecked_convert (gnu_real_ret_type,
2426 /* The only way we can be making a call via an access type is if Name is an
2427 explicit dereference. In that case, get the list of formal args from the
2428 type the access type is pointing to. Otherwise, get the formals from
2429 entity being called. */
2430 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2431 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2432 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2433 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2436 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2438 /* Create the list of the actual parameters as GCC expects it, namely a chain
2439 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2440 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2441 parameters not passed by reference and don't need to be copied in. */
2442 for (gnat_actual = First_Actual (gnat_node);
2443 Present (gnat_actual);
2444 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2445 gnat_actual = Next_Actual (gnat_actual))
2448 = (present_gnu_tree (gnat_formal)
2449 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2450 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2451 /* We must suppress conversions that can cause the creation of a
2452 temporary in the Out or In Out case because we need the real
2453 object in this case, either to pass its address if it's passed
2454 by reference or as target of the back copy done after the call
2455 if it uses the copy-in copy-out mechanism. We do it in the In
2456 case too, except for an unchecked conversion because it alone
2457 can cause the actual to be misaligned and the addressability
2458 test is applied to the real object. */
2459 bool suppress_type_conversion
2460 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2461 && Ekind (gnat_formal) != E_In_Parameter)
2462 || (Nkind (gnat_actual) == N_Type_Conversion
2463 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2464 Node_Id gnat_name = (suppress_type_conversion
2465 ? Expression (gnat_actual) : gnat_actual);
2466 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2469 /* If it's possible we may need to use this expression twice, make sure
2470 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2471 to force side-effects before the call.
2472 ??? This is more conservative than we need since we don't need to do
2473 this for pass-by-ref with no conversion. */
2474 if (Ekind (gnat_formal) != E_In_Parameter)
2475 gnu_name = gnat_stabilize_reference (gnu_name, true);
2477 /* If we are passing a non-addressable parameter by reference, pass the
2478 address of a copy. In the Out or In Out case, set up to copy back
2479 out after the call. */
2481 && (DECL_BY_REF_P (gnu_formal)
2482 || (TREE_CODE (gnu_formal) == PARM_DECL
2483 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2484 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2485 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2486 && !addressable_p (gnu_name, gnu_name_type))
2488 tree gnu_copy = gnu_name, gnu_temp;
2490 /* If the type is by_reference, a copy is not allowed. */
2491 if (Is_By_Reference_Type (Etype (gnat_formal)))
2493 ("misaligned actual cannot be passed by reference", gnat_actual);
2495 /* For users of Starlet we issue a warning because the
2496 interface apparently assumes that by-ref parameters
2497 outlive the procedure invocation. The code still
2498 will not work as intended, but we cannot do much
2499 better since other low-level parts of the back-end
2500 would allocate temporaries at will because of the
2501 misalignment if we did not do so here. */
2502 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2505 ("?possible violation of implicit assumption", gnat_actual);
2507 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2508 Entity (Name (gnat_node)));
2509 post_error_ne ("?because of misalignment of &", gnat_actual,
2513 /* Remove any unpadding from the object and reset the copy. */
2514 if (TREE_CODE (gnu_name) == COMPONENT_REF
2515 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2517 && (TYPE_IS_PADDING_P
2518 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2519 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2521 /* Otherwise convert to the nominal type of the object if it's
2522 a record type. There are several cases in which we need to
2523 make the temporary using this type instead of the actual type
2524 of the object if they are distinct, because the expectations
2525 of the callee would otherwise not be met:
2526 - if it's a justified modular type,
2527 - if the actual type is a smaller packable version of it. */
2528 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2529 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2530 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2532 gnu_name = convert (gnu_name_type, gnu_name);
2534 /* Make a SAVE_EXPR to both properly account for potential side
2535 effects and handle the creation of a temporary copy. Special
2536 code in gnat_gimplify_expr ensures that the same temporary is
2537 used as the object and copied back after the call if needed. */
2538 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2539 TREE_SIDE_EFFECTS (gnu_name) = 1;
2541 /* Set up to move the copy back to the original. */
2542 if (Ekind (gnat_formal) != E_In_Parameter)
2544 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2546 set_expr_location_from_node (gnu_temp, gnat_node);
2547 append_to_statement_list (gnu_temp, &gnu_after_list);
2551 /* Start from the real object and build the actual. */
2552 gnu_actual = gnu_name;
2554 /* If this was a procedure call, we may not have removed any padding.
2555 So do it here for the part we will use as an input, if any. */
2556 if (Ekind (gnat_formal) != E_Out_Parameter
2557 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2558 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2559 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2562 /* Do any needed conversions for the actual and make sure that it is
2563 in range of the formal's type. */
2564 if (suppress_type_conversion)
2566 /* Put back the conversion we suppressed above in the computation
2567 of the real object. Note that we treat a conversion between
2568 aggregate types as if it is an unchecked conversion here. */
2570 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2572 (Nkind (gnat_actual)
2573 == N_Unchecked_Type_Conversion)
2574 && No_Truncation (gnat_actual));
2576 if (Ekind (gnat_formal) != E_Out_Parameter
2577 && Do_Range_Check (gnat_actual))
2578 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2583 if (Ekind (gnat_formal) != E_Out_Parameter
2584 && Do_Range_Check (gnat_actual))
2585 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2588 /* We may have suppressed a conversion to the Etype of the actual
2589 since the parent is a procedure call. So put it back here.
2590 ??? We use the reverse order compared to the case above because
2591 of an awkward interaction with the check and actually don't put
2592 back the conversion at all if a check is emitted. This is also
2593 done for the conversion to the formal's type just below. */
2594 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2595 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2599 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2600 gnu_actual = convert (gnu_formal_type, gnu_actual);
2602 /* Unless this is an In parameter, we must remove any justified modular
2603 building from GNU_NAME to get an lvalue. */
2604 if (Ekind (gnat_formal) != E_In_Parameter
2605 && TREE_CODE (gnu_name) == CONSTRUCTOR
2606 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2607 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2608 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2611 /* If we have not saved a GCC object for the formal, it means it is an
2612 Out parameter not passed by reference and that does not need to be
2613 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2616 && TREE_CODE (gnu_formal) == PARM_DECL
2617 && DECL_BY_REF_P (gnu_formal))
2619 if (Ekind (gnat_formal) != E_In_Parameter)
2621 /* In Out or Out parameters passed by reference don't use the
2622 copy-in copy-out mechanism so the address of the real object
2623 must be passed to the function. */
2624 gnu_actual = gnu_name;
2626 /* If we have a padded type, be sure we've removed padding. */
2627 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2628 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2629 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2630 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2633 /* If we have the constructed subtype of an aliased object
2634 with an unconstrained nominal subtype, the type of the
2635 actual includes the template, although it is formally
2636 constrained. So we need to convert it back to the real
2637 constructed subtype to retrieve the constrained part
2638 and takes its address. */
2639 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2640 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2641 && TREE_CODE (gnu_actual) != SAVE_EXPR
2642 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2643 && Is_Array_Type (Etype (gnat_actual)))
2644 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2648 /* The symmetry of the paths to the type of an entity is broken here
2649 since arguments don't know that they will be passed by ref. */
2650 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2651 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2654 && TREE_CODE (gnu_formal) == PARM_DECL
2655 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2657 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2658 gnu_actual = maybe_implicit_deref (gnu_actual);
2659 gnu_actual = maybe_unconstrained_array (gnu_actual);
2661 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2662 && TYPE_IS_PADDING_P (gnu_formal_type))
2664 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2665 gnu_actual = convert (gnu_formal_type, gnu_actual);
2668 /* Take the address of the object and convert to the proper pointer
2669 type. We'd like to actually compute the address of the beginning
2670 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2671 possibility that the ARRAY_REF might return a constant and we'd be
2672 getting the wrong address. Neither approach is exactly correct,
2673 but this is the most likely to work in all cases. */
2674 gnu_actual = convert (gnu_formal_type,
2675 build_unary_op (ADDR_EXPR, NULL_TREE,
2679 && TREE_CODE (gnu_formal) == PARM_DECL
2680 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2682 /* If arg is 'Null_Parameter, pass zero descriptor. */
2683 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2684 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2685 && TREE_PRIVATE (gnu_actual))
2686 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2689 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2690 fill_vms_descriptor (gnu_actual,
2696 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2698 if (Ekind (gnat_formal) != E_In_Parameter)
2699 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2701 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2704 /* If this is 'Null_Parameter, pass a zero even though we are
2705 dereferencing it. */
2706 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2707 && TREE_PRIVATE (gnu_actual)
2708 && host_integerp (gnu_actual_size, 1)
2709 && 0 >= compare_tree_int (gnu_actual_size,
2712 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2713 convert (gnat_type_for_size
2714 (tree_low_cst (gnu_actual_size, 1),
2719 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2722 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2725 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2727 nreverse (gnu_actual_list));
2728 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2730 /* If we return by passing a target, the result is the target after the
2731 call. We must not emit the call directly here because this might be
2732 evaluated as part of an expression with conditions to control whether
2733 the call should be emitted or not. */
2734 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2736 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2737 by the target object converted to the proper type. Doing so would
2738 potentially be very inefficient, however, as this expression might
2739 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2740 pointless temporary copy of the whole object.
2742 What we do instead is build a COMPOUND_EXPR returning the address of
2743 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2744 SAVE_EXPR later on then only incurs a pointer copy. */
2746 tree gnu_result_type
2747 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2750 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2752 tree gnu_target_address
2753 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2754 set_expr_location_from_node (gnu_target_address, gnat_node);
2757 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2758 gnu_subprog_call, gnu_target_address);
2761 = unchecked_convert (gnu_result_type,
2762 build_unary_op (INDIRECT_REF, NULL_TREE,
2766 *gnu_result_type_p = gnu_result_type;
2770 /* If it is a function call, the result is the call expression unless
2771 a target is specified, in which case we copy the result into the target
2772 and return the assignment statement. */
2773 else if (Nkind (gnat_node) == N_Function_Call)
2775 gnu_result = gnu_subprog_call;
2777 /* If the function returns an unconstrained array or by reference,
2778 we have to de-dereference the pointer. */
2779 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2780 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2781 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2784 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2785 gnu_target, gnu_result);
2787 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2792 /* If this is the case where the GNAT tree contains a procedure call
2793 but the Ada procedure has copy in copy out parameters, the special
2794 parameter passing mechanism must be used. */
2795 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2797 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2798 in copy out parameters. */
2799 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2800 int length = list_length (scalar_return_list);
2806 gnu_subprog_call = save_expr (gnu_subprog_call);
2807 gnu_name_list = nreverse (gnu_name_list);
2809 /* If any of the names had side-effects, ensure they are all
2810 evaluated before the call. */
2811 for (gnu_name = gnu_name_list; gnu_name;
2812 gnu_name = TREE_CHAIN (gnu_name))
2813 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2814 append_to_statement_list (TREE_VALUE (gnu_name),
2818 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2819 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2821 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2823 for (gnat_actual = First_Actual (gnat_node);
2824 Present (gnat_actual);
2825 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2826 gnat_actual = Next_Actual (gnat_actual))
2827 /* If we are dealing with a copy in copy out parameter, we must
2828 retrieve its value from the record returned in the call. */
2829 if (!(present_gnu_tree (gnat_formal)
2830 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2831 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2832 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2833 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2834 || (DECL_BY_DESCRIPTOR_P
2835 (get_gnu_tree (gnat_formal))))))))
2836 && Ekind (gnat_formal) != E_In_Parameter)
2838 /* Get the value to assign to this Out or In Out parameter. It is
2839 either the result of the function if there is only a single such
2840 parameter or the appropriate field from the record returned. */
2842 = length == 1 ? gnu_subprog_call
2843 : build_component_ref (gnu_subprog_call, NULL_TREE,
2844 TREE_PURPOSE (scalar_return_list),
2847 /* If the actual is a conversion, get the inner expression, which
2848 will be the real destination, and convert the result to the
2849 type of the actual parameter. */
2851 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2853 /* If the result is a padded type, remove the padding. */
2854 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2855 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2856 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2857 (TREE_TYPE (gnu_result))),
2860 /* If the actual is a type conversion, the real target object is
2861 denoted by the inner Expression and we need to convert the
2862 result to the associated type.
2863 We also need to convert our gnu assignment target to this type
2864 if the corresponding GNU_NAME was constructed from the GNAT
2865 conversion node and not from the inner Expression. */
2866 if (Nkind (gnat_actual) == N_Type_Conversion)
2869 = convert_with_check
2870 (Etype (Expression (gnat_actual)), gnu_result,
2871 Do_Overflow_Check (gnat_actual),
2872 Do_Range_Check (Expression (gnat_actual)),
2873 Float_Truncate (gnat_actual), gnat_actual);
2875 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2876 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2879 /* Unchecked conversions as actuals for Out parameters are not
2880 allowed in user code because they are not variables, but do
2881 occur in front-end expansions. The associated GNU_NAME is
2882 always obtained from the inner expression in such cases. */
2883 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2884 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2886 No_Truncation (gnat_actual));
2889 if (Do_Range_Check (gnat_actual))
2891 = emit_range_check (gnu_result, Etype (gnat_actual),
2894 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2895 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2896 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2899 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2900 gnu_actual, gnu_result);
2901 set_expr_location_from_node (gnu_result, gnat_node);
2902 append_to_statement_list (gnu_result, &gnu_before_list);
2903 scalar_return_list = TREE_CHAIN (scalar_return_list);
2904 gnu_name_list = TREE_CHAIN (gnu_name_list);
2908 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2910 append_to_statement_list (gnu_after_list, &gnu_before_list);
2911 return gnu_before_list;
2914 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2915 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2918 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2920 tree gnu_jmpsave_decl = NULL_TREE;
2921 tree gnu_jmpbuf_decl = NULL_TREE;
2922 /* If just annotating, ignore all EH and cleanups. */
2923 bool gcc_zcx = (!type_annotate_only
2924 && Present (Exception_Handlers (gnat_node))
2925 && Exception_Mechanism == Back_End_Exceptions);
2927 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2928 && Exception_Mechanism == Setjmp_Longjmp);
2929 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2930 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2931 tree gnu_inner_block; /* The statement(s) for the block itself. */
2936 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2937 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2938 add_cleanup, and when we leave the binding, end_stmt_group will create
2939 the TRY_FINALLY_EXPR.
2941 ??? The region level calls down there have been specifically put in place
2942 for a ZCX context and currently the order in which things are emitted
2943 (region/handlers) is different from the SJLJ case. Instead of putting
2944 other calls with different conditions at other places for the SJLJ case,
2945 it seems cleaner to reorder things for the SJLJ case and generalize the
2946 condition to make it not ZCX specific.
2948 If there are any exceptions or cleanup processing involved, we need an
2949 outer statement group (for Setjmp_Longjmp) and binding level. */
2950 if (binding_for_block)
2952 start_stmt_group ();
2956 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2957 area for address of previous buffer. Do this first since we need to have
2958 the setjmp buf known for any decls in this block. */
2961 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2962 NULL_TREE, jmpbuf_ptr_type,
2963 build_call_0_expr (get_jmpbuf_decl),
2964 false, false, false, false, NULL,
2966 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2968 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2969 because of the unstructured form of EH used by setjmp_longjmp, there
2970 might be forward edges going to __builtin_setjmp receivers on which
2971 it is uninitialized, although they will never be actually taken. */
2972 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2973 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2974 NULL_TREE, jmpbuf_type,
2975 NULL_TREE, false, false, false, false,
2977 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2979 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2981 /* When we exit this block, restore the saved value. */
2982 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2983 End_Label (gnat_node));
2986 /* If we are to call a function when exiting this block, add a cleanup
2987 to the binding level we made above. Note that add_cleanup is FIFO
2988 so we must register this cleanup after the EH cleanup just above. */
2990 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2991 End_Label (gnat_node));
2993 /* Now build the tree for the declarations and statements inside this block.
2994 If this is SJLJ, set our jmp_buf as the current buffer. */
2995 start_stmt_group ();
2998 add_stmt (build_call_1_expr (set_jmpbuf_decl,
2999 build_unary_op (ADDR_EXPR, NULL_TREE,
3002 if (Present (First_Real_Statement (gnat_node)))
3003 process_decls (Statements (gnat_node), Empty,
3004 First_Real_Statement (gnat_node), true, true);
3006 /* Generate code for each statement in the block. */
3007 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3008 ? First_Real_Statement (gnat_node)
3009 : First (Statements (gnat_node)));
3010 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3011 add_stmt (gnat_to_gnu (gnat_temp));
3012 gnu_inner_block = end_stmt_group ();
3014 /* Now generate code for the two exception models, if either is relevant for
3018 tree *gnu_else_ptr = 0;
3021 /* Make a binding level for the exception handling declarations and code
3022 and set up gnu_except_ptr_stack for the handlers to use. */
3023 start_stmt_group ();
3026 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3027 create_var_decl (get_identifier ("EXCEPT_PTR"),
3029 build_pointer_type (except_type_node),
3030 build_call_0_expr (get_excptr_decl), false,
3031 false, false, false, NULL, gnat_node));
3033 /* Generate code for each handler. The N_Exception_Handler case does the
3034 real work and returns a COND_EXPR for each handler, which we chain
3036 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3037 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3039 gnu_expr = gnat_to_gnu (gnat_temp);
3041 /* If this is the first one, set it as the outer one. Otherwise,
3042 point the "else" part of the previous handler to us. Then point
3043 to our "else" part. */
3045 add_stmt (gnu_expr);
3047 *gnu_else_ptr = gnu_expr;
3049 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3052 /* If none of the exception handlers did anything, re-raise but do not
3054 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3055 TREE_VALUE (gnu_except_ptr_stack));
3056 set_expr_location_from_node (gnu_expr, gnat_node);
3059 *gnu_else_ptr = gnu_expr;
3061 add_stmt (gnu_expr);
3063 /* End the binding level dedicated to the exception handlers and get the
3064 whole statement group. */
3065 pop_stack (&gnu_except_ptr_stack);
3067 gnu_handler = end_stmt_group ();
3069 /* If the setjmp returns 1, we restore our incoming longjmp value and
3070 then check the handlers. */
3071 start_stmt_group ();
3072 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3075 add_stmt (gnu_handler);
3076 gnu_handler = end_stmt_group ();
3078 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3079 gnu_result = build3 (COND_EXPR, void_type_node,
3082 build_unary_op (ADDR_EXPR, NULL_TREE,
3084 gnu_handler, gnu_inner_block);
3090 /* First make a block containing the handlers. */
3091 start_stmt_group ();
3092 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3093 Present (gnat_temp);
3094 gnat_temp = Next_Non_Pragma (gnat_temp))
3095 add_stmt (gnat_to_gnu (gnat_temp));
3096 gnu_handlers = end_stmt_group ();
3098 /* Now make the TRY_CATCH_EXPR for the block. */
3099 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3100 gnu_inner_block, gnu_handlers);
3103 gnu_result = gnu_inner_block;
3105 /* Now close our outer block, if we had to make one. */
3106 if (binding_for_block)
3108 add_stmt (gnu_result);
3110 gnu_result = end_stmt_group ();
3116 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3117 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3118 exception handling. */
3121 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3123 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3124 an "if" statement to select the proper exceptions. For "Others", exclude
3125 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3126 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3127 tree gnu_choice = integer_zero_node;
3128 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3131 for (gnat_temp = First (Exception_Choices (gnat_node));
3132 gnat_temp; gnat_temp = Next (gnat_temp))
3136 if (Nkind (gnat_temp) == N_Others_Choice)
3138 if (All_Others (gnat_temp))
3139 this_choice = integer_one_node;
3143 (EQ_EXPR, integer_type_node,
3148 (INDIRECT_REF, NULL_TREE,
3149 TREE_VALUE (gnu_except_ptr_stack)),
3150 get_identifier ("not_handled_by_others"), NULL_TREE,
3155 else if (Nkind (gnat_temp) == N_Identifier
3156 || Nkind (gnat_temp) == N_Expanded_Name)
3158 Entity_Id gnat_ex_id = Entity (gnat_temp);
3161 /* Exception may be a renaming. Recover original exception which is
3162 the one elaborated and registered. */
3163 if (Present (Renamed_Object (gnat_ex_id)))
3164 gnat_ex_id = Renamed_Object (gnat_ex_id);
3166 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3170 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3171 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3172 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3174 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3175 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3177 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3180 = build_component_ref
3181 (build_unary_op (INDIRECT_REF, NULL_TREE,
3182 TREE_VALUE (gnu_except_ptr_stack)),
3183 get_identifier ("lang"), NULL_TREE, false);
3187 (TRUTH_ORIF_EXPR, integer_type_node,
3188 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3189 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3196 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3197 gnu_choice, this_choice);
3200 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3203 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3204 to a GCC tree, which is returned. This is the variant for ZCX. */
3207 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3209 tree gnu_etypes_list = NULL_TREE;
3212 tree gnu_current_exc_ptr;
3213 tree gnu_incoming_exc_ptr;
3216 /* We build a TREE_LIST of nodes representing what exception types this
3217 handler can catch, with special cases for others and all others cases.
3219 Each exception type is actually identified by a pointer to the exception
3220 id, or to a dummy object for "others" and "all others".
3222 Care should be taken to ensure that the control flow impact of "others"
3223 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3225 for (gnat_temp = First (Exception_Choices (gnat_node));
3226 gnat_temp; gnat_temp = Next (gnat_temp))
3228 if (Nkind (gnat_temp) == N_Others_Choice)
3231 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3234 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3236 else if (Nkind (gnat_temp) == N_Identifier
3237 || Nkind (gnat_temp) == N_Expanded_Name)
3239 Entity_Id gnat_ex_id = Entity (gnat_temp);
3241 /* Exception may be a renaming. Recover original exception which is
3242 the one elaborated and registered. */
3243 if (Present (Renamed_Object (gnat_ex_id)))
3244 gnat_ex_id = Renamed_Object (gnat_ex_id);
3246 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3247 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3249 /* The Non_Ada_Error case for VMS exceptions is handled
3250 by the personality routine. */
3255 /* The GCC interface expects NULL to be passed for catch all handlers, so
3256 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3257 is integer_zero_node. It would not work, however, because GCC's
3258 notion of "catch all" is stronger than our notion of "others". Until
3259 we correctly use the cleanup interface as well, doing that would
3260 prevent the "all others" handlers from being seen, because nothing
3261 can be caught beyond a catch all from GCC's point of view. */
3262 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3265 start_stmt_group ();
3268 /* Expand a call to the begin_handler hook at the beginning of the handler,
3269 and arrange for a call to the end_handler hook to occur on every possible
3272 The hooks expect a pointer to the low level occurrence. This is required
3273 for our stack management scheme because a raise inside the handler pushes
3274 a new occurrence on top of the stack, which means that this top does not
3275 necessarily match the occurrence this handler was dealing with.
3277 The EXC_PTR_EXPR object references the exception occurrence being
3278 propagated. Upon handler entry, this is the exception for which the
3279 handler is triggered. This might not be the case upon handler exit,
3280 however, as we might have a new occurrence propagated by the handler's
3281 body, and the end_handler hook called as a cleanup in this context.
3283 We use a local variable to retrieve the incoming value at handler entry
3284 time, and reuse it to feed the end_handler hook's argument at exit. */
3285 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3286 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3287 ptr_type_node, gnu_current_exc_ptr,
3288 false, false, false, false, NULL,
3291 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3292 gnu_incoming_exc_ptr),
3294 /* ??? We don't seem to have an End_Label at hand to set the location. */
3295 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3297 add_stmt_list (Statements (gnat_node));
3300 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3304 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3307 Compilation_Unit_to_gnu (Node_Id gnat_node)
3309 /* Make the decl for the elaboration procedure. */
3310 bool body_p = (Defining_Entity (Unit (gnat_node)),
3311 Nkind (Unit (gnat_node)) == N_Package_Body
3312 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3313 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3314 tree gnu_elab_proc_decl
3315 = create_subprog_decl
3316 (create_concat_name (gnat_unit_entity,
3317 body_p ? "elabb" : "elabs"),
3318 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3320 struct elab_info *info;
3322 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3324 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3325 allocate_struct_function (gnu_elab_proc_decl, false);
3326 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3329 /* For a body, first process the spec if there is one. */
3330 if (Nkind (Unit (gnat_node)) == N_Package_Body
3331 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3332 && !Acts_As_Spec (gnat_node)))
3334 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3335 finalize_from_with_types ();
3338 process_inlined_subprograms (gnat_node);
3340 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3342 elaborate_all_entities (gnat_node);
3344 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3345 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3346 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3350 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3352 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3354 /* Process any pragmas and actions following the unit. */
3355 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3356 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3357 finalize_from_with_types ();
3359 /* Save away what we've made so far and record this potential elaboration
3361 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3362 set_current_block_context (gnu_elab_proc_decl);
3364 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3365 info->next = elab_info_list;
3366 info->elab_proc = gnu_elab_proc_decl;
3367 info->gnat_node = gnat_node;
3368 elab_info_list = info;
3370 /* Generate elaboration code for this unit, if necessary, and say whether
3372 pop_stack (&gnu_elab_proc_stack);
3374 /* Invalidate the global renaming pointers. This is necessary because
3375 stabilization of the renamed entities may create SAVE_EXPRs which
3376 have been tied to a specific elaboration routine just above. */
3377 invalidate_global_renaming_pointers ();
3380 /* This function is the driver of the GNAT to GCC tree transformation
3381 process. It is the entry point of the tree transformer. GNAT_NODE is the
3382 root of some GNAT tree. Return the root of the corresponding GCC tree.
3383 If this is an expression, return the GCC equivalent of the expression. If
3384 it is a statement, return the statement. In the case when called for a
3385 statement, it may also add statements to the current statement group, in
3386 which case anything it returns is to be interpreted as occurring after
3387 anything `it already added. */
3390 gnat_to_gnu (Node_Id gnat_node)
3392 bool went_into_elab_proc = false;
3393 tree gnu_result = error_mark_node; /* Default to no value. */
3394 tree gnu_result_type = void_type_node;
3396 tree gnu_lhs, gnu_rhs;
3399 /* Save node number for error message and set location information. */
3400 error_gnat_node = gnat_node;
3401 Sloc_to_locus (Sloc (gnat_node), &input_location);
3403 if (type_annotate_only
3404 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3405 return alloc_stmt_list ();
3407 /* If this node is a non-static subexpression and we are only
3408 annotating types, make this into a NULL_EXPR. */
3409 if (type_annotate_only
3410 && IN (Nkind (gnat_node), N_Subexpr)
3411 && Nkind (gnat_node) != N_Identifier
3412 && !Compile_Time_Known_Value (gnat_node))
3413 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3414 build_call_raise (CE_Range_Check_Failed, gnat_node,
3415 N_Raise_Constraint_Error));
3417 /* If this is a Statement and we are at top level, it must be part of the
3418 elaboration procedure, so mark us as being in that procedure and push our
3421 If we are in the elaboration procedure, check if we are violating a
3422 No_Elaboration_Code restriction by having a statement there. */
3423 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3424 && Nkind (gnat_node) != N_Null_Statement)
3425 || Nkind (gnat_node) == N_Procedure_Call_Statement
3426 || Nkind (gnat_node) == N_Label
3427 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3428 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3429 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3430 || Nkind (gnat_node) == N_Raise_Storage_Error
3431 || Nkind (gnat_node) == N_Raise_Program_Error)
3432 && (Ekind (Etype (gnat_node)) == E_Void)))
3434 if (!current_function_decl)
3436 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3437 start_stmt_group ();
3439 went_into_elab_proc = true;
3442 /* Don't check for a possible No_Elaboration_Code restriction violation
3443 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3444 every nested real statement instead. This also avoids triggering
3445 spurious errors on dummy (empty) sequences created by the front-end
3446 for package bodies in some cases. */
3448 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3449 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3450 Check_Elaboration_Code_Allowed (gnat_node);
3453 switch (Nkind (gnat_node))
3455 /********************************/
3456 /* Chapter 2: Lexical Elements */
3457 /********************************/
3460 case N_Expanded_Name:
3461 case N_Operator_Symbol:
3462 case N_Defining_Identifier:
3463 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3466 case N_Integer_Literal:
3470 /* Get the type of the result, looking inside any padding and
3471 justified modular types. Then get the value in that type. */
3472 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3474 if (TREE_CODE (gnu_type) == RECORD_TYPE
3475 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3476 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3478 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3480 /* If the result overflows (meaning it doesn't fit in its base type),
3481 abort. We would like to check that the value is within the range
3482 of the subtype, but that causes problems with subtypes whose usage
3483 will raise Constraint_Error and with biased representation, so
3485 gcc_assert (!TREE_OVERFLOW (gnu_result));
3489 case N_Character_Literal:
3490 /* If a Entity is present, it means that this was one of the
3491 literals in a user-defined character type. In that case,
3492 just return the value in the CONST_DECL. Otherwise, use the
3493 character code. In that case, the base type should be an
3494 INTEGER_TYPE, but we won't bother checking for that. */
3495 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3496 if (Present (Entity (gnat_node)))
3497 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3500 = build_int_cst_type
3501 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3504 case N_Real_Literal:
3505 /* If this is of a fixed-point type, the value we want is the
3506 value of the corresponding integer. */
3507 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3509 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3510 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3512 gcc_assert (!TREE_OVERFLOW (gnu_result));
3515 /* We should never see a Vax_Float type literal, since the front end
3516 is supposed to transform these using appropriate conversions. */
3517 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3522 Ureal ur_realval = Realval (gnat_node);
3524 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3526 /* If the real value is zero, so is the result. Otherwise,
3527 convert it to a machine number if it isn't already. That
3528 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3529 if (UR_Is_Zero (ur_realval))
3530 gnu_result = convert (gnu_result_type, integer_zero_node);
3533 if (!Is_Machine_Number (gnat_node))
3535 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3536 ur_realval, Round_Even, gnat_node);
3539 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3541 /* If we have a base of zero, divide by the denominator.
3542 Otherwise, the base must be 2 and we scale the value, which
3543 we know can fit in the mantissa of the type (hence the use
3544 of that type above). */
3545 if (No (Rbase (ur_realval)))
3547 = build_binary_op (RDIV_EXPR,
3548 get_base_type (gnu_result_type),
3550 UI_To_gnu (Denominator (ur_realval),
3554 REAL_VALUE_TYPE tmp;
3556 gcc_assert (Rbase (ur_realval) == 2);
3557 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3558 - UI_To_Int (Denominator (ur_realval)));
3559 gnu_result = build_real (gnu_result_type, tmp);
3563 /* Now see if we need to negate the result. Do it this way to
3564 properly handle -0. */
3565 if (UR_Is_Negative (Realval (gnat_node)))
3567 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3573 case N_String_Literal:
3574 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3575 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3577 String_Id gnat_string = Strval (gnat_node);
3578 int length = String_Length (gnat_string);
3581 if (length >= ALLOCA_THRESHOLD)
3582 string = XNEWVEC (char, length + 1);
3584 string = (char *) alloca (length + 1);
3586 /* Build the string with the characters in the literal. Note
3587 that Ada strings are 1-origin. */
3588 for (i = 0; i < length; i++)
3589 string[i] = Get_String_Char (gnat_string, i + 1);
3591 /* Put a null at the end of the string in case it's in a context
3592 where GCC will want to treat it as a C string. */
3595 gnu_result = build_string (length, string);
3597 /* Strings in GCC don't normally have types, but we want
3598 this to not be converted to the array type. */
3599 TREE_TYPE (gnu_result) = gnu_result_type;
3601 if (length >= ALLOCA_THRESHOLD)
3606 /* Build a list consisting of each character, then make
3608 String_Id gnat_string = Strval (gnat_node);
3609 int length = String_Length (gnat_string);
3611 tree gnu_list = NULL_TREE;
3612 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3614 for (i = 0; i < length; i++)
3617 = tree_cons (gnu_idx,
3618 build_int_cst (TREE_TYPE (gnu_result_type),
3619 Get_String_Char (gnat_string,
3623 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3628 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3633 gnu_result = Pragma_to_gnu (gnat_node);
3636 /**************************************/
3637 /* Chapter 3: Declarations and Types */
3638 /**************************************/
3640 case N_Subtype_Declaration:
3641 case N_Full_Type_Declaration:
3642 case N_Incomplete_Type_Declaration:
3643 case N_Private_Type_Declaration:
3644 case N_Private_Extension_Declaration:
3645 case N_Task_Type_Declaration:
3646 process_type (Defining_Entity (gnat_node));
3647 gnu_result = alloc_stmt_list ();
3650 case N_Object_Declaration:
3651 case N_Exception_Declaration:
3652 gnat_temp = Defining_Entity (gnat_node);
3653 gnu_result = alloc_stmt_list ();
3655 /* If we are just annotating types and this object has an unconstrained
3656 or task type, don't elaborate it. */
3657 if (type_annotate_only
3658 && (((Is_Array_Type (Etype (gnat_temp))
3659 || Is_Record_Type (Etype (gnat_temp)))
3660 && !Is_Constrained (Etype (gnat_temp)))
3661 || Is_Concurrent_Type (Etype (gnat_temp))))
3664 if (Present (Expression (gnat_node))
3665 && !(Nkind (gnat_node) == N_Object_Declaration
3666 && No_Initialization (gnat_node))
3667 && (!type_annotate_only
3668 || Compile_Time_Known_Value (Expression (gnat_node))))
3670 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3671 if (Do_Range_Check (Expression (gnat_node)))
3673 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3675 /* If this object has its elaboration delayed, we must force
3676 evaluation of GNU_EXPR right now and save it for when the object
3678 if (Present (Freeze_Node (gnat_temp)))
3680 if ((Is_Public (gnat_temp) || global_bindings_p ())
3681 && !TREE_CONSTANT (gnu_expr))
3683 = create_var_decl (create_concat_name (gnat_temp, "init"),
3684 NULL_TREE, TREE_TYPE (gnu_expr),
3685 gnu_expr, false, Is_Public (gnat_temp),
3686 false, false, NULL, gnat_temp);
3688 gnu_expr = maybe_variable (gnu_expr);
3690 save_gnu_tree (gnat_node, gnu_expr, true);
3694 gnu_expr = NULL_TREE;
3696 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3697 gnu_expr = NULL_TREE;
3699 /* If this is a deferred constant with an address clause, we ignore the
3700 full view since the clause is on the partial view and we cannot have
3701 2 different GCC trees for the object. The only bits of the full view
3702 we will use is the initializer, but it will be directly fetched. */
3703 if (Ekind(gnat_temp) == E_Constant
3704 && Present (Address_Clause (gnat_temp))
3705 && Present (Full_View (gnat_temp)))
3706 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3708 if (No (Freeze_Node (gnat_temp)))
3709 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3712 case N_Object_Renaming_Declaration:
3713 gnat_temp = Defining_Entity (gnat_node);
3715 /* Don't do anything if this renaming is handled by the front end or if
3716 we are just annotating types and this object has a composite or task
3717 type, don't elaborate it. We return the result in case it has any
3718 SAVE_EXPRs in it that need to be evaluated here. */
3719 if (!Is_Renaming_Of_Object (gnat_temp)
3720 && ! (type_annotate_only
3721 && (Is_Array_Type (Etype (gnat_temp))
3722 || Is_Record_Type (Etype (gnat_temp))
3723 || Is_Concurrent_Type (Etype (gnat_temp)))))
3725 = gnat_to_gnu_entity (gnat_temp,
3726 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3728 gnu_result = alloc_stmt_list ();
3731 case N_Implicit_Label_Declaration:
3732 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3733 gnu_result = alloc_stmt_list ();
3736 case N_Exception_Renaming_Declaration:
3737 case N_Number_Declaration:
3738 case N_Package_Renaming_Declaration:
3739 case N_Subprogram_Renaming_Declaration:
3740 /* These are fully handled in the front end. */
3741 gnu_result = alloc_stmt_list ();
3744 /*************************************/
3745 /* Chapter 4: Names and Expressions */
3746 /*************************************/
3748 case N_Explicit_Dereference:
3749 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3750 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3751 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3754 case N_Indexed_Component:
3756 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3760 Node_Id *gnat_expr_array;
3762 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3763 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3765 /* If we got a padded type, remove it too. */
3766 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3767 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3769 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3772 gnu_result = gnu_array_object;
3774 /* First compute the number of dimensions of the array, then
3775 fill the expression array, the order depending on whether
3776 this is a Convention_Fortran array or not. */
3777 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3778 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3779 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3780 ndim++, gnu_type = TREE_TYPE (gnu_type))
3783 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3785 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3786 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3788 i--, gnat_temp = Next (gnat_temp))
3789 gnat_expr_array[i] = gnat_temp;
3791 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3793 i++, gnat_temp = Next (gnat_temp))
3794 gnat_expr_array[i] = gnat_temp;
3796 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3797 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3799 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3800 gnat_temp = gnat_expr_array[i];
3801 gnu_expr = gnat_to_gnu (gnat_temp);
3803 if (Do_Range_Check (gnat_temp))
3806 (gnu_array_object, gnu_expr,
3807 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3808 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3811 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3812 gnu_result, gnu_expr);
3816 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3822 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3824 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3825 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3827 /* Do any implicit dereferences of the prefix and do any needed
3829 gnu_result = maybe_implicit_deref (gnu_result);
3830 gnu_result = maybe_unconstrained_array (gnu_result);
3831 gnu_type = TREE_TYPE (gnu_result);
3832 if (Do_Range_Check (gnat_range_node))
3834 /* Get the bounds of the slice. */
3836 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3837 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3838 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3839 /* Get the permitted bounds. */
3840 tree gnu_base_index_type
3841 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3842 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3843 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3844 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3845 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3846 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3848 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3849 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3851 /* Derive a good type to convert everything to. */
3852 gnu_expr_type = get_base_type (gnu_index_type);
3854 /* Test whether the minimum slice value is too small. */
3855 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3856 convert (gnu_expr_type,
3858 convert (gnu_expr_type,
3859 gnu_base_min_expr));
3861 /* Test whether the maximum slice value is too large. */
3862 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3863 convert (gnu_expr_type,
3865 convert (gnu_expr_type,
3866 gnu_base_max_expr));
3868 /* Build a slice index check that returns the low bound,
3869 assuming the slice is not empty. */
3870 gnu_expr = emit_check
3871 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3872 gnu_expr_l, gnu_expr_h),
3873 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3875 /* Build a conditional expression that does the index checks and
3876 returns the low bound if the slice is not empty (max >= min),
3877 and returns the naked low bound otherwise (max < min), unless
3878 it is non-constant and the high bound is; this prevents VRP
3879 from inferring bogus ranges on the unlikely path. */
3880 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3881 build_binary_op (GE_EXPR, gnu_expr_type,
3882 convert (gnu_expr_type,
3884 convert (gnu_expr_type,
3887 TREE_CODE (gnu_min_expr) != INTEGER_CST
3888 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3889 ? gnu_max_expr : gnu_min_expr);
3892 /* Simply return the naked low bound. */
3893 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3895 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3896 gnu_result, gnu_expr);
3900 case N_Selected_Component:
3902 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3903 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3904 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3907 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3908 || IN (Ekind (gnat_pref_type), Access_Kind))
3910 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3911 gnat_pref_type = Underlying_Type (gnat_pref_type);
3912 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3913 gnat_pref_type = Designated_Type (gnat_pref_type);
3916 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3918 /* For discriminant references in tagged types always substitute the
3919 corresponding discriminant as the actual selected component. */
3920 if (Is_Tagged_Type (gnat_pref_type))
3921 while (Present (Corresponding_Discriminant (gnat_field)))
3922 gnat_field = Corresponding_Discriminant (gnat_field);
3924 /* For discriminant references of untagged types always substitute the
3925 corresponding stored discriminant. */
3926 else if (Present (Corresponding_Discriminant (gnat_field)))
3927 gnat_field = Original_Record_Component (gnat_field);
3929 /* Handle extracting the real or imaginary part of a complex.
3930 The real part is the first field and the imaginary the last. */
3931 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3932 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3933 ? REALPART_EXPR : IMAGPART_EXPR,
3934 NULL_TREE, gnu_prefix);
3937 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3939 /* If there are discriminants, the prefix might be evaluated more
3940 than once, which is a problem if it has side-effects. */
3941 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3942 ? Designated_Type (Etype
3943 (Prefix (gnat_node)))
3944 : Etype (Prefix (gnat_node))))
3945 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3948 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3949 (Nkind (Parent (gnat_node))
3950 == N_Attribute_Reference));
3953 gcc_assert (gnu_result);
3954 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3958 case N_Attribute_Reference:
3960 /* The attribute designator (like an enumeration value). */
3961 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
3963 /* The Elab_Spec and Elab_Body attributes are special in that
3964 Prefix is a unit, not an object with a GCC equivalent. Similarly
3965 for Elaborated, since that variable isn't otherwise known. */
3966 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
3967 return (create_subprog_decl
3968 (create_concat_name (Entity (Prefix (gnat_node)),
3969 attribute == Attr_Elab_Body
3970 ? "elabb" : "elabs"),
3971 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
3974 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
3979 /* Like 'Access as far as we are concerned. */
3980 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3981 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
3982 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3986 case N_Extension_Aggregate:
3990 /* ??? It is wrong to evaluate the type now, but there doesn't
3991 seem to be any other practical way of doing it. */
3993 gcc_assert (!Expansion_Delayed (gnat_node));
3995 gnu_aggr_type = gnu_result_type
3996 = get_unpadded_type (Etype (gnat_node));
3998 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
3999 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4001 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4003 if (Null_Record_Present (gnat_node))
4004 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4006 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4007 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4009 = assoc_to_constructor (Etype (gnat_node),
4010 First (Component_Associations (gnat_node)),
4012 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4013 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4015 Component_Type (Etype (gnat_node)));
4016 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4019 (COMPLEX_EXPR, gnu_aggr_type,
4020 gnat_to_gnu (Expression (First
4021 (Component_Associations (gnat_node)))),
4022 gnat_to_gnu (Expression
4024 (First (Component_Associations (gnat_node))))));
4028 gnu_result = convert (gnu_result_type, gnu_result);
4033 if (TARGET_VTABLE_USES_DESCRIPTORS
4034 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4035 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4036 gnu_result = null_fdesc_node;
4038 gnu_result = null_pointer_node;
4039 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4042 case N_Type_Conversion:
4043 case N_Qualified_Expression:
4044 /* Get the operand expression. */
4045 gnu_result = gnat_to_gnu (Expression (gnat_node));
4046 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4049 = convert_with_check (Etype (gnat_node), gnu_result,
4050 Do_Overflow_Check (gnat_node),
4051 Do_Range_Check (Expression (gnat_node)),
4052 Nkind (gnat_node) == N_Type_Conversion
4053 && Float_Truncate (gnat_node), gnat_node);
4056 case N_Unchecked_Type_Conversion:
4057 gnu_result = gnat_to_gnu (Expression (gnat_node));
4058 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4060 /* If the result is a pointer type, see if we are improperly
4061 converting to a stricter alignment. */
4062 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4063 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4065 unsigned int align = known_alignment (gnu_result);
4066 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4067 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4069 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4070 post_error_ne_tree_2
4071 ("?source alignment (^) '< alignment of & (^)",
4072 gnat_node, Designated_Type (Etype (gnat_node)),
4073 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4076 /* If we are converting a descriptor to a function pointer, first
4077 build the pointer. */
4078 if (TARGET_VTABLE_USES_DESCRIPTORS
4079 && TREE_TYPE (gnu_result) == fdesc_type_node
4080 && POINTER_TYPE_P (gnu_result_type))
4081 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4083 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4084 No_Truncation (gnat_node));
4090 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4091 Node_Id gnat_range = Right_Opnd (gnat_node);
4095 /* GNAT_RANGE is either an N_Range node or an identifier
4096 denoting a subtype. */
4097 if (Nkind (gnat_range) == N_Range)
4099 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4100 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4102 else if (Nkind (gnat_range) == N_Identifier
4103 || Nkind (gnat_range) == N_Expanded_Name)
4105 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4107 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4108 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4113 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4115 /* If LOW and HIGH are identical, perform an equality test.
4116 Otherwise, ensure that GNU_OBJECT is only evaluated once
4117 and perform a full range test. */
4118 if (operand_equal_p (gnu_low, gnu_high, 0))
4119 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4120 gnu_object, gnu_low);
4123 gnu_object = protect_multiple_eval (gnu_object);
4125 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4126 build_binary_op (GE_EXPR, gnu_result_type,
4127 gnu_object, gnu_low),
4128 build_binary_op (LE_EXPR, gnu_result_type,
4129 gnu_object, gnu_high));
4132 if (Nkind (gnat_node) == N_Not_In)
4133 gnu_result = invert_truthvalue (gnu_result);
4138 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4139 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4140 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4141 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4143 : (Rounded_Result (gnat_node)
4144 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4145 gnu_result_type, gnu_lhs, gnu_rhs);
4148 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4149 /* These can either be operations on booleans or on modular types.
4150 Fall through for boolean types since that's the way GNU_CODES is
4152 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4153 Modular_Integer_Kind))
4156 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4157 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4160 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4161 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4162 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4163 gnu_result = build_binary_op (code, gnu_result_type,
4168 /* ... fall through ... */
4170 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4171 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4172 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4173 case N_Op_Mod: case N_Op_Rem:
4174 case N_Op_Rotate_Left:
4175 case N_Op_Rotate_Right:
4176 case N_Op_Shift_Left:
4177 case N_Op_Shift_Right:
4178 case N_Op_Shift_Right_Arithmetic:
4179 case N_And_Then: case N_Or_Else:
4181 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4182 bool ignore_lhs_overflow = false;
4185 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4186 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4187 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4189 /* If this is a comparison operator, convert any references to
4190 an unconstrained array value into a reference to the
4192 if (TREE_CODE_CLASS (code) == tcc_comparison)
4194 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4195 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4198 /* If the result type is a private type, its full view may be a
4199 numeric subtype. The representation we need is that of its base
4200 type, given that it is the result of an arithmetic operation. */
4201 else if (Is_Private_Type (Etype (gnat_node)))
4202 gnu_type = gnu_result_type
4203 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4205 /* If this is a shift whose count is not guaranteed to be correct,
4206 we need to adjust the shift count. */
4207 if (IN (Nkind (gnat_node), N_Op_Shift)
4208 && !Shift_Count_OK (gnat_node))
4210 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4212 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4214 if (Nkind (gnat_node) == N_Op_Rotate_Left
4215 || Nkind (gnat_node) == N_Op_Rotate_Right)
4216 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4217 gnu_rhs, gnu_max_shift);
4218 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4221 (MIN_EXPR, gnu_count_type,
4222 build_binary_op (MINUS_EXPR,
4225 convert (gnu_count_type,
4230 /* For right shifts, the type says what kind of shift to do,
4231 so we may need to choose a different type. In this case,
4232 we have to ignore integer overflow lest it propagates all
4233 the way down and causes a CE to be explicitly raised. */
4234 if (Nkind (gnat_node) == N_Op_Shift_Right
4235 && !TYPE_UNSIGNED (gnu_type))
4237 gnu_type = gnat_unsigned_type (gnu_type);
4238 ignore_lhs_overflow = true;
4240 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4241 && TYPE_UNSIGNED (gnu_type))
4243 gnu_type = gnat_signed_type (gnu_type);
4244 ignore_lhs_overflow = true;
4247 if (gnu_type != gnu_result_type)
4249 tree gnu_old_lhs = gnu_lhs;
4250 gnu_lhs = convert (gnu_type, gnu_lhs);
4251 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4252 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4253 gnu_rhs = convert (gnu_type, gnu_rhs);
4256 /* Instead of expanding overflow checks for addition, subtraction
4257 and multiplication itself, the front end will leave this to
4258 the back end when Backend_Overflow_Checks_On_Target is set.
4259 As the GCC back end itself does not know yet how to properly
4260 do overflow checking, do it here. The goal is to push
4261 the expansions further into the back end over time. */
4262 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4263 && (Nkind (gnat_node) == N_Op_Add
4264 || Nkind (gnat_node) == N_Op_Subtract
4265 || Nkind (gnat_node) == N_Op_Multiply)
4266 && !TYPE_UNSIGNED (gnu_type)
4267 && !FLOAT_TYPE_P (gnu_type))
4268 gnu_result = build_binary_op_trapv (code, gnu_type,
4269 gnu_lhs, gnu_rhs, gnat_node);
4271 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4273 /* If this is a logical shift with the shift count not verified,
4274 we must return zero if it is too large. We cannot compensate
4275 above in this case. */
4276 if ((Nkind (gnat_node) == N_Op_Shift_Left
4277 || Nkind (gnat_node) == N_Op_Shift_Right)
4278 && !Shift_Count_OK (gnat_node))
4282 build_binary_op (GE_EXPR, integer_type_node,
4284 convert (TREE_TYPE (gnu_rhs),
4285 TYPE_SIZE (gnu_type))),
4286 convert (gnu_type, integer_zero_node),
4291 case N_Conditional_Expression:
4293 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4294 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4296 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4298 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4299 gnu_result = build_cond_expr (gnu_result_type,
4300 gnat_truthvalue_conversion (gnu_cond),
4301 gnu_true, gnu_false);
4306 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4307 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4311 /* This case can apply to a boolean or a modular type.
4312 Fall through for a boolean operand since GNU_CODES is set
4313 up to handle this. */
4314 if (Is_Modular_Integer_Type (Etype (gnat_node))
4315 || (Ekind (Etype (gnat_node)) == E_Private_Type
4316 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4318 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4319 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4320 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4325 /* ... fall through ... */
4327 case N_Op_Minus: case N_Op_Abs:
4328 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4330 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4331 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4333 gnu_result_type = get_unpadded_type (Base_Type
4334 (Full_View (Etype (gnat_node))));
4336 if (Do_Overflow_Check (gnat_node)
4337 && !TYPE_UNSIGNED (gnu_result_type)
4338 && !FLOAT_TYPE_P (gnu_result_type))
4340 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4341 gnu_result_type, gnu_expr, gnat_node);
4343 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4344 gnu_result_type, gnu_expr);
4351 bool ignore_init_type = false;
4353 gnat_temp = Expression (gnat_node);
4355 /* The Expression operand can either be an N_Identifier or
4356 Expanded_Name, which must represent a type, or a
4357 N_Qualified_Expression, which contains both the object type and an
4358 initial value for the object. */
4359 if (Nkind (gnat_temp) == N_Identifier
4360 || Nkind (gnat_temp) == N_Expanded_Name)
4361 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4362 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4364 Entity_Id gnat_desig_type
4365 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4367 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4368 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4370 gnu_init = maybe_unconstrained_array (gnu_init);
4371 if (Do_Range_Check (Expression (gnat_temp)))
4373 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4375 if (Is_Elementary_Type (gnat_desig_type)
4376 || Is_Constrained (gnat_desig_type))
4378 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4379 gnu_init = convert (gnu_type, gnu_init);
4383 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4384 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4385 gnu_type = TREE_TYPE (gnu_init);
4387 gnu_init = convert (gnu_type, gnu_init);
4393 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4394 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4395 Procedure_To_Call (gnat_node),
4396 Storage_Pool (gnat_node), gnat_node,
4401 /**************************/
4402 /* Chapter 5: Statements */
4403 /**************************/
4406 gnu_result = build1 (LABEL_EXPR, void_type_node,
4407 gnat_to_gnu (Identifier (gnat_node)));
4410 case N_Null_Statement:
4411 gnu_result = alloc_stmt_list ();
4414 case N_Assignment_Statement:
4415 /* Get the LHS and RHS of the statement and convert any reference to an
4416 unconstrained array into a reference to the underlying array.
4417 If we are not to do range checking and the RHS is an N_Function_Call,
4418 pass the LHS to the call function. */
4419 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4421 /* If the type has a size that overflows, convert this into raise of
4422 Storage_Error: execution shouldn't have gotten here anyway. */
4423 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4424 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4425 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4426 N_Raise_Storage_Error);
4427 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4428 && !Do_Range_Check (Expression (gnat_node)))
4429 gnu_result = call_to_gnu (Expression (gnat_node),
4430 &gnu_result_type, gnu_lhs);
4434 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4436 /* If range check is needed, emit code to generate it. */
4437 if (Do_Range_Check (Expression (gnat_node)))
4438 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4442 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4444 /* If the type being assigned is an array type and the two sides
4445 are not completely disjoint, play safe and use memmove. */
4446 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4447 && Is_Array_Type (Etype (Name (gnat_node)))
4448 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4450 tree to, from, size, to_ptr, from_ptr, t;
4452 to = TREE_OPERAND (gnu_result, 0);
4453 from = TREE_OPERAND (gnu_result, 1);
4455 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4456 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4458 to_ptr = build_fold_addr_expr (to);
4459 from_ptr = build_fold_addr_expr (from);
4461 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4462 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4467 case N_If_Statement:
4469 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4471 /* Make the outer COND_EXPR. Avoid non-determinism. */
4472 gnu_result = build3 (COND_EXPR, void_type_node,
4473 gnat_to_gnu (Condition (gnat_node)),
4474 NULL_TREE, NULL_TREE);
4475 COND_EXPR_THEN (gnu_result)
4476 = build_stmt_group (Then_Statements (gnat_node), false);
4477 TREE_SIDE_EFFECTS (gnu_result) = 1;
4478 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4480 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4481 into the previous "else" part and point to where to put any
4482 outer "else". Also avoid non-determinism. */
4483 if (Present (Elsif_Parts (gnat_node)))
4484 for (gnat_temp = First (Elsif_Parts (gnat_node));
4485 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4487 gnu_expr = build3 (COND_EXPR, void_type_node,
4488 gnat_to_gnu (Condition (gnat_temp)),
4489 NULL_TREE, NULL_TREE);
4490 COND_EXPR_THEN (gnu_expr)
4491 = build_stmt_group (Then_Statements (gnat_temp), false);
4492 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4493 set_expr_location_from_node (gnu_expr, gnat_temp);
4494 *gnu_else_ptr = gnu_expr;
4495 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4498 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4502 case N_Case_Statement:
4503 gnu_result = Case_Statement_to_gnu (gnat_node);
4506 case N_Loop_Statement:
4507 gnu_result = Loop_Statement_to_gnu (gnat_node);
4510 case N_Block_Statement:
4511 start_stmt_group ();
4513 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4514 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4516 gnu_result = end_stmt_group ();
4518 if (Present (Identifier (gnat_node)))
4519 mark_out_of_scope (Entity (Identifier (gnat_node)));
4522 case N_Exit_Statement:
4524 = build2 (EXIT_STMT, void_type_node,
4525 (Present (Condition (gnat_node))
4526 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4527 (Present (Name (gnat_node))
4528 ? get_gnu_tree (Entity (Name (gnat_node)))
4529 : TREE_VALUE (gnu_loop_label_stack)));
4532 case N_Return_Statement:
4534 /* The gnu function type of the subprogram currently processed. */
4535 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4536 /* The return value from the subprogram. */
4537 tree gnu_ret_val = NULL_TREE;
4538 /* The place to put the return value. */
4541 /* If we are dealing with a "return;" from an Ada procedure with
4542 parameters passed by copy in copy out, we need to return a record
4543 containing the final values of these parameters. If the list
4544 contains only one entry, return just that entry.
4546 For a full description of the copy in copy out parameter mechanism,
4547 see the part of the gnat_to_gnu_entity routine dealing with the
4548 translation of subprograms.
4550 But if we have a return label defined, convert this into
4551 a branch to that label. */
4553 if (TREE_VALUE (gnu_return_label_stack))
4555 gnu_result = build1 (GOTO_EXPR, void_type_node,
4556 TREE_VALUE (gnu_return_label_stack));
4560 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4562 gnu_lhs = DECL_RESULT (current_function_decl);
4563 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4564 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4567 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4568 TYPE_CI_CO_LIST (gnu_subprog_type));
4571 /* If the Ada subprogram is a function, we just need to return the
4572 expression. If the subprogram returns an unconstrained
4573 array, we have to allocate a new version of the result and
4574 return it. If we return by reference, return a pointer. */
4576 else if (Present (Expression (gnat_node)))
4578 /* If the current function returns by target pointer and we
4579 are doing a call, pass that target to the call. */
4580 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4581 && Nkind (Expression (gnat_node)) == N_Function_Call)
4584 = build_unary_op (INDIRECT_REF, NULL_TREE,
4585 DECL_ARGUMENTS (current_function_decl));
4586 gnu_result = call_to_gnu (Expression (gnat_node),
4587 &gnu_result_type, gnu_lhs);
4591 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4593 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4594 /* The original return type was unconstrained so dereference
4595 the TARGET pointer in the actual return value's type. */
4597 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4598 DECL_ARGUMENTS (current_function_decl));
4600 gnu_lhs = DECL_RESULT (current_function_decl);
4602 /* Do not remove the padding from GNU_RET_VAL if the inner
4603 type is self-referential since we want to allocate the fixed
4604 size in that case. */
4605 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4606 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4608 && (TYPE_IS_PADDING_P
4609 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4610 && (CONTAINS_PLACEHOLDER_P
4611 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4612 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4614 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4615 || By_Ref (gnat_node))
4617 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4619 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4621 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4623 = build_allocator (TREE_TYPE (gnu_ret_val),
4625 TREE_TYPE (gnu_subprog_type),
4626 Procedure_To_Call (gnat_node),
4627 Storage_Pool (gnat_node),
4633 /* If the Ada subprogram is a regular procedure, just return. */
4634 gnu_lhs = NULL_TREE;
4636 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4639 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4640 gnu_lhs, gnu_ret_val);
4641 add_stmt_with_node (gnu_result, gnat_node);
4642 gnu_lhs = NULL_TREE;
4645 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4649 case N_Goto_Statement:
4650 gnu_result = build1 (GOTO_EXPR, void_type_node,
4651 gnat_to_gnu (Name (gnat_node)));
4654 /***************************/
4655 /* Chapter 6: Subprograms */
4656 /***************************/
4658 case N_Subprogram_Declaration:
4659 /* Unless there is a freeze node, declare the subprogram. We consider
4660 this a "definition" even though we're not generating code for
4661 the subprogram because we will be making the corresponding GCC
4664 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4665 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4667 gnu_result = alloc_stmt_list ();
4670 case N_Abstract_Subprogram_Declaration:
4671 /* This subprogram doesn't exist for code generation purposes, but we
4672 have to elaborate the types of any parameters and result, unless
4673 they are imported types (nothing to generate in this case). */
4675 /* Process the parameter types first. */
4678 = First_Formal_With_Extras
4679 (Defining_Entity (Specification (gnat_node)));
4680 Present (gnat_temp);
4681 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4682 if (Is_Itype (Etype (gnat_temp))
4683 && !From_With_Type (Etype (gnat_temp)))
4684 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4687 /* Then the result type, set to Standard_Void_Type for procedures. */
4690 Entity_Id gnat_temp_type
4691 = Etype (Defining_Entity (Specification (gnat_node)));
4693 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4694 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4697 gnu_result = alloc_stmt_list ();
4700 case N_Defining_Program_Unit_Name:
4701 /* For a child unit identifier go up a level to get the specification.
4702 We get this when we try to find the spec of a child unit package
4703 that is the compilation unit being compiled. */
4704 gnu_result = gnat_to_gnu (Parent (gnat_node));
4707 case N_Subprogram_Body:
4708 Subprogram_Body_to_gnu (gnat_node);
4709 gnu_result = alloc_stmt_list ();
4712 case N_Function_Call:
4713 case N_Procedure_Call_Statement:
4714 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4717 /************************/
4718 /* Chapter 7: Packages */
4719 /************************/
4721 case N_Package_Declaration:
4722 gnu_result = gnat_to_gnu (Specification (gnat_node));
4725 case N_Package_Specification:
4727 start_stmt_group ();
4728 process_decls (Visible_Declarations (gnat_node),
4729 Private_Declarations (gnat_node), Empty, true, true);
4730 gnu_result = end_stmt_group ();
4733 case N_Package_Body:
4735 /* If this is the body of a generic package - do nothing. */
4736 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4738 gnu_result = alloc_stmt_list ();
4742 start_stmt_group ();
4743 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4745 if (Present (Handled_Statement_Sequence (gnat_node)))
4746 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4748 gnu_result = end_stmt_group ();
4751 /********************************/
4752 /* Chapter 8: Visibility Rules */
4753 /********************************/
4755 case N_Use_Package_Clause:
4756 case N_Use_Type_Clause:
4757 /* Nothing to do here - but these may appear in list of declarations. */
4758 gnu_result = alloc_stmt_list ();
4761 /*********************/
4762 /* Chapter 9: Tasks */
4763 /*********************/
4765 case N_Protected_Type_Declaration:
4766 gnu_result = alloc_stmt_list ();
4769 case N_Single_Task_Declaration:
4770 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4771 gnu_result = alloc_stmt_list ();
4774 /*********************************************************/
4775 /* Chapter 10: Program Structure and Compilation Issues */
4776 /*********************************************************/
4778 case N_Compilation_Unit:
4780 /* This is not called for the main unit, which is handled in function
4782 start_stmt_group ();
4785 Compilation_Unit_to_gnu (gnat_node);
4786 gnu_result = alloc_stmt_list ();
4789 case N_Subprogram_Body_Stub:
4790 case N_Package_Body_Stub:
4791 case N_Protected_Body_Stub:
4792 case N_Task_Body_Stub:
4793 /* Simply process whatever unit is being inserted. */
4794 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4798 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4801 /***************************/
4802 /* Chapter 11: Exceptions */
4803 /***************************/
4805 case N_Handled_Sequence_Of_Statements:
4806 /* If there is an At_End procedure attached to this node, and the EH
4807 mechanism is SJLJ, we must have at least a corresponding At_End
4808 handler, unless the No_Exception_Handlers restriction is set. */
4809 gcc_assert (type_annotate_only
4810 || Exception_Mechanism != Setjmp_Longjmp
4811 || No (At_End_Proc (gnat_node))
4812 || Present (Exception_Handlers (gnat_node))
4813 || No_Exception_Handlers_Set ());
4815 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4818 case N_Exception_Handler:
4819 if (Exception_Mechanism == Setjmp_Longjmp)
4820 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4821 else if (Exception_Mechanism == Back_End_Exceptions)
4822 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4828 case N_Push_Constraint_Error_Label:
4829 push_exception_label_stack (&gnu_constraint_error_label_stack,
4830 Exception_Label (gnat_node));
4833 case N_Push_Storage_Error_Label:
4834 push_exception_label_stack (&gnu_storage_error_label_stack,
4835 Exception_Label (gnat_node));
4838 case N_Push_Program_Error_Label:
4839 push_exception_label_stack (&gnu_program_error_label_stack,
4840 Exception_Label (gnat_node));
4843 case N_Pop_Constraint_Error_Label:
4844 gnu_constraint_error_label_stack
4845 = TREE_CHAIN (gnu_constraint_error_label_stack);
4848 case N_Pop_Storage_Error_Label:
4849 gnu_storage_error_label_stack
4850 = TREE_CHAIN (gnu_storage_error_label_stack);
4853 case N_Pop_Program_Error_Label:
4854 gnu_program_error_label_stack
4855 = TREE_CHAIN (gnu_program_error_label_stack);
4858 /******************************/
4859 /* Chapter 12: Generic Units */
4860 /******************************/
4862 case N_Generic_Function_Renaming_Declaration:
4863 case N_Generic_Package_Renaming_Declaration:
4864 case N_Generic_Procedure_Renaming_Declaration:
4865 case N_Generic_Package_Declaration:
4866 case N_Generic_Subprogram_Declaration:
4867 case N_Package_Instantiation:
4868 case N_Procedure_Instantiation:
4869 case N_Function_Instantiation:
4870 /* These nodes can appear on a declaration list but there is nothing to
4871 to be done with them. */
4872 gnu_result = alloc_stmt_list ();
4875 /**************************************************/
4876 /* Chapter 13: Representation Clauses and */
4877 /* Implementation-Dependent Features */
4878 /**************************************************/
4880 case N_Attribute_Definition_Clause:
4881 gnu_result = alloc_stmt_list ();
4883 /* The only one we need to deal with is 'Address since, for the others,
4884 the front-end puts the information elsewhere. */
4885 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4888 /* And we only deal with 'Address if the object has a Freeze node. */
4889 gnat_temp = Entity (Name (gnat_node));
4890 if (No (Freeze_Node (gnat_temp)))
4893 /* Get the value to use as the address and save it as the equivalent
4894 for the object. When it is frozen, gnat_to_gnu_entity will do the
4896 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4899 case N_Enumeration_Representation_Clause:
4900 case N_Record_Representation_Clause:
4902 /* We do nothing with these. SEM puts the information elsewhere. */
4903 gnu_result = alloc_stmt_list ();
4906 case N_Code_Statement:
4907 if (!type_annotate_only)
4909 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4910 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4911 tree gnu_clobbers = NULL_TREE, tail;
4912 bool allows_mem, allows_reg, fake;
4913 int ninputs, noutputs, i;
4914 const char **oconstraints;
4915 const char *constraint;
4918 /* First retrieve the 3 operand lists built by the front-end. */
4919 Setup_Asm_Outputs (gnat_node);
4920 while (Present (gnat_temp = Asm_Output_Variable ()))
4922 tree gnu_value = gnat_to_gnu (gnat_temp);
4923 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4924 (Asm_Output_Constraint ()));
4926 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4930 Setup_Asm_Inputs (gnat_node);
4931 while (Present (gnat_temp = Asm_Input_Value ()))
4933 tree gnu_value = gnat_to_gnu (gnat_temp);
4934 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4935 (Asm_Input_Constraint ()));
4937 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4941 Clobber_Setup (gnat_node);
4942 while ((clobber = Clobber_Get_Next ()))
4944 = tree_cons (NULL_TREE,
4945 build_string (strlen (clobber) + 1, clobber),
4948 /* Then perform some standard checking and processing on the
4949 operands. In particular, mark them addressable if needed. */
4950 gnu_outputs = nreverse (gnu_outputs);
4951 noutputs = list_length (gnu_outputs);
4952 gnu_inputs = nreverse (gnu_inputs);
4953 ninputs = list_length (gnu_inputs);
4955 = (const char **) alloca (noutputs * sizeof (const char *));
4957 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4959 tree output = TREE_VALUE (tail);
4961 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4962 oconstraints[i] = constraint;
4964 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4965 &allows_mem, &allows_reg, &fake))
4967 /* If the operand is going to end up in memory,
4968 mark it addressable. Note that we don't test
4969 allows_mem like in the input case below; this
4970 is modelled on the C front-end. */
4972 && !gnat_mark_addressable (output))
4973 output = error_mark_node;
4976 output = error_mark_node;
4978 TREE_VALUE (tail) = output;
4981 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
4983 tree input = TREE_VALUE (tail);
4985 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4987 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
4989 &allows_mem, &allows_reg))
4991 /* If the operand is going to end up in memory,
4992 mark it addressable. */
4993 if (!allows_reg && allows_mem
4994 && !gnat_mark_addressable (input))
4995 input = error_mark_node;
4998 input = error_mark_node;
5000 TREE_VALUE (tail) = input;
5003 gnu_result = build4 (ASM_EXPR, void_type_node,
5004 gnu_template, gnu_outputs,
5005 gnu_inputs, gnu_clobbers);
5006 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5009 gnu_result = alloc_stmt_list ();
5017 case N_Freeze_Entity:
5018 start_stmt_group ();
5019 process_freeze_entity (gnat_node);
5020 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5021 gnu_result = end_stmt_group ();
5024 case N_Itype_Reference:
5025 if (!present_gnu_tree (Itype (gnat_node)))
5026 process_type (Itype (gnat_node));
5028 gnu_result = alloc_stmt_list ();
5031 case N_Free_Statement:
5032 if (!type_annotate_only)
5034 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5035 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5037 tree gnu_actual_obj_type = 0;
5040 unsigned int default_allocator_alignment
5041 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
5043 /* If this is a thin pointer, we must dereference it to create
5044 a fat pointer, then go back below to a thin pointer. The
5045 reason for this is that we need a fat pointer someplace in
5046 order to properly compute the size. */
5047 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5048 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5049 build_unary_op (INDIRECT_REF, NULL_TREE,
5052 /* If this is an unconstrained array, we know the object must
5053 have been allocated with the template in front of the object.
5054 So pass the template address, but get the total size. Do this
5055 by converting to a thin pointer. */
5056 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5058 = convert (build_pointer_type
5059 (TYPE_OBJECT_RECORD_TYPE
5060 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5063 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5065 if (Present (Actual_Designated_Subtype (gnat_node)))
5068 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5070 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5072 = build_unc_object_type_from_ptr (gnu_ptr_type,
5073 gnu_actual_obj_type,
5074 get_identifier ("DEALLOC"));
5077 gnu_actual_obj_type = gnu_obj_type;
5079 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5080 align = TYPE_ALIGN (gnu_obj_type);
5082 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5083 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5085 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5086 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5087 tree gnu_byte_offset
5088 = convert (sizetype,
5089 size_diffop (size_zero_node, gnu_pos));
5090 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5092 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5093 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5094 gnu_ptr, gnu_byte_offset);
5097 /* If the object was allocated from the default storage pool, the
5098 alignment was greater than what the allocator provides, and this
5099 is not a fat or thin pointer, what we have in gnu_ptr here is an
5100 address dynamically adjusted to match the alignment requirement
5101 (see build_allocator). What we need to pass to free is the
5102 initial allocator's return value, which has been stored just in
5103 front of the block we have. */
5105 if (No (Procedure_To_Call (gnat_node))
5106 && align > default_allocator_alignment
5107 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5110 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
5114 = (void *)GNU_PTR - (void *)sizeof (void *)) */
5117 (POINTER_PLUS_EXPR, ptr_void_type_node,
5118 convert (ptr_void_type_node, gnu_ptr),
5119 size_int (-POINTER_SIZE/BITS_PER_UNIT));
5121 /* GNU_PTR (void *) = *(void **)GNU_PTR */
5124 (INDIRECT_REF, NULL_TREE,
5125 convert (build_pointer_type (ptr_void_type_node),
5129 gnu_result = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, align,
5130 Procedure_To_Call (gnat_node),
5131 Storage_Pool (gnat_node),
5136 case N_Raise_Constraint_Error:
5137 case N_Raise_Program_Error:
5138 case N_Raise_Storage_Error:
5139 if (type_annotate_only)
5141 gnu_result = alloc_stmt_list ();
5145 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5147 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5150 /* If the type is VOID, this is a statement, so we need to
5151 generate the code for the call. Handle a Condition, if there
5153 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5155 set_expr_location_from_node (gnu_result, gnat_node);
5157 if (Present (Condition (gnat_node)))
5158 gnu_result = build3 (COND_EXPR, void_type_node,
5159 gnat_to_gnu (Condition (gnat_node)),
5160 gnu_result, alloc_stmt_list ());
5163 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5166 case N_Validate_Unchecked_Conversion:
5168 Entity_Id gnat_target_type = Target_Type (gnat_node);
5169 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5170 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5172 /* No need for any warning in this case. */
5173 if (!flag_strict_aliasing)
5176 /* If the result is a pointer type, see if we are either converting
5177 from a non-pointer or from a pointer to a type with a different
5178 alias set and warn if so. If the result is defined in the same
5179 unit as this unchecked conversion, we can allow this because we
5180 can know to make the pointer type behave properly. */
5181 else if (POINTER_TYPE_P (gnu_target_type)
5182 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5183 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5185 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5186 ? TREE_TYPE (gnu_source_type)
5188 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5190 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5191 || get_alias_set (gnu_target_desig_type) != 0)
5192 && (!POINTER_TYPE_P (gnu_source_type)
5193 || (TYPE_DUMMY_P (gnu_source_desig_type)
5194 != TYPE_DUMMY_P (gnu_target_desig_type))
5195 || (TYPE_DUMMY_P (gnu_source_desig_type)
5196 && gnu_source_desig_type != gnu_target_desig_type)
5197 || !alias_sets_conflict_p
5198 (get_alias_set (gnu_source_desig_type),
5199 get_alias_set (gnu_target_desig_type))))
5202 ("?possible aliasing problem for type&",
5203 gnat_node, Target_Type (gnat_node));
5205 ("\\?use -fno-strict-aliasing switch for references",
5208 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5209 gnat_node, Target_Type (gnat_node));
5213 /* But if the result is a fat pointer type, we have no mechanism to
5214 do that, so we unconditionally warn in problematic cases. */
5215 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5217 tree gnu_source_array_type
5218 = TYPE_FAT_POINTER_P (gnu_source_type)
5219 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5221 tree gnu_target_array_type
5222 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5224 if ((TYPE_DUMMY_P (gnu_target_array_type)
5225 || get_alias_set (gnu_target_array_type) != 0)
5226 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5227 || (TYPE_DUMMY_P (gnu_source_array_type)
5228 != TYPE_DUMMY_P (gnu_target_array_type))
5229 || (TYPE_DUMMY_P (gnu_source_array_type)
5230 && gnu_source_array_type != gnu_target_array_type)
5231 || !alias_sets_conflict_p
5232 (get_alias_set (gnu_source_array_type),
5233 get_alias_set (gnu_target_array_type))))
5236 ("?possible aliasing problem for type&",
5237 gnat_node, Target_Type (gnat_node));
5239 ("\\?use -fno-strict-aliasing switch for references",
5244 gnu_result = alloc_stmt_list ();
5247 case N_Raise_Statement:
5248 case N_Function_Specification:
5249 case N_Procedure_Specification:
5251 case N_Component_Association:
5254 gcc_assert (type_annotate_only);
5255 gnu_result = alloc_stmt_list ();
5258 /* If we pushed our level as part of processing the elaboration routine,
5260 if (went_into_elab_proc)
5262 add_stmt (gnu_result);
5264 gnu_result = end_stmt_group ();
5265 current_function_decl = NULL_TREE;
5268 /* Set the location information on the result if it is a real expression.
5269 References can be reused for multiple GNAT nodes and they would get
5270 the location information of their last use. Note that we may have
5271 no result if we tried to build a CALL_EXPR node to a procedure with
5272 no side-effects and optimization is enabled. */
5274 && EXPR_P (gnu_result)
5275 && TREE_CODE (gnu_result) != NOP_EXPR
5276 && !REFERENCE_CLASS_P (gnu_result))
5277 set_expr_location_from_node (gnu_result, gnat_node);
5279 /* If we're supposed to return something of void_type, it means we have
5280 something we're elaborating for effect, so just return. */
5281 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5284 /* If the result is a constant that overflows, raise constraint error. */
5285 else if (TREE_CODE (gnu_result) == INTEGER_CST
5286 && TREE_OVERFLOW (gnu_result))
5288 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5291 = build1 (NULL_EXPR, gnu_result_type,
5292 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5293 N_Raise_Constraint_Error));
5296 /* If our result has side-effects and is of an unconstrained type,
5297 make a SAVE_EXPR so that we can be sure it will only be referenced
5298 once. Note we must do this before any conversions. */
5299 if (TREE_SIDE_EFFECTS (gnu_result)
5300 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5301 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5302 gnu_result = gnat_stabilize_reference (gnu_result, false);
5304 /* Now convert the result to the result type, unless we are in one of the
5307 1. If this is the Name of an assignment statement or a parameter of
5308 a procedure call, return the result almost unmodified since the
5309 RHS will have to be converted to our type in that case, unless
5310 the result type has a simpler size. Similarly, don't convert
5311 integral types that are the operands of an unchecked conversion
5312 since we need to ignore those conversions (for 'Valid).
5314 2. If we have a label (which doesn't have any well-defined type), a
5315 field or an error, return the result almost unmodified. Also don't
5316 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5317 its size since those are the cases where the front end may have the
5318 type wrong due to "instantiating" the unconstrained record with
5319 discriminant values. Similarly, if the two types are record types
5320 with the same name don't convert. This will be the case when we are
5321 converting from a packable version of a type to its original type and
5322 we need those conversions to be NOPs in order for assignments into
5323 these types to work properly.
5325 3. If the type is void or if we have no result, return error_mark_node
5326 to show we have no result.
5328 4. Finally, if the type of the result is already correct. */
5330 if (Present (Parent (gnat_node))
5331 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5332 && Name (Parent (gnat_node)) == gnat_node)
5333 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5334 && Name (Parent (gnat_node)) != gnat_node)
5335 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5336 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5337 && !AGGREGATE_TYPE_P (gnu_result_type)
5338 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5339 && !(TYPE_SIZE (gnu_result_type)
5340 && TYPE_SIZE (TREE_TYPE (gnu_result))
5341 && (AGGREGATE_TYPE_P (gnu_result_type)
5342 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5343 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5344 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5346 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5347 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5348 && (CONTAINS_PLACEHOLDER_P
5349 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5350 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5351 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5353 /* Remove padding only if the inner object is of self-referential
5354 size: in that case it must be an object of unconstrained type
5355 with a default discriminant and we want to avoid copying too
5357 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5358 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5359 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5360 (TREE_TYPE (gnu_result))))))
5361 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5365 else if (TREE_CODE (gnu_result) == LABEL_DECL
5366 || TREE_CODE (gnu_result) == FIELD_DECL
5367 || TREE_CODE (gnu_result) == ERROR_MARK
5368 || (TYPE_SIZE (gnu_result_type)
5369 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5370 && TREE_CODE (gnu_result) != INDIRECT_REF
5371 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5372 || ((TYPE_NAME (gnu_result_type)
5373 == TYPE_NAME (TREE_TYPE (gnu_result)))
5374 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5375 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5377 /* Remove any padding. */
5378 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5379 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5380 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5384 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5385 gnu_result = error_mark_node;
5387 else if (gnu_result_type != TREE_TYPE (gnu_result))
5388 gnu_result = convert (gnu_result_type, gnu_result);
5390 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5391 while ((TREE_CODE (gnu_result) == NOP_EXPR
5392 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5393 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5394 gnu_result = TREE_OPERAND (gnu_result, 0);
5399 /* Subroutine of above to push the exception label stack. GNU_STACK is
5400 a pointer to the stack to update and GNAT_LABEL, if present, is the
5401 label to push onto the stack. */
5404 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5406 tree gnu_label = (Present (gnat_label)
5407 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5410 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5413 /* Record the current code position in GNAT_NODE. */
5416 record_code_position (Node_Id gnat_node)
5418 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5420 add_stmt_with_node (stmt_stmt, gnat_node);
5421 save_gnu_tree (gnat_node, stmt_stmt, true);
5424 /* Insert the code for GNAT_NODE at the position saved for that node. */
5427 insert_code_for (Node_Id gnat_node)
5429 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5430 save_gnu_tree (gnat_node, NULL_TREE, true);
5433 /* Start a new statement group chained to the previous group. */
5436 start_stmt_group (void)
5438 struct stmt_group *group = stmt_group_free_list;
5440 /* First see if we can get one from the free list. */
5442 stmt_group_free_list = group->previous;
5444 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5446 group->previous = current_stmt_group;
5447 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5448 current_stmt_group = group;
5451 /* Add GNU_STMT to the current statement group. */
5454 add_stmt (tree gnu_stmt)
5456 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5459 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5462 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5464 if (Present (gnat_node))
5465 set_expr_location_from_node (gnu_stmt, gnat_node);
5466 add_stmt (gnu_stmt);
5469 /* Add a declaration statement for GNU_DECL to the current statement group.
5470 Get SLOC from Entity_Id. */
5473 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5475 tree type = TREE_TYPE (gnu_decl);
5476 tree gnu_stmt, gnu_init, t;
5478 /* If this is a variable that Gigi is to ignore, we may have been given
5479 an ERROR_MARK. So test for it. We also might have been given a
5480 reference for a renaming. So only do something for a decl. Also
5481 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5482 if (!DECL_P (gnu_decl)
5483 || (TREE_CODE (gnu_decl) == TYPE_DECL
5484 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5487 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5489 /* If we are global, we don't want to actually output the DECL_EXPR for
5490 this decl since we already have evaluated the expressions in the
5491 sizes and positions as globals and doing it again would be wrong. */
5492 if (global_bindings_p ())
5494 /* Mark everything as used to prevent node sharing with subprograms.
5495 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5496 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5497 mark_visited (&gnu_stmt);
5498 if (TREE_CODE (gnu_decl) == VAR_DECL
5499 || TREE_CODE (gnu_decl) == CONST_DECL)
5501 mark_visited (&DECL_SIZE (gnu_decl));
5502 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5503 mark_visited (&DECL_INITIAL (gnu_decl));
5505 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5506 if (TREE_CODE (gnu_decl) == TYPE_DECL
5507 && (TREE_CODE (type) == RECORD_TYPE
5508 || TREE_CODE (type) == UNION_TYPE
5509 || TREE_CODE (type) == QUAL_UNION_TYPE)
5510 && (t = TYPE_ADA_SIZE (type)))
5514 add_stmt_with_node (gnu_stmt, gnat_entity);
5516 /* If this is a variable and an initializer is attached to it, it must be
5517 valid for the context. Similar to init_const in create_var_decl_1. */
5518 if (TREE_CODE (gnu_decl) == VAR_DECL
5519 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5520 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5521 || (TREE_STATIC (gnu_decl)
5522 && !initializer_constant_valid_p (gnu_init,
5523 TREE_TYPE (gnu_init)))))
5525 /* If GNU_DECL has a padded type, convert it to the unpadded
5526 type so the assignment is done properly. */
5527 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5528 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5532 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5534 DECL_INITIAL (gnu_decl) = NULL_TREE;
5535 if (TREE_READONLY (gnu_decl))
5537 TREE_READONLY (gnu_decl) = 0;
5538 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5541 add_stmt_with_node (gnu_stmt, gnat_entity);
5545 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5548 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5550 if (TREE_VISITED (*tp))
5553 /* Don't mark a dummy type as visited because we want to mark its sizes
5554 and fields once it's filled in. */
5555 else if (!TYPE_IS_DUMMY_P (*tp))
5556 TREE_VISITED (*tp) = 1;
5559 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5564 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5567 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5568 void *data ATTRIBUTE_UNUSED)
5572 if (TREE_CODE (t) == SAVE_EXPR)
5573 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5578 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5579 sized gimplified. We use this to indicate all variable sizes and
5580 positions in global types may not be shared by any subprogram. */
5583 mark_visited (tree *tp)
5585 walk_tree (tp, mark_visited_r, NULL, NULL);
5588 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5589 set its location to that of GNAT_NODE if present. */
5592 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5594 if (Present (gnat_node))
5595 set_expr_location_from_node (gnu_cleanup, gnat_node);
5596 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5599 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5602 set_block_for_group (tree gnu_block)
5604 gcc_assert (!current_stmt_group->block);
5605 current_stmt_group->block = gnu_block;
5608 /* Return code corresponding to the current code group. It is normally
5609 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5610 BLOCK or cleanups were set. */
5613 end_stmt_group (void)
5615 struct stmt_group *group = current_stmt_group;
5616 tree gnu_retval = group->stmt_list;
5618 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5619 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5620 make a BIND_EXPR. Note that we nest in that because the cleanup may
5621 reference variables in the block. */
5622 if (gnu_retval == NULL_TREE)
5623 gnu_retval = alloc_stmt_list ();
5625 if (group->cleanups)
5626 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5629 if (current_stmt_group->block)
5630 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5631 gnu_retval, group->block);
5633 /* Remove this group from the stack and add it to the free list. */
5634 current_stmt_group = group->previous;
5635 group->previous = stmt_group_free_list;
5636 stmt_group_free_list = group;
5641 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5645 add_stmt_list (List_Id gnat_list)
5649 if (Present (gnat_list))
5650 for (gnat_node = First (gnat_list); Present (gnat_node);
5651 gnat_node = Next (gnat_node))
5652 add_stmt (gnat_to_gnu (gnat_node));
5655 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5656 If BINDING_P is true, push and pop a binding level around the list. */
5659 build_stmt_group (List_Id gnat_list, bool binding_p)
5661 start_stmt_group ();
5665 add_stmt_list (gnat_list);
5669 return end_stmt_group ();
5672 /* Push and pop routines for stacks. We keep a free list around so we
5673 don't waste tree nodes. */
5676 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5678 tree gnu_node = gnu_stack_free_list;
5682 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5683 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5684 TREE_PURPOSE (gnu_node) = gnu_purpose;
5685 TREE_VALUE (gnu_node) = gnu_value;
5688 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5690 *gnu_stack_ptr = gnu_node;
5694 pop_stack (tree *gnu_stack_ptr)
5696 tree gnu_node = *gnu_stack_ptr;
5698 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5699 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5700 gnu_stack_free_list = gnu_node;
5703 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5706 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5707 gimple_seq *post_p ATTRIBUTE_UNUSED)
5709 tree expr = *expr_p;
5712 if (IS_ADA_STMT (expr))
5713 return gnat_gimplify_stmt (expr_p);
5715 switch (TREE_CODE (expr))
5718 /* If this is for a scalar, just make a VAR_DECL for it. If for
5719 an aggregate, get a null pointer of the appropriate type and
5721 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5722 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5723 convert (build_pointer_type (TREE_TYPE (expr)),
5724 integer_zero_node));
5727 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5728 TREE_NO_WARNING (*expr_p) = 1;
5731 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5734 case UNCONSTRAINED_ARRAY_REF:
5735 /* We should only do this if we are just elaborating for side-effects,
5736 but we can't know that yet. */
5737 *expr_p = TREE_OPERAND (*expr_p, 0);
5741 op = TREE_OPERAND (expr, 0);
5743 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5744 be put into static memory. We know it's going to be readonly given
5745 the semantics we have and it's required to be static memory in
5746 the case when the reference is in an elaboration procedure. */
5747 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5749 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5751 TREE_READONLY (new_var) = 1;
5752 TREE_STATIC (new_var) = 1;
5753 TREE_ADDRESSABLE (new_var) = 1;
5754 DECL_INITIAL (new_var) = op;
5756 TREE_OPERAND (expr, 0) = new_var;
5757 recompute_tree_invariant_for_addr_expr (expr);
5761 /* If we are taking the address of a SAVE_EXPR, we are typically
5762 processing a misaligned argument to be passed by reference in a
5763 procedure call. We just mark the operand as addressable + not
5764 readonly here and let the common gimplifier code perform the
5765 temporary creation, initialization, and "instantiation" in place of
5766 the SAVE_EXPR in further operands, in particular in the copy back
5767 code inserted after the call. */
5768 else if (TREE_CODE (op) == SAVE_EXPR)
5770 TREE_ADDRESSABLE (op) = 1;
5771 TREE_READONLY (op) = 0;
5774 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5775 address of the selected operand when it is addressable. Besides, we
5776 also expect addressable_p to only let COND_EXPRs where both arms are
5777 addressable reach here. */
5778 else if (TREE_CODE (op) == COND_EXPR)
5781 /* Otherwise, if we are taking the address of something that is neither
5782 reference, declaration, or constant, make a variable for the operand
5783 here and then take its address. If we don't do it this way, we may
5784 confuse the gimplifier because it needs to know the variable is
5785 addressable at this point. This duplicates code in
5786 internal_get_tmp_var, which is unfortunate. */
5787 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5788 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5789 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5791 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5794 TREE_ADDRESSABLE (new_var) = 1;
5796 stmt = gimplify_assign (new_var, op, pre_p);
5797 if (EXPR_HAS_LOCATION (op))
5798 gimple_set_location (stmt, *EXPR_LOCUS (op));
5800 TREE_OPERAND (expr, 0) = new_var;
5801 recompute_tree_invariant_for_addr_expr (expr);
5805 /* ... fall through ... */
5808 return GS_UNHANDLED;
5812 /* Generate GIMPLE in place for the statement at *STMT_P. */
5814 static enum gimplify_status
5815 gnat_gimplify_stmt (tree *stmt_p)
5817 tree stmt = *stmt_p;
5819 switch (TREE_CODE (stmt))
5822 *stmt_p = STMT_STMT_STMT (stmt);
5827 tree gnu_start_label = create_artificial_label ();
5828 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5831 /* Set to emit the statements of the loop. */
5832 *stmt_p = NULL_TREE;
5834 /* We first emit the start label and then a conditional jump to
5835 the end label if there's a top condition, then the body of the
5836 loop, then a conditional branch to the end label, then the update,
5837 if any, and finally a jump to the start label and the definition
5838 of the end label. */
5839 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5843 if (LOOP_STMT_TOP_COND (stmt))
5844 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5845 LOOP_STMT_TOP_COND (stmt),
5852 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5854 if (LOOP_STMT_BOT_COND (stmt))
5855 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5856 LOOP_STMT_BOT_COND (stmt),
5863 if (LOOP_STMT_UPDATE (stmt))
5864 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5866 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5867 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5868 append_to_statement_list (t, stmt_p);
5870 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5877 /* Build a statement to jump to the corresponding end label, then
5878 see if it needs to be conditional. */
5879 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5880 if (EXIT_STMT_COND (stmt))
5881 *stmt_p = build3 (COND_EXPR, void_type_node,
5882 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5890 /* Force references to each of the entities in packages withed by GNAT_NODE.
5891 Operate recursively but check that we aren't elaborating something more
5894 This routine is exclusively called in type_annotate mode, to compute DDA
5895 information for types in withed units, for ASIS use. */
5898 elaborate_all_entities (Node_Id gnat_node)
5900 Entity_Id gnat_with_clause, gnat_entity;
5902 /* Process each unit only once. As we trace the context of all relevant
5903 units transitively, including generic bodies, we may encounter the
5904 same generic unit repeatedly. */
5905 if (!present_gnu_tree (gnat_node))
5906 save_gnu_tree (gnat_node, integer_zero_node, true);
5908 /* Save entities in all context units. A body may have an implicit_with
5909 on its own spec, if the context includes a child unit, so don't save
5911 for (gnat_with_clause = First (Context_Items (gnat_node));
5912 Present (gnat_with_clause);
5913 gnat_with_clause = Next (gnat_with_clause))
5914 if (Nkind (gnat_with_clause) == N_With_Clause
5915 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5916 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5918 elaborate_all_entities (Library_Unit (gnat_with_clause));
5920 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5922 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5923 Present (gnat_entity);
5924 gnat_entity = Next_Entity (gnat_entity))
5925 if (Is_Public (gnat_entity)
5926 && Convention (gnat_entity) != Convention_Intrinsic
5927 && Ekind (gnat_entity) != E_Package
5928 && Ekind (gnat_entity) != E_Package_Body
5929 && Ekind (gnat_entity) != E_Operator
5930 && !(IN (Ekind (gnat_entity), Type_Kind)
5931 && !Is_Frozen (gnat_entity))
5932 && !((Ekind (gnat_entity) == E_Procedure
5933 || Ekind (gnat_entity) == E_Function)
5934 && Is_Intrinsic_Subprogram (gnat_entity))
5935 && !IN (Ekind (gnat_entity), Named_Kind)
5936 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5937 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5939 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5942 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5944 /* Retrieve compilation unit node of generic body. */
5945 while (Present (gnat_body)
5946 && Nkind (gnat_body) != N_Compilation_Unit)
5947 gnat_body = Parent (gnat_body);
5949 /* If body is available, elaborate its context. */
5950 if (Present (gnat_body))
5951 elaborate_all_entities (gnat_body);
5955 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5956 elaborate_all_entities (Library_Unit (gnat_node));
5959 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5962 process_freeze_entity (Node_Id gnat_node)
5964 Entity_Id gnat_entity = Entity (gnat_node);
5968 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
5969 && present_gnu_tree (Declaration_Node (gnat_entity)))
5970 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
5972 /* If this is a package, need to generate code for the package. */
5973 if (Ekind (gnat_entity) == E_Package)
5976 (Parent (Corresponding_Body
5977 (Parent (Declaration_Node (gnat_entity)))));
5981 /* Check for old definition after the above call. This Freeze_Node
5982 might be for one its Itypes. */
5984 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
5986 /* If this entity has an Address representation clause, GNU_OLD is the
5987 address, so discard it here. */
5988 if (Present (Address_Clause (gnat_entity)))
5991 /* Don't do anything for class-wide types they are always
5992 transformed into their root type. */
5993 if (Ekind (gnat_entity) == E_Class_Wide_Type
5994 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
5995 && Present (Equivalent_Type (gnat_entity))))
5998 /* Don't do anything for subprograms that may have been elaborated before
5999 their freeze nodes. This can happen, for example because of an inner call
6000 in an instance body, or a previous compilation of a spec for inlining
6003 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6004 && (Ekind (gnat_entity) == E_Function
6005 || Ekind (gnat_entity) == E_Procedure))
6007 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6008 && Ekind (gnat_entity) == E_Subprogram_Type)))
6011 /* If we have a non-dummy type old tree, we have nothing to do, except
6012 aborting if this is the public view of a private type whose full view was
6013 not delayed, as this node was never delayed as it should have been. We
6014 let this happen for concurrent types and their Corresponding_Record_Type,
6015 however, because each might legitimately be elaborated before it's own
6016 freeze node, e.g. while processing the other. */
6018 && !(TREE_CODE (gnu_old) == TYPE_DECL
6019 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6021 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6022 && Present (Full_View (gnat_entity))
6023 && No (Freeze_Node (Full_View (gnat_entity))))
6024 || Is_Concurrent_Type (gnat_entity)
6025 || (IN (Ekind (gnat_entity), Record_Kind)
6026 && Is_Concurrent_Record_Type (gnat_entity)));
6030 /* Reset the saved tree, if any, and elaborate the object or type for real.
6031 If there is a full declaration, elaborate it and copy the type to
6032 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6033 a class wide type or subtype. */
6036 save_gnu_tree (gnat_entity, NULL_TREE, false);
6037 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6038 && Present (Full_View (gnat_entity))
6039 && present_gnu_tree (Full_View (gnat_entity)))
6040 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6041 if (Present (Class_Wide_Type (gnat_entity))
6042 && Class_Wide_Type (gnat_entity) != gnat_entity)
6043 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6046 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6047 && Present (Full_View (gnat_entity)))
6049 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6051 /* Propagate back-annotations from full view to partial view. */
6052 if (Unknown_Alignment (gnat_entity))
6053 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6055 if (Unknown_Esize (gnat_entity))
6056 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6058 if (Unknown_RM_Size (gnat_entity))
6059 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6061 /* The above call may have defined this entity (the simplest example
6062 of this is when we have a private enumeral type since the bounds
6063 will have the public view. */
6064 if (!present_gnu_tree (gnat_entity))
6065 save_gnu_tree (gnat_entity, gnu_new, false);
6066 if (Present (Class_Wide_Type (gnat_entity))
6067 && Class_Wide_Type (gnat_entity) != gnat_entity)
6068 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6071 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6073 /* If we've made any pointers to the old version of this type, we
6074 have to update them. */
6076 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6077 TREE_TYPE (gnu_new));
6080 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6081 N_Compilation_Unit. */
6084 process_inlined_subprograms (Node_Id gnat_node)
6086 Entity_Id gnat_entity;
6089 /* If we can inline, generate Gimple for all the inlined subprograms.
6090 Define the entity first so we set DECL_EXTERNAL. */
6092 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6093 Present (gnat_entity);
6094 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6096 gnat_body = Parent (Declaration_Node (gnat_entity));
6098 if (Nkind (gnat_body) != N_Subprogram_Body)
6100 /* ??? This really should always be Present. */
6101 if (No (Corresponding_Body (gnat_body)))
6105 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6108 if (Present (gnat_body))
6110 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6111 add_stmt (gnat_to_gnu (gnat_body));
6116 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6117 We make two passes, one to elaborate anything other than bodies (but
6118 we declare a function if there was no spec). The second pass
6119 elaborates the bodies.
6121 GNAT_END_LIST gives the element in the list past the end. Normally,
6122 this is Empty, but can be First_Real_Statement for a
6123 Handled_Sequence_Of_Statements.
6125 We make a complete pass through both lists if PASS1P is true, then make
6126 the second pass over both lists if PASS2P is true. The lists usually
6127 correspond to the public and private parts of a package. */
6130 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6131 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6133 List_Id gnat_decl_array[2];
6137 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6140 for (i = 0; i <= 1; i++)
6141 if (Present (gnat_decl_array[i]))
6142 for (gnat_decl = First (gnat_decl_array[i]);
6143 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6145 /* For package specs, we recurse inside the declarations,
6146 thus taking the two pass approach inside the boundary. */
6147 if (Nkind (gnat_decl) == N_Package_Declaration
6148 && (Nkind (Specification (gnat_decl)
6149 == N_Package_Specification)))
6150 process_decls (Visible_Declarations (Specification (gnat_decl)),
6151 Private_Declarations (Specification (gnat_decl)),
6152 Empty, true, false);
6154 /* Similarly for any declarations in the actions of a
6156 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6158 process_freeze_entity (gnat_decl);
6159 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6162 /* Package bodies with freeze nodes get their elaboration deferred
6163 until the freeze node, but the code must be placed in the right
6164 place, so record the code position now. */
6165 else if (Nkind (gnat_decl) == N_Package_Body
6166 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6167 record_code_position (gnat_decl);
6169 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6170 && Present (Library_Unit (gnat_decl))
6171 && Present (Freeze_Node
6174 (Library_Unit (gnat_decl)))))))
6175 record_code_position
6176 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6178 /* We defer most subprogram bodies to the second pass. */
6179 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6181 if (Acts_As_Spec (gnat_decl))
6183 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6185 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6186 && Ekind (gnat_subprog_id) != E_Generic_Function)
6187 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6191 /* For bodies and stubs that act as their own specs, the entity
6192 itself must be elaborated in the first pass, because it may
6193 be used in other declarations. */
6194 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6196 Node_Id gnat_subprog_id
6197 = Defining_Entity (Specification (gnat_decl));
6199 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6200 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6201 && Ekind (gnat_subprog_id) != E_Generic_Function)
6202 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6205 /* Concurrent stubs stand for the corresponding subprogram bodies,
6206 which are deferred like other bodies. */
6207 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6208 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6212 add_stmt (gnat_to_gnu (gnat_decl));
6215 /* Here we elaborate everything we deferred above except for package bodies,
6216 which are elaborated at their freeze nodes. Note that we must also
6217 go inside things (package specs and freeze nodes) the first pass did. */
6219 for (i = 0; i <= 1; i++)
6220 if (Present (gnat_decl_array[i]))
6221 for (gnat_decl = First (gnat_decl_array[i]);
6222 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6224 if (Nkind (gnat_decl) == N_Subprogram_Body
6225 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6226 || Nkind (gnat_decl) == N_Task_Body_Stub
6227 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6228 add_stmt (gnat_to_gnu (gnat_decl));
6230 else if (Nkind (gnat_decl) == N_Package_Declaration
6231 && (Nkind (Specification (gnat_decl)
6232 == N_Package_Specification)))
6233 process_decls (Visible_Declarations (Specification (gnat_decl)),
6234 Private_Declarations (Specification (gnat_decl)),
6235 Empty, false, true);
6237 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6238 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6242 /* Make a unary operation of kind CODE using build_unary_op, but guard
6243 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6244 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6245 the operation is to be performed in that type. GNAT_NODE is the gnat
6246 node conveying the source location for which the error should be
6250 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6253 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6255 operand = protect_multiple_eval (operand);
6257 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6258 operand, TYPE_MIN_VALUE (gnu_type)),
6259 build_unary_op (code, gnu_type, operand),
6260 CE_Overflow_Check_Failed, gnat_node);
6263 /* Make a binary operation of kind CODE using build_binary_op, but guard
6264 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6265 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6266 Usually the operation is to be performed in that type. GNAT_NODE is
6267 the GNAT node conveying the source location for which the error should
6271 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6272 tree right, Node_Id gnat_node)
6274 tree lhs = protect_multiple_eval (left);
6275 tree rhs = protect_multiple_eval (right);
6276 tree type_max = TYPE_MAX_VALUE (gnu_type);
6277 tree type_min = TYPE_MIN_VALUE (gnu_type);
6280 tree zero = convert (gnu_type, integer_zero_node);
6285 int precision = TYPE_PRECISION (gnu_type);
6287 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6289 /* Prefer a constant or known-positive rhs to simplify checks. */
6290 if (!TREE_CONSTANT (rhs)
6291 && commutative_tree_code (code)
6292 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6293 && tree_expr_nonnegative_p (lhs))))
6300 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6302 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6304 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6306 /* Try a few strategies that may be cheaper than the general
6307 code at the end of the function, if the rhs is not known.
6309 - Call library function for 64-bit multiplication (complex)
6310 - Widen, if input arguments are sufficiently small
6311 - Determine overflow using wrapped result for addition/subtraction. */
6313 if (!TREE_CONSTANT (rhs))
6315 /* Even for add/subtract double size to get another base type. */
6316 int needed_precision = precision * 2;
6318 if (code == MULT_EXPR && precision == 64)
6320 tree int_64 = gnat_type_for_size (64, 0);
6322 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6323 convert (int_64, lhs),
6324 convert (int_64, rhs)));
6327 else if (needed_precision <= BITS_PER_WORD
6328 || (code == MULT_EXPR
6329 && needed_precision <= LONG_LONG_TYPE_SIZE))
6331 tree wide_type = gnat_type_for_size (needed_precision, 0);
6333 tree wide_result = build_binary_op (code, wide_type,
6334 convert (wide_type, lhs),
6335 convert (wide_type, rhs));
6337 tree check = build_binary_op
6338 (TRUTH_ORIF_EXPR, integer_type_node,
6339 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6340 convert (wide_type, type_min)),
6341 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6342 convert (wide_type, type_max)));
6344 tree result = convert (gnu_type, wide_result);
6347 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6350 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6352 tree unsigned_type = gnat_type_for_size (precision, 1);
6353 tree wrapped_expr = convert
6354 (gnu_type, build_binary_op (code, unsigned_type,
6355 convert (unsigned_type, lhs),
6356 convert (unsigned_type, rhs)));
6358 tree result = convert
6359 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6361 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6362 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6363 tree check = build_binary_op
6364 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6365 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6366 integer_type_node, wrapped_expr, lhs));
6369 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6376 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6377 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6378 build_binary_op (MINUS_EXPR, gnu_type,
6381 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6382 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6383 build_binary_op (MINUS_EXPR, gnu_type,
6388 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6389 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6390 build_binary_op (PLUS_EXPR, gnu_type,
6393 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6394 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6395 build_binary_op (PLUS_EXPR, gnu_type,
6400 /* The check here is designed to be efficient if the rhs is constant,
6401 but it will work for any rhs by using integer division.
6402 Four different check expressions determine wether X * C overflows,
6405 C > 0 => X > type_max / C || X < type_min / C
6406 C == -1 => X == type_min
6407 C < -1 => X > type_min / C || X < type_max / C */
6409 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6410 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6412 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6413 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6414 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6415 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6416 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6418 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6419 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6420 build_int_cst (gnu_type, -1)),
6421 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6422 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6423 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6424 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6431 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6433 /* If we can fold the expression to a constant, just return it.
6434 The caller will deal with overflow, no need to generate a check. */
6435 if (TREE_CONSTANT (gnu_expr))
6438 check = fold_build3 (COND_EXPR, integer_type_node,
6439 rhs_lt_zero, check_neg, check_pos);
6441 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6444 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6445 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6446 which we have to check. GNAT_NODE is the GNAT node conveying the source
6447 location for which the error should be signaled. */
6450 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6452 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6453 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6454 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6455 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6457 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6458 This can for example happen when translating 'Val or 'Value. */
6459 if (gnu_compare_type == gnu_range_type)
6462 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6463 we can't do anything since we might be truncating the bounds. No
6464 check is needed in this case. */
6465 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6466 && (TYPE_PRECISION (gnu_compare_type)
6467 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6470 /* Checked expressions must be evaluated only once. */
6471 gnu_expr = protect_multiple_eval (gnu_expr);
6473 /* There's no good type to use here, so we might as well use
6474 integer_type_node. Note that the form of the check is
6475 (not (expr >= lo)) or (not (expr <= hi))
6476 the reason for this slightly convoluted form is that NaNs
6477 are not considered to be in range in the float case. */
6479 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6481 (build_binary_op (GE_EXPR, integer_type_node,
6482 convert (gnu_compare_type, gnu_expr),
6483 convert (gnu_compare_type, gnu_low))),
6485 (build_binary_op (LE_EXPR, integer_type_node,
6486 convert (gnu_compare_type, gnu_expr),
6487 convert (gnu_compare_type,
6489 gnu_expr, CE_Range_Check_Failed, gnat_node);
6492 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6493 we are about to index, GNU_EXPR is the index expression to be checked,
6494 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6495 has to be checked. Note that for index checking we cannot simply use the
6496 emit_range_check function (although very similar code needs to be generated
6497 in both cases) since for index checking the array type against which we are
6498 checking the indices may be unconstrained and consequently we need to get
6499 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6500 The place where we need to do that is in subprograms having unconstrained
6501 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6502 location for which the error should be signaled. */
6505 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6506 tree gnu_high, Node_Id gnat_node)
6508 tree gnu_expr_check;
6510 /* Checked expressions must be evaluated only once. */
6511 gnu_expr = protect_multiple_eval (gnu_expr);
6513 /* Must do this computation in the base type in case the expression's
6514 type is an unsigned subtypes. */
6515 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6517 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6518 the object we are handling. */
6519 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6520 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6522 /* There's no good type to use here, so we might as well use
6523 integer_type_node. */
6525 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6526 build_binary_op (LT_EXPR, integer_type_node,
6528 convert (TREE_TYPE (gnu_expr_check),
6530 build_binary_op (GT_EXPR, integer_type_node,
6532 convert (TREE_TYPE (gnu_expr_check),
6534 gnu_expr, CE_Index_Check_Failed, gnat_node);
6537 /* GNU_COND contains the condition corresponding to an access, discriminant or
6538 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6539 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6540 REASON is the code that says why the exception was raised. GNAT_NODE is
6541 the GNAT node conveying the source location for which the error should be
6545 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6548 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6550 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6551 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6552 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6555 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6556 we don't need to evaluate it just for the check. */
6557 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6559 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6560 we will repeatedly do the test and, at compile time, we will repeatedly
6561 visit it during unsharing, which leads to an exponential explosion. */
6562 return save_expr (gnu_result);
6565 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6566 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6567 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6568 float to integer conversion with truncation; otherwise round.
6569 GNAT_NODE is the GNAT node conveying the source location for which the
6570 error should be signaled. */
6573 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6574 bool rangep, bool truncatep, Node_Id gnat_node)
6576 tree gnu_type = get_unpadded_type (gnat_type);
6577 tree gnu_in_type = TREE_TYPE (gnu_expr);
6578 tree gnu_in_basetype = get_base_type (gnu_in_type);
6579 tree gnu_base_type = get_base_type (gnu_type);
6580 tree gnu_result = gnu_expr;
6582 /* If we are not doing any checks, the output is an integral type, and
6583 the input is not a floating type, just do the conversion. This
6584 shortcut is required to avoid problems with packed array types
6585 and simplifies code in all cases anyway. */
6586 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6587 && !FLOAT_TYPE_P (gnu_in_type))
6588 return convert (gnu_type, gnu_expr);
6590 /* First convert the expression to its base type. This
6591 will never generate code, but makes the tests below much simpler.
6592 But don't do this if converting from an integer type to an unconstrained
6593 array type since then we need to get the bounds from the original
6595 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6596 gnu_result = convert (gnu_in_basetype, gnu_result);
6598 /* If overflow checks are requested, we need to be sure the result will
6599 fit in the output base type. But don't do this if the input
6600 is integer and the output floating-point. */
6602 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6604 /* Ensure GNU_EXPR only gets evaluated once. */
6605 tree gnu_input = protect_multiple_eval (gnu_result);
6606 tree gnu_cond = integer_zero_node;
6607 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6608 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6609 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6610 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6612 /* Convert the lower bounds to signed types, so we're sure we're
6613 comparing them properly. Likewise, convert the upper bounds
6614 to unsigned types. */
6615 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6616 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6618 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6619 && !TYPE_UNSIGNED (gnu_in_basetype))
6620 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6622 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6623 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6625 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6626 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6628 /* Check each bound separately and only if the result bound
6629 is tighter than the bound on the input type. Note that all the
6630 types are base types, so the bounds must be constant. Also,
6631 the comparison is done in the base type of the input, which
6632 always has the proper signedness. First check for input
6633 integer (which means output integer), output float (which means
6634 both float), or mixed, in which case we always compare.
6635 Note that we have to do the comparison which would *fail* in the
6636 case of an error since if it's an FP comparison and one of the
6637 values is a NaN or Inf, the comparison will fail. */
6638 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6639 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6640 : (FLOAT_TYPE_P (gnu_base_type)
6641 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6642 TREE_REAL_CST (gnu_out_lb))
6646 (build_binary_op (GE_EXPR, integer_type_node,
6647 gnu_input, convert (gnu_in_basetype,
6650 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6651 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6652 : (FLOAT_TYPE_P (gnu_base_type)
6653 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6654 TREE_REAL_CST (gnu_in_lb))
6657 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6659 (build_binary_op (LE_EXPR, integer_type_node,
6661 convert (gnu_in_basetype,
6664 if (!integer_zerop (gnu_cond))
6665 gnu_result = emit_check (gnu_cond, gnu_input,
6666 CE_Overflow_Check_Failed, gnat_node);
6669 /* Now convert to the result base type. If this is a non-truncating
6670 float-to-integer conversion, round. */
6671 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6674 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6675 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6676 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6677 const struct real_format *fmt;
6679 /* The following calculations depend on proper rounding to even
6680 of each arithmetic operation. In order to prevent excess
6681 precision from spoiling this property, use the widest hardware
6682 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6684 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6686 /* FIXME: Should not have padding in the first place. */
6687 if (TREE_CODE (calc_type) == RECORD_TYPE
6688 && TYPE_IS_PADDING_P (calc_type))
6689 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6691 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6692 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6693 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6694 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6695 half_minus_pred_half);
6696 gnu_pred_half = build_real (calc_type, pred_half);
6698 /* If the input is strictly negative, subtract this value
6699 and otherwise add it from the input. For 0.5, the result
6700 is exactly between 1.0 and the machine number preceding 1.0
6701 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6702 will round to 1.0, while all other number with an absolute
6703 value less than 0.5 round to 0.0. For larger numbers exactly
6704 halfway between integers, rounding will always be correct as
6705 the true mathematical result will be closer to the higher
6706 integer compared to the lower one. So, this constant works
6707 for all floating-point numbers.
6709 The reason to use the same constant with subtract/add instead
6710 of a positive and negative constant is to allow the comparison
6711 to be scheduled in parallel with retrieval of the constant and
6712 conversion of the input to the calc_type (if necessary). */
6714 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6715 gnu_saved_result = save_expr (gnu_result);
6716 gnu_conv = convert (calc_type, gnu_saved_result);
6717 gnu_comp = build2 (GE_EXPR, integer_type_node,
6718 gnu_saved_result, gnu_zero);
6720 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6721 gnu_subtract_pred_half
6722 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6723 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6724 gnu_add_pred_half, gnu_subtract_pred_half);
6727 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6728 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6729 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6730 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6732 gnu_result = convert (gnu_base_type, gnu_result);
6734 /* Finally, do the range check if requested. Note that if the
6735 result type is a modular type, the range check is actually
6736 an overflow check. */
6739 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6740 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6741 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6743 return convert (gnu_type, gnu_result);
6746 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6749 smaller_packable_type_p (tree type, tree record_type)
6753 /* We're not interested in variants here. */
6754 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6757 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6758 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6761 size = TYPE_SIZE (type);
6762 rsize = TYPE_SIZE (record_type);
6764 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6767 return tree_int_cst_lt (size, rsize) != 0;
6770 /* Return true if GNU_EXPR can be directly addressed. This is the case
6771 unless it is an expression involving computation or if it involves a
6772 reference to a bitfield or to an object not sufficiently aligned for
6773 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6774 be directly addressed as an object of this type.
6776 *** Notes on addressability issues in the Ada compiler ***
6778 This predicate is necessary in order to bridge the gap between Gigi
6779 and the middle-end about addressability of GENERIC trees. A tree
6780 is said to be addressable if it can be directly addressed, i.e. if
6781 its address can be taken, is a multiple of the type's alignment on
6782 strict-alignment architectures and returns the first storage unit
6783 assigned to the object represented by the tree.
6785 In the C family of languages, everything is in practice addressable
6786 at the language level, except for bit-fields. This means that these
6787 compilers will take the address of any tree that doesn't represent
6788 a bit-field reference and expect the result to be the first storage
6789 unit assigned to the object. Even in cases where this will result
6790 in unaligned accesses at run time, nothing is supposed to be done
6791 and the program is considered as erroneous instead (see PR c/18287).
6793 The implicit assumptions made in the middle-end are in keeping with
6794 the C viewpoint described above:
6795 - the address of a bit-field reference is supposed to be never
6796 taken; the compiler (generally) will stop on such a construct,
6797 - any other tree is addressable if it is formally addressable,
6798 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6800 In Ada, the viewpoint is the opposite one: nothing is addressable
6801 at the language level unless explicitly declared so. This means
6802 that the compiler will both make sure that the trees representing
6803 references to addressable ("aliased" in Ada parlance) objects are
6804 addressable and make no real attempts at ensuring that the trees
6805 representing references to non-addressable objects are addressable.
6807 In the first case, Ada is effectively equivalent to C and handing
6808 down the direct result of applying ADDR_EXPR to these trees to the
6809 middle-end works flawlessly. In the second case, Ada cannot afford
6810 to consider the program as erroneous if the address of trees that
6811 are not addressable is requested for technical reasons, unlike C;
6812 as a consequence, the Ada compiler must arrange for either making
6813 sure that this address is not requested in the middle-end or for
6814 compensating by inserting temporaries if it is requested in Gigi.
6816 The first goal can be achieved because the middle-end should not
6817 request the address of non-addressable trees on its own; the only
6818 exception is for the invocation of low-level block operations like
6819 memcpy, for which the addressability requirements are lower since
6820 the type's alignment can be disregarded. In practice, this means
6821 that Gigi must make sure that such operations cannot be applied to
6822 non-BLKmode bit-fields.
6824 The second goal is achieved by means of the addressable_p predicate
6825 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6826 They will be turned during gimplification into proper temporaries
6827 whose address will be used in lieu of that of the original tree. */
6830 addressable_p (tree gnu_expr, tree gnu_type)
6832 /* The size of the real type of the object must not be smaller than
6833 that of the expected type, otherwise an indirect access in the
6834 latter type would be larger than the object. Only records need
6835 to be considered in practice. */
6837 && TREE_CODE (gnu_type) == RECORD_TYPE
6838 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6841 switch (TREE_CODE (gnu_expr))
6847 /* All DECLs are addressable: if they are in a register, we can force
6851 case UNCONSTRAINED_ARRAY_REF:
6862 /* We accept &COND_EXPR as soon as both operands are addressable and
6863 expect the outcome to be the address of the selected operand. */
6864 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6865 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6868 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6869 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6870 the field is sufficiently aligned, in case it is subject
6871 to a pragma Component_Alignment. But we don't need to
6872 check the alignment of the containing record, as it is
6873 guaranteed to be not smaller than that of its most
6874 aligned field that is not a bit-field. */
6875 && (!STRICT_ALIGNMENT
6876 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6877 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6878 /* The field of a padding record is always addressable. */
6879 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6880 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6882 case ARRAY_REF: case ARRAY_RANGE_REF:
6883 case REALPART_EXPR: case IMAGPART_EXPR:
6885 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6888 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6889 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6891 case VIEW_CONVERT_EXPR:
6893 /* This is addressable if we can avoid a copy. */
6894 tree type = TREE_TYPE (gnu_expr);
6895 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6896 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6897 && (!STRICT_ALIGNMENT
6898 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6899 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6900 || ((TYPE_MODE (type) == BLKmode
6901 || TYPE_MODE (inner_type) == BLKmode)
6902 && (!STRICT_ALIGNMENT
6903 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6904 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6905 || TYPE_ALIGN_OK (type)
6906 || TYPE_ALIGN_OK (inner_type))))
6907 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6915 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6916 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6917 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6920 process_type (Entity_Id gnat_entity)
6923 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6926 /* If we are to delay elaboration of this type, just do any
6927 elaborations needed for expressions within the declaration and
6928 make a dummy type entry for this node and its Full_View (if
6929 any) in case something points to it. Don't do this if it
6930 has already been done (the only way that can happen is if
6931 the private completion is also delayed). */
6932 if (Present (Freeze_Node (gnat_entity))
6933 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6934 && Present (Full_View (gnat_entity))
6935 && Freeze_Node (Full_View (gnat_entity))
6936 && !present_gnu_tree (Full_View (gnat_entity))))
6938 elaborate_entity (gnat_entity);
6942 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6943 save_gnu_tree (gnat_entity, gnu_decl, false);
6944 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6945 && Present (Full_View (gnat_entity)))
6946 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6952 /* If we saved away a dummy type for this node it means that this
6953 made the type that corresponds to the full type of an incomplete
6954 type. Clear that type for now and then update the type in the
6958 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6959 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6961 save_gnu_tree (gnat_entity, NULL_TREE, false);
6964 /* Now fully elaborate the type. */
6965 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
6966 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
6968 /* If we have an old type and we've made pointers to this type,
6969 update those pointers. */
6971 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6972 TREE_TYPE (gnu_new));
6974 /* If this is a record type corresponding to a task or protected type
6975 that is a completion of an incomplete type, perform a similar update
6976 on the type. ??? Including protected types here is a guess. */
6977 if (IN (Ekind (gnat_entity), Record_Kind)
6978 && Is_Concurrent_Record_Type (gnat_entity)
6979 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
6982 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
6984 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6986 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6989 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
6990 TREE_TYPE (gnu_new));
6994 /* GNAT_ENTITY is the type of the resulting constructors,
6995 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
6996 and GNU_TYPE is the GCC type of the corresponding record.
6998 Return a CONSTRUCTOR to build the record. */
7001 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7003 tree gnu_list, gnu_result;
7005 /* We test for GNU_FIELD being empty in the case where a variant
7006 was the last thing since we don't take things off GNAT_ASSOC in
7007 that case. We check GNAT_ASSOC in case we have a variant, but it
7010 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7011 gnat_assoc = Next (gnat_assoc))
7013 Node_Id gnat_field = First (Choices (gnat_assoc));
7014 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7015 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7017 /* The expander is supposed to put a single component selector name
7018 in every record component association. */
7019 gcc_assert (No (Next (gnat_field)));
7021 /* Ignore fields that have Corresponding_Discriminants since we'll
7022 be setting that field in the parent. */
7023 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7024 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7027 /* Also ignore discriminants of Unchecked_Unions. */
7028 else if (Is_Unchecked_Union (gnat_entity)
7029 && Ekind (Entity (gnat_field)) == E_Discriminant)
7032 /* Before assigning a value in an aggregate make sure range checks
7033 are done if required. Then convert to the type of the field. */
7034 if (Do_Range_Check (Expression (gnat_assoc)))
7035 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7037 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7039 /* Add the field and expression to the list. */
7040 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7043 gnu_result = extract_values (gnu_list, gnu_type);
7045 #ifdef ENABLE_CHECKING
7049 /* Verify every entry in GNU_LIST was used. */
7050 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7051 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7058 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7059 the first element of an array aggregate. It may itself be an aggregate.
7060 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7061 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7062 for range checking. */
7065 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7066 Entity_Id gnat_component_type)
7068 tree gnu_expr_list = NULL_TREE;
7069 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7072 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7074 /* If the expression is itself an array aggregate then first build the
7075 innermost constructor if it is part of our array (multi-dimensional
7077 if (Nkind (gnat_expr) == N_Aggregate
7078 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7079 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7080 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7081 TREE_TYPE (gnu_array_type),
7082 gnat_component_type);
7085 gnu_expr = gnat_to_gnu (gnat_expr);
7087 /* Before assigning the element to the array, make sure it is
7089 if (Do_Range_Check (gnat_expr))
7090 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7094 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7097 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7100 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7103 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7104 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7105 of the associations that are from RECORD_TYPE. If we see an internal
7106 record, make a recursive call to fill it in as well. */
7109 extract_values (tree values, tree record_type)
7111 tree result = NULL_TREE;
7114 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7118 /* _Parent is an internal field, but may have values in the aggregate,
7119 so check for values first. */
7120 if ((tem = purpose_member (field, values)))
7122 value = TREE_VALUE (tem);
7123 TREE_ADDRESSABLE (tem) = 1;
7126 else if (DECL_INTERNAL_P (field))
7128 value = extract_values (values, TREE_TYPE (field));
7129 if (TREE_CODE (value) == CONSTRUCTOR
7130 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7134 /* If we have a record subtype, the names will match, but not the
7135 actual FIELD_DECLs. */
7136 for (tem = values; tem; tem = TREE_CHAIN (tem))
7137 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7139 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7140 TREE_ADDRESSABLE (tem) = 1;
7146 result = tree_cons (field, value, result);
7149 return gnat_build_constructor (record_type, nreverse (result));
7152 /* EXP is to be treated as an array or record. Handle the cases when it is
7153 an access object and perform the required dereferences. */
7156 maybe_implicit_deref (tree exp)
7158 /* If the type is a pointer, dereference it. */
7160 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7161 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7163 /* If we got a padded type, remove it too. */
7164 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7165 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7166 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7171 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7174 protect_multiple_eval (tree exp)
7176 tree type = TREE_TYPE (exp);
7178 /* If this has no side effects, we don't need to do anything. */
7179 if (!TREE_SIDE_EFFECTS (exp))
7182 /* If it is a conversion, protect what's inside the conversion.
7183 Similarly, if we're indirectly referencing something, we only
7184 actually need to protect the address since the data itself can't
7185 change in these situations. */
7186 else if (TREE_CODE (exp) == NON_LVALUE_EXPR
7187 || CONVERT_EXPR_P (exp)
7188 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7189 || TREE_CODE (exp) == INDIRECT_REF
7190 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7191 return build1 (TREE_CODE (exp), type,
7192 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7194 /* If EXP is a fat pointer or something that can be placed into a register,
7195 just make a SAVE_EXPR. */
7196 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7197 return save_expr (exp);
7199 /* Otherwise, dereference, protect the address, and re-reference. */
7202 build_unary_op (INDIRECT_REF, type,
7203 save_expr (build_unary_op (ADDR_EXPR,
7204 build_reference_type (type),
7208 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7209 handle our own nodes and we take extra arguments. FORCE says whether to
7210 force evaluation of everything. We set SUCCESS to true unless we walk
7211 through something we don't know how to stabilize. */
7214 maybe_stabilize_reference (tree ref, bool force, bool *success)
7216 tree type = TREE_TYPE (ref);
7217 enum tree_code code = TREE_CODE (ref);
7220 /* Assume we'll success unless proven otherwise. */
7229 /* No action is needed in this case. */
7235 case FIX_TRUNC_EXPR:
7236 case VIEW_CONVERT_EXPR:
7238 = build1 (code, type,
7239 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7244 case UNCONSTRAINED_ARRAY_REF:
7245 result = build1 (code, type,
7246 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7251 result = build3 (COMPONENT_REF, type,
7252 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7254 TREE_OPERAND (ref, 1), NULL_TREE);
7258 result = build3 (BIT_FIELD_REF, type,
7259 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7261 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7263 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7268 case ARRAY_RANGE_REF:
7269 result = build4 (code, type,
7270 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7272 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7274 NULL_TREE, NULL_TREE);
7278 result = gnat_stabilize_reference_1 (ref, force);
7282 /* This generates better code than the scheme in protect_multiple_eval
7283 because large objects will be returned via invisible reference in
7284 most ABIs so the temporary will directly be filled by the callee. */
7285 result = gnat_stabilize_reference_1 (ref, force);
7289 /* Constructors with 1 element are used extensively to formally
7290 convert objects to special wrapping types. */
7291 if (TREE_CODE (type) == RECORD_TYPE
7292 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7295 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7297 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7299 = build_constructor_single (type, index,
7300 gnat_stabilize_reference_1 (value,
7311 ref = error_mark_node;
7313 /* ... fall through to failure ... */
7315 /* If arg isn't a kind of lvalue we recognize, make no change.
7316 Caller should recognize the error for an invalid lvalue. */
7322 TREE_READONLY (result) = TREE_READONLY (ref);
7324 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7325 expression may not be sustained across some paths, such as the way via
7326 build1 for INDIRECT_REF. We re-populate those flags here for the general
7327 case, which is consistent with the GCC version of this routine.
7329 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7330 paths introduce side effects where there was none initially (e.g. calls
7331 to save_expr), and we also want to keep track of that. */
7333 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7334 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7339 /* Wrapper around maybe_stabilize_reference, for common uses without
7340 lvalue restrictions and without need to examine the success
7344 gnat_stabilize_reference (tree ref, bool force)
7347 return maybe_stabilize_reference (ref, force, &dummy);
7350 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7351 arg to force a SAVE_EXPR for everything. */
7354 gnat_stabilize_reference_1 (tree e, bool force)
7356 enum tree_code code = TREE_CODE (e);
7357 tree type = TREE_TYPE (e);
7360 /* We cannot ignore const expressions because it might be a reference
7361 to a const array but whose index contains side-effects. But we can
7362 ignore things that are actual constant or that already have been
7363 handled by this function. */
7365 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7368 switch (TREE_CODE_CLASS (code))
7370 case tcc_exceptional:
7372 case tcc_declaration:
7373 case tcc_comparison:
7375 case tcc_expression:
7378 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7379 fat pointer. This may be more efficient, but will also allow
7380 us to more easily find the match for the PLACEHOLDER_EXPR. */
7381 if (code == COMPONENT_REF
7382 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7383 result = build3 (COMPONENT_REF, type,
7384 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7386 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7387 else if (TREE_SIDE_EFFECTS (e) || force)
7388 return save_expr (e);
7394 /* Constants need no processing. In fact, we should never reach
7399 /* Recursively stabilize each operand. */
7400 result = build2 (code, type,
7401 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7402 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7407 /* Recursively stabilize each operand. */
7408 result = build1 (code, type,
7409 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7417 TREE_READONLY (result) = TREE_READONLY (e);
7419 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7420 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7424 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7425 location and false if it doesn't. In the former case, set the Gigi global
7426 variable REF_FILENAME to the simple debug file name as given by sinput. */
7429 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7431 if (Sloc == No_Location)
7434 if (Sloc <= Standard_Location)
7436 *locus = BUILTINS_LOCATION;
7441 Source_File_Index file = Get_Source_File_Index (Sloc);
7442 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7443 Column_Number column = Get_Column_Number (Sloc);
7444 struct line_map *map = &line_table->maps[file - 1];
7446 /* Translate the location according to the line-map.h formula. */
7447 *locus = map->start_location
7448 + ((line - map->to_line) << map->column_bits)
7449 + (column & ((1 << map->column_bits) - 1));
7453 = IDENTIFIER_POINTER
7455 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7460 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7461 don't do anything if it doesn't correspond to a source location. */
7464 set_expr_location_from_node (tree node, Node_Id gnat_node)
7468 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7471 SET_EXPR_LOCATION (node, locus);
7474 /* Return a colon-separated list of encodings contained in encoded Ada
7478 extract_encoding (const char *name)
7480 char *encoding = GGC_NEWVEC (char, strlen (name));
7481 get_encoding (name, encoding);
7485 /* Extract the Ada name from an encoded name. */
7488 decode_name (const char *name)
7490 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7491 __gnat_decode (name, decoded, 0);
7495 /* Post an error message. MSG is the error message, properly annotated.
7496 NODE is the node at which to post the error and the node to use for the
7497 "&" substitution. */
7500 post_error (const char *msg, Node_Id node)
7502 String_Template temp;
7505 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7506 fp.Array = msg, fp.Bounds = &temp;
7508 Error_Msg_N (fp, node);
7511 /* Similar, but NODE is the node at which to post the error and ENT
7512 is the node to use for the "&" substitution. */
7515 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7517 String_Template temp;
7520 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7521 fp.Array = msg, fp.Bounds = &temp;
7523 Error_Msg_NE (fp, node, ent);
7526 /* Similar, but NODE is the node at which to post the error, ENT is the node
7527 to use for the "&" substitution, and N is the number to use for the ^. */
7530 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7532 String_Template temp;
7535 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7536 fp.Array = msg, fp.Bounds = &temp;
7537 Error_Msg_Uint_1 = UI_From_Int (n);
7540 Error_Msg_NE (fp, node, ent);
7543 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7544 number to write. If the tree represents a constant that fits within
7545 a host integer, the text inside curly brackets in MSG will be output
7546 (presumably including a '^'). Otherwise that text will not be output
7547 and the text inside square brackets will be output instead. */
7550 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7552 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7553 String_Template temp = {1, 0};
7555 char start_yes, end_yes, start_no, end_no;
7559 fp.Array = newmsg, fp.Bounds = &temp;
7561 if (host_integerp (t, 1)
7562 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7565 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7569 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7570 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7573 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7575 for (p = msg, q = newmsg; *p; p++)
7577 if (*p == start_yes)
7578 for (p++; *p != end_yes; p++)
7580 else if (*p == start_no)
7581 for (p++; *p != end_no; p++)
7589 temp.High_Bound = strlen (newmsg);
7591 Error_Msg_NE (fp, node, ent);
7594 /* Similar to post_error_ne_tree, except that NUM is a second
7595 integer to write in the message. */
7598 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7601 Error_Msg_Uint_2 = UI_From_Int (num);
7602 post_error_ne_tree (msg, node, ent, t);
7605 /* Initialize the table that maps GNAT codes to GCC codes for simple
7606 binary and unary operations. */
7609 init_code_table (void)
7611 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7612 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7614 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7615 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7616 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7617 gnu_codes[N_Op_Eq] = EQ_EXPR;
7618 gnu_codes[N_Op_Ne] = NE_EXPR;
7619 gnu_codes[N_Op_Lt] = LT_EXPR;
7620 gnu_codes[N_Op_Le] = LE_EXPR;
7621 gnu_codes[N_Op_Gt] = GT_EXPR;
7622 gnu_codes[N_Op_Ge] = GE_EXPR;
7623 gnu_codes[N_Op_Add] = PLUS_EXPR;
7624 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7625 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7626 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7627 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7628 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7629 gnu_codes[N_Op_Abs] = ABS_EXPR;
7630 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7631 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7632 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7633 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7634 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7635 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7638 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7642 get_exception_label (char kind)
7644 if (kind == N_Raise_Constraint_Error)
7645 return TREE_VALUE (gnu_constraint_error_label_stack);
7646 else if (kind == N_Raise_Storage_Error)
7647 return TREE_VALUE (gnu_storage_error_label_stack);
7648 else if (kind == N_Raise_Program_Error)
7649 return TREE_VALUE (gnu_program_error_label_stack);
7654 #include "gt-ada-trans.h"