1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2010, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
56 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
57 for fear of running out of stack space. If we need more, we use xmalloc
59 #define ALLOCA_THRESHOLD 1000
61 /* Let code below know whether we are targetting VMS without need of
62 intrusive preprocessor directives. */
63 #ifndef TARGET_ABI_OPEN_VMS
64 #define TARGET_ABI_OPEN_VMS 0
67 /* For efficient float-to-int rounding, it is necessary to know whether
68 floating-point arithmetic may use wider intermediate results. When
69 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
70 that arithmetic does not widen if double precision is emulated. */
71 #ifndef FP_ARITH_MAY_WIDEN
72 #if defined(HAVE_extendsfdf2)
73 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
75 #define FP_ARITH_MAY_WIDEN 0
79 /* Pointers to front-end tables accessed through macros. */
80 struct Node *Nodes_Ptr;
81 Node_Id *Next_Node_Ptr;
82 Node_Id *Prev_Node_Ptr;
83 struct Elist_Header *Elists_Ptr;
84 struct Elmt_Item *Elmts_Ptr;
85 struct String_Entry *Strings_Ptr;
86 Char_Code *String_Chars_Ptr;
87 struct List_Header *List_Headers_Ptr;
89 /* Highest number in the front-end node table. */
92 /* Current node being treated, in case abort called. */
93 Node_Id error_gnat_node;
95 /* True when gigi is being called on an analyzed but unexpanded
96 tree, and the only purpose of the call is to properly annotate
97 types with representation information. */
98 bool type_annotate_only;
100 /* Current filename without path. */
101 const char *ref_filename;
103 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
104 of unconstrained array IN parameters to avoid emitting a great deal of
105 redundant instructions to recompute them each time. */
106 struct GTY (()) parm_attr_d {
107 int id; /* GTY doesn't like Entity_Id. */
114 typedef struct parm_attr_d *parm_attr;
116 DEF_VEC_P(parm_attr);
117 DEF_VEC_ALLOC_P(parm_attr,gc);
119 struct GTY(()) language_function {
120 VEC(parm_attr,gc) *parm_attr_cache;
123 #define f_parm_attr_cache \
124 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
126 /* A structure used to gather together information about a statement group.
127 We use this to gather related statements, for example the "then" part
128 of a IF. In the case where it represents a lexical scope, we may also
129 have a BLOCK node corresponding to it and/or cleanups. */
131 struct GTY((chain_next ("%h.previous"))) stmt_group {
132 struct stmt_group *previous; /* Previous code group. */
133 tree stmt_list; /* List of statements for this code group. */
134 tree block; /* BLOCK for this code group, if any. */
135 tree cleanups; /* Cleanups for this code group, if any. */
138 static GTY(()) struct stmt_group *current_stmt_group;
140 /* List of unused struct stmt_group nodes. */
141 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
143 /* A structure used to record information on elaboration procedures
144 we've made and need to process.
146 ??? gnat_node should be Node_Id, but gengtype gets confused. */
148 struct GTY((chain_next ("%h.next"))) elab_info {
149 struct elab_info *next; /* Pointer to next in chain. */
150 tree elab_proc; /* Elaboration procedure. */
151 int gnat_node; /* The N_Compilation_Unit. */
154 static GTY(()) struct elab_info *elab_info_list;
156 /* Free list of TREE_LIST nodes used for stacks. */
157 static GTY((deletable)) tree gnu_stack_free_list;
159 /* List of TREE_LIST nodes representing a stack of exception pointer
160 variables. TREE_VALUE is the VAR_DECL that stores the address of
161 the raised exception. Nonzero means we are in an exception
162 handler. Not used in the zero-cost case. */
163 static GTY(()) tree gnu_except_ptr_stack;
165 /* List of TREE_LIST nodes used to store the current elaboration procedure
166 decl. TREE_VALUE is the decl. */
167 static GTY(()) tree gnu_elab_proc_stack;
169 /* Variable that stores a list of labels to be used as a goto target instead of
170 a return in some functions. See processing for N_Subprogram_Body. */
171 static GTY(()) tree gnu_return_label_stack;
173 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
174 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
175 static GTY(()) tree gnu_loop_label_stack;
177 /* List of TREE_LIST nodes representing labels for switch statements.
178 TREE_VALUE of each entry is the label at the end of the switch. */
179 static GTY(()) tree gnu_switch_label_stack;
181 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
182 static GTY(()) tree gnu_constraint_error_label_stack;
183 static GTY(()) tree gnu_storage_error_label_stack;
184 static GTY(()) tree gnu_program_error_label_stack;
186 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
187 static enum tree_code gnu_codes[Number_Node_Kinds];
189 static void init_code_table (void);
190 static void Compilation_Unit_to_gnu (Node_Id);
191 static void record_code_position (Node_Id);
192 static void insert_code_for (Node_Id);
193 static void add_cleanup (tree, Node_Id);
194 static tree unshare_save_expr (tree *, int *, void *);
195 static void add_stmt_list (List_Id);
196 static void push_exception_label_stack (tree *, Entity_Id);
197 static tree build_stmt_group (List_Id, bool);
198 static void push_stack (tree *, tree, tree);
199 static void pop_stack (tree *);
200 static enum gimplify_status gnat_gimplify_stmt (tree *);
201 static void elaborate_all_entities (Node_Id);
202 static void process_freeze_entity (Node_Id);
203 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
204 static tree emit_range_check (tree, Node_Id, Node_Id);
205 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
206 static tree emit_check (tree, tree, int, Node_Id);
207 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
208 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
209 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
210 static bool smaller_packable_type_p (tree, tree);
211 static bool addressable_p (tree, tree);
212 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
213 static tree extract_values (tree, tree);
214 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
215 static tree maybe_implicit_deref (tree);
216 static void set_expr_location_from_node (tree, Node_Id);
217 static int lvalue_required_p (Node_Id, tree, bool, bool, bool);
219 /* Hooks for debug info back-ends, only supported and used in a restricted set
220 of configurations. */
221 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
222 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
224 /* This is the main program of the back-end. It sets up all the table
225 structures and then generates code. */
228 gigi (Node_Id gnat_root, int max_gnat_node, int number_name ATTRIBUTE_UNUSED,
229 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
230 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
231 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
232 struct List_Header *list_headers_ptr, Nat number_file,
233 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
234 Entity_Id standard_integer, Entity_Id standard_long_long_float,
235 Entity_Id standard_exception_type, Int gigi_operating_mode)
237 Entity_Id gnat_literal;
238 tree long_long_float_type, exception_type, t;
239 tree int64_type = gnat_type_for_size (64, 0);
240 struct elab_info *info;
243 max_gnat_nodes = max_gnat_node;
245 Nodes_Ptr = nodes_ptr;
246 Next_Node_Ptr = next_node_ptr;
247 Prev_Node_Ptr = prev_node_ptr;
248 Elists_Ptr = elists_ptr;
249 Elmts_Ptr = elmts_ptr;
250 Strings_Ptr = strings_ptr;
251 String_Chars_Ptr = string_chars_ptr;
252 List_Headers_Ptr = list_headers_ptr;
254 type_annotate_only = (gigi_operating_mode == 1);
256 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
258 /* Declare the name of the compilation unit as the first global
259 name in order to make the middle-end fully deterministic. */
260 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
261 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
263 for (i = 0; i < number_file; i++)
265 /* Use the identifier table to make a permanent copy of the filename as
266 the name table gets reallocated after Gigi returns but before all the
267 debugging information is output. The __gnat_to_canonical_file_spec
268 call translates filenames from pragmas Source_Reference that contain
269 host style syntax not understood by gdb. */
273 (__gnat_to_canonical_file_spec
274 (Get_Name_String (file_info_ptr[i].File_Name))));
276 /* We rely on the order isomorphism between files and line maps. */
277 gcc_assert ((int) line_table->used == i);
279 /* We create the line map for a source file at once, with a fixed number
280 of columns chosen to avoid jumping over the next power of 2. */
281 linemap_add (line_table, LC_ENTER, 0, filename, 1);
282 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
283 linemap_position_for_column (line_table, 252 - 1);
284 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
287 /* Initialize ourselves. */
292 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
294 if (type_annotate_only)
296 TYPE_SIZE (void_type_node) = bitsize_zero_node;
297 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
300 /* If the GNU type extensions to DWARF are available, setup the hooks. */
301 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
302 /* We condition the name demangling and the generation of type encoding
303 strings on -gdwarf+ and always set descriptive types on. */
304 if (use_gnu_debug_info_extensions)
306 dwarf2out_set_type_encoding_func (extract_encoding);
307 dwarf2out_set_demangle_name_func (decode_name);
309 dwarf2out_set_descriptive_type_func (get_parallel_type);
312 /* Enable GNAT stack checking method if needed */
313 if (!Stack_Check_Probes_On_Target)
314 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
316 /* Retrieve alignment settings. */
317 double_float_alignment = get_target_double_float_alignment ();
318 double_scalar_alignment = get_target_double_scalar_alignment ();
320 /* Record the builtin types. Define `integer' and `unsigned char' first so
321 that dbx will output them first. */
322 record_builtin_type ("integer", integer_type_node);
323 record_builtin_type ("unsigned char", char_type_node);
324 record_builtin_type ("long integer", long_integer_type_node);
325 unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1);
326 record_builtin_type ("unsigned int", unsigned_type_node);
327 record_builtin_type (SIZE_TYPE, sizetype);
328 record_builtin_type ("boolean", boolean_type_node);
329 record_builtin_type ("void", void_type_node);
331 /* Save the type we made for integer as the type for Standard.Integer. */
332 save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node),
335 /* Save the type we made for boolean as the type for Standard.Boolean. */
336 save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node),
338 gnat_literal = First_Literal (Base_Type (standard_boolean));
339 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
340 gcc_assert (t == boolean_false_node);
341 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
342 boolean_type_node, t, true, false, false, false,
344 DECL_IGNORED_P (t) = 1;
345 save_gnu_tree (gnat_literal, t, false);
346 gnat_literal = Next_Literal (gnat_literal);
347 t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node);
348 gcc_assert (t == boolean_true_node);
349 t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE,
350 boolean_type_node, t, true, false, false, false,
352 DECL_IGNORED_P (t) = 1;
353 save_gnu_tree (gnat_literal, t, false);
355 void_ftype = build_function_type (void_type_node, NULL_TREE);
356 ptr_void_ftype = build_pointer_type (void_ftype);
358 /* Now declare runtime functions. */
359 t = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
361 /* malloc is a function declaration tree for a function to allocate
364 = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE,
365 build_function_type (ptr_void_type_node,
366 tree_cons (NULL_TREE,
368 NULL_TREE, false, true, true, NULL, Empty);
369 DECL_IS_MALLOC (malloc_decl) = 1;
371 /* malloc32 is a function declaration tree for a function to allocate
372 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */
374 = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE,
375 build_function_type (ptr_void_type_node,
376 tree_cons (NULL_TREE,
378 NULL_TREE, false, true, true, NULL, Empty);
379 DECL_IS_MALLOC (malloc32_decl) = 1;
381 /* free is a function declaration tree for a function to free memory. */
383 = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE,
384 build_function_type (void_type_node,
385 tree_cons (NULL_TREE,
388 NULL_TREE, false, true, true, NULL, Empty);
390 /* This is used for 64-bit multiplication with overflow checking. */
392 = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE,
393 build_function_type_list (int64_type, int64_type,
394 int64_type, NULL_TREE),
395 NULL_TREE, false, true, true, NULL, Empty);
397 /* Name of the _Parent field in tagged record types. */
398 parent_name_id = get_identifier (Get_Name_String (Name_uParent));
400 /* Make the types and functions used for exception processing. */
402 = build_array_type (gnat_type_for_mode (Pmode, 0),
403 build_index_type (size_int (5)));
404 record_builtin_type ("JMPBUF_T", jmpbuf_type);
405 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
407 /* Functions to get and set the jumpbuf pointer for the current thread. */
409 = create_subprog_decl
410 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
411 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
412 NULL_TREE, false, true, true, NULL, Empty);
413 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
414 DECL_PURE_P (get_jmpbuf_decl) = 1;
415 DECL_IGNORED_P (get_jmpbuf_decl) = 1;
418 = create_subprog_decl
419 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
421 build_function_type (void_type_node,
422 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
423 NULL_TREE, false, true, true, NULL, Empty);
424 DECL_IGNORED_P (set_jmpbuf_decl) = 1;
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);
434 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
435 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
437 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
439 update_setjmp_buf_decl
440 = create_subprog_decl
441 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
442 build_function_type (void_type_node,
443 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
444 NULL_TREE, false, true, true, NULL, Empty);
445 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
446 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
448 /* Hooks to call when entering/leaving an exception handler. */
450 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
451 build_function_type (void_type_node,
452 tree_cons (NULL_TREE,
455 NULL_TREE, false, true, true, NULL, Empty);
456 DECL_IGNORED_P (begin_handler_decl) = 1;
459 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
460 build_function_type (void_type_node,
461 tree_cons (NULL_TREE,
464 NULL_TREE, false, true, true, NULL, Empty);
465 DECL_IGNORED_P (end_handler_decl) = 1;
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),
548 /* Build the special descriptor type and its null node if needed. */
549 if (TARGET_VTABLE_USES_DESCRIPTORS)
551 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
552 tree field_list = NULL_TREE, null_list = NULL_TREE;
555 fdesc_type_node = make_node (RECORD_TYPE);
557 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
559 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
560 fdesc_type_node, 0, 0, 0, 1);
561 TREE_CHAIN (field) = field_list;
563 null_list = tree_cons (field, null_node, null_list);
566 finish_record_type (fdesc_type_node, nreverse (field_list), 0, false);
567 record_builtin_type ("descriptor", fdesc_type_node);
568 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
572 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
574 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
576 /* In this case, the builtin floating point types are VAX float,
577 so make up a type for use. */
578 longest_float_type_node = make_node (REAL_TYPE);
579 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
580 layout_type (longest_float_type_node);
581 record_builtin_type ("longest float type", longest_float_type_node);
584 longest_float_type_node = TREE_TYPE (long_long_float_type);
586 /* Dummy objects to materialize "others" and "all others" in the exception
587 tables. These are exported by a-exexpr.adb, so see this unit for the
590 = create_var_decl (get_identifier ("OTHERS"),
591 get_identifier ("__gnat_others_value"),
592 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
595 = create_var_decl (get_identifier ("ALL_OTHERS"),
596 get_identifier ("__gnat_all_others_value"),
597 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
599 main_identifier_node = get_identifier ("main");
601 /* Install the builtins we might need, either internally or as
602 user available facilities for Intrinsic imports. */
603 gnat_install_builtins ();
605 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
606 gnu_constraint_error_label_stack
607 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
608 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
609 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
611 /* Process any Pragma Ident for the main unit. */
612 #ifdef ASM_OUTPUT_IDENT
613 if (Present (Ident_String (Main_Unit)))
616 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
619 /* If we are using the GCC exception mechanism, let GCC know. */
620 if (Exception_Mechanism == Back_End_Exceptions)
623 /* Now translate the compilation unit proper. */
624 Compilation_Unit_to_gnu (gnat_root);
626 /* Finally see if we have any elaboration procedures to deal with. */
627 for (info = elab_info_list; info; info = info->next)
629 tree gnu_body = DECL_SAVED_TREE (info->elab_proc), gnu_stmts;
631 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
632 the gimplifier for obvious reasons, but it turns out that we need to
633 unshare them for the global level because of SAVE_EXPRs made around
634 checks for global objects and around allocators for global objects
635 of variable size, in order to prevent node sharing in the underlying
636 expression. Note that this implicitly assumes that the SAVE_EXPR
637 nodes themselves are not shared between subprograms, which would be
638 an upstream bug for which we would not change the outcome. */
639 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
641 /* We should have a BIND_EXPR but it may not have any statements in it.
642 If it doesn't have any, we have nothing to do except for setting the
643 flag on the GNAT node. Otherwise, process the function as others. */
644 gnu_stmts = gnu_body;
645 if (TREE_CODE (gnu_stmts) == BIND_EXPR)
646 gnu_stmts = BIND_EXPR_BODY (gnu_stmts);
647 if (!gnu_stmts || !STATEMENT_LIST_HEAD (gnu_stmts))
648 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
651 begin_subprog_body (info->elab_proc);
652 end_subprog_body (gnu_body);
656 /* We cannot track the location of errors past this point. */
657 error_gnat_node = Empty;
660 /* Return a positive value if an lvalue is required for GNAT_NODE, which is
661 an N_Attribute_Reference. */
664 lvalue_required_for_attribute_p (Node_Id gnat_node)
666 switch (Get_Attribute_Id (Attribute_Name (gnat_node)))
674 case Attr_Range_Length:
676 case Attr_Object_Size:
677 case Attr_Value_Size:
678 case Attr_Component_Size:
679 case Attr_Max_Size_In_Storage_Elements:
682 case Attr_Null_Parameter:
683 case Attr_Passed_By_Reference:
684 case Attr_Mechanism_Code:
689 case Attr_Unchecked_Access:
690 case Attr_Unrestricted_Access:
691 case Attr_Code_Address:
692 case Attr_Pool_Address:
695 case Attr_Bit_Position:
705 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
706 is the type that will be used for GNAT_NODE in the translated GNU tree.
707 CONSTANT indicates whether the underlying object represented by GNAT_NODE
708 is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates
709 whether its value is the address of a constant and ALIASED whether it is
710 aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored.
712 The function climbs up the GNAT tree starting from the node and returns 1
713 upon encountering a node that effectively requires an lvalue downstream.
714 It returns int instead of bool to facilitate usage in non-purely binary
718 lvalue_required_p (Node_Id gnat_node, tree gnu_type, bool constant,
719 bool address_of_constant, bool aliased)
721 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
723 switch (Nkind (gnat_parent))
728 case N_Attribute_Reference:
729 return lvalue_required_for_attribute_p (gnat_parent);
731 case N_Parameter_Association:
732 case N_Function_Call:
733 case N_Procedure_Call_Statement:
734 /* If the parameter is by reference, an lvalue is required. */
736 || must_pass_by_ref (gnu_type)
737 || default_pass_by_ref (gnu_type));
739 case N_Indexed_Component:
740 /* Only the array expression can require an lvalue. */
741 if (Prefix (gnat_parent) != gnat_node)
744 /* ??? Consider that referencing an indexed component with a
745 non-constant index forces the whole aggregate to memory.
746 Note that N_Integer_Literal is conservative, any static
747 expression in the RM sense could probably be accepted. */
748 for (gnat_temp = First (Expressions (gnat_parent));
750 gnat_temp = Next (gnat_temp))
751 if (Nkind (gnat_temp) != N_Integer_Literal)
754 /* ... fall through ... */
757 /* Only the array expression can require an lvalue. */
758 if (Prefix (gnat_parent) != gnat_node)
761 aliased |= Has_Aliased_Components (Etype (gnat_node));
762 return lvalue_required_p (gnat_parent, gnu_type, constant,
763 address_of_constant, aliased);
765 case N_Selected_Component:
766 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
767 return lvalue_required_p (gnat_parent, gnu_type, constant,
768 address_of_constant, aliased);
770 case N_Object_Renaming_Declaration:
771 /* We need to make a real renaming only if the constant object is
772 aliased or if we may use a renaming pointer; otherwise we can
773 optimize and return the rvalue. We make an exception if the object
774 is an identifier since in this case the rvalue can be propagated
775 attached to the CONST_DECL. */
778 /* This should match the constant case of the renaming code. */
780 (Underlying_Type (Etype (Name (gnat_parent))))
781 || Nkind (Name (gnat_parent)) == N_Identifier);
783 case N_Object_Declaration:
784 /* We cannot use a constructor if this is an atomic object because
785 the actual assignment might end up being done component-wise. */
787 ||(Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
788 && Is_Atomic (Defining_Entity (gnat_parent)))
789 /* We don't use a constructor if this is a class-wide object
790 because the effective type of the object is the equivalent
791 type of the class-wide subtype and it smashes most of the
792 data into an array of bytes to which we cannot convert. */
793 || Ekind ((Etype (Defining_Entity (gnat_parent))))
794 == E_Class_Wide_Subtype);
796 case N_Assignment_Statement:
797 /* We cannot use a constructor if the LHS is an atomic object because
798 the actual assignment might end up being done component-wise. */
800 || Name (gnat_parent) == gnat_node
801 || (Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
802 && Is_Atomic (Entity (Name (gnat_parent)))));
804 case N_Type_Conversion:
805 case N_Qualified_Expression:
806 /* We must look through all conversions for composite types because we
807 may need to bypass an intermediate conversion to a narrower record
808 type that is generated for a formal conversion, e.g. the conversion
809 to the root type of a hierarchy of tagged types generated for the
810 formal conversion to the class-wide type. */
811 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_node))))
814 /* ... fall through ... */
816 case N_Unchecked_Type_Conversion:
818 || lvalue_required_p (gnat_parent,
819 get_unpadded_type (Etype (gnat_parent)),
820 constant, address_of_constant, aliased));
823 /* We should only reach here through the N_Qualified_Expression case
824 and, therefore, only for composite types. Force an lvalue since
825 a block-copy to the newly allocated area of memory is made. */
828 case N_Explicit_Dereference:
829 /* We look through dereferences for address of constant because we need
830 to handle the special cases listed above. */
831 if (constant && address_of_constant)
832 return lvalue_required_p (gnat_parent,
833 get_unpadded_type (Etype (gnat_parent)),
836 /* ... fall through ... */
845 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
846 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
847 to where we should place the result type. */
850 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
852 Node_Id gnat_temp, gnat_temp_type;
853 tree gnu_result, gnu_result_type;
855 /* Whether we should require an lvalue for GNAT_NODE. Needed in
856 specific circumstances only, so evaluated lazily. < 0 means
857 unknown, > 0 means known true, 0 means known false. */
858 int require_lvalue = -1;
860 /* If GNAT_NODE is a constant, whether we should use the initialization
861 value instead of the constant entity, typically for scalars with an
862 address clause when the parent doesn't require an lvalue. */
863 bool use_constant_initializer = false;
865 /* If the Etype of this node does not equal the Etype of the Entity,
866 something is wrong with the entity map, probably in generic
867 instantiation. However, this does not apply to types. Since we sometime
868 have strange Ekind's, just do this test for objects. Also, if the Etype of
869 the Entity is private, the Etype of the N_Identifier is allowed to be the
870 full type and also we consider a packed array type to be the same as the
871 original type. Similarly, a class-wide type is equivalent to a subtype of
872 itself. Finally, if the types are Itypes, one may be a copy of the other,
873 which is also legal. */
874 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
875 ? gnat_node : Entity (gnat_node));
876 gnat_temp_type = Etype (gnat_temp);
878 gcc_assert (Etype (gnat_node) == gnat_temp_type
879 || (Is_Packed (gnat_temp_type)
880 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
881 || (Is_Class_Wide_Type (Etype (gnat_node)))
882 || (IN (Ekind (gnat_temp_type), Private_Kind)
883 && Present (Full_View (gnat_temp_type))
884 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
885 || (Is_Packed (Full_View (gnat_temp_type))
886 && (Etype (gnat_node)
887 == Packed_Array_Type (Full_View
888 (gnat_temp_type))))))
889 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
890 || !(Ekind (gnat_temp) == E_Variable
891 || Ekind (gnat_temp) == E_Component
892 || Ekind (gnat_temp) == E_Constant
893 || Ekind (gnat_temp) == E_Loop_Parameter
894 || IN (Ekind (gnat_temp), Formal_Kind)));
896 /* If this is a reference to a deferred constant whose partial view is an
897 unconstrained private type, the proper type is on the full view of the
898 constant, not on the full view of the type, which may be unconstrained.
900 This may be a reference to a type, for example in the prefix of the
901 attribute Position, generated for dispatching code (see Make_DT in
902 exp_disp,adb). In that case we need the type itself, not is parent,
903 in particular if it is a derived type */
904 if (Is_Private_Type (gnat_temp_type)
905 && Has_Unknown_Discriminants (gnat_temp_type)
906 && Ekind (gnat_temp) == E_Constant
907 && Present (Full_View (gnat_temp)))
909 gnat_temp = Full_View (gnat_temp);
910 gnat_temp_type = Etype (gnat_temp);
914 /* We want to use the Actual_Subtype if it has already been elaborated,
915 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
917 if ((Ekind (gnat_temp) == E_Constant
918 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
919 && !(Is_Array_Type (Etype (gnat_temp))
920 && Present (Packed_Array_Type (Etype (gnat_temp))))
921 && Present (Actual_Subtype (gnat_temp))
922 && present_gnu_tree (Actual_Subtype (gnat_temp)))
923 gnat_temp_type = Actual_Subtype (gnat_temp);
925 gnat_temp_type = Etype (gnat_node);
928 /* Expand the type of this identifier first, in case it is an enumeral
929 literal, which only get made when the type is expanded. There is no
930 order-of-elaboration issue here. */
931 gnu_result_type = get_unpadded_type (gnat_temp_type);
933 /* If this is a non-imported scalar constant with an address clause,
934 retrieve the value instead of a pointer to be dereferenced unless
935 an lvalue is required. This is generally more efficient and actually
936 required if this is a static expression because it might be used
937 in a context where a dereference is inappropriate, such as a case
938 statement alternative or a record discriminant. There is no possible
939 volatile-ness short-circuit here since Volatile constants must bei
941 if (Ekind (gnat_temp) == E_Constant
942 && Is_Scalar_Type (gnat_temp_type)
943 && !Is_Imported (gnat_temp)
944 && Present (Address_Clause (gnat_temp)))
946 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true,
947 false, Is_Aliased (gnat_temp));
948 use_constant_initializer = !require_lvalue;
951 if (use_constant_initializer)
953 /* If this is a deferred constant, the initializer is attached to
955 if (Present (Full_View (gnat_temp)))
956 gnat_temp = Full_View (gnat_temp);
958 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
961 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
963 /* If we are in an exception handler, force this variable into memory to
964 ensure optimization does not remove stores that appear redundant but are
965 actually needed in case an exception occurs.
967 ??? Note that we need not do this if the variable is declared within the
968 handler, only if it is referenced in the handler and declared in an
969 enclosing block, but we have no way of testing that right now.
971 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
972 here, but it can now be removed by the Tree aliasing machinery if the
973 address of the variable is never taken. All we can do is to make the
974 variable volatile, which might incur the generation of temporaries just
975 to access the memory in some circumstances. This can be avoided for
976 variables of non-constant size because they are automatically allocated
977 to memory. There might be no way of allocating a proper temporary for
978 them in any case. We only do this for SJLJ though. */
979 if (TREE_VALUE (gnu_except_ptr_stack)
980 && TREE_CODE (gnu_result) == VAR_DECL
981 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
982 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
984 /* Some objects (such as parameters passed by reference, globals of
985 variable size, and renamed objects) actually represent the address
986 of the object. In that case, we must do the dereference. Likewise,
987 deal with parameters to foreign convention subprograms. */
988 if (DECL_P (gnu_result)
989 && (DECL_BY_REF_P (gnu_result)
990 || (TREE_CODE (gnu_result) == PARM_DECL
991 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
993 const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result);
996 if (TREE_CODE (gnu_result) == PARM_DECL
997 && DECL_BY_COMPONENT_PTR_P (gnu_result))
999 = build_unary_op (INDIRECT_REF, NULL_TREE,
1000 convert (build_pointer_type (gnu_result_type),
1003 /* If it's a renaming pointer and we are at the right binding level,
1004 we can reference the renamed object directly, since the renamed
1005 expression has been protected against multiple evaluations. */
1006 else if (TREE_CODE (gnu_result) == VAR_DECL
1007 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result))
1008 && (!DECL_RENAMING_GLOBAL_P (gnu_result)
1009 || global_bindings_p ()))
1010 gnu_result = renamed_obj;
1012 /* Return the underlying CST for a CONST_DECL like a few lines below,
1013 after dereferencing in this case. */
1014 else if (TREE_CODE (gnu_result) == CONST_DECL)
1015 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
1016 DECL_INITIAL (gnu_result));
1019 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
1022 TREE_READONLY (gnu_result) = 1;
1025 /* The GNAT tree has the type of a function as the type of its result. Also
1026 use the type of the result if the Etype is a subtype which is nominally
1027 unconstrained. But remove any padding from the resulting type. */
1028 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
1029 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
1031 gnu_result_type = TREE_TYPE (gnu_result);
1032 if (TYPE_IS_PADDING_P (gnu_result_type))
1033 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
1036 /* If we have a constant declaration and its initializer, try to return the
1037 latter to avoid the need to call fold in lots of places and the need for
1038 elaboration code if this identifier is used as an initializer itself. */
1039 if (TREE_CONSTANT (gnu_result)
1040 && DECL_P (gnu_result)
1041 && DECL_INITIAL (gnu_result))
1043 bool constant_only = (TREE_CODE (gnu_result) == CONST_DECL
1044 && !DECL_CONST_CORRESPONDING_VAR (gnu_result));
1045 bool address_of_constant = (TREE_CODE (gnu_result) == CONST_DECL
1046 && DECL_CONST_ADDRESS_P (gnu_result));
1048 /* If there is a (corresponding) variable or this is the address of a
1049 constant, we only want to return the initializer if an lvalue isn't
1050 required. Evaluate this now if we have not already done so. */
1051 if ((!constant_only || address_of_constant) && require_lvalue < 0)
1053 = lvalue_required_p (gnat_node, gnu_result_type, true,
1054 address_of_constant, Is_Aliased (gnat_temp));
1056 /* ??? We need to unshare the initializer if the object is external
1057 as such objects are not marked for unsharing if we are not at the
1058 global level. This should be fixed in add_decl_expr. */
1059 if ((constant_only && !address_of_constant) || !require_lvalue)
1060 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
1063 *gnu_result_type_p = gnu_result_type;
1068 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1069 any statements we generate. */
1072 Pragma_to_gnu (Node_Id gnat_node)
1075 tree gnu_result = alloc_stmt_list ();
1077 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
1078 annotating types. */
1079 if (type_annotate_only
1080 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
1083 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
1085 case Pragma_Inspection_Point:
1086 /* Do nothing at top level: all such variables are already viewable. */
1087 if (global_bindings_p ())
1090 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
1091 Present (gnat_temp);
1092 gnat_temp = Next (gnat_temp))
1094 Node_Id gnat_expr = Expression (gnat_temp);
1095 tree gnu_expr = gnat_to_gnu (gnat_expr);
1097 enum machine_mode mode;
1098 tree asm_constraint = NULL_TREE;
1099 #ifdef ASM_COMMENT_START
1103 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
1104 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1106 /* Use the value only if it fits into a normal register,
1107 otherwise use the address. */
1108 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1109 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1110 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1111 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1114 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1116 #ifdef ASM_COMMENT_START
1117 comment = concat (ASM_COMMENT_START,
1118 " inspection point: ",
1119 Get_Name_String (Chars (gnat_expr)),
1120 use_address ? " address" : "",
1123 asm_constraint = build_string (strlen (comment), comment);
1126 gnu_expr = build5 (ASM_EXPR, void_type_node,
1130 (build_tree_list (NULL_TREE,
1131 build_string (1, "g")),
1132 gnu_expr, NULL_TREE),
1133 NULL_TREE, NULL_TREE);
1134 ASM_VOLATILE_P (gnu_expr) = 1;
1135 set_expr_location_from_node (gnu_expr, gnat_node);
1136 append_to_statement_list (gnu_expr, &gnu_result);
1140 case Pragma_Optimize:
1141 switch (Chars (Expression
1142 (First (Pragma_Argument_Associations (gnat_node)))))
1144 case Name_Time: case Name_Space:
1146 post_error ("insufficient -O value?", gnat_node);
1151 post_error ("must specify -O0?", gnat_node);
1159 case Pragma_Reviewable:
1160 if (write_symbols == NO_DEBUG)
1161 post_error ("must specify -g?", gnat_node);
1168 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1169 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1170 where we should place the result type. ATTRIBUTE is the attribute ID. */
1173 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1175 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1176 tree gnu_type = TREE_TYPE (gnu_prefix);
1177 tree gnu_expr, gnu_result_type, gnu_result = error_mark_node;
1178 bool prefix_unused = false;
1180 /* If the input is a NULL_EXPR, make a new one. */
1181 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1183 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1184 *gnu_result_type_p = gnu_result_type;
1185 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1192 /* These are just conversions since representation clauses for
1193 enumeration types are handled in the front-end. */
1195 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1196 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1197 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1198 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1199 checkp, checkp, true, gnat_node);
1205 /* These just add or subtract the constant 1 since representation
1206 clauses for enumeration types are handled in the front-end. */
1207 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1208 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1210 if (Do_Range_Check (First (Expressions (gnat_node))))
1212 gnu_expr = gnat_protect_expr (gnu_expr);
1215 (build_binary_op (EQ_EXPR, integer_type_node,
1217 attribute == Attr_Pred
1218 ? TYPE_MIN_VALUE (gnu_result_type)
1219 : TYPE_MAX_VALUE (gnu_result_type)),
1220 gnu_expr, CE_Range_Check_Failed, gnat_node);
1224 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1225 gnu_result_type, gnu_expr,
1226 convert (gnu_result_type, integer_one_node));
1230 case Attr_Unrestricted_Access:
1231 /* Conversions don't change addresses but can cause us to miss the
1232 COMPONENT_REF case below, so strip them off. */
1233 gnu_prefix = remove_conversions (gnu_prefix,
1234 !Must_Be_Byte_Aligned (gnat_node));
1236 /* If we are taking 'Address of an unconstrained object, this is the
1237 pointer to the underlying array. */
1238 if (attribute == Attr_Address)
1239 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1241 /* If we are building a static dispatch table, we have to honor
1242 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1243 with the C++ ABI. We do it in the non-static case as well,
1244 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1245 else if (TARGET_VTABLE_USES_DESCRIPTORS
1246 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1248 tree gnu_field, gnu_list = NULL_TREE, t;
1249 /* Descriptors can only be built here for top-level functions. */
1250 bool build_descriptor = (global_bindings_p () != 0);
1253 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1255 /* If we're not going to build the descriptor, we have to retrieve
1256 the one which will be built by the linker (or by the compiler
1257 later if a static chain is requested). */
1258 if (!build_descriptor)
1260 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1261 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1263 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1266 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1267 i < TARGET_VTABLE_USES_DESCRIPTORS;
1268 gnu_field = TREE_CHAIN (gnu_field), i++)
1270 if (build_descriptor)
1272 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1273 build_int_cst (NULL_TREE, i));
1274 TREE_CONSTANT (t) = 1;
1277 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1278 gnu_field, NULL_TREE);
1280 gnu_list = tree_cons (gnu_field, t, gnu_list);
1283 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1287 /* ... fall through ... */
1290 case Attr_Unchecked_Access:
1291 case Attr_Code_Address:
1292 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1294 = build_unary_op (((attribute == Attr_Address
1295 || attribute == Attr_Unrestricted_Access)
1296 && !Must_Be_Byte_Aligned (gnat_node))
1297 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1298 gnu_result_type, gnu_prefix);
1300 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1301 don't try to build a trampoline. */
1302 if (attribute == Attr_Code_Address)
1304 for (gnu_expr = gnu_result;
1305 CONVERT_EXPR_P (gnu_expr);
1306 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1307 TREE_CONSTANT (gnu_expr) = 1;
1309 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1310 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1313 /* For other address attributes applied to a nested function,
1314 find an inner ADDR_EXPR and annotate it so that we can issue
1315 a useful warning with -Wtrampolines. */
1316 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1318 for (gnu_expr = gnu_result;
1319 CONVERT_EXPR_P (gnu_expr);
1320 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1323 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1324 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1326 set_expr_location_from_node (gnu_expr, gnat_node);
1328 /* Check that we're not violating the No_Implicit_Dynamic_Code
1329 restriction. Be conservative if we don't know anything
1330 about the trampoline strategy for the target. */
1331 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1336 case Attr_Pool_Address:
1339 tree gnu_ptr = gnu_prefix;
1341 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1343 /* If this is an unconstrained array, we know the object has been
1344 allocated with the template in front of the object. So compute
1345 the template address. */
1346 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1348 = convert (build_pointer_type
1349 (TYPE_OBJECT_RECORD_TYPE
1350 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1353 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1354 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1355 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1357 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1358 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1359 tree gnu_byte_offset
1360 = convert (sizetype,
1361 size_diffop (size_zero_node, gnu_pos));
1363 = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1365 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1366 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1367 gnu_ptr, gnu_byte_offset);
1370 gnu_result = convert (gnu_result_type, gnu_ptr);
1375 case Attr_Object_Size:
1376 case Attr_Value_Size:
1377 case Attr_Max_Size_In_Storage_Elements:
1378 gnu_expr = gnu_prefix;
1380 /* Remove NOPs and conversions between original and packable version
1381 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1382 to see if a COMPONENT_REF was involved. */
1383 while (TREE_CODE (gnu_expr) == NOP_EXPR
1384 || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR
1385 && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE
1386 && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))
1388 && TYPE_NAME (TREE_TYPE (gnu_expr))
1389 == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))))
1390 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1392 gnu_prefix = remove_conversions (gnu_prefix, true);
1393 prefix_unused = true;
1394 gnu_type = TREE_TYPE (gnu_prefix);
1396 /* Replace an unconstrained array type with the type of the underlying
1397 array. We can't do this with a call to maybe_unconstrained_array
1398 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1399 use the record type that will be used to allocate the object and its
1401 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1403 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1404 if (attribute != Attr_Max_Size_In_Storage_Elements)
1405 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1408 /* If we're looking for the size of a field, return the field size.
1409 Otherwise, if the prefix is an object, or if we're looking for
1410 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1411 GCC size of the type. Otherwise, it is the RM size of the type. */
1412 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1413 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1414 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1415 || attribute == Attr_Object_Size
1416 || attribute == Attr_Max_Size_In_Storage_Elements)
1418 /* If the prefix is an object of a padded type, the GCC size isn't
1419 relevant to the programmer. Normally what we want is the RM size,
1420 which was set from the specified size, but if it was not set, we
1421 want the size of the field. Using the MAX of those two produces
1422 the right result in all cases. Don't use the size of the field
1423 if it's self-referential, since that's never what's wanted. */
1424 if (TREE_CODE (gnu_prefix) != TYPE_DECL
1425 && TYPE_IS_PADDING_P (gnu_type)
1426 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1428 gnu_result = rm_size (gnu_type);
1429 if (!CONTAINS_PLACEHOLDER_P
1430 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1))))
1432 = size_binop (MAX_EXPR, gnu_result,
1433 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1435 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1437 Node_Id gnat_deref = Prefix (gnat_node);
1438 Node_Id gnat_actual_subtype
1439 = Actual_Designated_Subtype (gnat_deref);
1441 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1443 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1444 && Present (gnat_actual_subtype))
1446 tree gnu_actual_obj_type
1447 = gnat_to_gnu_type (gnat_actual_subtype);
1449 = build_unc_object_type_from_ptr (gnu_ptr_type,
1450 gnu_actual_obj_type,
1451 get_identifier ("SIZE"));
1454 gnu_result = TYPE_SIZE (gnu_type);
1457 gnu_result = TYPE_SIZE (gnu_type);
1460 gnu_result = rm_size (gnu_type);
1462 /* Deal with a self-referential size by returning the maximum size for
1463 a type and by qualifying the size with the object otherwise. */
1464 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1466 if (TREE_CODE (gnu_prefix) == TYPE_DECL)
1467 gnu_result = max_size (gnu_result, true);
1469 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1472 /* If the type contains a template, subtract its size. */
1473 if (TREE_CODE (gnu_type) == RECORD_TYPE
1474 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1475 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1476 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1478 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1479 if (attribute == Attr_Max_Size_In_Storage_Elements)
1480 gnu_result = size_binop (CEIL_DIV_EXPR, gnu_result, bitsize_unit_node);
1482 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1485 case Attr_Alignment:
1489 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1490 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1491 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1493 gnu_type = TREE_TYPE (gnu_prefix);
1494 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1495 prefix_unused = true;
1497 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1498 align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT;
1501 Node_Id gnat_prefix = Prefix (gnat_node);
1502 Entity_Id gnat_type = Etype (gnat_prefix);
1503 unsigned int double_align;
1504 bool is_capped_double, align_clause;
1506 /* If the default alignment of "double" or larger scalar types is
1507 specifically capped and there is an alignment clause neither
1508 on the type nor on the prefix itself, return the cap. */
1509 if ((double_align = double_float_alignment) > 0)
1511 = is_double_float_or_array (gnat_type, &align_clause);
1512 else if ((double_align = double_scalar_alignment) > 0)
1514 = is_double_scalar_or_array (gnat_type, &align_clause);
1516 is_capped_double = align_clause = false;
1518 if (is_capped_double
1519 && Nkind (gnat_prefix) == N_Identifier
1520 && Present (Alignment_Clause (Entity (gnat_prefix))))
1521 align_clause = true;
1523 if (is_capped_double && !align_clause)
1524 align = double_align;
1526 align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT;
1529 gnu_result = size_int (align);
1535 case Attr_Range_Length:
1536 prefix_unused = true;
1538 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1540 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1542 if (attribute == Attr_First)
1543 gnu_result = TYPE_MIN_VALUE (gnu_type);
1544 else if (attribute == Attr_Last)
1545 gnu_result = TYPE_MAX_VALUE (gnu_type);
1549 (MAX_EXPR, get_base_type (gnu_result_type),
1551 (PLUS_EXPR, get_base_type (gnu_result_type),
1552 build_binary_op (MINUS_EXPR,
1553 get_base_type (gnu_result_type),
1554 convert (gnu_result_type,
1555 TYPE_MAX_VALUE (gnu_type)),
1556 convert (gnu_result_type,
1557 TYPE_MIN_VALUE (gnu_type))),
1558 convert (gnu_result_type, integer_one_node)),
1559 convert (gnu_result_type, integer_zero_node));
1564 /* ... fall through ... */
1568 int Dimension = (Present (Expressions (gnat_node))
1569 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1571 struct parm_attr_d *pa = NULL;
1572 Entity_Id gnat_param = Empty;
1574 /* Make sure any implicit dereference gets done. */
1575 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1576 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1577 /* We treat unconstrained array In parameters specially. */
1578 if (Nkind (Prefix (gnat_node)) == N_Identifier
1579 && !Is_Constrained (Etype (Prefix (gnat_node)))
1580 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1581 gnat_param = Entity (Prefix (gnat_node));
1582 gnu_type = TREE_TYPE (gnu_prefix);
1583 prefix_unused = true;
1584 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1586 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1591 for (ndim = 1, gnu_type_temp = gnu_type;
1592 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1593 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1594 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1597 Dimension = ndim + 1 - Dimension;
1600 for (i = 1; i < Dimension; i++)
1601 gnu_type = TREE_TYPE (gnu_type);
1603 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1605 /* When not optimizing, look up the slot associated with the parameter
1606 and the dimension in the cache and create a new one on failure. */
1607 if (!optimize && Present (gnat_param))
1609 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1610 if (pa->id == gnat_param && pa->dim == Dimension)
1615 pa = GGC_CNEW (struct parm_attr_d);
1616 pa->id = gnat_param;
1617 pa->dim = Dimension;
1618 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1622 /* Return the cached expression or build a new one. */
1623 if (attribute == Attr_First)
1625 if (pa && pa->first)
1627 gnu_result = pa->first;
1632 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1635 else if (attribute == Attr_Last)
1639 gnu_result = pa->last;
1644 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1647 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1649 if (pa && pa->length)
1651 gnu_result = pa->length;
1656 /* We used to compute the length as max (hb - lb + 1, 0),
1657 which could overflow for some cases of empty arrays, e.g.
1658 when lb == index_type'first. We now compute the length as
1659 (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in
1660 much rarer cases, for extremely large arrays we expect
1661 never to encounter in practice. In addition, the former
1662 computation required the use of potentially constraining
1663 signed arithmetic while the latter doesn't. Note that
1664 the comparison must be done in the original index type,
1665 to avoid any overflow during the conversion. */
1666 tree comp_type = get_base_type (gnu_result_type);
1667 tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1668 tree lb = TYPE_MIN_VALUE (index_type);
1669 tree hb = TYPE_MAX_VALUE (index_type);
1671 = build_binary_op (PLUS_EXPR, comp_type,
1672 build_binary_op (MINUS_EXPR,
1674 convert (comp_type, hb),
1675 convert (comp_type, lb)),
1676 convert (comp_type, integer_one_node));
1678 = build_cond_expr (comp_type,
1679 build_binary_op (GE_EXPR,
1683 convert (comp_type, integer_zero_node));
1687 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1688 handling. Note that these attributes could not have been used on
1689 an unconstrained array type. */
1690 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1692 /* Cache the expression we have just computed. Since we want to do it
1693 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1694 create the temporary. */
1698 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1699 TREE_SIDE_EFFECTS (gnu_result) = 1;
1700 if (attribute == Attr_First)
1701 pa->first = gnu_result;
1702 else if (attribute == Attr_Last)
1703 pa->last = gnu_result;
1705 pa->length = gnu_result;
1708 /* Set the source location onto the predicate of the condition in the
1709 'Length case but do not do it if the expression is cached to avoid
1710 messing up the debug info. */
1711 else if ((attribute == Attr_Range_Length || attribute == Attr_Length)
1712 && TREE_CODE (gnu_result) == COND_EXPR
1713 && EXPR_P (TREE_OPERAND (gnu_result, 0)))
1714 set_expr_location_from_node (TREE_OPERAND (gnu_result, 0),
1720 case Attr_Bit_Position:
1722 case Attr_First_Bit:
1726 HOST_WIDE_INT bitsize;
1727 HOST_WIDE_INT bitpos;
1729 tree gnu_field_bitpos;
1730 tree gnu_field_offset;
1732 enum machine_mode mode;
1733 int unsignedp, volatilep;
1735 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1736 gnu_prefix = remove_conversions (gnu_prefix, true);
1737 prefix_unused = true;
1739 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1740 the result is 0. Don't allow 'Bit on a bare component, though. */
1741 if (attribute == Attr_Bit
1742 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1743 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1745 gnu_result = integer_zero_node;
1750 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1751 || (attribute == Attr_Bit_Position
1752 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1754 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1755 &mode, &unsignedp, &volatilep, false);
1757 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1759 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1760 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1762 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1763 TREE_CODE (gnu_inner) == COMPONENT_REF
1764 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1765 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1768 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1769 bit_position (TREE_OPERAND (gnu_inner, 1)));
1771 = size_binop (PLUS_EXPR, gnu_field_offset,
1772 byte_position (TREE_OPERAND (gnu_inner, 1)));
1775 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1777 gnu_field_bitpos = bit_position (gnu_prefix);
1778 gnu_field_offset = byte_position (gnu_prefix);
1782 gnu_field_bitpos = bitsize_zero_node;
1783 gnu_field_offset = size_zero_node;
1789 gnu_result = gnu_field_offset;
1792 case Attr_First_Bit:
1794 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1798 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1799 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1800 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1801 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1805 case Attr_Bit_Position:
1806 gnu_result = gnu_field_bitpos;
1810 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1812 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1819 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1820 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1822 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1823 gnu_result = build_binary_op (attribute == Attr_Min
1824 ? MIN_EXPR : MAX_EXPR,
1825 gnu_result_type, gnu_lhs, gnu_rhs);
1829 case Attr_Passed_By_Reference:
1830 gnu_result = size_int (default_pass_by_ref (gnu_type)
1831 || must_pass_by_ref (gnu_type));
1832 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1835 case Attr_Component_Size:
1836 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1837 && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0))))
1838 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1840 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1841 gnu_type = TREE_TYPE (gnu_prefix);
1843 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1844 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1846 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1847 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1848 gnu_type = TREE_TYPE (gnu_type);
1850 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1852 /* Note this size cannot be self-referential. */
1853 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1854 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1855 prefix_unused = true;
1858 case Attr_Null_Parameter:
1859 /* This is just a zero cast to the pointer type for our prefix and
1861 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1863 = build_unary_op (INDIRECT_REF, NULL_TREE,
1864 convert (build_pointer_type (gnu_result_type),
1865 integer_zero_node));
1866 TREE_PRIVATE (gnu_result) = 1;
1869 case Attr_Mechanism_Code:
1872 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1874 prefix_unused = true;
1875 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1876 if (Present (Expressions (gnat_node)))
1878 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1880 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1881 i--, gnat_obj = Next_Formal (gnat_obj))
1885 code = Mechanism (gnat_obj);
1886 if (code == Default)
1887 code = ((present_gnu_tree (gnat_obj)
1888 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1889 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1891 && (DECL_BY_COMPONENT_PTR_P
1892 (get_gnu_tree (gnat_obj))))))
1893 ? By_Reference : By_Copy);
1894 gnu_result = convert (gnu_result_type, size_int (- code));
1899 /* Say we have an unimplemented attribute. Then set the value to be
1900 returned to be a zero and hope that's something we can convert to
1901 the type of this attribute. */
1902 post_error ("unimplemented attribute", gnat_node);
1903 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1904 gnu_result = integer_zero_node;
1908 /* If this is an attribute where the prefix was unused, force a use of it if
1909 it has a side-effect. But don't do it if the prefix is just an entity
1910 name. However, if an access check is needed, we must do it. See second
1911 example in AARM 11.6(5.e). */
1912 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1913 && !Is_Entity_Name (Prefix (gnat_node)))
1914 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1915 gnu_prefix, gnu_result);
1917 *gnu_result_type_p = gnu_result_type;
1921 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1922 to a GCC tree, which is returned. */
1925 Case_Statement_to_gnu (Node_Id gnat_node)
1931 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1932 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1934 /* The range of values in a case statement is determined by the rules in
1935 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1936 of the expression. One exception arises in the case of a simple name that
1937 is parenthesized. This still has the Etype of the name, but since it is
1938 not a name, para 7 does not apply, and we need to go to the base type.
1939 This is the only case where parenthesization affects the dynamic
1940 semantics (i.e. the range of possible values at runtime that is covered
1941 by the others alternative.
1943 Another exception is if the subtype of the expression is non-static. In
1944 that case, we also have to use the base type. */
1945 if (Paren_Count (Expression (gnat_node)) != 0
1946 || !Is_OK_Static_Subtype (Underlying_Type
1947 (Etype (Expression (gnat_node)))))
1948 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1950 /* We build a SWITCH_EXPR that contains the code with interspersed
1951 CASE_LABEL_EXPRs for each label. */
1953 push_stack (&gnu_switch_label_stack, NULL_TREE,
1954 create_artificial_label (input_location));
1955 start_stmt_group ();
1956 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1957 Present (gnat_when);
1958 gnat_when = Next_Non_Pragma (gnat_when))
1960 bool choices_added_p = false;
1961 Node_Id gnat_choice;
1963 /* First compile all the different case choices for the current WHEN
1965 for (gnat_choice = First (Discrete_Choices (gnat_when));
1966 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1968 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1970 switch (Nkind (gnat_choice))
1973 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1974 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1977 case N_Subtype_Indication:
1978 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1979 (Constraint (gnat_choice))));
1980 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1981 (Constraint (gnat_choice))));
1985 case N_Expanded_Name:
1986 /* This represents either a subtype range or a static value of
1987 some kind; Ekind says which. */
1988 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1990 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1992 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1993 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1997 /* ... fall through ... */
1999 case N_Character_Literal:
2000 case N_Integer_Literal:
2001 gnu_low = gnat_to_gnu (gnat_choice);
2004 case N_Others_Choice:
2011 /* If the case value is a subtype that raises Constraint_Error at
2012 run-time because of a wrong bound, then gnu_low or gnu_high is
2013 not translated into an INTEGER_CST. In such a case, we need
2014 to ensure that the when statement is not added in the tree,
2015 otherwise it will crash the gimplifier. */
2016 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
2017 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
2019 add_stmt_with_node (build3
2020 (CASE_LABEL_EXPR, void_type_node,
2022 create_artificial_label (input_location)),
2024 choices_added_p = true;
2028 /* Push a binding level here in case variables are declared as we want
2029 them to be local to this set of statements instead of to the block
2030 containing the Case statement. */
2031 if (choices_added_p)
2033 add_stmt (build_stmt_group (Statements (gnat_when), true));
2034 add_stmt (build1 (GOTO_EXPR, void_type_node,
2035 TREE_VALUE (gnu_switch_label_stack)));
2039 /* Now emit a definition of the label all the cases branched to. */
2040 add_stmt (build1 (LABEL_EXPR, void_type_node,
2041 TREE_VALUE (gnu_switch_label_stack)));
2042 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
2043 end_stmt_group (), NULL_TREE);
2044 pop_stack (&gnu_switch_label_stack);
2049 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2050 to a GCC tree, which is returned. */
2053 Loop_Statement_to_gnu (Node_Id gnat_node)
2055 const Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
2056 tree gnu_loop_stmt = build5 (LOOP_STMT, void_type_node, NULL_TREE,
2057 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
2058 tree gnu_loop_label = create_artificial_label (input_location);
2059 tree gnu_loop_var = NULL_TREE, gnu_cond_expr = NULL_TREE;
2062 /* Set location information for statement and end label. */
2063 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
2064 Sloc_to_locus (Sloc (End_Label (gnat_node)),
2065 &DECL_SOURCE_LOCATION (gnu_loop_label));
2066 LOOP_STMT_LABEL (gnu_loop_stmt) = gnu_loop_label;
2068 /* Save the end label of this LOOP_STMT in a stack so that a corresponding
2069 N_Exit_Statement can find it. */
2070 push_stack (&gnu_loop_label_stack, NULL_TREE, gnu_loop_label);
2072 /* Set the condition under which the loop must keep going.
2073 For the case "LOOP .... END LOOP;" the condition is always true. */
2074 if (No (gnat_iter_scheme))
2077 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2078 else if (Present (Condition (gnat_iter_scheme)))
2079 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2080 = gnat_to_gnu (Condition (gnat_iter_scheme));
2082 /* Otherwise we have an iteration scheme and the condition is given by the
2083 bounds of the subtype of the iteration variable. */
2086 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
2087 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
2088 Entity_Id gnat_type = Etype (gnat_loop_var);
2089 tree gnu_type = get_unpadded_type (gnat_type);
2090 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
2091 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
2092 tree gnu_base_type = get_base_type (gnu_type);
2093 tree gnu_first, gnu_last, gnu_limit, gnu_test;
2094 enum tree_code update_code, test_code;
2096 /* We must disable modulo reduction for the iteration variable, if any,
2097 in order for the loop comparison to be effective. */
2098 if (Reverse_Present (gnat_loop_spec))
2100 gnu_first = gnu_high;
2102 update_code = MINUS_NOMOD_EXPR;
2103 test_code = GE_EXPR;
2104 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
2108 gnu_first = gnu_low;
2109 gnu_last = gnu_high;
2110 update_code = PLUS_NOMOD_EXPR;
2111 test_code = LE_EXPR;
2112 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
2115 /* We know that the iteration variable will not overflow if GNU_LAST is
2116 a constant and is not equal to GNU_LIMIT. If it might overflow, we
2117 have to turn the limit test into an inequality test and move it to
2118 the end of the loop; as a consequence, we also have to test for an
2119 empty loop before entering it. */
2120 if (TREE_CODE (gnu_last) != INTEGER_CST
2121 || TREE_CODE (gnu_limit) != INTEGER_CST
2122 || tree_int_cst_equal (gnu_last, gnu_limit))
2125 = build3 (COND_EXPR, void_type_node,
2126 build_binary_op (LE_EXPR, integer_type_node,
2128 NULL_TREE, alloc_stmt_list ());
2129 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
2130 test_code = NE_EXPR;
2133 /* Open a new nesting level that will surround the loop to declare the
2134 iteration variable. */
2135 start_stmt_group ();
2138 /* Declare the iteration variable and set it to its initial value. */
2139 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
2140 if (DECL_BY_REF_P (gnu_loop_var))
2141 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
2143 /* Do all the arithmetics in the base type. */
2144 gnu_loop_var = convert (gnu_base_type, gnu_loop_var);
2146 /* Set either the top or bottom exit condition as appropriate depending
2147 on whether or not we know an overflow cannot occur. */
2148 gnu_test = build_binary_op (test_code, integer_type_node, gnu_loop_var,
2151 LOOP_STMT_BOT_COND (gnu_loop_stmt) = gnu_test;
2153 LOOP_STMT_TOP_COND (gnu_loop_stmt) = gnu_test;
2155 LOOP_STMT_UPDATE (gnu_loop_stmt)
2156 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2158 build_binary_op (update_code,
2159 TREE_TYPE (gnu_loop_var),
2161 convert (TREE_TYPE (gnu_loop_var),
2162 integer_one_node)));
2163 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2167 /* If the loop was named, have the name point to this loop. In this case,
2168 the association is not a DECL node, but the end label of the loop. */
2169 if (Present (Identifier (gnat_node)))
2170 save_gnu_tree (Entity (Identifier (gnat_node)), gnu_loop_label, true);
2172 /* Make the loop body into its own block, so any allocated storage will be
2173 released every iteration. This is needed for stack allocation. */
2174 LOOP_STMT_BODY (gnu_loop_stmt)
2175 = build_stmt_group (Statements (gnat_node), true);
2176 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
2178 /* If we declared a variable, then we are in a statement group for that
2179 declaration. Add the LOOP_STMT to it and make that the "loop". */
2182 add_stmt (gnu_loop_stmt);
2184 gnu_loop_stmt = end_stmt_group ();
2187 /* If we have an outer COND_EXPR, that's our result and this loop is its
2188 "true" statement. Otherwise, the result is the LOOP_STMT. */
2191 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2192 gnu_result = gnu_cond_expr;
2193 recalculate_side_effects (gnu_cond_expr);
2196 gnu_result = gnu_loop_stmt;
2198 pop_stack (&gnu_loop_label_stack);
2203 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2204 handler for the current function. */
2206 /* This is implemented by issuing a call to the appropriate VMS specific
2207 builtin. To avoid having VMS specific sections in the global gigi decls
2208 array, we maintain the decls of interest here. We can't declare them
2209 inside the function because we must mark them never to be GC'd, which we
2210 can only do at the global level. */
2212 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2213 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2216 establish_gnat_vms_condition_handler (void)
2218 tree establish_stmt;
2220 /* Elaborate the required decls on the first call. Check on the decl for
2221 the gnat condition handler to decide, as this is one we create so we are
2222 sure that it will be non null on subsequent calls. The builtin decl is
2223 looked up so remains null on targets where it is not implemented yet. */
2224 if (gnat_vms_condition_handler_decl == NULL_TREE)
2226 vms_builtin_establish_handler_decl
2228 (get_identifier ("__builtin_establish_vms_condition_handler"));
2230 gnat_vms_condition_handler_decl
2231 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2233 build_function_type_list (integer_type_node,
2237 NULL_TREE, 0, 1, 1, 0, Empty);
2239 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2240 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2243 /* Do nothing if the establish builtin is not available, which might happen
2244 on targets where the facility is not implemented. */
2245 if (vms_builtin_establish_handler_decl == NULL_TREE)
2249 = build_call_1_expr (vms_builtin_establish_handler_decl,
2251 (ADDR_EXPR, NULL_TREE,
2252 gnat_vms_condition_handler_decl));
2254 add_stmt (establish_stmt);
2257 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2258 don't return anything. */
2261 Subprogram_Body_to_gnu (Node_Id gnat_node)
2263 /* Defining identifier of a parameter to the subprogram. */
2264 Entity_Id gnat_param;
2265 /* The defining identifier for the subprogram body. Note that if a
2266 specification has appeared before for this body, then the identifier
2267 occurring in that specification will also be a defining identifier and all
2268 the calls to this subprogram will point to that specification. */
2269 Entity_Id gnat_subprog_id
2270 = (Present (Corresponding_Spec (gnat_node))
2271 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2272 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2273 tree gnu_subprog_decl;
2274 /* Its RESULT_DECL node. */
2275 tree gnu_result_decl;
2276 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2277 tree gnu_subprog_type;
2280 VEC(parm_attr,gc) *cache;
2282 /* If this is a generic object or if it has been eliminated,
2284 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2285 || Ekind (gnat_subprog_id) == E_Generic_Function
2286 || Is_Eliminated (gnat_subprog_id))
2289 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2290 the already-elaborated tree node. However, if this subprogram had its
2291 elaboration deferred, we will already have made a tree node for it. So
2292 treat it as not being defined in that case. Such a subprogram cannot
2293 have an address clause or a freeze node, so this test is safe, though it
2294 does disable some otherwise-useful error checking. */
2296 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2297 Acts_As_Spec (gnat_node)
2298 && !present_gnu_tree (gnat_subprog_id));
2299 gnu_result_decl = DECL_RESULT (gnu_subprog_decl);
2300 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2302 /* If the function returns by invisible reference, make it explicit in the
2303 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
2304 if (TREE_ADDRESSABLE (gnu_subprog_type))
2306 TREE_TYPE (gnu_result_decl)
2307 = build_reference_type (TREE_TYPE (gnu_result_decl));
2308 relayout_decl (gnu_result_decl);
2311 /* Propagate the debug mode. */
2312 if (!Needs_Debug_Info (gnat_subprog_id))
2313 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2315 /* Set the line number in the decl to correspond to that of the body so that
2316 the line number notes are written correctly. */
2317 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2319 /* Initialize the information structure for the function. */
2320 allocate_struct_function (gnu_subprog_decl, false);
2321 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2322 = GGC_CNEW (struct language_function);
2325 begin_subprog_body (gnu_subprog_decl);
2327 /* If there are Out parameters, we need to ensure that the return statement
2328 properly copies them out. We do this by making a new block and converting
2329 any inner return into a goto to a label at the end of the block. */
2330 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2331 push_stack (&gnu_return_label_stack, NULL_TREE,
2332 gnu_cico_list ? create_artificial_label (input_location)
2335 /* Get a tree corresponding to the code for the subprogram. */
2336 start_stmt_group ();
2339 /* See if there are any parameters for which we don't yet have GCC entities.
2340 These must be for Out parameters for which we will be making VAR_DECL
2341 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2342 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2343 the order of the parameters. */
2344 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2345 Present (gnat_param);
2346 gnat_param = Next_Formal_With_Extras (gnat_param))
2347 if (!present_gnu_tree (gnat_param))
2349 /* Skip any entries that have been already filled in; they must
2350 correspond to In Out parameters. */
2351 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2352 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2355 /* Do any needed references for padded types. */
2356 TREE_VALUE (gnu_cico_list)
2357 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2358 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2361 /* On VMS, establish our condition handler to possibly turn a condition into
2362 the corresponding exception if the subprogram has a foreign convention or
2365 To ensure proper execution of local finalizations on condition instances,
2366 we must turn a condition into the corresponding exception even if there
2367 is no applicable Ada handler, and need at least one condition handler per
2368 possible call chain involving GNAT code. OTOH, establishing the handler
2369 has a cost so we want to minimize the number of subprograms into which
2370 this happens. The foreign or exported condition is expected to satisfy
2371 all the constraints. */
2372 if (TARGET_ABI_OPEN_VMS
2373 && (Has_Foreign_Convention (gnat_subprog_id)
2374 || Is_Exported (gnat_subprog_id)))
2375 establish_gnat_vms_condition_handler ();
2377 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2379 /* Generate the code of the subprogram itself. A return statement will be
2380 present and any Out parameters will be handled there. */
2381 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2383 gnu_result = end_stmt_group ();
2385 /* If we populated the parameter attributes cache, we need to make sure
2386 that the cached expressions are evaluated on all possible paths. */
2387 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2390 struct parm_attr_d *pa;
2393 start_stmt_group ();
2395 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2398 add_stmt_with_node (pa->first, gnat_node);
2400 add_stmt_with_node (pa->last, gnat_node);
2402 add_stmt_with_node (pa->length, gnat_node);
2405 add_stmt (gnu_result);
2406 gnu_result = end_stmt_group ();
2409 /* If we are dealing with a return from an Ada procedure with parameters
2410 passed by copy-in/copy-out, we need to return a record containing the
2411 final values of these parameters. If the list contains only one entry,
2412 return just that entry though.
2414 For a full description of the copy-in/copy-out parameter mechanism, see
2415 the part of the gnat_to_gnu_entity routine dealing with the translation
2418 We need to make a block that contains the definition of that label and
2419 the copying of the return value. It first contains the function, then
2420 the label and copy statement. */
2421 if (TREE_VALUE (gnu_return_label_stack))
2425 start_stmt_group ();
2427 add_stmt (gnu_result);
2428 add_stmt (build1 (LABEL_EXPR, void_type_node,
2429 TREE_VALUE (gnu_return_label_stack)));
2431 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2432 if (list_length (gnu_cico_list) == 1)
2433 gnu_retval = TREE_VALUE (gnu_cico_list);
2435 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2438 add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval),
2439 End_Label (Handled_Statement_Sequence (gnat_node)));
2441 gnu_result = end_stmt_group ();
2444 pop_stack (&gnu_return_label_stack);
2446 /* Set the end location. */
2448 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2449 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2450 : Sloc (gnat_node)),
2451 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2453 end_subprog_body (gnu_result);
2455 /* Finally annotate the parameters and disconnect the trees for parameters
2456 that we have turned into variables since they are now unusable. */
2457 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2458 Present (gnat_param);
2459 gnat_param = Next_Formal_With_Extras (gnat_param))
2461 tree gnu_param = get_gnu_tree (gnat_param);
2462 annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE,
2463 DECL_BY_REF_P (gnu_param));
2464 if (TREE_CODE (gnu_param) == VAR_DECL)
2465 save_gnu_tree (gnat_param, NULL_TREE, false);
2468 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2469 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2471 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2474 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2475 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2476 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2477 If GNU_TARGET is non-null, this must be a function call on the RHS of a
2478 N_Assignment_Statement and the result is to be placed into that object. */
2481 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2483 /* The GCC node corresponding to the GNAT subprogram name. This can either
2484 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2485 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2487 tree gnu_subprog = gnat_to_gnu (Name (gnat_node));
2488 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2489 tree gnu_subprog_type = TREE_TYPE (gnu_subprog);
2490 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog);
2491 Entity_Id gnat_formal;
2492 Node_Id gnat_actual;
2493 tree gnu_actual_list = NULL_TREE;
2494 tree gnu_name_list = NULL_TREE;
2495 tree gnu_before_list = NULL_TREE;
2496 tree gnu_after_list = NULL_TREE;
2498 bool went_into_elab_proc = false;
2500 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2502 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
2503 all our args first. */
2504 if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog))
2506 tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called,
2507 gnat_node, N_Raise_Program_Error);
2509 for (gnat_actual = First_Actual (gnat_node);
2510 Present (gnat_actual);
2511 gnat_actual = Next_Actual (gnat_actual))
2512 add_stmt (gnat_to_gnu (gnat_actual));
2514 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2516 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2517 return build1 (NULL_EXPR, TREE_TYPE (gnu_subprog_type), call_expr);
2523 /* The only way we can be making a call via an access type is if Name is an
2524 explicit dereference. In that case, get the list of formal args from the
2525 type the access type is pointing to. Otherwise, get the formals from the
2526 entity being called. */
2527 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2528 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2529 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2530 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2531 gnat_formal = Empty;
2533 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2535 /* If we are translating a statement, open a new nesting level that will
2536 surround it to declare the temporaries created for the call. */
2537 if (Nkind (gnat_node) == N_Procedure_Call_Statement || gnu_target)
2539 start_stmt_group ();
2543 /* The lifetime of the temporaries created for the call ends with the call
2544 so we can give them the scope of the elaboration routine at top level. */
2545 else if (!current_function_decl)
2547 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
2548 went_into_elab_proc = true;
2551 /* Create the list of the actual parameters as GCC expects it, namely a
2552 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
2553 is an expression and the TREE_PURPOSE field is null. But skip Out
2554 parameters not passed by reference and that need not be copied in. */
2555 for (gnat_actual = First_Actual (gnat_node);
2556 Present (gnat_actual);
2557 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2558 gnat_actual = Next_Actual (gnat_actual))
2560 tree gnu_formal = present_gnu_tree (gnat_formal)
2561 ? get_gnu_tree (gnat_formal) : NULL_TREE;
2562 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2563 /* In the Out or In Out case, we must suppress conversions that yield
2564 an lvalue but can nevertheless cause the creation of a temporary,
2565 because we need the real object in this case, either to pass its
2566 address if it's passed by reference or as target of the back copy
2567 done after the call if it uses the copy-in copy-out mechanism.
2568 We do it in the In case too, except for an unchecked conversion
2569 because it alone can cause the actual to be misaligned and the
2570 addressability test is applied to the real object. */
2571 bool suppress_type_conversion
2572 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2573 && Ekind (gnat_formal) != E_In_Parameter)
2574 || (Nkind (gnat_actual) == N_Type_Conversion
2575 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2576 Node_Id gnat_name = suppress_type_conversion
2577 ? Expression (gnat_actual) : gnat_actual;
2578 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2581 /* If it's possible we may need to use this expression twice, make sure
2582 that any side-effects are handled via SAVE_EXPRs; likewise if we need
2583 to force side-effects before the call.
2584 ??? This is more conservative than we need since we don't need to do
2585 this for pass-by-ref with no conversion. */
2586 if (Ekind (gnat_formal) != E_In_Parameter)
2587 gnu_name = gnat_stabilize_reference (gnu_name, true, NULL);
2589 /* If we are passing a non-addressable parameter by reference, pass the
2590 address of a copy. In the Out or In Out case, set up to copy back
2591 out after the call. */
2593 && (DECL_BY_REF_P (gnu_formal)
2594 || (TREE_CODE (gnu_formal) == PARM_DECL
2595 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2596 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2597 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2598 && !addressable_p (gnu_name, gnu_name_type))
2600 tree gnu_orig = gnu_name, gnu_temp, gnu_stmt;
2602 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
2603 but sort of an instantiation for them. */
2604 if (TREE_CODE (gnu_name) == CONSTRUCTOR)
2607 /* If the type is passed by reference, a copy is not allowed. */
2608 else if (TREE_ADDRESSABLE (gnu_formal_type))
2609 post_error ("misaligned actual cannot be passed by reference",
2612 /* For users of Starlet we issue a warning because the interface
2613 apparently assumes that by-ref parameters outlive the procedure
2614 invocation. The code still will not work as intended, but we
2615 cannot do much better since low-level parts of the back-end
2616 would allocate temporaries at will because of the misalignment
2617 if we did not do so here. */
2618 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2621 ("?possible violation of implicit assumption", gnat_actual);
2623 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2624 Entity (Name (gnat_node)));
2625 post_error_ne ("?because of misalignment of &", gnat_actual,
2629 /* If the actual type of the object is already the nominal type,
2630 we have nothing to do, except if the size is self-referential
2631 in which case we'll remove the unpadding below. */
2632 if (TREE_TYPE (gnu_name) == gnu_name_type
2633 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2636 /* Otherwise remove the unpadding from all the objects. */
2637 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2638 && TYPE_IS_PADDING_P
2639 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))
2640 gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0);
2642 /* Otherwise convert to the nominal type of the object if it's
2643 a record type. There are several cases in which we need to
2644 make the temporary using this type instead of the actual type
2645 of the object if they are distinct, because the expectations
2646 of the callee would otherwise not be met:
2647 - if it's a justified modular type,
2648 - if the actual type is a smaller packable version of it. */
2649 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2650 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2651 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2653 gnu_name = convert (gnu_name_type, gnu_name);
2655 /* Create an explicit temporary holding the copy. This ensures that
2656 its lifetime is as narrow as possible around a statement. */
2657 gnu_temp = create_var_decl (create_tmp_var_name ("A"), NULL_TREE,
2658 TREE_TYPE (gnu_name), NULL_TREE, false,
2659 false, false, false, NULL, Empty);
2660 DECL_ARTIFICIAL (gnu_temp) = 1;
2661 DECL_IGNORED_P (gnu_temp) = 1;
2663 /* But initialize it on the fly like for an implicit temporary as
2664 we aren't necessarily dealing with a statement. */
2666 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_name);
2667 set_expr_location_from_node (gnu_stmt, gnat_actual);
2669 /* From now on, the real object is the temporary. */
2670 gnu_name = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_name), gnu_stmt,
2673 /* Set up to move the copy back to the original if needed. */
2674 if (Ekind (gnat_formal) != E_In_Parameter)
2676 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig,
2678 set_expr_location_from_node (gnu_stmt, gnat_node);
2679 append_to_statement_list (gnu_stmt, &gnu_after_list);
2683 /* Start from the real object and build the actual. */
2684 gnu_actual = gnu_name;
2686 /* If this was a procedure call, we may not have removed any padding.
2687 So do it here for the part we will use as an input, if any. */
2688 if (Ekind (gnat_formal) != E_Out_Parameter
2689 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2691 = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual);
2693 /* Put back the conversion we suppressed above in the computation of the
2694 real object. And even if we didn't suppress any conversion there, we
2695 may have suppressed a conversion to the Etype of the actual earlier,
2696 since the parent is a procedure call, so put it back here. */
2697 if (suppress_type_conversion
2698 && Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2700 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2701 gnu_actual, No_Truncation (gnat_actual));
2704 = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual);
2706 /* Make sure that the actual is in range of the formal's type. */
2707 if (Ekind (gnat_formal) != E_Out_Parameter
2708 && Do_Range_Check (gnat_actual))
2710 = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual);
2712 /* Unless this is an In parameter, we must remove any justified modular
2713 building from GNU_NAME to get an lvalue. */
2714 if (Ekind (gnat_formal) != E_In_Parameter
2715 && TREE_CODE (gnu_name) == CONSTRUCTOR
2716 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2717 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2719 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name);
2721 /* If we have not saved a GCC object for the formal, it means it is an
2722 Out parameter not passed by reference and that need not be copied in.
2723 Otherwise, first see if the parameter is passed by reference. */
2725 && TREE_CODE (gnu_formal) == PARM_DECL
2726 && DECL_BY_REF_P (gnu_formal))
2728 if (Ekind (gnat_formal) != E_In_Parameter)
2730 /* In Out or Out parameters passed by reference don't use the
2731 copy-in copy-out mechanism so the address of the real object
2732 must be passed to the function. */
2733 gnu_actual = gnu_name;
2735 /* If we have a padded type, be sure we've removed padding. */
2736 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2737 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2740 /* If we have the constructed subtype of an aliased object
2741 with an unconstrained nominal subtype, the type of the
2742 actual includes the template, although it is formally
2743 constrained. So we need to convert it back to the real
2744 constructed subtype to retrieve the constrained part
2745 and takes its address. */
2746 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2747 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2748 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2749 && Is_Array_Type (Etype (gnat_actual)))
2750 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2754 /* There is no need to convert the actual to the formal's type before
2755 taking its address. The only exception is for unconstrained array
2756 types because of the way we build fat pointers. */
2757 else if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE)
2758 gnu_actual = convert (gnu_formal_type, gnu_actual);
2760 /* The symmetry of the paths to the type of an entity is broken here
2761 since arguments don't know that they will be passed by ref. */
2762 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2763 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2766 && TREE_CODE (gnu_formal) == PARM_DECL
2767 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2769 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2770 gnu_actual = maybe_implicit_deref (gnu_actual);
2771 gnu_actual = maybe_unconstrained_array (gnu_actual);
2773 if (TYPE_IS_PADDING_P (gnu_formal_type))
2775 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2776 gnu_actual = convert (gnu_formal_type, gnu_actual);
2779 /* Take the address of the object and convert to the proper pointer
2780 type. We'd like to actually compute the address of the beginning
2781 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2782 possibility that the ARRAY_REF might return a constant and we'd be
2783 getting the wrong address. Neither approach is exactly correct,
2784 but this is the most likely to work in all cases. */
2785 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2788 && TREE_CODE (gnu_formal) == PARM_DECL
2789 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2791 gnu_actual = convert (gnu_formal_type, gnu_actual);
2793 /* If this is 'Null_Parameter, pass a zero descriptor. */
2794 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2795 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2796 && TREE_PRIVATE (gnu_actual))
2798 = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node);
2800 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2801 fill_vms_descriptor (gnu_actual,
2809 if (Ekind (gnat_formal) != E_In_Parameter)
2810 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2812 if (!(gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL))
2814 /* Make sure side-effects are evaluated before the call. */
2815 if (TREE_SIDE_EFFECTS (gnu_name))
2816 append_to_statement_list (gnu_name, &gnu_before_list);
2820 gnu_actual = convert (gnu_formal_type, gnu_actual);
2822 /* If this is 'Null_Parameter, pass a zero even though we are
2823 dereferencing it. */
2824 if (TREE_CODE (gnu_actual) == INDIRECT_REF
2825 && TREE_PRIVATE (gnu_actual)
2826 && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual)))
2827 && TREE_CODE (gnu_size) == INTEGER_CST
2828 && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0)
2830 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2831 convert (gnat_type_for_size
2832 (TREE_INT_CST_LOW (gnu_size), 1),
2836 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2839 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2842 gnu_call = build_call_list (TREE_TYPE (gnu_subprog_type), gnu_subprog_addr,
2843 nreverse (gnu_actual_list));
2844 set_expr_location_from_node (gnu_call, gnat_node);
2846 /* If it's a function call, the result is the call expression unless a target
2847 is specified, in which case we copy the result into the target and return
2848 the assignment statement. */
2849 if (Nkind (gnat_node) == N_Function_Call)
2851 tree gnu_result = gnu_call;
2853 /* If the function returns an unconstrained array or by direct reference,
2854 we have to dereference the pointer. */
2855 if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)
2856 || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type))
2857 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2861 Node_Id gnat_parent = Parent (gnat_node);
2862 enum tree_code op_code;
2864 /* If range check is needed, emit code to generate it. */
2865 if (Do_Range_Check (gnat_node))
2867 = emit_range_check (gnu_result, Etype (Name (gnat_parent)),
2870 /* ??? If the return type has non-constant size, then force the
2871 return slot optimization as we would not be able to generate
2872 a temporary. That's what has been done historically. */
2873 if (TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_subprog_type))))
2874 op_code = MODIFY_EXPR;
2876 op_code = INIT_EXPR;
2879 = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_result);
2880 add_stmt_with_node (gnu_result, gnat_parent);
2882 gnu_result = end_stmt_group ();
2886 if (went_into_elab_proc)
2887 current_function_decl = NULL_TREE;
2888 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2894 /* If this is the case where the GNAT tree contains a procedure call but the
2895 Ada procedure has copy-in/copy-out parameters, then the special parameter
2896 passing mechanism must be used. */
2897 if (TYPE_CI_CO_LIST (gnu_subprog_type))
2899 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
2900 copy-out parameters. */
2901 tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2902 const int length = list_length (gnu_cico_list);
2906 tree gnu_temp, gnu_stmt;
2908 /* The call sequence must contain one and only one call, even though
2909 the function is pure. Save the result into a temporary. */
2910 gnu_temp = create_var_decl (create_tmp_var_name ("R"), NULL_TREE,
2911 TREE_TYPE (gnu_call), NULL_TREE, false,
2912 false, false, false, NULL, Empty);
2913 DECL_ARTIFICIAL (gnu_temp) = 1;
2914 DECL_IGNORED_P (gnu_temp) = 1;
2917 = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_call);
2918 set_expr_location_from_node (gnu_stmt, gnat_node);
2920 /* Add the call statement to the list and start from its result. */
2921 append_to_statement_list (gnu_stmt, &gnu_before_list);
2922 gnu_call = gnu_temp;
2924 gnu_name_list = nreverse (gnu_name_list);
2927 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2928 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2930 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2932 for (gnat_actual = First_Actual (gnat_node);
2933 Present (gnat_actual);
2934 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2935 gnat_actual = Next_Actual (gnat_actual))
2936 /* If we are dealing with a copy in copy out parameter, we must
2937 retrieve its value from the record returned in the call. */
2938 if (!(present_gnu_tree (gnat_formal)
2939 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2940 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2941 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2942 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2943 || (DECL_BY_DESCRIPTOR_P
2944 (get_gnu_tree (gnat_formal))))))))
2945 && Ekind (gnat_formal) != E_In_Parameter)
2947 /* Get the value to assign to this Out or In Out parameter. It is
2948 either the result of the function if there is only a single such
2949 parameter or the appropriate field from the record returned. */
2953 : build_component_ref (gnu_call, NULL_TREE,
2954 TREE_PURPOSE (gnu_cico_list), false);
2956 /* If the actual is a conversion, get the inner expression, which
2957 will be the real destination, and convert the result to the
2958 type of the actual parameter. */
2960 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2962 /* If the result is a padded type, remove the padding. */
2963 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2965 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
2968 /* If the actual is a type conversion, the real target object is
2969 denoted by the inner Expression and we need to convert the
2970 result to the associated type.
2971 We also need to convert our gnu assignment target to this type
2972 if the corresponding GNU_NAME was constructed from the GNAT
2973 conversion node and not from the inner Expression. */
2974 if (Nkind (gnat_actual) == N_Type_Conversion)
2977 = convert_with_check
2978 (Etype (Expression (gnat_actual)), gnu_result,
2979 Do_Overflow_Check (gnat_actual),
2980 Do_Range_Check (Expression (gnat_actual)),
2981 Float_Truncate (gnat_actual), gnat_actual);
2983 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2984 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2987 /* Unchecked conversions as actuals for Out parameters are not
2988 allowed in user code because they are not variables, but do
2989 occur in front-end expansions. The associated GNU_NAME is
2990 always obtained from the inner expression in such cases. */
2991 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2992 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2994 No_Truncation (gnat_actual));
2997 if (Do_Range_Check (gnat_actual))
2999 = emit_range_check (gnu_result, Etype (gnat_actual),
3002 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
3003 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
3004 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
3007 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
3008 gnu_actual, gnu_result);
3009 set_expr_location_from_node (gnu_result, gnat_node);
3010 append_to_statement_list (gnu_result, &gnu_before_list);
3011 gnu_cico_list = TREE_CHAIN (gnu_cico_list);
3012 gnu_name_list = TREE_CHAIN (gnu_name_list);
3016 append_to_statement_list (gnu_call, &gnu_before_list);
3018 append_to_statement_list (gnu_after_list, &gnu_before_list);
3020 add_stmt (gnu_before_list);
3022 return end_stmt_group ();
3025 /* Subroutine of gnat_to_gnu to translate gnat_node, an
3026 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
3029 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
3031 tree gnu_jmpsave_decl = NULL_TREE;
3032 tree gnu_jmpbuf_decl = NULL_TREE;
3033 /* If just annotating, ignore all EH and cleanups. */
3034 bool gcc_zcx = (!type_annotate_only
3035 && Present (Exception_Handlers (gnat_node))
3036 && Exception_Mechanism == Back_End_Exceptions);
3038 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
3039 && Exception_Mechanism == Setjmp_Longjmp);
3040 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
3041 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
3042 tree gnu_inner_block; /* The statement(s) for the block itself. */
3047 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
3048 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
3049 add_cleanup, and when we leave the binding, end_stmt_group will create
3050 the TRY_FINALLY_EXPR.
3052 ??? The region level calls down there have been specifically put in place
3053 for a ZCX context and currently the order in which things are emitted
3054 (region/handlers) is different from the SJLJ case. Instead of putting
3055 other calls with different conditions at other places for the SJLJ case,
3056 it seems cleaner to reorder things for the SJLJ case and generalize the
3057 condition to make it not ZCX specific.
3059 If there are any exceptions or cleanup processing involved, we need an
3060 outer statement group (for Setjmp_Longjmp) and binding level. */
3061 if (binding_for_block)
3063 start_stmt_group ();
3067 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
3068 area for address of previous buffer. Do this first since we need to have
3069 the setjmp buf known for any decls in this block. */
3072 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
3073 NULL_TREE, jmpbuf_ptr_type,
3074 build_call_0_expr (get_jmpbuf_decl),
3075 false, false, false, false, NULL,
3077 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
3079 /* The __builtin_setjmp receivers will immediately reinstall it. Now
3080 because of the unstructured form of EH used by setjmp_longjmp, there
3081 might be forward edges going to __builtin_setjmp receivers on which
3082 it is uninitialized, although they will never be actually taken. */
3083 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
3084 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
3085 NULL_TREE, jmpbuf_type,
3086 NULL_TREE, false, false, false, false,
3088 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
3090 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
3092 /* When we exit this block, restore the saved value. */
3093 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
3094 End_Label (gnat_node));
3097 /* If we are to call a function when exiting this block, add a cleanup
3098 to the binding level we made above. Note that add_cleanup is FIFO
3099 so we must register this cleanup after the EH cleanup just above. */
3101 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
3102 End_Label (gnat_node));
3104 /* Now build the tree for the declarations and statements inside this block.
3105 If this is SJLJ, set our jmp_buf as the current buffer. */
3106 start_stmt_group ();
3109 add_stmt (build_call_1_expr (set_jmpbuf_decl,
3110 build_unary_op (ADDR_EXPR, NULL_TREE,
3113 if (Present (First_Real_Statement (gnat_node)))
3114 process_decls (Statements (gnat_node), Empty,
3115 First_Real_Statement (gnat_node), true, true);
3117 /* Generate code for each statement in the block. */
3118 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
3119 ? First_Real_Statement (gnat_node)
3120 : First (Statements (gnat_node)));
3121 Present (gnat_temp); gnat_temp = Next (gnat_temp))
3122 add_stmt (gnat_to_gnu (gnat_temp));
3123 gnu_inner_block = end_stmt_group ();
3125 /* Now generate code for the two exception models, if either is relevant for
3129 tree *gnu_else_ptr = 0;
3132 /* Make a binding level for the exception handling declarations and code
3133 and set up gnu_except_ptr_stack for the handlers to use. */
3134 start_stmt_group ();
3137 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3138 create_var_decl (get_identifier ("EXCEPT_PTR"),
3140 build_pointer_type (except_type_node),
3141 build_call_0_expr (get_excptr_decl), false,
3142 false, false, false, NULL, gnat_node));
3144 /* Generate code for each handler. The N_Exception_Handler case does the
3145 real work and returns a COND_EXPR for each handler, which we chain
3147 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3148 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3150 gnu_expr = gnat_to_gnu (gnat_temp);
3152 /* If this is the first one, set it as the outer one. Otherwise,
3153 point the "else" part of the previous handler to us. Then point
3154 to our "else" part. */
3156 add_stmt (gnu_expr);
3158 *gnu_else_ptr = gnu_expr;
3160 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3163 /* If none of the exception handlers did anything, re-raise but do not
3165 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3166 TREE_VALUE (gnu_except_ptr_stack));
3167 set_expr_location_from_node
3169 Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node);
3172 *gnu_else_ptr = gnu_expr;
3174 add_stmt (gnu_expr);
3176 /* End the binding level dedicated to the exception handlers and get the
3177 whole statement group. */
3178 pop_stack (&gnu_except_ptr_stack);
3180 gnu_handler = end_stmt_group ();
3182 /* If the setjmp returns 1, we restore our incoming longjmp value and
3183 then check the handlers. */
3184 start_stmt_group ();
3185 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3188 add_stmt (gnu_handler);
3189 gnu_handler = end_stmt_group ();
3191 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3192 gnu_result = build3 (COND_EXPR, void_type_node,
3195 build_unary_op (ADDR_EXPR, NULL_TREE,
3197 gnu_handler, gnu_inner_block);
3203 /* First make a block containing the handlers. */
3204 start_stmt_group ();
3205 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3206 Present (gnat_temp);
3207 gnat_temp = Next_Non_Pragma (gnat_temp))
3208 add_stmt (gnat_to_gnu (gnat_temp));
3209 gnu_handlers = end_stmt_group ();
3211 /* Now make the TRY_CATCH_EXPR for the block. */
3212 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3213 gnu_inner_block, gnu_handlers);
3216 gnu_result = gnu_inner_block;
3218 /* Now close our outer block, if we had to make one. */
3219 if (binding_for_block)
3221 add_stmt (gnu_result);
3223 gnu_result = end_stmt_group ();
3229 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3230 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3231 exception handling. */
3234 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3236 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3237 an "if" statement to select the proper exceptions. For "Others", exclude
3238 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3239 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3240 tree gnu_choice = integer_zero_node;
3241 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3244 for (gnat_temp = First (Exception_Choices (gnat_node));
3245 gnat_temp; gnat_temp = Next (gnat_temp))
3249 if (Nkind (gnat_temp) == N_Others_Choice)
3251 if (All_Others (gnat_temp))
3252 this_choice = integer_one_node;
3256 (EQ_EXPR, integer_type_node,
3261 (INDIRECT_REF, NULL_TREE,
3262 TREE_VALUE (gnu_except_ptr_stack)),
3263 get_identifier ("not_handled_by_others"), NULL_TREE,
3268 else if (Nkind (gnat_temp) == N_Identifier
3269 || Nkind (gnat_temp) == N_Expanded_Name)
3271 Entity_Id gnat_ex_id = Entity (gnat_temp);
3274 /* Exception may be a renaming. Recover original exception which is
3275 the one elaborated and registered. */
3276 if (Present (Renamed_Object (gnat_ex_id)))
3277 gnat_ex_id = Renamed_Object (gnat_ex_id);
3279 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3283 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3284 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3285 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3287 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3288 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3290 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3293 = build_component_ref
3294 (build_unary_op (INDIRECT_REF, NULL_TREE,
3295 TREE_VALUE (gnu_except_ptr_stack)),
3296 get_identifier ("lang"), NULL_TREE, false);
3300 (TRUTH_ORIF_EXPR, integer_type_node,
3301 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3302 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3309 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3310 gnu_choice, this_choice);
3313 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3316 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3317 to a GCC tree, which is returned. This is the variant for ZCX. */
3320 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3322 tree gnu_etypes_list = NULL_TREE;
3325 tree gnu_current_exc_ptr;
3326 tree gnu_incoming_exc_ptr;
3329 /* We build a TREE_LIST of nodes representing what exception types this
3330 handler can catch, with special cases for others and all others cases.
3332 Each exception type is actually identified by a pointer to the exception
3333 id, or to a dummy object for "others" and "all others". */
3334 for (gnat_temp = First (Exception_Choices (gnat_node));
3335 gnat_temp; gnat_temp = Next (gnat_temp))
3337 if (Nkind (gnat_temp) == N_Others_Choice)
3340 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3343 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3345 else if (Nkind (gnat_temp) == N_Identifier
3346 || Nkind (gnat_temp) == N_Expanded_Name)
3348 Entity_Id gnat_ex_id = Entity (gnat_temp);
3350 /* Exception may be a renaming. Recover original exception which is
3351 the one elaborated and registered. */
3352 if (Present (Renamed_Object (gnat_ex_id)))
3353 gnat_ex_id = Renamed_Object (gnat_ex_id);
3355 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3356 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3358 /* The Non_Ada_Error case for VMS exceptions is handled
3359 by the personality routine. */
3364 /* The GCC interface expects NULL to be passed for catch all handlers, so
3365 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3366 is integer_zero_node. It would not work, however, because GCC's
3367 notion of "catch all" is stronger than our notion of "others". Until
3368 we correctly use the cleanup interface as well, doing that would
3369 prevent the "all others" handlers from being seen, because nothing
3370 can be caught beyond a catch all from GCC's point of view. */
3371 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3374 start_stmt_group ();
3377 /* Expand a call to the begin_handler hook at the beginning of the handler,
3378 and arrange for a call to the end_handler hook to occur on every possible
3381 The hooks expect a pointer to the low level occurrence. This is required
3382 for our stack management scheme because a raise inside the handler pushes
3383 a new occurrence on top of the stack, which means that this top does not
3384 necessarily match the occurrence this handler was dealing with.
3386 __builtin_eh_pointer references the exception occurrence being
3387 propagated. Upon handler entry, this is the exception for which the
3388 handler is triggered. This might not be the case upon handler exit,
3389 however, as we might have a new occurrence propagated by the handler's
3390 body, and the end_handler hook called as a cleanup in this context.
3392 We use a local variable to retrieve the incoming value at handler entry
3393 time, and reuse it to feed the end_handler hook's argument at exit. */
3396 = build_call_expr (built_in_decls [BUILT_IN_EH_POINTER],
3397 1, integer_zero_node);
3398 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3399 ptr_type_node, gnu_current_exc_ptr,
3400 false, false, false, false, NULL,
3403 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3404 gnu_incoming_exc_ptr),
3406 /* ??? We don't seem to have an End_Label at hand to set the location. */
3407 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3409 add_stmt_list (Statements (gnat_node));
3412 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3416 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3419 Compilation_Unit_to_gnu (Node_Id gnat_node)
3421 const Node_Id gnat_unit = Unit (gnat_node);
3422 const bool body_p = (Nkind (gnat_unit) == N_Package_Body
3423 || Nkind (gnat_unit) == N_Subprogram_Body);
3424 const Entity_Id gnat_unit_entity = Defining_Entity (gnat_unit);
3425 /* Make the decl for the elaboration procedure. */
3426 tree gnu_elab_proc_decl
3427 = create_subprog_decl
3428 (create_concat_name (gnat_unit_entity, body_p ? "elabb" : "elabs"),
3429 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL, gnat_unit);
3430 struct elab_info *info;
3432 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3433 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3435 /* Initialize the information structure for the function. */
3436 allocate_struct_function (gnu_elab_proc_decl, false);
3439 current_function_decl = NULL_TREE;
3441 start_stmt_group ();
3444 /* For a body, first process the spec if there is one. */
3445 if (Nkind (Unit (gnat_node)) == N_Package_Body
3446 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3447 && !Acts_As_Spec (gnat_node)))
3449 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3450 finalize_from_with_types ();
3453 /* If we can inline, generate code for all the inlined subprograms. */
3456 Entity_Id gnat_entity;
3458 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
3459 Present (gnat_entity);
3460 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
3462 Node_Id gnat_body = Parent (Declaration_Node (gnat_entity));
3464 if (Nkind (gnat_body) != N_Subprogram_Body)
3466 /* ??? This really should always be present. */
3467 if (No (Corresponding_Body (gnat_body)))
3470 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
3473 if (Present (gnat_body))
3475 /* Define the entity first so we set DECL_EXTERNAL. */
3476 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
3477 add_stmt (gnat_to_gnu (gnat_body));
3482 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3484 elaborate_all_entities (gnat_node);
3486 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3487 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3488 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3492 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3494 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3496 /* Process any pragmas and actions following the unit. */
3497 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3498 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3499 finalize_from_with_types ();
3501 /* Save away what we've made so far and record this potential elaboration
3503 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3504 set_current_block_context (gnu_elab_proc_decl);
3506 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3510 &DECL_STRUCT_FUNCTION (gnu_elab_proc_decl)->function_end_locus);
3512 info->next = elab_info_list;
3513 info->elab_proc = gnu_elab_proc_decl;
3514 info->gnat_node = gnat_node;
3515 elab_info_list = info;
3517 /* Generate elaboration code for this unit, if necessary, and say whether
3519 pop_stack (&gnu_elab_proc_stack);
3521 /* Invalidate the global renaming pointers. This is necessary because
3522 stabilization of the renamed entities may create SAVE_EXPRs which
3523 have been tied to a specific elaboration routine just above. */
3524 invalidate_global_renaming_pointers ();
3527 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
3528 as gigi is concerned. This is used to avoid conversions on the LHS. */
3531 unchecked_conversion_nop (Node_Id gnat_node)
3533 Entity_Id from_type, to_type;
3535 /* The conversion must be on the LHS of an assignment or an actual parameter
3536 of a call. Otherwise, even if the conversion was essentially a no-op, it
3537 could de facto ensure type consistency and this should be preserved. */
3538 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3539 && Name (Parent (gnat_node)) == gnat_node)
3540 && !(Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
3541 && Name (Parent (gnat_node)) != gnat_node))
3544 from_type = Etype (Expression (gnat_node));
3546 /* We're interested in artificial conversions generated by the front-end
3547 to make private types explicit, e.g. in Expand_Assign_Array. */
3548 if (!Is_Private_Type (from_type))
3551 from_type = Underlying_Type (from_type);
3552 to_type = Etype (gnat_node);
3554 /* The direct conversion to the underlying type is a no-op. */
3555 if (to_type == from_type)
3558 /* For an array type, the conversion to the PAT is a no-op. */
3559 if (Ekind (from_type) == E_Array_Subtype
3560 && to_type == Packed_Array_Type (from_type))
3566 /* This function is the driver of the GNAT to GCC tree transformation process.
3567 It is the entry point of the tree transformer. GNAT_NODE is the root of
3568 some GNAT tree. Return the root of the corresponding GCC tree. If this
3569 is an expression, return the GCC equivalent of the expression. If this
3570 is a statement, return the statement or add it to the current statement
3571 group, in which case anything returned is to be interpreted as occurring
3572 after anything added. */
3575 gnat_to_gnu (Node_Id gnat_node)
3577 const Node_Kind kind = Nkind (gnat_node);
3578 bool went_into_elab_proc = false;
3579 tree gnu_result = error_mark_node; /* Default to no value. */
3580 tree gnu_result_type = void_type_node;
3581 tree gnu_expr, gnu_lhs, gnu_rhs;
3584 /* Save node number for error message and set location information. */
3585 error_gnat_node = gnat_node;
3586 Sloc_to_locus (Sloc (gnat_node), &input_location);
3588 /* If this node is a statement and we are only annotating types, return an
3589 empty statement list. */
3590 if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call))
3591 return alloc_stmt_list ();
3593 /* If this node is a non-static subexpression and we are only annotating
3594 types, make this into a NULL_EXPR. */
3595 if (type_annotate_only
3596 && IN (kind, N_Subexpr)
3597 && kind != N_Identifier
3598 && !Compile_Time_Known_Value (gnat_node))
3599 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3600 build_call_raise (CE_Range_Check_Failed, gnat_node,
3601 N_Raise_Constraint_Error));
3603 if ((IN (kind, N_Statement_Other_Than_Procedure_Call)
3604 && kind != N_Null_Statement)
3605 || kind == N_Procedure_Call_Statement
3607 || kind == N_Implicit_Label_Declaration
3608 || kind == N_Handled_Sequence_Of_Statements
3609 || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void))
3611 /* If this is a statement and we are at top level, it must be part of
3612 the elaboration procedure, so mark us as being in that procedure. */
3613 if (!current_function_decl)
3615 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3616 went_into_elab_proc = true;
3619 /* If we are in the elaboration procedure, check if we are violating a
3620 No_Elaboration_Code restriction by having a statement there. Don't
3621 check for a possible No_Elaboration_Code restriction violation on
3622 N_Handled_Sequence_Of_Statements, as we want to signal an error on
3623 every nested real statement instead. This also avoids triggering
3624 spurious errors on dummy (empty) sequences created by the front-end
3625 for package bodies in some cases. */
3626 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3627 && kind != N_Handled_Sequence_Of_Statements)
3628 Check_Elaboration_Code_Allowed (gnat_node);
3633 /********************************/
3634 /* Chapter 2: Lexical Elements */
3635 /********************************/
3638 case N_Expanded_Name:
3639 case N_Operator_Symbol:
3640 case N_Defining_Identifier:
3641 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3644 case N_Integer_Literal:
3648 /* Get the type of the result, looking inside any padding and
3649 justified modular types. Then get the value in that type. */
3650 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3652 if (TREE_CODE (gnu_type) == RECORD_TYPE
3653 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3654 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3656 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3658 /* If the result overflows (meaning it doesn't fit in its base type),
3659 abort. We would like to check that the value is within the range
3660 of the subtype, but that causes problems with subtypes whose usage
3661 will raise Constraint_Error and with biased representation, so
3663 gcc_assert (!TREE_OVERFLOW (gnu_result));
3667 case N_Character_Literal:
3668 /* If a Entity is present, it means that this was one of the
3669 literals in a user-defined character type. In that case,
3670 just return the value in the CONST_DECL. Otherwise, use the
3671 character code. In that case, the base type should be an
3672 INTEGER_TYPE, but we won't bother checking for that. */
3673 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3674 if (Present (Entity (gnat_node)))
3675 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3678 = build_int_cst_type
3679 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3682 case N_Real_Literal:
3683 /* If this is of a fixed-point type, the value we want is the
3684 value of the corresponding integer. */
3685 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3687 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3688 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3690 gcc_assert (!TREE_OVERFLOW (gnu_result));
3693 /* We should never see a Vax_Float type literal, since the front end
3694 is supposed to transform these using appropriate conversions. */
3695 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3700 Ureal ur_realval = Realval (gnat_node);
3702 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3704 /* If the real value is zero, so is the result. Otherwise,
3705 convert it to a machine number if it isn't already. That
3706 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3707 if (UR_Is_Zero (ur_realval))
3708 gnu_result = convert (gnu_result_type, integer_zero_node);
3711 if (!Is_Machine_Number (gnat_node))
3713 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3714 ur_realval, Round_Even, gnat_node);
3717 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3719 /* If we have a base of zero, divide by the denominator.
3720 Otherwise, the base must be 2 and we scale the value, which
3721 we know can fit in the mantissa of the type (hence the use
3722 of that type above). */
3723 if (No (Rbase (ur_realval)))
3725 = build_binary_op (RDIV_EXPR,
3726 get_base_type (gnu_result_type),
3728 UI_To_gnu (Denominator (ur_realval),
3732 REAL_VALUE_TYPE tmp;
3734 gcc_assert (Rbase (ur_realval) == 2);
3735 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3736 - UI_To_Int (Denominator (ur_realval)));
3737 gnu_result = build_real (gnu_result_type, tmp);
3741 /* Now see if we need to negate the result. Do it this way to
3742 properly handle -0. */
3743 if (UR_Is_Negative (Realval (gnat_node)))
3745 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3751 case N_String_Literal:
3752 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3753 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3755 String_Id gnat_string = Strval (gnat_node);
3756 int length = String_Length (gnat_string);
3759 if (length >= ALLOCA_THRESHOLD)
3760 string = XNEWVEC (char, length + 1);
3762 string = (char *) alloca (length + 1);
3764 /* Build the string with the characters in the literal. Note
3765 that Ada strings are 1-origin. */
3766 for (i = 0; i < length; i++)
3767 string[i] = Get_String_Char (gnat_string, i + 1);
3769 /* Put a null at the end of the string in case it's in a context
3770 where GCC will want to treat it as a C string. */
3773 gnu_result = build_string (length, string);
3775 /* Strings in GCC don't normally have types, but we want
3776 this to not be converted to the array type. */
3777 TREE_TYPE (gnu_result) = gnu_result_type;
3779 if (length >= ALLOCA_THRESHOLD)
3784 /* Build a list consisting of each character, then make
3786 String_Id gnat_string = Strval (gnat_node);
3787 int length = String_Length (gnat_string);
3789 tree gnu_list = NULL_TREE;
3790 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3792 for (i = 0; i < length; i++)
3795 = tree_cons (gnu_idx,
3796 build_int_cst (TREE_TYPE (gnu_result_type),
3797 Get_String_Char (gnat_string,
3801 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3806 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3811 gnu_result = Pragma_to_gnu (gnat_node);
3814 /**************************************/
3815 /* Chapter 3: Declarations and Types */
3816 /**************************************/
3818 case N_Subtype_Declaration:
3819 case N_Full_Type_Declaration:
3820 case N_Incomplete_Type_Declaration:
3821 case N_Private_Type_Declaration:
3822 case N_Private_Extension_Declaration:
3823 case N_Task_Type_Declaration:
3824 process_type (Defining_Entity (gnat_node));
3825 gnu_result = alloc_stmt_list ();
3828 case N_Object_Declaration:
3829 case N_Exception_Declaration:
3830 gnat_temp = Defining_Entity (gnat_node);
3831 gnu_result = alloc_stmt_list ();
3833 /* If we are just annotating types and this object has an unconstrained
3834 or task type, don't elaborate it. */
3835 if (type_annotate_only
3836 && (((Is_Array_Type (Etype (gnat_temp))
3837 || Is_Record_Type (Etype (gnat_temp)))
3838 && !Is_Constrained (Etype (gnat_temp)))
3839 || Is_Concurrent_Type (Etype (gnat_temp))))
3842 if (Present (Expression (gnat_node))
3843 && !(kind == N_Object_Declaration && No_Initialization (gnat_node))
3844 && (!type_annotate_only
3845 || Compile_Time_Known_Value (Expression (gnat_node))))
3847 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3848 if (Do_Range_Check (Expression (gnat_node)))
3850 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3852 /* If this object has its elaboration delayed, we must force
3853 evaluation of GNU_EXPR right now and save it for when the object
3855 if (Present (Freeze_Node (gnat_temp)))
3857 if ((Is_Public (gnat_temp) || global_bindings_p ())
3858 && !TREE_CONSTANT (gnu_expr))
3860 = create_var_decl (create_concat_name (gnat_temp, "init"),
3861 NULL_TREE, TREE_TYPE (gnu_expr),
3862 gnu_expr, false, Is_Public (gnat_temp),
3863 false, false, NULL, gnat_temp);
3865 gnu_expr = gnat_save_expr (gnu_expr);
3867 save_gnu_tree (gnat_node, gnu_expr, true);
3871 gnu_expr = NULL_TREE;
3873 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3874 gnu_expr = NULL_TREE;
3876 /* If this is a deferred constant with an address clause, we ignore the
3877 full view since the clause is on the partial view and we cannot have
3878 2 different GCC trees for the object. The only bits of the full view
3879 we will use is the initializer, but it will be directly fetched. */
3880 if (Ekind(gnat_temp) == E_Constant
3881 && Present (Address_Clause (gnat_temp))
3882 && Present (Full_View (gnat_temp)))
3883 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3885 if (No (Freeze_Node (gnat_temp)))
3886 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3889 case N_Object_Renaming_Declaration:
3890 gnat_temp = Defining_Entity (gnat_node);
3892 /* Don't do anything if this renaming is handled by the front end or if
3893 we are just annotating types and this object has a composite or task
3894 type, don't elaborate it. We return the result in case it has any
3895 SAVE_EXPRs in it that need to be evaluated here. */
3896 if (!Is_Renaming_Of_Object (gnat_temp)
3897 && ! (type_annotate_only
3898 && (Is_Array_Type (Etype (gnat_temp))
3899 || Is_Record_Type (Etype (gnat_temp))
3900 || Is_Concurrent_Type (Etype (gnat_temp)))))
3902 = gnat_to_gnu_entity (gnat_temp,
3903 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3905 gnu_result = alloc_stmt_list ();
3908 case N_Implicit_Label_Declaration:
3909 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3910 gnu_result = alloc_stmt_list ();
3913 case N_Exception_Renaming_Declaration:
3914 case N_Number_Declaration:
3915 case N_Package_Renaming_Declaration:
3916 case N_Subprogram_Renaming_Declaration:
3917 /* These are fully handled in the front end. */
3918 gnu_result = alloc_stmt_list ();
3921 /*************************************/
3922 /* Chapter 4: Names and Expressions */
3923 /*************************************/
3925 case N_Explicit_Dereference:
3926 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3927 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3928 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3931 case N_Indexed_Component:
3933 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3937 Node_Id *gnat_expr_array;
3939 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3941 /* Convert vector inputs to their representative array type, to fit
3942 what the code below expects. */
3943 gnu_array_object = maybe_vector_array (gnu_array_object);
3945 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3947 /* If we got a padded type, remove it too. */
3948 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3950 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3953 gnu_result = gnu_array_object;
3955 /* First compute the number of dimensions of the array, then
3956 fill the expression array, the order depending on whether
3957 this is a Convention_Fortran array or not. */
3958 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3959 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3960 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3961 ndim++, gnu_type = TREE_TYPE (gnu_type))
3964 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3966 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3967 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3969 i--, gnat_temp = Next (gnat_temp))
3970 gnat_expr_array[i] = gnat_temp;
3972 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3974 i++, gnat_temp = Next (gnat_temp))
3975 gnat_expr_array[i] = gnat_temp;
3977 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3978 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3980 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3981 gnat_temp = gnat_expr_array[i];
3982 gnu_expr = gnat_to_gnu (gnat_temp);
3984 if (Do_Range_Check (gnat_temp))
3987 (gnu_array_object, gnu_expr,
3988 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3989 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3992 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3993 gnu_result, gnu_expr);
3997 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4002 Node_Id gnat_range_node = Discrete_Range (gnat_node);
4005 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4006 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4008 /* Do any implicit dereferences of the prefix and do any needed
4010 gnu_result = maybe_implicit_deref (gnu_result);
4011 gnu_result = maybe_unconstrained_array (gnu_result);
4012 gnu_type = TREE_TYPE (gnu_result);
4013 if (Do_Range_Check (gnat_range_node))
4015 /* Get the bounds of the slice. */
4017 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
4018 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
4019 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
4020 /* Get the permitted bounds. */
4021 tree gnu_base_index_type
4022 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
4023 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4024 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
4025 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
4026 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
4027 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
4029 gnu_min_expr = gnat_protect_expr (gnu_min_expr);
4030 gnu_max_expr = gnat_protect_expr (gnu_max_expr);
4032 /* Derive a good type to convert everything to. */
4033 gnu_expr_type = get_base_type (gnu_index_type);
4035 /* Test whether the minimum slice value is too small. */
4036 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
4037 convert (gnu_expr_type,
4039 convert (gnu_expr_type,
4040 gnu_base_min_expr));
4042 /* Test whether the maximum slice value is too large. */
4043 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
4044 convert (gnu_expr_type,
4046 convert (gnu_expr_type,
4047 gnu_base_max_expr));
4049 /* Build a slice index check that returns the low bound,
4050 assuming the slice is not empty. */
4051 gnu_expr = emit_check
4052 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
4053 gnu_expr_l, gnu_expr_h),
4054 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
4056 /* Build a conditional expression that does the index checks and
4057 returns the low bound if the slice is not empty (max >= min),
4058 and returns the naked low bound otherwise (max < min), unless
4059 it is non-constant and the high bound is; this prevents VRP
4060 from inferring bogus ranges on the unlikely path. */
4061 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
4062 build_binary_op (GE_EXPR, gnu_expr_type,
4063 convert (gnu_expr_type,
4065 convert (gnu_expr_type,
4068 TREE_CODE (gnu_min_expr) != INTEGER_CST
4069 && TREE_CODE (gnu_max_expr) == INTEGER_CST
4070 ? gnu_max_expr : gnu_min_expr);
4073 /* Simply return the naked low bound. */
4074 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
4076 /* If this is a slice with non-constant size of an array with constant
4077 size, set the maximum size for the allocation of temporaries. */
4078 if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type))
4079 && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type)))
4080 TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type);
4082 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
4083 gnu_result, gnu_expr);
4087 case N_Selected_Component:
4089 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
4090 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
4091 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
4094 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
4095 || IN (Ekind (gnat_pref_type), Access_Kind))
4097 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
4098 gnat_pref_type = Underlying_Type (gnat_pref_type);
4099 else if (IN (Ekind (gnat_pref_type), Access_Kind))
4100 gnat_pref_type = Designated_Type (gnat_pref_type);
4103 gnu_prefix = maybe_implicit_deref (gnu_prefix);
4105 /* For discriminant references in tagged types always substitute the
4106 corresponding discriminant as the actual selected component. */
4107 if (Is_Tagged_Type (gnat_pref_type))
4108 while (Present (Corresponding_Discriminant (gnat_field)))
4109 gnat_field = Corresponding_Discriminant (gnat_field);
4111 /* For discriminant references of untagged types always substitute the
4112 corresponding stored discriminant. */
4113 else if (Present (Corresponding_Discriminant (gnat_field)))
4114 gnat_field = Original_Record_Component (gnat_field);
4116 /* Handle extracting the real or imaginary part of a complex.
4117 The real part is the first field and the imaginary the last. */
4118 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
4119 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
4120 ? REALPART_EXPR : IMAGPART_EXPR,
4121 NULL_TREE, gnu_prefix);
4124 gnu_field = gnat_to_gnu_field_decl (gnat_field);
4126 /* If there are discriminants, the prefix might be evaluated more
4127 than once, which is a problem if it has side-effects. */
4128 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
4129 ? Designated_Type (Etype
4130 (Prefix (gnat_node)))
4131 : Etype (Prefix (gnat_node))))
4132 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL);
4135 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
4136 (Nkind (Parent (gnat_node))
4137 == N_Attribute_Reference)
4138 && lvalue_required_for_attribute_p
4139 (Parent (gnat_node)));
4142 gcc_assert (gnu_result);
4143 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4147 case N_Attribute_Reference:
4149 /* The attribute designator (like an enumeration value). */
4150 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
4152 /* The Elab_Spec and Elab_Body attributes are special in that
4153 Prefix is a unit, not an object with a GCC equivalent. Similarly
4154 for Elaborated, since that variable isn't otherwise known. */
4155 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
4156 return (create_subprog_decl
4157 (create_concat_name (Entity (Prefix (gnat_node)),
4158 attribute == Attr_Elab_Body
4159 ? "elabb" : "elabs"),
4160 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
4163 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4168 /* Like 'Access as far as we are concerned. */
4169 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4170 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4171 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4175 case N_Extension_Aggregate:
4179 /* ??? It is wrong to evaluate the type now, but there doesn't
4180 seem to be any other practical way of doing it. */
4182 gcc_assert (!Expansion_Delayed (gnat_node));
4184 gnu_aggr_type = gnu_result_type
4185 = get_unpadded_type (Etype (gnat_node));
4187 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4188 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4190 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4191 else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE)
4192 gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type);
4194 if (Null_Record_Present (gnat_node))
4195 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4197 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4198 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4200 = assoc_to_constructor (Etype (gnat_node),
4201 First (Component_Associations (gnat_node)),
4203 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4204 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4206 Component_Type (Etype (gnat_node)));
4207 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4210 (COMPLEX_EXPR, gnu_aggr_type,
4211 gnat_to_gnu (Expression (First
4212 (Component_Associations (gnat_node)))),
4213 gnat_to_gnu (Expression
4215 (First (Component_Associations (gnat_node))))));
4219 gnu_result = convert (gnu_result_type, gnu_result);
4224 if (TARGET_VTABLE_USES_DESCRIPTORS
4225 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4226 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4227 gnu_result = null_fdesc_node;
4229 gnu_result = null_pointer_node;
4230 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4233 case N_Type_Conversion:
4234 case N_Qualified_Expression:
4235 /* Get the operand expression. */
4236 gnu_result = gnat_to_gnu (Expression (gnat_node));
4237 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4240 = convert_with_check (Etype (gnat_node), gnu_result,
4241 Do_Overflow_Check (gnat_node),
4242 Do_Range_Check (Expression (gnat_node)),
4243 kind == N_Type_Conversion
4244 && Float_Truncate (gnat_node), gnat_node);
4247 case N_Unchecked_Type_Conversion:
4248 gnu_result = gnat_to_gnu (Expression (gnat_node));
4250 /* Skip further processing if the conversion is deemed a no-op. */
4251 if (unchecked_conversion_nop (gnat_node))
4253 gnu_result_type = TREE_TYPE (gnu_result);
4257 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4259 /* If the result is a pointer type, see if we are improperly
4260 converting to a stricter alignment. */
4261 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4262 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4264 unsigned int align = known_alignment (gnu_result);
4265 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4266 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4268 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4269 post_error_ne_tree_2
4270 ("?source alignment (^) '< alignment of & (^)",
4271 gnat_node, Designated_Type (Etype (gnat_node)),
4272 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4275 /* If we are converting a descriptor to a function pointer, first
4276 build the pointer. */
4277 if (TARGET_VTABLE_USES_DESCRIPTORS
4278 && TREE_TYPE (gnu_result) == fdesc_type_node
4279 && POINTER_TYPE_P (gnu_result_type))
4280 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4282 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4283 No_Truncation (gnat_node));
4289 tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node));
4290 Node_Id gnat_range = Right_Opnd (gnat_node);
4291 tree gnu_low, gnu_high;
4293 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
4295 if (Nkind (gnat_range) == N_Range)
4297 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4298 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4300 else if (Nkind (gnat_range) == N_Identifier
4301 || Nkind (gnat_range) == N_Expanded_Name)
4303 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4305 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4306 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4311 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4313 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
4314 ensure that GNU_OBJ is evaluated only once and perform a full range
4316 if (operand_equal_p (gnu_low, gnu_high, 0))
4318 = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low);
4322 gnu_obj = gnat_protect_expr (gnu_obj);
4323 t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low);
4325 set_expr_location_from_node (t1, gnat_node);
4326 t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high);
4328 set_expr_location_from_node (t2, gnat_node);
4330 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2);
4333 if (kind == N_Not_In)
4334 gnu_result = invert_truthvalue (gnu_result);
4339 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4340 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4341 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4342 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4344 : (Rounded_Result (gnat_node)
4345 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4346 gnu_result_type, gnu_lhs, gnu_rhs);
4349 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4350 /* These can either be operations on booleans or on modular types.
4351 Fall through for boolean types since that's the way GNU_CODES is
4353 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4354 Modular_Integer_Kind))
4357 = (kind == N_Op_Or ? BIT_IOR_EXPR
4358 : kind == N_Op_And ? BIT_AND_EXPR
4361 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4362 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4363 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4364 gnu_result = build_binary_op (code, gnu_result_type,
4369 /* ... fall through ... */
4371 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4372 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4373 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4374 case N_Op_Mod: case N_Op_Rem:
4375 case N_Op_Rotate_Left:
4376 case N_Op_Rotate_Right:
4377 case N_Op_Shift_Left:
4378 case N_Op_Shift_Right:
4379 case N_Op_Shift_Right_Arithmetic:
4380 case N_And_Then: case N_Or_Else:
4382 enum tree_code code = gnu_codes[kind];
4383 bool ignore_lhs_overflow = false;
4384 location_t saved_location = input_location;
4387 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4388 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4389 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4391 /* Pending generic support for efficient vector logical operations in
4392 GCC, convert vectors to their representative array type view and
4394 gnu_lhs = maybe_vector_array (gnu_lhs);
4395 gnu_rhs = maybe_vector_array (gnu_rhs);
4397 /* If this is a comparison operator, convert any references to
4398 an unconstrained array value into a reference to the
4400 if (TREE_CODE_CLASS (code) == tcc_comparison)
4402 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4403 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4406 /* If the result type is a private type, its full view may be a
4407 numeric subtype. The representation we need is that of its base
4408 type, given that it is the result of an arithmetic operation. */
4409 else if (Is_Private_Type (Etype (gnat_node)))
4410 gnu_type = gnu_result_type
4411 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4413 /* If this is a shift whose count is not guaranteed to be correct,
4414 we need to adjust the shift count. */
4415 if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node))
4417 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4419 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4421 if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right)
4422 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4423 gnu_rhs, gnu_max_shift);
4424 else if (kind == N_Op_Shift_Right_Arithmetic)
4427 (MIN_EXPR, gnu_count_type,
4428 build_binary_op (MINUS_EXPR,
4431 convert (gnu_count_type,
4436 /* For right shifts, the type says what kind of shift to do,
4437 so we may need to choose a different type. In this case,
4438 we have to ignore integer overflow lest it propagates all
4439 the way down and causes a CE to be explicitly raised. */
4440 if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type))
4442 gnu_type = gnat_unsigned_type (gnu_type);
4443 ignore_lhs_overflow = true;
4445 else if (kind == N_Op_Shift_Right_Arithmetic
4446 && TYPE_UNSIGNED (gnu_type))
4448 gnu_type = gnat_signed_type (gnu_type);
4449 ignore_lhs_overflow = true;
4452 if (gnu_type != gnu_result_type)
4454 tree gnu_old_lhs = gnu_lhs;
4455 gnu_lhs = convert (gnu_type, gnu_lhs);
4456 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4457 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4458 gnu_rhs = convert (gnu_type, gnu_rhs);
4461 /* Instead of expanding overflow checks for addition, subtraction
4462 and multiplication itself, the front end will leave this to
4463 the back end when Backend_Overflow_Checks_On_Target is set.
4464 As the GCC back end itself does not know yet how to properly
4465 do overflow checking, do it here. The goal is to push
4466 the expansions further into the back end over time. */
4467 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4468 && (kind == N_Op_Add
4469 || kind == N_Op_Subtract
4470 || kind == N_Op_Multiply)
4471 && !TYPE_UNSIGNED (gnu_type)
4472 && !FLOAT_TYPE_P (gnu_type))
4473 gnu_result = build_binary_op_trapv (code, gnu_type,
4474 gnu_lhs, gnu_rhs, gnat_node);
4477 /* Some operations, e.g. comparisons of arrays, generate complex
4478 trees that need to be annotated while they are being built. */
4479 input_location = saved_location;
4480 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4483 /* If this is a logical shift with the shift count not verified,
4484 we must return zero if it is too large. We cannot compensate
4485 above in this case. */
4486 if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right)
4487 && !Shift_Count_OK (gnat_node))
4491 build_binary_op (GE_EXPR, integer_type_node,
4493 convert (TREE_TYPE (gnu_rhs),
4494 TYPE_SIZE (gnu_type))),
4495 convert (gnu_type, integer_zero_node),
4500 case N_Conditional_Expression:
4502 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4503 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4505 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4507 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4509 = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false);
4514 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4515 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4519 /* This case can apply to a boolean or a modular type.
4520 Fall through for a boolean operand since GNU_CODES is set
4521 up to handle this. */
4522 if (Is_Modular_Integer_Type (Etype (gnat_node))
4523 || (Ekind (Etype (gnat_node)) == E_Private_Type
4524 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4526 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4527 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4528 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4533 /* ... fall through ... */
4535 case N_Op_Minus: case N_Op_Abs:
4536 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4538 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4539 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4541 gnu_result_type = get_unpadded_type (Base_Type
4542 (Full_View (Etype (gnat_node))));
4544 if (Do_Overflow_Check (gnat_node)
4545 && !TYPE_UNSIGNED (gnu_result_type)
4546 && !FLOAT_TYPE_P (gnu_result_type))
4548 = build_unary_op_trapv (gnu_codes[kind],
4549 gnu_result_type, gnu_expr, gnat_node);
4551 gnu_result = build_unary_op (gnu_codes[kind],
4552 gnu_result_type, gnu_expr);
4559 bool ignore_init_type = false;
4561 gnat_temp = Expression (gnat_node);
4563 /* The Expression operand can either be an N_Identifier or
4564 Expanded_Name, which must represent a type, or a
4565 N_Qualified_Expression, which contains both the object type and an
4566 initial value for the object. */
4567 if (Nkind (gnat_temp) == N_Identifier
4568 || Nkind (gnat_temp) == N_Expanded_Name)
4569 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4570 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4572 Entity_Id gnat_desig_type
4573 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4575 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4576 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4578 gnu_init = maybe_unconstrained_array (gnu_init);
4579 if (Do_Range_Check (Expression (gnat_temp)))
4581 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4583 if (Is_Elementary_Type (gnat_desig_type)
4584 || Is_Constrained (gnat_desig_type))
4586 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4587 gnu_init = convert (gnu_type, gnu_init);
4591 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4592 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4593 gnu_type = TREE_TYPE (gnu_init);
4595 gnu_init = convert (gnu_type, gnu_init);
4601 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4602 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4603 Procedure_To_Call (gnat_node),
4604 Storage_Pool (gnat_node), gnat_node,
4609 /**************************/
4610 /* Chapter 5: Statements */
4611 /**************************/
4614 gnu_result = build1 (LABEL_EXPR, void_type_node,
4615 gnat_to_gnu (Identifier (gnat_node)));
4618 case N_Null_Statement:
4619 /* When not optimizing, turn null statements from source into gotos to
4620 the next statement that the middle-end knows how to preserve. */
4621 if (!optimize && Comes_From_Source (gnat_node))
4623 tree stmt, label = create_label_decl (NULL_TREE);
4624 start_stmt_group ();
4625 stmt = build1 (GOTO_EXPR, void_type_node, label);
4626 set_expr_location_from_node (stmt, gnat_node);
4628 stmt = build1 (LABEL_EXPR, void_type_node, label);
4629 set_expr_location_from_node (stmt, gnat_node);
4631 gnu_result = end_stmt_group ();
4634 gnu_result = alloc_stmt_list ();
4637 case N_Assignment_Statement:
4638 /* Get the LHS and RHS of the statement and convert any reference to an
4639 unconstrained array into a reference to the underlying array. */
4640 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4642 /* If the type has a size that overflows, convert this into raise of
4643 Storage_Error: execution shouldn't have gotten here anyway. */
4644 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4645 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4646 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4647 N_Raise_Storage_Error);
4648 else if (Nkind (Expression (gnat_node)) == N_Function_Call)
4650 = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs);
4654 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4656 /* If range check is needed, emit code to generate it. */
4657 if (Do_Range_Check (Expression (gnat_node)))
4658 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4662 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4664 /* If the type being assigned is an array type and the two sides
4665 are not completely disjoint, play safe and use memmove. */
4666 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4667 && Is_Array_Type (Etype (Name (gnat_node)))
4668 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4670 tree to, from, size, to_ptr, from_ptr, t;
4672 to = TREE_OPERAND (gnu_result, 0);
4673 from = TREE_OPERAND (gnu_result, 1);
4675 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4676 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4678 to_ptr = build_fold_addr_expr (to);
4679 from_ptr = build_fold_addr_expr (from);
4681 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4682 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4687 case N_If_Statement:
4689 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4691 /* Make the outer COND_EXPR. Avoid non-determinism. */
4692 gnu_result = build3 (COND_EXPR, void_type_node,
4693 gnat_to_gnu (Condition (gnat_node)),
4694 NULL_TREE, NULL_TREE);
4695 COND_EXPR_THEN (gnu_result)
4696 = build_stmt_group (Then_Statements (gnat_node), false);
4697 TREE_SIDE_EFFECTS (gnu_result) = 1;
4698 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4700 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4701 into the previous "else" part and point to where to put any
4702 outer "else". Also avoid non-determinism. */
4703 if (Present (Elsif_Parts (gnat_node)))
4704 for (gnat_temp = First (Elsif_Parts (gnat_node));
4705 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4707 gnu_expr = build3 (COND_EXPR, void_type_node,
4708 gnat_to_gnu (Condition (gnat_temp)),
4709 NULL_TREE, NULL_TREE);
4710 COND_EXPR_THEN (gnu_expr)
4711 = build_stmt_group (Then_Statements (gnat_temp), false);
4712 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4713 set_expr_location_from_node (gnu_expr, gnat_temp);
4714 *gnu_else_ptr = gnu_expr;
4715 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4718 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4722 case N_Case_Statement:
4723 gnu_result = Case_Statement_to_gnu (gnat_node);
4726 case N_Loop_Statement:
4727 gnu_result = Loop_Statement_to_gnu (gnat_node);
4730 case N_Block_Statement:
4731 start_stmt_group ();
4733 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4734 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4736 gnu_result = end_stmt_group ();
4738 if (Present (Identifier (gnat_node)))
4739 mark_out_of_scope (Entity (Identifier (gnat_node)));
4742 case N_Exit_Statement:
4744 = build2 (EXIT_STMT, void_type_node,
4745 (Present (Condition (gnat_node))
4746 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4747 (Present (Name (gnat_node))
4748 ? get_gnu_tree (Entity (Name (gnat_node)))
4749 : TREE_VALUE (gnu_loop_label_stack)));
4752 case N_Return_Statement:
4754 tree gnu_ret_val, gnu_ret_obj;
4756 /* If we have a return label defined, convert this into a branch to
4757 that label. The return proper will be handled elsewhere. */
4758 if (TREE_VALUE (gnu_return_label_stack))
4760 gnu_result = build1 (GOTO_EXPR, void_type_node,
4761 TREE_VALUE (gnu_return_label_stack));
4762 /* When not optimizing, make sure the return is preserved. */
4763 if (!optimize && Comes_From_Source (gnat_node))
4764 DECL_ARTIFICIAL (TREE_VALUE (gnu_return_label_stack)) = 0;
4768 /* If the subprogram is a function, we must return the expression. */
4769 if (Present (Expression (gnat_node)))
4771 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4772 tree gnu_result_decl = DECL_RESULT (current_function_decl);
4773 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4775 /* Do not remove the padding from GNU_RET_VAL if the inner type is
4776 self-referential since we want to allocate the fixed size. */
4777 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4778 && TYPE_IS_PADDING_P
4779 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4780 && CONTAINS_PLACEHOLDER_P
4781 (TYPE_SIZE (TREE_TYPE (gnu_ret_val))))
4782 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4784 /* If the subprogram returns by direct reference, return a pointer
4785 to the return value. */
4786 if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)
4787 || By_Ref (gnat_node))
4788 gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4790 /* Otherwise, if it returns an unconstrained array, we have to
4791 allocate a new version of the result and return it. */
4792 else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type))
4794 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4795 gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val),
4797 TREE_TYPE (gnu_subprog_type),
4798 Procedure_To_Call (gnat_node),
4799 Storage_Pool (gnat_node),
4803 /* If the subprogram returns by invisible reference, dereference
4804 the pointer it is passed using the type of the return value
4805 and build the copy operation manually. This ensures that we
4806 don't copy too much data, for example if the return type is
4807 unconstrained with a maximum size. */
4808 if (TREE_ADDRESSABLE (gnu_subprog_type))
4811 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4813 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4814 gnu_ret_obj, gnu_ret_val);
4815 add_stmt_with_node (gnu_result, gnat_node);
4816 gnu_ret_val = NULL_TREE;
4817 gnu_ret_obj = gnu_result_decl;
4820 /* Otherwise, build a regular return. */
4822 gnu_ret_obj = gnu_result_decl;
4826 gnu_ret_val = NULL_TREE;
4827 gnu_ret_obj = NULL_TREE;
4830 gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val);
4834 case N_Goto_Statement:
4835 gnu_result = build1 (GOTO_EXPR, void_type_node,
4836 gnat_to_gnu (Name (gnat_node)));
4839 /***************************/
4840 /* Chapter 6: Subprograms */
4841 /***************************/
4843 case N_Subprogram_Declaration:
4844 /* Unless there is a freeze node, declare the subprogram. We consider
4845 this a "definition" even though we're not generating code for
4846 the subprogram because we will be making the corresponding GCC
4849 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4850 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4852 gnu_result = alloc_stmt_list ();
4855 case N_Abstract_Subprogram_Declaration:
4856 /* This subprogram doesn't exist for code generation purposes, but we
4857 have to elaborate the types of any parameters and result, unless
4858 they are imported types (nothing to generate in this case). */
4860 /* Process the parameter types first. */
4863 = First_Formal_With_Extras
4864 (Defining_Entity (Specification (gnat_node)));
4865 Present (gnat_temp);
4866 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4867 if (Is_Itype (Etype (gnat_temp))
4868 && !From_With_Type (Etype (gnat_temp)))
4869 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4872 /* Then the result type, set to Standard_Void_Type for procedures. */
4875 Entity_Id gnat_temp_type
4876 = Etype (Defining_Entity (Specification (gnat_node)));
4878 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4879 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4882 gnu_result = alloc_stmt_list ();
4885 case N_Defining_Program_Unit_Name:
4886 /* For a child unit identifier go up a level to get the specification.
4887 We get this when we try to find the spec of a child unit package
4888 that is the compilation unit being compiled. */
4889 gnu_result = gnat_to_gnu (Parent (gnat_node));
4892 case N_Subprogram_Body:
4893 Subprogram_Body_to_gnu (gnat_node);
4894 gnu_result = alloc_stmt_list ();
4897 case N_Function_Call:
4898 case N_Procedure_Call_Statement:
4899 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4902 /************************/
4903 /* Chapter 7: Packages */
4904 /************************/
4906 case N_Package_Declaration:
4907 gnu_result = gnat_to_gnu (Specification (gnat_node));
4910 case N_Package_Specification:
4912 start_stmt_group ();
4913 process_decls (Visible_Declarations (gnat_node),
4914 Private_Declarations (gnat_node), Empty, true, true);
4915 gnu_result = end_stmt_group ();
4918 case N_Package_Body:
4920 /* If this is the body of a generic package - do nothing. */
4921 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4923 gnu_result = alloc_stmt_list ();
4927 start_stmt_group ();
4928 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4930 if (Present (Handled_Statement_Sequence (gnat_node)))
4931 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4933 gnu_result = end_stmt_group ();
4936 /********************************/
4937 /* Chapter 8: Visibility Rules */
4938 /********************************/
4940 case N_Use_Package_Clause:
4941 case N_Use_Type_Clause:
4942 /* Nothing to do here - but these may appear in list of declarations. */
4943 gnu_result = alloc_stmt_list ();
4946 /*********************/
4947 /* Chapter 9: Tasks */
4948 /*********************/
4950 case N_Protected_Type_Declaration:
4951 gnu_result = alloc_stmt_list ();
4954 case N_Single_Task_Declaration:
4955 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4956 gnu_result = alloc_stmt_list ();
4959 /*********************************************************/
4960 /* Chapter 10: Program Structure and Compilation Issues */
4961 /*********************************************************/
4963 case N_Compilation_Unit:
4964 /* This is not called for the main unit on which gigi is invoked. */
4965 Compilation_Unit_to_gnu (gnat_node);
4966 gnu_result = alloc_stmt_list ();
4969 case N_Subprogram_Body_Stub:
4970 case N_Package_Body_Stub:
4971 case N_Protected_Body_Stub:
4972 case N_Task_Body_Stub:
4973 /* Simply process whatever unit is being inserted. */
4974 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4978 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4981 /***************************/
4982 /* Chapter 11: Exceptions */
4983 /***************************/
4985 case N_Handled_Sequence_Of_Statements:
4986 /* If there is an At_End procedure attached to this node, and the EH
4987 mechanism is SJLJ, we must have at least a corresponding At_End
4988 handler, unless the No_Exception_Handlers restriction is set. */
4989 gcc_assert (type_annotate_only
4990 || Exception_Mechanism != Setjmp_Longjmp
4991 || No (At_End_Proc (gnat_node))
4992 || Present (Exception_Handlers (gnat_node))
4993 || No_Exception_Handlers_Set ());
4995 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4998 case N_Exception_Handler:
4999 if (Exception_Mechanism == Setjmp_Longjmp)
5000 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
5001 else if (Exception_Mechanism == Back_End_Exceptions)
5002 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
5008 case N_Push_Constraint_Error_Label:
5009 push_exception_label_stack (&gnu_constraint_error_label_stack,
5010 Exception_Label (gnat_node));
5013 case N_Push_Storage_Error_Label:
5014 push_exception_label_stack (&gnu_storage_error_label_stack,
5015 Exception_Label (gnat_node));
5018 case N_Push_Program_Error_Label:
5019 push_exception_label_stack (&gnu_program_error_label_stack,
5020 Exception_Label (gnat_node));
5023 case N_Pop_Constraint_Error_Label:
5024 gnu_constraint_error_label_stack
5025 = TREE_CHAIN (gnu_constraint_error_label_stack);
5028 case N_Pop_Storage_Error_Label:
5029 gnu_storage_error_label_stack
5030 = TREE_CHAIN (gnu_storage_error_label_stack);
5033 case N_Pop_Program_Error_Label:
5034 gnu_program_error_label_stack
5035 = TREE_CHAIN (gnu_program_error_label_stack);
5038 /******************************/
5039 /* Chapter 12: Generic Units */
5040 /******************************/
5042 case N_Generic_Function_Renaming_Declaration:
5043 case N_Generic_Package_Renaming_Declaration:
5044 case N_Generic_Procedure_Renaming_Declaration:
5045 case N_Generic_Package_Declaration:
5046 case N_Generic_Subprogram_Declaration:
5047 case N_Package_Instantiation:
5048 case N_Procedure_Instantiation:
5049 case N_Function_Instantiation:
5050 /* These nodes can appear on a declaration list but there is nothing to
5051 to be done with them. */
5052 gnu_result = alloc_stmt_list ();
5055 /**************************************************/
5056 /* Chapter 13: Representation Clauses and */
5057 /* Implementation-Dependent Features */
5058 /**************************************************/
5060 case N_Attribute_Definition_Clause:
5061 gnu_result = alloc_stmt_list ();
5063 /* The only one we need to deal with is 'Address since, for the others,
5064 the front-end puts the information elsewhere. */
5065 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
5068 /* And we only deal with 'Address if the object has a Freeze node. */
5069 gnat_temp = Entity (Name (gnat_node));
5070 if (No (Freeze_Node (gnat_temp)))
5073 /* Get the value to use as the address and save it as the equivalent
5074 for the object. When it is frozen, gnat_to_gnu_entity will do the
5076 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
5079 case N_Enumeration_Representation_Clause:
5080 case N_Record_Representation_Clause:
5082 /* We do nothing with these. SEM puts the information elsewhere. */
5083 gnu_result = alloc_stmt_list ();
5086 case N_Code_Statement:
5087 if (!type_annotate_only)
5089 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
5090 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
5091 tree gnu_clobbers = NULL_TREE, tail;
5092 bool allows_mem, allows_reg, fake;
5093 int ninputs, noutputs, i;
5094 const char **oconstraints;
5095 const char *constraint;
5098 /* First retrieve the 3 operand lists built by the front-end. */
5099 Setup_Asm_Outputs (gnat_node);
5100 while (Present (gnat_temp = Asm_Output_Variable ()))
5102 tree gnu_value = gnat_to_gnu (gnat_temp);
5103 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5104 (Asm_Output_Constraint ()));
5106 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
5110 Setup_Asm_Inputs (gnat_node);
5111 while (Present (gnat_temp = Asm_Input_Value ()))
5113 tree gnu_value = gnat_to_gnu (gnat_temp);
5114 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
5115 (Asm_Input_Constraint ()));
5117 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
5121 Clobber_Setup (gnat_node);
5122 while ((clobber = Clobber_Get_Next ()))
5124 = tree_cons (NULL_TREE,
5125 build_string (strlen (clobber) + 1, clobber),
5128 /* Then perform some standard checking and processing on the
5129 operands. In particular, mark them addressable if needed. */
5130 gnu_outputs = nreverse (gnu_outputs);
5131 noutputs = list_length (gnu_outputs);
5132 gnu_inputs = nreverse (gnu_inputs);
5133 ninputs = list_length (gnu_inputs);
5135 = (const char **) alloca (noutputs * sizeof (const char *));
5137 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
5139 tree output = TREE_VALUE (tail);
5141 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5142 oconstraints[i] = constraint;
5144 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
5145 &allows_mem, &allows_reg, &fake))
5147 /* If the operand is going to end up in memory,
5148 mark it addressable. Note that we don't test
5149 allows_mem like in the input case below; this
5150 is modelled on the C front-end. */
5152 && !gnat_mark_addressable (output))
5153 output = error_mark_node;
5156 output = error_mark_node;
5158 TREE_VALUE (tail) = output;
5161 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5163 tree input = TREE_VALUE (tail);
5165 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5167 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5169 &allows_mem, &allows_reg))
5171 /* If the operand is going to end up in memory,
5172 mark it addressable. */
5173 if (!allows_reg && allows_mem
5174 && !gnat_mark_addressable (input))
5175 input = error_mark_node;
5178 input = error_mark_node;
5180 TREE_VALUE (tail) = input;
5183 gnu_result = build5 (ASM_EXPR, void_type_node,
5184 gnu_template, gnu_outputs,
5185 gnu_inputs, gnu_clobbers, NULL_TREE);
5186 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5189 gnu_result = alloc_stmt_list ();
5197 case N_Freeze_Entity:
5198 start_stmt_group ();
5199 process_freeze_entity (gnat_node);
5200 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5201 gnu_result = end_stmt_group ();
5204 case N_Itype_Reference:
5205 if (!present_gnu_tree (Itype (gnat_node)))
5206 process_type (Itype (gnat_node));
5208 gnu_result = alloc_stmt_list ();
5211 case N_Free_Statement:
5212 if (!type_annotate_only)
5214 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5215 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5217 tree gnu_actual_obj_type = 0;
5220 /* If this is a thin pointer, we must dereference it to create
5221 a fat pointer, then go back below to a thin pointer. The
5222 reason for this is that we need a fat pointer someplace in
5223 order to properly compute the size. */
5224 if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5225 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5226 build_unary_op (INDIRECT_REF, NULL_TREE,
5229 /* If this is an unconstrained array, we know the object must
5230 have been allocated with the template in front of the object.
5231 So pass the template address, but get the total size. Do this
5232 by converting to a thin pointer. */
5233 if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5235 = convert (build_pointer_type
5236 (TYPE_OBJECT_RECORD_TYPE
5237 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5240 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5242 if (Present (Actual_Designated_Subtype (gnat_node)))
5245 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5247 if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5249 = build_unc_object_type_from_ptr (gnu_ptr_type,
5250 gnu_actual_obj_type,
5255 gnu_actual_obj_type = gnu_obj_type;
5257 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5259 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5260 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5262 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5263 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5264 tree gnu_byte_offset
5265 = convert (sizetype,
5266 size_diffop (size_zero_node, gnu_pos));
5268 = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5270 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5271 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5272 gnu_ptr, gnu_byte_offset);
5276 = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type,
5277 Procedure_To_Call (gnat_node),
5278 Storage_Pool (gnat_node),
5283 case N_Raise_Constraint_Error:
5284 case N_Raise_Program_Error:
5285 case N_Raise_Storage_Error:
5286 if (type_annotate_only)
5288 gnu_result = alloc_stmt_list ();
5292 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5294 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node, kind);
5296 /* If the type is VOID, this is a statement, so we need to
5297 generate the code for the call. Handle a Condition, if there
5299 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5301 set_expr_location_from_node (gnu_result, gnat_node);
5303 if (Present (Condition (gnat_node)))
5304 gnu_result = build3 (COND_EXPR, void_type_node,
5305 gnat_to_gnu (Condition (gnat_node)),
5306 gnu_result, alloc_stmt_list ());
5309 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5312 case N_Validate_Unchecked_Conversion:
5314 Entity_Id gnat_target_type = Target_Type (gnat_node);
5315 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5316 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5318 /* No need for any warning in this case. */
5319 if (!flag_strict_aliasing)
5322 /* If the result is a pointer type, see if we are either converting
5323 from a non-pointer or from a pointer to a type with a different
5324 alias set and warn if so. If the result is defined in the same
5325 unit as this unchecked conversion, we can allow this because we
5326 can know to make the pointer type behave properly. */
5327 else if (POINTER_TYPE_P (gnu_target_type)
5328 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5329 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5331 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5332 ? TREE_TYPE (gnu_source_type)
5334 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5336 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5337 || get_alias_set (gnu_target_desig_type) != 0)
5338 && (!POINTER_TYPE_P (gnu_source_type)
5339 || (TYPE_DUMMY_P (gnu_source_desig_type)
5340 != TYPE_DUMMY_P (gnu_target_desig_type))
5341 || (TYPE_DUMMY_P (gnu_source_desig_type)
5342 && gnu_source_desig_type != gnu_target_desig_type)
5343 || !alias_sets_conflict_p
5344 (get_alias_set (gnu_source_desig_type),
5345 get_alias_set (gnu_target_desig_type))))
5348 ("?possible aliasing problem for type&",
5349 gnat_node, Target_Type (gnat_node));
5351 ("\\?use -fno-strict-aliasing switch for references",
5354 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5355 gnat_node, Target_Type (gnat_node));
5359 /* But if the result is a fat pointer type, we have no mechanism to
5360 do that, so we unconditionally warn in problematic cases. */
5361 else if (TYPE_IS_FAT_POINTER_P (gnu_target_type))
5363 tree gnu_source_array_type
5364 = TYPE_IS_FAT_POINTER_P (gnu_source_type)
5365 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5367 tree gnu_target_array_type
5368 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5370 if ((TYPE_DUMMY_P (gnu_target_array_type)
5371 || get_alias_set (gnu_target_array_type) != 0)
5372 && (!TYPE_IS_FAT_POINTER_P (gnu_source_type)
5373 || (TYPE_DUMMY_P (gnu_source_array_type)
5374 != TYPE_DUMMY_P (gnu_target_array_type))
5375 || (TYPE_DUMMY_P (gnu_source_array_type)
5376 && gnu_source_array_type != gnu_target_array_type)
5377 || !alias_sets_conflict_p
5378 (get_alias_set (gnu_source_array_type),
5379 get_alias_set (gnu_target_array_type))))
5382 ("?possible aliasing problem for type&",
5383 gnat_node, Target_Type (gnat_node));
5385 ("\\?use -fno-strict-aliasing switch for references",
5390 gnu_result = alloc_stmt_list ();
5394 /* SCIL nodes require no processing for GCC. Other nodes should only
5395 be present when annotating types. */
5396 gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only);
5397 gnu_result = alloc_stmt_list ();
5400 /* If we pushed the processing of the elaboration routine, pop it back. */
5401 if (went_into_elab_proc)
5402 current_function_decl = NULL_TREE;
5404 /* When not optimizing, turn boolean rvalues B into B != false tests
5405 so that the code just below can put the location information of the
5406 reference to B on the inequality operator for better debug info. */
5408 && (kind == N_Identifier
5409 || kind == N_Expanded_Name
5410 || kind == N_Explicit_Dereference
5411 || kind == N_Function_Call
5412 || kind == N_Indexed_Component
5413 || kind == N_Selected_Component)
5414 && TREE_CODE (get_base_type (gnu_result_type)) == BOOLEAN_TYPE
5415 && !lvalue_required_p (gnat_node, gnu_result_type, false, false, false))
5416 gnu_result = build_binary_op (NE_EXPR, gnu_result_type,
5417 convert (gnu_result_type, gnu_result),
5418 convert (gnu_result_type,
5419 boolean_false_node));
5421 /* Set the location information on the result if it is a real expression.
5422 References can be reused for multiple GNAT nodes and they would get
5423 the location information of their last use. Note that we may have
5424 no result if we tried to build a CALL_EXPR node to a procedure with
5425 no side-effects and optimization is enabled. */
5427 && EXPR_P (gnu_result)
5428 && TREE_CODE (gnu_result) != NOP_EXPR
5429 && !REFERENCE_CLASS_P (gnu_result)
5430 && !EXPR_HAS_LOCATION (gnu_result))
5431 set_expr_location_from_node (gnu_result, gnat_node);
5433 /* If we're supposed to return something of void_type, it means we have
5434 something we're elaborating for effect, so just return. */
5435 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5438 /* If the result is a constant that overflowed, raise Constraint_Error. */
5439 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5441 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5443 = build1 (NULL_EXPR, gnu_result_type,
5444 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5445 N_Raise_Constraint_Error));
5448 /* If our result has side-effects and is of an unconstrained type,
5449 make a SAVE_EXPR so that we can be sure it will only be referenced
5450 once. Note we must do this before any conversions. */
5451 if (TREE_SIDE_EFFECTS (gnu_result)
5452 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5453 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5454 gnu_result = gnat_stabilize_reference (gnu_result, false, NULL);
5456 /* Now convert the result to the result type, unless we are in one of the
5459 1. If this is the Name of an assignment statement or a parameter of
5460 a procedure call, return the result almost unmodified since the
5461 RHS will have to be converted to our type in that case, unless
5462 the result type has a simpler size. Likewise if there is just
5463 a no-op unchecked conversion in-between. Similarly, don't convert
5464 integral types that are the operands of an unchecked conversion
5465 since we need to ignore those conversions (for 'Valid).
5467 2. If we have a label (which doesn't have any well-defined type), a
5468 field or an error, return the result almost unmodified. Also don't
5469 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5470 its size since those are the cases where the front end may have the
5471 type wrong due to "instantiating" the unconstrained record with
5472 discriminant values. Similarly, if the two types are record types
5473 with the same name don't convert. This will be the case when we are
5474 converting from a packable version of a type to its original type and
5475 we need those conversions to be NOPs in order for assignments into
5476 these types to work properly.
5478 3. If the type is void or if we have no result, return error_mark_node
5479 to show we have no result.
5481 4. Finally, if the type of the result is already correct. */
5483 if (Present (Parent (gnat_node))
5484 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5485 && Name (Parent (gnat_node)) == gnat_node)
5486 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5487 && unchecked_conversion_nop (Parent (gnat_node)))
5488 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5489 && Name (Parent (gnat_node)) != gnat_node)
5490 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5491 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5492 && !AGGREGATE_TYPE_P (gnu_result_type)
5493 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5494 && !(TYPE_SIZE (gnu_result_type)
5495 && TYPE_SIZE (TREE_TYPE (gnu_result))
5496 && (AGGREGATE_TYPE_P (gnu_result_type)
5497 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5498 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5499 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5501 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5502 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5503 && (CONTAINS_PLACEHOLDER_P
5504 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5505 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5506 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5508 /* Remove padding only if the inner object is of self-referential
5509 size: in that case it must be an object of unconstrained type
5510 with a default discriminant and we want to avoid copying too
5512 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5513 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5514 (TREE_TYPE (gnu_result))))))
5515 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5519 else if (TREE_CODE (gnu_result) == LABEL_DECL
5520 || TREE_CODE (gnu_result) == FIELD_DECL
5521 || TREE_CODE (gnu_result) == ERROR_MARK
5522 || (TYPE_SIZE (gnu_result_type)
5523 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5524 && TREE_CODE (gnu_result) != INDIRECT_REF
5525 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5526 || ((TYPE_NAME (gnu_result_type)
5527 == TYPE_NAME (TREE_TYPE (gnu_result)))
5528 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5529 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5531 /* Remove any padding. */
5532 if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5533 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5537 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5538 gnu_result = error_mark_node;
5540 else if (gnu_result_type != TREE_TYPE (gnu_result))
5541 gnu_result = convert (gnu_result_type, gnu_result);
5543 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5544 while ((TREE_CODE (gnu_result) == NOP_EXPR
5545 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5546 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5547 gnu_result = TREE_OPERAND (gnu_result, 0);
5552 /* Subroutine of above to push the exception label stack. GNU_STACK is
5553 a pointer to the stack to update and GNAT_LABEL, if present, is the
5554 label to push onto the stack. */
5557 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5559 tree gnu_label = (Present (gnat_label)
5560 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5563 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5566 /* Record the current code position in GNAT_NODE. */
5569 record_code_position (Node_Id gnat_node)
5571 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5573 add_stmt_with_node (stmt_stmt, gnat_node);
5574 save_gnu_tree (gnat_node, stmt_stmt, true);
5577 /* Insert the code for GNAT_NODE at the position saved for that node. */
5580 insert_code_for (Node_Id gnat_node)
5582 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5583 save_gnu_tree (gnat_node, NULL_TREE, true);
5586 /* Start a new statement group chained to the previous group. */
5589 start_stmt_group (void)
5591 struct stmt_group *group = stmt_group_free_list;
5593 /* First see if we can get one from the free list. */
5595 stmt_group_free_list = group->previous;
5597 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5599 group->previous = current_stmt_group;
5600 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5601 current_stmt_group = group;
5604 /* Add GNU_STMT to the current statement group. */
5607 add_stmt (tree gnu_stmt)
5609 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5612 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5615 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5617 if (Present (gnat_node))
5618 set_expr_location_from_node (gnu_stmt, gnat_node);
5619 add_stmt (gnu_stmt);
5622 /* Add a declaration statement for GNU_DECL to the current statement group.
5623 Get SLOC from Entity_Id. */
5626 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5628 tree type = TREE_TYPE (gnu_decl);
5629 tree gnu_stmt, gnu_init, t;
5631 /* If this is a variable that Gigi is to ignore, we may have been given
5632 an ERROR_MARK. So test for it. We also might have been given a
5633 reference for a renaming. So only do something for a decl. Also
5634 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5635 if (!DECL_P (gnu_decl)
5636 || (TREE_CODE (gnu_decl) == TYPE_DECL
5637 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5640 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5642 /* If we are global, we don't want to actually output the DECL_EXPR for
5643 this decl since we already have evaluated the expressions in the
5644 sizes and positions as globals and doing it again would be wrong. */
5645 if (global_bindings_p ())
5647 /* Mark everything as used to prevent node sharing with subprograms.
5648 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5649 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5650 MARK_VISITED (gnu_stmt);
5651 if (TREE_CODE (gnu_decl) == VAR_DECL
5652 || TREE_CODE (gnu_decl) == CONST_DECL)
5654 MARK_VISITED (DECL_SIZE (gnu_decl));
5655 MARK_VISITED (DECL_SIZE_UNIT (gnu_decl));
5656 MARK_VISITED (DECL_INITIAL (gnu_decl));
5658 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5659 else if (TREE_CODE (gnu_decl) == TYPE_DECL
5660 && ((TREE_CODE (type) == RECORD_TYPE
5661 && !TYPE_FAT_POINTER_P (type))
5662 || TREE_CODE (type) == UNION_TYPE
5663 || TREE_CODE (type) == QUAL_UNION_TYPE))
5664 MARK_VISITED (TYPE_ADA_SIZE (type));
5667 add_stmt_with_node (gnu_stmt, gnat_entity);
5669 /* If this is a variable and an initializer is attached to it, it must be
5670 valid for the context. Similar to init_const in create_var_decl_1. */
5671 if (TREE_CODE (gnu_decl) == VAR_DECL
5672 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5673 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5674 || (TREE_STATIC (gnu_decl)
5675 && !initializer_constant_valid_p (gnu_init,
5676 TREE_TYPE (gnu_init)))))
5678 /* If GNU_DECL has a padded type, convert it to the unpadded
5679 type so the assignment is done properly. */
5680 if (TYPE_IS_PADDING_P (type))
5681 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5685 gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init);
5687 DECL_INITIAL (gnu_decl) = NULL_TREE;
5688 if (TREE_READONLY (gnu_decl))
5690 TREE_READONLY (gnu_decl) = 0;
5691 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5694 add_stmt_with_node (gnu_stmt, gnat_entity);
5698 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5701 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5705 if (TREE_VISITED (t))
5708 /* Don't mark a dummy type as visited because we want to mark its sizes
5709 and fields once it's filled in. */
5710 else if (!TYPE_IS_DUMMY_P (t))
5711 TREE_VISITED (t) = 1;
5714 TYPE_SIZES_GIMPLIFIED (t) = 1;
5719 /* Mark nodes rooted at T with TREE_VISITED and types as having their
5720 sized gimplified. We use this to indicate all variable sizes and
5721 positions in global types may not be shared by any subprogram. */
5724 mark_visited (tree t)
5726 walk_tree (&t, mark_visited_r, NULL, NULL);
5729 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5732 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5733 void *data ATTRIBUTE_UNUSED)
5737 if (TREE_CODE (t) == SAVE_EXPR)
5738 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5743 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5744 set its location to that of GNAT_NODE if present. */
5747 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5749 if (Present (gnat_node))
5750 set_expr_location_from_node (gnu_cleanup, gnat_node);
5751 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5754 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5757 set_block_for_group (tree gnu_block)
5759 gcc_assert (!current_stmt_group->block);
5760 current_stmt_group->block = gnu_block;
5763 /* Return code corresponding to the current code group. It is normally
5764 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5765 BLOCK or cleanups were set. */
5768 end_stmt_group (void)
5770 struct stmt_group *group = current_stmt_group;
5771 tree gnu_retval = group->stmt_list;
5773 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5774 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5775 make a BIND_EXPR. Note that we nest in that because the cleanup may
5776 reference variables in the block. */
5777 if (gnu_retval == NULL_TREE)
5778 gnu_retval = alloc_stmt_list ();
5780 if (group->cleanups)
5781 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5784 if (current_stmt_group->block)
5785 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5786 gnu_retval, group->block);
5788 /* Remove this group from the stack and add it to the free list. */
5789 current_stmt_group = group->previous;
5790 group->previous = stmt_group_free_list;
5791 stmt_group_free_list = group;
5796 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5800 add_stmt_list (List_Id gnat_list)
5804 if (Present (gnat_list))
5805 for (gnat_node = First (gnat_list); Present (gnat_node);
5806 gnat_node = Next (gnat_node))
5807 add_stmt (gnat_to_gnu (gnat_node));
5810 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5811 If BINDING_P is true, push and pop a binding level around the list. */
5814 build_stmt_group (List_Id gnat_list, bool binding_p)
5816 start_stmt_group ();
5820 add_stmt_list (gnat_list);
5824 return end_stmt_group ();
5827 /* Push and pop routines for stacks. We keep a free list around so we
5828 don't waste tree nodes. */
5831 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5833 tree gnu_node = gnu_stack_free_list;
5837 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5838 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5839 TREE_PURPOSE (gnu_node) = gnu_purpose;
5840 TREE_VALUE (gnu_node) = gnu_value;
5843 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5845 *gnu_stack_ptr = gnu_node;
5849 pop_stack (tree *gnu_stack_ptr)
5851 tree gnu_node = *gnu_stack_ptr;
5853 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5854 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5855 gnu_stack_free_list = gnu_node;
5858 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5861 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5862 gimple_seq *post_p ATTRIBUTE_UNUSED)
5864 tree expr = *expr_p;
5867 if (IS_ADA_STMT (expr))
5868 return gnat_gimplify_stmt (expr_p);
5870 switch (TREE_CODE (expr))
5873 /* If this is for a scalar, just make a VAR_DECL for it. If for
5874 an aggregate, get a null pointer of the appropriate type and
5876 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5877 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5878 convert (build_pointer_type (TREE_TYPE (expr)),
5879 integer_zero_node));
5882 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5883 TREE_NO_WARNING (*expr_p) = 1;
5886 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5889 case UNCONSTRAINED_ARRAY_REF:
5890 /* We should only do this if we are just elaborating for side-effects,
5891 but we can't know that yet. */
5892 *expr_p = TREE_OPERAND (*expr_p, 0);
5896 op = TREE_OPERAND (expr, 0);
5898 if (TREE_CODE (op) == CONSTRUCTOR)
5900 /* If we are taking the address of a constant CONSTRUCTOR, make sure
5901 it is put into static memory. We know it's going to be read-only
5902 given the semantics we have and it must be in static memory when
5903 the reference is in an elaboration procedure. */
5904 if (TREE_CONSTANT (op))
5906 tree new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
5907 TREE_ADDRESSABLE (new_var) = 1;
5908 gimple_add_tmp_var (new_var);
5910 TREE_READONLY (new_var) = 1;
5911 TREE_STATIC (new_var) = 1;
5912 DECL_INITIAL (new_var) = op;
5914 TREE_OPERAND (expr, 0) = new_var;
5915 recompute_tree_invariant_for_addr_expr (expr);
5918 /* Otherwise explicitly create the local temporary. That's required
5919 if the type is passed by reference. */
5922 tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C");
5923 TREE_ADDRESSABLE (new_var) = 1;
5924 gimple_add_tmp_var (new_var);
5926 mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op);
5927 gimplify_and_add (mod, pre_p);
5929 TREE_OPERAND (expr, 0) = new_var;
5930 recompute_tree_invariant_for_addr_expr (expr);
5936 return GS_UNHANDLED;
5939 op = DECL_EXPR_DECL (expr);
5941 /* The expressions for the RM bounds must be gimplified to ensure that
5942 they are properly elaborated. See gimplify_decl_expr. */
5943 if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL)
5944 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op)))
5945 switch (TREE_CODE (TREE_TYPE (op)))
5952 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val;
5954 val = TYPE_RM_MIN_VALUE (type);
5957 gimplify_one_sizepos (&val, pre_p);
5958 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
5959 SET_TYPE_RM_MIN_VALUE (t, val);
5962 val = TYPE_RM_MAX_VALUE (type);
5965 gimplify_one_sizepos (&val, pre_p);
5966 for (t = type; t; t = TYPE_NEXT_VARIANT (t))
5967 SET_TYPE_RM_MAX_VALUE (t, val);
5977 /* ... fall through ... */
5980 return GS_UNHANDLED;
5984 /* Generate GIMPLE in place for the statement at *STMT_P. */
5986 static enum gimplify_status
5987 gnat_gimplify_stmt (tree *stmt_p)
5989 tree stmt = *stmt_p;
5991 switch (TREE_CODE (stmt))
5994 *stmt_p = STMT_STMT_STMT (stmt);
5999 tree gnu_start_label = create_artificial_label (input_location);
6000 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
6003 /* Set to emit the statements of the loop. */
6004 *stmt_p = NULL_TREE;
6006 /* We first emit the start label and then a conditional jump to
6007 the end label if there's a top condition, then the body of the
6008 loop, then a conditional branch to the end label, then the update,
6009 if any, and finally a jump to the start label and the definition
6010 of the end label. */
6011 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6015 if (LOOP_STMT_TOP_COND (stmt))
6016 append_to_statement_list (build3 (COND_EXPR, void_type_node,
6017 LOOP_STMT_TOP_COND (stmt),
6024 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
6026 if (LOOP_STMT_BOT_COND (stmt))
6027 append_to_statement_list (build3 (COND_EXPR, void_type_node,
6028 LOOP_STMT_BOT_COND (stmt),
6035 if (LOOP_STMT_UPDATE (stmt))
6036 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
6038 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
6039 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
6040 append_to_statement_list (t, stmt_p);
6042 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
6049 /* Build a statement to jump to the corresponding end label, then
6050 see if it needs to be conditional. */
6051 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
6052 if (EXIT_STMT_COND (stmt))
6053 *stmt_p = build3 (COND_EXPR, void_type_node,
6054 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
6062 /* Force references to each of the entities in packages withed by GNAT_NODE.
6063 Operate recursively but check that we aren't elaborating something more
6066 This routine is exclusively called in type_annotate mode, to compute DDA
6067 information for types in withed units, for ASIS use. */
6070 elaborate_all_entities (Node_Id gnat_node)
6072 Entity_Id gnat_with_clause, gnat_entity;
6074 /* Process each unit only once. As we trace the context of all relevant
6075 units transitively, including generic bodies, we may encounter the
6076 same generic unit repeatedly. */
6077 if (!present_gnu_tree (gnat_node))
6078 save_gnu_tree (gnat_node, integer_zero_node, true);
6080 /* Save entities in all context units. A body may have an implicit_with
6081 on its own spec, if the context includes a child unit, so don't save
6083 for (gnat_with_clause = First (Context_Items (gnat_node));
6084 Present (gnat_with_clause);
6085 gnat_with_clause = Next (gnat_with_clause))
6086 if (Nkind (gnat_with_clause) == N_With_Clause
6087 && !present_gnu_tree (Library_Unit (gnat_with_clause))
6088 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
6090 elaborate_all_entities (Library_Unit (gnat_with_clause));
6092 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
6094 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
6095 Present (gnat_entity);
6096 gnat_entity = Next_Entity (gnat_entity))
6097 if (Is_Public (gnat_entity)
6098 && Convention (gnat_entity) != Convention_Intrinsic
6099 && Ekind (gnat_entity) != E_Package
6100 && Ekind (gnat_entity) != E_Package_Body
6101 && Ekind (gnat_entity) != E_Operator
6102 && !(IN (Ekind (gnat_entity), Type_Kind)
6103 && !Is_Frozen (gnat_entity))
6104 && !((Ekind (gnat_entity) == E_Procedure
6105 || Ekind (gnat_entity) == E_Function)
6106 && Is_Intrinsic_Subprogram (gnat_entity))
6107 && !IN (Ekind (gnat_entity), Named_Kind)
6108 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
6109 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6111 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
6114 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
6116 /* Retrieve compilation unit node of generic body. */
6117 while (Present (gnat_body)
6118 && Nkind (gnat_body) != N_Compilation_Unit)
6119 gnat_body = Parent (gnat_body);
6121 /* If body is available, elaborate its context. */
6122 if (Present (gnat_body))
6123 elaborate_all_entities (gnat_body);
6127 if (Nkind (Unit (gnat_node)) == N_Package_Body)
6128 elaborate_all_entities (Library_Unit (gnat_node));
6131 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
6134 process_freeze_entity (Node_Id gnat_node)
6136 const Entity_Id gnat_entity = Entity (gnat_node);
6137 const Entity_Kind kind = Ekind (gnat_entity);
6138 tree gnu_old, gnu_new;
6140 /* If this is a package, we need to generate code for the package. */
6141 if (kind == E_Package)
6144 (Parent (Corresponding_Body
6145 (Parent (Declaration_Node (gnat_entity)))));
6149 /* Don't do anything for class-wide types as they are always transformed
6150 into their root type. */
6151 if (kind == E_Class_Wide_Type)
6154 /* Check for an old definition. This freeze node might be for an Itype. */
6156 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE;
6158 /* If this entity has an address representation clause, GNU_OLD is the
6159 address, so discard it here. */
6160 if (Present (Address_Clause (gnat_entity)))
6161 gnu_old = NULL_TREE;
6163 /* Don't do anything for subprograms that may have been elaborated before
6164 their freeze nodes. This can happen, for example, because of an inner
6165 call in an instance body or because of previous compilation of a spec
6166 for inlining purposes. */
6168 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6169 && (kind == E_Function || kind == E_Procedure))
6170 || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6171 && kind == E_Subprogram_Type)))
6174 /* If we have a non-dummy type old tree, we have nothing to do, except
6175 aborting if this is the public view of a private type whose full view was
6176 not delayed, as this node was never delayed as it should have been. We
6177 let this happen for concurrent types and their Corresponding_Record_Type,
6178 however, because each might legitimately be elaborated before its own
6179 freeze node, e.g. while processing the other. */
6181 && !(TREE_CODE (gnu_old) == TYPE_DECL
6182 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6184 gcc_assert ((IN (kind, Incomplete_Or_Private_Kind)
6185 && Present (Full_View (gnat_entity))
6186 && No (Freeze_Node (Full_View (gnat_entity))))
6187 || Is_Concurrent_Type (gnat_entity)
6188 || (IN (kind, Record_Kind)
6189 && Is_Concurrent_Record_Type (gnat_entity)));
6193 /* Reset the saved tree, if any, and elaborate the object or type for real.
6194 If there is a full view, elaborate it and use the result. And, if this
6195 is the root type of a class-wide type, reuse it for the latter. */
6198 save_gnu_tree (gnat_entity, NULL_TREE, false);
6199 if (IN (kind, Incomplete_Or_Private_Kind)
6200 && Present (Full_View (gnat_entity))
6201 && present_gnu_tree (Full_View (gnat_entity)))
6202 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6203 if (IN (kind, Type_Kind)
6204 && Present (Class_Wide_Type (gnat_entity))
6205 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6206 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6209 if (IN (kind, Incomplete_Or_Private_Kind)
6210 && Present (Full_View (gnat_entity)))
6212 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6214 /* Propagate back-annotations from full view to partial view. */
6215 if (Unknown_Alignment (gnat_entity))
6216 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6218 if (Unknown_Esize (gnat_entity))
6219 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6221 if (Unknown_RM_Size (gnat_entity))
6222 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6224 /* The above call may have defined this entity (the simplest example
6225 of this is when we have a private enumeral type since the bounds
6226 will have the public view). */
6227 if (!present_gnu_tree (gnat_entity))
6228 save_gnu_tree (gnat_entity, gnu_new, false);
6233 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6234 && present_gnu_tree (Declaration_Node (gnat_entity)))
6235 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6237 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6240 if (IN (kind, Type_Kind)
6241 && Present (Class_Wide_Type (gnat_entity))
6242 && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity)
6243 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6245 /* If we've made any pointers to the old version of this type, we
6246 have to update them. */
6248 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6249 TREE_TYPE (gnu_new));
6252 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6253 We make two passes, one to elaborate anything other than bodies (but
6254 we declare a function if there was no spec). The second pass
6255 elaborates the bodies.
6257 GNAT_END_LIST gives the element in the list past the end. Normally,
6258 this is Empty, but can be First_Real_Statement for a
6259 Handled_Sequence_Of_Statements.
6261 We make a complete pass through both lists if PASS1P is true, then make
6262 the second pass over both lists if PASS2P is true. The lists usually
6263 correspond to the public and private parts of a package. */
6266 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6267 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6269 List_Id gnat_decl_array[2];
6273 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6276 for (i = 0; i <= 1; i++)
6277 if (Present (gnat_decl_array[i]))
6278 for (gnat_decl = First (gnat_decl_array[i]);
6279 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6281 /* For package specs, we recurse inside the declarations,
6282 thus taking the two pass approach inside the boundary. */
6283 if (Nkind (gnat_decl) == N_Package_Declaration
6284 && (Nkind (Specification (gnat_decl)
6285 == N_Package_Specification)))
6286 process_decls (Visible_Declarations (Specification (gnat_decl)),
6287 Private_Declarations (Specification (gnat_decl)),
6288 Empty, true, false);
6290 /* Similarly for any declarations in the actions of a
6292 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6294 process_freeze_entity (gnat_decl);
6295 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6298 /* Package bodies with freeze nodes get their elaboration deferred
6299 until the freeze node, but the code must be placed in the right
6300 place, so record the code position now. */
6301 else if (Nkind (gnat_decl) == N_Package_Body
6302 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6303 record_code_position (gnat_decl);
6305 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6306 && Present (Library_Unit (gnat_decl))
6307 && Present (Freeze_Node
6310 (Library_Unit (gnat_decl)))))))
6311 record_code_position
6312 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6314 /* We defer most subprogram bodies to the second pass. */
6315 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6317 if (Acts_As_Spec (gnat_decl))
6319 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6321 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6322 && Ekind (gnat_subprog_id) != E_Generic_Function)
6323 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6327 /* For bodies and stubs that act as their own specs, the entity
6328 itself must be elaborated in the first pass, because it may
6329 be used in other declarations. */
6330 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6332 Node_Id gnat_subprog_id
6333 = Defining_Entity (Specification (gnat_decl));
6335 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6336 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6337 && Ekind (gnat_subprog_id) != E_Generic_Function)
6338 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6341 /* Concurrent stubs stand for the corresponding subprogram bodies,
6342 which are deferred like other bodies. */
6343 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6344 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6348 add_stmt (gnat_to_gnu (gnat_decl));
6351 /* Here we elaborate everything we deferred above except for package bodies,
6352 which are elaborated at their freeze nodes. Note that we must also
6353 go inside things (package specs and freeze nodes) the first pass did. */
6355 for (i = 0; i <= 1; i++)
6356 if (Present (gnat_decl_array[i]))
6357 for (gnat_decl = First (gnat_decl_array[i]);
6358 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6360 if (Nkind (gnat_decl) == N_Subprogram_Body
6361 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6362 || Nkind (gnat_decl) == N_Task_Body_Stub
6363 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6364 add_stmt (gnat_to_gnu (gnat_decl));
6366 else if (Nkind (gnat_decl) == N_Package_Declaration
6367 && (Nkind (Specification (gnat_decl)
6368 == N_Package_Specification)))
6369 process_decls (Visible_Declarations (Specification (gnat_decl)),
6370 Private_Declarations (Specification (gnat_decl)),
6371 Empty, false, true);
6373 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6374 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6378 /* Make a unary operation of kind CODE using build_unary_op, but guard
6379 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6380 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6381 the operation is to be performed in that type. GNAT_NODE is the gnat
6382 node conveying the source location for which the error should be
6386 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6389 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6391 operand = gnat_protect_expr (operand);
6393 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6394 operand, TYPE_MIN_VALUE (gnu_type)),
6395 build_unary_op (code, gnu_type, operand),
6396 CE_Overflow_Check_Failed, gnat_node);
6399 /* Make a binary operation of kind CODE using build_binary_op, but guard
6400 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6401 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6402 Usually the operation is to be performed in that type. GNAT_NODE is
6403 the GNAT node conveying the source location for which the error should
6407 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6408 tree right, Node_Id gnat_node)
6410 tree lhs = gnat_protect_expr (left);
6411 tree rhs = gnat_protect_expr (right);
6412 tree type_max = TYPE_MAX_VALUE (gnu_type);
6413 tree type_min = TYPE_MIN_VALUE (gnu_type);
6416 tree zero = convert (gnu_type, integer_zero_node);
6421 int precision = TYPE_PRECISION (gnu_type);
6423 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6425 /* Prefer a constant or known-positive rhs to simplify checks. */
6426 if (!TREE_CONSTANT (rhs)
6427 && commutative_tree_code (code)
6428 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6429 && tree_expr_nonnegative_p (lhs))))
6436 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6438 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6440 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6442 /* Try a few strategies that may be cheaper than the general
6443 code at the end of the function, if the rhs is not known.
6445 - Call library function for 64-bit multiplication (complex)
6446 - Widen, if input arguments are sufficiently small
6447 - Determine overflow using wrapped result for addition/subtraction. */
6449 if (!TREE_CONSTANT (rhs))
6451 /* Even for add/subtract double size to get another base type. */
6452 int needed_precision = precision * 2;
6454 if (code == MULT_EXPR && precision == 64)
6456 tree int_64 = gnat_type_for_size (64, 0);
6458 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6459 convert (int_64, lhs),
6460 convert (int_64, rhs)));
6463 else if (needed_precision <= BITS_PER_WORD
6464 || (code == MULT_EXPR
6465 && needed_precision <= LONG_LONG_TYPE_SIZE))
6467 tree wide_type = gnat_type_for_size (needed_precision, 0);
6469 tree wide_result = build_binary_op (code, wide_type,
6470 convert (wide_type, lhs),
6471 convert (wide_type, rhs));
6473 tree check = build_binary_op
6474 (TRUTH_ORIF_EXPR, integer_type_node,
6475 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6476 convert (wide_type, type_min)),
6477 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6478 convert (wide_type, type_max)));
6480 tree result = convert (gnu_type, wide_result);
6483 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6486 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6488 tree unsigned_type = gnat_type_for_size (precision, 1);
6489 tree wrapped_expr = convert
6490 (gnu_type, build_binary_op (code, unsigned_type,
6491 convert (unsigned_type, lhs),
6492 convert (unsigned_type, rhs)));
6494 tree result = convert
6495 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6497 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6498 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6499 tree check = build_binary_op
6500 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6501 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6502 integer_type_node, wrapped_expr, lhs));
6505 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6512 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6513 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6514 build_binary_op (MINUS_EXPR, gnu_type,
6517 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6518 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6519 build_binary_op (MINUS_EXPR, gnu_type,
6524 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6525 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6526 build_binary_op (PLUS_EXPR, gnu_type,
6529 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6530 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6531 build_binary_op (PLUS_EXPR, gnu_type,
6536 /* The check here is designed to be efficient if the rhs is constant,
6537 but it will work for any rhs by using integer division.
6538 Four different check expressions determine wether X * C overflows,
6541 C > 0 => X > type_max / C || X < type_min / C
6542 C == -1 => X == type_min
6543 C < -1 => X > type_min / C || X < type_max / C */
6545 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6546 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6548 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6549 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6550 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6551 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6552 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6554 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6555 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6556 build_int_cst (gnu_type, -1)),
6557 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6558 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6559 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6560 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6567 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6569 /* If we can fold the expression to a constant, just return it.
6570 The caller will deal with overflow, no need to generate a check. */
6571 if (TREE_CONSTANT (gnu_expr))
6574 check = fold_build3 (COND_EXPR, integer_type_node,
6575 rhs_lt_zero, check_neg, check_pos);
6577 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6580 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6581 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6582 which we have to check. GNAT_NODE is the GNAT node conveying the source
6583 location for which the error should be signaled. */
6586 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6588 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6589 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6590 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6591 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6593 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6594 This can for example happen when translating 'Val or 'Value. */
6595 if (gnu_compare_type == gnu_range_type)
6598 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6599 we can't do anything since we might be truncating the bounds. No
6600 check is needed in this case. */
6601 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6602 && (TYPE_PRECISION (gnu_compare_type)
6603 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6606 /* Checked expressions must be evaluated only once. */
6607 gnu_expr = gnat_protect_expr (gnu_expr);
6609 /* There's no good type to use here, so we might as well use
6610 integer_type_node. Note that the form of the check is
6611 (not (expr >= lo)) or (not (expr <= hi))
6612 the reason for this slightly convoluted form is that NaNs
6613 are not considered to be in range in the float case. */
6615 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6617 (build_binary_op (GE_EXPR, integer_type_node,
6618 convert (gnu_compare_type, gnu_expr),
6619 convert (gnu_compare_type, gnu_low))),
6621 (build_binary_op (LE_EXPR, integer_type_node,
6622 convert (gnu_compare_type, gnu_expr),
6623 convert (gnu_compare_type,
6625 gnu_expr, CE_Range_Check_Failed, gnat_node);
6628 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6629 we are about to index, GNU_EXPR is the index expression to be checked,
6630 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6631 has to be checked. Note that for index checking we cannot simply use the
6632 emit_range_check function (although very similar code needs to be generated
6633 in both cases) since for index checking the array type against which we are
6634 checking the indices may be unconstrained and consequently we need to get
6635 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6636 The place where we need to do that is in subprograms having unconstrained
6637 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6638 location for which the error should be signaled. */
6641 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6642 tree gnu_high, Node_Id gnat_node)
6644 tree gnu_expr_check;
6646 /* Checked expressions must be evaluated only once. */
6647 gnu_expr = gnat_protect_expr (gnu_expr);
6649 /* Must do this computation in the base type in case the expression's
6650 type is an unsigned subtypes. */
6651 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6653 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6654 the object we are handling. */
6655 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6656 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6658 /* There's no good type to use here, so we might as well use
6659 integer_type_node. */
6661 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6662 build_binary_op (LT_EXPR, integer_type_node,
6664 convert (TREE_TYPE (gnu_expr_check),
6666 build_binary_op (GT_EXPR, integer_type_node,
6668 convert (TREE_TYPE (gnu_expr_check),
6670 gnu_expr, CE_Index_Check_Failed, gnat_node);
6673 /* GNU_COND contains the condition corresponding to an access, discriminant or
6674 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6675 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6676 REASON is the code that says why the exception was raised. GNAT_NODE is
6677 the GNAT node conveying the source location for which the error should be
6681 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6684 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6686 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6687 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6688 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6691 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6692 we don't need to evaluate it just for the check. */
6693 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6698 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6699 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6700 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6701 float to integer conversion with truncation; otherwise round.
6702 GNAT_NODE is the GNAT node conveying the source location for which the
6703 error should be signaled. */
6706 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6707 bool rangep, bool truncatep, Node_Id gnat_node)
6709 tree gnu_type = get_unpadded_type (gnat_type);
6710 tree gnu_in_type = TREE_TYPE (gnu_expr);
6711 tree gnu_in_basetype = get_base_type (gnu_in_type);
6712 tree gnu_base_type = get_base_type (gnu_type);
6713 tree gnu_result = gnu_expr;
6715 /* If we are not doing any checks, the output is an integral type, and
6716 the input is not a floating type, just do the conversion. This
6717 shortcut is required to avoid problems with packed array types
6718 and simplifies code in all cases anyway. */
6719 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6720 && !FLOAT_TYPE_P (gnu_in_type))
6721 return convert (gnu_type, gnu_expr);
6723 /* First convert the expression to its base type. This
6724 will never generate code, but makes the tests below much simpler.
6725 But don't do this if converting from an integer type to an unconstrained
6726 array type since then we need to get the bounds from the original
6728 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6729 gnu_result = convert (gnu_in_basetype, gnu_result);
6731 /* If overflow checks are requested, we need to be sure the result will
6732 fit in the output base type. But don't do this if the input
6733 is integer and the output floating-point. */
6735 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6737 /* Ensure GNU_EXPR only gets evaluated once. */
6738 tree gnu_input = gnat_protect_expr (gnu_result);
6739 tree gnu_cond = integer_zero_node;
6740 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6741 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6742 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6743 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6745 /* Convert the lower bounds to signed types, so we're sure we're
6746 comparing them properly. Likewise, convert the upper bounds
6747 to unsigned types. */
6748 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6749 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6751 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6752 && !TYPE_UNSIGNED (gnu_in_basetype))
6753 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6755 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6756 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6758 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6759 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6761 /* Check each bound separately and only if the result bound
6762 is tighter than the bound on the input type. Note that all the
6763 types are base types, so the bounds must be constant. Also,
6764 the comparison is done in the base type of the input, which
6765 always has the proper signedness. First check for input
6766 integer (which means output integer), output float (which means
6767 both float), or mixed, in which case we always compare.
6768 Note that we have to do the comparison which would *fail* in the
6769 case of an error since if it's an FP comparison and one of the
6770 values is a NaN or Inf, the comparison will fail. */
6771 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6772 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6773 : (FLOAT_TYPE_P (gnu_base_type)
6774 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6775 TREE_REAL_CST (gnu_out_lb))
6779 (build_binary_op (GE_EXPR, integer_type_node,
6780 gnu_input, convert (gnu_in_basetype,
6783 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6784 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6785 : (FLOAT_TYPE_P (gnu_base_type)
6786 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6787 TREE_REAL_CST (gnu_in_lb))
6790 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6792 (build_binary_op (LE_EXPR, integer_type_node,
6794 convert (gnu_in_basetype,
6797 if (!integer_zerop (gnu_cond))
6798 gnu_result = emit_check (gnu_cond, gnu_input,
6799 CE_Overflow_Check_Failed, gnat_node);
6802 /* Now convert to the result base type. If this is a non-truncating
6803 float-to-integer conversion, round. */
6804 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6807 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6808 tree gnu_conv, gnu_zero, gnu_comp, calc_type;
6809 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6810 const struct real_format *fmt;
6812 /* The following calculations depend on proper rounding to even
6813 of each arithmetic operation. In order to prevent excess
6814 precision from spoiling this property, use the widest hardware
6815 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6817 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6819 /* FIXME: Should not have padding in the first place. */
6820 if (TYPE_IS_PADDING_P (calc_type))
6821 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6823 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6824 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6825 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6826 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6827 half_minus_pred_half);
6828 gnu_pred_half = build_real (calc_type, pred_half);
6830 /* If the input is strictly negative, subtract this value
6831 and otherwise add it from the input. For 0.5, the result
6832 is exactly between 1.0 and the machine number preceding 1.0
6833 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6834 will round to 1.0, while all other number with an absolute
6835 value less than 0.5 round to 0.0. For larger numbers exactly
6836 halfway between integers, rounding will always be correct as
6837 the true mathematical result will be closer to the higher
6838 integer compared to the lower one. So, this constant works
6839 for all floating-point numbers.
6841 The reason to use the same constant with subtract/add instead
6842 of a positive and negative constant is to allow the comparison
6843 to be scheduled in parallel with retrieval of the constant and
6844 conversion of the input to the calc_type (if necessary). */
6846 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6847 gnu_result = gnat_protect_expr (gnu_result);
6848 gnu_conv = convert (calc_type, gnu_result);
6850 = fold_build2 (GE_EXPR, integer_type_node, gnu_result, gnu_zero);
6852 = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6853 gnu_subtract_pred_half
6854 = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6855 gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp,
6856 gnu_add_pred_half, gnu_subtract_pred_half);
6859 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6860 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6861 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6862 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6864 gnu_result = convert (gnu_base_type, gnu_result);
6866 /* Finally, do the range check if requested. Note that if the result type
6867 is a modular type, the range check is actually an overflow check. */
6869 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6870 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6871 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6873 return convert (gnu_type, gnu_result);
6876 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6879 smaller_packable_type_p (tree type, tree record_type)
6883 /* We're not interested in variants here. */
6884 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6887 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6888 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6891 size = TYPE_SIZE (type);
6892 rsize = TYPE_SIZE (record_type);
6894 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6897 return tree_int_cst_lt (size, rsize) != 0;
6900 /* Return true if GNU_EXPR can be directly addressed. This is the case
6901 unless it is an expression involving computation or if it involves a
6902 reference to a bitfield or to an object not sufficiently aligned for
6903 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6904 be directly addressed as an object of this type.
6906 *** Notes on addressability issues in the Ada compiler ***
6908 This predicate is necessary in order to bridge the gap between Gigi
6909 and the middle-end about addressability of GENERIC trees. A tree
6910 is said to be addressable if it can be directly addressed, i.e. if
6911 its address can be taken, is a multiple of the type's alignment on
6912 strict-alignment architectures and returns the first storage unit
6913 assigned to the object represented by the tree.
6915 In the C family of languages, everything is in practice addressable
6916 at the language level, except for bit-fields. This means that these
6917 compilers will take the address of any tree that doesn't represent
6918 a bit-field reference and expect the result to be the first storage
6919 unit assigned to the object. Even in cases where this will result
6920 in unaligned accesses at run time, nothing is supposed to be done
6921 and the program is considered as erroneous instead (see PR c/18287).
6923 The implicit assumptions made in the middle-end are in keeping with
6924 the C viewpoint described above:
6925 - the address of a bit-field reference is supposed to be never
6926 taken; the compiler (generally) will stop on such a construct,
6927 - any other tree is addressable if it is formally addressable,
6928 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6930 In Ada, the viewpoint is the opposite one: nothing is addressable
6931 at the language level unless explicitly declared so. This means
6932 that the compiler will both make sure that the trees representing
6933 references to addressable ("aliased" in Ada parlance) objects are
6934 addressable and make no real attempts at ensuring that the trees
6935 representing references to non-addressable objects are addressable.
6937 In the first case, Ada is effectively equivalent to C and handing
6938 down the direct result of applying ADDR_EXPR to these trees to the
6939 middle-end works flawlessly. In the second case, Ada cannot afford
6940 to consider the program as erroneous if the address of trees that
6941 are not addressable is requested for technical reasons, unlike C;
6942 as a consequence, the Ada compiler must arrange for either making
6943 sure that this address is not requested in the middle-end or for
6944 compensating by inserting temporaries if it is requested in Gigi.
6946 The first goal can be achieved because the middle-end should not
6947 request the address of non-addressable trees on its own; the only
6948 exception is for the invocation of low-level block operations like
6949 memcpy, for which the addressability requirements are lower since
6950 the type's alignment can be disregarded. In practice, this means
6951 that Gigi must make sure that such operations cannot be applied to
6952 non-BLKmode bit-fields.
6954 The second goal is achieved by means of the addressable_p predicate
6955 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6956 They will be turned during gimplification into proper temporaries
6957 whose address will be used in lieu of that of the original tree. */
6960 addressable_p (tree gnu_expr, tree gnu_type)
6962 /* The size of the real type of the object must not be smaller than
6963 that of the expected type, otherwise an indirect access in the
6964 latter type would be larger than the object. Only records need
6965 to be considered in practice. */
6967 && TREE_CODE (gnu_type) == RECORD_TYPE
6968 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6971 switch (TREE_CODE (gnu_expr))
6977 /* All DECLs are addressable: if they are in a register, we can force
6981 case UNCONSTRAINED_ARRAY_REF:
6983 /* Taking the address of a dereference yields the original pointer. */
6988 /* Taking the address yields a pointer to the constant pool. */
6992 /* Taking the address of a static constructor yields a pointer to the
6993 tree constant pool. */
6994 return TREE_STATIC (gnu_expr) ? true : false;
7005 /* All rvalues are deemed addressable since taking their address will
7006 force a temporary to be created by the middle-end. */
7010 /* The address of a compound expression is that of its 2nd operand. */
7011 return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type);
7014 /* We accept &COND_EXPR as soon as both operands are addressable and
7015 expect the outcome to be the address of the selected operand. */
7016 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
7017 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
7020 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
7021 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
7022 the field is sufficiently aligned, in case it is subject
7023 to a pragma Component_Alignment. But we don't need to
7024 check the alignment of the containing record, as it is
7025 guaranteed to be not smaller than that of its most
7026 aligned field that is not a bit-field. */
7027 && (!STRICT_ALIGNMENT
7028 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
7029 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
7030 /* The field of a padding record is always addressable. */
7031 || TYPE_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
7032 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7034 case ARRAY_REF: case ARRAY_RANGE_REF:
7035 case REALPART_EXPR: case IMAGPART_EXPR:
7037 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
7040 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
7041 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7043 case VIEW_CONVERT_EXPR:
7045 /* This is addressable if we can avoid a copy. */
7046 tree type = TREE_TYPE (gnu_expr);
7047 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
7048 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
7049 && (!STRICT_ALIGNMENT
7050 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7051 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
7052 || ((TYPE_MODE (type) == BLKmode
7053 || TYPE_MODE (inner_type) == BLKmode)
7054 && (!STRICT_ALIGNMENT
7055 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
7056 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
7057 || TYPE_ALIGN_OK (type)
7058 || TYPE_ALIGN_OK (inner_type))))
7059 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
7067 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
7068 a separate Freeze node exists, delay the bulk of the processing. Otherwise
7069 make a GCC type for GNAT_ENTITY and set up the correspondence. */
7072 process_type (Entity_Id gnat_entity)
7075 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
7078 /* If we are to delay elaboration of this type, just do any
7079 elaborations needed for expressions within the declaration and
7080 make a dummy type entry for this node and its Full_View (if
7081 any) in case something points to it. Don't do this if it
7082 has already been done (the only way that can happen is if
7083 the private completion is also delayed). */
7084 if (Present (Freeze_Node (gnat_entity))
7085 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7086 && Present (Full_View (gnat_entity))
7087 && Freeze_Node (Full_View (gnat_entity))
7088 && !present_gnu_tree (Full_View (gnat_entity))))
7090 elaborate_entity (gnat_entity);
7094 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
7095 save_gnu_tree (gnat_entity, gnu_decl, false);
7096 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
7097 && Present (Full_View (gnat_entity)))
7098 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
7104 /* If we saved away a dummy type for this node it means that this
7105 made the type that corresponds to the full type of an incomplete
7106 type. Clear that type for now and then update the type in the
7110 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
7111 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
7113 save_gnu_tree (gnat_entity, NULL_TREE, false);
7116 /* Now fully elaborate the type. */
7117 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
7118 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
7120 /* If we have an old type and we've made pointers to this type,
7121 update those pointers. */
7123 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7124 TREE_TYPE (gnu_new));
7126 /* If this is a record type corresponding to a task or protected type
7127 that is a completion of an incomplete type, perform a similar update
7128 on the type. ??? Including protected types here is a guess. */
7129 if (IN (Ekind (gnat_entity), Record_Kind)
7130 && Is_Concurrent_Record_Type (gnat_entity)
7131 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7134 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7136 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7138 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7141 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7142 TREE_TYPE (gnu_new));
7146 /* GNAT_ENTITY is the type of the resulting constructors,
7147 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7148 and GNU_TYPE is the GCC type of the corresponding record.
7150 Return a CONSTRUCTOR to build the record. */
7153 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7155 tree gnu_list, gnu_result;
7157 /* We test for GNU_FIELD being empty in the case where a variant
7158 was the last thing since we don't take things off GNAT_ASSOC in
7159 that case. We check GNAT_ASSOC in case we have a variant, but it
7162 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7163 gnat_assoc = Next (gnat_assoc))
7165 Node_Id gnat_field = First (Choices (gnat_assoc));
7166 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7167 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7169 /* The expander is supposed to put a single component selector name
7170 in every record component association. */
7171 gcc_assert (No (Next (gnat_field)));
7173 /* Ignore fields that have Corresponding_Discriminants since we'll
7174 be setting that field in the parent. */
7175 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7176 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7179 /* Also ignore discriminants of Unchecked_Unions. */
7180 else if (Is_Unchecked_Union (gnat_entity)
7181 && Ekind (Entity (gnat_field)) == E_Discriminant)
7184 /* Before assigning a value in an aggregate make sure range checks
7185 are done if required. Then convert to the type of the field. */
7186 if (Do_Range_Check (Expression (gnat_assoc)))
7187 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7189 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7191 /* Add the field and expression to the list. */
7192 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7195 gnu_result = extract_values (gnu_list, gnu_type);
7197 #ifdef ENABLE_CHECKING
7201 /* Verify every entry in GNU_LIST was used. */
7202 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7203 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7210 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7211 the first element of an array aggregate. It may itself be an aggregate.
7212 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7213 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7214 for range checking. */
7217 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7218 Entity_Id gnat_component_type)
7220 tree gnu_expr_list = NULL_TREE;
7221 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7224 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7226 /* If the expression is itself an array aggregate then first build the
7227 innermost constructor if it is part of our array (multi-dimensional
7229 if (Nkind (gnat_expr) == N_Aggregate
7230 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7231 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7232 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7233 TREE_TYPE (gnu_array_type),
7234 gnat_component_type);
7237 gnu_expr = gnat_to_gnu (gnat_expr);
7239 /* Before assigning the element to the array, make sure it is
7241 if (Do_Range_Check (gnat_expr))
7242 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7246 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7249 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7252 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7255 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7256 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7257 of the associations that are from RECORD_TYPE. If we see an internal
7258 record, make a recursive call to fill it in as well. */
7261 extract_values (tree values, tree record_type)
7263 tree result = NULL_TREE;
7266 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7270 /* _Parent is an internal field, but may have values in the aggregate,
7271 so check for values first. */
7272 if ((tem = purpose_member (field, values)))
7274 value = TREE_VALUE (tem);
7275 TREE_ADDRESSABLE (tem) = 1;
7278 else if (DECL_INTERNAL_P (field))
7280 value = extract_values (values, TREE_TYPE (field));
7281 if (TREE_CODE (value) == CONSTRUCTOR
7282 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7286 /* If we have a record subtype, the names will match, but not the
7287 actual FIELD_DECLs. */
7288 for (tem = values; tem; tem = TREE_CHAIN (tem))
7289 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7291 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7292 TREE_ADDRESSABLE (tem) = 1;
7298 result = tree_cons (field, value, result);
7301 return gnat_build_constructor (record_type, nreverse (result));
7304 /* EXP is to be treated as an array or record. Handle the cases when it is
7305 an access object and perform the required dereferences. */
7308 maybe_implicit_deref (tree exp)
7310 /* If the type is a pointer, dereference it. */
7311 if (POINTER_TYPE_P (TREE_TYPE (exp))
7312 || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp)))
7313 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7315 /* If we got a padded type, remove it too. */
7316 if (TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7317 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7322 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7323 location and false if it doesn't. In the former case, set the Gigi global
7324 variable REF_FILENAME to the simple debug file name as given by sinput. */
7327 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7329 if (Sloc == No_Location)
7332 if (Sloc <= Standard_Location)
7334 *locus = BUILTINS_LOCATION;
7339 Source_File_Index file = Get_Source_File_Index (Sloc);
7340 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7341 Column_Number column = Get_Column_Number (Sloc);
7342 struct line_map *map = &line_table->maps[file - 1];
7344 /* Translate the location according to the line-map.h formula. */
7345 *locus = map->start_location
7346 + ((line - map->to_line) << map->column_bits)
7347 + (column & ((1 << map->column_bits) - 1));
7351 = IDENTIFIER_POINTER
7353 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7358 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7359 don't do anything if it doesn't correspond to a source location. */
7362 set_expr_location_from_node (tree node, Node_Id gnat_node)
7366 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7369 SET_EXPR_LOCATION (node, locus);
7372 /* Return a colon-separated list of encodings contained in encoded Ada
7376 extract_encoding (const char *name)
7378 char *encoding = GGC_NEWVEC (char, strlen (name));
7379 get_encoding (name, encoding);
7383 /* Extract the Ada name from an encoded name. */
7386 decode_name (const char *name)
7388 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7389 __gnat_decode (name, decoded, 0);
7393 /* Post an error message. MSG is the error message, properly annotated.
7394 NODE is the node at which to post the error and the node to use for the
7395 "&" substitution. */
7398 post_error (const char *msg, Node_Id node)
7400 String_Template temp;
7403 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7404 fp.Array = msg, fp.Bounds = &temp;
7406 Error_Msg_N (fp, node);
7409 /* Similar, but NODE is the node at which to post the error and ENT
7410 is the node to use for the "&" substitution. */
7413 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7415 String_Template temp;
7418 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7419 fp.Array = msg, fp.Bounds = &temp;
7421 Error_Msg_NE (fp, node, ent);
7424 /* Similar, but NODE is the node at which to post the error, ENT is the node
7425 to use for the "&" substitution, and NUM is the number to use for ^. */
7428 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int num)
7430 String_Template temp;
7433 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7434 fp.Array = msg, fp.Bounds = &temp;
7435 Error_Msg_Uint_1 = UI_From_Int (num);
7438 Error_Msg_NE (fp, node, ent);
7441 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7442 number to write. If the tree represents a constant that fits within
7443 a host integer, the text inside curly brackets in MSG will be output
7444 (presumably including a '^'). Otherwise that text will not be output
7445 and the text inside square brackets will be output instead. */
7448 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7450 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7451 String_Template temp = {1, 0};
7453 char start_yes, end_yes, start_no, end_no;
7457 fp.Array = newmsg, fp.Bounds = &temp;
7459 if (host_integerp (t, 1)
7460 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7463 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7467 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7468 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7471 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7473 for (p = msg, q = newmsg; *p; p++)
7475 if (*p == start_yes)
7476 for (p++; *p != end_yes; p++)
7478 else if (*p == start_no)
7479 for (p++; *p != end_no; p++)
7487 temp.High_Bound = strlen (newmsg);
7489 Error_Msg_NE (fp, node, ent);
7492 /* Similar to post_error_ne_tree, except that NUM is a second integer to write
7496 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7499 Error_Msg_Uint_2 = UI_From_Int (num);
7500 post_error_ne_tree (msg, node, ent, t);
7503 /* Initialize the table that maps GNAT codes to GCC codes for simple
7504 binary and unary operations. */
7507 init_code_table (void)
7509 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7510 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7512 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7513 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7514 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7515 gnu_codes[N_Op_Eq] = EQ_EXPR;
7516 gnu_codes[N_Op_Ne] = NE_EXPR;
7517 gnu_codes[N_Op_Lt] = LT_EXPR;
7518 gnu_codes[N_Op_Le] = LE_EXPR;
7519 gnu_codes[N_Op_Gt] = GT_EXPR;
7520 gnu_codes[N_Op_Ge] = GE_EXPR;
7521 gnu_codes[N_Op_Add] = PLUS_EXPR;
7522 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7523 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7524 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7525 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7526 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7527 gnu_codes[N_Op_Abs] = ABS_EXPR;
7528 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7529 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7530 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7531 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7532 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7533 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7536 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7540 get_exception_label (char kind)
7542 if (kind == N_Raise_Constraint_Error)
7543 return TREE_VALUE (gnu_constraint_error_label_stack);
7544 else if (kind == N_Raise_Storage_Error)
7545 return TREE_VALUE (gnu_storage_error_label_stack);
7546 else if (kind == N_Raise_Program_Error)
7547 return TREE_VALUE (gnu_program_error_label_stack);
7552 #include "gt-ada-trans.h"