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);
2127 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2128 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2131 /* Do nothing if the establish builtin is not available, which might happen
2132 on targets where the facility is not implemented. */
2133 if (vms_builtin_establish_handler_decl == NULL_TREE)
2137 = build_call_1_expr (vms_builtin_establish_handler_decl,
2139 (ADDR_EXPR, NULL_TREE,
2140 gnat_vms_condition_handler_decl));
2142 add_stmt (establish_stmt);
2145 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2146 don't return anything. */
2149 Subprogram_Body_to_gnu (Node_Id gnat_node)
2151 /* Defining identifier of a parameter to the subprogram. */
2152 Entity_Id gnat_param;
2153 /* The defining identifier for the subprogram body. Note that if a
2154 specification has appeared before for this body, then the identifier
2155 occurring in that specification will also be a defining identifier and all
2156 the calls to this subprogram will point to that specification. */
2157 Entity_Id gnat_subprog_id
2158 = (Present (Corresponding_Spec (gnat_node))
2159 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2160 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2161 tree gnu_subprog_decl;
2162 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2163 tree gnu_subprog_type;
2166 VEC(parm_attr,gc) *cache;
2168 /* If this is a generic object or if it has been eliminated,
2170 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2171 || Ekind (gnat_subprog_id) == E_Generic_Function
2172 || Is_Eliminated (gnat_subprog_id))
2175 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2176 the already-elaborated tree node. However, if this subprogram had its
2177 elaboration deferred, we will already have made a tree node for it. So
2178 treat it as not being defined in that case. Such a subprogram cannot
2179 have an address clause or a freeze node, so this test is safe, though it
2180 does disable some otherwise-useful error checking. */
2182 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2183 Acts_As_Spec (gnat_node)
2184 && !present_gnu_tree (gnat_subprog_id));
2186 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2188 /* Propagate the debug mode. */
2189 if (!Needs_Debug_Info (gnat_subprog_id))
2190 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2192 /* Set the line number in the decl to correspond to that of the body so that
2193 the line number notes are written correctly. */
2194 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2196 /* Initialize the information structure for the function. */
2197 allocate_struct_function (gnu_subprog_decl, false);
2198 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2199 = GGC_CNEW (struct language_function);
2201 begin_subprog_body (gnu_subprog_decl);
2202 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2204 /* If there are Out parameters, we need to ensure that the return statement
2205 properly copies them out. We do this by making a new block and converting
2206 any inner return into a goto to a label at the end of the block. */
2207 push_stack (&gnu_return_label_stack, NULL_TREE,
2208 gnu_cico_list ? create_artificial_label () : NULL_TREE);
2210 /* Get a tree corresponding to the code for the subprogram. */
2211 start_stmt_group ();
2214 /* See if there are any parameters for which we don't yet have GCC entities.
2215 These must be for Out parameters for which we will be making VAR_DECL
2216 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2217 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2218 the order of the parameters. */
2219 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2220 Present (gnat_param);
2221 gnat_param = Next_Formal_With_Extras (gnat_param))
2222 if (!present_gnu_tree (gnat_param))
2224 /* Skip any entries that have been already filled in; they must
2225 correspond to In Out parameters. */
2226 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2227 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2230 /* Do any needed references for padded types. */
2231 TREE_VALUE (gnu_cico_list)
2232 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2233 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2236 /* On VMS, establish our condition handler to possibly turn a condition into
2237 the corresponding exception if the subprogram has a foreign convention or
2240 To ensure proper execution of local finalizations on condition instances,
2241 we must turn a condition into the corresponding exception even if there
2242 is no applicable Ada handler, and need at least one condition handler per
2243 possible call chain involving GNAT code. OTOH, establishing the handler
2244 has a cost so we want to minimize the number of subprograms into which
2245 this happens. The foreign or exported condition is expected to satisfy
2246 all the constraints. */
2247 if (TARGET_ABI_OPEN_VMS
2248 && (Has_Foreign_Convention (gnat_subprog_id)
2249 || Is_Exported (gnat_subprog_id)))
2250 establish_gnat_vms_condition_handler ();
2252 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2254 /* Generate the code of the subprogram itself. A return statement will be
2255 present and any Out parameters will be handled there. */
2256 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2258 gnu_result = end_stmt_group ();
2260 /* If we populated the parameter attributes cache, we need to make sure
2261 that the cached expressions are evaluated on all possible paths. */
2262 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2265 struct parm_attr *pa;
2268 start_stmt_group ();
2270 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2273 add_stmt_with_node (pa->first, gnat_node);
2275 add_stmt_with_node (pa->last, gnat_node);
2277 add_stmt_with_node (pa->length, gnat_node);
2280 add_stmt (gnu_result);
2281 gnu_result = end_stmt_group ();
2284 /* If we made a special return label, we need to make a block that contains
2285 the definition of that label and the copying to the return value. That
2286 block first contains the function, then the label and copy statement. */
2287 if (TREE_VALUE (gnu_return_label_stack))
2291 start_stmt_group ();
2293 add_stmt (gnu_result);
2294 add_stmt (build1 (LABEL_EXPR, void_type_node,
2295 TREE_VALUE (gnu_return_label_stack)));
2297 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2298 if (list_length (gnu_cico_list) == 1)
2299 gnu_retval = TREE_VALUE (gnu_cico_list);
2301 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2304 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2305 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2308 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2309 End_Label (Handled_Statement_Sequence (gnat_node)));
2311 gnu_result = end_stmt_group ();
2314 pop_stack (&gnu_return_label_stack);
2316 /* Set the end location. */
2318 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2319 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2320 : Sloc (gnat_node)),
2321 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2323 end_subprog_body (gnu_result, false);
2325 /* Disconnect the trees for parameters that we made variables for from the
2326 GNAT entities since these are unusable after we end the function. */
2327 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2328 Present (gnat_param);
2329 gnat_param = Next_Formal_With_Extras (gnat_param))
2330 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2331 save_gnu_tree (gnat_param, NULL_TREE, false);
2333 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2334 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2336 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2339 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2340 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2341 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2342 If GNU_TARGET is non-null, this must be a function call and the result
2343 of the call is to be placed into that object. */
2346 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2349 /* The GCC node corresponding to the GNAT subprogram name. This can either
2350 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2351 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2353 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2354 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2355 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2356 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2358 Entity_Id gnat_formal;
2359 Node_Id gnat_actual;
2360 tree gnu_actual_list = NULL_TREE;
2361 tree gnu_name_list = NULL_TREE;
2362 tree gnu_before_list = NULL_TREE;
2363 tree gnu_after_list = NULL_TREE;
2364 tree gnu_subprog_call;
2366 check_for_eliminated_entity (Name (gnat_node));
2368 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2370 /* If we are calling a stubbed function, make this into a raise of
2371 Program_Error. Elaborate all our args first. */
2372 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2373 && DECL_STUBBED_P (gnu_subprog_node))
2375 for (gnat_actual = First_Actual (gnat_node);
2376 Present (gnat_actual);
2377 gnat_actual = Next_Actual (gnat_actual))
2378 add_stmt (gnat_to_gnu (gnat_actual));
2382 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2383 N_Raise_Program_Error);
2385 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2387 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2388 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2395 /* If we are calling by supplying a pointer to a target, set up that
2396 pointer as the first argument. Use GNU_TARGET if one was passed;
2397 otherwise, make a target by building a variable of the maximum size
2399 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2401 tree gnu_real_ret_type
2402 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2407 = maybe_pad_type (gnu_real_ret_type,
2408 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2409 0, Etype (Name (gnat_node)), "PAD", false,
2412 /* ??? We may be about to create a static temporary if we happen to
2413 be at the global binding level. That's a regression from what
2414 the 3.x back-end would generate in the same situation, but we
2415 don't have a mechanism in Gigi for creating automatic variables
2416 in the elaboration routines. */
2418 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2419 NULL, false, false, false, false, NULL,
2424 = tree_cons (NULL_TREE,
2425 build_unary_op (ADDR_EXPR, NULL_TREE,
2426 unchecked_convert (gnu_real_ret_type,
2433 /* The only way we can be making a call via an access type is if Name is an
2434 explicit dereference. In that case, get the list of formal args from the
2435 type the access type is pointing to. Otherwise, get the formals from
2436 entity being called. */
2437 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2438 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2439 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2440 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2443 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2445 /* Create the list of the actual parameters as GCC expects it, namely a chain
2446 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2447 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2448 parameters not passed by reference and don't need to be copied in. */
2449 for (gnat_actual = First_Actual (gnat_node);
2450 Present (gnat_actual);
2451 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2452 gnat_actual = Next_Actual (gnat_actual))
2455 = (present_gnu_tree (gnat_formal)
2456 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2457 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2458 /* We must suppress conversions that can cause the creation of a
2459 temporary in the Out or In Out case because we need the real
2460 object in this case, either to pass its address if it's passed
2461 by reference or as target of the back copy done after the call
2462 if it uses the copy-in copy-out mechanism. We do it in the In
2463 case too, except for an unchecked conversion because it alone
2464 can cause the actual to be misaligned and the addressability
2465 test is applied to the real object. */
2466 bool suppress_type_conversion
2467 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2468 && Ekind (gnat_formal) != E_In_Parameter)
2469 || (Nkind (gnat_actual) == N_Type_Conversion
2470 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2471 Node_Id gnat_name = (suppress_type_conversion
2472 ? Expression (gnat_actual) : gnat_actual);
2473 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2476 /* If it's possible we may need to use this expression twice, make sure
2477 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2478 to force side-effects before the call.
2479 ??? This is more conservative than we need since we don't need to do
2480 this for pass-by-ref with no conversion. */
2481 if (Ekind (gnat_formal) != E_In_Parameter)
2482 gnu_name = gnat_stabilize_reference (gnu_name, true);
2484 /* If we are passing a non-addressable parameter by reference, pass the
2485 address of a copy. In the Out or In Out case, set up to copy back
2486 out after the call. */
2488 && (DECL_BY_REF_P (gnu_formal)
2489 || (TREE_CODE (gnu_formal) == PARM_DECL
2490 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2491 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2492 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2493 && !addressable_p (gnu_name, gnu_name_type))
2495 tree gnu_copy = gnu_name, gnu_temp;
2497 /* If the type is by_reference, a copy is not allowed. */
2498 if (Is_By_Reference_Type (Etype (gnat_formal)))
2500 ("misaligned actual cannot be passed by reference", gnat_actual);
2502 /* For users of Starlet we issue a warning because the
2503 interface apparently assumes that by-ref parameters
2504 outlive the procedure invocation. The code still
2505 will not work as intended, but we cannot do much
2506 better since other low-level parts of the back-end
2507 would allocate temporaries at will because of the
2508 misalignment if we did not do so here. */
2509 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2512 ("?possible violation of implicit assumption", gnat_actual);
2514 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2515 Entity (Name (gnat_node)));
2516 post_error_ne ("?because of misalignment of &", gnat_actual,
2520 /* Remove any unpadding from the object and reset the copy. */
2521 if (TREE_CODE (gnu_name) == COMPONENT_REF
2522 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2524 && (TYPE_IS_PADDING_P
2525 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2526 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2528 /* Otherwise convert to the nominal type of the object if it's
2529 a record type. There are several cases in which we need to
2530 make the temporary using this type instead of the actual type
2531 of the object if they are distinct, because the expectations
2532 of the callee would otherwise not be met:
2533 - if it's a justified modular type,
2534 - if the actual type is a smaller packable version of it. */
2535 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2536 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2537 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2539 gnu_name = convert (gnu_name_type, gnu_name);
2541 /* Make a SAVE_EXPR to both properly account for potential side
2542 effects and handle the creation of a temporary copy. Special
2543 code in gnat_gimplify_expr ensures that the same temporary is
2544 used as the object and copied back after the call if needed. */
2545 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2546 TREE_SIDE_EFFECTS (gnu_name) = 1;
2548 /* Set up to move the copy back to the original. */
2549 if (Ekind (gnat_formal) != E_In_Parameter)
2551 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2553 set_expr_location_from_node (gnu_temp, gnat_node);
2554 append_to_statement_list (gnu_temp, &gnu_after_list);
2558 /* Start from the real object and build the actual. */
2559 gnu_actual = gnu_name;
2561 /* If this was a procedure call, we may not have removed any padding.
2562 So do it here for the part we will use as an input, if any. */
2563 if (Ekind (gnat_formal) != E_Out_Parameter
2564 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2565 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2566 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2569 /* Do any needed conversions for the actual and make sure that it is
2570 in range of the formal's type. */
2571 if (suppress_type_conversion)
2573 /* Put back the conversion we suppressed above in the computation
2574 of the real object. Note that we treat a conversion between
2575 aggregate types as if it is an unchecked conversion here. */
2577 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2579 (Nkind (gnat_actual)
2580 == N_Unchecked_Type_Conversion)
2581 && No_Truncation (gnat_actual));
2583 if (Ekind (gnat_formal) != E_Out_Parameter
2584 && Do_Range_Check (gnat_actual))
2585 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2590 if (Ekind (gnat_formal) != E_Out_Parameter
2591 && Do_Range_Check (gnat_actual))
2592 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2595 /* We may have suppressed a conversion to the Etype of the actual
2596 since the parent is a procedure call. So put it back here.
2597 ??? We use the reverse order compared to the case above because
2598 of an awkward interaction with the check and actually don't put
2599 back the conversion at all if a check is emitted. This is also
2600 done for the conversion to the formal's type just below. */
2601 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2602 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2606 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2607 gnu_actual = convert (gnu_formal_type, gnu_actual);
2609 /* Unless this is an In parameter, we must remove any justified modular
2610 building from GNU_NAME to get an lvalue. */
2611 if (Ekind (gnat_formal) != E_In_Parameter
2612 && TREE_CODE (gnu_name) == CONSTRUCTOR
2613 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2614 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2615 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2618 /* If we have not saved a GCC object for the formal, it means it is an
2619 Out parameter not passed by reference and that does not need to be
2620 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2623 && TREE_CODE (gnu_formal) == PARM_DECL
2624 && DECL_BY_REF_P (gnu_formal))
2626 if (Ekind (gnat_formal) != E_In_Parameter)
2628 /* In Out or Out parameters passed by reference don't use the
2629 copy-in copy-out mechanism so the address of the real object
2630 must be passed to the function. */
2631 gnu_actual = gnu_name;
2633 /* If we have a padded type, be sure we've removed padding. */
2634 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2635 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2636 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2637 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2640 /* If we have the constructed subtype of an aliased object
2641 with an unconstrained nominal subtype, the type of the
2642 actual includes the template, although it is formally
2643 constrained. So we need to convert it back to the real
2644 constructed subtype to retrieve the constrained part
2645 and takes its address. */
2646 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2647 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2648 && TREE_CODE (gnu_actual) != SAVE_EXPR
2649 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2650 && Is_Array_Type (Etype (gnat_actual)))
2651 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2655 /* The symmetry of the paths to the type of an entity is broken here
2656 since arguments don't know that they will be passed by ref. */
2657 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2658 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2661 && TREE_CODE (gnu_formal) == PARM_DECL
2662 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2664 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2665 gnu_actual = maybe_implicit_deref (gnu_actual);
2666 gnu_actual = maybe_unconstrained_array (gnu_actual);
2668 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2669 && TYPE_IS_PADDING_P (gnu_formal_type))
2671 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2672 gnu_actual = convert (gnu_formal_type, gnu_actual);
2675 /* Take the address of the object and convert to the proper pointer
2676 type. We'd like to actually compute the address of the beginning
2677 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2678 possibility that the ARRAY_REF might return a constant and we'd be
2679 getting the wrong address. Neither approach is exactly correct,
2680 but this is the most likely to work in all cases. */
2681 gnu_actual = convert (gnu_formal_type,
2682 build_unary_op (ADDR_EXPR, NULL_TREE,
2686 && TREE_CODE (gnu_formal) == PARM_DECL
2687 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2689 /* If arg is 'Null_Parameter, pass zero descriptor. */
2690 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2691 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2692 && TREE_PRIVATE (gnu_actual))
2693 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2696 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2697 fill_vms_descriptor (gnu_actual,
2703 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2705 if (Ekind (gnat_formal) != E_In_Parameter)
2706 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2708 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2711 /* If this is 'Null_Parameter, pass a zero even though we are
2712 dereferencing it. */
2713 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2714 && TREE_PRIVATE (gnu_actual)
2715 && host_integerp (gnu_actual_size, 1)
2716 && 0 >= compare_tree_int (gnu_actual_size,
2719 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2720 convert (gnat_type_for_size
2721 (tree_low_cst (gnu_actual_size, 1),
2726 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2729 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2732 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2734 nreverse (gnu_actual_list));
2735 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2737 /* If we return by passing a target, the result is the target after the
2738 call. We must not emit the call directly here because this might be
2739 evaluated as part of an expression with conditions to control whether
2740 the call should be emitted or not. */
2741 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2743 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2744 by the target object converted to the proper type. Doing so would
2745 potentially be very inefficient, however, as this expression might
2746 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2747 pointless temporary copy of the whole object.
2749 What we do instead is build a COMPOUND_EXPR returning the address of
2750 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2751 SAVE_EXPR later on then only incurs a pointer copy. */
2753 tree gnu_result_type
2754 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2757 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2759 tree gnu_target_address
2760 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2761 set_expr_location_from_node (gnu_target_address, gnat_node);
2764 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2765 gnu_subprog_call, gnu_target_address);
2768 = unchecked_convert (gnu_result_type,
2769 build_unary_op (INDIRECT_REF, NULL_TREE,
2773 *gnu_result_type_p = gnu_result_type;
2777 /* If it is a function call, the result is the call expression unless
2778 a target is specified, in which case we copy the result into the target
2779 and return the assignment statement. */
2780 else if (Nkind (gnat_node) == N_Function_Call)
2782 gnu_result = gnu_subprog_call;
2784 /* If the function returns an unconstrained array or by reference,
2785 we have to de-dereference the pointer. */
2786 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2787 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2788 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2791 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2792 gnu_target, gnu_result);
2794 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2799 /* If this is the case where the GNAT tree contains a procedure call
2800 but the Ada procedure has copy in copy out parameters, the special
2801 parameter passing mechanism must be used. */
2802 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2804 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2805 in copy out parameters. */
2806 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2807 int length = list_length (scalar_return_list);
2813 gnu_subprog_call = save_expr (gnu_subprog_call);
2814 gnu_name_list = nreverse (gnu_name_list);
2816 /* If any of the names had side-effects, ensure they are all
2817 evaluated before the call. */
2818 for (gnu_name = gnu_name_list; gnu_name;
2819 gnu_name = TREE_CHAIN (gnu_name))
2820 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2821 append_to_statement_list (TREE_VALUE (gnu_name),
2825 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2826 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2828 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2830 for (gnat_actual = First_Actual (gnat_node);
2831 Present (gnat_actual);
2832 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2833 gnat_actual = Next_Actual (gnat_actual))
2834 /* If we are dealing with a copy in copy out parameter, we must
2835 retrieve its value from the record returned in the call. */
2836 if (!(present_gnu_tree (gnat_formal)
2837 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2838 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2839 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2840 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2841 || (DECL_BY_DESCRIPTOR_P
2842 (get_gnu_tree (gnat_formal))))))))
2843 && Ekind (gnat_formal) != E_In_Parameter)
2845 /* Get the value to assign to this Out or In Out parameter. It is
2846 either the result of the function if there is only a single such
2847 parameter or the appropriate field from the record returned. */
2849 = length == 1 ? gnu_subprog_call
2850 : build_component_ref (gnu_subprog_call, NULL_TREE,
2851 TREE_PURPOSE (scalar_return_list),
2854 /* If the actual is a conversion, get the inner expression, which
2855 will be the real destination, and convert the result to the
2856 type of the actual parameter. */
2858 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2860 /* If the result is a padded type, remove the padding. */
2861 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2862 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2863 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2864 (TREE_TYPE (gnu_result))),
2867 /* If the actual is a type conversion, the real target object is
2868 denoted by the inner Expression and we need to convert the
2869 result to the associated type.
2870 We also need to convert our gnu assignment target to this type
2871 if the corresponding GNU_NAME was constructed from the GNAT
2872 conversion node and not from the inner Expression. */
2873 if (Nkind (gnat_actual) == N_Type_Conversion)
2876 = convert_with_check
2877 (Etype (Expression (gnat_actual)), gnu_result,
2878 Do_Overflow_Check (gnat_actual),
2879 Do_Range_Check (Expression (gnat_actual)),
2880 Float_Truncate (gnat_actual), gnat_actual);
2882 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2883 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2886 /* Unchecked conversions as actuals for Out parameters are not
2887 allowed in user code because they are not variables, but do
2888 occur in front-end expansions. The associated GNU_NAME is
2889 always obtained from the inner expression in such cases. */
2890 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2891 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2893 No_Truncation (gnat_actual));
2896 if (Do_Range_Check (gnat_actual))
2898 = emit_range_check (gnu_result, Etype (gnat_actual),
2901 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2902 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2903 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2906 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2907 gnu_actual, gnu_result);
2908 set_expr_location_from_node (gnu_result, gnat_node);
2909 append_to_statement_list (gnu_result, &gnu_before_list);
2910 scalar_return_list = TREE_CHAIN (scalar_return_list);
2911 gnu_name_list = TREE_CHAIN (gnu_name_list);
2915 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2917 append_to_statement_list (gnu_after_list, &gnu_before_list);
2918 return gnu_before_list;
2921 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2922 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2925 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2927 tree gnu_jmpsave_decl = NULL_TREE;
2928 tree gnu_jmpbuf_decl = NULL_TREE;
2929 /* If just annotating, ignore all EH and cleanups. */
2930 bool gcc_zcx = (!type_annotate_only
2931 && Present (Exception_Handlers (gnat_node))
2932 && Exception_Mechanism == Back_End_Exceptions);
2934 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2935 && Exception_Mechanism == Setjmp_Longjmp);
2936 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2937 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2938 tree gnu_inner_block; /* The statement(s) for the block itself. */
2943 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2944 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2945 add_cleanup, and when we leave the binding, end_stmt_group will create
2946 the TRY_FINALLY_EXPR.
2948 ??? The region level calls down there have been specifically put in place
2949 for a ZCX context and currently the order in which things are emitted
2950 (region/handlers) is different from the SJLJ case. Instead of putting
2951 other calls with different conditions at other places for the SJLJ case,
2952 it seems cleaner to reorder things for the SJLJ case and generalize the
2953 condition to make it not ZCX specific.
2955 If there are any exceptions or cleanup processing involved, we need an
2956 outer statement group (for Setjmp_Longjmp) and binding level. */
2957 if (binding_for_block)
2959 start_stmt_group ();
2963 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2964 area for address of previous buffer. Do this first since we need to have
2965 the setjmp buf known for any decls in this block. */
2968 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2969 NULL_TREE, jmpbuf_ptr_type,
2970 build_call_0_expr (get_jmpbuf_decl),
2971 false, false, false, false, NULL,
2973 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2975 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2976 because of the unstructured form of EH used by setjmp_longjmp, there
2977 might be forward edges going to __builtin_setjmp receivers on which
2978 it is uninitialized, although they will never be actually taken. */
2979 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2980 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2981 NULL_TREE, jmpbuf_type,
2982 NULL_TREE, false, false, false, false,
2984 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2986 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2988 /* When we exit this block, restore the saved value. */
2989 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2990 End_Label (gnat_node));
2993 /* If we are to call a function when exiting this block, add a cleanup
2994 to the binding level we made above. Note that add_cleanup is FIFO
2995 so we must register this cleanup after the EH cleanup just above. */
2997 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2998 End_Label (gnat_node));
3000 /* Now build the tree for the declarations and statements inside this block.
3001 If this is SJLJ, set our jmp_buf as the current buffer. */
3002 start_stmt_group ();
3005 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3006 build_unary_op (ADDR_EXPR, NULL_TREE,
3009 if (Present (First_Real_Statement (gnat_node)))
3010 process_decls (Statements (gnat_node), Empty,
3011 First_Real_Statement (gnat_node), true, true);
3013 /* Generate code for each statement in the block. */
3014 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3015 ? First_Real_Statement (gnat_node)
3016 : First (Statements (gnat_node)));
3017 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3018 add_stmt (gnat_to_gnu (gnat_temp));
3019 gnu_inner_block = end_stmt_group ();
3021 /* Now generate code for the two exception models, if either is relevant for
3025 tree *gnu_else_ptr = 0;
3028 /* Make a binding level for the exception handling declarations and code
3029 and set up gnu_except_ptr_stack for the handlers to use. */
3030 start_stmt_group ();
3033 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3034 create_var_decl (get_identifier ("EXCEPT_PTR"),
3036 build_pointer_type (except_type_node),
3037 build_call_0_expr (get_excptr_decl), false,
3038 false, false, false, NULL, gnat_node));
3040 /* Generate code for each handler. The N_Exception_Handler case does the
3041 real work and returns a COND_EXPR for each handler, which we chain
3043 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3044 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3046 gnu_expr = gnat_to_gnu (gnat_temp);
3048 /* If this is the first one, set it as the outer one. Otherwise,
3049 point the "else" part of the previous handler to us. Then point
3050 to our "else" part. */
3052 add_stmt (gnu_expr);
3054 *gnu_else_ptr = gnu_expr;
3056 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3059 /* If none of the exception handlers did anything, re-raise but do not
3061 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3062 TREE_VALUE (gnu_except_ptr_stack));
3063 set_expr_location_from_node (gnu_expr, gnat_node);
3066 *gnu_else_ptr = gnu_expr;
3068 add_stmt (gnu_expr);
3070 /* End the binding level dedicated to the exception handlers and get the
3071 whole statement group. */
3072 pop_stack (&gnu_except_ptr_stack);
3074 gnu_handler = end_stmt_group ();
3076 /* If the setjmp returns 1, we restore our incoming longjmp value and
3077 then check the handlers. */
3078 start_stmt_group ();
3079 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3082 add_stmt (gnu_handler);
3083 gnu_handler = end_stmt_group ();
3085 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3086 gnu_result = build3 (COND_EXPR, void_type_node,
3089 build_unary_op (ADDR_EXPR, NULL_TREE,
3091 gnu_handler, gnu_inner_block);
3097 /* First make a block containing the handlers. */
3098 start_stmt_group ();
3099 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3100 Present (gnat_temp);
3101 gnat_temp = Next_Non_Pragma (gnat_temp))
3102 add_stmt (gnat_to_gnu (gnat_temp));
3103 gnu_handlers = end_stmt_group ();
3105 /* Now make the TRY_CATCH_EXPR for the block. */
3106 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3107 gnu_inner_block, gnu_handlers);
3110 gnu_result = gnu_inner_block;
3112 /* Now close our outer block, if we had to make one. */
3113 if (binding_for_block)
3115 add_stmt (gnu_result);
3117 gnu_result = end_stmt_group ();
3123 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3124 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3125 exception handling. */
3128 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3130 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3131 an "if" statement to select the proper exceptions. For "Others", exclude
3132 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3133 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3134 tree gnu_choice = integer_zero_node;
3135 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3138 for (gnat_temp = First (Exception_Choices (gnat_node));
3139 gnat_temp; gnat_temp = Next (gnat_temp))
3143 if (Nkind (gnat_temp) == N_Others_Choice)
3145 if (All_Others (gnat_temp))
3146 this_choice = integer_one_node;
3150 (EQ_EXPR, integer_type_node,
3155 (INDIRECT_REF, NULL_TREE,
3156 TREE_VALUE (gnu_except_ptr_stack)),
3157 get_identifier ("not_handled_by_others"), NULL_TREE,
3162 else if (Nkind (gnat_temp) == N_Identifier
3163 || Nkind (gnat_temp) == N_Expanded_Name)
3165 Entity_Id gnat_ex_id = Entity (gnat_temp);
3168 /* Exception may be a renaming. Recover original exception which is
3169 the one elaborated and registered. */
3170 if (Present (Renamed_Object (gnat_ex_id)))
3171 gnat_ex_id = Renamed_Object (gnat_ex_id);
3173 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3177 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3178 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3179 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3181 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3182 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3184 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3187 = build_component_ref
3188 (build_unary_op (INDIRECT_REF, NULL_TREE,
3189 TREE_VALUE (gnu_except_ptr_stack)),
3190 get_identifier ("lang"), NULL_TREE, false);
3194 (TRUTH_ORIF_EXPR, integer_type_node,
3195 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3196 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3203 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3204 gnu_choice, this_choice);
3207 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3210 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3211 to a GCC tree, which is returned. This is the variant for ZCX. */
3214 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3216 tree gnu_etypes_list = NULL_TREE;
3219 tree gnu_current_exc_ptr;
3220 tree gnu_incoming_exc_ptr;
3223 /* We build a TREE_LIST of nodes representing what exception types this
3224 handler can catch, with special cases for others and all others cases.
3226 Each exception type is actually identified by a pointer to the exception
3227 id, or to a dummy object for "others" and "all others".
3229 Care should be taken to ensure that the control flow impact of "others"
3230 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3232 for (gnat_temp = First (Exception_Choices (gnat_node));
3233 gnat_temp; gnat_temp = Next (gnat_temp))
3235 if (Nkind (gnat_temp) == N_Others_Choice)
3238 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3241 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3243 else if (Nkind (gnat_temp) == N_Identifier
3244 || Nkind (gnat_temp) == N_Expanded_Name)
3246 Entity_Id gnat_ex_id = Entity (gnat_temp);
3248 /* Exception may be a renaming. Recover original exception which is
3249 the one elaborated and registered. */
3250 if (Present (Renamed_Object (gnat_ex_id)))
3251 gnat_ex_id = Renamed_Object (gnat_ex_id);
3253 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3254 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3256 /* The Non_Ada_Error case for VMS exceptions is handled
3257 by the personality routine. */
3262 /* The GCC interface expects NULL to be passed for catch all handlers, so
3263 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3264 is integer_zero_node. It would not work, however, because GCC's
3265 notion of "catch all" is stronger than our notion of "others". Until
3266 we correctly use the cleanup interface as well, doing that would
3267 prevent the "all others" handlers from being seen, because nothing
3268 can be caught beyond a catch all from GCC's point of view. */
3269 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3272 start_stmt_group ();
3275 /* Expand a call to the begin_handler hook at the beginning of the handler,
3276 and arrange for a call to the end_handler hook to occur on every possible
3279 The hooks expect a pointer to the low level occurrence. This is required
3280 for our stack management scheme because a raise inside the handler pushes
3281 a new occurrence on top of the stack, which means that this top does not
3282 necessarily match the occurrence this handler was dealing with.
3284 The EXC_PTR_EXPR object references the exception occurrence being
3285 propagated. Upon handler entry, this is the exception for which the
3286 handler is triggered. This might not be the case upon handler exit,
3287 however, as we might have a new occurrence propagated by the handler's
3288 body, and the end_handler hook called as a cleanup in this context.
3290 We use a local variable to retrieve the incoming value at handler entry
3291 time, and reuse it to feed the end_handler hook's argument at exit. */
3292 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3293 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3294 ptr_type_node, gnu_current_exc_ptr,
3295 false, false, false, false, NULL,
3298 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3299 gnu_incoming_exc_ptr),
3301 /* ??? We don't seem to have an End_Label at hand to set the location. */
3302 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3304 add_stmt_list (Statements (gnat_node));
3307 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3311 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3314 Compilation_Unit_to_gnu (Node_Id gnat_node)
3316 /* Make the decl for the elaboration procedure. */
3317 bool body_p = (Defining_Entity (Unit (gnat_node)),
3318 Nkind (Unit (gnat_node)) == N_Package_Body
3319 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3320 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3321 tree gnu_elab_proc_decl
3322 = create_subprog_decl
3323 (create_concat_name (gnat_unit_entity,
3324 body_p ? "elabb" : "elabs"),
3325 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3327 struct elab_info *info;
3329 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3331 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3332 allocate_struct_function (gnu_elab_proc_decl, false);
3333 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3336 /* For a body, first process the spec if there is one. */
3337 if (Nkind (Unit (gnat_node)) == N_Package_Body
3338 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3339 && !Acts_As_Spec (gnat_node)))
3341 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3342 finalize_from_with_types ();
3345 process_inlined_subprograms (gnat_node);
3347 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3349 elaborate_all_entities (gnat_node);
3351 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3352 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3353 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3357 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3359 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3361 /* Process any pragmas and actions following the unit. */
3362 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3363 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3364 finalize_from_with_types ();
3366 /* Save away what we've made so far and record this potential elaboration
3368 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3369 set_current_block_context (gnu_elab_proc_decl);
3371 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3372 info->next = elab_info_list;
3373 info->elab_proc = gnu_elab_proc_decl;
3374 info->gnat_node = gnat_node;
3375 elab_info_list = info;
3377 /* Generate elaboration code for this unit, if necessary, and say whether
3379 pop_stack (&gnu_elab_proc_stack);
3381 /* Invalidate the global renaming pointers. This is necessary because
3382 stabilization of the renamed entities may create SAVE_EXPRs which
3383 have been tied to a specific elaboration routine just above. */
3384 invalidate_global_renaming_pointers ();
3387 /* This function is the driver of the GNAT to GCC tree transformation
3388 process. It is the entry point of the tree transformer. GNAT_NODE is the
3389 root of some GNAT tree. Return the root of the corresponding GCC tree.
3390 If this is an expression, return the GCC equivalent of the expression. If
3391 it is a statement, return the statement. In the case when called for a
3392 statement, it may also add statements to the current statement group, in
3393 which case anything it returns is to be interpreted as occurring after
3394 anything `it already added. */
3397 gnat_to_gnu (Node_Id gnat_node)
3399 bool went_into_elab_proc = false;
3400 tree gnu_result = error_mark_node; /* Default to no value. */
3401 tree gnu_result_type = void_type_node;
3403 tree gnu_lhs, gnu_rhs;
3406 /* Save node number for error message and set location information. */
3407 error_gnat_node = gnat_node;
3408 Sloc_to_locus (Sloc (gnat_node), &input_location);
3410 if (type_annotate_only
3411 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3412 return alloc_stmt_list ();
3414 /* If this node is a non-static subexpression and we are only
3415 annotating types, make this into a NULL_EXPR. */
3416 if (type_annotate_only
3417 && IN (Nkind (gnat_node), N_Subexpr)
3418 && Nkind (gnat_node) != N_Identifier
3419 && !Compile_Time_Known_Value (gnat_node))
3420 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3421 build_call_raise (CE_Range_Check_Failed, gnat_node,
3422 N_Raise_Constraint_Error));
3424 /* If this is a Statement and we are at top level, it must be part of the
3425 elaboration procedure, so mark us as being in that procedure and push our
3428 If we are in the elaboration procedure, check if we are violating a
3429 No_Elaboration_Code restriction by having a statement there. */
3430 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3431 && Nkind (gnat_node) != N_Null_Statement)
3432 || Nkind (gnat_node) == N_Procedure_Call_Statement
3433 || Nkind (gnat_node) == N_Label
3434 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3435 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3436 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3437 || Nkind (gnat_node) == N_Raise_Storage_Error
3438 || Nkind (gnat_node) == N_Raise_Program_Error)
3439 && (Ekind (Etype (gnat_node)) == E_Void)))
3441 if (!current_function_decl)
3443 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3444 start_stmt_group ();
3446 went_into_elab_proc = true;
3449 /* Don't check for a possible No_Elaboration_Code restriction violation
3450 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3451 every nested real statement instead. This also avoids triggering
3452 spurious errors on dummy (empty) sequences created by the front-end
3453 for package bodies in some cases. */
3455 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3456 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3457 Check_Elaboration_Code_Allowed (gnat_node);
3460 switch (Nkind (gnat_node))
3462 /********************************/
3463 /* Chapter 2: Lexical Elements */
3464 /********************************/
3467 case N_Expanded_Name:
3468 case N_Operator_Symbol:
3469 case N_Defining_Identifier:
3470 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3473 case N_Integer_Literal:
3477 /* Get the type of the result, looking inside any padding and
3478 justified modular types. Then get the value in that type. */
3479 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3481 if (TREE_CODE (gnu_type) == RECORD_TYPE
3482 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3483 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3485 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3487 /* If the result overflows (meaning it doesn't fit in its base type),
3488 abort. We would like to check that the value is within the range
3489 of the subtype, but that causes problems with subtypes whose usage
3490 will raise Constraint_Error and with biased representation, so
3492 gcc_assert (!TREE_OVERFLOW (gnu_result));
3496 case N_Character_Literal:
3497 /* If a Entity is present, it means that this was one of the
3498 literals in a user-defined character type. In that case,
3499 just return the value in the CONST_DECL. Otherwise, use the
3500 character code. In that case, the base type should be an
3501 INTEGER_TYPE, but we won't bother checking for that. */
3502 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3503 if (Present (Entity (gnat_node)))
3504 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3507 = build_int_cst_type
3508 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3511 case N_Real_Literal:
3512 /* If this is of a fixed-point type, the value we want is the
3513 value of the corresponding integer. */
3514 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3516 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3517 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3519 gcc_assert (!TREE_OVERFLOW (gnu_result));
3522 /* We should never see a Vax_Float type literal, since the front end
3523 is supposed to transform these using appropriate conversions. */
3524 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3529 Ureal ur_realval = Realval (gnat_node);
3531 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3533 /* If the real value is zero, so is the result. Otherwise,
3534 convert it to a machine number if it isn't already. That
3535 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3536 if (UR_Is_Zero (ur_realval))
3537 gnu_result = convert (gnu_result_type, integer_zero_node);
3540 if (!Is_Machine_Number (gnat_node))
3542 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3543 ur_realval, Round_Even, gnat_node);
3546 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3548 /* If we have a base of zero, divide by the denominator.
3549 Otherwise, the base must be 2 and we scale the value, which
3550 we know can fit in the mantissa of the type (hence the use
3551 of that type above). */
3552 if (No (Rbase (ur_realval)))
3554 = build_binary_op (RDIV_EXPR,
3555 get_base_type (gnu_result_type),
3557 UI_To_gnu (Denominator (ur_realval),
3561 REAL_VALUE_TYPE tmp;
3563 gcc_assert (Rbase (ur_realval) == 2);
3564 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3565 - UI_To_Int (Denominator (ur_realval)));
3566 gnu_result = build_real (gnu_result_type, tmp);
3570 /* Now see if we need to negate the result. Do it this way to
3571 properly handle -0. */
3572 if (UR_Is_Negative (Realval (gnat_node)))
3574 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3580 case N_String_Literal:
3581 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3582 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3584 String_Id gnat_string = Strval (gnat_node);
3585 int length = String_Length (gnat_string);
3588 if (length >= ALLOCA_THRESHOLD)
3589 string = XNEWVEC (char, length + 1);
3591 string = (char *) alloca (length + 1);
3593 /* Build the string with the characters in the literal. Note
3594 that Ada strings are 1-origin. */
3595 for (i = 0; i < length; i++)
3596 string[i] = Get_String_Char (gnat_string, i + 1);
3598 /* Put a null at the end of the string in case it's in a context
3599 where GCC will want to treat it as a C string. */
3602 gnu_result = build_string (length, string);
3604 /* Strings in GCC don't normally have types, but we want
3605 this to not be converted to the array type. */
3606 TREE_TYPE (gnu_result) = gnu_result_type;
3608 if (length >= ALLOCA_THRESHOLD)
3613 /* Build a list consisting of each character, then make
3615 String_Id gnat_string = Strval (gnat_node);
3616 int length = String_Length (gnat_string);
3618 tree gnu_list = NULL_TREE;
3619 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3621 for (i = 0; i < length; i++)
3624 = tree_cons (gnu_idx,
3625 build_int_cst (TREE_TYPE (gnu_result_type),
3626 Get_String_Char (gnat_string,
3630 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3635 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3640 gnu_result = Pragma_to_gnu (gnat_node);
3643 /**************************************/
3644 /* Chapter 3: Declarations and Types */
3645 /**************************************/
3647 case N_Subtype_Declaration:
3648 case N_Full_Type_Declaration:
3649 case N_Incomplete_Type_Declaration:
3650 case N_Private_Type_Declaration:
3651 case N_Private_Extension_Declaration:
3652 case N_Task_Type_Declaration:
3653 process_type (Defining_Entity (gnat_node));
3654 gnu_result = alloc_stmt_list ();
3657 case N_Object_Declaration:
3658 case N_Exception_Declaration:
3659 gnat_temp = Defining_Entity (gnat_node);
3660 gnu_result = alloc_stmt_list ();
3662 /* If we are just annotating types and this object has an unconstrained
3663 or task type, don't elaborate it. */
3664 if (type_annotate_only
3665 && (((Is_Array_Type (Etype (gnat_temp))
3666 || Is_Record_Type (Etype (gnat_temp)))
3667 && !Is_Constrained (Etype (gnat_temp)))
3668 || Is_Concurrent_Type (Etype (gnat_temp))))
3671 if (Present (Expression (gnat_node))
3672 && !(Nkind (gnat_node) == N_Object_Declaration
3673 && No_Initialization (gnat_node))
3674 && (!type_annotate_only
3675 || Compile_Time_Known_Value (Expression (gnat_node))))
3677 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3678 if (Do_Range_Check (Expression (gnat_node)))
3680 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3682 /* If this object has its elaboration delayed, we must force
3683 evaluation of GNU_EXPR right now and save it for when the object
3685 if (Present (Freeze_Node (gnat_temp)))
3687 if ((Is_Public (gnat_temp) || global_bindings_p ())
3688 && !TREE_CONSTANT (gnu_expr))
3690 = create_var_decl (create_concat_name (gnat_temp, "init"),
3691 NULL_TREE, TREE_TYPE (gnu_expr),
3692 gnu_expr, false, Is_Public (gnat_temp),
3693 false, false, NULL, gnat_temp);
3695 gnu_expr = maybe_variable (gnu_expr);
3697 save_gnu_tree (gnat_node, gnu_expr, true);
3701 gnu_expr = NULL_TREE;
3703 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3704 gnu_expr = NULL_TREE;
3706 /* If this is a deferred constant with an address clause, we ignore the
3707 full view since the clause is on the partial view and we cannot have
3708 2 different GCC trees for the object. The only bits of the full view
3709 we will use is the initializer, but it will be directly fetched. */
3710 if (Ekind(gnat_temp) == E_Constant
3711 && Present (Address_Clause (gnat_temp))
3712 && Present (Full_View (gnat_temp)))
3713 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3715 if (No (Freeze_Node (gnat_temp)))
3716 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3719 case N_Object_Renaming_Declaration:
3720 gnat_temp = Defining_Entity (gnat_node);
3722 /* Don't do anything if this renaming is handled by the front end or if
3723 we are just annotating types and this object has a composite or task
3724 type, don't elaborate it. We return the result in case it has any
3725 SAVE_EXPRs in it that need to be evaluated here. */
3726 if (!Is_Renaming_Of_Object (gnat_temp)
3727 && ! (type_annotate_only
3728 && (Is_Array_Type (Etype (gnat_temp))
3729 || Is_Record_Type (Etype (gnat_temp))
3730 || Is_Concurrent_Type (Etype (gnat_temp)))))
3732 = gnat_to_gnu_entity (gnat_temp,
3733 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3735 gnu_result = alloc_stmt_list ();
3738 case N_Implicit_Label_Declaration:
3739 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3740 gnu_result = alloc_stmt_list ();
3743 case N_Exception_Renaming_Declaration:
3744 case N_Number_Declaration:
3745 case N_Package_Renaming_Declaration:
3746 case N_Subprogram_Renaming_Declaration:
3747 /* These are fully handled in the front end. */
3748 gnu_result = alloc_stmt_list ();
3751 /*************************************/
3752 /* Chapter 4: Names and Expressions */
3753 /*************************************/
3755 case N_Explicit_Dereference:
3756 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3757 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3758 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3761 case N_Indexed_Component:
3763 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3767 Node_Id *gnat_expr_array;
3769 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3770 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3772 /* If we got a padded type, remove it too. */
3773 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3774 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3776 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3779 gnu_result = gnu_array_object;
3781 /* First compute the number of dimensions of the array, then
3782 fill the expression array, the order depending on whether
3783 this is a Convention_Fortran array or not. */
3784 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3785 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3786 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3787 ndim++, gnu_type = TREE_TYPE (gnu_type))
3790 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3792 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3793 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3795 i--, gnat_temp = Next (gnat_temp))
3796 gnat_expr_array[i] = gnat_temp;
3798 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3800 i++, gnat_temp = Next (gnat_temp))
3801 gnat_expr_array[i] = gnat_temp;
3803 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3804 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3806 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3807 gnat_temp = gnat_expr_array[i];
3808 gnu_expr = gnat_to_gnu (gnat_temp);
3810 if (Do_Range_Check (gnat_temp))
3813 (gnu_array_object, gnu_expr,
3814 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3815 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3818 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3819 gnu_result, gnu_expr);
3823 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3829 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3831 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3832 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3834 /* Do any implicit dereferences of the prefix and do any needed
3836 gnu_result = maybe_implicit_deref (gnu_result);
3837 gnu_result = maybe_unconstrained_array (gnu_result);
3838 gnu_type = TREE_TYPE (gnu_result);
3839 if (Do_Range_Check (gnat_range_node))
3841 /* Get the bounds of the slice. */
3843 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3844 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3845 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3846 /* Get the permitted bounds. */
3847 tree gnu_base_index_type
3848 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3849 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3850 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3851 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3852 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3853 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3855 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3856 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3858 /* Derive a good type to convert everything to. */
3859 gnu_expr_type = get_base_type (gnu_index_type);
3861 /* Test whether the minimum slice value is too small. */
3862 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3863 convert (gnu_expr_type,
3865 convert (gnu_expr_type,
3866 gnu_base_min_expr));
3868 /* Test whether the maximum slice value is too large. */
3869 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3870 convert (gnu_expr_type,
3872 convert (gnu_expr_type,
3873 gnu_base_max_expr));
3875 /* Build a slice index check that returns the low bound,
3876 assuming the slice is not empty. */
3877 gnu_expr = emit_check
3878 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3879 gnu_expr_l, gnu_expr_h),
3880 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3882 /* Build a conditional expression that does the index checks and
3883 returns the low bound if the slice is not empty (max >= min),
3884 and returns the naked low bound otherwise (max < min), unless
3885 it is non-constant and the high bound is; this prevents VRP
3886 from inferring bogus ranges on the unlikely path. */
3887 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3888 build_binary_op (GE_EXPR, gnu_expr_type,
3889 convert (gnu_expr_type,
3891 convert (gnu_expr_type,
3894 TREE_CODE (gnu_min_expr) != INTEGER_CST
3895 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3896 ? gnu_max_expr : gnu_min_expr);
3899 /* Simply return the naked low bound. */
3900 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3902 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3903 gnu_result, gnu_expr);
3907 case N_Selected_Component:
3909 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3910 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3911 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3914 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3915 || IN (Ekind (gnat_pref_type), Access_Kind))
3917 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3918 gnat_pref_type = Underlying_Type (gnat_pref_type);
3919 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3920 gnat_pref_type = Designated_Type (gnat_pref_type);
3923 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3925 /* For discriminant references in tagged types always substitute the
3926 corresponding discriminant as the actual selected component. */
3927 if (Is_Tagged_Type (gnat_pref_type))
3928 while (Present (Corresponding_Discriminant (gnat_field)))
3929 gnat_field = Corresponding_Discriminant (gnat_field);
3931 /* For discriminant references of untagged types always substitute the
3932 corresponding stored discriminant. */
3933 else if (Present (Corresponding_Discriminant (gnat_field)))
3934 gnat_field = Original_Record_Component (gnat_field);
3936 /* Handle extracting the real or imaginary part of a complex.
3937 The real part is the first field and the imaginary the last. */
3938 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3939 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3940 ? REALPART_EXPR : IMAGPART_EXPR,
3941 NULL_TREE, gnu_prefix);
3944 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3946 /* If there are discriminants, the prefix might be evaluated more
3947 than once, which is a problem if it has side-effects. */
3948 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3949 ? Designated_Type (Etype
3950 (Prefix (gnat_node)))
3951 : Etype (Prefix (gnat_node))))
3952 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3955 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3956 (Nkind (Parent (gnat_node))
3957 == N_Attribute_Reference));
3960 gcc_assert (gnu_result);
3961 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3965 case N_Attribute_Reference:
3967 /* The attribute designator (like an enumeration value). */
3968 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
3970 /* The Elab_Spec and Elab_Body attributes are special in that
3971 Prefix is a unit, not an object with a GCC equivalent. Similarly
3972 for Elaborated, since that variable isn't otherwise known. */
3973 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
3974 return (create_subprog_decl
3975 (create_concat_name (Entity (Prefix (gnat_node)),
3976 attribute == Attr_Elab_Body
3977 ? "elabb" : "elabs"),
3978 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
3981 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
3986 /* Like 'Access as far as we are concerned. */
3987 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3988 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
3989 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3993 case N_Extension_Aggregate:
3997 /* ??? It is wrong to evaluate the type now, but there doesn't
3998 seem to be any other practical way of doing it. */
4000 gcc_assert (!Expansion_Delayed (gnat_node));
4002 gnu_aggr_type = gnu_result_type
4003 = get_unpadded_type (Etype (gnat_node));
4005 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4006 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4008 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4010 if (Null_Record_Present (gnat_node))
4011 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4013 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4014 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4016 = assoc_to_constructor (Etype (gnat_node),
4017 First (Component_Associations (gnat_node)),
4019 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4020 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4022 Component_Type (Etype (gnat_node)));
4023 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4026 (COMPLEX_EXPR, gnu_aggr_type,
4027 gnat_to_gnu (Expression (First
4028 (Component_Associations (gnat_node)))),
4029 gnat_to_gnu (Expression
4031 (First (Component_Associations (gnat_node))))));
4035 gnu_result = convert (gnu_result_type, gnu_result);
4040 if (TARGET_VTABLE_USES_DESCRIPTORS
4041 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4042 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4043 gnu_result = null_fdesc_node;
4045 gnu_result = null_pointer_node;
4046 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4049 case N_Type_Conversion:
4050 case N_Qualified_Expression:
4051 /* Get the operand expression. */
4052 gnu_result = gnat_to_gnu (Expression (gnat_node));
4053 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4056 = convert_with_check (Etype (gnat_node), gnu_result,
4057 Do_Overflow_Check (gnat_node),
4058 Do_Range_Check (Expression (gnat_node)),
4059 Nkind (gnat_node) == N_Type_Conversion
4060 && Float_Truncate (gnat_node), gnat_node);
4063 case N_Unchecked_Type_Conversion:
4064 gnu_result = gnat_to_gnu (Expression (gnat_node));
4065 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4067 /* If the result is a pointer type, see if we are improperly
4068 converting to a stricter alignment. */
4069 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4070 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4072 unsigned int align = known_alignment (gnu_result);
4073 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4074 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4076 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4077 post_error_ne_tree_2
4078 ("?source alignment (^) '< alignment of & (^)",
4079 gnat_node, Designated_Type (Etype (gnat_node)),
4080 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4083 /* If we are converting a descriptor to a function pointer, first
4084 build the pointer. */
4085 if (TARGET_VTABLE_USES_DESCRIPTORS
4086 && TREE_TYPE (gnu_result) == fdesc_type_node
4087 && POINTER_TYPE_P (gnu_result_type))
4088 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4090 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4091 No_Truncation (gnat_node));
4097 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4098 Node_Id gnat_range = Right_Opnd (gnat_node);
4102 /* GNAT_RANGE is either an N_Range node or an identifier
4103 denoting a subtype. */
4104 if (Nkind (gnat_range) == N_Range)
4106 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4107 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4109 else if (Nkind (gnat_range) == N_Identifier
4110 || Nkind (gnat_range) == N_Expanded_Name)
4112 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4114 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4115 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4120 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4122 /* If LOW and HIGH are identical, perform an equality test.
4123 Otherwise, ensure that GNU_OBJECT is only evaluated once
4124 and perform a full range test. */
4125 if (operand_equal_p (gnu_low, gnu_high, 0))
4126 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4127 gnu_object, gnu_low);
4130 gnu_object = protect_multiple_eval (gnu_object);
4132 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4133 build_binary_op (GE_EXPR, gnu_result_type,
4134 gnu_object, gnu_low),
4135 build_binary_op (LE_EXPR, gnu_result_type,
4136 gnu_object, gnu_high));
4139 if (Nkind (gnat_node) == N_Not_In)
4140 gnu_result = invert_truthvalue (gnu_result);
4145 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4146 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4147 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4148 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4150 : (Rounded_Result (gnat_node)
4151 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4152 gnu_result_type, gnu_lhs, gnu_rhs);
4155 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4156 /* These can either be operations on booleans or on modular types.
4157 Fall through for boolean types since that's the way GNU_CODES is
4159 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4160 Modular_Integer_Kind))
4163 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4164 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4167 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4168 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4169 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4170 gnu_result = build_binary_op (code, gnu_result_type,
4175 /* ... fall through ... */
4177 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4178 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4179 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4180 case N_Op_Mod: case N_Op_Rem:
4181 case N_Op_Rotate_Left:
4182 case N_Op_Rotate_Right:
4183 case N_Op_Shift_Left:
4184 case N_Op_Shift_Right:
4185 case N_Op_Shift_Right_Arithmetic:
4186 case N_And_Then: case N_Or_Else:
4188 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4189 bool ignore_lhs_overflow = false;
4192 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4193 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4194 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4196 /* If this is a comparison operator, convert any references to
4197 an unconstrained array value into a reference to the
4199 if (TREE_CODE_CLASS (code) == tcc_comparison)
4201 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4202 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4205 /* If the result type is a private type, its full view may be a
4206 numeric subtype. The representation we need is that of its base
4207 type, given that it is the result of an arithmetic operation. */
4208 else if (Is_Private_Type (Etype (gnat_node)))
4209 gnu_type = gnu_result_type
4210 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4212 /* If this is a shift whose count is not guaranteed to be correct,
4213 we need to adjust the shift count. */
4214 if (IN (Nkind (gnat_node), N_Op_Shift)
4215 && !Shift_Count_OK (gnat_node))
4217 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4219 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4221 if (Nkind (gnat_node) == N_Op_Rotate_Left
4222 || Nkind (gnat_node) == N_Op_Rotate_Right)
4223 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4224 gnu_rhs, gnu_max_shift);
4225 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4228 (MIN_EXPR, gnu_count_type,
4229 build_binary_op (MINUS_EXPR,
4232 convert (gnu_count_type,
4237 /* For right shifts, the type says what kind of shift to do,
4238 so we may need to choose a different type. In this case,
4239 we have to ignore integer overflow lest it propagates all
4240 the way down and causes a CE to be explicitly raised. */
4241 if (Nkind (gnat_node) == N_Op_Shift_Right
4242 && !TYPE_UNSIGNED (gnu_type))
4244 gnu_type = gnat_unsigned_type (gnu_type);
4245 ignore_lhs_overflow = true;
4247 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4248 && TYPE_UNSIGNED (gnu_type))
4250 gnu_type = gnat_signed_type (gnu_type);
4251 ignore_lhs_overflow = true;
4254 if (gnu_type != gnu_result_type)
4256 tree gnu_old_lhs = gnu_lhs;
4257 gnu_lhs = convert (gnu_type, gnu_lhs);
4258 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4259 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4260 gnu_rhs = convert (gnu_type, gnu_rhs);
4263 /* Instead of expanding overflow checks for addition, subtraction
4264 and multiplication itself, the front end will leave this to
4265 the back end when Backend_Overflow_Checks_On_Target is set.
4266 As the GCC back end itself does not know yet how to properly
4267 do overflow checking, do it here. The goal is to push
4268 the expansions further into the back end over time. */
4269 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4270 && (Nkind (gnat_node) == N_Op_Add
4271 || Nkind (gnat_node) == N_Op_Subtract
4272 || Nkind (gnat_node) == N_Op_Multiply)
4273 && !TYPE_UNSIGNED (gnu_type)
4274 && !FLOAT_TYPE_P (gnu_type))
4275 gnu_result = build_binary_op_trapv (code, gnu_type,
4276 gnu_lhs, gnu_rhs, gnat_node);
4278 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4280 /* If this is a logical shift with the shift count not verified,
4281 we must return zero if it is too large. We cannot compensate
4282 above in this case. */
4283 if ((Nkind (gnat_node) == N_Op_Shift_Left
4284 || Nkind (gnat_node) == N_Op_Shift_Right)
4285 && !Shift_Count_OK (gnat_node))
4289 build_binary_op (GE_EXPR, integer_type_node,
4291 convert (TREE_TYPE (gnu_rhs),
4292 TYPE_SIZE (gnu_type))),
4293 convert (gnu_type, integer_zero_node),
4298 case N_Conditional_Expression:
4300 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4301 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4303 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4305 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4306 gnu_result = build_cond_expr (gnu_result_type,
4307 gnat_truthvalue_conversion (gnu_cond),
4308 gnu_true, gnu_false);
4313 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4314 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4318 /* This case can apply to a boolean or a modular type.
4319 Fall through for a boolean operand since GNU_CODES is set
4320 up to handle this. */
4321 if (Is_Modular_Integer_Type (Etype (gnat_node))
4322 || (Ekind (Etype (gnat_node)) == E_Private_Type
4323 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4325 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4326 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4327 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4332 /* ... fall through ... */
4334 case N_Op_Minus: case N_Op_Abs:
4335 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4337 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4338 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4340 gnu_result_type = get_unpadded_type (Base_Type
4341 (Full_View (Etype (gnat_node))));
4343 if (Do_Overflow_Check (gnat_node)
4344 && !TYPE_UNSIGNED (gnu_result_type)
4345 && !FLOAT_TYPE_P (gnu_result_type))
4347 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4348 gnu_result_type, gnu_expr, gnat_node);
4350 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4351 gnu_result_type, gnu_expr);
4358 bool ignore_init_type = false;
4360 gnat_temp = Expression (gnat_node);
4362 /* The Expression operand can either be an N_Identifier or
4363 Expanded_Name, which must represent a type, or a
4364 N_Qualified_Expression, which contains both the object type and an
4365 initial value for the object. */
4366 if (Nkind (gnat_temp) == N_Identifier
4367 || Nkind (gnat_temp) == N_Expanded_Name)
4368 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4369 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4371 Entity_Id gnat_desig_type
4372 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4374 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4375 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4377 gnu_init = maybe_unconstrained_array (gnu_init);
4378 if (Do_Range_Check (Expression (gnat_temp)))
4380 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4382 if (Is_Elementary_Type (gnat_desig_type)
4383 || Is_Constrained (gnat_desig_type))
4385 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4386 gnu_init = convert (gnu_type, gnu_init);
4390 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4391 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4392 gnu_type = TREE_TYPE (gnu_init);
4394 gnu_init = convert (gnu_type, gnu_init);
4400 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4401 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4402 Procedure_To_Call (gnat_node),
4403 Storage_Pool (gnat_node), gnat_node,
4408 /**************************/
4409 /* Chapter 5: Statements */
4410 /**************************/
4413 gnu_result = build1 (LABEL_EXPR, void_type_node,
4414 gnat_to_gnu (Identifier (gnat_node)));
4417 case N_Null_Statement:
4418 gnu_result = alloc_stmt_list ();
4421 case N_Assignment_Statement:
4422 /* Get the LHS and RHS of the statement and convert any reference to an
4423 unconstrained array into a reference to the underlying array.
4424 If we are not to do range checking and the RHS is an N_Function_Call,
4425 pass the LHS to the call function. */
4426 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4428 /* If the type has a size that overflows, convert this into raise of
4429 Storage_Error: execution shouldn't have gotten here anyway. */
4430 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4431 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4432 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4433 N_Raise_Storage_Error);
4434 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4435 && !Do_Range_Check (Expression (gnat_node)))
4436 gnu_result = call_to_gnu (Expression (gnat_node),
4437 &gnu_result_type, gnu_lhs);
4441 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4443 /* If range check is needed, emit code to generate it. */
4444 if (Do_Range_Check (Expression (gnat_node)))
4445 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4449 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4451 /* If the type being assigned is an array type and the two sides
4452 are not completely disjoint, play safe and use memmove. */
4453 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4454 && Is_Array_Type (Etype (Name (gnat_node)))
4455 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4457 tree to, from, size, to_ptr, from_ptr, t;
4459 to = TREE_OPERAND (gnu_result, 0);
4460 from = TREE_OPERAND (gnu_result, 1);
4462 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4463 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4465 to_ptr = build_fold_addr_expr (to);
4466 from_ptr = build_fold_addr_expr (from);
4468 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4469 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4474 case N_If_Statement:
4476 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4478 /* Make the outer COND_EXPR. Avoid non-determinism. */
4479 gnu_result = build3 (COND_EXPR, void_type_node,
4480 gnat_to_gnu (Condition (gnat_node)),
4481 NULL_TREE, NULL_TREE);
4482 COND_EXPR_THEN (gnu_result)
4483 = build_stmt_group (Then_Statements (gnat_node), false);
4484 TREE_SIDE_EFFECTS (gnu_result) = 1;
4485 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4487 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4488 into the previous "else" part and point to where to put any
4489 outer "else". Also avoid non-determinism. */
4490 if (Present (Elsif_Parts (gnat_node)))
4491 for (gnat_temp = First (Elsif_Parts (gnat_node));
4492 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4494 gnu_expr = build3 (COND_EXPR, void_type_node,
4495 gnat_to_gnu (Condition (gnat_temp)),
4496 NULL_TREE, NULL_TREE);
4497 COND_EXPR_THEN (gnu_expr)
4498 = build_stmt_group (Then_Statements (gnat_temp), false);
4499 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4500 set_expr_location_from_node (gnu_expr, gnat_temp);
4501 *gnu_else_ptr = gnu_expr;
4502 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4505 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4509 case N_Case_Statement:
4510 gnu_result = Case_Statement_to_gnu (gnat_node);
4513 case N_Loop_Statement:
4514 gnu_result = Loop_Statement_to_gnu (gnat_node);
4517 case N_Block_Statement:
4518 start_stmt_group ();
4520 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4521 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4523 gnu_result = end_stmt_group ();
4525 if (Present (Identifier (gnat_node)))
4526 mark_out_of_scope (Entity (Identifier (gnat_node)));
4529 case N_Exit_Statement:
4531 = build2 (EXIT_STMT, void_type_node,
4532 (Present (Condition (gnat_node))
4533 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4534 (Present (Name (gnat_node))
4535 ? get_gnu_tree (Entity (Name (gnat_node)))
4536 : TREE_VALUE (gnu_loop_label_stack)));
4539 case N_Return_Statement:
4541 /* The gnu function type of the subprogram currently processed. */
4542 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4543 /* The return value from the subprogram. */
4544 tree gnu_ret_val = NULL_TREE;
4545 /* The place to put the return value. */
4548 /* If we are dealing with a "return;" from an Ada procedure with
4549 parameters passed by copy in copy out, we need to return a record
4550 containing the final values of these parameters. If the list
4551 contains only one entry, return just that entry.
4553 For a full description of the copy in copy out parameter mechanism,
4554 see the part of the gnat_to_gnu_entity routine dealing with the
4555 translation of subprograms.
4557 But if we have a return label defined, convert this into
4558 a branch to that label. */
4560 if (TREE_VALUE (gnu_return_label_stack))
4562 gnu_result = build1 (GOTO_EXPR, void_type_node,
4563 TREE_VALUE (gnu_return_label_stack));
4567 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4569 gnu_lhs = DECL_RESULT (current_function_decl);
4570 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4571 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4574 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4575 TYPE_CI_CO_LIST (gnu_subprog_type));
4578 /* If the Ada subprogram is a function, we just need to return the
4579 expression. If the subprogram returns an unconstrained
4580 array, we have to allocate a new version of the result and
4581 return it. If we return by reference, return a pointer. */
4583 else if (Present (Expression (gnat_node)))
4585 /* If the current function returns by target pointer and we
4586 are doing a call, pass that target to the call. */
4587 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4588 && Nkind (Expression (gnat_node)) == N_Function_Call)
4591 = build_unary_op (INDIRECT_REF, NULL_TREE,
4592 DECL_ARGUMENTS (current_function_decl));
4593 gnu_result = call_to_gnu (Expression (gnat_node),
4594 &gnu_result_type, gnu_lhs);
4598 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4600 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4601 /* The original return type was unconstrained so dereference
4602 the TARGET pointer in the actual return value's type. */
4604 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4605 DECL_ARGUMENTS (current_function_decl));
4607 gnu_lhs = DECL_RESULT (current_function_decl);
4609 /* Do not remove the padding from GNU_RET_VAL if the inner
4610 type is self-referential since we want to allocate the fixed
4611 size in that case. */
4612 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4613 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4615 && (TYPE_IS_PADDING_P
4616 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4617 && (CONTAINS_PLACEHOLDER_P
4618 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4619 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4621 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4622 || By_Ref (gnat_node))
4624 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4626 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4628 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4630 = build_allocator (TREE_TYPE (gnu_ret_val),
4632 TREE_TYPE (gnu_subprog_type),
4633 Procedure_To_Call (gnat_node),
4634 Storage_Pool (gnat_node),
4640 /* If the Ada subprogram is a regular procedure, just return. */
4641 gnu_lhs = NULL_TREE;
4643 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4646 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4647 gnu_lhs, gnu_ret_val);
4648 add_stmt_with_node (gnu_result, gnat_node);
4649 gnu_lhs = NULL_TREE;
4652 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4656 case N_Goto_Statement:
4657 gnu_result = build1 (GOTO_EXPR, void_type_node,
4658 gnat_to_gnu (Name (gnat_node)));
4661 /***************************/
4662 /* Chapter 6: Subprograms */
4663 /***************************/
4665 case N_Subprogram_Declaration:
4666 /* Unless there is a freeze node, declare the subprogram. We consider
4667 this a "definition" even though we're not generating code for
4668 the subprogram because we will be making the corresponding GCC
4671 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4672 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4674 gnu_result = alloc_stmt_list ();
4677 case N_Abstract_Subprogram_Declaration:
4678 /* This subprogram doesn't exist for code generation purposes, but we
4679 have to elaborate the types of any parameters and result, unless
4680 they are imported types (nothing to generate in this case). */
4682 /* Process the parameter types first. */
4685 = First_Formal_With_Extras
4686 (Defining_Entity (Specification (gnat_node)));
4687 Present (gnat_temp);
4688 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4689 if (Is_Itype (Etype (gnat_temp))
4690 && !From_With_Type (Etype (gnat_temp)))
4691 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4694 /* Then the result type, set to Standard_Void_Type for procedures. */
4697 Entity_Id gnat_temp_type
4698 = Etype (Defining_Entity (Specification (gnat_node)));
4700 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4701 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4704 gnu_result = alloc_stmt_list ();
4707 case N_Defining_Program_Unit_Name:
4708 /* For a child unit identifier go up a level to get the specification.
4709 We get this when we try to find the spec of a child unit package
4710 that is the compilation unit being compiled. */
4711 gnu_result = gnat_to_gnu (Parent (gnat_node));
4714 case N_Subprogram_Body:
4715 Subprogram_Body_to_gnu (gnat_node);
4716 gnu_result = alloc_stmt_list ();
4719 case N_Function_Call:
4720 case N_Procedure_Call_Statement:
4721 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4724 /************************/
4725 /* Chapter 7: Packages */
4726 /************************/
4728 case N_Package_Declaration:
4729 gnu_result = gnat_to_gnu (Specification (gnat_node));
4732 case N_Package_Specification:
4734 start_stmt_group ();
4735 process_decls (Visible_Declarations (gnat_node),
4736 Private_Declarations (gnat_node), Empty, true, true);
4737 gnu_result = end_stmt_group ();
4740 case N_Package_Body:
4742 /* If this is the body of a generic package - do nothing. */
4743 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4745 gnu_result = alloc_stmt_list ();
4749 start_stmt_group ();
4750 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4752 if (Present (Handled_Statement_Sequence (gnat_node)))
4753 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4755 gnu_result = end_stmt_group ();
4758 /********************************/
4759 /* Chapter 8: Visibility Rules */
4760 /********************************/
4762 case N_Use_Package_Clause:
4763 case N_Use_Type_Clause:
4764 /* Nothing to do here - but these may appear in list of declarations. */
4765 gnu_result = alloc_stmt_list ();
4768 /*********************/
4769 /* Chapter 9: Tasks */
4770 /*********************/
4772 case N_Protected_Type_Declaration:
4773 gnu_result = alloc_stmt_list ();
4776 case N_Single_Task_Declaration:
4777 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4778 gnu_result = alloc_stmt_list ();
4781 /*********************************************************/
4782 /* Chapter 10: Program Structure and Compilation Issues */
4783 /*********************************************************/
4785 case N_Compilation_Unit:
4787 /* This is not called for the main unit, which is handled in function
4789 start_stmt_group ();
4792 Compilation_Unit_to_gnu (gnat_node);
4793 gnu_result = alloc_stmt_list ();
4796 case N_Subprogram_Body_Stub:
4797 case N_Package_Body_Stub:
4798 case N_Protected_Body_Stub:
4799 case N_Task_Body_Stub:
4800 /* Simply process whatever unit is being inserted. */
4801 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4805 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4808 /***************************/
4809 /* Chapter 11: Exceptions */
4810 /***************************/
4812 case N_Handled_Sequence_Of_Statements:
4813 /* If there is an At_End procedure attached to this node, and the EH
4814 mechanism is SJLJ, we must have at least a corresponding At_End
4815 handler, unless the No_Exception_Handlers restriction is set. */
4816 gcc_assert (type_annotate_only
4817 || Exception_Mechanism != Setjmp_Longjmp
4818 || No (At_End_Proc (gnat_node))
4819 || Present (Exception_Handlers (gnat_node))
4820 || No_Exception_Handlers_Set ());
4822 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4825 case N_Exception_Handler:
4826 if (Exception_Mechanism == Setjmp_Longjmp)
4827 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4828 else if (Exception_Mechanism == Back_End_Exceptions)
4829 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4835 case N_Push_Constraint_Error_Label:
4836 push_exception_label_stack (&gnu_constraint_error_label_stack,
4837 Exception_Label (gnat_node));
4840 case N_Push_Storage_Error_Label:
4841 push_exception_label_stack (&gnu_storage_error_label_stack,
4842 Exception_Label (gnat_node));
4845 case N_Push_Program_Error_Label:
4846 push_exception_label_stack (&gnu_program_error_label_stack,
4847 Exception_Label (gnat_node));
4850 case N_Pop_Constraint_Error_Label:
4851 gnu_constraint_error_label_stack
4852 = TREE_CHAIN (gnu_constraint_error_label_stack);
4855 case N_Pop_Storage_Error_Label:
4856 gnu_storage_error_label_stack
4857 = TREE_CHAIN (gnu_storage_error_label_stack);
4860 case N_Pop_Program_Error_Label:
4861 gnu_program_error_label_stack
4862 = TREE_CHAIN (gnu_program_error_label_stack);
4865 /******************************/
4866 /* Chapter 12: Generic Units */
4867 /******************************/
4869 case N_Generic_Function_Renaming_Declaration:
4870 case N_Generic_Package_Renaming_Declaration:
4871 case N_Generic_Procedure_Renaming_Declaration:
4872 case N_Generic_Package_Declaration:
4873 case N_Generic_Subprogram_Declaration:
4874 case N_Package_Instantiation:
4875 case N_Procedure_Instantiation:
4876 case N_Function_Instantiation:
4877 /* These nodes can appear on a declaration list but there is nothing to
4878 to be done with them. */
4879 gnu_result = alloc_stmt_list ();
4882 /**************************************************/
4883 /* Chapter 13: Representation Clauses and */
4884 /* Implementation-Dependent Features */
4885 /**************************************************/
4887 case N_Attribute_Definition_Clause:
4888 gnu_result = alloc_stmt_list ();
4890 /* The only one we need to deal with is 'Address since, for the others,
4891 the front-end puts the information elsewhere. */
4892 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4895 /* And we only deal with 'Address if the object has a Freeze node. */
4896 gnat_temp = Entity (Name (gnat_node));
4897 if (No (Freeze_Node (gnat_temp)))
4900 /* Get the value to use as the address and save it as the equivalent
4901 for the object. When it is frozen, gnat_to_gnu_entity will do the
4903 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4906 case N_Enumeration_Representation_Clause:
4907 case N_Record_Representation_Clause:
4909 /* We do nothing with these. SEM puts the information elsewhere. */
4910 gnu_result = alloc_stmt_list ();
4913 case N_Code_Statement:
4914 if (!type_annotate_only)
4916 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4917 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4918 tree gnu_clobbers = NULL_TREE, tail;
4919 bool allows_mem, allows_reg, fake;
4920 int ninputs, noutputs, i;
4921 const char **oconstraints;
4922 const char *constraint;
4925 /* First retrieve the 3 operand lists built by the front-end. */
4926 Setup_Asm_Outputs (gnat_node);
4927 while (Present (gnat_temp = Asm_Output_Variable ()))
4929 tree gnu_value = gnat_to_gnu (gnat_temp);
4930 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4931 (Asm_Output_Constraint ()));
4933 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4937 Setup_Asm_Inputs (gnat_node);
4938 while (Present (gnat_temp = Asm_Input_Value ()))
4940 tree gnu_value = gnat_to_gnu (gnat_temp);
4941 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4942 (Asm_Input_Constraint ()));
4944 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4948 Clobber_Setup (gnat_node);
4949 while ((clobber = Clobber_Get_Next ()))
4951 = tree_cons (NULL_TREE,
4952 build_string (strlen (clobber) + 1, clobber),
4955 /* Then perform some standard checking and processing on the
4956 operands. In particular, mark them addressable if needed. */
4957 gnu_outputs = nreverse (gnu_outputs);
4958 noutputs = list_length (gnu_outputs);
4959 gnu_inputs = nreverse (gnu_inputs);
4960 ninputs = list_length (gnu_inputs);
4962 = (const char **) alloca (noutputs * sizeof (const char *));
4964 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4966 tree output = TREE_VALUE (tail);
4968 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4969 oconstraints[i] = constraint;
4971 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4972 &allows_mem, &allows_reg, &fake))
4974 /* If the operand is going to end up in memory,
4975 mark it addressable. Note that we don't test
4976 allows_mem like in the input case below; this
4977 is modelled on the C front-end. */
4979 && !gnat_mark_addressable (output))
4980 output = error_mark_node;
4983 output = error_mark_node;
4985 TREE_VALUE (tail) = output;
4988 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
4990 tree input = TREE_VALUE (tail);
4992 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4994 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
4996 &allows_mem, &allows_reg))
4998 /* If the operand is going to end up in memory,
4999 mark it addressable. */
5000 if (!allows_reg && allows_mem
5001 && !gnat_mark_addressable (input))
5002 input = error_mark_node;
5005 input = error_mark_node;
5007 TREE_VALUE (tail) = input;
5010 gnu_result = build4 (ASM_EXPR, void_type_node,
5011 gnu_template, gnu_outputs,
5012 gnu_inputs, gnu_clobbers);
5013 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5016 gnu_result = alloc_stmt_list ();
5024 case N_Freeze_Entity:
5025 start_stmt_group ();
5026 process_freeze_entity (gnat_node);
5027 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5028 gnu_result = end_stmt_group ();
5031 case N_Itype_Reference:
5032 if (!present_gnu_tree (Itype (gnat_node)))
5033 process_type (Itype (gnat_node));
5035 gnu_result = alloc_stmt_list ();
5038 case N_Free_Statement:
5039 if (!type_annotate_only)
5041 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5042 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5044 tree gnu_actual_obj_type = 0;
5047 unsigned int default_allocator_alignment
5048 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
5050 /* If this is a thin pointer, we must dereference it to create
5051 a fat pointer, then go back below to a thin pointer. The
5052 reason for this is that we need a fat pointer someplace in
5053 order to properly compute the size. */
5054 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5055 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5056 build_unary_op (INDIRECT_REF, NULL_TREE,
5059 /* If this is an unconstrained array, we know the object must
5060 have been allocated with the template in front of the object.
5061 So pass the template address, but get the total size. Do this
5062 by converting to a thin pointer. */
5063 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5065 = convert (build_pointer_type
5066 (TYPE_OBJECT_RECORD_TYPE
5067 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5070 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5072 if (Present (Actual_Designated_Subtype (gnat_node)))
5075 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5077 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5079 = build_unc_object_type_from_ptr (gnu_ptr_type,
5080 gnu_actual_obj_type,
5081 get_identifier ("DEALLOC"));
5084 gnu_actual_obj_type = gnu_obj_type;
5086 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5087 align = TYPE_ALIGN (gnu_obj_type);
5089 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5090 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5092 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5093 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5094 tree gnu_byte_offset
5095 = convert (sizetype,
5096 size_diffop (size_zero_node, gnu_pos));
5097 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5099 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5100 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5101 gnu_ptr, gnu_byte_offset);
5104 /* If the object was allocated from the default storage pool, the
5105 alignment was greater than what the allocator provides, and this
5106 is not a fat or thin pointer, what we have in gnu_ptr here is an
5107 address dynamically adjusted to match the alignment requirement
5108 (see build_allocator). What we need to pass to free is the
5109 initial allocator's return value, which has been stored just in
5110 front of the block we have. */
5112 if (No (Procedure_To_Call (gnat_node))
5113 && align > default_allocator_alignment
5114 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5117 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
5121 = (void *)GNU_PTR - (void *)sizeof (void *)) */
5124 (POINTER_PLUS_EXPR, ptr_void_type_node,
5125 convert (ptr_void_type_node, gnu_ptr),
5126 size_int (-POINTER_SIZE/BITS_PER_UNIT));
5128 /* GNU_PTR (void *) = *(void **)GNU_PTR */
5131 (INDIRECT_REF, NULL_TREE,
5132 convert (build_pointer_type (ptr_void_type_node),
5136 gnu_result = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, align,
5137 Procedure_To_Call (gnat_node),
5138 Storage_Pool (gnat_node),
5143 case N_Raise_Constraint_Error:
5144 case N_Raise_Program_Error:
5145 case N_Raise_Storage_Error:
5146 if (type_annotate_only)
5148 gnu_result = alloc_stmt_list ();
5152 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5154 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5157 /* If the type is VOID, this is a statement, so we need to
5158 generate the code for the call. Handle a Condition, if there
5160 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5162 set_expr_location_from_node (gnu_result, gnat_node);
5164 if (Present (Condition (gnat_node)))
5165 gnu_result = build3 (COND_EXPR, void_type_node,
5166 gnat_to_gnu (Condition (gnat_node)),
5167 gnu_result, alloc_stmt_list ());
5170 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5173 case N_Validate_Unchecked_Conversion:
5175 Entity_Id gnat_target_type = Target_Type (gnat_node);
5176 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5177 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5179 /* No need for any warning in this case. */
5180 if (!flag_strict_aliasing)
5183 /* If the result is a pointer type, see if we are either converting
5184 from a non-pointer or from a pointer to a type with a different
5185 alias set and warn if so. If the result is defined in the same
5186 unit as this unchecked conversion, we can allow this because we
5187 can know to make the pointer type behave properly. */
5188 else if (POINTER_TYPE_P (gnu_target_type)
5189 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5190 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5192 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5193 ? TREE_TYPE (gnu_source_type)
5195 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5197 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5198 || get_alias_set (gnu_target_desig_type) != 0)
5199 && (!POINTER_TYPE_P (gnu_source_type)
5200 || (TYPE_DUMMY_P (gnu_source_desig_type)
5201 != TYPE_DUMMY_P (gnu_target_desig_type))
5202 || (TYPE_DUMMY_P (gnu_source_desig_type)
5203 && gnu_source_desig_type != gnu_target_desig_type)
5204 || !alias_sets_conflict_p
5205 (get_alias_set (gnu_source_desig_type),
5206 get_alias_set (gnu_target_desig_type))))
5209 ("?possible aliasing problem for type&",
5210 gnat_node, Target_Type (gnat_node));
5212 ("\\?use -fno-strict-aliasing switch for references",
5215 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5216 gnat_node, Target_Type (gnat_node));
5220 /* But if the result is a fat pointer type, we have no mechanism to
5221 do that, so we unconditionally warn in problematic cases. */
5222 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5224 tree gnu_source_array_type
5225 = TYPE_FAT_POINTER_P (gnu_source_type)
5226 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5228 tree gnu_target_array_type
5229 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5231 if ((TYPE_DUMMY_P (gnu_target_array_type)
5232 || get_alias_set (gnu_target_array_type) != 0)
5233 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5234 || (TYPE_DUMMY_P (gnu_source_array_type)
5235 != TYPE_DUMMY_P (gnu_target_array_type))
5236 || (TYPE_DUMMY_P (gnu_source_array_type)
5237 && gnu_source_array_type != gnu_target_array_type)
5238 || !alias_sets_conflict_p
5239 (get_alias_set (gnu_source_array_type),
5240 get_alias_set (gnu_target_array_type))))
5243 ("?possible aliasing problem for type&",
5244 gnat_node, Target_Type (gnat_node));
5246 ("\\?use -fno-strict-aliasing switch for references",
5251 gnu_result = alloc_stmt_list ();
5254 case N_Raise_Statement:
5255 case N_Function_Specification:
5256 case N_Procedure_Specification:
5258 case N_Component_Association:
5261 gcc_assert (type_annotate_only);
5262 gnu_result = alloc_stmt_list ();
5265 /* If we pushed our level as part of processing the elaboration routine,
5267 if (went_into_elab_proc)
5269 add_stmt (gnu_result);
5271 gnu_result = end_stmt_group ();
5272 current_function_decl = NULL_TREE;
5275 /* Set the location information on the result if it is a real expression.
5276 References can be reused for multiple GNAT nodes and they would get
5277 the location information of their last use. Note that we may have
5278 no result if we tried to build a CALL_EXPR node to a procedure with
5279 no side-effects and optimization is enabled. */
5281 && EXPR_P (gnu_result)
5282 && TREE_CODE (gnu_result) != NOP_EXPR
5283 && !REFERENCE_CLASS_P (gnu_result))
5284 set_expr_location_from_node (gnu_result, gnat_node);
5286 /* If we're supposed to return something of void_type, it means we have
5287 something we're elaborating for effect, so just return. */
5288 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5291 /* If the result is a constant that overflows, raise constraint error. */
5292 else if (TREE_CODE (gnu_result) == INTEGER_CST
5293 && TREE_OVERFLOW (gnu_result))
5295 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5298 = build1 (NULL_EXPR, gnu_result_type,
5299 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5300 N_Raise_Constraint_Error));
5303 /* If our result has side-effects and is of an unconstrained type,
5304 make a SAVE_EXPR so that we can be sure it will only be referenced
5305 once. Note we must do this before any conversions. */
5306 if (TREE_SIDE_EFFECTS (gnu_result)
5307 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5308 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5309 gnu_result = gnat_stabilize_reference (gnu_result, false);
5311 /* Now convert the result to the result type, unless we are in one of the
5314 1. If this is the Name of an assignment statement or a parameter of
5315 a procedure call, return the result almost unmodified since the
5316 RHS will have to be converted to our type in that case, unless
5317 the result type has a simpler size. Similarly, don't convert
5318 integral types that are the operands of an unchecked conversion
5319 since we need to ignore those conversions (for 'Valid).
5321 2. If we have a label (which doesn't have any well-defined type), a
5322 field or an error, return the result almost unmodified. Also don't
5323 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5324 its size since those are the cases where the front end may have the
5325 type wrong due to "instantiating" the unconstrained record with
5326 discriminant values. Similarly, if the two types are record types
5327 with the same name don't convert. This will be the case when we are
5328 converting from a packable version of a type to its original type and
5329 we need those conversions to be NOPs in order for assignments into
5330 these types to work properly.
5332 3. If the type is void or if we have no result, return error_mark_node
5333 to show we have no result.
5335 4. Finally, if the type of the result is already correct. */
5337 if (Present (Parent (gnat_node))
5338 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5339 && Name (Parent (gnat_node)) == gnat_node)
5340 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5341 && Name (Parent (gnat_node)) != gnat_node)
5342 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5343 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5344 && !AGGREGATE_TYPE_P (gnu_result_type)
5345 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5346 && !(TYPE_SIZE (gnu_result_type)
5347 && TYPE_SIZE (TREE_TYPE (gnu_result))
5348 && (AGGREGATE_TYPE_P (gnu_result_type)
5349 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5350 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5351 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5353 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5354 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5355 && (CONTAINS_PLACEHOLDER_P
5356 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5357 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5358 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5360 /* Remove padding only if the inner object is of self-referential
5361 size: in that case it must be an object of unconstrained type
5362 with a default discriminant and we want to avoid copying too
5364 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5365 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5366 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5367 (TREE_TYPE (gnu_result))))))
5368 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5372 else if (TREE_CODE (gnu_result) == LABEL_DECL
5373 || TREE_CODE (gnu_result) == FIELD_DECL
5374 || TREE_CODE (gnu_result) == ERROR_MARK
5375 || (TYPE_SIZE (gnu_result_type)
5376 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5377 && TREE_CODE (gnu_result) != INDIRECT_REF
5378 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5379 || ((TYPE_NAME (gnu_result_type)
5380 == TYPE_NAME (TREE_TYPE (gnu_result)))
5381 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5382 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5384 /* Remove any padding. */
5385 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5386 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5387 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5391 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5392 gnu_result = error_mark_node;
5394 else if (gnu_result_type != TREE_TYPE (gnu_result))
5395 gnu_result = convert (gnu_result_type, gnu_result);
5397 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5398 while ((TREE_CODE (gnu_result) == NOP_EXPR
5399 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5400 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5401 gnu_result = TREE_OPERAND (gnu_result, 0);
5406 /* Subroutine of above to push the exception label stack. GNU_STACK is
5407 a pointer to the stack to update and GNAT_LABEL, if present, is the
5408 label to push onto the stack. */
5411 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5413 tree gnu_label = (Present (gnat_label)
5414 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5417 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5420 /* Record the current code position in GNAT_NODE. */
5423 record_code_position (Node_Id gnat_node)
5425 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5427 add_stmt_with_node (stmt_stmt, gnat_node);
5428 save_gnu_tree (gnat_node, stmt_stmt, true);
5431 /* Insert the code for GNAT_NODE at the position saved for that node. */
5434 insert_code_for (Node_Id gnat_node)
5436 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5437 save_gnu_tree (gnat_node, NULL_TREE, true);
5440 /* Start a new statement group chained to the previous group. */
5443 start_stmt_group (void)
5445 struct stmt_group *group = stmt_group_free_list;
5447 /* First see if we can get one from the free list. */
5449 stmt_group_free_list = group->previous;
5451 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5453 group->previous = current_stmt_group;
5454 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5455 current_stmt_group = group;
5458 /* Add GNU_STMT to the current statement group. */
5461 add_stmt (tree gnu_stmt)
5463 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5466 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5469 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5471 if (Present (gnat_node))
5472 set_expr_location_from_node (gnu_stmt, gnat_node);
5473 add_stmt (gnu_stmt);
5476 /* Add a declaration statement for GNU_DECL to the current statement group.
5477 Get SLOC from Entity_Id. */
5480 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5482 tree type = TREE_TYPE (gnu_decl);
5483 tree gnu_stmt, gnu_init, t;
5485 /* If this is a variable that Gigi is to ignore, we may have been given
5486 an ERROR_MARK. So test for it. We also might have been given a
5487 reference for a renaming. So only do something for a decl. Also
5488 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5489 if (!DECL_P (gnu_decl)
5490 || (TREE_CODE (gnu_decl) == TYPE_DECL
5491 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5494 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5496 /* If we are global, we don't want to actually output the DECL_EXPR for
5497 this decl since we already have evaluated the expressions in the
5498 sizes and positions as globals and doing it again would be wrong. */
5499 if (global_bindings_p ())
5501 /* Mark everything as used to prevent node sharing with subprograms.
5502 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5503 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5504 mark_visited (&gnu_stmt);
5505 if (TREE_CODE (gnu_decl) == VAR_DECL
5506 || TREE_CODE (gnu_decl) == CONST_DECL)
5508 mark_visited (&DECL_SIZE (gnu_decl));
5509 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5510 mark_visited (&DECL_INITIAL (gnu_decl));
5512 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5513 if (TREE_CODE (gnu_decl) == TYPE_DECL
5514 && (TREE_CODE (type) == RECORD_TYPE
5515 || TREE_CODE (type) == UNION_TYPE
5516 || TREE_CODE (type) == QUAL_UNION_TYPE)
5517 && (t = TYPE_ADA_SIZE (type)))
5521 add_stmt_with_node (gnu_stmt, gnat_entity);
5523 /* If this is a variable and an initializer is attached to it, it must be
5524 valid for the context. Similar to init_const in create_var_decl_1. */
5525 if (TREE_CODE (gnu_decl) == VAR_DECL
5526 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5527 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5528 || (TREE_STATIC (gnu_decl)
5529 && !initializer_constant_valid_p (gnu_init,
5530 TREE_TYPE (gnu_init)))))
5532 /* If GNU_DECL has a padded type, convert it to the unpadded
5533 type so the assignment is done properly. */
5534 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5535 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5539 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5541 DECL_INITIAL (gnu_decl) = NULL_TREE;
5542 if (TREE_READONLY (gnu_decl))
5544 TREE_READONLY (gnu_decl) = 0;
5545 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5548 add_stmt_with_node (gnu_stmt, gnat_entity);
5552 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5555 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5557 if (TREE_VISITED (*tp))
5560 /* Don't mark a dummy type as visited because we want to mark its sizes
5561 and fields once it's filled in. */
5562 else if (!TYPE_IS_DUMMY_P (*tp))
5563 TREE_VISITED (*tp) = 1;
5566 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5571 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5574 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5575 void *data ATTRIBUTE_UNUSED)
5579 if (TREE_CODE (t) == SAVE_EXPR)
5580 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5585 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5586 sized gimplified. We use this to indicate all variable sizes and
5587 positions in global types may not be shared by any subprogram. */
5590 mark_visited (tree *tp)
5592 walk_tree (tp, mark_visited_r, NULL, NULL);
5595 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5596 set its location to that of GNAT_NODE if present. */
5599 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5601 if (Present (gnat_node))
5602 set_expr_location_from_node (gnu_cleanup, gnat_node);
5603 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5606 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5609 set_block_for_group (tree gnu_block)
5611 gcc_assert (!current_stmt_group->block);
5612 current_stmt_group->block = gnu_block;
5615 /* Return code corresponding to the current code group. It is normally
5616 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5617 BLOCK or cleanups were set. */
5620 end_stmt_group (void)
5622 struct stmt_group *group = current_stmt_group;
5623 tree gnu_retval = group->stmt_list;
5625 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5626 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5627 make a BIND_EXPR. Note that we nest in that because the cleanup may
5628 reference variables in the block. */
5629 if (gnu_retval == NULL_TREE)
5630 gnu_retval = alloc_stmt_list ();
5632 if (group->cleanups)
5633 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5636 if (current_stmt_group->block)
5637 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5638 gnu_retval, group->block);
5640 /* Remove this group from the stack and add it to the free list. */
5641 current_stmt_group = group->previous;
5642 group->previous = stmt_group_free_list;
5643 stmt_group_free_list = group;
5648 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5652 add_stmt_list (List_Id gnat_list)
5656 if (Present (gnat_list))
5657 for (gnat_node = First (gnat_list); Present (gnat_node);
5658 gnat_node = Next (gnat_node))
5659 add_stmt (gnat_to_gnu (gnat_node));
5662 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5663 If BINDING_P is true, push and pop a binding level around the list. */
5666 build_stmt_group (List_Id gnat_list, bool binding_p)
5668 start_stmt_group ();
5672 add_stmt_list (gnat_list);
5676 return end_stmt_group ();
5679 /* Push and pop routines for stacks. We keep a free list around so we
5680 don't waste tree nodes. */
5683 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5685 tree gnu_node = gnu_stack_free_list;
5689 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5690 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5691 TREE_PURPOSE (gnu_node) = gnu_purpose;
5692 TREE_VALUE (gnu_node) = gnu_value;
5695 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5697 *gnu_stack_ptr = gnu_node;
5701 pop_stack (tree *gnu_stack_ptr)
5703 tree gnu_node = *gnu_stack_ptr;
5705 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5706 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5707 gnu_stack_free_list = gnu_node;
5710 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5713 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5714 gimple_seq *post_p ATTRIBUTE_UNUSED)
5716 tree expr = *expr_p;
5719 if (IS_ADA_STMT (expr))
5720 return gnat_gimplify_stmt (expr_p);
5722 switch (TREE_CODE (expr))
5725 /* If this is for a scalar, just make a VAR_DECL for it. If for
5726 an aggregate, get a null pointer of the appropriate type and
5728 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5729 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5730 convert (build_pointer_type (TREE_TYPE (expr)),
5731 integer_zero_node));
5734 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5735 TREE_NO_WARNING (*expr_p) = 1;
5738 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5741 case UNCONSTRAINED_ARRAY_REF:
5742 /* We should only do this if we are just elaborating for side-effects,
5743 but we can't know that yet. */
5744 *expr_p = TREE_OPERAND (*expr_p, 0);
5748 op = TREE_OPERAND (expr, 0);
5750 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5751 be put into static memory. We know it's going to be readonly given
5752 the semantics we have and it's required to be static memory in
5753 the case when the reference is in an elaboration procedure. */
5754 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5756 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5758 TREE_READONLY (new_var) = 1;
5759 TREE_STATIC (new_var) = 1;
5760 TREE_ADDRESSABLE (new_var) = 1;
5761 DECL_INITIAL (new_var) = op;
5763 TREE_OPERAND (expr, 0) = new_var;
5764 recompute_tree_invariant_for_addr_expr (expr);
5768 /* If we are taking the address of a SAVE_EXPR, we are typically
5769 processing a misaligned argument to be passed by reference in a
5770 procedure call. We just mark the operand as addressable + not
5771 readonly here and let the common gimplifier code perform the
5772 temporary creation, initialization, and "instantiation" in place of
5773 the SAVE_EXPR in further operands, in particular in the copy back
5774 code inserted after the call. */
5775 else if (TREE_CODE (op) == SAVE_EXPR)
5777 TREE_ADDRESSABLE (op) = 1;
5778 TREE_READONLY (op) = 0;
5781 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5782 address of the selected operand when it is addressable. Besides, we
5783 also expect addressable_p to only let COND_EXPRs where both arms are
5784 addressable reach here. */
5785 else if (TREE_CODE (op) == COND_EXPR)
5788 /* Otherwise, if we are taking the address of something that is neither
5789 reference, declaration, or constant, make a variable for the operand
5790 here and then take its address. If we don't do it this way, we may
5791 confuse the gimplifier because it needs to know the variable is
5792 addressable at this point. This duplicates code in
5793 internal_get_tmp_var, which is unfortunate. */
5794 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5795 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5796 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5798 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5801 TREE_ADDRESSABLE (new_var) = 1;
5803 stmt = gimplify_assign (new_var, op, pre_p);
5804 if (EXPR_HAS_LOCATION (op))
5805 gimple_set_location (stmt, *EXPR_LOCUS (op));
5807 TREE_OPERAND (expr, 0) = new_var;
5808 recompute_tree_invariant_for_addr_expr (expr);
5812 /* ... fall through ... */
5815 return GS_UNHANDLED;
5819 /* Generate GIMPLE in place for the statement at *STMT_P. */
5821 static enum gimplify_status
5822 gnat_gimplify_stmt (tree *stmt_p)
5824 tree stmt = *stmt_p;
5826 switch (TREE_CODE (stmt))
5829 *stmt_p = STMT_STMT_STMT (stmt);
5834 tree gnu_start_label = create_artificial_label ();
5835 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5838 /* Set to emit the statements of the loop. */
5839 *stmt_p = NULL_TREE;
5841 /* We first emit the start label and then a conditional jump to
5842 the end label if there's a top condition, then the body of the
5843 loop, then a conditional branch to the end label, then the update,
5844 if any, and finally a jump to the start label and the definition
5845 of the end label. */
5846 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5850 if (LOOP_STMT_TOP_COND (stmt))
5851 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5852 LOOP_STMT_TOP_COND (stmt),
5859 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5861 if (LOOP_STMT_BOT_COND (stmt))
5862 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5863 LOOP_STMT_BOT_COND (stmt),
5870 if (LOOP_STMT_UPDATE (stmt))
5871 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5873 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5874 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5875 append_to_statement_list (t, stmt_p);
5877 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5884 /* Build a statement to jump to the corresponding end label, then
5885 see if it needs to be conditional. */
5886 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5887 if (EXIT_STMT_COND (stmt))
5888 *stmt_p = build3 (COND_EXPR, void_type_node,
5889 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5897 /* Force references to each of the entities in packages withed by GNAT_NODE.
5898 Operate recursively but check that we aren't elaborating something more
5901 This routine is exclusively called in type_annotate mode, to compute DDA
5902 information for types in withed units, for ASIS use. */
5905 elaborate_all_entities (Node_Id gnat_node)
5907 Entity_Id gnat_with_clause, gnat_entity;
5909 /* Process each unit only once. As we trace the context of all relevant
5910 units transitively, including generic bodies, we may encounter the
5911 same generic unit repeatedly. */
5912 if (!present_gnu_tree (gnat_node))
5913 save_gnu_tree (gnat_node, integer_zero_node, true);
5915 /* Save entities in all context units. A body may have an implicit_with
5916 on its own spec, if the context includes a child unit, so don't save
5918 for (gnat_with_clause = First (Context_Items (gnat_node));
5919 Present (gnat_with_clause);
5920 gnat_with_clause = Next (gnat_with_clause))
5921 if (Nkind (gnat_with_clause) == N_With_Clause
5922 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5923 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5925 elaborate_all_entities (Library_Unit (gnat_with_clause));
5927 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5929 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5930 Present (gnat_entity);
5931 gnat_entity = Next_Entity (gnat_entity))
5932 if (Is_Public (gnat_entity)
5933 && Convention (gnat_entity) != Convention_Intrinsic
5934 && Ekind (gnat_entity) != E_Package
5935 && Ekind (gnat_entity) != E_Package_Body
5936 && Ekind (gnat_entity) != E_Operator
5937 && !(IN (Ekind (gnat_entity), Type_Kind)
5938 && !Is_Frozen (gnat_entity))
5939 && !((Ekind (gnat_entity) == E_Procedure
5940 || Ekind (gnat_entity) == E_Function)
5941 && Is_Intrinsic_Subprogram (gnat_entity))
5942 && !IN (Ekind (gnat_entity), Named_Kind)
5943 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5944 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5946 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5949 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5951 /* Retrieve compilation unit node of generic body. */
5952 while (Present (gnat_body)
5953 && Nkind (gnat_body) != N_Compilation_Unit)
5954 gnat_body = Parent (gnat_body);
5956 /* If body is available, elaborate its context. */
5957 if (Present (gnat_body))
5958 elaborate_all_entities (gnat_body);
5962 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5963 elaborate_all_entities (Library_Unit (gnat_node));
5966 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5969 process_freeze_entity (Node_Id gnat_node)
5971 Entity_Id gnat_entity = Entity (gnat_node);
5975 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
5976 && present_gnu_tree (Declaration_Node (gnat_entity)))
5977 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
5979 /* If this is a package, need to generate code for the package. */
5980 if (Ekind (gnat_entity) == E_Package)
5983 (Parent (Corresponding_Body
5984 (Parent (Declaration_Node (gnat_entity)))));
5988 /* Check for old definition after the above call. This Freeze_Node
5989 might be for one its Itypes. */
5991 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
5993 /* If this entity has an Address representation clause, GNU_OLD is the
5994 address, so discard it here. */
5995 if (Present (Address_Clause (gnat_entity)))
5998 /* Don't do anything for class-wide types they are always
5999 transformed into their root type. */
6000 if (Ekind (gnat_entity) == E_Class_Wide_Type
6001 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
6002 && Present (Equivalent_Type (gnat_entity))))
6005 /* Don't do anything for subprograms that may have been elaborated before
6006 their freeze nodes. This can happen, for example because of an inner call
6007 in an instance body, or a previous compilation of a spec for inlining
6010 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6011 && (Ekind (gnat_entity) == E_Function
6012 || Ekind (gnat_entity) == E_Procedure))
6014 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6015 && Ekind (gnat_entity) == E_Subprogram_Type)))
6018 /* If we have a non-dummy type old tree, we have nothing to do, except
6019 aborting if this is the public view of a private type whose full view was
6020 not delayed, as this node was never delayed as it should have been. We
6021 let this happen for concurrent types and their Corresponding_Record_Type,
6022 however, because each might legitimately be elaborated before it's own
6023 freeze node, e.g. while processing the other. */
6025 && !(TREE_CODE (gnu_old) == TYPE_DECL
6026 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6028 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6029 && Present (Full_View (gnat_entity))
6030 && No (Freeze_Node (Full_View (gnat_entity))))
6031 || Is_Concurrent_Type (gnat_entity)
6032 || (IN (Ekind (gnat_entity), Record_Kind)
6033 && Is_Concurrent_Record_Type (gnat_entity)));
6037 /* Reset the saved tree, if any, and elaborate the object or type for real.
6038 If there is a full declaration, elaborate it and copy the type to
6039 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6040 a class wide type or subtype. */
6043 save_gnu_tree (gnat_entity, NULL_TREE, false);
6044 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6045 && Present (Full_View (gnat_entity))
6046 && present_gnu_tree (Full_View (gnat_entity)))
6047 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6048 if (Present (Class_Wide_Type (gnat_entity))
6049 && Class_Wide_Type (gnat_entity) != gnat_entity)
6050 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6053 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6054 && Present (Full_View (gnat_entity)))
6056 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6058 /* Propagate back-annotations from full view to partial view. */
6059 if (Unknown_Alignment (gnat_entity))
6060 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6062 if (Unknown_Esize (gnat_entity))
6063 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6065 if (Unknown_RM_Size (gnat_entity))
6066 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6068 /* The above call may have defined this entity (the simplest example
6069 of this is when we have a private enumeral type since the bounds
6070 will have the public view. */
6071 if (!present_gnu_tree (gnat_entity))
6072 save_gnu_tree (gnat_entity, gnu_new, false);
6073 if (Present (Class_Wide_Type (gnat_entity))
6074 && Class_Wide_Type (gnat_entity) != gnat_entity)
6075 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6078 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6080 /* If we've made any pointers to the old version of this type, we
6081 have to update them. */
6083 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6084 TREE_TYPE (gnu_new));
6087 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6088 N_Compilation_Unit. */
6091 process_inlined_subprograms (Node_Id gnat_node)
6093 Entity_Id gnat_entity;
6096 /* If we can inline, generate Gimple for all the inlined subprograms.
6097 Define the entity first so we set DECL_EXTERNAL. */
6099 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6100 Present (gnat_entity);
6101 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6103 gnat_body = Parent (Declaration_Node (gnat_entity));
6105 if (Nkind (gnat_body) != N_Subprogram_Body)
6107 /* ??? This really should always be Present. */
6108 if (No (Corresponding_Body (gnat_body)))
6112 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6115 if (Present (gnat_body))
6117 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6118 add_stmt (gnat_to_gnu (gnat_body));
6123 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6124 We make two passes, one to elaborate anything other than bodies (but
6125 we declare a function if there was no spec). The second pass
6126 elaborates the bodies.
6128 GNAT_END_LIST gives the element in the list past the end. Normally,
6129 this is Empty, but can be First_Real_Statement for a
6130 Handled_Sequence_Of_Statements.
6132 We make a complete pass through both lists if PASS1P is true, then make
6133 the second pass over both lists if PASS2P is true. The lists usually
6134 correspond to the public and private parts of a package. */
6137 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6138 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6140 List_Id gnat_decl_array[2];
6144 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6147 for (i = 0; i <= 1; i++)
6148 if (Present (gnat_decl_array[i]))
6149 for (gnat_decl = First (gnat_decl_array[i]);
6150 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6152 /* For package specs, we recurse inside the declarations,
6153 thus taking the two pass approach inside the boundary. */
6154 if (Nkind (gnat_decl) == N_Package_Declaration
6155 && (Nkind (Specification (gnat_decl)
6156 == N_Package_Specification)))
6157 process_decls (Visible_Declarations (Specification (gnat_decl)),
6158 Private_Declarations (Specification (gnat_decl)),
6159 Empty, true, false);
6161 /* Similarly for any declarations in the actions of a
6163 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6165 process_freeze_entity (gnat_decl);
6166 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6169 /* Package bodies with freeze nodes get their elaboration deferred
6170 until the freeze node, but the code must be placed in the right
6171 place, so record the code position now. */
6172 else if (Nkind (gnat_decl) == N_Package_Body
6173 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6174 record_code_position (gnat_decl);
6176 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6177 && Present (Library_Unit (gnat_decl))
6178 && Present (Freeze_Node
6181 (Library_Unit (gnat_decl)))))))
6182 record_code_position
6183 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6185 /* We defer most subprogram bodies to the second pass. */
6186 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6188 if (Acts_As_Spec (gnat_decl))
6190 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6192 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6193 && Ekind (gnat_subprog_id) != E_Generic_Function)
6194 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6198 /* For bodies and stubs that act as their own specs, the entity
6199 itself must be elaborated in the first pass, because it may
6200 be used in other declarations. */
6201 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6203 Node_Id gnat_subprog_id
6204 = Defining_Entity (Specification (gnat_decl));
6206 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6207 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6208 && Ekind (gnat_subprog_id) != E_Generic_Function)
6209 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6212 /* Concurrent stubs stand for the corresponding subprogram bodies,
6213 which are deferred like other bodies. */
6214 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6215 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6219 add_stmt (gnat_to_gnu (gnat_decl));
6222 /* Here we elaborate everything we deferred above except for package bodies,
6223 which are elaborated at their freeze nodes. Note that we must also
6224 go inside things (package specs and freeze nodes) the first pass did. */
6226 for (i = 0; i <= 1; i++)
6227 if (Present (gnat_decl_array[i]))
6228 for (gnat_decl = First (gnat_decl_array[i]);
6229 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6231 if (Nkind (gnat_decl) == N_Subprogram_Body
6232 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6233 || Nkind (gnat_decl) == N_Task_Body_Stub
6234 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6235 add_stmt (gnat_to_gnu (gnat_decl));
6237 else if (Nkind (gnat_decl) == N_Package_Declaration
6238 && (Nkind (Specification (gnat_decl)
6239 == N_Package_Specification)))
6240 process_decls (Visible_Declarations (Specification (gnat_decl)),
6241 Private_Declarations (Specification (gnat_decl)),
6242 Empty, false, true);
6244 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6245 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6249 /* Make a unary operation of kind CODE using build_unary_op, but guard
6250 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6251 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6252 the operation is to be performed in that type. GNAT_NODE is the gnat
6253 node conveying the source location for which the error should be
6257 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6260 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6262 operand = protect_multiple_eval (operand);
6264 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6265 operand, TYPE_MIN_VALUE (gnu_type)),
6266 build_unary_op (code, gnu_type, operand),
6267 CE_Overflow_Check_Failed, gnat_node);
6270 /* Make a binary operation of kind CODE using build_binary_op, but guard
6271 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6272 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6273 Usually the operation is to be performed in that type. GNAT_NODE is
6274 the GNAT node conveying the source location for which the error should
6278 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6279 tree right, Node_Id gnat_node)
6281 tree lhs = protect_multiple_eval (left);
6282 tree rhs = protect_multiple_eval (right);
6283 tree type_max = TYPE_MAX_VALUE (gnu_type);
6284 tree type_min = TYPE_MIN_VALUE (gnu_type);
6287 tree zero = convert (gnu_type, integer_zero_node);
6292 int precision = TYPE_PRECISION (gnu_type);
6294 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6296 /* Prefer a constant or known-positive rhs to simplify checks. */
6297 if (!TREE_CONSTANT (rhs)
6298 && commutative_tree_code (code)
6299 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6300 && tree_expr_nonnegative_p (lhs))))
6307 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6309 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6311 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6313 /* Try a few strategies that may be cheaper than the general
6314 code at the end of the function, if the rhs is not known.
6316 - Call library function for 64-bit multiplication (complex)
6317 - Widen, if input arguments are sufficiently small
6318 - Determine overflow using wrapped result for addition/subtraction. */
6320 if (!TREE_CONSTANT (rhs))
6322 /* Even for add/subtract double size to get another base type. */
6323 int needed_precision = precision * 2;
6325 if (code == MULT_EXPR && precision == 64)
6327 tree int_64 = gnat_type_for_size (64, 0);
6329 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6330 convert (int_64, lhs),
6331 convert (int_64, rhs)));
6334 else if (needed_precision <= BITS_PER_WORD
6335 || (code == MULT_EXPR
6336 && needed_precision <= LONG_LONG_TYPE_SIZE))
6338 tree wide_type = gnat_type_for_size (needed_precision, 0);
6340 tree wide_result = build_binary_op (code, wide_type,
6341 convert (wide_type, lhs),
6342 convert (wide_type, rhs));
6344 tree check = build_binary_op
6345 (TRUTH_ORIF_EXPR, integer_type_node,
6346 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6347 convert (wide_type, type_min)),
6348 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6349 convert (wide_type, type_max)));
6351 tree result = convert (gnu_type, wide_result);
6354 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6357 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6359 tree unsigned_type = gnat_type_for_size (precision, 1);
6360 tree wrapped_expr = convert
6361 (gnu_type, build_binary_op (code, unsigned_type,
6362 convert (unsigned_type, lhs),
6363 convert (unsigned_type, rhs)));
6365 tree result = convert
6366 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6368 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6369 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6370 tree check = build_binary_op
6371 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6372 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6373 integer_type_node, wrapped_expr, lhs));
6376 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6383 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6384 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6385 build_binary_op (MINUS_EXPR, gnu_type,
6388 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6389 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6390 build_binary_op (MINUS_EXPR, gnu_type,
6395 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6396 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6397 build_binary_op (PLUS_EXPR, gnu_type,
6400 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6401 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6402 build_binary_op (PLUS_EXPR, gnu_type,
6407 /* The check here is designed to be efficient if the rhs is constant,
6408 but it will work for any rhs by using integer division.
6409 Four different check expressions determine wether X * C overflows,
6412 C > 0 => X > type_max / C || X < type_min / C
6413 C == -1 => X == type_min
6414 C < -1 => X > type_min / C || X < type_max / C */
6416 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6417 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6419 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6420 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6421 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6422 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6423 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6425 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6426 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6427 build_int_cst (gnu_type, -1)),
6428 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6429 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6430 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6431 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6438 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6440 /* If we can fold the expression to a constant, just return it.
6441 The caller will deal with overflow, no need to generate a check. */
6442 if (TREE_CONSTANT (gnu_expr))
6445 check = fold_build3 (COND_EXPR, integer_type_node,
6446 rhs_lt_zero, check_neg, check_pos);
6448 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6451 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6452 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6453 which we have to check. GNAT_NODE is the GNAT node conveying the source
6454 location for which the error should be signaled. */
6457 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6459 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6460 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6461 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6462 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6464 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6465 This can for example happen when translating 'Val or 'Value. */
6466 if (gnu_compare_type == gnu_range_type)
6469 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6470 we can't do anything since we might be truncating the bounds. No
6471 check is needed in this case. */
6472 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6473 && (TYPE_PRECISION (gnu_compare_type)
6474 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6477 /* Checked expressions must be evaluated only once. */
6478 gnu_expr = protect_multiple_eval (gnu_expr);
6480 /* There's no good type to use here, so we might as well use
6481 integer_type_node. Note that the form of the check is
6482 (not (expr >= lo)) or (not (expr <= hi))
6483 the reason for this slightly convoluted form is that NaNs
6484 are not considered to be in range in the float case. */
6486 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6488 (build_binary_op (GE_EXPR, integer_type_node,
6489 convert (gnu_compare_type, gnu_expr),
6490 convert (gnu_compare_type, gnu_low))),
6492 (build_binary_op (LE_EXPR, integer_type_node,
6493 convert (gnu_compare_type, gnu_expr),
6494 convert (gnu_compare_type,
6496 gnu_expr, CE_Range_Check_Failed, gnat_node);
6499 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6500 we are about to index, GNU_EXPR is the index expression to be checked,
6501 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6502 has to be checked. Note that for index checking we cannot simply use the
6503 emit_range_check function (although very similar code needs to be generated
6504 in both cases) since for index checking the array type against which we are
6505 checking the indices may be unconstrained and consequently we need to get
6506 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6507 The place where we need to do that is in subprograms having unconstrained
6508 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6509 location for which the error should be signaled. */
6512 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6513 tree gnu_high, Node_Id gnat_node)
6515 tree gnu_expr_check;
6517 /* Checked expressions must be evaluated only once. */
6518 gnu_expr = protect_multiple_eval (gnu_expr);
6520 /* Must do this computation in the base type in case the expression's
6521 type is an unsigned subtypes. */
6522 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6524 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6525 the object we are handling. */
6526 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6527 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6529 /* There's no good type to use here, so we might as well use
6530 integer_type_node. */
6532 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6533 build_binary_op (LT_EXPR, integer_type_node,
6535 convert (TREE_TYPE (gnu_expr_check),
6537 build_binary_op (GT_EXPR, integer_type_node,
6539 convert (TREE_TYPE (gnu_expr_check),
6541 gnu_expr, CE_Index_Check_Failed, gnat_node);
6544 /* GNU_COND contains the condition corresponding to an access, discriminant or
6545 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6546 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6547 REASON is the code that says why the exception was raised. GNAT_NODE is
6548 the GNAT node conveying the source location for which the error should be
6552 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6555 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6557 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6558 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6559 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6562 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6563 we don't need to evaluate it just for the check. */
6564 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6566 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6567 we will repeatedly do the test and, at compile time, we will repeatedly
6568 visit it during unsharing, which leads to an exponential explosion. */
6569 return save_expr (gnu_result);
6572 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6573 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6574 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6575 float to integer conversion with truncation; otherwise round.
6576 GNAT_NODE is the GNAT node conveying the source location for which the
6577 error should be signaled. */
6580 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6581 bool rangep, bool truncatep, Node_Id gnat_node)
6583 tree gnu_type = get_unpadded_type (gnat_type);
6584 tree gnu_in_type = TREE_TYPE (gnu_expr);
6585 tree gnu_in_basetype = get_base_type (gnu_in_type);
6586 tree gnu_base_type = get_base_type (gnu_type);
6587 tree gnu_result = gnu_expr;
6589 /* If we are not doing any checks, the output is an integral type, and
6590 the input is not a floating type, just do the conversion. This
6591 shortcut is required to avoid problems with packed array types
6592 and simplifies code in all cases anyway. */
6593 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6594 && !FLOAT_TYPE_P (gnu_in_type))
6595 return convert (gnu_type, gnu_expr);
6597 /* First convert the expression to its base type. This
6598 will never generate code, but makes the tests below much simpler.
6599 But don't do this if converting from an integer type to an unconstrained
6600 array type since then we need to get the bounds from the original
6602 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6603 gnu_result = convert (gnu_in_basetype, gnu_result);
6605 /* If overflow checks are requested, we need to be sure the result will
6606 fit in the output base type. But don't do this if the input
6607 is integer and the output floating-point. */
6609 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6611 /* Ensure GNU_EXPR only gets evaluated once. */
6612 tree gnu_input = protect_multiple_eval (gnu_result);
6613 tree gnu_cond = integer_zero_node;
6614 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6615 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6616 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6617 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6619 /* Convert the lower bounds to signed types, so we're sure we're
6620 comparing them properly. Likewise, convert the upper bounds
6621 to unsigned types. */
6622 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6623 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6625 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6626 && !TYPE_UNSIGNED (gnu_in_basetype))
6627 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6629 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6630 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6632 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6633 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6635 /* Check each bound separately and only if the result bound
6636 is tighter than the bound on the input type. Note that all the
6637 types are base types, so the bounds must be constant. Also,
6638 the comparison is done in the base type of the input, which
6639 always has the proper signedness. First check for input
6640 integer (which means output integer), output float (which means
6641 both float), or mixed, in which case we always compare.
6642 Note that we have to do the comparison which would *fail* in the
6643 case of an error since if it's an FP comparison and one of the
6644 values is a NaN or Inf, the comparison will fail. */
6645 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6646 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6647 : (FLOAT_TYPE_P (gnu_base_type)
6648 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6649 TREE_REAL_CST (gnu_out_lb))
6653 (build_binary_op (GE_EXPR, integer_type_node,
6654 gnu_input, convert (gnu_in_basetype,
6657 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6658 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6659 : (FLOAT_TYPE_P (gnu_base_type)
6660 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6661 TREE_REAL_CST (gnu_in_lb))
6664 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6666 (build_binary_op (LE_EXPR, integer_type_node,
6668 convert (gnu_in_basetype,
6671 if (!integer_zerop (gnu_cond))
6672 gnu_result = emit_check (gnu_cond, gnu_input,
6673 CE_Overflow_Check_Failed, gnat_node);
6676 /* Now convert to the result base type. If this is a non-truncating
6677 float-to-integer conversion, round. */
6678 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6681 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6682 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6683 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6684 const struct real_format *fmt;
6686 /* The following calculations depend on proper rounding to even
6687 of each arithmetic operation. In order to prevent excess
6688 precision from spoiling this property, use the widest hardware
6689 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6691 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6693 /* FIXME: Should not have padding in the first place. */
6694 if (TREE_CODE (calc_type) == RECORD_TYPE
6695 && TYPE_IS_PADDING_P (calc_type))
6696 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6698 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6699 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6700 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6701 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6702 half_minus_pred_half);
6703 gnu_pred_half = build_real (calc_type, pred_half);
6705 /* If the input is strictly negative, subtract this value
6706 and otherwise add it from the input. For 0.5, the result
6707 is exactly between 1.0 and the machine number preceding 1.0
6708 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6709 will round to 1.0, while all other number with an absolute
6710 value less than 0.5 round to 0.0. For larger numbers exactly
6711 halfway between integers, rounding will always be correct as
6712 the true mathematical result will be closer to the higher
6713 integer compared to the lower one. So, this constant works
6714 for all floating-point numbers.
6716 The reason to use the same constant with subtract/add instead
6717 of a positive and negative constant is to allow the comparison
6718 to be scheduled in parallel with retrieval of the constant and
6719 conversion of the input to the calc_type (if necessary). */
6721 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6722 gnu_saved_result = save_expr (gnu_result);
6723 gnu_conv = convert (calc_type, gnu_saved_result);
6724 gnu_comp = build2 (GE_EXPR, integer_type_node,
6725 gnu_saved_result, gnu_zero);
6727 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6728 gnu_subtract_pred_half
6729 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6730 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6731 gnu_add_pred_half, gnu_subtract_pred_half);
6734 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6735 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6736 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6737 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6739 gnu_result = convert (gnu_base_type, gnu_result);
6741 /* Finally, do the range check if requested. Note that if the
6742 result type is a modular type, the range check is actually
6743 an overflow check. */
6746 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6747 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6748 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6750 return convert (gnu_type, gnu_result);
6753 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6756 smaller_packable_type_p (tree type, tree record_type)
6760 /* We're not interested in variants here. */
6761 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6764 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6765 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6768 size = TYPE_SIZE (type);
6769 rsize = TYPE_SIZE (record_type);
6771 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6774 return tree_int_cst_lt (size, rsize) != 0;
6777 /* Return true if GNU_EXPR can be directly addressed. This is the case
6778 unless it is an expression involving computation or if it involves a
6779 reference to a bitfield or to an object not sufficiently aligned for
6780 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6781 be directly addressed as an object of this type.
6783 *** Notes on addressability issues in the Ada compiler ***
6785 This predicate is necessary in order to bridge the gap between Gigi
6786 and the middle-end about addressability of GENERIC trees. A tree
6787 is said to be addressable if it can be directly addressed, i.e. if
6788 its address can be taken, is a multiple of the type's alignment on
6789 strict-alignment architectures and returns the first storage unit
6790 assigned to the object represented by the tree.
6792 In the C family of languages, everything is in practice addressable
6793 at the language level, except for bit-fields. This means that these
6794 compilers will take the address of any tree that doesn't represent
6795 a bit-field reference and expect the result to be the first storage
6796 unit assigned to the object. Even in cases where this will result
6797 in unaligned accesses at run time, nothing is supposed to be done
6798 and the program is considered as erroneous instead (see PR c/18287).
6800 The implicit assumptions made in the middle-end are in keeping with
6801 the C viewpoint described above:
6802 - the address of a bit-field reference is supposed to be never
6803 taken; the compiler (generally) will stop on such a construct,
6804 - any other tree is addressable if it is formally addressable,
6805 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6807 In Ada, the viewpoint is the opposite one: nothing is addressable
6808 at the language level unless explicitly declared so. This means
6809 that the compiler will both make sure that the trees representing
6810 references to addressable ("aliased" in Ada parlance) objects are
6811 addressable and make no real attempts at ensuring that the trees
6812 representing references to non-addressable objects are addressable.
6814 In the first case, Ada is effectively equivalent to C and handing
6815 down the direct result of applying ADDR_EXPR to these trees to the
6816 middle-end works flawlessly. In the second case, Ada cannot afford
6817 to consider the program as erroneous if the address of trees that
6818 are not addressable is requested for technical reasons, unlike C;
6819 as a consequence, the Ada compiler must arrange for either making
6820 sure that this address is not requested in the middle-end or for
6821 compensating by inserting temporaries if it is requested in Gigi.
6823 The first goal can be achieved because the middle-end should not
6824 request the address of non-addressable trees on its own; the only
6825 exception is for the invocation of low-level block operations like
6826 memcpy, for which the addressability requirements are lower since
6827 the type's alignment can be disregarded. In practice, this means
6828 that Gigi must make sure that such operations cannot be applied to
6829 non-BLKmode bit-fields.
6831 The second goal is achieved by means of the addressable_p predicate
6832 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6833 They will be turned during gimplification into proper temporaries
6834 whose address will be used in lieu of that of the original tree. */
6837 addressable_p (tree gnu_expr, tree gnu_type)
6839 /* The size of the real type of the object must not be smaller than
6840 that of the expected type, otherwise an indirect access in the
6841 latter type would be larger than the object. Only records need
6842 to be considered in practice. */
6844 && TREE_CODE (gnu_type) == RECORD_TYPE
6845 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6848 switch (TREE_CODE (gnu_expr))
6854 /* All DECLs are addressable: if they are in a register, we can force
6858 case UNCONSTRAINED_ARRAY_REF:
6869 /* We accept &COND_EXPR as soon as both operands are addressable and
6870 expect the outcome to be the address of the selected operand. */
6871 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6872 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6875 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6876 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6877 the field is sufficiently aligned, in case it is subject
6878 to a pragma Component_Alignment. But we don't need to
6879 check the alignment of the containing record, as it is
6880 guaranteed to be not smaller than that of its most
6881 aligned field that is not a bit-field. */
6882 && (!STRICT_ALIGNMENT
6883 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6884 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6885 /* The field of a padding record is always addressable. */
6886 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6887 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6889 case ARRAY_REF: case ARRAY_RANGE_REF:
6890 case REALPART_EXPR: case IMAGPART_EXPR:
6892 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6895 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6896 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6898 case VIEW_CONVERT_EXPR:
6900 /* This is addressable if we can avoid a copy. */
6901 tree type = TREE_TYPE (gnu_expr);
6902 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6903 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6904 && (!STRICT_ALIGNMENT
6905 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6906 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6907 || ((TYPE_MODE (type) == BLKmode
6908 || TYPE_MODE (inner_type) == BLKmode)
6909 && (!STRICT_ALIGNMENT
6910 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6911 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6912 || TYPE_ALIGN_OK (type)
6913 || TYPE_ALIGN_OK (inner_type))))
6914 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6922 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6923 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6924 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6927 process_type (Entity_Id gnat_entity)
6930 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6933 /* If we are to delay elaboration of this type, just do any
6934 elaborations needed for expressions within the declaration and
6935 make a dummy type entry for this node and its Full_View (if
6936 any) in case something points to it. Don't do this if it
6937 has already been done (the only way that can happen is if
6938 the private completion is also delayed). */
6939 if (Present (Freeze_Node (gnat_entity))
6940 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6941 && Present (Full_View (gnat_entity))
6942 && Freeze_Node (Full_View (gnat_entity))
6943 && !present_gnu_tree (Full_View (gnat_entity))))
6945 elaborate_entity (gnat_entity);
6949 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6950 save_gnu_tree (gnat_entity, gnu_decl, false);
6951 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6952 && Present (Full_View (gnat_entity)))
6953 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6959 /* If we saved away a dummy type for this node it means that this
6960 made the type that corresponds to the full type of an incomplete
6961 type. Clear that type for now and then update the type in the
6965 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6966 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6968 save_gnu_tree (gnat_entity, NULL_TREE, false);
6971 /* Now fully elaborate the type. */
6972 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
6973 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
6975 /* If we have an old type and we've made pointers to this type,
6976 update those pointers. */
6978 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6979 TREE_TYPE (gnu_new));
6981 /* If this is a record type corresponding to a task or protected type
6982 that is a completion of an incomplete type, perform a similar update
6983 on the type. ??? Including protected types here is a guess. */
6984 if (IN (Ekind (gnat_entity), Record_Kind)
6985 && Is_Concurrent_Record_Type (gnat_entity)
6986 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
6989 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
6991 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6993 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
6996 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
6997 TREE_TYPE (gnu_new));
7001 /* GNAT_ENTITY is the type of the resulting constructors,
7002 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7003 and GNU_TYPE is the GCC type of the corresponding record.
7005 Return a CONSTRUCTOR to build the record. */
7008 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7010 tree gnu_list, gnu_result;
7012 /* We test for GNU_FIELD being empty in the case where a variant
7013 was the last thing since we don't take things off GNAT_ASSOC in
7014 that case. We check GNAT_ASSOC in case we have a variant, but it
7017 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7018 gnat_assoc = Next (gnat_assoc))
7020 Node_Id gnat_field = First (Choices (gnat_assoc));
7021 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7022 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7024 /* The expander is supposed to put a single component selector name
7025 in every record component association. */
7026 gcc_assert (No (Next (gnat_field)));
7028 /* Ignore fields that have Corresponding_Discriminants since we'll
7029 be setting that field in the parent. */
7030 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7031 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7034 /* Also ignore discriminants of Unchecked_Unions. */
7035 else if (Is_Unchecked_Union (gnat_entity)
7036 && Ekind (Entity (gnat_field)) == E_Discriminant)
7039 /* Before assigning a value in an aggregate make sure range checks
7040 are done if required. Then convert to the type of the field. */
7041 if (Do_Range_Check (Expression (gnat_assoc)))
7042 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7044 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7046 /* Add the field and expression to the list. */
7047 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7050 gnu_result = extract_values (gnu_list, gnu_type);
7052 #ifdef ENABLE_CHECKING
7056 /* Verify every entry in GNU_LIST was used. */
7057 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7058 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7065 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7066 the first element of an array aggregate. It may itself be an aggregate.
7067 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7068 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7069 for range checking. */
7072 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7073 Entity_Id gnat_component_type)
7075 tree gnu_expr_list = NULL_TREE;
7076 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7079 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7081 /* If the expression is itself an array aggregate then first build the
7082 innermost constructor if it is part of our array (multi-dimensional
7084 if (Nkind (gnat_expr) == N_Aggregate
7085 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7086 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7087 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7088 TREE_TYPE (gnu_array_type),
7089 gnat_component_type);
7092 gnu_expr = gnat_to_gnu (gnat_expr);
7094 /* Before assigning the element to the array, make sure it is
7096 if (Do_Range_Check (gnat_expr))
7097 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7101 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7104 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7107 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7110 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7111 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7112 of the associations that are from RECORD_TYPE. If we see an internal
7113 record, make a recursive call to fill it in as well. */
7116 extract_values (tree values, tree record_type)
7118 tree result = NULL_TREE;
7121 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7125 /* _Parent is an internal field, but may have values in the aggregate,
7126 so check for values first. */
7127 if ((tem = purpose_member (field, values)))
7129 value = TREE_VALUE (tem);
7130 TREE_ADDRESSABLE (tem) = 1;
7133 else if (DECL_INTERNAL_P (field))
7135 value = extract_values (values, TREE_TYPE (field));
7136 if (TREE_CODE (value) == CONSTRUCTOR
7137 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7141 /* If we have a record subtype, the names will match, but not the
7142 actual FIELD_DECLs. */
7143 for (tem = values; tem; tem = TREE_CHAIN (tem))
7144 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7146 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7147 TREE_ADDRESSABLE (tem) = 1;
7153 result = tree_cons (field, value, result);
7156 return gnat_build_constructor (record_type, nreverse (result));
7159 /* EXP is to be treated as an array or record. Handle the cases when it is
7160 an access object and perform the required dereferences. */
7163 maybe_implicit_deref (tree exp)
7165 /* If the type is a pointer, dereference it. */
7167 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7168 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7170 /* If we got a padded type, remove it too. */
7171 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7172 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7173 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7178 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7181 protect_multiple_eval (tree exp)
7183 tree type = TREE_TYPE (exp);
7185 /* If this has no side effects, we don't need to do anything. */
7186 if (!TREE_SIDE_EFFECTS (exp))
7189 /* If it is a conversion, protect what's inside the conversion.
7190 Similarly, if we're indirectly referencing something, we only
7191 actually need to protect the address since the data itself can't
7192 change in these situations. */
7193 else if (TREE_CODE (exp) == NON_LVALUE_EXPR
7194 || CONVERT_EXPR_P (exp)
7195 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7196 || TREE_CODE (exp) == INDIRECT_REF
7197 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7198 return build1 (TREE_CODE (exp), type,
7199 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7201 /* If EXP is a fat pointer or something that can be placed into a register,
7202 just make a SAVE_EXPR. */
7203 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7204 return save_expr (exp);
7206 /* Otherwise, dereference, protect the address, and re-reference. */
7209 build_unary_op (INDIRECT_REF, type,
7210 save_expr (build_unary_op (ADDR_EXPR,
7211 build_reference_type (type),
7215 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7216 handle our own nodes and we take extra arguments. FORCE says whether to
7217 force evaluation of everything. We set SUCCESS to true unless we walk
7218 through something we don't know how to stabilize. */
7221 maybe_stabilize_reference (tree ref, bool force, bool *success)
7223 tree type = TREE_TYPE (ref);
7224 enum tree_code code = TREE_CODE (ref);
7227 /* Assume we'll success unless proven otherwise. */
7236 /* No action is needed in this case. */
7242 case FIX_TRUNC_EXPR:
7243 case VIEW_CONVERT_EXPR:
7245 = build1 (code, type,
7246 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7251 case UNCONSTRAINED_ARRAY_REF:
7252 result = build1 (code, type,
7253 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7258 result = build3 (COMPONENT_REF, type,
7259 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7261 TREE_OPERAND (ref, 1), NULL_TREE);
7265 result = build3 (BIT_FIELD_REF, type,
7266 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7268 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7270 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7275 case ARRAY_RANGE_REF:
7276 result = build4 (code, type,
7277 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7279 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7281 NULL_TREE, NULL_TREE);
7285 result = gnat_stabilize_reference_1 (ref, force);
7289 /* This generates better code than the scheme in protect_multiple_eval
7290 because large objects will be returned via invisible reference in
7291 most ABIs so the temporary will directly be filled by the callee. */
7292 result = gnat_stabilize_reference_1 (ref, force);
7296 /* Constructors with 1 element are used extensively to formally
7297 convert objects to special wrapping types. */
7298 if (TREE_CODE (type) == RECORD_TYPE
7299 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7302 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7304 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7306 = build_constructor_single (type, index,
7307 gnat_stabilize_reference_1 (value,
7318 ref = error_mark_node;
7320 /* ... fall through to failure ... */
7322 /* If arg isn't a kind of lvalue we recognize, make no change.
7323 Caller should recognize the error for an invalid lvalue. */
7329 TREE_READONLY (result) = TREE_READONLY (ref);
7331 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7332 expression may not be sustained across some paths, such as the way via
7333 build1 for INDIRECT_REF. We re-populate those flags here for the general
7334 case, which is consistent with the GCC version of this routine.
7336 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7337 paths introduce side effects where there was none initially (e.g. calls
7338 to save_expr), and we also want to keep track of that. */
7340 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7341 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7346 /* Wrapper around maybe_stabilize_reference, for common uses without
7347 lvalue restrictions and without need to examine the success
7351 gnat_stabilize_reference (tree ref, bool force)
7354 return maybe_stabilize_reference (ref, force, &dummy);
7357 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7358 arg to force a SAVE_EXPR for everything. */
7361 gnat_stabilize_reference_1 (tree e, bool force)
7363 enum tree_code code = TREE_CODE (e);
7364 tree type = TREE_TYPE (e);
7367 /* We cannot ignore const expressions because it might be a reference
7368 to a const array but whose index contains side-effects. But we can
7369 ignore things that are actual constant or that already have been
7370 handled by this function. */
7372 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7375 switch (TREE_CODE_CLASS (code))
7377 case tcc_exceptional:
7379 case tcc_declaration:
7380 case tcc_comparison:
7382 case tcc_expression:
7385 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7386 fat pointer. This may be more efficient, but will also allow
7387 us to more easily find the match for the PLACEHOLDER_EXPR. */
7388 if (code == COMPONENT_REF
7389 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7390 result = build3 (COMPONENT_REF, type,
7391 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7393 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7394 else if (TREE_SIDE_EFFECTS (e) || force)
7395 return save_expr (e);
7401 /* Constants need no processing. In fact, we should never reach
7406 /* Recursively stabilize each operand. */
7407 result = build2 (code, type,
7408 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7409 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7414 /* Recursively stabilize each operand. */
7415 result = build1 (code, type,
7416 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7424 TREE_READONLY (result) = TREE_READONLY (e);
7426 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7427 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7431 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7432 location and false if it doesn't. In the former case, set the Gigi global
7433 variable REF_FILENAME to the simple debug file name as given by sinput. */
7436 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7438 if (Sloc == No_Location)
7441 if (Sloc <= Standard_Location)
7443 *locus = BUILTINS_LOCATION;
7448 Source_File_Index file = Get_Source_File_Index (Sloc);
7449 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7450 Column_Number column = Get_Column_Number (Sloc);
7451 struct line_map *map = &line_table->maps[file - 1];
7453 /* Translate the location according to the line-map.h formula. */
7454 *locus = map->start_location
7455 + ((line - map->to_line) << map->column_bits)
7456 + (column & ((1 << map->column_bits) - 1));
7460 = IDENTIFIER_POINTER
7462 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7467 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7468 don't do anything if it doesn't correspond to a source location. */
7471 set_expr_location_from_node (tree node, Node_Id gnat_node)
7475 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7478 SET_EXPR_LOCATION (node, locus);
7481 /* Return a colon-separated list of encodings contained in encoded Ada
7485 extract_encoding (const char *name)
7487 char *encoding = GGC_NEWVEC (char, strlen (name));
7488 get_encoding (name, encoding);
7492 /* Extract the Ada name from an encoded name. */
7495 decode_name (const char *name)
7497 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7498 __gnat_decode (name, decoded, 0);
7502 /* Post an error message. MSG is the error message, properly annotated.
7503 NODE is the node at which to post the error and the node to use for the
7504 "&" substitution. */
7507 post_error (const char *msg, Node_Id node)
7509 String_Template temp;
7512 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7513 fp.Array = msg, fp.Bounds = &temp;
7515 Error_Msg_N (fp, node);
7518 /* Similar, but NODE is the node at which to post the error and ENT
7519 is the node to use for the "&" substitution. */
7522 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7524 String_Template temp;
7527 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7528 fp.Array = msg, fp.Bounds = &temp;
7530 Error_Msg_NE (fp, node, ent);
7533 /* Similar, but NODE is the node at which to post the error, ENT is the node
7534 to use for the "&" substitution, and N is the number to use for the ^. */
7537 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7539 String_Template temp;
7542 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7543 fp.Array = msg, fp.Bounds = &temp;
7544 Error_Msg_Uint_1 = UI_From_Int (n);
7547 Error_Msg_NE (fp, node, ent);
7550 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7551 number to write. If the tree represents a constant that fits within
7552 a host integer, the text inside curly brackets in MSG will be output
7553 (presumably including a '^'). Otherwise that text will not be output
7554 and the text inside square brackets will be output instead. */
7557 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7559 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7560 String_Template temp = {1, 0};
7562 char start_yes, end_yes, start_no, end_no;
7566 fp.Array = newmsg, fp.Bounds = &temp;
7568 if (host_integerp (t, 1)
7569 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7572 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7576 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7577 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7580 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7582 for (p = msg, q = newmsg; *p; p++)
7584 if (*p == start_yes)
7585 for (p++; *p != end_yes; p++)
7587 else if (*p == start_no)
7588 for (p++; *p != end_no; p++)
7596 temp.High_Bound = strlen (newmsg);
7598 Error_Msg_NE (fp, node, ent);
7601 /* Similar to post_error_ne_tree, except that NUM is a second
7602 integer to write in the message. */
7605 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7608 Error_Msg_Uint_2 = UI_From_Int (num);
7609 post_error_ne_tree (msg, node, ent, t);
7612 /* Initialize the table that maps GNAT codes to GCC codes for simple
7613 binary and unary operations. */
7616 init_code_table (void)
7618 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7619 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7621 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7622 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7623 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7624 gnu_codes[N_Op_Eq] = EQ_EXPR;
7625 gnu_codes[N_Op_Ne] = NE_EXPR;
7626 gnu_codes[N_Op_Lt] = LT_EXPR;
7627 gnu_codes[N_Op_Le] = LE_EXPR;
7628 gnu_codes[N_Op_Gt] = GT_EXPR;
7629 gnu_codes[N_Op_Ge] = GE_EXPR;
7630 gnu_codes[N_Op_Add] = PLUS_EXPR;
7631 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7632 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7633 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7634 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7635 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7636 gnu_codes[N_Op_Abs] = ABS_EXPR;
7637 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7638 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7639 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7640 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7641 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7642 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7645 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7649 get_exception_label (char kind)
7651 if (kind == N_Raise_Constraint_Error)
7652 return TREE_VALUE (gnu_constraint_error_label_stack);
7653 else if (kind == N_Raise_Storage_Error)
7654 return TREE_VALUE (gnu_storage_error_label_stack);
7655 else if (kind == N_Raise_Program_Error)
7656 return TREE_VALUE (gnu_program_error_label_stack);
7661 #include "gt-ada-trans.h"