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 /* Always perform division using unsigned arithmetic as the size cannot
1394 be negative, but may be an overflowed positive value. This provides
1395 correct results for sizes up to 512 MB.
1397 ??? Size should be calculated in storage elements directly. */
1399 if (attribute == Attr_Max_Size_In_Storage_Elements)
1400 gnu_result = convert (sizetype,
1401 fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1402 gnu_result, bitsize_unit_node));
1405 case Attr_Alignment:
1406 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1407 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1409 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1410 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1412 gnu_type = TREE_TYPE (gnu_prefix);
1413 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1414 prefix_unused = true;
1416 gnu_result = size_int ((TREE_CODE (gnu_prefix) == COMPONENT_REF
1417 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1))
1418 : TYPE_ALIGN (gnu_type)) / BITS_PER_UNIT);
1423 case Attr_Range_Length:
1424 prefix_unused = true;
1426 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1428 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1430 if (attribute == Attr_First)
1431 gnu_result = TYPE_MIN_VALUE (gnu_type);
1432 else if (attribute == Attr_Last)
1433 gnu_result = TYPE_MAX_VALUE (gnu_type);
1437 (MAX_EXPR, get_base_type (gnu_result_type),
1439 (PLUS_EXPR, get_base_type (gnu_result_type),
1440 build_binary_op (MINUS_EXPR,
1441 get_base_type (gnu_result_type),
1442 convert (gnu_result_type,
1443 TYPE_MAX_VALUE (gnu_type)),
1444 convert (gnu_result_type,
1445 TYPE_MIN_VALUE (gnu_type))),
1446 convert (gnu_result_type, integer_one_node)),
1447 convert (gnu_result_type, integer_zero_node));
1452 /* ... fall through ... */
1456 int Dimension = (Present (Expressions (gnat_node))
1457 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1459 struct parm_attr *pa = NULL;
1460 Entity_Id gnat_param = Empty;
1462 /* Make sure any implicit dereference gets done. */
1463 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1464 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1465 /* We treat unconstrained array In parameters specially. */
1466 if (Nkind (Prefix (gnat_node)) == N_Identifier
1467 && !Is_Constrained (Etype (Prefix (gnat_node)))
1468 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1469 gnat_param = Entity (Prefix (gnat_node));
1470 gnu_type = TREE_TYPE (gnu_prefix);
1471 prefix_unused = true;
1472 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1474 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1479 for (ndim = 1, gnu_type_temp = gnu_type;
1480 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1481 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1482 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1485 Dimension = ndim + 1 - Dimension;
1488 for (i = 1; i < Dimension; i++)
1489 gnu_type = TREE_TYPE (gnu_type);
1491 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1493 /* When not optimizing, look up the slot associated with the parameter
1494 and the dimension in the cache and create a new one on failure. */
1495 if (!optimize && Present (gnat_param))
1497 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1498 if (pa->id == gnat_param && pa->dim == Dimension)
1503 pa = GGC_CNEW (struct parm_attr);
1504 pa->id = gnat_param;
1505 pa->dim = Dimension;
1506 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1510 /* Return the cached expression or build a new one. */
1511 if (attribute == Attr_First)
1513 if (pa && pa->first)
1515 gnu_result = pa->first;
1520 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1523 else if (attribute == Attr_Last)
1527 gnu_result = pa->last;
1532 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1535 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1537 if (pa && pa->length)
1539 gnu_result = pa->length;
1544 /* We used to compute the length as max (hb - lb + 1, 0),
1545 which could overflow for some cases of empty arrays, e.g.
1546 when lb == index_type'first. We now compute the length as
1547 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1548 much rarer cases, for extremely large arrays we expect
1549 never to encounter in practice. In addition, the former
1550 computation required the use of potentially constraining
1551 signed arithmetic while the latter doesn't. Note that the
1552 comparison must be done in the original index base type,
1553 otherwise the conversion of either bound to gnu_compute_type
1556 tree gnu_compute_type = get_base_type (gnu_result_type);
1559 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1561 = convert (gnu_compute_type, TYPE_MIN_VALUE (index_type));
1563 = convert (gnu_compute_type, TYPE_MAX_VALUE (index_type));
1567 (COND_EXPR, gnu_compute_type,
1568 build_binary_op (LT_EXPR, get_base_type (index_type),
1569 TYPE_MAX_VALUE (index_type),
1570 TYPE_MIN_VALUE (index_type)),
1571 convert (gnu_compute_type, integer_zero_node),
1573 (PLUS_EXPR, gnu_compute_type,
1574 build_binary_op (MINUS_EXPR, gnu_compute_type, hb, lb),
1575 convert (gnu_compute_type, integer_one_node)));
1579 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1580 handling. Note that these attributes could not have been used on
1581 an unconstrained array type. */
1582 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result,
1585 /* Cache the expression we have just computed. Since we want to do it
1586 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1587 create the temporary. */
1591 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1592 TREE_SIDE_EFFECTS (gnu_result) = 1;
1593 if (attribute == Attr_First)
1594 pa->first = gnu_result;
1595 else if (attribute == Attr_Last)
1596 pa->last = gnu_result;
1598 pa->length = gnu_result;
1603 case Attr_Bit_Position:
1605 case Attr_First_Bit:
1609 HOST_WIDE_INT bitsize;
1610 HOST_WIDE_INT bitpos;
1612 tree gnu_field_bitpos;
1613 tree gnu_field_offset;
1615 enum machine_mode mode;
1616 int unsignedp, volatilep;
1618 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1619 gnu_prefix = remove_conversions (gnu_prefix, true);
1620 prefix_unused = true;
1622 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1623 the result is 0. Don't allow 'Bit on a bare component, though. */
1624 if (attribute == Attr_Bit
1625 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1626 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1628 gnu_result = integer_zero_node;
1633 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1634 || (attribute == Attr_Bit_Position
1635 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1637 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1638 &mode, &unsignedp, &volatilep, false);
1640 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1642 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1643 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1645 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1646 TREE_CODE (gnu_inner) == COMPONENT_REF
1647 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1648 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1651 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1652 bit_position (TREE_OPERAND (gnu_inner, 1)));
1654 = size_binop (PLUS_EXPR, gnu_field_offset,
1655 byte_position (TREE_OPERAND (gnu_inner, 1)));
1658 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1660 gnu_field_bitpos = bit_position (gnu_prefix);
1661 gnu_field_offset = byte_position (gnu_prefix);
1665 gnu_field_bitpos = bitsize_zero_node;
1666 gnu_field_offset = size_zero_node;
1672 gnu_result = gnu_field_offset;
1675 case Attr_First_Bit:
1677 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1681 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1682 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1683 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1684 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1688 case Attr_Bit_Position:
1689 gnu_result = gnu_field_bitpos;
1693 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1695 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1702 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1703 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1705 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1706 gnu_result = build_binary_op (attribute == Attr_Min
1707 ? MIN_EXPR : MAX_EXPR,
1708 gnu_result_type, gnu_lhs, gnu_rhs);
1712 case Attr_Passed_By_Reference:
1713 gnu_result = size_int (default_pass_by_ref (gnu_type)
1714 || must_pass_by_ref (gnu_type));
1715 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1718 case Attr_Component_Size:
1719 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1720 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1722 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1723 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1725 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1726 gnu_type = TREE_TYPE (gnu_prefix);
1728 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1729 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1731 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1732 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1733 gnu_type = TREE_TYPE (gnu_type);
1735 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1737 /* Note this size cannot be self-referential. */
1738 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1739 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1740 prefix_unused = true;
1743 case Attr_Null_Parameter:
1744 /* This is just a zero cast to the pointer type for
1745 our prefix and dereferenced. */
1746 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1748 = build_unary_op (INDIRECT_REF, NULL_TREE,
1749 convert (build_pointer_type (gnu_result_type),
1750 integer_zero_node));
1751 TREE_PRIVATE (gnu_result) = 1;
1754 case Attr_Mechanism_Code:
1757 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1759 prefix_unused = true;
1760 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1761 if (Present (Expressions (gnat_node)))
1763 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1765 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1766 i--, gnat_obj = Next_Formal (gnat_obj))
1770 code = Mechanism (gnat_obj);
1771 if (code == Default)
1772 code = ((present_gnu_tree (gnat_obj)
1773 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1774 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1776 && (DECL_BY_COMPONENT_PTR_P
1777 (get_gnu_tree (gnat_obj))))))
1778 ? By_Reference : By_Copy);
1779 gnu_result = convert (gnu_result_type, size_int (- code));
1784 /* Say we have an unimplemented attribute. Then set the value to be
1785 returned to be a zero and hope that's something we can convert to the
1786 type of this attribute. */
1787 post_error ("unimplemented attribute", gnat_node);
1788 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1789 gnu_result = integer_zero_node;
1793 /* If this is an attribute where the prefix was unused, force a use of it if
1794 it has a side-effect. But don't do it if the prefix is just an entity
1795 name. However, if an access check is needed, we must do it. See second
1796 example in AARM 11.6(5.e). */
1797 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1798 && !Is_Entity_Name (Prefix (gnat_node)))
1799 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1800 gnu_prefix, gnu_result);
1802 *gnu_result_type_p = gnu_result_type;
1806 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1807 to a GCC tree, which is returned. */
1810 Case_Statement_to_gnu (Node_Id gnat_node)
1816 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1817 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1819 /* The range of values in a case statement is determined by the rules in
1820 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1821 of the expression. One exception arises in the case of a simple name that
1822 is parenthesized. This still has the Etype of the name, but since it is
1823 not a name, para 7 does not apply, and we need to go to the base type.
1824 This is the only case where parenthesization affects the dynamic
1825 semantics (i.e. the range of possible values at runtime that is covered
1826 by the others alternative.
1828 Another exception is if the subtype of the expression is non-static. In
1829 that case, we also have to use the base type. */
1830 if (Paren_Count (Expression (gnat_node)) != 0
1831 || !Is_OK_Static_Subtype (Underlying_Type
1832 (Etype (Expression (gnat_node)))))
1833 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1835 /* We build a SWITCH_EXPR that contains the code with interspersed
1836 CASE_LABEL_EXPRs for each label. */
1838 push_stack (&gnu_switch_label_stack, NULL_TREE, create_artificial_label ());
1839 start_stmt_group ();
1840 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1841 Present (gnat_when);
1842 gnat_when = Next_Non_Pragma (gnat_when))
1844 Node_Id gnat_choice;
1845 int choices_added = 0;
1847 /* First compile all the different case choices for the current WHEN
1849 for (gnat_choice = First (Discrete_Choices (gnat_when));
1850 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1852 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1854 switch (Nkind (gnat_choice))
1857 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1858 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1861 case N_Subtype_Indication:
1862 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1863 (Constraint (gnat_choice))));
1864 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1865 (Constraint (gnat_choice))));
1869 case N_Expanded_Name:
1870 /* This represents either a subtype range or a static value of
1871 some kind; Ekind says which. */
1872 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1874 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1876 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1877 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1881 /* ... fall through ... */
1883 case N_Character_Literal:
1884 case N_Integer_Literal:
1885 gnu_low = gnat_to_gnu (gnat_choice);
1888 case N_Others_Choice:
1895 /* If the case value is a subtype that raises Constraint_Error at
1896 run-time because of a wrong bound, then gnu_low or gnu_high is
1897 not translated into an INTEGER_CST. In such a case, we need
1898 to ensure that the when statement is not added in the tree,
1899 otherwise it will crash the gimplifier. */
1900 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1901 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1903 add_stmt_with_node (build3 (CASE_LABEL_EXPR, void_type_node,
1905 create_artificial_label ()),
1911 /* Push a binding level here in case variables are declared as we want
1912 them to be local to this set of statements instead of to the block
1913 containing the Case statement. */
1914 if (choices_added > 0)
1916 add_stmt (build_stmt_group (Statements (gnat_when), true));
1917 add_stmt (build1 (GOTO_EXPR, void_type_node,
1918 TREE_VALUE (gnu_switch_label_stack)));
1922 /* Now emit a definition of the label all the cases branched to. */
1923 add_stmt (build1 (LABEL_EXPR, void_type_node,
1924 TREE_VALUE (gnu_switch_label_stack)));
1925 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1926 end_stmt_group (), NULL_TREE);
1927 pop_stack (&gnu_switch_label_stack);
1932 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1933 to a GCC tree, which is returned. */
1936 Loop_Statement_to_gnu (Node_Id gnat_node)
1938 /* ??? It would be nice to use "build" here, but there's no build5. */
1939 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1940 NULL_TREE, NULL_TREE, NULL_TREE);
1941 tree gnu_loop_var = NULL_TREE;
1942 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1943 tree gnu_cond_expr = NULL_TREE;
1946 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1947 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1948 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label ();
1949 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1950 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1951 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1953 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1954 N_Exit_Statement can find it. */
1955 push_stack (&gnu_loop_label_stack, NULL_TREE,
1956 LOOP_STMT_LABEL (gnu_loop_stmt));
1958 /* Set the condition under which the loop must keep going.
1959 For the case "LOOP .... END LOOP;" the condition is always true. */
1960 if (No (gnat_iter_scheme))
1963 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1964 else if (Present (Condition (gnat_iter_scheme)))
1965 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1966 = gnat_to_gnu (Condition (gnat_iter_scheme));
1968 /* Otherwise we have an iteration scheme and the condition is given by
1969 the bounds of the subtype of the iteration variable. */
1972 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1973 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1974 Entity_Id gnat_type = Etype (gnat_loop_var);
1975 tree gnu_type = get_unpadded_type (gnat_type);
1976 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1977 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1978 tree gnu_first, gnu_last, gnu_limit;
1979 enum tree_code update_code, end_code;
1980 tree gnu_base_type = get_base_type (gnu_type);
1982 /* We must disable modulo reduction for the loop variable, if any,
1983 in order for the loop comparison to be effective. */
1984 if (Reverse_Present (gnat_loop_spec))
1986 gnu_first = gnu_high;
1988 update_code = MINUS_NOMOD_EXPR;
1990 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
1994 gnu_first = gnu_low;
1995 gnu_last = gnu_high;
1996 update_code = PLUS_NOMOD_EXPR;
1998 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
2001 /* We know the loop variable will not overflow if GNU_LAST is a constant
2002 and is not equal to GNU_LIMIT. If it might overflow, we have to move
2003 the limit test to the end of the loop. In that case, we have to test
2004 for an empty loop outside the loop. */
2005 if (TREE_CODE (gnu_last) != INTEGER_CST
2006 || TREE_CODE (gnu_limit) != INTEGER_CST
2007 || tree_int_cst_equal (gnu_last, gnu_limit))
2010 = build3 (COND_EXPR, void_type_node,
2011 build_binary_op (LE_EXPR, integer_type_node,
2013 NULL_TREE, alloc_stmt_list ());
2014 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2017 /* Open a new nesting level that will surround the loop to declare the
2018 loop index variable. */
2019 start_stmt_group ();
2022 /* Declare the loop index and set it to its initial value. */
2023 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2024 if (DECL_BY_REF_P (gnu_loop_var))
2025 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2027 /* The loop variable might be a padded type, so use `convert' to get a
2028 reference to the inner variable if so. */
2029 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2031 /* Set either the top or bottom exit condition as appropriate depending
2032 on whether or not we know an overflow cannot occur. */
2034 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2035 = build_binary_op (NE_EXPR, integer_type_node,
2036 gnu_loop_var, gnu_last);
2038 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2039 = build_binary_op (end_code, integer_type_node,
2040 gnu_loop_var, gnu_last);
2042 LOOP_STMT_UPDATE (gnu_loop_stmt)
2043 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2045 build_binary_op (update_code,
2046 TREE_TYPE (gnu_loop_var),
2048 convert (TREE_TYPE (gnu_loop_var),
2049 integer_one_node)));
2050 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2054 /* If the loop was named, have the name point to this loop. In this case,
2055 the association is not a ..._DECL node, but the end label from this
2057 if (Present (Identifier (gnat_node)))
2058 save_gnu_tree (Entity (Identifier (gnat_node)),
2059 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2061 /* Make the loop body into its own block, so any allocated storage will be
2062 released every iteration. This is needed for stack allocation. */
2063 LOOP_STMT_BODY (gnu_loop_stmt)
2064 = build_stmt_group (Statements (gnat_node), true);
2066 /* If we declared a variable, then we are in a statement group for that
2067 declaration. Add the LOOP_STMT to it and make that the "loop". */
2070 add_stmt (gnu_loop_stmt);
2072 gnu_loop_stmt = end_stmt_group ();
2075 /* If we have an outer COND_EXPR, that's our result and this loop is its
2076 "true" statement. Otherwise, the result is the LOOP_STMT. */
2079 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2080 gnu_result = gnu_cond_expr;
2081 recalculate_side_effects (gnu_cond_expr);
2084 gnu_result = gnu_loop_stmt;
2086 pop_stack (&gnu_loop_label_stack);
2091 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2092 handler for the current function. */
2094 /* This is implemented by issuing a call to the appropriate VMS specific
2095 builtin. To avoid having VMS specific sections in the global gigi decls
2096 array, we maintain the decls of interest here. We can't declare them
2097 inside the function because we must mark them never to be GC'd, which we
2098 can only do at the global level. */
2100 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2101 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2104 establish_gnat_vms_condition_handler (void)
2106 tree establish_stmt;
2108 /* Elaborate the required decls on the first call. Check on the decl for
2109 the gnat condition handler to decide, as this is one we create so we are
2110 sure that it will be non null on subsequent calls. The builtin decl is
2111 looked up so remains null on targets where it is not implemented yet. */
2112 if (gnat_vms_condition_handler_decl == NULL_TREE)
2114 vms_builtin_establish_handler_decl
2116 (get_identifier ("__builtin_establish_vms_condition_handler"));
2118 gnat_vms_condition_handler_decl
2119 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2121 build_function_type_list (integer_type_node,
2125 NULL_TREE, 0, 1, 1, 0, Empty);
2128 /* Do nothing if the establish builtin is not available, which might happen
2129 on targets where the facility is not implemented. */
2130 if (vms_builtin_establish_handler_decl == NULL_TREE)
2134 = build_call_1_expr (vms_builtin_establish_handler_decl,
2136 (ADDR_EXPR, NULL_TREE,
2137 gnat_vms_condition_handler_decl));
2139 add_stmt (establish_stmt);
2142 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2143 don't return anything. */
2146 Subprogram_Body_to_gnu (Node_Id gnat_node)
2148 /* Defining identifier of a parameter to the subprogram. */
2149 Entity_Id gnat_param;
2150 /* The defining identifier for the subprogram body. Note that if a
2151 specification has appeared before for this body, then the identifier
2152 occurring in that specification will also be a defining identifier and all
2153 the calls to this subprogram will point to that specification. */
2154 Entity_Id gnat_subprog_id
2155 = (Present (Corresponding_Spec (gnat_node))
2156 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2157 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2158 tree gnu_subprog_decl;
2159 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2160 tree gnu_subprog_type;
2163 VEC(parm_attr,gc) *cache;
2165 /* If this is a generic object or if it has been eliminated,
2167 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2168 || Ekind (gnat_subprog_id) == E_Generic_Function
2169 || Is_Eliminated (gnat_subprog_id))
2172 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2173 the already-elaborated tree node. However, if this subprogram had its
2174 elaboration deferred, we will already have made a tree node for it. So
2175 treat it as not being defined in that case. Such a subprogram cannot
2176 have an address clause or a freeze node, so this test is safe, though it
2177 does disable some otherwise-useful error checking. */
2179 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2180 Acts_As_Spec (gnat_node)
2181 && !present_gnu_tree (gnat_subprog_id));
2183 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2185 /* Propagate the debug mode. */
2186 if (!Needs_Debug_Info (gnat_subprog_id))
2187 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2189 /* Set the line number in the decl to correspond to that of the body so that
2190 the line number notes are written correctly. */
2191 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2193 /* Initialize the information structure for the function. */
2194 allocate_struct_function (gnu_subprog_decl, false);
2195 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2196 = GGC_CNEW (struct language_function);
2198 begin_subprog_body (gnu_subprog_decl);
2199 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2201 /* If there are Out parameters, we need to ensure that the return statement
2202 properly copies them out. We do this by making a new block and converting
2203 any inner return into a goto to a label at the end of the block. */
2204 push_stack (&gnu_return_label_stack, NULL_TREE,
2205 gnu_cico_list ? create_artificial_label () : NULL_TREE);
2207 /* Get a tree corresponding to the code for the subprogram. */
2208 start_stmt_group ();
2211 /* See if there are any parameters for which we don't yet have GCC entities.
2212 These must be for Out parameters for which we will be making VAR_DECL
2213 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2214 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2215 the order of the parameters. */
2216 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2217 Present (gnat_param);
2218 gnat_param = Next_Formal_With_Extras (gnat_param))
2219 if (!present_gnu_tree (gnat_param))
2221 /* Skip any entries that have been already filled in; they must
2222 correspond to In Out parameters. */
2223 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2224 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2227 /* Do any needed references for padded types. */
2228 TREE_VALUE (gnu_cico_list)
2229 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2230 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2233 /* On VMS, establish our condition handler to possibly turn a condition into
2234 the corresponding exception if the subprogram has a foreign convention or
2237 To ensure proper execution of local finalizations on condition instances,
2238 we must turn a condition into the corresponding exception even if there
2239 is no applicable Ada handler, and need at least one condition handler per
2240 possible call chain involving GNAT code. OTOH, establishing the handler
2241 has a cost so we want to minimize the number of subprograms into which
2242 this happens. The foreign or exported condition is expected to satisfy
2243 all the constraints. */
2244 if (TARGET_ABI_OPEN_VMS
2245 && (Has_Foreign_Convention (gnat_node) || Is_Exported (gnat_node)))
2246 establish_gnat_vms_condition_handler ();
2248 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2250 /* Generate the code of the subprogram itself. A return statement will be
2251 present and any Out parameters will be handled there. */
2252 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2254 gnu_result = end_stmt_group ();
2256 /* If we populated the parameter attributes cache, we need to make sure
2257 that the cached expressions are evaluated on all possible paths. */
2258 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2261 struct parm_attr *pa;
2264 start_stmt_group ();
2266 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2269 add_stmt_with_node (pa->first, gnat_node);
2271 add_stmt_with_node (pa->last, gnat_node);
2273 add_stmt_with_node (pa->length, gnat_node);
2276 add_stmt (gnu_result);
2277 gnu_result = end_stmt_group ();
2280 /* If we made a special return label, we need to make a block that contains
2281 the definition of that label and the copying to the return value. That
2282 block first contains the function, then the label and copy statement. */
2283 if (TREE_VALUE (gnu_return_label_stack))
2287 start_stmt_group ();
2289 add_stmt (gnu_result);
2290 add_stmt (build1 (LABEL_EXPR, void_type_node,
2291 TREE_VALUE (gnu_return_label_stack)));
2293 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2294 if (list_length (gnu_cico_list) == 1)
2295 gnu_retval = TREE_VALUE (gnu_cico_list);
2297 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2300 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2301 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2304 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2305 End_Label (Handled_Statement_Sequence (gnat_node)));
2307 gnu_result = end_stmt_group ();
2310 pop_stack (&gnu_return_label_stack);
2312 /* Set the end location. */
2314 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2315 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2316 : Sloc (gnat_node)),
2317 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2319 end_subprog_body (gnu_result, false);
2321 /* Disconnect the trees for parameters that we made variables for from the
2322 GNAT entities since these are unusable after we end the function. */
2323 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2324 Present (gnat_param);
2325 gnat_param = Next_Formal_With_Extras (gnat_param))
2326 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2327 save_gnu_tree (gnat_param, NULL_TREE, false);
2329 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2330 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2332 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2335 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2336 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2337 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2338 If GNU_TARGET is non-null, this must be a function call and the result
2339 of the call is to be placed into that object. */
2342 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2345 /* The GCC node corresponding to the GNAT subprogram name. This can either
2346 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2347 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2349 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2350 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2351 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2352 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2354 Entity_Id gnat_formal;
2355 Node_Id gnat_actual;
2356 tree gnu_actual_list = NULL_TREE;
2357 tree gnu_name_list = NULL_TREE;
2358 tree gnu_before_list = NULL_TREE;
2359 tree gnu_after_list = NULL_TREE;
2360 tree gnu_subprog_call;
2362 check_for_eliminated_entity (Name (gnat_node));
2364 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2366 /* If we are calling a stubbed function, make this into a raise of
2367 Program_Error. Elaborate all our args first. */
2368 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2369 && DECL_STUBBED_P (gnu_subprog_node))
2371 for (gnat_actual = First_Actual (gnat_node);
2372 Present (gnat_actual);
2373 gnat_actual = Next_Actual (gnat_actual))
2374 add_stmt (gnat_to_gnu (gnat_actual));
2378 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2379 N_Raise_Program_Error);
2381 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2383 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2384 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2391 /* If we are calling by supplying a pointer to a target, set up that
2392 pointer as the first argument. Use GNU_TARGET if one was passed;
2393 otherwise, make a target by building a variable of the maximum size
2395 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2397 tree gnu_real_ret_type
2398 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2403 = maybe_pad_type (gnu_real_ret_type,
2404 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2405 0, Etype (Name (gnat_node)), "PAD", false,
2408 /* ??? We may be about to create a static temporary if we happen to
2409 be at the global binding level. That's a regression from what
2410 the 3.x back-end would generate in the same situation, but we
2411 don't have a mechanism in Gigi for creating automatic variables
2412 in the elaboration routines. */
2414 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2415 NULL, false, false, false, false, NULL,
2420 = tree_cons (NULL_TREE,
2421 build_unary_op (ADDR_EXPR, NULL_TREE,
2422 unchecked_convert (gnu_real_ret_type,
2429 /* The only way we can be making a call via an access type is if Name is an
2430 explicit dereference. In that case, get the list of formal args from the
2431 type the access type is pointing to. Otherwise, get the formals from
2432 entity being called. */
2433 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2434 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2435 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2436 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2439 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2441 /* Create the list of the actual parameters as GCC expects it, namely a chain
2442 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2443 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2444 parameters not passed by reference and don't need to be copied in. */
2445 for (gnat_actual = First_Actual (gnat_node);
2446 Present (gnat_actual);
2447 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2448 gnat_actual = Next_Actual (gnat_actual))
2451 = (present_gnu_tree (gnat_formal)
2452 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2453 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2454 /* We must suppress conversions that can cause the creation of a
2455 temporary in the Out or In Out case because we need the real
2456 object in this case, either to pass its address if it's passed
2457 by reference or as target of the back copy done after the call
2458 if it uses the copy-in copy-out mechanism. We do it in the In
2459 case too, except for an unchecked conversion because it alone
2460 can cause the actual to be misaligned and the addressability
2461 test is applied to the real object. */
2462 bool suppress_type_conversion
2463 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2464 && Ekind (gnat_formal) != E_In_Parameter)
2465 || (Nkind (gnat_actual) == N_Type_Conversion
2466 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2467 Node_Id gnat_name = (suppress_type_conversion
2468 ? Expression (gnat_actual) : gnat_actual);
2469 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2472 /* If it's possible we may need to use this expression twice, make sure
2473 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2474 to force side-effects before the call.
2475 ??? This is more conservative than we need since we don't need to do
2476 this for pass-by-ref with no conversion. */
2477 if (Ekind (gnat_formal) != E_In_Parameter)
2478 gnu_name = gnat_stabilize_reference (gnu_name, true);
2480 /* If we are passing a non-addressable parameter by reference, pass the
2481 address of a copy. In the Out or In Out case, set up to copy back
2482 out after the call. */
2484 && (DECL_BY_REF_P (gnu_formal)
2485 || (TREE_CODE (gnu_formal) == PARM_DECL
2486 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2487 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2488 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2489 && !addressable_p (gnu_name, gnu_name_type))
2491 tree gnu_copy = gnu_name, gnu_temp;
2493 /* If the type is by_reference, a copy is not allowed. */
2494 if (Is_By_Reference_Type (Etype (gnat_formal)))
2496 ("misaligned actual cannot be passed by reference", gnat_actual);
2498 /* For users of Starlet we issue a warning because the
2499 interface apparently assumes that by-ref parameters
2500 outlive the procedure invocation. The code still
2501 will not work as intended, but we cannot do much
2502 better since other low-level parts of the back-end
2503 would allocate temporaries at will because of the
2504 misalignment if we did not do so here. */
2505 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2508 ("?possible violation of implicit assumption", gnat_actual);
2510 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2511 Entity (Name (gnat_node)));
2512 post_error_ne ("?because of misalignment of &", gnat_actual,
2516 /* Remove any unpadding from the object and reset the copy. */
2517 if (TREE_CODE (gnu_name) == COMPONENT_REF
2518 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2520 && (TYPE_IS_PADDING_P
2521 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2522 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2524 /* Otherwise convert to the nominal type of the object if it's
2525 a record type. There are several cases in which we need to
2526 make the temporary using this type instead of the actual type
2527 of the object if they are distinct, because the expectations
2528 of the callee would otherwise not be met:
2529 - if it's a justified modular type,
2530 - if the actual type is a smaller packable version of it. */
2531 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2532 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2533 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2535 gnu_name = convert (gnu_name_type, gnu_name);
2537 /* Make a SAVE_EXPR to both properly account for potential side
2538 effects and handle the creation of a temporary copy. Special
2539 code in gnat_gimplify_expr ensures that the same temporary is
2540 used as the object and copied back after the call if needed. */
2541 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2542 TREE_SIDE_EFFECTS (gnu_name) = 1;
2544 /* Set up to move the copy back to the original. */
2545 if (Ekind (gnat_formal) != E_In_Parameter)
2547 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2549 set_expr_location_from_node (gnu_temp, gnat_node);
2550 append_to_statement_list (gnu_temp, &gnu_after_list);
2554 /* Start from the real object and build the actual. */
2555 gnu_actual = gnu_name;
2557 /* If this was a procedure call, we may not have removed any padding.
2558 So do it here for the part we will use as an input, if any. */
2559 if (Ekind (gnat_formal) != E_Out_Parameter
2560 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2561 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2562 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2565 /* Do any needed conversions for the actual and make sure that it is
2566 in range of the formal's type. */
2567 if (suppress_type_conversion)
2569 /* Put back the conversion we suppressed above in the computation
2570 of the real object. Note that we treat a conversion between
2571 aggregate types as if it is an unchecked conversion here. */
2573 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2575 (Nkind (gnat_actual)
2576 == N_Unchecked_Type_Conversion)
2577 && No_Truncation (gnat_actual));
2579 if (Ekind (gnat_formal) != E_Out_Parameter
2580 && Do_Range_Check (gnat_actual))
2581 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2586 if (Ekind (gnat_formal) != E_Out_Parameter
2587 && Do_Range_Check (gnat_actual))
2588 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2591 /* We may have suppressed a conversion to the Etype of the actual
2592 since the parent is a procedure call. So put it back here.
2593 ??? We use the reverse order compared to the case above because
2594 of an awkward interaction with the check and actually don't put
2595 back the conversion at all if a check is emitted. This is also
2596 done for the conversion to the formal's type just below. */
2597 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2598 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2602 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2603 gnu_actual = convert (gnu_formal_type, gnu_actual);
2605 /* Unless this is an In parameter, we must remove any justified modular
2606 building from GNU_NAME to get an lvalue. */
2607 if (Ekind (gnat_formal) != E_In_Parameter
2608 && TREE_CODE (gnu_name) == CONSTRUCTOR
2609 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2610 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2611 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2614 /* If we have not saved a GCC object for the formal, it means it is an
2615 Out parameter not passed by reference and that does not need to be
2616 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2619 && TREE_CODE (gnu_formal) == PARM_DECL
2620 && DECL_BY_REF_P (gnu_formal))
2622 if (Ekind (gnat_formal) != E_In_Parameter)
2624 /* In Out or Out parameters passed by reference don't use the
2625 copy-in copy-out mechanism so the address of the real object
2626 must be passed to the function. */
2627 gnu_actual = gnu_name;
2629 /* If we have a padded type, be sure we've removed padding. */
2630 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2631 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2632 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2633 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2636 /* If we have the constructed subtype of an aliased object
2637 with an unconstrained nominal subtype, the type of the
2638 actual includes the template, although it is formally
2639 constrained. So we need to convert it back to the real
2640 constructed subtype to retrieve the constrained part
2641 and takes its address. */
2642 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2643 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2644 && TREE_CODE (gnu_actual) != SAVE_EXPR
2645 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2646 && Is_Array_Type (Etype (gnat_actual)))
2647 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2651 /* The symmetry of the paths to the type of an entity is broken here
2652 since arguments don't know that they will be passed by ref. */
2653 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2654 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2657 && TREE_CODE (gnu_formal) == PARM_DECL
2658 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2660 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2661 gnu_actual = maybe_implicit_deref (gnu_actual);
2662 gnu_actual = maybe_unconstrained_array (gnu_actual);
2664 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2665 && TYPE_IS_PADDING_P (gnu_formal_type))
2667 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2668 gnu_actual = convert (gnu_formal_type, gnu_actual);
2671 /* Take the address of the object and convert to the proper pointer
2672 type. We'd like to actually compute the address of the beginning
2673 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2674 possibility that the ARRAY_REF might return a constant and we'd be
2675 getting the wrong address. Neither approach is exactly correct,
2676 but this is the most likely to work in all cases. */
2677 gnu_actual = convert (gnu_formal_type,
2678 build_unary_op (ADDR_EXPR, NULL_TREE,
2682 && TREE_CODE (gnu_formal) == PARM_DECL
2683 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2685 /* If arg is 'Null_Parameter, pass zero descriptor. */
2686 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2687 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2688 && TREE_PRIVATE (gnu_actual))
2689 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2692 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2693 fill_vms_descriptor (gnu_actual,
2699 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2701 if (Ekind (gnat_formal) != E_In_Parameter)
2702 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2704 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2707 /* If this is 'Null_Parameter, pass a zero even though we are
2708 dereferencing it. */
2709 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2710 && TREE_PRIVATE (gnu_actual)
2711 && host_integerp (gnu_actual_size, 1)
2712 && 0 >= compare_tree_int (gnu_actual_size,
2715 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2716 convert (gnat_type_for_size
2717 (tree_low_cst (gnu_actual_size, 1),
2722 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2725 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2728 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2730 nreverse (gnu_actual_list));
2731 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2733 /* If we return by passing a target, the result is the target after the
2734 call. We must not emit the call directly here because this might be
2735 evaluated as part of an expression with conditions to control whether
2736 the call should be emitted or not. */
2737 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2739 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2740 by the target object converted to the proper type. Doing so would
2741 potentially be very inefficient, however, as this expression might
2742 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2743 pointless temporary copy of the whole object.
2745 What we do instead is build a COMPOUND_EXPR returning the address of
2746 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2747 SAVE_EXPR later on then only incurs a pointer copy. */
2749 tree gnu_result_type
2750 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2753 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2755 tree gnu_target_address
2756 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2757 set_expr_location_from_node (gnu_target_address, gnat_node);
2760 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2761 gnu_subprog_call, gnu_target_address);
2764 = unchecked_convert (gnu_result_type,
2765 build_unary_op (INDIRECT_REF, NULL_TREE,
2769 *gnu_result_type_p = gnu_result_type;
2773 /* If it is a function call, the result is the call expression unless
2774 a target is specified, in which case we copy the result into the target
2775 and return the assignment statement. */
2776 else if (Nkind (gnat_node) == N_Function_Call)
2778 gnu_result = gnu_subprog_call;
2780 /* If the function returns an unconstrained array or by reference,
2781 we have to de-dereference the pointer. */
2782 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2783 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2784 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2787 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2788 gnu_target, gnu_result);
2790 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2795 /* If this is the case where the GNAT tree contains a procedure call
2796 but the Ada procedure has copy in copy out parameters, the special
2797 parameter passing mechanism must be used. */
2798 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2800 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2801 in copy out parameters. */
2802 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2803 int length = list_length (scalar_return_list);
2809 gnu_subprog_call = save_expr (gnu_subprog_call);
2810 gnu_name_list = nreverse (gnu_name_list);
2812 /* If any of the names had side-effects, ensure they are all
2813 evaluated before the call. */
2814 for (gnu_name = gnu_name_list; gnu_name;
2815 gnu_name = TREE_CHAIN (gnu_name))
2816 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2817 append_to_statement_list (TREE_VALUE (gnu_name),
2821 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2822 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2824 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2826 for (gnat_actual = First_Actual (gnat_node);
2827 Present (gnat_actual);
2828 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2829 gnat_actual = Next_Actual (gnat_actual))
2830 /* If we are dealing with a copy in copy out parameter, we must
2831 retrieve its value from the record returned in the call. */
2832 if (!(present_gnu_tree (gnat_formal)
2833 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2834 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2835 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2836 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2837 || (DECL_BY_DESCRIPTOR_P
2838 (get_gnu_tree (gnat_formal))))))))
2839 && Ekind (gnat_formal) != E_In_Parameter)
2841 /* Get the value to assign to this Out or In Out parameter. It is
2842 either the result of the function if there is only a single such
2843 parameter or the appropriate field from the record returned. */
2845 = length == 1 ? gnu_subprog_call
2846 : build_component_ref (gnu_subprog_call, NULL_TREE,
2847 TREE_PURPOSE (scalar_return_list),
2850 /* If the actual is a conversion, get the inner expression, which
2851 will be the real destination, and convert the result to the
2852 type of the actual parameter. */
2854 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2856 /* If the result is a padded type, remove the padding. */
2857 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2858 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2859 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2860 (TREE_TYPE (gnu_result))),
2863 /* If the actual is a type conversion, the real target object is
2864 denoted by the inner Expression and we need to convert the
2865 result to the associated type.
2866 We also need to convert our gnu assignment target to this type
2867 if the corresponding GNU_NAME was constructed from the GNAT
2868 conversion node and not from the inner Expression. */
2869 if (Nkind (gnat_actual) == N_Type_Conversion)
2872 = convert_with_check
2873 (Etype (Expression (gnat_actual)), gnu_result,
2874 Do_Overflow_Check (gnat_actual),
2875 Do_Range_Check (Expression (gnat_actual)),
2876 Float_Truncate (gnat_actual), gnat_actual);
2878 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2879 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2882 /* Unchecked conversions as actuals for Out parameters are not
2883 allowed in user code because they are not variables, but do
2884 occur in front-end expansions. The associated GNU_NAME is
2885 always obtained from the inner expression in such cases. */
2886 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2887 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2889 No_Truncation (gnat_actual));
2892 if (Do_Range_Check (gnat_actual))
2894 = emit_range_check (gnu_result, Etype (gnat_actual),
2897 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2898 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2899 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2902 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2903 gnu_actual, gnu_result);
2904 set_expr_location_from_node (gnu_result, gnat_node);
2905 append_to_statement_list (gnu_result, &gnu_before_list);
2906 scalar_return_list = TREE_CHAIN (scalar_return_list);
2907 gnu_name_list = TREE_CHAIN (gnu_name_list);
2911 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2913 append_to_statement_list (gnu_after_list, &gnu_before_list);
2914 return gnu_before_list;
2917 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2918 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2921 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2923 tree gnu_jmpsave_decl = NULL_TREE;
2924 tree gnu_jmpbuf_decl = NULL_TREE;
2925 /* If just annotating, ignore all EH and cleanups. */
2926 bool gcc_zcx = (!type_annotate_only
2927 && Present (Exception_Handlers (gnat_node))
2928 && Exception_Mechanism == Back_End_Exceptions);
2930 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2931 && Exception_Mechanism == Setjmp_Longjmp);
2932 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2933 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2934 tree gnu_inner_block; /* The statement(s) for the block itself. */
2939 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2940 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2941 add_cleanup, and when we leave the binding, end_stmt_group will create
2942 the TRY_FINALLY_EXPR.
2944 ??? The region level calls down there have been specifically put in place
2945 for a ZCX context and currently the order in which things are emitted
2946 (region/handlers) is different from the SJLJ case. Instead of putting
2947 other calls with different conditions at other places for the SJLJ case,
2948 it seems cleaner to reorder things for the SJLJ case and generalize the
2949 condition to make it not ZCX specific.
2951 If there are any exceptions or cleanup processing involved, we need an
2952 outer statement group (for Setjmp_Longjmp) and binding level. */
2953 if (binding_for_block)
2955 start_stmt_group ();
2959 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2960 area for address of previous buffer. Do this first since we need to have
2961 the setjmp buf known for any decls in this block. */
2964 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2965 NULL_TREE, jmpbuf_ptr_type,
2966 build_call_0_expr (get_jmpbuf_decl),
2967 false, false, false, false, NULL,
2969 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2971 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2972 because of the unstructured form of EH used by setjmp_longjmp, there
2973 might be forward edges going to __builtin_setjmp receivers on which
2974 it is uninitialized, although they will never be actually taken. */
2975 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2976 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2977 NULL_TREE, jmpbuf_type,
2978 NULL_TREE, false, false, false, false,
2980 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2982 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2984 /* When we exit this block, restore the saved value. */
2985 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2986 End_Label (gnat_node));
2989 /* If we are to call a function when exiting this block, add a cleanup
2990 to the binding level we made above. Note that add_cleanup is FIFO
2991 so we must register this cleanup after the EH cleanup just above. */
2993 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2994 End_Label (gnat_node));
2996 /* Now build the tree for the declarations and statements inside this block.
2997 If this is SJLJ, set our jmp_buf as the current buffer. */
2998 start_stmt_group ();
3001 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3002 build_unary_op (ADDR_EXPR, NULL_TREE,
3005 if (Present (First_Real_Statement (gnat_node)))
3006 process_decls (Statements (gnat_node), Empty,
3007 First_Real_Statement (gnat_node), true, true);
3009 /* Generate code for each statement in the block. */
3010 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3011 ? First_Real_Statement (gnat_node)
3012 : First (Statements (gnat_node)));
3013 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3014 add_stmt (gnat_to_gnu (gnat_temp));
3015 gnu_inner_block = end_stmt_group ();
3017 /* Now generate code for the two exception models, if either is relevant for
3021 tree *gnu_else_ptr = 0;
3024 /* Make a binding level for the exception handling declarations and code
3025 and set up gnu_except_ptr_stack for the handlers to use. */
3026 start_stmt_group ();
3029 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3030 create_var_decl (get_identifier ("EXCEPT_PTR"),
3032 build_pointer_type (except_type_node),
3033 build_call_0_expr (get_excptr_decl), false,
3034 false, false, false, NULL, gnat_node));
3036 /* Generate code for each handler. The N_Exception_Handler case does the
3037 real work and returns a COND_EXPR for each handler, which we chain
3039 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3040 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3042 gnu_expr = gnat_to_gnu (gnat_temp);
3044 /* If this is the first one, set it as the outer one. Otherwise,
3045 point the "else" part of the previous handler to us. Then point
3046 to our "else" part. */
3048 add_stmt (gnu_expr);
3050 *gnu_else_ptr = gnu_expr;
3052 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3055 /* If none of the exception handlers did anything, re-raise but do not
3057 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3058 TREE_VALUE (gnu_except_ptr_stack));
3059 set_expr_location_from_node (gnu_expr, gnat_node);
3062 *gnu_else_ptr = gnu_expr;
3064 add_stmt (gnu_expr);
3066 /* End the binding level dedicated to the exception handlers and get the
3067 whole statement group. */
3068 pop_stack (&gnu_except_ptr_stack);
3070 gnu_handler = end_stmt_group ();
3072 /* If the setjmp returns 1, we restore our incoming longjmp value and
3073 then check the handlers. */
3074 start_stmt_group ();
3075 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3078 add_stmt (gnu_handler);
3079 gnu_handler = end_stmt_group ();
3081 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3082 gnu_result = build3 (COND_EXPR, void_type_node,
3085 build_unary_op (ADDR_EXPR, NULL_TREE,
3087 gnu_handler, gnu_inner_block);
3093 /* First make a block containing the handlers. */
3094 start_stmt_group ();
3095 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3096 Present (gnat_temp);
3097 gnat_temp = Next_Non_Pragma (gnat_temp))
3098 add_stmt (gnat_to_gnu (gnat_temp));
3099 gnu_handlers = end_stmt_group ();
3101 /* Now make the TRY_CATCH_EXPR for the block. */
3102 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3103 gnu_inner_block, gnu_handlers);
3106 gnu_result = gnu_inner_block;
3108 /* Now close our outer block, if we had to make one. */
3109 if (binding_for_block)
3111 add_stmt (gnu_result);
3113 gnu_result = end_stmt_group ();
3119 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3120 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3121 exception handling. */
3124 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3126 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3127 an "if" statement to select the proper exceptions. For "Others", exclude
3128 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3129 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3130 tree gnu_choice = integer_zero_node;
3131 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3134 for (gnat_temp = First (Exception_Choices (gnat_node));
3135 gnat_temp; gnat_temp = Next (gnat_temp))
3139 if (Nkind (gnat_temp) == N_Others_Choice)
3141 if (All_Others (gnat_temp))
3142 this_choice = integer_one_node;
3146 (EQ_EXPR, integer_type_node,
3151 (INDIRECT_REF, NULL_TREE,
3152 TREE_VALUE (gnu_except_ptr_stack)),
3153 get_identifier ("not_handled_by_others"), NULL_TREE,
3158 else if (Nkind (gnat_temp) == N_Identifier
3159 || Nkind (gnat_temp) == N_Expanded_Name)
3161 Entity_Id gnat_ex_id = Entity (gnat_temp);
3164 /* Exception may be a renaming. Recover original exception which is
3165 the one elaborated and registered. */
3166 if (Present (Renamed_Object (gnat_ex_id)))
3167 gnat_ex_id = Renamed_Object (gnat_ex_id);
3169 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3173 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3174 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3175 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3177 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3178 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3180 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3183 = build_component_ref
3184 (build_unary_op (INDIRECT_REF, NULL_TREE,
3185 TREE_VALUE (gnu_except_ptr_stack)),
3186 get_identifier ("lang"), NULL_TREE, false);
3190 (TRUTH_ORIF_EXPR, integer_type_node,
3191 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3192 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3199 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3200 gnu_choice, this_choice);
3203 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3206 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3207 to a GCC tree, which is returned. This is the variant for ZCX. */
3210 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3212 tree gnu_etypes_list = NULL_TREE;
3215 tree gnu_current_exc_ptr;
3216 tree gnu_incoming_exc_ptr;
3219 /* We build a TREE_LIST of nodes representing what exception types this
3220 handler can catch, with special cases for others and all others cases.
3222 Each exception type is actually identified by a pointer to the exception
3223 id, or to a dummy object for "others" and "all others".
3225 Care should be taken to ensure that the control flow impact of "others"
3226 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3228 for (gnat_temp = First (Exception_Choices (gnat_node));
3229 gnat_temp; gnat_temp = Next (gnat_temp))
3231 if (Nkind (gnat_temp) == N_Others_Choice)
3234 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3237 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3239 else if (Nkind (gnat_temp) == N_Identifier
3240 || Nkind (gnat_temp) == N_Expanded_Name)
3242 Entity_Id gnat_ex_id = Entity (gnat_temp);
3244 /* Exception may be a renaming. Recover original exception which is
3245 the one elaborated and registered. */
3246 if (Present (Renamed_Object (gnat_ex_id)))
3247 gnat_ex_id = Renamed_Object (gnat_ex_id);
3249 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3250 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3252 /* The Non_Ada_Error case for VMS exceptions is handled
3253 by the personality routine. */
3258 /* The GCC interface expects NULL to be passed for catch all handlers, so
3259 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3260 is integer_zero_node. It would not work, however, because GCC's
3261 notion of "catch all" is stronger than our notion of "others". Until
3262 we correctly use the cleanup interface as well, doing that would
3263 prevent the "all others" handlers from being seen, because nothing
3264 can be caught beyond a catch all from GCC's point of view. */
3265 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3268 start_stmt_group ();
3271 /* Expand a call to the begin_handler hook at the beginning of the handler,
3272 and arrange for a call to the end_handler hook to occur on every possible
3275 The hooks expect a pointer to the low level occurrence. This is required
3276 for our stack management scheme because a raise inside the handler pushes
3277 a new occurrence on top of the stack, which means that this top does not
3278 necessarily match the occurrence this handler was dealing with.
3280 The EXC_PTR_EXPR object references the exception occurrence being
3281 propagated. Upon handler entry, this is the exception for which the
3282 handler is triggered. This might not be the case upon handler exit,
3283 however, as we might have a new occurrence propagated by the handler's
3284 body, and the end_handler hook called as a cleanup in this context.
3286 We use a local variable to retrieve the incoming value at handler entry
3287 time, and reuse it to feed the end_handler hook's argument at exit. */
3288 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3289 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3290 ptr_type_node, gnu_current_exc_ptr,
3291 false, false, false, false, NULL,
3294 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3295 gnu_incoming_exc_ptr),
3297 /* ??? We don't seem to have an End_Label at hand to set the location. */
3298 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3300 add_stmt_list (Statements (gnat_node));
3303 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3307 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3310 Compilation_Unit_to_gnu (Node_Id gnat_node)
3312 /* Make the decl for the elaboration procedure. */
3313 bool body_p = (Defining_Entity (Unit (gnat_node)),
3314 Nkind (Unit (gnat_node)) == N_Package_Body
3315 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3316 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3317 tree gnu_elab_proc_decl
3318 = create_subprog_decl
3319 (create_concat_name (gnat_unit_entity,
3320 body_p ? "elabb" : "elabs"),
3321 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3323 struct elab_info *info;
3325 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3327 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3328 allocate_struct_function (gnu_elab_proc_decl, false);
3329 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3332 /* For a body, first process the spec if there is one. */
3333 if (Nkind (Unit (gnat_node)) == N_Package_Body
3334 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3335 && !Acts_As_Spec (gnat_node)))
3337 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3338 finalize_from_with_types ();
3341 process_inlined_subprograms (gnat_node);
3343 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3345 elaborate_all_entities (gnat_node);
3347 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3348 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3349 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3353 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3355 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3357 /* Process any pragmas and actions following the unit. */
3358 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3359 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3360 finalize_from_with_types ();
3362 /* Save away what we've made so far and record this potential elaboration
3364 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3365 set_current_block_context (gnu_elab_proc_decl);
3367 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3368 info->next = elab_info_list;
3369 info->elab_proc = gnu_elab_proc_decl;
3370 info->gnat_node = gnat_node;
3371 elab_info_list = info;
3373 /* Generate elaboration code for this unit, if necessary, and say whether
3375 pop_stack (&gnu_elab_proc_stack);
3377 /* Invalidate the global renaming pointers. This is necessary because
3378 stabilization of the renamed entities may create SAVE_EXPRs which
3379 have been tied to a specific elaboration routine just above. */
3380 invalidate_global_renaming_pointers ();
3383 /* This function is the driver of the GNAT to GCC tree transformation
3384 process. It is the entry point of the tree transformer. GNAT_NODE is the
3385 root of some GNAT tree. Return the root of the corresponding GCC tree.
3386 If this is an expression, return the GCC equivalent of the expression. If
3387 it is a statement, return the statement. In the case when called for a
3388 statement, it may also add statements to the current statement group, in
3389 which case anything it returns is to be interpreted as occurring after
3390 anything `it already added. */
3393 gnat_to_gnu (Node_Id gnat_node)
3395 bool went_into_elab_proc = false;
3396 tree gnu_result = error_mark_node; /* Default to no value. */
3397 tree gnu_result_type = void_type_node;
3399 tree gnu_lhs, gnu_rhs;
3402 /* Save node number for error message and set location information. */
3403 error_gnat_node = gnat_node;
3404 Sloc_to_locus (Sloc (gnat_node), &input_location);
3406 if (type_annotate_only
3407 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3408 return alloc_stmt_list ();
3410 /* If this node is a non-static subexpression and we are only
3411 annotating types, make this into a NULL_EXPR. */
3412 if (type_annotate_only
3413 && IN (Nkind (gnat_node), N_Subexpr)
3414 && Nkind (gnat_node) != N_Identifier
3415 && !Compile_Time_Known_Value (gnat_node))
3416 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3417 build_call_raise (CE_Range_Check_Failed, gnat_node,
3418 N_Raise_Constraint_Error));
3420 /* If this is a Statement and we are at top level, it must be part of the
3421 elaboration procedure, so mark us as being in that procedure and push our
3424 If we are in the elaboration procedure, check if we are violating a
3425 No_Elaboration_Code restriction by having a statement there. */
3426 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3427 && Nkind (gnat_node) != N_Null_Statement)
3428 || Nkind (gnat_node) == N_Procedure_Call_Statement
3429 || Nkind (gnat_node) == N_Label
3430 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3431 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3432 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3433 || Nkind (gnat_node) == N_Raise_Storage_Error
3434 || Nkind (gnat_node) == N_Raise_Program_Error)
3435 && (Ekind (Etype (gnat_node)) == E_Void)))
3437 if (!current_function_decl)
3439 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3440 start_stmt_group ();
3442 went_into_elab_proc = true;
3445 /* Don't check for a possible No_Elaboration_Code restriction violation
3446 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3447 every nested real statement instead. This also avoids triggering
3448 spurious errors on dummy (empty) sequences created by the front-end
3449 for package bodies in some cases. */
3451 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3452 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3453 Check_Elaboration_Code_Allowed (gnat_node);
3456 switch (Nkind (gnat_node))
3458 /********************************/
3459 /* Chapter 2: Lexical Elements */
3460 /********************************/
3463 case N_Expanded_Name:
3464 case N_Operator_Symbol:
3465 case N_Defining_Identifier:
3466 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3469 case N_Integer_Literal:
3473 /* Get the type of the result, looking inside any padding and
3474 justified modular types. Then get the value in that type. */
3475 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3477 if (TREE_CODE (gnu_type) == RECORD_TYPE
3478 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3479 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3481 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3483 /* If the result overflows (meaning it doesn't fit in its base type),
3484 abort. We would like to check that the value is within the range
3485 of the subtype, but that causes problems with subtypes whose usage
3486 will raise Constraint_Error and with biased representation, so
3488 gcc_assert (!TREE_OVERFLOW (gnu_result));
3492 case N_Character_Literal:
3493 /* If a Entity is present, it means that this was one of the
3494 literals in a user-defined character type. In that case,
3495 just return the value in the CONST_DECL. Otherwise, use the
3496 character code. In that case, the base type should be an
3497 INTEGER_TYPE, but we won't bother checking for that. */
3498 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3499 if (Present (Entity (gnat_node)))
3500 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3503 = build_int_cst_type
3504 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3507 case N_Real_Literal:
3508 /* If this is of a fixed-point type, the value we want is the
3509 value of the corresponding integer. */
3510 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3512 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3513 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3515 gcc_assert (!TREE_OVERFLOW (gnu_result));
3518 /* We should never see a Vax_Float type literal, since the front end
3519 is supposed to transform these using appropriate conversions. */
3520 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3525 Ureal ur_realval = Realval (gnat_node);
3527 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3529 /* If the real value is zero, so is the result. Otherwise,
3530 convert it to a machine number if it isn't already. That
3531 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3532 if (UR_Is_Zero (ur_realval))
3533 gnu_result = convert (gnu_result_type, integer_zero_node);
3536 if (!Is_Machine_Number (gnat_node))
3538 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3539 ur_realval, Round_Even, gnat_node);
3542 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3544 /* If we have a base of zero, divide by the denominator.
3545 Otherwise, the base must be 2 and we scale the value, which
3546 we know can fit in the mantissa of the type (hence the use
3547 of that type above). */
3548 if (No (Rbase (ur_realval)))
3550 = build_binary_op (RDIV_EXPR,
3551 get_base_type (gnu_result_type),
3553 UI_To_gnu (Denominator (ur_realval),
3557 REAL_VALUE_TYPE tmp;
3559 gcc_assert (Rbase (ur_realval) == 2);
3560 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3561 - UI_To_Int (Denominator (ur_realval)));
3562 gnu_result = build_real (gnu_result_type, tmp);
3566 /* Now see if we need to negate the result. Do it this way to
3567 properly handle -0. */
3568 if (UR_Is_Negative (Realval (gnat_node)))
3570 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3576 case N_String_Literal:
3577 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3578 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3580 String_Id gnat_string = Strval (gnat_node);
3581 int length = String_Length (gnat_string);
3584 if (length >= ALLOCA_THRESHOLD)
3585 string = XNEWVEC (char, length + 1);
3587 string = (char *) alloca (length + 1);
3589 /* Build the string with the characters in the literal. Note
3590 that Ada strings are 1-origin. */
3591 for (i = 0; i < length; i++)
3592 string[i] = Get_String_Char (gnat_string, i + 1);
3594 /* Put a null at the end of the string in case it's in a context
3595 where GCC will want to treat it as a C string. */
3598 gnu_result = build_string (length, string);
3600 /* Strings in GCC don't normally have types, but we want
3601 this to not be converted to the array type. */
3602 TREE_TYPE (gnu_result) = gnu_result_type;
3604 if (length >= ALLOCA_THRESHOLD)
3609 /* Build a list consisting of each character, then make
3611 String_Id gnat_string = Strval (gnat_node);
3612 int length = String_Length (gnat_string);
3614 tree gnu_list = NULL_TREE;
3615 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3617 for (i = 0; i < length; i++)
3620 = tree_cons (gnu_idx,
3621 build_int_cst (TREE_TYPE (gnu_result_type),
3622 Get_String_Char (gnat_string,
3626 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3631 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3636 gnu_result = Pragma_to_gnu (gnat_node);
3639 /**************************************/
3640 /* Chapter 3: Declarations and Types */
3641 /**************************************/
3643 case N_Subtype_Declaration:
3644 case N_Full_Type_Declaration:
3645 case N_Incomplete_Type_Declaration:
3646 case N_Private_Type_Declaration:
3647 case N_Private_Extension_Declaration:
3648 case N_Task_Type_Declaration:
3649 process_type (Defining_Entity (gnat_node));
3650 gnu_result = alloc_stmt_list ();
3653 case N_Object_Declaration:
3654 case N_Exception_Declaration:
3655 gnat_temp = Defining_Entity (gnat_node);
3656 gnu_result = alloc_stmt_list ();
3658 /* If we are just annotating types and this object has an unconstrained
3659 or task type, don't elaborate it. */
3660 if (type_annotate_only
3661 && (((Is_Array_Type (Etype (gnat_temp))
3662 || Is_Record_Type (Etype (gnat_temp)))
3663 && !Is_Constrained (Etype (gnat_temp)))
3664 || Is_Concurrent_Type (Etype (gnat_temp))))
3667 if (Present (Expression (gnat_node))
3668 && !(Nkind (gnat_node) == N_Object_Declaration
3669 && No_Initialization (gnat_node))
3670 && (!type_annotate_only
3671 || Compile_Time_Known_Value (Expression (gnat_node))))
3673 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3674 if (Do_Range_Check (Expression (gnat_node)))
3676 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3678 /* If this object has its elaboration delayed, we must force
3679 evaluation of GNU_EXPR right now and save it for when the object
3681 if (Present (Freeze_Node (gnat_temp)))
3683 if ((Is_Public (gnat_temp) || global_bindings_p ())
3684 && !TREE_CONSTANT (gnu_expr))
3686 = create_var_decl (create_concat_name (gnat_temp, "init"),
3687 NULL_TREE, TREE_TYPE (gnu_expr),
3688 gnu_expr, false, Is_Public (gnat_temp),
3689 false, false, NULL, gnat_temp);
3691 gnu_expr = maybe_variable (gnu_expr);
3693 save_gnu_tree (gnat_node, gnu_expr, true);
3697 gnu_expr = NULL_TREE;
3699 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3700 gnu_expr = NULL_TREE;
3702 /* If this is a deferred constant with an address clause, we ignore the
3703 full view since the clause is on the partial view and we cannot have
3704 2 different GCC trees for the object. The only bits of the full view
3705 we will use is the initializer, but it will be directly fetched. */
3706 if (Ekind(gnat_temp) == E_Constant
3707 && Present (Address_Clause (gnat_temp))
3708 && Present (Full_View (gnat_temp)))
3709 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3711 if (No (Freeze_Node (gnat_temp)))
3712 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3715 case N_Object_Renaming_Declaration:
3716 gnat_temp = Defining_Entity (gnat_node);
3718 /* Don't do anything if this renaming is handled by the front end or if
3719 we are just annotating types and this object has a composite or task
3720 type, don't elaborate it. We return the result in case it has any
3721 SAVE_EXPRs in it that need to be evaluated here. */
3722 if (!Is_Renaming_Of_Object (gnat_temp)
3723 && ! (type_annotate_only
3724 && (Is_Array_Type (Etype (gnat_temp))
3725 || Is_Record_Type (Etype (gnat_temp))
3726 || Is_Concurrent_Type (Etype (gnat_temp)))))
3728 = gnat_to_gnu_entity (gnat_temp,
3729 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3731 gnu_result = alloc_stmt_list ();
3734 case N_Implicit_Label_Declaration:
3735 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3736 gnu_result = alloc_stmt_list ();
3739 case N_Exception_Renaming_Declaration:
3740 case N_Number_Declaration:
3741 case N_Package_Renaming_Declaration:
3742 case N_Subprogram_Renaming_Declaration:
3743 /* These are fully handled in the front end. */
3744 gnu_result = alloc_stmt_list ();
3747 /*************************************/
3748 /* Chapter 4: Names and Expressions */
3749 /*************************************/
3751 case N_Explicit_Dereference:
3752 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3753 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3754 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3757 case N_Indexed_Component:
3759 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3763 Node_Id *gnat_expr_array;
3765 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3766 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3768 /* If we got a padded type, remove it too. */
3769 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3770 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3772 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3775 gnu_result = gnu_array_object;
3777 /* First compute the number of dimensions of the array, then
3778 fill the expression array, the order depending on whether
3779 this is a Convention_Fortran array or not. */
3780 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3781 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3782 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3783 ndim++, gnu_type = TREE_TYPE (gnu_type))
3786 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3788 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3789 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3791 i--, gnat_temp = Next (gnat_temp))
3792 gnat_expr_array[i] = gnat_temp;
3794 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3796 i++, gnat_temp = Next (gnat_temp))
3797 gnat_expr_array[i] = gnat_temp;
3799 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3800 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3802 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3803 gnat_temp = gnat_expr_array[i];
3804 gnu_expr = gnat_to_gnu (gnat_temp);
3806 if (Do_Range_Check (gnat_temp))
3809 (gnu_array_object, gnu_expr,
3810 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3811 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3814 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3815 gnu_result, gnu_expr);
3819 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3825 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3827 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3828 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3830 /* Do any implicit dereferences of the prefix and do any needed
3832 gnu_result = maybe_implicit_deref (gnu_result);
3833 gnu_result = maybe_unconstrained_array (gnu_result);
3834 gnu_type = TREE_TYPE (gnu_result);
3835 if (Do_Range_Check (gnat_range_node))
3837 /* Get the bounds of the slice. */
3839 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3840 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3841 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3842 /* Get the permitted bounds. */
3843 tree gnu_base_index_type
3844 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3845 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3846 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3847 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3848 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3849 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3851 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3852 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3854 /* Derive a good type to convert everything to. */
3855 gnu_expr_type = get_base_type (gnu_index_type);
3857 /* Test whether the minimum slice value is too small. */
3858 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3859 convert (gnu_expr_type,
3861 convert (gnu_expr_type,
3862 gnu_base_min_expr));
3864 /* Test whether the maximum slice value is too large. */
3865 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3866 convert (gnu_expr_type,
3868 convert (gnu_expr_type,
3869 gnu_base_max_expr));
3871 /* Build a slice index check that returns the low bound,
3872 assuming the slice is not empty. */
3873 gnu_expr = emit_check
3874 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3875 gnu_expr_l, gnu_expr_h),
3876 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3878 /* Build a conditional expression that does the index checks and
3879 returns the low bound if the slice is not empty (max >= min),
3880 and returns the naked low bound otherwise (max < min), unless
3881 it is non-constant and the high bound is; this prevents VRP
3882 from inferring bogus ranges on the unlikely path. */
3883 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3884 build_binary_op (GE_EXPR, gnu_expr_type,
3885 convert (gnu_expr_type,
3887 convert (gnu_expr_type,
3890 TREE_CODE (gnu_min_expr) != INTEGER_CST
3891 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3892 ? gnu_max_expr : gnu_min_expr);
3895 /* Simply return the naked low bound. */
3896 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3898 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3899 gnu_result, gnu_expr);
3903 case N_Selected_Component:
3905 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3906 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3907 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3910 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3911 || IN (Ekind (gnat_pref_type), Access_Kind))
3913 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3914 gnat_pref_type = Underlying_Type (gnat_pref_type);
3915 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3916 gnat_pref_type = Designated_Type (gnat_pref_type);
3919 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3921 /* For discriminant references in tagged types always substitute the
3922 corresponding discriminant as the actual selected component. */
3923 if (Is_Tagged_Type (gnat_pref_type))
3924 while (Present (Corresponding_Discriminant (gnat_field)))
3925 gnat_field = Corresponding_Discriminant (gnat_field);
3927 /* For discriminant references of untagged types always substitute the
3928 corresponding stored discriminant. */
3929 else if (Present (Corresponding_Discriminant (gnat_field)))
3930 gnat_field = Original_Record_Component (gnat_field);
3932 /* Handle extracting the real or imaginary part of a complex.
3933 The real part is the first field and the imaginary the last. */
3934 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3935 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3936 ? REALPART_EXPR : IMAGPART_EXPR,
3937 NULL_TREE, gnu_prefix);
3940 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3942 /* If there are discriminants, the prefix might be evaluated more
3943 than once, which is a problem if it has side-effects. */
3944 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3945 ? Designated_Type (Etype
3946 (Prefix (gnat_node)))
3947 : Etype (Prefix (gnat_node))))
3948 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3951 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3952 (Nkind (Parent (gnat_node))
3953 == N_Attribute_Reference));
3956 gcc_assert (gnu_result);
3957 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3961 case N_Attribute_Reference:
3963 /* The attribute designator (like an enumeration value). */
3964 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
3966 /* The Elab_Spec and Elab_Body attributes are special in that
3967 Prefix is a unit, not an object with a GCC equivalent. Similarly
3968 for Elaborated, since that variable isn't otherwise known. */
3969 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
3970 return (create_subprog_decl
3971 (create_concat_name (Entity (Prefix (gnat_node)),
3972 attribute == Attr_Elab_Body
3973 ? "elabb" : "elabs"),
3974 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
3977 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
3982 /* Like 'Access as far as we are concerned. */
3983 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3984 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
3985 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3989 case N_Extension_Aggregate:
3993 /* ??? It is wrong to evaluate the type now, but there doesn't
3994 seem to be any other practical way of doing it. */
3996 gcc_assert (!Expansion_Delayed (gnat_node));
3998 gnu_aggr_type = gnu_result_type
3999 = get_unpadded_type (Etype (gnat_node));
4001 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4002 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4004 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4006 if (Null_Record_Present (gnat_node))
4007 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4009 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4010 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4012 = assoc_to_constructor (Etype (gnat_node),
4013 First (Component_Associations (gnat_node)),
4015 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4016 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4018 Component_Type (Etype (gnat_node)));
4019 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4022 (COMPLEX_EXPR, gnu_aggr_type,
4023 gnat_to_gnu (Expression (First
4024 (Component_Associations (gnat_node)))),
4025 gnat_to_gnu (Expression
4027 (First (Component_Associations (gnat_node))))));
4031 gnu_result = convert (gnu_result_type, gnu_result);
4036 if (TARGET_VTABLE_USES_DESCRIPTORS
4037 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4038 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4039 gnu_result = null_fdesc_node;
4041 gnu_result = null_pointer_node;
4042 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4045 case N_Type_Conversion:
4046 case N_Qualified_Expression:
4047 /* Get the operand expression. */
4048 gnu_result = gnat_to_gnu (Expression (gnat_node));
4049 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4052 = convert_with_check (Etype (gnat_node), gnu_result,
4053 Do_Overflow_Check (gnat_node),
4054 Do_Range_Check (Expression (gnat_node)),
4055 Nkind (gnat_node) == N_Type_Conversion
4056 && Float_Truncate (gnat_node), gnat_node);
4059 case N_Unchecked_Type_Conversion:
4060 gnu_result = gnat_to_gnu (Expression (gnat_node));
4061 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4063 /* If the result is a pointer type, see if we are improperly
4064 converting to a stricter alignment. */
4065 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4066 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4068 unsigned int align = known_alignment (gnu_result);
4069 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4070 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4072 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4073 post_error_ne_tree_2
4074 ("?source alignment (^) '< alignment of & (^)",
4075 gnat_node, Designated_Type (Etype (gnat_node)),
4076 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4079 /* If we are converting a descriptor to a function pointer, first
4080 build the pointer. */
4081 if (TARGET_VTABLE_USES_DESCRIPTORS
4082 && TREE_TYPE (gnu_result) == fdesc_type_node
4083 && POINTER_TYPE_P (gnu_result_type))
4084 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4086 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4087 No_Truncation (gnat_node));
4093 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4094 Node_Id gnat_range = Right_Opnd (gnat_node);
4098 /* GNAT_RANGE is either an N_Range node or an identifier
4099 denoting a subtype. */
4100 if (Nkind (gnat_range) == N_Range)
4102 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4103 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4105 else if (Nkind (gnat_range) == N_Identifier
4106 || Nkind (gnat_range) == N_Expanded_Name)
4108 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4110 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4111 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4116 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4118 /* If LOW and HIGH are identical, perform an equality test.
4119 Otherwise, ensure that GNU_OBJECT is only evaluated once
4120 and perform a full range test. */
4121 if (operand_equal_p (gnu_low, gnu_high, 0))
4122 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4123 gnu_object, gnu_low);
4126 gnu_object = protect_multiple_eval (gnu_object);
4128 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4129 build_binary_op (GE_EXPR, gnu_result_type,
4130 gnu_object, gnu_low),
4131 build_binary_op (LE_EXPR, gnu_result_type,
4132 gnu_object, gnu_high));
4135 if (Nkind (gnat_node) == N_Not_In)
4136 gnu_result = invert_truthvalue (gnu_result);
4141 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4142 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4143 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4144 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4146 : (Rounded_Result (gnat_node)
4147 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4148 gnu_result_type, gnu_lhs, gnu_rhs);
4151 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4152 /* These can either be operations on booleans or on modular types.
4153 Fall through for boolean types since that's the way GNU_CODES is
4155 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4156 Modular_Integer_Kind))
4159 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4160 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4163 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4164 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4165 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4166 gnu_result = build_binary_op (code, gnu_result_type,
4171 /* ... fall through ... */
4173 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4174 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4175 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4176 case N_Op_Mod: case N_Op_Rem:
4177 case N_Op_Rotate_Left:
4178 case N_Op_Rotate_Right:
4179 case N_Op_Shift_Left:
4180 case N_Op_Shift_Right:
4181 case N_Op_Shift_Right_Arithmetic:
4182 case N_And_Then: case N_Or_Else:
4184 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4185 bool ignore_lhs_overflow = false;
4188 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4189 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4190 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4192 /* If this is a comparison operator, convert any references to
4193 an unconstrained array value into a reference to the
4195 if (TREE_CODE_CLASS (code) == tcc_comparison)
4197 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4198 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4201 /* If the result type is a private type, its full view may be a
4202 numeric subtype. The representation we need is that of its base
4203 type, given that it is the result of an arithmetic operation. */
4204 else if (Is_Private_Type (Etype (gnat_node)))
4205 gnu_type = gnu_result_type
4206 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4208 /* If this is a shift whose count is not guaranteed to be correct,
4209 we need to adjust the shift count. */
4210 if (IN (Nkind (gnat_node), N_Op_Shift)
4211 && !Shift_Count_OK (gnat_node))
4213 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4215 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4217 if (Nkind (gnat_node) == N_Op_Rotate_Left
4218 || Nkind (gnat_node) == N_Op_Rotate_Right)
4219 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4220 gnu_rhs, gnu_max_shift);
4221 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4224 (MIN_EXPR, gnu_count_type,
4225 build_binary_op (MINUS_EXPR,
4228 convert (gnu_count_type,
4233 /* For right shifts, the type says what kind of shift to do,
4234 so we may need to choose a different type. In this case,
4235 we have to ignore integer overflow lest it propagates all
4236 the way down and causes a CE to be explicitly raised. */
4237 if (Nkind (gnat_node) == N_Op_Shift_Right
4238 && !TYPE_UNSIGNED (gnu_type))
4240 gnu_type = gnat_unsigned_type (gnu_type);
4241 ignore_lhs_overflow = true;
4243 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4244 && TYPE_UNSIGNED (gnu_type))
4246 gnu_type = gnat_signed_type (gnu_type);
4247 ignore_lhs_overflow = true;
4250 if (gnu_type != gnu_result_type)
4252 tree gnu_old_lhs = gnu_lhs;
4253 gnu_lhs = convert (gnu_type, gnu_lhs);
4254 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4255 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4256 gnu_rhs = convert (gnu_type, gnu_rhs);
4259 /* Instead of expanding overflow checks for addition, subtraction
4260 and multiplication itself, the front end will leave this to
4261 the back end when Backend_Overflow_Checks_On_Target is set.
4262 As the GCC back end itself does not know yet how to properly
4263 do overflow checking, do it here. The goal is to push
4264 the expansions further into the back end over time. */
4265 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4266 && (Nkind (gnat_node) == N_Op_Add
4267 || Nkind (gnat_node) == N_Op_Subtract
4268 || Nkind (gnat_node) == N_Op_Multiply)
4269 && !TYPE_UNSIGNED (gnu_type)
4270 && !FLOAT_TYPE_P (gnu_type))
4271 gnu_result = build_binary_op_trapv (code, gnu_type,
4272 gnu_lhs, gnu_rhs, gnat_node);
4274 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4276 /* If this is a logical shift with the shift count not verified,
4277 we must return zero if it is too large. We cannot compensate
4278 above in this case. */
4279 if ((Nkind (gnat_node) == N_Op_Shift_Left
4280 || Nkind (gnat_node) == N_Op_Shift_Right)
4281 && !Shift_Count_OK (gnat_node))
4285 build_binary_op (GE_EXPR, integer_type_node,
4287 convert (TREE_TYPE (gnu_rhs),
4288 TYPE_SIZE (gnu_type))),
4289 convert (gnu_type, integer_zero_node),
4294 case N_Conditional_Expression:
4296 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4297 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4299 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4301 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4302 gnu_result = build_cond_expr (gnu_result_type,
4303 gnat_truthvalue_conversion (gnu_cond),
4304 gnu_true, gnu_false);
4309 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4310 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4314 /* This case can apply to a boolean or a modular type.
4315 Fall through for a boolean operand since GNU_CODES is set
4316 up to handle this. */
4317 if (Is_Modular_Integer_Type (Etype (gnat_node))
4318 || (Ekind (Etype (gnat_node)) == E_Private_Type
4319 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4321 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4322 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4323 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4328 /* ... fall through ... */
4330 case N_Op_Minus: case N_Op_Abs:
4331 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4333 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4334 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4336 gnu_result_type = get_unpadded_type (Base_Type
4337 (Full_View (Etype (gnat_node))));
4339 if (Do_Overflow_Check (gnat_node)
4340 && !TYPE_UNSIGNED (gnu_result_type)
4341 && !FLOAT_TYPE_P (gnu_result_type))
4343 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4344 gnu_result_type, gnu_expr, gnat_node);
4346 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4347 gnu_result_type, gnu_expr);
4354 bool ignore_init_type = false;
4356 gnat_temp = Expression (gnat_node);
4358 /* The Expression operand can either be an N_Identifier or
4359 Expanded_Name, which must represent a type, or a
4360 N_Qualified_Expression, which contains both the object type and an
4361 initial value for the object. */
4362 if (Nkind (gnat_temp) == N_Identifier
4363 || Nkind (gnat_temp) == N_Expanded_Name)
4364 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4365 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4367 Entity_Id gnat_desig_type
4368 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4370 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4371 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4373 gnu_init = maybe_unconstrained_array (gnu_init);
4374 if (Do_Range_Check (Expression (gnat_temp)))
4376 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4378 if (Is_Elementary_Type (gnat_desig_type)
4379 || Is_Constrained (gnat_desig_type))
4381 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4382 gnu_init = convert (gnu_type, gnu_init);
4386 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4387 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4388 gnu_type = TREE_TYPE (gnu_init);
4390 gnu_init = convert (gnu_type, gnu_init);
4396 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4397 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4398 Procedure_To_Call (gnat_node),
4399 Storage_Pool (gnat_node), gnat_node,
4404 /**************************/
4405 /* Chapter 5: Statements */
4406 /**************************/
4409 gnu_result = build1 (LABEL_EXPR, void_type_node,
4410 gnat_to_gnu (Identifier (gnat_node)));
4413 case N_Null_Statement:
4414 gnu_result = alloc_stmt_list ();
4417 case N_Assignment_Statement:
4418 /* Get the LHS and RHS of the statement and convert any reference to an
4419 unconstrained array into a reference to the underlying array.
4420 If we are not to do range checking and the RHS is an N_Function_Call,
4421 pass the LHS to the call function. */
4422 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4424 /* If the type has a size that overflows, convert this into raise of
4425 Storage_Error: execution shouldn't have gotten here anyway. */
4426 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4427 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4428 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4429 N_Raise_Storage_Error);
4430 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4431 && !Do_Range_Check (Expression (gnat_node)))
4432 gnu_result = call_to_gnu (Expression (gnat_node),
4433 &gnu_result_type, gnu_lhs);
4437 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4439 /* If range check is needed, emit code to generate it. */
4440 if (Do_Range_Check (Expression (gnat_node)))
4441 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4445 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4447 /* If the type being assigned is an array type and the two sides
4448 are not completely disjoint, play safe and use memmove. */
4449 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4450 && Is_Array_Type (Etype (Name (gnat_node)))
4451 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4453 tree to, from, size, to_ptr, from_ptr, t;
4455 to = TREE_OPERAND (gnu_result, 0);
4456 from = TREE_OPERAND (gnu_result, 1);
4458 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4459 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4461 to_ptr = build_fold_addr_expr (to);
4462 from_ptr = build_fold_addr_expr (from);
4464 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4465 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4470 case N_If_Statement:
4472 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4474 /* Make the outer COND_EXPR. Avoid non-determinism. */
4475 gnu_result = build3 (COND_EXPR, void_type_node,
4476 gnat_to_gnu (Condition (gnat_node)),
4477 NULL_TREE, NULL_TREE);
4478 COND_EXPR_THEN (gnu_result)
4479 = build_stmt_group (Then_Statements (gnat_node), false);
4480 TREE_SIDE_EFFECTS (gnu_result) = 1;
4481 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4483 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4484 into the previous "else" part and point to where to put any
4485 outer "else". Also avoid non-determinism. */
4486 if (Present (Elsif_Parts (gnat_node)))
4487 for (gnat_temp = First (Elsif_Parts (gnat_node));
4488 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4490 gnu_expr = build3 (COND_EXPR, void_type_node,
4491 gnat_to_gnu (Condition (gnat_temp)),
4492 NULL_TREE, NULL_TREE);
4493 COND_EXPR_THEN (gnu_expr)
4494 = build_stmt_group (Then_Statements (gnat_temp), false);
4495 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4496 set_expr_location_from_node (gnu_expr, gnat_temp);
4497 *gnu_else_ptr = gnu_expr;
4498 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4501 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4505 case N_Case_Statement:
4506 gnu_result = Case_Statement_to_gnu (gnat_node);
4509 case N_Loop_Statement:
4510 gnu_result = Loop_Statement_to_gnu (gnat_node);
4513 case N_Block_Statement:
4514 start_stmt_group ();
4516 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4517 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4519 gnu_result = end_stmt_group ();
4521 if (Present (Identifier (gnat_node)))
4522 mark_out_of_scope (Entity (Identifier (gnat_node)));
4525 case N_Exit_Statement:
4527 = build2 (EXIT_STMT, void_type_node,
4528 (Present (Condition (gnat_node))
4529 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4530 (Present (Name (gnat_node))
4531 ? get_gnu_tree (Entity (Name (gnat_node)))
4532 : TREE_VALUE (gnu_loop_label_stack)));
4535 case N_Return_Statement:
4537 /* The gnu function type of the subprogram currently processed. */
4538 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4539 /* The return value from the subprogram. */
4540 tree gnu_ret_val = NULL_TREE;
4541 /* The place to put the return value. */
4544 /* If we are dealing with a "return;" from an Ada procedure with
4545 parameters passed by copy in copy out, we need to return a record
4546 containing the final values of these parameters. If the list
4547 contains only one entry, return just that entry.
4549 For a full description of the copy in copy out parameter mechanism,
4550 see the part of the gnat_to_gnu_entity routine dealing with the
4551 translation of subprograms.
4553 But if we have a return label defined, convert this into
4554 a branch to that label. */
4556 if (TREE_VALUE (gnu_return_label_stack))
4558 gnu_result = build1 (GOTO_EXPR, void_type_node,
4559 TREE_VALUE (gnu_return_label_stack));
4563 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4565 gnu_lhs = DECL_RESULT (current_function_decl);
4566 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4567 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4570 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4571 TYPE_CI_CO_LIST (gnu_subprog_type));
4574 /* If the Ada subprogram is a function, we just need to return the
4575 expression. If the subprogram returns an unconstrained
4576 array, we have to allocate a new version of the result and
4577 return it. If we return by reference, return a pointer. */
4579 else if (Present (Expression (gnat_node)))
4581 /* If the current function returns by target pointer and we
4582 are doing a call, pass that target to the call. */
4583 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4584 && Nkind (Expression (gnat_node)) == N_Function_Call)
4587 = build_unary_op (INDIRECT_REF, NULL_TREE,
4588 DECL_ARGUMENTS (current_function_decl));
4589 gnu_result = call_to_gnu (Expression (gnat_node),
4590 &gnu_result_type, gnu_lhs);
4594 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4596 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4597 /* The original return type was unconstrained so dereference
4598 the TARGET pointer in the actual return value's type. */
4600 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4601 DECL_ARGUMENTS (current_function_decl));
4603 gnu_lhs = DECL_RESULT (current_function_decl);
4605 /* Do not remove the padding from GNU_RET_VAL if the inner
4606 type is self-referential since we want to allocate the fixed
4607 size in that case. */
4608 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4609 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4611 && (TYPE_IS_PADDING_P
4612 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4613 && (CONTAINS_PLACEHOLDER_P
4614 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4615 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4617 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4618 || By_Ref (gnat_node))
4620 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4622 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4624 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4626 = build_allocator (TREE_TYPE (gnu_ret_val),
4628 TREE_TYPE (gnu_subprog_type),
4629 Procedure_To_Call (gnat_node),
4630 Storage_Pool (gnat_node),
4636 /* If the Ada subprogram is a regular procedure, just return. */
4637 gnu_lhs = NULL_TREE;
4639 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4642 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4643 gnu_lhs, gnu_ret_val);
4644 add_stmt_with_node (gnu_result, gnat_node);
4645 gnu_lhs = NULL_TREE;
4648 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4652 case N_Goto_Statement:
4653 gnu_result = build1 (GOTO_EXPR, void_type_node,
4654 gnat_to_gnu (Name (gnat_node)));
4657 /***************************/
4658 /* Chapter 6: Subprograms */
4659 /***************************/
4661 case N_Subprogram_Declaration:
4662 /* Unless there is a freeze node, declare the subprogram. We consider
4663 this a "definition" even though we're not generating code for
4664 the subprogram because we will be making the corresponding GCC
4667 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4668 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4670 gnu_result = alloc_stmt_list ();
4673 case N_Abstract_Subprogram_Declaration:
4674 /* This subprogram doesn't exist for code generation purposes, but we
4675 have to elaborate the types of any parameters and result, unless
4676 they are imported types (nothing to generate in this case). */
4678 /* Process the parameter types first. */
4681 = First_Formal_With_Extras
4682 (Defining_Entity (Specification (gnat_node)));
4683 Present (gnat_temp);
4684 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4685 if (Is_Itype (Etype (gnat_temp))
4686 && !From_With_Type (Etype (gnat_temp)))
4687 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4690 /* Then the result type, set to Standard_Void_Type for procedures. */
4693 Entity_Id gnat_temp_type
4694 = Etype (Defining_Entity (Specification (gnat_node)));
4696 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4697 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4700 gnu_result = alloc_stmt_list ();
4703 case N_Defining_Program_Unit_Name:
4704 /* For a child unit identifier go up a level to get the specification.
4705 We get this when we try to find the spec of a child unit package
4706 that is the compilation unit being compiled. */
4707 gnu_result = gnat_to_gnu (Parent (gnat_node));
4710 case N_Subprogram_Body:
4711 Subprogram_Body_to_gnu (gnat_node);
4712 gnu_result = alloc_stmt_list ();
4715 case N_Function_Call:
4716 case N_Procedure_Call_Statement:
4717 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4720 /************************/
4721 /* Chapter 7: Packages */
4722 /************************/
4724 case N_Package_Declaration:
4725 gnu_result = gnat_to_gnu (Specification (gnat_node));
4728 case N_Package_Specification:
4730 start_stmt_group ();
4731 process_decls (Visible_Declarations (gnat_node),
4732 Private_Declarations (gnat_node), Empty, true, true);
4733 gnu_result = end_stmt_group ();
4736 case N_Package_Body:
4738 /* If this is the body of a generic package - do nothing. */
4739 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4741 gnu_result = alloc_stmt_list ();
4745 start_stmt_group ();
4746 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4748 if (Present (Handled_Statement_Sequence (gnat_node)))
4749 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4751 gnu_result = end_stmt_group ();
4754 /********************************/
4755 /* Chapter 8: Visibility Rules */
4756 /********************************/
4758 case N_Use_Package_Clause:
4759 case N_Use_Type_Clause:
4760 /* Nothing to do here - but these may appear in list of declarations. */
4761 gnu_result = alloc_stmt_list ();
4764 /*********************/
4765 /* Chapter 9: Tasks */
4766 /*********************/
4768 case N_Protected_Type_Declaration:
4769 gnu_result = alloc_stmt_list ();
4772 case N_Single_Task_Declaration:
4773 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4774 gnu_result = alloc_stmt_list ();
4777 /*********************************************************/
4778 /* Chapter 10: Program Structure and Compilation Issues */
4779 /*********************************************************/
4781 case N_Compilation_Unit:
4783 /* This is not called for the main unit, which is handled in function
4785 start_stmt_group ();
4788 Compilation_Unit_to_gnu (gnat_node);
4789 gnu_result = alloc_stmt_list ();
4792 case N_Subprogram_Body_Stub:
4793 case N_Package_Body_Stub:
4794 case N_Protected_Body_Stub:
4795 case N_Task_Body_Stub:
4796 /* Simply process whatever unit is being inserted. */
4797 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4801 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4804 /***************************/
4805 /* Chapter 11: Exceptions */
4806 /***************************/
4808 case N_Handled_Sequence_Of_Statements:
4809 /* If there is an At_End procedure attached to this node, and the EH
4810 mechanism is SJLJ, we must have at least a corresponding At_End
4811 handler, unless the No_Exception_Handlers restriction is set. */
4812 gcc_assert (type_annotate_only
4813 || Exception_Mechanism != Setjmp_Longjmp
4814 || No (At_End_Proc (gnat_node))
4815 || Present (Exception_Handlers (gnat_node))
4816 || No_Exception_Handlers_Set ());
4818 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4821 case N_Exception_Handler:
4822 if (Exception_Mechanism == Setjmp_Longjmp)
4823 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4824 else if (Exception_Mechanism == Back_End_Exceptions)
4825 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4831 case N_Push_Constraint_Error_Label:
4832 push_exception_label_stack (&gnu_constraint_error_label_stack,
4833 Exception_Label (gnat_node));
4836 case N_Push_Storage_Error_Label:
4837 push_exception_label_stack (&gnu_storage_error_label_stack,
4838 Exception_Label (gnat_node));
4841 case N_Push_Program_Error_Label:
4842 push_exception_label_stack (&gnu_program_error_label_stack,
4843 Exception_Label (gnat_node));
4846 case N_Pop_Constraint_Error_Label:
4847 gnu_constraint_error_label_stack
4848 = TREE_CHAIN (gnu_constraint_error_label_stack);
4851 case N_Pop_Storage_Error_Label:
4852 gnu_storage_error_label_stack
4853 = TREE_CHAIN (gnu_storage_error_label_stack);
4856 case N_Pop_Program_Error_Label:
4857 gnu_program_error_label_stack
4858 = TREE_CHAIN (gnu_program_error_label_stack);
4861 /******************************/
4862 /* Chapter 12: Generic Units */
4863 /******************************/
4865 case N_Generic_Function_Renaming_Declaration:
4866 case N_Generic_Package_Renaming_Declaration:
4867 case N_Generic_Procedure_Renaming_Declaration:
4868 case N_Generic_Package_Declaration:
4869 case N_Generic_Subprogram_Declaration:
4870 case N_Package_Instantiation:
4871 case N_Procedure_Instantiation:
4872 case N_Function_Instantiation:
4873 /* These nodes can appear on a declaration list but there is nothing to
4874 to be done with them. */
4875 gnu_result = alloc_stmt_list ();
4878 /**************************************************/
4879 /* Chapter 13: Representation Clauses and */
4880 /* Implementation-Dependent Features */
4881 /**************************************************/
4883 case N_Attribute_Definition_Clause:
4884 gnu_result = alloc_stmt_list ();
4886 /* The only one we need to deal with is 'Address since, for the others,
4887 the front-end puts the information elsewhere. */
4888 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4891 /* And we only deal with 'Address if the object has a Freeze node. */
4892 gnat_temp = Entity (Name (gnat_node));
4893 if (No (Freeze_Node (gnat_temp)))
4896 /* Get the value to use as the address and save it as the equivalent
4897 for the object. When it is frozen, gnat_to_gnu_entity will do the
4899 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4902 case N_Enumeration_Representation_Clause:
4903 case N_Record_Representation_Clause:
4905 /* We do nothing with these. SEM puts the information elsewhere. */
4906 gnu_result = alloc_stmt_list ();
4909 case N_Code_Statement:
4910 if (!type_annotate_only)
4912 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4913 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4914 tree gnu_clobbers = NULL_TREE, tail;
4915 bool allows_mem, allows_reg, fake;
4916 int ninputs, noutputs, i;
4917 const char **oconstraints;
4918 const char *constraint;
4921 /* First retrieve the 3 operand lists built by the front-end. */
4922 Setup_Asm_Outputs (gnat_node);
4923 while (Present (gnat_temp = Asm_Output_Variable ()))
4925 tree gnu_value = gnat_to_gnu (gnat_temp);
4926 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4927 (Asm_Output_Constraint ()));
4929 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4933 Setup_Asm_Inputs (gnat_node);
4934 while (Present (gnat_temp = Asm_Input_Value ()))
4936 tree gnu_value = gnat_to_gnu (gnat_temp);
4937 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4938 (Asm_Input_Constraint ()));
4940 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4944 Clobber_Setup (gnat_node);
4945 while ((clobber = Clobber_Get_Next ()))
4947 = tree_cons (NULL_TREE,
4948 build_string (strlen (clobber) + 1, clobber),
4951 /* Then perform some standard checking and processing on the
4952 operands. In particular, mark them addressable if needed. */
4953 gnu_outputs = nreverse (gnu_outputs);
4954 noutputs = list_length (gnu_outputs);
4955 gnu_inputs = nreverse (gnu_inputs);
4956 ninputs = list_length (gnu_inputs);
4958 = (const char **) alloca (noutputs * sizeof (const char *));
4960 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4962 tree output = TREE_VALUE (tail);
4964 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4965 oconstraints[i] = constraint;
4967 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4968 &allows_mem, &allows_reg, &fake))
4970 /* If the operand is going to end up in memory,
4971 mark it addressable. Note that we don't test
4972 allows_mem like in the input case below; this
4973 is modelled on the C front-end. */
4975 && !gnat_mark_addressable (output))
4976 output = error_mark_node;
4979 output = error_mark_node;
4981 TREE_VALUE (tail) = output;
4984 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
4986 tree input = TREE_VALUE (tail);
4988 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4990 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
4992 &allows_mem, &allows_reg))
4994 /* If the operand is going to end up in memory,
4995 mark it addressable. */
4996 if (!allows_reg && allows_mem
4997 && !gnat_mark_addressable (input))
4998 input = error_mark_node;
5001 input = error_mark_node;
5003 TREE_VALUE (tail) = input;
5006 gnu_result = build4 (ASM_EXPR, void_type_node,
5007 gnu_template, gnu_outputs,
5008 gnu_inputs, gnu_clobbers);
5009 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5012 gnu_result = alloc_stmt_list ();
5020 case N_Freeze_Entity:
5021 start_stmt_group ();
5022 process_freeze_entity (gnat_node);
5023 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5024 gnu_result = end_stmt_group ();
5027 case N_Itype_Reference:
5028 if (!present_gnu_tree (Itype (gnat_node)))
5029 process_type (Itype (gnat_node));
5031 gnu_result = alloc_stmt_list ();
5034 case N_Free_Statement:
5035 if (!type_annotate_only)
5037 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5038 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5040 tree gnu_actual_obj_type = 0;
5043 unsigned int default_allocator_alignment
5044 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
5046 /* If this is a thin pointer, we must dereference it to create
5047 a fat pointer, then go back below to a thin pointer. The
5048 reason for this is that we need a fat pointer someplace in
5049 order to properly compute the size. */
5050 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5051 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5052 build_unary_op (INDIRECT_REF, NULL_TREE,
5055 /* If this is an unconstrained array, we know the object must
5056 have been allocated with the template in front of the object.
5057 So pass the template address, but get the total size. Do this
5058 by converting to a thin pointer. */
5059 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5061 = convert (build_pointer_type
5062 (TYPE_OBJECT_RECORD_TYPE
5063 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5066 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5068 if (Present (Actual_Designated_Subtype (gnat_node)))
5071 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5073 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5075 = build_unc_object_type_from_ptr (gnu_ptr_type,
5076 gnu_actual_obj_type,
5077 get_identifier ("DEALLOC"));
5080 gnu_actual_obj_type = gnu_obj_type;
5082 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5083 align = TYPE_ALIGN (gnu_obj_type);
5085 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5086 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5088 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5089 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5090 tree gnu_byte_offset
5091 = convert (sizetype,
5092 size_diffop (size_zero_node, gnu_pos));
5093 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5095 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5096 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5097 gnu_ptr, gnu_byte_offset);
5100 /* If the object was allocated from the default storage pool, the
5101 alignment was greater than what the allocator provides, and this
5102 is not a fat or thin pointer, what we have in gnu_ptr here is an
5103 address dynamically adjusted to match the alignment requirement
5104 (see build_allocator). What we need to pass to free is the
5105 initial allocator's return value, which has been stored just in
5106 front of the block we have. */
5108 if (No (Procedure_To_Call (gnat_node))
5109 && align > default_allocator_alignment
5110 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5113 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
5117 = (void *)GNU_PTR - (void *)sizeof (void *)) */
5120 (POINTER_PLUS_EXPR, ptr_void_type_node,
5121 convert (ptr_void_type_node, gnu_ptr),
5122 size_int (-POINTER_SIZE/BITS_PER_UNIT));
5124 /* GNU_PTR (void *) = *(void **)GNU_PTR */
5127 (INDIRECT_REF, NULL_TREE,
5128 convert (build_pointer_type (ptr_void_type_node),
5132 gnu_result = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, align,
5133 Procedure_To_Call (gnat_node),
5134 Storage_Pool (gnat_node),
5139 case N_Raise_Constraint_Error:
5140 case N_Raise_Program_Error:
5141 case N_Raise_Storage_Error:
5142 if (type_annotate_only)
5144 gnu_result = alloc_stmt_list ();
5148 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5150 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5153 /* If the type is VOID, this is a statement, so we need to
5154 generate the code for the call. Handle a Condition, if there
5156 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5158 set_expr_location_from_node (gnu_result, gnat_node);
5160 if (Present (Condition (gnat_node)))
5161 gnu_result = build3 (COND_EXPR, void_type_node,
5162 gnat_to_gnu (Condition (gnat_node)),
5163 gnu_result, alloc_stmt_list ());
5166 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5169 case N_Validate_Unchecked_Conversion:
5171 Entity_Id gnat_target_type = Target_Type (gnat_node);
5172 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5173 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5175 /* No need for any warning in this case. */
5176 if (!flag_strict_aliasing)
5179 /* If the result is a pointer type, see if we are either converting
5180 from a non-pointer or from a pointer to a type with a different
5181 alias set and warn if so. If the result is defined in the same
5182 unit as this unchecked conversion, we can allow this because we
5183 can know to make the pointer type behave properly. */
5184 else if (POINTER_TYPE_P (gnu_target_type)
5185 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5186 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5188 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5189 ? TREE_TYPE (gnu_source_type)
5191 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5193 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5194 || get_alias_set (gnu_target_desig_type) != 0)
5195 && (!POINTER_TYPE_P (gnu_source_type)
5196 || (TYPE_DUMMY_P (gnu_source_desig_type)
5197 != TYPE_DUMMY_P (gnu_target_desig_type))
5198 || (TYPE_DUMMY_P (gnu_source_desig_type)
5199 && gnu_source_desig_type != gnu_target_desig_type)
5200 || !alias_sets_conflict_p
5201 (get_alias_set (gnu_source_desig_type),
5202 get_alias_set (gnu_target_desig_type))))
5205 ("?possible aliasing problem for type&",
5206 gnat_node, Target_Type (gnat_node));
5208 ("\\?use -fno-strict-aliasing switch for references",
5211 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5212 gnat_node, Target_Type (gnat_node));
5216 /* But if the result is a fat pointer type, we have no mechanism to
5217 do that, so we unconditionally warn in problematic cases. */
5218 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5220 tree gnu_source_array_type
5221 = TYPE_FAT_POINTER_P (gnu_source_type)
5222 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5224 tree gnu_target_array_type
5225 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5227 if ((TYPE_DUMMY_P (gnu_target_array_type)
5228 || get_alias_set (gnu_target_array_type) != 0)
5229 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5230 || (TYPE_DUMMY_P (gnu_source_array_type)
5231 != TYPE_DUMMY_P (gnu_target_array_type))
5232 || (TYPE_DUMMY_P (gnu_source_array_type)
5233 && gnu_source_array_type != gnu_target_array_type)
5234 || !alias_sets_conflict_p
5235 (get_alias_set (gnu_source_array_type),
5236 get_alias_set (gnu_target_array_type))))
5239 ("?possible aliasing problem for type&",
5240 gnat_node, Target_Type (gnat_node));
5242 ("\\?use -fno-strict-aliasing switch for references",
5247 gnu_result = alloc_stmt_list ();
5250 case N_Raise_Statement:
5251 case N_Function_Specification:
5252 case N_Procedure_Specification:
5254 case N_Component_Association:
5257 gcc_assert (type_annotate_only);
5258 gnu_result = alloc_stmt_list ();
5261 /* If we pushed our level as part of processing the elaboration routine,
5263 if (went_into_elab_proc)
5265 add_stmt (gnu_result);
5267 gnu_result = end_stmt_group ();
5268 current_function_decl = NULL_TREE;
5271 /* Set the location information on the result if it is a real expression.
5272 References can be reused for multiple GNAT nodes and they would get
5273 the location information of their last use. Note that we may have
5274 no result if we tried to build a CALL_EXPR node to a procedure with
5275 no side-effects and optimization is enabled. */
5277 && EXPR_P (gnu_result)
5278 && TREE_CODE (gnu_result) != NOP_EXPR
5279 && !REFERENCE_CLASS_P (gnu_result))
5280 set_expr_location_from_node (gnu_result, gnat_node);
5282 /* If we're supposed to return something of void_type, it means we have
5283 something we're elaborating for effect, so just return. */
5284 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5287 /* If the result is a constant that overflows, raise constraint error. */
5288 else if (TREE_CODE (gnu_result) == INTEGER_CST
5289 && TREE_OVERFLOW (gnu_result))
5291 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5294 = build1 (NULL_EXPR, gnu_result_type,
5295 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5296 N_Raise_Constraint_Error));
5299 /* If our result has side-effects and is of an unconstrained type,
5300 make a SAVE_EXPR so that we can be sure it will only be referenced
5301 once. Note we must do this before any conversions. */
5302 if (TREE_SIDE_EFFECTS (gnu_result)
5303 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5304 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5305 gnu_result = gnat_stabilize_reference (gnu_result, false);
5307 /* Now convert the result to the result type, unless we are in one of the
5310 1. If this is the Name of an assignment statement or a parameter of
5311 a procedure call, return the result almost unmodified since the
5312 RHS will have to be converted to our type in that case, unless
5313 the result type has a simpler size. Similarly, don't convert
5314 integral types that are the operands of an unchecked conversion
5315 since we need to ignore those conversions (for 'Valid).
5317 2. If we have a label (which doesn't have any well-defined type), a
5318 field or an error, return the result almost unmodified. Also don't
5319 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5320 its size since those are the cases where the front end may have the
5321 type wrong due to "instantiating" the unconstrained record with
5322 discriminant values. Similarly, if the two types are record types
5323 with the same name don't convert. This will be the case when we are
5324 converting from a packable version of a type to its original type and
5325 we need those conversions to be NOPs in order for assignments into
5326 these types to work properly.
5328 3. If the type is void or if we have no result, return error_mark_node
5329 to show we have no result.
5331 4. Finally, if the type of the result is already correct. */
5333 if (Present (Parent (gnat_node))
5334 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5335 && Name (Parent (gnat_node)) == gnat_node)
5336 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5337 && Name (Parent (gnat_node)) != gnat_node)
5338 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5339 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5340 && !AGGREGATE_TYPE_P (gnu_result_type)
5341 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5342 && !(TYPE_SIZE (gnu_result_type)
5343 && TYPE_SIZE (TREE_TYPE (gnu_result))
5344 && (AGGREGATE_TYPE_P (gnu_result_type)
5345 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5346 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5347 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5349 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5350 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5351 && (CONTAINS_PLACEHOLDER_P
5352 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5353 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5354 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5356 /* Remove padding only if the inner object is of self-referential
5357 size: in that case it must be an object of unconstrained type
5358 with a default discriminant and we want to avoid copying too
5360 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5361 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5362 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5363 (TREE_TYPE (gnu_result))))))
5364 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5368 else if (TREE_CODE (gnu_result) == LABEL_DECL
5369 || TREE_CODE (gnu_result) == FIELD_DECL
5370 || TREE_CODE (gnu_result) == ERROR_MARK
5371 || (TYPE_SIZE (gnu_result_type)
5372 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5373 && TREE_CODE (gnu_result) != INDIRECT_REF
5374 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5375 || ((TYPE_NAME (gnu_result_type)
5376 == TYPE_NAME (TREE_TYPE (gnu_result)))
5377 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5378 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5380 /* Remove any padding. */
5381 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5382 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5383 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5387 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5388 gnu_result = error_mark_node;
5390 else if (gnu_result_type != TREE_TYPE (gnu_result))
5391 gnu_result = convert (gnu_result_type, gnu_result);
5393 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5394 while ((TREE_CODE (gnu_result) == NOP_EXPR
5395 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5396 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5397 gnu_result = TREE_OPERAND (gnu_result, 0);
5402 /* Subroutine of above to push the exception label stack. GNU_STACK is
5403 a pointer to the stack to update and GNAT_LABEL, if present, is the
5404 label to push onto the stack. */
5407 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5409 tree gnu_label = (Present (gnat_label)
5410 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5413 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5416 /* Record the current code position in GNAT_NODE. */
5419 record_code_position (Node_Id gnat_node)
5421 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5423 add_stmt_with_node (stmt_stmt, gnat_node);
5424 save_gnu_tree (gnat_node, stmt_stmt, true);
5427 /* Insert the code for GNAT_NODE at the position saved for that node. */
5430 insert_code_for (Node_Id gnat_node)
5432 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5433 save_gnu_tree (gnat_node, NULL_TREE, true);
5436 /* Start a new statement group chained to the previous group. */
5439 start_stmt_group (void)
5441 struct stmt_group *group = stmt_group_free_list;
5443 /* First see if we can get one from the free list. */
5445 stmt_group_free_list = group->previous;
5447 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5449 group->previous = current_stmt_group;
5450 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5451 current_stmt_group = group;
5454 /* Add GNU_STMT to the current statement group. */
5457 add_stmt (tree gnu_stmt)
5459 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5462 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5465 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5467 if (Present (gnat_node))
5468 set_expr_location_from_node (gnu_stmt, gnat_node);
5469 add_stmt (gnu_stmt);
5472 /* Add a declaration statement for GNU_DECL to the current statement group.
5473 Get SLOC from Entity_Id. */
5476 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5478 tree type = TREE_TYPE (gnu_decl);
5479 tree gnu_stmt, gnu_init, t;
5481 /* If this is a variable that Gigi is to ignore, we may have been given
5482 an ERROR_MARK. So test for it. We also might have been given a
5483 reference for a renaming. So only do something for a decl. Also
5484 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5485 if (!DECL_P (gnu_decl)
5486 || (TREE_CODE (gnu_decl) == TYPE_DECL
5487 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5490 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5492 /* If we are global, we don't want to actually output the DECL_EXPR for
5493 this decl since we already have evaluated the expressions in the
5494 sizes and positions as globals and doing it again would be wrong. */
5495 if (global_bindings_p ())
5497 /* Mark everything as used to prevent node sharing with subprograms.
5498 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5499 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5500 mark_visited (&gnu_stmt);
5501 if (TREE_CODE (gnu_decl) == VAR_DECL
5502 || TREE_CODE (gnu_decl) == CONST_DECL)
5504 mark_visited (&DECL_SIZE (gnu_decl));
5505 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5506 mark_visited (&DECL_INITIAL (gnu_decl));
5508 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5509 if (TREE_CODE (gnu_decl) == TYPE_DECL
5510 && (TREE_CODE (type) == RECORD_TYPE
5511 || TREE_CODE (type) == UNION_TYPE
5512 || TREE_CODE (type) == QUAL_UNION_TYPE)
5513 && (t = TYPE_ADA_SIZE (type)))
5517 add_stmt_with_node (gnu_stmt, gnat_entity);
5519 /* If this is a variable and an initializer is attached to it, it must be
5520 valid for the context. Similar to init_const in create_var_decl_1. */
5521 if (TREE_CODE (gnu_decl) == VAR_DECL
5522 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5523 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5524 || (TREE_STATIC (gnu_decl)
5525 && !initializer_constant_valid_p (gnu_init,
5526 TREE_TYPE (gnu_init)))))
5528 /* If GNU_DECL has a padded type, convert it to the unpadded
5529 type so the assignment is done properly. */
5530 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5531 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5535 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5537 DECL_INITIAL (gnu_decl) = NULL_TREE;
5538 if (TREE_READONLY (gnu_decl))
5540 TREE_READONLY (gnu_decl) = 0;
5541 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5544 add_stmt_with_node (gnu_stmt, gnat_entity);
5548 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5551 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5553 if (TREE_VISITED (*tp))
5556 /* Don't mark a dummy type as visited because we want to mark its sizes
5557 and fields once it's filled in. */
5558 else if (!TYPE_IS_DUMMY_P (*tp))
5559 TREE_VISITED (*tp) = 1;
5562 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5567 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5570 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5571 void *data ATTRIBUTE_UNUSED)
5575 if (TREE_CODE (t) == SAVE_EXPR)
5576 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5581 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5582 sized gimplified. We use this to indicate all variable sizes and
5583 positions in global types may not be shared by any subprogram. */
5586 mark_visited (tree *tp)
5588 walk_tree (tp, mark_visited_r, NULL, NULL);
5591 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5592 set its location to that of GNAT_NODE if present. */
5595 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5597 if (Present (gnat_node))
5598 set_expr_location_from_node (gnu_cleanup, gnat_node);
5599 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5602 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5605 set_block_for_group (tree gnu_block)
5607 gcc_assert (!current_stmt_group->block);
5608 current_stmt_group->block = gnu_block;
5611 /* Return code corresponding to the current code group. It is normally
5612 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5613 BLOCK or cleanups were set. */
5616 end_stmt_group (void)
5618 struct stmt_group *group = current_stmt_group;
5619 tree gnu_retval = group->stmt_list;
5621 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5622 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5623 make a BIND_EXPR. Note that we nest in that because the cleanup may
5624 reference variables in the block. */
5625 if (gnu_retval == NULL_TREE)
5626 gnu_retval = alloc_stmt_list ();
5628 if (group->cleanups)
5629 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5632 if (current_stmt_group->block)
5633 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5634 gnu_retval, group->block);
5636 /* Remove this group from the stack and add it to the free list. */
5637 current_stmt_group = group->previous;
5638 group->previous = stmt_group_free_list;
5639 stmt_group_free_list = group;
5644 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5648 add_stmt_list (List_Id gnat_list)
5652 if (Present (gnat_list))
5653 for (gnat_node = First (gnat_list); Present (gnat_node);
5654 gnat_node = Next (gnat_node))
5655 add_stmt (gnat_to_gnu (gnat_node));
5658 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5659 If BINDING_P is true, push and pop a binding level around the list. */
5662 build_stmt_group (List_Id gnat_list, bool binding_p)
5664 start_stmt_group ();
5668 add_stmt_list (gnat_list);
5672 return end_stmt_group ();
5675 /* Push and pop routines for stacks. We keep a free list around so we
5676 don't waste tree nodes. */
5679 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5681 tree gnu_node = gnu_stack_free_list;
5685 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5686 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5687 TREE_PURPOSE (gnu_node) = gnu_purpose;
5688 TREE_VALUE (gnu_node) = gnu_value;
5691 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5693 *gnu_stack_ptr = gnu_node;
5697 pop_stack (tree *gnu_stack_ptr)
5699 tree gnu_node = *gnu_stack_ptr;
5701 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5702 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5703 gnu_stack_free_list = gnu_node;
5706 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5709 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5710 gimple_seq *post_p ATTRIBUTE_UNUSED)
5712 tree expr = *expr_p;
5715 if (IS_ADA_STMT (expr))
5716 return gnat_gimplify_stmt (expr_p);
5718 switch (TREE_CODE (expr))
5721 /* If this is for a scalar, just make a VAR_DECL for it. If for
5722 an aggregate, get a null pointer of the appropriate type and
5724 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5725 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5726 convert (build_pointer_type (TREE_TYPE (expr)),
5727 integer_zero_node));
5730 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5731 TREE_NO_WARNING (*expr_p) = 1;
5734 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5737 case UNCONSTRAINED_ARRAY_REF:
5738 /* We should only do this if we are just elaborating for side-effects,
5739 but we can't know that yet. */
5740 *expr_p = TREE_OPERAND (*expr_p, 0);
5744 op = TREE_OPERAND (expr, 0);
5746 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5747 be put into static memory. We know it's going to be readonly given
5748 the semantics we have and it's required to be static memory in
5749 the case when the reference is in an elaboration procedure. */
5750 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5752 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5754 TREE_READONLY (new_var) = 1;
5755 TREE_STATIC (new_var) = 1;
5756 TREE_ADDRESSABLE (new_var) = 1;
5757 DECL_INITIAL (new_var) = op;
5759 TREE_OPERAND (expr, 0) = new_var;
5760 recompute_tree_invariant_for_addr_expr (expr);
5764 /* If we are taking the address of a SAVE_EXPR, we are typically
5765 processing a misaligned argument to be passed by reference in a
5766 procedure call. We just mark the operand as addressable + not
5767 readonly here and let the common gimplifier code perform the
5768 temporary creation, initialization, and "instantiation" in place of
5769 the SAVE_EXPR in further operands, in particular in the copy back
5770 code inserted after the call. */
5771 else if (TREE_CODE (op) == SAVE_EXPR)
5773 TREE_ADDRESSABLE (op) = 1;
5774 TREE_READONLY (op) = 0;
5777 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5778 address of the selected operand when it is addressable. Besides, we
5779 also expect addressable_p to only let COND_EXPRs where both arms are
5780 addressable reach here. */
5781 else if (TREE_CODE (op) == COND_EXPR)
5784 /* Otherwise, if we are taking the address of something that is neither
5785 reference, declaration, or constant, make a variable for the operand
5786 here and then take its address. If we don't do it this way, we may
5787 confuse the gimplifier because it needs to know the variable is
5788 addressable at this point. This duplicates code in
5789 internal_get_tmp_var, which is unfortunate. */
5790 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5791 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5792 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5794 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5797 TREE_ADDRESSABLE (new_var) = 1;
5799 stmt = gimplify_assign (new_var, op, pre_p);
5800 if (EXPR_HAS_LOCATION (op))
5801 gimple_set_location (stmt, *EXPR_LOCUS (op));
5803 TREE_OPERAND (expr, 0) = new_var;
5804 recompute_tree_invariant_for_addr_expr (expr);
5808 /* ... fall through ... */
5811 return GS_UNHANDLED;
5815 /* Generate GIMPLE in place for the statement at *STMT_P. */
5817 static enum gimplify_status
5818 gnat_gimplify_stmt (tree *stmt_p)
5820 tree stmt = *stmt_p;
5822 switch (TREE_CODE (stmt))
5825 *stmt_p = STMT_STMT_STMT (stmt);
5830 tree gnu_start_label = create_artificial_label ();
5831 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5834 /* Set to emit the statements of the loop. */
5835 *stmt_p = NULL_TREE;
5837 /* We first emit the start label and then a conditional jump to
5838 the end label if there's a top condition, then the body of the
5839 loop, then a conditional branch to the end label, then the update,
5840 if any, and finally a jump to the start label and the definition
5841 of the end label. */
5842 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5846 if (LOOP_STMT_TOP_COND (stmt))
5847 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5848 LOOP_STMT_TOP_COND (stmt),
5855 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5857 if (LOOP_STMT_BOT_COND (stmt))
5858 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5859 LOOP_STMT_BOT_COND (stmt),
5866 if (LOOP_STMT_UPDATE (stmt))
5867 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5869 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5870 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5871 append_to_statement_list (t, stmt_p);
5873 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5880 /* Build a statement to jump to the corresponding end label, then
5881 see if it needs to be conditional. */
5882 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5883 if (EXIT_STMT_COND (stmt))
5884 *stmt_p = build3 (COND_EXPR, void_type_node,
5885 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5893 /* Force references to each of the entities in packages withed by GNAT_NODE.
5894 Operate recursively but check that we aren't elaborating something more
5897 This routine is exclusively called in type_annotate mode, to compute DDA
5898 information for types in withed units, for ASIS use. */
5901 elaborate_all_entities (Node_Id gnat_node)
5903 Entity_Id gnat_with_clause, gnat_entity;
5905 /* Process each unit only once. As we trace the context of all relevant
5906 units transitively, including generic bodies, we may encounter the
5907 same generic unit repeatedly. */
5908 if (!present_gnu_tree (gnat_node))
5909 save_gnu_tree (gnat_node, integer_zero_node, true);
5911 /* Save entities in all context units. A body may have an implicit_with
5912 on its own spec, if the context includes a child unit, so don't save
5914 for (gnat_with_clause = First (Context_Items (gnat_node));
5915 Present (gnat_with_clause);
5916 gnat_with_clause = Next (gnat_with_clause))
5917 if (Nkind (gnat_with_clause) == N_With_Clause
5918 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5919 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5921 elaborate_all_entities (Library_Unit (gnat_with_clause));
5923 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5925 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5926 Present (gnat_entity);
5927 gnat_entity = Next_Entity (gnat_entity))
5928 if (Is_Public (gnat_entity)
5929 && Convention (gnat_entity) != Convention_Intrinsic
5930 && Ekind (gnat_entity) != E_Package
5931 && Ekind (gnat_entity) != E_Package_Body
5932 && Ekind (gnat_entity) != E_Operator
5933 && !(IN (Ekind (gnat_entity), Type_Kind)
5934 && !Is_Frozen (gnat_entity))
5935 && !((Ekind (gnat_entity) == E_Procedure
5936 || Ekind (gnat_entity) == E_Function)
5937 && Is_Intrinsic_Subprogram (gnat_entity))
5938 && !IN (Ekind (gnat_entity), Named_Kind)
5939 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5940 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5942 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5945 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5947 /* Retrieve compilation unit node of generic body. */
5948 while (Present (gnat_body)
5949 && Nkind (gnat_body) != N_Compilation_Unit)
5950 gnat_body = Parent (gnat_body);
5952 /* If body is available, elaborate its context. */
5953 if (Present (gnat_body))
5954 elaborate_all_entities (gnat_body);
5958 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5959 elaborate_all_entities (Library_Unit (gnat_node));
5962 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5965 process_freeze_entity (Node_Id gnat_node)
5967 Entity_Id gnat_entity = Entity (gnat_node);
5971 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
5972 && present_gnu_tree (Declaration_Node (gnat_entity)))
5973 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
5975 /* If this is a package, need to generate code for the package. */
5976 if (Ekind (gnat_entity) == E_Package)
5979 (Parent (Corresponding_Body
5980 (Parent (Declaration_Node (gnat_entity)))));
5984 /* Check for old definition after the above call. This Freeze_Node
5985 might be for one its Itypes. */
5987 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
5989 /* If this entity has an Address representation clause, GNU_OLD is the
5990 address, so discard it here. */
5991 if (Present (Address_Clause (gnat_entity)))
5994 /* Don't do anything for class-wide types they are always
5995 transformed into their root type. */
5996 if (Ekind (gnat_entity) == E_Class_Wide_Type
5997 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
5998 && Present (Equivalent_Type (gnat_entity))))
6001 /* Don't do anything for subprograms that may have been elaborated before
6002 their freeze nodes. This can happen, for example because of an inner call
6003 in an instance body, or a previous compilation of a spec for inlining
6006 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6007 && (Ekind (gnat_entity) == E_Function
6008 || Ekind (gnat_entity) == E_Procedure))
6010 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6011 && Ekind (gnat_entity) == E_Subprogram_Type)))
6014 /* If we have a non-dummy type old tree, we have nothing to do, except
6015 aborting if this is the public view of a private type whose full view was
6016 not delayed, as this node was never delayed as it should have been. We
6017 let this happen for concurrent types and their Corresponding_Record_Type,
6018 however, because each might legitimately be elaborated before it's own
6019 freeze node, e.g. while processing the other. */
6021 && !(TREE_CODE (gnu_old) == TYPE_DECL
6022 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6024 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6025 && Present (Full_View (gnat_entity))
6026 && No (Freeze_Node (Full_View (gnat_entity))))
6027 || Is_Concurrent_Type (gnat_entity)
6028 || (IN (Ekind (gnat_entity), Record_Kind)
6029 && Is_Concurrent_Record_Type (gnat_entity)));
6033 /* Reset the saved tree, if any, and elaborate the object or type for real.
6034 If there is a full declaration, elaborate it and copy the type to
6035 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6036 a class wide type or subtype. */
6039 save_gnu_tree (gnat_entity, NULL_TREE, false);
6040 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6041 && Present (Full_View (gnat_entity))
6042 && present_gnu_tree (Full_View (gnat_entity)))
6043 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6044 if (Present (Class_Wide_Type (gnat_entity))
6045 && Class_Wide_Type (gnat_entity) != gnat_entity)
6046 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6049 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6050 && Present (Full_View (gnat_entity)))
6052 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6054 /* Propagate back-annotations from full view to partial view. */
6055 if (Unknown_Alignment (gnat_entity))
6056 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6058 if (Unknown_Esize (gnat_entity))
6059 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6061 if (Unknown_RM_Size (gnat_entity))
6062 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6064 /* The above call may have defined this entity (the simplest example
6065 of this is when we have a private enumeral type since the bounds
6066 will have the public view. */
6067 if (!present_gnu_tree (gnat_entity))
6068 save_gnu_tree (gnat_entity, gnu_new, false);
6069 if (Present (Class_Wide_Type (gnat_entity))
6070 && Class_Wide_Type (gnat_entity) != gnat_entity)
6071 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6074 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6076 /* If we've made any pointers to the old version of this type, we
6077 have to update them. */
6079 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6080 TREE_TYPE (gnu_new));
6083 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6084 N_Compilation_Unit. */
6087 process_inlined_subprograms (Node_Id gnat_node)
6089 Entity_Id gnat_entity;
6092 /* If we can inline, generate Gimple for all the inlined subprograms.
6093 Define the entity first so we set DECL_EXTERNAL. */
6095 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6096 Present (gnat_entity);
6097 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6099 gnat_body = Parent (Declaration_Node (gnat_entity));
6101 if (Nkind (gnat_body) != N_Subprogram_Body)
6103 /* ??? This really should always be Present. */
6104 if (No (Corresponding_Body (gnat_body)))
6108 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6111 if (Present (gnat_body))
6113 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6114 add_stmt (gnat_to_gnu (gnat_body));
6119 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6120 We make two passes, one to elaborate anything other than bodies (but
6121 we declare a function if there was no spec). The second pass
6122 elaborates the bodies.
6124 GNAT_END_LIST gives the element in the list past the end. Normally,
6125 this is Empty, but can be First_Real_Statement for a
6126 Handled_Sequence_Of_Statements.
6128 We make a complete pass through both lists if PASS1P is true, then make
6129 the second pass over both lists if PASS2P is true. The lists usually
6130 correspond to the public and private parts of a package. */
6133 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6134 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6136 List_Id gnat_decl_array[2];
6140 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6143 for (i = 0; i <= 1; i++)
6144 if (Present (gnat_decl_array[i]))
6145 for (gnat_decl = First (gnat_decl_array[i]);
6146 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6148 /* For package specs, we recurse inside the declarations,
6149 thus taking the two pass approach inside the boundary. */
6150 if (Nkind (gnat_decl) == N_Package_Declaration
6151 && (Nkind (Specification (gnat_decl)
6152 == N_Package_Specification)))
6153 process_decls (Visible_Declarations (Specification (gnat_decl)),
6154 Private_Declarations (Specification (gnat_decl)),
6155 Empty, true, false);
6157 /* Similarly for any declarations in the actions of a
6159 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6161 process_freeze_entity (gnat_decl);
6162 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6165 /* Package bodies with freeze nodes get their elaboration deferred
6166 until the freeze node, but the code must be placed in the right
6167 place, so record the code position now. */
6168 else if (Nkind (gnat_decl) == N_Package_Body
6169 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6170 record_code_position (gnat_decl);
6172 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6173 && Present (Library_Unit (gnat_decl))
6174 && Present (Freeze_Node
6177 (Library_Unit (gnat_decl)))))))
6178 record_code_position
6179 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6181 /* We defer most subprogram bodies to the second pass. */
6182 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6184 if (Acts_As_Spec (gnat_decl))
6186 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6188 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6189 && Ekind (gnat_subprog_id) != E_Generic_Function)
6190 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6194 /* For bodies and stubs that act as their own specs, the entity
6195 itself must be elaborated in the first pass, because it may
6196 be used in other declarations. */
6197 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6199 Node_Id gnat_subprog_id
6200 = Defining_Entity (Specification (gnat_decl));
6202 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6203 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6204 && Ekind (gnat_subprog_id) != E_Generic_Function)
6205 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6208 /* Concurrent stubs stand for the corresponding subprogram bodies,
6209 which are deferred like other bodies. */
6210 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6211 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6215 add_stmt (gnat_to_gnu (gnat_decl));
6218 /* Here we elaborate everything we deferred above except for package bodies,
6219 which are elaborated at their freeze nodes. Note that we must also
6220 go inside things (package specs and freeze nodes) the first pass did. */
6222 for (i = 0; i <= 1; i++)
6223 if (Present (gnat_decl_array[i]))
6224 for (gnat_decl = First (gnat_decl_array[i]);
6225 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6227 if (Nkind (gnat_decl) == N_Subprogram_Body
6228 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6229 || Nkind (gnat_decl) == N_Task_Body_Stub
6230 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6231 add_stmt (gnat_to_gnu (gnat_decl));
6233 else if (Nkind (gnat_decl) == N_Package_Declaration
6234 && (Nkind (Specification (gnat_decl)
6235 == N_Package_Specification)))
6236 process_decls (Visible_Declarations (Specification (gnat_decl)),
6237 Private_Declarations (Specification (gnat_decl)),
6238 Empty, false, true);
6240 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6241 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6245 /* Make a unary operation of kind CODE using build_unary_op, but guard
6246 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6247 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6248 the operation is to be performed in that type. GNAT_NODE is the gnat
6249 node conveying the source location for which the error should be
6253 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6256 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6258 operand = protect_multiple_eval (operand);
6260 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6261 operand, TYPE_MIN_VALUE (gnu_type)),
6262 build_unary_op (code, gnu_type, operand),
6263 CE_Overflow_Check_Failed, gnat_node);
6266 /* Make a binary operation of kind CODE using build_binary_op, but guard
6267 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6268 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6269 Usually the operation is to be performed in that type. GNAT_NODE is
6270 the GNAT node conveying the source location for which the error should
6274 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6275 tree right, Node_Id gnat_node)
6277 tree lhs = protect_multiple_eval (left);
6278 tree rhs = protect_multiple_eval (right);
6279 tree type_max = TYPE_MAX_VALUE (gnu_type);
6280 tree type_min = TYPE_MIN_VALUE (gnu_type);
6283 tree zero = convert (gnu_type, integer_zero_node);
6288 int precision = TYPE_PRECISION (gnu_type);
6290 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6292 /* Prefer a constant or known-positive rhs to simplify checks. */
6293 if (!TREE_CONSTANT (rhs)
6294 && commutative_tree_code (code)
6295 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6296 && tree_expr_nonnegative_p (lhs))))
6303 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6305 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6307 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6309 /* Try a few strategies that may be cheaper than the general
6310 code at the end of the function, if the rhs is not known.
6312 - Call library function for 64-bit multiplication (complex)
6313 - Widen, if input arguments are sufficiently small
6314 - Determine overflow using wrapped result for addition/subtraction. */
6316 if (!TREE_CONSTANT (rhs))
6318 /* Even for add/subtract double size to get another base type. */
6319 int needed_precision = precision * 2;
6321 if (code == MULT_EXPR && precision == 64)
6323 tree int_64 = gnat_type_for_size (64, 0);
6325 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6326 convert (int_64, lhs),
6327 convert (int_64, rhs)));
6330 else if (needed_precision <= BITS_PER_WORD
6331 || (code == MULT_EXPR
6332 && needed_precision <= LONG_LONG_TYPE_SIZE))
6334 tree wide_type = gnat_type_for_size (needed_precision, 0);
6336 tree wide_result = build_binary_op (code, wide_type,
6337 convert (wide_type, lhs),
6338 convert (wide_type, rhs));
6340 tree check = build_binary_op
6341 (TRUTH_ORIF_EXPR, integer_type_node,
6342 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6343 convert (wide_type, type_min)),
6344 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6345 convert (wide_type, type_max)));
6347 tree result = convert (gnu_type, wide_result);
6350 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6353 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6355 tree unsigned_type = gnat_type_for_size (precision, 1);
6356 tree wrapped_expr = convert
6357 (gnu_type, build_binary_op (code, unsigned_type,
6358 convert (unsigned_type, lhs),
6359 convert (unsigned_type, rhs)));
6361 tree result = convert
6362 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6364 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6365 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6366 tree check = build_binary_op
6367 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6368 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6369 integer_type_node, wrapped_expr, lhs));
6372 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6379 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6380 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6381 build_binary_op (MINUS_EXPR, gnu_type,
6384 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6385 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6386 build_binary_op (MINUS_EXPR, gnu_type,
6391 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6392 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6393 build_binary_op (PLUS_EXPR, gnu_type,
6396 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6397 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6398 build_binary_op (PLUS_EXPR, gnu_type,
6403 /* The check here is designed to be efficient if the rhs is constant,
6404 but it will work for any rhs by using integer division.
6405 Four different check expressions determine wether X * C overflows,
6408 C > 0 => X > type_max / C || X < type_min / C
6409 C == -1 => X == type_min
6410 C < -1 => X > type_min / C || X < type_max / C */
6412 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6413 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6415 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6416 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6417 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6418 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6419 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6421 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6422 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6423 build_int_cst (gnu_type, -1)),
6424 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6425 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6426 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6427 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6434 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6436 /* If we can fold the expression to a constant, just return it.
6437 The caller will deal with overflow, no need to generate a check. */
6438 if (TREE_CONSTANT (gnu_expr))
6441 check = fold_build3 (COND_EXPR, integer_type_node,
6442 rhs_lt_zero, check_neg, check_pos);
6444 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6447 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6448 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6449 which we have to check. GNAT_NODE is the GNAT node conveying the source
6450 location for which the error should be signaled. */
6453 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6455 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6456 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6457 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6458 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6460 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6461 This can for example happen when translating 'Val or 'Value. */
6462 if (gnu_compare_type == gnu_range_type)
6465 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6466 we can't do anything since we might be truncating the bounds. No
6467 check is needed in this case. */
6468 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6469 && (TYPE_PRECISION (gnu_compare_type)
6470 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6473 /* Checked expressions must be evaluated only once. */
6474 gnu_expr = protect_multiple_eval (gnu_expr);
6476 /* There's no good type to use here, so we might as well use
6477 integer_type_node. Note that the form of the check is
6478 (not (expr >= lo)) or (not (expr <= hi))
6479 the reason for this slightly convoluted form is that NaNs
6480 are not considered to be in range in the float case. */
6482 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6484 (build_binary_op (GE_EXPR, integer_type_node,
6485 convert (gnu_compare_type, gnu_expr),
6486 convert (gnu_compare_type, gnu_low))),
6488 (build_binary_op (LE_EXPR, integer_type_node,
6489 convert (gnu_compare_type, gnu_expr),
6490 convert (gnu_compare_type,
6492 gnu_expr, CE_Range_Check_Failed, gnat_node);
6495 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6496 we are about to index, GNU_EXPR is the index expression to be checked,
6497 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6498 has to be checked. Note that for index checking we cannot simply use the
6499 emit_range_check function (although very similar code needs to be generated
6500 in both cases) since for index checking the array type against which we are
6501 checking the indices may be unconstrained and consequently we need to get
6502 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6503 The place where we need to do that is in subprograms having unconstrained
6504 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6505 location for which the error should be signaled. */
6508 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6509 tree gnu_high, Node_Id gnat_node)
6511 tree gnu_expr_check;
6513 /* Checked expressions must be evaluated only once. */
6514 gnu_expr = protect_multiple_eval (gnu_expr);
6516 /* Must do this computation in the base type in case the expression's
6517 type is an unsigned subtypes. */
6518 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6520 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6521 the object we are handling. */
6522 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6523 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6525 /* There's no good type to use here, so we might as well use
6526 integer_type_node. */
6528 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6529 build_binary_op (LT_EXPR, integer_type_node,
6531 convert (TREE_TYPE (gnu_expr_check),
6533 build_binary_op (GT_EXPR, integer_type_node,
6535 convert (TREE_TYPE (gnu_expr_check),
6537 gnu_expr, CE_Index_Check_Failed, gnat_node);
6540 /* GNU_COND contains the condition corresponding to an access, discriminant or
6541 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6542 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6543 REASON is the code that says why the exception was raised. GNAT_NODE is
6544 the GNAT node conveying the source location for which the error should be
6548 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6551 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6553 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6554 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6555 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6558 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6559 we don't need to evaluate it just for the check. */
6560 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6562 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6563 we will repeatedly do the test and, at compile time, we will repeatedly
6564 visit it during unsharing, which leads to an exponential explosion. */
6565 return save_expr (gnu_result);
6568 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6569 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6570 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6571 float to integer conversion with truncation; otherwise round.
6572 GNAT_NODE is the GNAT node conveying the source location for which the
6573 error should be signaled. */
6576 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6577 bool rangep, bool truncatep, Node_Id gnat_node)
6579 tree gnu_type = get_unpadded_type (gnat_type);
6580 tree gnu_in_type = TREE_TYPE (gnu_expr);
6581 tree gnu_in_basetype = get_base_type (gnu_in_type);
6582 tree gnu_base_type = get_base_type (gnu_type);
6583 tree gnu_result = gnu_expr;
6585 /* If we are not doing any checks, the output is an integral type, and
6586 the input is not a floating type, just do the conversion. This
6587 shortcut is required to avoid problems with packed array types
6588 and simplifies code in all cases anyway. */
6589 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6590 && !FLOAT_TYPE_P (gnu_in_type))
6591 return convert (gnu_type, gnu_expr);
6593 /* First convert the expression to its base type. This
6594 will never generate code, but makes the tests below much simpler.
6595 But don't do this if converting from an integer type to an unconstrained
6596 array type since then we need to get the bounds from the original
6598 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6599 gnu_result = convert (gnu_in_basetype, gnu_result);
6601 /* If overflow checks are requested, we need to be sure the result will
6602 fit in the output base type. But don't do this if the input
6603 is integer and the output floating-point. */
6605 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6607 /* Ensure GNU_EXPR only gets evaluated once. */
6608 tree gnu_input = protect_multiple_eval (gnu_result);
6609 tree gnu_cond = integer_zero_node;
6610 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6611 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6612 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6613 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6615 /* Convert the lower bounds to signed types, so we're sure we're
6616 comparing them properly. Likewise, convert the upper bounds
6617 to unsigned types. */
6618 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6619 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6621 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6622 && !TYPE_UNSIGNED (gnu_in_basetype))
6623 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6625 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6626 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6628 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6629 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6631 /* Check each bound separately and only if the result bound
6632 is tighter than the bound on the input type. Note that all the
6633 types are base types, so the bounds must be constant. Also,
6634 the comparison is done in the base type of the input, which
6635 always has the proper signedness. First check for input
6636 integer (which means output integer), output float (which means
6637 both float), or mixed, in which case we always compare.
6638 Note that we have to do the comparison which would *fail* in the
6639 case of an error since if it's an FP comparison and one of the
6640 values is a NaN or Inf, the comparison will fail. */
6641 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6642 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6643 : (FLOAT_TYPE_P (gnu_base_type)
6644 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6645 TREE_REAL_CST (gnu_out_lb))
6649 (build_binary_op (GE_EXPR, integer_type_node,
6650 gnu_input, convert (gnu_in_basetype,
6653 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6654 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6655 : (FLOAT_TYPE_P (gnu_base_type)
6656 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6657 TREE_REAL_CST (gnu_in_lb))
6660 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6662 (build_binary_op (LE_EXPR, integer_type_node,
6664 convert (gnu_in_basetype,
6667 if (!integer_zerop (gnu_cond))
6668 gnu_result = emit_check (gnu_cond, gnu_input,
6669 CE_Overflow_Check_Failed, gnat_node);
6672 /* Now convert to the result base type. If this is a non-truncating
6673 float-to-integer conversion, round. */
6674 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6677 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6678 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6679 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6680 const struct real_format *fmt;
6682 /* The following calculations depend on proper rounding to even
6683 of each arithmetic operation. In order to prevent excess
6684 precision from spoiling this property, use the widest hardware
6685 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6687 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6689 /* FIXME: Should not have padding in the first place. */
6690 if (TREE_CODE (calc_type) == RECORD_TYPE
6691 && TYPE_IS_PADDING_P (calc_type))
6692 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6694 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6695 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6696 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6697 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6698 half_minus_pred_half);
6699 gnu_pred_half = build_real (calc_type, pred_half);
6701 /* If the input is strictly negative, subtract this value
6702 and otherwise add it from the input. For 0.5, the result
6703 is exactly between 1.0 and the machine number preceding 1.0
6704 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6705 will round to 1.0, while all other number with an absolute
6706 value less than 0.5 round to 0.0. For larger numbers exactly
6707 halfway between integers, rounding will always be correct as
6708 the true mathematical result will be closer to the higher
6709 integer compared to the lower one. So, this constant works
6710 for all floating-point numbers.
6712 The reason to use the same constant with subtract/add instead
6713 of a positive and negative constant is to allow the comparison
6714 to be scheduled in parallel with retrieval of the constant and
6715 conversion of the input to the calc_type (if necessary). */
6717 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6718 gnu_saved_result = save_expr (gnu_result);
6719 gnu_conv = convert (calc_type, gnu_saved_result);
6720 gnu_comp = build2 (GE_EXPR, integer_type_node,
6721 gnu_saved_result, gnu_zero);
6723 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6724 gnu_subtract_pred_half
6725 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6726 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6727 gnu_add_pred_half, gnu_subtract_pred_half);
6730 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6731 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6732 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6733 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6735 gnu_result = convert (gnu_base_type, gnu_result);
6737 /* Finally, do the range check if requested. Note that if the
6738 result type is a modular type, the range check is actually
6739 an overflow check. */
6742 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6743 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6744 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6746 return convert (gnu_type, gnu_result);
6749 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6752 smaller_packable_type_p (tree type, tree record_type)
6756 /* We're not interested in variants here. */
6757 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6760 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6761 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6764 size = TYPE_SIZE (type);
6765 rsize = TYPE_SIZE (record_type);
6767 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6770 return tree_int_cst_lt (size, rsize) != 0;
6773 /* Return true if GNU_EXPR can be directly addressed. This is the case
6774 unless it is an expression involving computation or if it involves a
6775 reference to a bitfield or to an object not sufficiently aligned for
6776 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6777 be directly addressed as an object of this type.
6779 *** Notes on addressability issues in the Ada compiler ***
6781 This predicate is necessary in order to bridge the gap between Gigi
6782 and the middle-end about addressability of GENERIC trees. A tree
6783 is said to be addressable if it can be directly addressed, i.e. if
6784 its address can be taken, is a multiple of the type's alignment on
6785 strict-alignment architectures and returns the first storage unit
6786 assigned to the object represented by the tree.
6788 In the C family of languages, everything is in practice addressable
6789 at the language level, except for bit-fields. This means that these
6790 compilers will take the address of any tree that doesn't represent
6791 a bit-field reference and expect the result to be the first storage
6792 unit assigned to the object. Even in cases where this will result
6793 in unaligned accesses at run time, nothing is supposed to be done
6794 and the program is considered as erroneous instead (see PR c/18287).
6796 The implicit assumptions made in the middle-end are in keeping with
6797 the C viewpoint described above:
6798 - the address of a bit-field reference is supposed to be never
6799 taken; the compiler (generally) will stop on such a construct,
6800 - any other tree is addressable if it is formally addressable,
6801 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6803 In Ada, the viewpoint is the opposite one: nothing is addressable
6804 at the language level unless explicitly declared so. This means
6805 that the compiler will both make sure that the trees representing
6806 references to addressable ("aliased" in Ada parlance) objects are
6807 addressable and make no real attempts at ensuring that the trees
6808 representing references to non-addressable objects are addressable.
6810 In the first case, Ada is effectively equivalent to C and handing
6811 down the direct result of applying ADDR_EXPR to these trees to the
6812 middle-end works flawlessly. In the second case, Ada cannot afford
6813 to consider the program as erroneous if the address of trees that
6814 are not addressable is requested for technical reasons, unlike C;
6815 as a consequence, the Ada compiler must arrange for either making
6816 sure that this address is not requested in the middle-end or for
6817 compensating by inserting temporaries if it is requested in Gigi.
6819 The first goal can be achieved because the middle-end should not
6820 request the address of non-addressable trees on its own; the only
6821 exception is for the invocation of low-level block operations like
6822 memcpy, for which the addressability requirements are lower since
6823 the type's alignment can be disregarded. In practice, this means
6824 that Gigi must make sure that such operations cannot be applied to
6825 non-BLKmode bit-fields.
6827 The second goal is achieved by means of the addressable_p predicate
6828 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6829 They will be turned during gimplification into proper temporaries
6830 whose address will be used in lieu of that of the original tree. */
6833 addressable_p (tree gnu_expr, tree gnu_type)
6835 /* The size of the real type of the object must not be smaller than
6836 that of the expected type, otherwise an indirect access in the
6837 latter type would be larger than the object. Only records need
6838 to be considered in practice. */
6840 && TREE_CODE (gnu_type) == RECORD_TYPE
6841 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6844 switch (TREE_CODE (gnu_expr))
6850 /* All DECLs are addressable: if they are in a register, we can force
6854 case UNCONSTRAINED_ARRAY_REF:
6865 /* We accept &COND_EXPR as soon as both operands are addressable and
6866 expect the outcome to be the address of the selected operand. */
6867 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6868 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6871 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6872 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6873 the field is sufficiently aligned, in case it is subject
6874 to a pragma Component_Alignment. But we don't need to
6875 check the alignment of the containing record, as it is
6876 guaranteed to be not smaller than that of its most
6877 aligned field that is not a bit-field. */
6878 && (!STRICT_ALIGNMENT
6879 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6880 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6881 /* The field of a padding record is always addressable. */
6882 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6883 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6885 case ARRAY_REF: case ARRAY_RANGE_REF:
6886 case REALPART_EXPR: case IMAGPART_EXPR:
6888 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6891 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6892 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6894 case VIEW_CONVERT_EXPR:
6896 /* This is addressable if we can avoid a copy. */
6897 tree type = TREE_TYPE (gnu_expr);
6898 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6899 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6900 && (!STRICT_ALIGNMENT
6901 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6902 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6903 || ((TYPE_MODE (type) == BLKmode
6904 || TYPE_MODE (inner_type) == BLKmode)
6905 && (!STRICT_ALIGNMENT
6906 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6907 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6908 || TYPE_ALIGN_OK (type)
6909 || TYPE_ALIGN_OK (inner_type))))
6910 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6918 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6919 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6920 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6923 process_type (Entity_Id gnat_entity)
6926 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6929 /* If we are to delay elaboration of this type, just do any
6930 elaborations needed for expressions within the declaration and
6931 make a dummy type entry for this node and its Full_View (if
6932 any) in case something points to it. Don't do this if it
6933 has already been done (the only way that can happen is if
6934 the private completion is also delayed). */
6935 if (Present (Freeze_Node (gnat_entity))
6936 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6937 && Present (Full_View (gnat_entity))
6938 && Freeze_Node (Full_View (gnat_entity))
6939 && !present_gnu_tree (Full_View (gnat_entity))))
6941 elaborate_entity (gnat_entity);
6945 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6946 save_gnu_tree (gnat_entity, gnu_decl, false);
6947 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6948 && Present (Full_View (gnat_entity)))
6949 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6955 /* If we saved away a dummy type for this node it means that this
6956 made the type that corresponds to the full type of an incomplete
6957 type. Clear that type for now and then update the type in the
6961 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6962 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6964 save_gnu_tree (gnat_entity, NULL_TREE, false);
6967 /* Now fully elaborate the type. */
6968 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
6969 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
6971 /* If we have an old type and we've made pointers to this type,
6972 update those pointers. */
6974 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6975 TREE_TYPE (gnu_new));
6977 /* If this is a record type corresponding to a task or protected type
6978 that is a completion of an incomplete type, perform a similar update
6979 on the type. ??? Including protected types here is a guess. */
6980 if (IN (Ekind (gnat_entity), Record_Kind)
6981 && Is_Concurrent_Record_Type (gnat_entity)
6982 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
6985 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
6987 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6989 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6992 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
6993 TREE_TYPE (gnu_new));
6997 /* GNAT_ENTITY is the type of the resulting constructors,
6998 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
6999 and GNU_TYPE is the GCC type of the corresponding record.
7001 Return a CONSTRUCTOR to build the record. */
7004 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7006 tree gnu_list, gnu_result;
7008 /* We test for GNU_FIELD being empty in the case where a variant
7009 was the last thing since we don't take things off GNAT_ASSOC in
7010 that case. We check GNAT_ASSOC in case we have a variant, but it
7013 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7014 gnat_assoc = Next (gnat_assoc))
7016 Node_Id gnat_field = First (Choices (gnat_assoc));
7017 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7018 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7020 /* The expander is supposed to put a single component selector name
7021 in every record component association. */
7022 gcc_assert (No (Next (gnat_field)));
7024 /* Ignore fields that have Corresponding_Discriminants since we'll
7025 be setting that field in the parent. */
7026 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7027 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7030 /* Also ignore discriminants of Unchecked_Unions. */
7031 else if (Is_Unchecked_Union (gnat_entity)
7032 && Ekind (Entity (gnat_field)) == E_Discriminant)
7035 /* Before assigning a value in an aggregate make sure range checks
7036 are done if required. Then convert to the type of the field. */
7037 if (Do_Range_Check (Expression (gnat_assoc)))
7038 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7040 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7042 /* Add the field and expression to the list. */
7043 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7046 gnu_result = extract_values (gnu_list, gnu_type);
7048 #ifdef ENABLE_CHECKING
7052 /* Verify every entry in GNU_LIST was used. */
7053 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7054 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7061 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7062 the first element of an array aggregate. It may itself be an aggregate.
7063 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7064 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7065 for range checking. */
7068 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7069 Entity_Id gnat_component_type)
7071 tree gnu_expr_list = NULL_TREE;
7072 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7075 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7077 /* If the expression is itself an array aggregate then first build the
7078 innermost constructor if it is part of our array (multi-dimensional
7080 if (Nkind (gnat_expr) == N_Aggregate
7081 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7082 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7083 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7084 TREE_TYPE (gnu_array_type),
7085 gnat_component_type);
7088 gnu_expr = gnat_to_gnu (gnat_expr);
7090 /* Before assigning the element to the array, make sure it is
7092 if (Do_Range_Check (gnat_expr))
7093 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7097 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7100 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7103 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7106 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7107 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7108 of the associations that are from RECORD_TYPE. If we see an internal
7109 record, make a recursive call to fill it in as well. */
7112 extract_values (tree values, tree record_type)
7114 tree result = NULL_TREE;
7117 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7121 /* _Parent is an internal field, but may have values in the aggregate,
7122 so check for values first. */
7123 if ((tem = purpose_member (field, values)))
7125 value = TREE_VALUE (tem);
7126 TREE_ADDRESSABLE (tem) = 1;
7129 else if (DECL_INTERNAL_P (field))
7131 value = extract_values (values, TREE_TYPE (field));
7132 if (TREE_CODE (value) == CONSTRUCTOR
7133 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7137 /* If we have a record subtype, the names will match, but not the
7138 actual FIELD_DECLs. */
7139 for (tem = values; tem; tem = TREE_CHAIN (tem))
7140 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7142 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7143 TREE_ADDRESSABLE (tem) = 1;
7149 result = tree_cons (field, value, result);
7152 return gnat_build_constructor (record_type, nreverse (result));
7155 /* EXP is to be treated as an array or record. Handle the cases when it is
7156 an access object and perform the required dereferences. */
7159 maybe_implicit_deref (tree exp)
7161 /* If the type is a pointer, dereference it. */
7163 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7164 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7166 /* If we got a padded type, remove it too. */
7167 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7168 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7169 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7174 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7177 protect_multiple_eval (tree exp)
7179 tree type = TREE_TYPE (exp);
7181 /* If this has no side effects, we don't need to do anything. */
7182 if (!TREE_SIDE_EFFECTS (exp))
7185 /* If it is a conversion, protect what's inside the conversion.
7186 Similarly, if we're indirectly referencing something, we only
7187 actually need to protect the address since the data itself can't
7188 change in these situations. */
7189 else if (TREE_CODE (exp) == NON_LVALUE_EXPR
7190 || CONVERT_EXPR_P (exp)
7191 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7192 || TREE_CODE (exp) == INDIRECT_REF
7193 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7194 return build1 (TREE_CODE (exp), type,
7195 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7197 /* If EXP is a fat pointer or something that can be placed into a register,
7198 just make a SAVE_EXPR. */
7199 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7200 return save_expr (exp);
7202 /* Otherwise, dereference, protect the address, and re-reference. */
7205 build_unary_op (INDIRECT_REF, type,
7206 save_expr (build_unary_op (ADDR_EXPR,
7207 build_reference_type (type),
7211 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7212 handle our own nodes and we take extra arguments. FORCE says whether to
7213 force evaluation of everything. We set SUCCESS to true unless we walk
7214 through something we don't know how to stabilize. */
7217 maybe_stabilize_reference (tree ref, bool force, bool *success)
7219 tree type = TREE_TYPE (ref);
7220 enum tree_code code = TREE_CODE (ref);
7223 /* Assume we'll success unless proven otherwise. */
7232 /* No action is needed in this case. */
7238 case FIX_TRUNC_EXPR:
7239 case VIEW_CONVERT_EXPR:
7241 = build1 (code, type,
7242 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7247 case UNCONSTRAINED_ARRAY_REF:
7248 result = build1 (code, type,
7249 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7254 result = build3 (COMPONENT_REF, type,
7255 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7257 TREE_OPERAND (ref, 1), NULL_TREE);
7261 result = build3 (BIT_FIELD_REF, type,
7262 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7264 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7266 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7271 case ARRAY_RANGE_REF:
7272 result = build4 (code, type,
7273 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7275 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7277 NULL_TREE, NULL_TREE);
7281 result = gnat_stabilize_reference_1 (ref, force);
7285 /* This generates better code than the scheme in protect_multiple_eval
7286 because large objects will be returned via invisible reference in
7287 most ABIs so the temporary will directly be filled by the callee. */
7288 result = gnat_stabilize_reference_1 (ref, force);
7292 /* Constructors with 1 element are used extensively to formally
7293 convert objects to special wrapping types. */
7294 if (TREE_CODE (type) == RECORD_TYPE
7295 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7298 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7300 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7302 = build_constructor_single (type, index,
7303 gnat_stabilize_reference_1 (value,
7314 ref = error_mark_node;
7316 /* ... fall through to failure ... */
7318 /* If arg isn't a kind of lvalue we recognize, make no change.
7319 Caller should recognize the error for an invalid lvalue. */
7325 TREE_READONLY (result) = TREE_READONLY (ref);
7327 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7328 expression may not be sustained across some paths, such as the way via
7329 build1 for INDIRECT_REF. We re-populate those flags here for the general
7330 case, which is consistent with the GCC version of this routine.
7332 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7333 paths introduce side effects where there was none initially (e.g. calls
7334 to save_expr), and we also want to keep track of that. */
7336 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7337 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7342 /* Wrapper around maybe_stabilize_reference, for common uses without
7343 lvalue restrictions and without need to examine the success
7347 gnat_stabilize_reference (tree ref, bool force)
7350 return maybe_stabilize_reference (ref, force, &dummy);
7353 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7354 arg to force a SAVE_EXPR for everything. */
7357 gnat_stabilize_reference_1 (tree e, bool force)
7359 enum tree_code code = TREE_CODE (e);
7360 tree type = TREE_TYPE (e);
7363 /* We cannot ignore const expressions because it might be a reference
7364 to a const array but whose index contains side-effects. But we can
7365 ignore things that are actual constant or that already have been
7366 handled by this function. */
7368 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7371 switch (TREE_CODE_CLASS (code))
7373 case tcc_exceptional:
7375 case tcc_declaration:
7376 case tcc_comparison:
7378 case tcc_expression:
7381 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7382 fat pointer. This may be more efficient, but will also allow
7383 us to more easily find the match for the PLACEHOLDER_EXPR. */
7384 if (code == COMPONENT_REF
7385 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7386 result = build3 (COMPONENT_REF, type,
7387 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7389 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7390 else if (TREE_SIDE_EFFECTS (e) || force)
7391 return save_expr (e);
7397 /* Constants need no processing. In fact, we should never reach
7402 /* Recursively stabilize each operand. */
7403 result = build2 (code, type,
7404 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7405 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7410 /* Recursively stabilize each operand. */
7411 result = build1 (code, type,
7412 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7420 TREE_READONLY (result) = TREE_READONLY (e);
7422 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7423 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7427 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7428 location and false if it doesn't. In the former case, set the Gigi global
7429 variable REF_FILENAME to the simple debug file name as given by sinput. */
7432 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7434 if (Sloc == No_Location)
7437 if (Sloc <= Standard_Location)
7439 *locus = BUILTINS_LOCATION;
7444 Source_File_Index file = Get_Source_File_Index (Sloc);
7445 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7446 Column_Number column = Get_Column_Number (Sloc);
7447 struct line_map *map = &line_table->maps[file - 1];
7449 /* Translate the location according to the line-map.h formula. */
7450 *locus = map->start_location
7451 + ((line - map->to_line) << map->column_bits)
7452 + (column & ((1 << map->column_bits) - 1));
7456 = IDENTIFIER_POINTER
7458 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7463 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7464 don't do anything if it doesn't correspond to a source location. */
7467 set_expr_location_from_node (tree node, Node_Id gnat_node)
7471 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7474 SET_EXPR_LOCATION (node, locus);
7477 /* Return a colon-separated list of encodings contained in encoded Ada
7481 extract_encoding (const char *name)
7483 char *encoding = GGC_NEWVEC (char, strlen (name));
7484 get_encoding (name, encoding);
7488 /* Extract the Ada name from an encoded name. */
7491 decode_name (const char *name)
7493 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7494 __gnat_decode (name, decoded, 0);
7498 /* Post an error message. MSG is the error message, properly annotated.
7499 NODE is the node at which to post the error and the node to use for the
7500 "&" substitution. */
7503 post_error (const char *msg, Node_Id node)
7505 String_Template temp;
7508 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7509 fp.Array = msg, fp.Bounds = &temp;
7511 Error_Msg_N (fp, node);
7514 /* Similar, but NODE is the node at which to post the error and ENT
7515 is the node to use for the "&" substitution. */
7518 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7520 String_Template temp;
7523 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7524 fp.Array = msg, fp.Bounds = &temp;
7526 Error_Msg_NE (fp, node, ent);
7529 /* Similar, but NODE is the node at which to post the error, ENT is the node
7530 to use for the "&" substitution, and N is the number to use for the ^. */
7533 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7535 String_Template temp;
7538 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7539 fp.Array = msg, fp.Bounds = &temp;
7540 Error_Msg_Uint_1 = UI_From_Int (n);
7543 Error_Msg_NE (fp, node, ent);
7546 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7547 number to write. If the tree represents a constant that fits within
7548 a host integer, the text inside curly brackets in MSG will be output
7549 (presumably including a '^'). Otherwise that text will not be output
7550 and the text inside square brackets will be output instead. */
7553 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7555 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7556 String_Template temp = {1, 0};
7558 char start_yes, end_yes, start_no, end_no;
7562 fp.Array = newmsg, fp.Bounds = &temp;
7564 if (host_integerp (t, 1)
7565 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7568 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7572 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7573 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7576 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7578 for (p = msg, q = newmsg; *p; p++)
7580 if (*p == start_yes)
7581 for (p++; *p != end_yes; p++)
7583 else if (*p == start_no)
7584 for (p++; *p != end_no; p++)
7592 temp.High_Bound = strlen (newmsg);
7594 Error_Msg_NE (fp, node, ent);
7597 /* Similar to post_error_ne_tree, except that NUM is a second
7598 integer to write in the message. */
7601 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7604 Error_Msg_Uint_2 = UI_From_Int (num);
7605 post_error_ne_tree (msg, node, ent, t);
7608 /* Initialize the table that maps GNAT codes to GCC codes for simple
7609 binary and unary operations. */
7612 init_code_table (void)
7614 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7615 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7617 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7618 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7619 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7620 gnu_codes[N_Op_Eq] = EQ_EXPR;
7621 gnu_codes[N_Op_Ne] = NE_EXPR;
7622 gnu_codes[N_Op_Lt] = LT_EXPR;
7623 gnu_codes[N_Op_Le] = LE_EXPR;
7624 gnu_codes[N_Op_Gt] = GT_EXPR;
7625 gnu_codes[N_Op_Ge] = GE_EXPR;
7626 gnu_codes[N_Op_Add] = PLUS_EXPR;
7627 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7628 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7629 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7630 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7631 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7632 gnu_codes[N_Op_Abs] = ABS_EXPR;
7633 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7634 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7635 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7636 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7637 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7638 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7641 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7645 get_exception_label (char kind)
7647 if (kind == N_Raise_Constraint_Error)
7648 return TREE_VALUE (gnu_constraint_error_label_stack);
7649 else if (kind == N_Raise_Storage_Error)
7650 return TREE_VALUE (gnu_storage_error_label_stack);
7651 else if (kind == N_Raise_Program_Error)
7652 return TREE_VALUE (gnu_program_error_label_stack);
7657 #include "gt-ada-trans.h"