1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2009, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
21 * GNAT was originally developed by the GNAT team at New York University. *
22 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 ****************************************************************************/
28 #include "coretypes.h"
35 #include "tree-iterator.h"
39 #include "adadecode.h"
55 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
56 for fear of running out of stack space. If we need more, we use xmalloc
58 #define ALLOCA_THRESHOLD 1000
60 /* Let code below know whether we are targetting VMS without need of
61 intrusive preprocessor directives. */
62 #ifndef TARGET_ABI_OPEN_VMS
63 #define TARGET_ABI_OPEN_VMS 0
66 /* For efficient float-to-int rounding, it is necessary to know whether
67 floating-point arithmetic may use wider intermediate results. When
68 FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
69 that arithmetic does not widen if double precision is emulated. */
70 #ifndef FP_ARITH_MAY_WIDEN
71 #if defined(HAVE_extendsfdf2)
72 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
74 #define FP_ARITH_MAY_WIDEN 0
78 extern char *__gnat_to_canonical_file_spec (char *);
83 struct Node *Nodes_Ptr;
84 Node_Id *Next_Node_Ptr;
85 Node_Id *Prev_Node_Ptr;
86 struct Elist_Header *Elists_Ptr;
87 struct Elmt_Item *Elmts_Ptr;
88 struct String_Entry *Strings_Ptr;
89 Char_Code *String_Chars_Ptr;
90 struct List_Header *List_Headers_Ptr;
92 /* Current filename without path. */
93 const char *ref_filename;
95 /* True when gigi is being called on an analyzed but unexpanded
96 tree, and the only purpose of the call is to properly annotate
97 types with representation information. */
98 bool type_annotate_only;
100 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
101 of unconstrained array IN parameters to avoid emitting a great deal of
102 redundant instructions to recompute them each time. */
103 struct GTY (()) parm_attr {
104 int id; /* GTY doesn't like Entity_Id. */
111 typedef struct parm_attr *parm_attr;
113 DEF_VEC_P(parm_attr);
114 DEF_VEC_ALLOC_P(parm_attr,gc);
116 struct GTY(()) language_function {
117 VEC(parm_attr,gc) *parm_attr_cache;
120 #define f_parm_attr_cache \
121 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
123 /* A structure used to gather together information about a statement group.
124 We use this to gather related statements, for example the "then" part
125 of a IF. In the case where it represents a lexical scope, we may also
126 have a BLOCK node corresponding to it and/or cleanups. */
128 struct GTY((chain_next ("%h.previous"))) stmt_group {
129 struct stmt_group *previous; /* Previous code group. */
130 tree stmt_list; /* List of statements for this code group. */
131 tree block; /* BLOCK for this code group, if any. */
132 tree cleanups; /* Cleanups for this code group, if any. */
135 static GTY(()) struct stmt_group *current_stmt_group;
137 /* List of unused struct stmt_group nodes. */
138 static GTY((deletable)) struct stmt_group *stmt_group_free_list;
140 /* A structure used to record information on elaboration procedures
141 we've made and need to process.
143 ??? gnat_node should be Node_Id, but gengtype gets confused. */
145 struct GTY((chain_next ("%h.next"))) elab_info {
146 struct elab_info *next; /* Pointer to next in chain. */
147 tree elab_proc; /* Elaboration procedure. */
148 int gnat_node; /* The N_Compilation_Unit. */
151 static GTY(()) struct elab_info *elab_info_list;
153 /* Free list of TREE_LIST nodes used for stacks. */
154 static GTY((deletable)) tree gnu_stack_free_list;
156 /* List of TREE_LIST nodes representing a stack of exception pointer
157 variables. TREE_VALUE is the VAR_DECL that stores the address of
158 the raised exception. Nonzero means we are in an exception
159 handler. Not used in the zero-cost case. */
160 static GTY(()) tree gnu_except_ptr_stack;
162 /* List of TREE_LIST nodes used to store the current elaboration procedure
163 decl. TREE_VALUE is the decl. */
164 static GTY(()) tree gnu_elab_proc_stack;
166 /* Variable that stores a list of labels to be used as a goto target instead of
167 a return in some functions. See processing for N_Subprogram_Body. */
168 static GTY(()) tree gnu_return_label_stack;
170 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
171 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
172 static GTY(()) tree gnu_loop_label_stack;
174 /* List of TREE_LIST nodes representing labels for switch statements.
175 TREE_VALUE of each entry is the label at the end of the switch. */
176 static GTY(()) tree gnu_switch_label_stack;
178 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
179 static GTY(()) tree gnu_constraint_error_label_stack;
180 static GTY(()) tree gnu_storage_error_label_stack;
181 static GTY(()) tree gnu_program_error_label_stack;
183 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
184 static enum tree_code gnu_codes[Number_Node_Kinds];
186 /* Current node being treated, in case abort called. */
187 Node_Id error_gnat_node;
189 static void init_code_table (void);
190 static void Compilation_Unit_to_gnu (Node_Id);
191 static void record_code_position (Node_Id);
192 static void insert_code_for (Node_Id);
193 static void add_cleanup (tree, Node_Id);
194 static tree unshare_save_expr (tree *, int *, void *);
195 static void add_stmt_list (List_Id);
196 static void push_exception_label_stack (tree *, Entity_Id);
197 static tree build_stmt_group (List_Id, bool);
198 static void push_stack (tree *, tree, tree);
199 static void pop_stack (tree *);
200 static enum gimplify_status gnat_gimplify_stmt (tree *);
201 static void elaborate_all_entities (Node_Id);
202 static void process_freeze_entity (Node_Id);
203 static void process_inlined_subprograms (Node_Id);
204 static void process_decls (List_Id, List_Id, Node_Id, bool, bool);
205 static tree emit_range_check (tree, Node_Id, Node_Id);
206 static tree emit_index_check (tree, tree, tree, tree, Node_Id);
207 static tree emit_check (tree, tree, int, Node_Id);
208 static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id);
209 static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id);
210 static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id);
211 static bool smaller_packable_type_p (tree, tree);
212 static bool addressable_p (tree, tree);
213 static tree assoc_to_constructor (Entity_Id, Node_Id, tree);
214 static tree extract_values (tree, tree);
215 static tree pos_to_constructor (Node_Id, tree, Entity_Id);
216 static tree maybe_implicit_deref (tree);
217 static tree gnat_stabilize_reference (tree, bool);
218 static tree gnat_stabilize_reference_1 (tree, bool);
219 static void set_expr_location_from_node (tree, Node_Id);
220 static int lvalue_required_p (Node_Id, tree, int);
222 /* Hooks for debug info back-ends, only supported and used in a restricted set
223 of configurations. */
224 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED;
225 static const char *decode_name (const char *) ATTRIBUTE_UNUSED;
227 /* This is the main program of the back-end. It sets up all the table
228 structures and then generates code. */
231 gigi (Node_Id gnat_root, int max_gnat_node, int number_name,
232 struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr,
233 struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr,
234 struct String_Entry *strings_ptr, Char_Code *string_chars_ptr,
235 struct List_Header *list_headers_ptr, Nat number_file,
236 struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean,
237 Entity_Id standard_integer, Entity_Id standard_long_long_float,
238 Entity_Id standard_exception_type, Int gigi_operating_mode)
240 Entity_Id gnat_literal;
241 tree long_long_float_type, exception_type, t;
242 tree int64_type = gnat_type_for_size (64, 0);
243 struct elab_info *info;
246 max_gnat_nodes = max_gnat_node;
247 number_names = number_name;
248 number_files = number_file;
249 Nodes_Ptr = nodes_ptr;
250 Next_Node_Ptr = next_node_ptr;
251 Prev_Node_Ptr = prev_node_ptr;
252 Elists_Ptr = elists_ptr;
253 Elmts_Ptr = elmts_ptr;
254 Strings_Ptr = strings_ptr;
255 String_Chars_Ptr = string_chars_ptr;
256 List_Headers_Ptr = list_headers_ptr;
258 type_annotate_only = (gigi_operating_mode == 1);
260 gcc_assert (Nkind (gnat_root) == N_Compilation_Unit);
262 /* Declare the name of the compilation unit as the first global
263 name in order to make the middle-end fully deterministic. */
264 t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL);
265 first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t));
267 for (i = 0; i < number_files; i++)
269 /* Use the identifier table to make a permanent copy of the filename as
270 the name table gets reallocated after Gigi returns but before all the
271 debugging information is output. The __gnat_to_canonical_file_spec
272 call translates filenames from pragmas Source_Reference that contain
273 host style syntax not understood by gdb. */
277 (__gnat_to_canonical_file_spec
278 (Get_Name_String (file_info_ptr[i].File_Name))));
280 /* We rely on the order isomorphism between files and line maps. */
281 gcc_assert ((int) line_table->used == i);
283 /* We create the line map for a source file at once, with a fixed number
284 of columns chosen to avoid jumping over the next power of 2. */
285 linemap_add (line_table, LC_ENTER, 0, filename, 1);
286 linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252);
287 linemap_position_for_column (line_table, 252 - 1);
288 linemap_add (line_table, LC_LEAVE, 0, NULL, 0);
291 /* Initialize ourselves. */
296 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
298 if (type_annotate_only)
300 TYPE_SIZE (void_type_node) = bitsize_zero_node;
301 TYPE_SIZE_UNIT (void_type_node) = size_zero_node;
304 /* If the GNU type extensions to DWARF are available, setup the hooks. */
305 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
306 /* We condition the name demangling and the generation of type encoding
307 strings on -gdwarf+ and always set descriptive types on. */
308 if (use_gnu_debug_info_extensions)
310 dwarf2out_set_type_encoding_func (extract_encoding);
311 dwarf2out_set_demangle_name_func (decode_name);
313 dwarf2out_set_descriptive_type_func (get_parallel_type);
316 /* Enable GNAT stack checking method if needed */
317 if (!Stack_Check_Probes_On_Target)
318 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check"));
320 /* 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 /* Make the types and functions used for exception processing. */
399 = build_array_type (gnat_type_for_mode (Pmode, 0),
400 build_index_type (size_int (5)));
401 record_builtin_type ("JMPBUF_T", jmpbuf_type);
402 jmpbuf_ptr_type = build_pointer_type (jmpbuf_type);
404 /* Functions to get and set the jumpbuf pointer for the current thread. */
406 = create_subprog_decl
407 (get_identifier ("system__soft_links__get_jmpbuf_address_soft"),
408 NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE),
409 NULL_TREE, false, true, true, NULL, Empty);
410 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
411 DECL_PURE_P (get_jmpbuf_decl) = 1;
414 = create_subprog_decl
415 (get_identifier ("system__soft_links__set_jmpbuf_address_soft"),
417 build_function_type (void_type_node,
418 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
419 NULL_TREE, false, true, true, NULL, Empty);
421 /* setjmp returns an integer and has one operand, which is a pointer to
424 = create_subprog_decl
425 (get_identifier ("__builtin_setjmp"), NULL_TREE,
426 build_function_type (integer_type_node,
427 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
428 NULL_TREE, false, true, true, NULL, Empty);
430 DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL;
431 DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP;
433 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
435 update_setjmp_buf_decl
436 = create_subprog_decl
437 (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE,
438 build_function_type (void_type_node,
439 tree_cons (NULL_TREE, jmpbuf_ptr_type, t)),
440 NULL_TREE, false, true, true, NULL, Empty);
442 DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL;
443 DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF;
445 /* Hooks to call when entering/leaving an exception handler. */
447 = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE,
448 build_function_type (void_type_node,
449 tree_cons (NULL_TREE,
452 NULL_TREE, false, true, true, NULL, Empty);
455 = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE,
456 build_function_type (void_type_node,
457 tree_cons (NULL_TREE,
460 NULL_TREE, false, true, true, NULL, Empty);
462 /* If in no exception handlers mode, all raise statements are redirected to
463 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
464 this procedure will never be called in this mode. */
465 if (No_Exception_Handlers_Set ())
468 = create_subprog_decl
469 (get_identifier ("__gnat_last_chance_handler"), NULL_TREE,
470 build_function_type (void_type_node,
471 tree_cons (NULL_TREE,
472 build_pointer_type (char_type_node),
473 tree_cons (NULL_TREE,
476 NULL_TREE, false, true, true, NULL, Empty);
478 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
479 gnat_raise_decls[i] = decl;
482 /* Otherwise, make one decl for each exception reason. */
483 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
487 sprintf (name, "__gnat_rcheck_%.2d", i);
489 = create_subprog_decl
490 (get_identifier (name), NULL_TREE,
491 build_function_type (void_type_node,
492 tree_cons (NULL_TREE,
495 tree_cons (NULL_TREE,
498 NULL_TREE, false, true, true, NULL, Empty);
501 for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++)
503 TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1;
504 TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1;
505 TREE_TYPE (gnat_raise_decls[i])
506 = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]),
510 /* Set the types that GCC and Gigi use from the front end. We would
511 like to do this for char_type_node, but it needs to correspond to
514 = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0);
515 except_type_node = TREE_TYPE (exception_type);
517 /* Make other functions used for exception processing. */
519 = create_subprog_decl
520 (get_identifier ("system__soft_links__get_gnat_exception"),
522 build_function_type (build_pointer_type (except_type_node), NULL_TREE),
523 NULL_TREE, false, true, true, NULL, Empty);
524 /* Avoid creating superfluous edges to __builtin_setjmp receivers. */
525 DECL_PURE_P (get_excptr_decl) = 1;
528 = create_subprog_decl
529 (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE,
530 build_function_type (void_type_node,
531 tree_cons (NULL_TREE,
532 build_pointer_type (except_type_node),
534 NULL_TREE, false, true, true, NULL, Empty);
536 /* Indicate that these never return. */
537 TREE_THIS_VOLATILE (raise_nodefer_decl) = 1;
538 TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1;
539 TREE_TYPE (raise_nodefer_decl)
540 = build_qualified_type (TREE_TYPE (raise_nodefer_decl),
543 /* Build the special descriptor type and its null node if needed. */
544 if (TARGET_VTABLE_USES_DESCRIPTORS)
546 tree null_node = fold_convert (ptr_void_ftype, null_pointer_node);
547 tree field_list = NULL_TREE, null_list = NULL_TREE;
550 fdesc_type_node = make_node (RECORD_TYPE);
552 for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++)
554 tree field = create_field_decl (NULL_TREE, ptr_void_ftype,
555 fdesc_type_node, 0, 0, 0, 1);
556 TREE_CHAIN (field) = field_list;
558 null_list = tree_cons (field, null_node, null_list);
561 finish_record_type (fdesc_type_node, nreverse (field_list), 0, true);
562 record_builtin_type ("descriptor", fdesc_type_node);
563 null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list);
567 = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0);
569 if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE)
571 /* In this case, the builtin floating point types are VAX float,
572 so make up a type for use. */
573 longest_float_type_node = make_node (REAL_TYPE);
574 TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE;
575 layout_type (longest_float_type_node);
576 record_builtin_type ("longest float type", longest_float_type_node);
579 longest_float_type_node = TREE_TYPE (long_long_float_type);
581 /* Dummy objects to materialize "others" and "all others" in the exception
582 tables. These are exported by a-exexpr.adb, so see this unit for the
585 = create_var_decl (get_identifier ("OTHERS"),
586 get_identifier ("__gnat_others_value"),
587 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
590 = create_var_decl (get_identifier ("ALL_OTHERS"),
591 get_identifier ("__gnat_all_others_value"),
592 integer_type_node, 0, 1, 0, 1, 1, 0, Empty);
594 main_identifier_node = get_identifier ("main");
596 /* Install the builtins we might need, either internally or as
597 user available facilities for Intrinsic imports. */
598 gnat_install_builtins ();
600 gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
601 gnu_constraint_error_label_stack
602 = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
603 gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
604 gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE);
606 /* Process any Pragma Ident for the main unit. */
607 #ifdef ASM_OUTPUT_IDENT
608 if (Present (Ident_String (Main_Unit)))
611 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit))));
614 /* If we are using the GCC exception mechanism, let GCC know. */
615 if (Exception_Mechanism == Back_End_Exceptions)
618 /* Now translate the compilation unit proper. */
620 Compilation_Unit_to_gnu (gnat_root);
622 /* Finally see if we have any elaboration procedures to deal with. */
623 for (info = elab_info_list; info; info = info->next)
625 tree gnu_body = DECL_SAVED_TREE (info->elab_proc);
627 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
628 the gimplifier for obvious reasons, but it turns out that we need to
629 unshare them for the global level because of SAVE_EXPRs made around
630 checks for global objects and around allocators for global objects
631 of variable size, in order to prevent node sharing in the underlying
632 expression. Note that this implicitly assumes that the SAVE_EXPR
633 nodes themselves are not shared between subprograms, which would be
634 an upstream bug for which we would not change the outcome. */
635 walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL);
637 /* Process the function as others, but for indicating this is an
638 elab proc, to be discarded if empty, then propagate the status
639 up to the GNAT tree node. */
640 begin_subprog_body (info->elab_proc);
641 end_subprog_body (gnu_body, true);
643 if (empty_body_p (gimple_body (info->elab_proc)))
644 Set_Has_No_Elaboration_Code (info->gnat_node, 1);
647 /* We cannot track the location of errors past this point. */
648 error_gnat_node = Empty;
651 /* Return a positive value if an lvalue is required for GNAT_NODE.
652 GNU_TYPE is the type that will be used for GNAT_NODE in the
653 translated GNU tree. ALIASED indicates whether the underlying
654 object represented by GNAT_NODE is aliased in the Ada sense.
656 The function climbs up the GNAT tree starting from the node and
657 returns 1 upon encountering a node that effectively requires an
658 lvalue downstream. It returns int instead of bool to facilitate
659 usage in non purely binary logic contexts. */
662 lvalue_required_p (Node_Id gnat_node, tree gnu_type, int aliased)
664 Node_Id gnat_parent = Parent (gnat_node), gnat_temp;
666 switch (Nkind (gnat_parent))
671 case N_Attribute_Reference:
673 unsigned char id = Get_Attribute_Id (Attribute_Name (gnat_parent));
674 return id == Attr_Address
676 || id == Attr_Unchecked_Access
677 || id == Attr_Unrestricted_Access;
680 case N_Parameter_Association:
681 case N_Function_Call:
682 case N_Procedure_Call_Statement:
683 return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type));
685 case N_Indexed_Component:
686 /* Only the array expression can require an lvalue. */
687 if (Prefix (gnat_parent) != gnat_node)
690 /* ??? Consider that referencing an indexed component with a
691 non-constant index forces the whole aggregate to memory.
692 Note that N_Integer_Literal is conservative, any static
693 expression in the RM sense could probably be accepted. */
694 for (gnat_temp = First (Expressions (gnat_parent));
696 gnat_temp = Next (gnat_temp))
697 if (Nkind (gnat_temp) != N_Integer_Literal)
700 /* ... fall through ... */
703 /* Only the array expression can require an lvalue. */
704 if (Prefix (gnat_parent) != gnat_node)
707 aliased |= Has_Aliased_Components (Etype (gnat_node));
708 return lvalue_required_p (gnat_parent, gnu_type, aliased);
710 case N_Selected_Component:
711 aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent)));
712 return lvalue_required_p (gnat_parent, gnu_type, aliased);
714 case N_Object_Renaming_Declaration:
715 /* We need to make a real renaming only if the constant object is
716 aliased or if we may use a renaming pointer; otherwise we can
717 optimize and return the rvalue. We make an exception if the object
718 is an identifier since in this case the rvalue can be propagated
719 attached to the CONST_DECL. */
721 /* This should match the constant case of the renaming code. */
723 (Underlying_Type (Etype (Name (gnat_parent))))
724 || Nkind (Name (gnat_parent)) == N_Identifier);
726 case N_Object_Declaration:
727 /* We cannot use a constructor if this is an atomic object because
728 the actual assignment might end up being done component-wise. */
729 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
730 && Is_Atomic (Defining_Entity (gnat_parent));
732 case N_Assignment_Statement:
733 /* We cannot use a constructor if the LHS is an atomic object because
734 the actual assignment might end up being done component-wise. */
735 return Is_Composite_Type (Underlying_Type (Etype (gnat_node)))
736 && Is_Atomic (Entity (Name (gnat_parent)));
745 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
746 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
747 to where we should place the result type. */
750 Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p)
752 Node_Id gnat_temp, gnat_temp_type;
753 tree gnu_result, gnu_result_type;
755 /* Whether we should require an lvalue for GNAT_NODE. Needed in
756 specific circumstances only, so evaluated lazily. < 0 means
757 unknown, > 0 means known true, 0 means known false. */
758 int require_lvalue = -1;
760 /* If GNAT_NODE is a constant, whether we should use the initialization
761 value instead of the constant entity, typically for scalars with an
762 address clause when the parent doesn't require an lvalue. */
763 bool use_constant_initializer = false;
765 /* If the Etype of this node does not equal the Etype of the Entity,
766 something is wrong with the entity map, probably in generic
767 instantiation. However, this does not apply to types. Since we sometime
768 have strange Ekind's, just do this test for objects. Also, if the Etype of
769 the Entity is private, the Etype of the N_Identifier is allowed to be the
770 full type and also we consider a packed array type to be the same as the
771 original type. Similarly, a class-wide type is equivalent to a subtype of
772 itself. Finally, if the types are Itypes, one may be a copy of the other,
773 which is also legal. */
774 gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier
775 ? gnat_node : Entity (gnat_node));
776 gnat_temp_type = Etype (gnat_temp);
778 gcc_assert (Etype (gnat_node) == gnat_temp_type
779 || (Is_Packed (gnat_temp_type)
780 && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type))
781 || (Is_Class_Wide_Type (Etype (gnat_node)))
782 || (IN (Ekind (gnat_temp_type), Private_Kind)
783 && Present (Full_View (gnat_temp_type))
784 && ((Etype (gnat_node) == Full_View (gnat_temp_type))
785 || (Is_Packed (Full_View (gnat_temp_type))
786 && (Etype (gnat_node)
787 == Packed_Array_Type (Full_View
788 (gnat_temp_type))))))
789 || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type))
790 || !(Ekind (gnat_temp) == E_Variable
791 || Ekind (gnat_temp) == E_Component
792 || Ekind (gnat_temp) == E_Constant
793 || Ekind (gnat_temp) == E_Loop_Parameter
794 || IN (Ekind (gnat_temp), Formal_Kind)));
796 /* If this is a reference to a deferred constant whose partial view is an
797 unconstrained private type, the proper type is on the full view of the
798 constant, not on the full view of the type, which may be unconstrained.
800 This may be a reference to a type, for example in the prefix of the
801 attribute Position, generated for dispatching code (see Make_DT in
802 exp_disp,adb). In that case we need the type itself, not is parent,
803 in particular if it is a derived type */
804 if (Is_Private_Type (gnat_temp_type)
805 && Has_Unknown_Discriminants (gnat_temp_type)
806 && Ekind (gnat_temp) == E_Constant
807 && Present (Full_View (gnat_temp)))
809 gnat_temp = Full_View (gnat_temp);
810 gnat_temp_type = Etype (gnat_temp);
814 /* We want to use the Actual_Subtype if it has already been elaborated,
815 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
817 if ((Ekind (gnat_temp) == E_Constant
818 || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp))
819 && !(Is_Array_Type (Etype (gnat_temp))
820 && Present (Packed_Array_Type (Etype (gnat_temp))))
821 && Present (Actual_Subtype (gnat_temp))
822 && present_gnu_tree (Actual_Subtype (gnat_temp)))
823 gnat_temp_type = Actual_Subtype (gnat_temp);
825 gnat_temp_type = Etype (gnat_node);
828 /* Expand the type of this identifier first, in case it is an enumeral
829 literal, which only get made when the type is expanded. There is no
830 order-of-elaboration issue here. */
831 gnu_result_type = get_unpadded_type (gnat_temp_type);
833 /* If this is a non-imported scalar constant with an address clause,
834 retrieve the value instead of a pointer to be dereferenced unless
835 an lvalue is required. This is generally more efficient and actually
836 required if this is a static expression because it might be used
837 in a context where a dereference is inappropriate, such as a case
838 statement alternative or a record discriminant. There is no possible
839 volatile-ness short-circuit here since Volatile constants must bei
841 if (Ekind (gnat_temp) == E_Constant && Is_Scalar_Type (gnat_temp_type)
842 && !Is_Imported (gnat_temp)
843 && Present (Address_Clause (gnat_temp)))
845 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
846 Is_Aliased (gnat_temp));
847 use_constant_initializer = !require_lvalue;
850 if (use_constant_initializer)
852 /* If this is a deferred constant, the initializer is attached to
854 if (Present (Full_View (gnat_temp)))
855 gnat_temp = Full_View (gnat_temp);
857 gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp)));
860 gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0);
862 /* If we are in an exception handler, force this variable into memory to
863 ensure optimization does not remove stores that appear redundant but are
864 actually needed in case an exception occurs.
866 ??? Note that we need not do this if the variable is declared within the
867 handler, only if it is referenced in the handler and declared in an
868 enclosing block, but we have no way of testing that right now.
870 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
871 here, but it can now be removed by the Tree aliasing machinery if the
872 address of the variable is never taken. All we can do is to make the
873 variable volatile, which might incur the generation of temporaries just
874 to access the memory in some circumstances. This can be avoided for
875 variables of non-constant size because they are automatically allocated
876 to memory. There might be no way of allocating a proper temporary for
877 them in any case. We only do this for SJLJ though. */
878 if (TREE_VALUE (gnu_except_ptr_stack)
879 && TREE_CODE (gnu_result) == VAR_DECL
880 && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST)
881 TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1;
883 /* Some objects (such as parameters passed by reference, globals of
884 variable size, and renamed objects) actually represent the address
885 of the object. In that case, we must do the dereference. Likewise,
886 deal with parameters to foreign convention subprograms. */
887 if (DECL_P (gnu_result)
888 && (DECL_BY_REF_P (gnu_result)
889 || (TREE_CODE (gnu_result) == PARM_DECL
890 && DECL_BY_COMPONENT_PTR_P (gnu_result))))
892 bool ro = DECL_POINTS_TO_READONLY_P (gnu_result);
895 if (TREE_CODE (gnu_result) == PARM_DECL
896 && DECL_BY_COMPONENT_PTR_P (gnu_result))
898 = build_unary_op (INDIRECT_REF, NULL_TREE,
899 convert (build_pointer_type (gnu_result_type),
902 /* If it's a renaming pointer and we are at the right binding level,
903 we can reference the renamed object directly, since the renamed
904 expression has been protected against multiple evaluations. */
905 else if (TREE_CODE (gnu_result) == VAR_DECL
906 && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) != 0
907 && (! DECL_RENAMING_GLOBAL_P (gnu_result)
908 || global_bindings_p ()))
909 gnu_result = renamed_obj;
911 /* Return the underlying CST for a CONST_DECL like a few lines below,
912 after dereferencing in this case. */
913 else if (TREE_CODE (gnu_result) == CONST_DECL)
914 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE,
915 DECL_INITIAL (gnu_result));
918 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
920 TREE_READONLY (gnu_result) = TREE_STATIC (gnu_result) = ro;
923 /* The GNAT tree has the type of a function as the type of its result. Also
924 use the type of the result if the Etype is a subtype which is nominally
925 unconstrained. But remove any padding from the resulting type. */
926 if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE
927 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type))
929 gnu_result_type = TREE_TYPE (gnu_result);
930 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
931 && TYPE_IS_PADDING_P (gnu_result_type))
932 gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type));
935 /* If we have a constant declaration and its initializer at hand,
936 try to return the latter to avoid the need to call fold in lots
937 of places and the need of elaboration code if this Id is used as
938 an initializer itself. */
939 if (TREE_CONSTANT (gnu_result)
940 && DECL_P (gnu_result)
941 && DECL_INITIAL (gnu_result))
944 = (TREE_CODE (gnu_result) == CONST_DECL
945 ? DECL_CONST_CORRESPONDING_VAR (gnu_result) : gnu_result);
947 /* If there is a corresponding variable, we only want to return
948 the CST value if an lvalue is not required. Evaluate this
949 now if we have not already done so. */
950 if (object && require_lvalue < 0)
951 require_lvalue = lvalue_required_p (gnat_node, gnu_result_type,
952 Is_Aliased (gnat_temp));
954 if (!object || !require_lvalue)
955 gnu_result = unshare_expr (DECL_INITIAL (gnu_result));
958 *gnu_result_type_p = gnu_result_type;
962 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
963 any statements we generate. */
966 Pragma_to_gnu (Node_Id gnat_node)
969 tree gnu_result = alloc_stmt_list ();
971 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
973 if (type_annotate_only
974 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node))))
977 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node))))
979 case Pragma_Inspection_Point:
980 /* Do nothing at top level: all such variables are already viewable. */
981 if (global_bindings_p ())
984 for (gnat_temp = First (Pragma_Argument_Associations (gnat_node));
986 gnat_temp = Next (gnat_temp))
988 Node_Id gnat_expr = Expression (gnat_temp);
989 tree gnu_expr = gnat_to_gnu (gnat_expr);
991 enum machine_mode mode;
992 tree asm_constraint = NULL_TREE;
993 #ifdef ASM_COMMENT_START
997 if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF)
998 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1000 /* Use the value only if it fits into a normal register,
1001 otherwise use the address. */
1002 mode = TYPE_MODE (TREE_TYPE (gnu_expr));
1003 use_address = ((GET_MODE_CLASS (mode) != MODE_INT
1004 && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT)
1005 || GET_MODE_SIZE (mode) > UNITS_PER_WORD);
1008 gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
1010 #ifdef ASM_COMMENT_START
1011 comment = concat (ASM_COMMENT_START,
1012 " inspection point: ",
1013 Get_Name_String (Chars (gnat_expr)),
1014 use_address ? " address" : "",
1017 asm_constraint = build_string (strlen (comment), comment);
1020 gnu_expr = build4 (ASM_EXPR, void_type_node,
1024 (build_tree_list (NULL_TREE,
1025 build_string (1, "g")),
1026 gnu_expr, NULL_TREE),
1028 ASM_VOLATILE_P (gnu_expr) = 1;
1029 set_expr_location_from_node (gnu_expr, gnat_node);
1030 append_to_statement_list (gnu_expr, &gnu_result);
1034 case Pragma_Optimize:
1035 switch (Chars (Expression
1036 (First (Pragma_Argument_Associations (gnat_node)))))
1038 case Name_Time: case Name_Space:
1040 post_error ("insufficient -O value?", gnat_node);
1045 post_error ("must specify -O0?", gnat_node);
1053 case Pragma_Reviewable:
1054 if (write_symbols == NO_DEBUG)
1055 post_error ("must specify -g?", gnat_node);
1062 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1063 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1064 where we should place the result type. ATTRIBUTE is the attribute ID. */
1067 Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute)
1069 tree gnu_result = error_mark_node;
1070 tree gnu_result_type;
1072 bool prefix_unused = false;
1073 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
1074 tree gnu_type = TREE_TYPE (gnu_prefix);
1076 /* If the input is a NULL_EXPR, make a new one. */
1077 if (TREE_CODE (gnu_prefix) == NULL_EXPR)
1079 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1080 *gnu_result_type_p = gnu_result_type;
1081 return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0));
1088 /* These are just conversions since representation clauses for
1089 enumeration types are handled in the front-end. */
1091 bool checkp = Do_Range_Check (First (Expressions (gnat_node)));
1092 gnu_result = gnat_to_gnu (First (Expressions (gnat_node)));
1093 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1094 gnu_result = convert_with_check (Etype (gnat_node), gnu_result,
1095 checkp, checkp, true, gnat_node);
1101 /* These just add or subtract the constant 1 since representation
1102 clauses for enumeration types are handled in the front-end. */
1103 gnu_expr = gnat_to_gnu (First (Expressions (gnat_node)));
1104 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1106 if (Do_Range_Check (First (Expressions (gnat_node))))
1108 gnu_expr = protect_multiple_eval (gnu_expr);
1111 (build_binary_op (EQ_EXPR, integer_type_node,
1113 attribute == Attr_Pred
1114 ? TYPE_MIN_VALUE (gnu_result_type)
1115 : TYPE_MAX_VALUE (gnu_result_type)),
1116 gnu_expr, CE_Range_Check_Failed, gnat_node);
1120 = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR,
1121 gnu_result_type, gnu_expr,
1122 convert (gnu_result_type, integer_one_node));
1126 case Attr_Unrestricted_Access:
1127 /* Conversions don't change addresses but can cause us to miss the
1128 COMPONENT_REF case below, so strip them off. */
1129 gnu_prefix = remove_conversions (gnu_prefix,
1130 !Must_Be_Byte_Aligned (gnat_node));
1132 /* If we are taking 'Address of an unconstrained object, this is the
1133 pointer to the underlying array. */
1134 if (attribute == Attr_Address)
1135 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1137 /* If we are building a static dispatch table, we have to honor
1138 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1139 with the C++ ABI. We do it in the non-static case as well,
1140 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1141 else if (TARGET_VTABLE_USES_DESCRIPTORS
1142 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
1144 tree gnu_field, gnu_list = NULL_TREE, t;
1145 /* Descriptors can only be built here for top-level functions. */
1146 bool build_descriptor = (global_bindings_p () != 0);
1149 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1151 /* If we're not going to build the descriptor, we have to retrieve
1152 the one which will be built by the linker (or by the compiler
1153 later if a static chain is requested). */
1154 if (!build_descriptor)
1156 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix);
1157 gnu_result = fold_convert (build_pointer_type (gnu_result_type),
1159 gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result);
1162 for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0;
1163 i < TARGET_VTABLE_USES_DESCRIPTORS;
1164 gnu_field = TREE_CHAIN (gnu_field), i++)
1166 if (build_descriptor)
1168 t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix,
1169 build_int_cst (NULL_TREE, i));
1170 TREE_CONSTANT (t) = 1;
1173 t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result,
1174 gnu_field, NULL_TREE);
1176 gnu_list = tree_cons (gnu_field, t, gnu_list);
1179 gnu_result = gnat_build_constructor (gnu_result_type, gnu_list);
1183 /* ... fall through ... */
1186 case Attr_Unchecked_Access:
1187 case Attr_Code_Address:
1188 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1190 = build_unary_op (((attribute == Attr_Address
1191 || attribute == Attr_Unrestricted_Access)
1192 && !Must_Be_Byte_Aligned (gnat_node))
1193 ? ATTR_ADDR_EXPR : ADDR_EXPR,
1194 gnu_result_type, gnu_prefix);
1196 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1197 don't try to build a trampoline. */
1198 if (attribute == Attr_Code_Address)
1200 for (gnu_expr = gnu_result;
1201 CONVERT_EXPR_P (gnu_expr);
1202 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1203 TREE_CONSTANT (gnu_expr) = 1;
1205 if (TREE_CODE (gnu_expr) == ADDR_EXPR)
1206 TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1;
1209 /* For other address attributes applied to a nested function,
1210 find an inner ADDR_EXPR and annotate it so that we can issue
1211 a useful warning with -Wtrampolines. */
1212 else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE)
1214 for (gnu_expr = gnu_result;
1215 CONVERT_EXPR_P (gnu_expr);
1216 gnu_expr = TREE_OPERAND (gnu_expr, 0))
1219 if (TREE_CODE (gnu_expr) == ADDR_EXPR
1220 && decl_function_context (TREE_OPERAND (gnu_expr, 0)))
1222 set_expr_location_from_node (gnu_expr, gnat_node);
1224 /* Check that we're not violating the No_Implicit_Dynamic_Code
1225 restriction. Be conservative if we don't know anything
1226 about the trampoline strategy for the target. */
1227 Check_Implicit_Dynamic_Code_Allowed (gnat_node);
1232 case Attr_Pool_Address:
1235 tree gnu_ptr = gnu_prefix;
1237 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1239 /* If this is an unconstrained array, we know the object has been
1240 allocated with the template in front of the object. So compute
1241 the template address. */
1242 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
1244 = convert (build_pointer_type
1245 (TYPE_OBJECT_RECORD_TYPE
1246 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
1249 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
1250 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
1251 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
1253 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
1254 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
1255 tree gnu_byte_offset
1256 = convert (sizetype,
1257 size_diffop (size_zero_node, gnu_pos));
1258 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
1260 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
1261 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
1262 gnu_ptr, gnu_byte_offset);
1265 gnu_result = convert (gnu_result_type, gnu_ptr);
1270 case Attr_Object_Size:
1271 case Attr_Value_Size:
1272 case Attr_Max_Size_In_Storage_Elements:
1273 gnu_expr = gnu_prefix;
1275 /* Remove NOPs from GNU_EXPR and conversions from GNU_PREFIX.
1276 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1277 while (TREE_CODE (gnu_expr) == NOP_EXPR)
1278 gnu_expr = TREE_OPERAND (gnu_expr, 0);
1280 gnu_prefix = remove_conversions (gnu_prefix, true);
1281 prefix_unused = true;
1282 gnu_type = TREE_TYPE (gnu_prefix);
1284 /* Replace an unconstrained array type with the type of the underlying
1285 array. We can't do this with a call to maybe_unconstrained_array
1286 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1287 use the record type that will be used to allocate the object and its
1289 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1291 gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type);
1292 if (attribute != Attr_Max_Size_In_Storage_Elements)
1293 gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type)));
1296 /* If we're looking for the size of a field, return the field size.
1297 Otherwise, if the prefix is an object, or if 'Object_Size or
1298 'Max_Size_In_Storage_Elements has been specified, the result is the
1299 GCC size of the type. Otherwise, the result is the RM size of the
1301 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1302 gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1));
1303 else if (TREE_CODE (gnu_prefix) != TYPE_DECL
1304 || attribute == Attr_Object_Size
1305 || attribute == Attr_Max_Size_In_Storage_Elements)
1307 /* If this is a padded type, the GCC size isn't relevant to the
1308 programmer. Normally, what we want is the RM size, which was set
1309 from the specified size, but if it was not set, we want the size
1310 of the relevant field. Using the MAX of those two produces the
1311 right result in all case. Don't use the size of the field if it's
1312 a self-referential type, since that's never what's wanted. */
1313 if (TREE_CODE (gnu_type) == RECORD_TYPE
1314 && TYPE_IS_PADDING_P (gnu_type)
1315 && TREE_CODE (gnu_expr) == COMPONENT_REF)
1317 gnu_result = rm_size (gnu_type);
1318 if (!(CONTAINS_PLACEHOLDER_P
1319 (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))))
1321 = size_binop (MAX_EXPR, gnu_result,
1322 DECL_SIZE (TREE_OPERAND (gnu_expr, 1)));
1324 else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference)
1326 Node_Id gnat_deref = Prefix (gnat_node);
1327 Node_Id gnat_actual_subtype
1328 = Actual_Designated_Subtype (gnat_deref);
1330 = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref)));
1332 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type)
1333 && Present (gnat_actual_subtype))
1335 tree gnu_actual_obj_type
1336 = gnat_to_gnu_type (gnat_actual_subtype);
1338 = build_unc_object_type_from_ptr (gnu_ptr_type,
1339 gnu_actual_obj_type,
1340 get_identifier ("SIZE"));
1343 gnu_result = TYPE_SIZE (gnu_type);
1346 gnu_result = TYPE_SIZE (gnu_type);
1349 gnu_result = rm_size (gnu_type);
1351 gcc_assert (gnu_result);
1353 /* Deal with a self-referential size by returning the maximum size for
1354 a type and by qualifying the size with the object for 'Size of an
1356 if (CONTAINS_PLACEHOLDER_P (gnu_result))
1358 if (TREE_CODE (gnu_prefix) != TYPE_DECL)
1359 gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr);
1361 gnu_result = max_size (gnu_result, true);
1364 /* If the type contains a template, subtract its size. */
1365 if (TREE_CODE (gnu_type) == RECORD_TYPE
1366 && TYPE_CONTAINS_TEMPLATE_P (gnu_type))
1367 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1368 DECL_SIZE (TYPE_FIELDS (gnu_type)));
1370 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1372 if (attribute == Attr_Max_Size_In_Storage_Elements)
1373 gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype,
1374 gnu_result, bitsize_unit_node);
1377 case Attr_Alignment:
1378 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1379 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1381 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1382 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1384 gnu_type = TREE_TYPE (gnu_prefix);
1385 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1386 prefix_unused = true;
1388 gnu_result = size_int ((TREE_CODE (gnu_prefix) == COMPONENT_REF
1389 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1))
1390 : TYPE_ALIGN (gnu_type)) / BITS_PER_UNIT);
1395 case Attr_Range_Length:
1396 prefix_unused = true;
1398 if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE)
1400 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1402 if (attribute == Attr_First)
1403 gnu_result = TYPE_MIN_VALUE (gnu_type);
1404 else if (attribute == Attr_Last)
1405 gnu_result = TYPE_MAX_VALUE (gnu_type);
1409 (MAX_EXPR, get_base_type (gnu_result_type),
1411 (PLUS_EXPR, get_base_type (gnu_result_type),
1412 build_binary_op (MINUS_EXPR,
1413 get_base_type (gnu_result_type),
1414 convert (gnu_result_type,
1415 TYPE_MAX_VALUE (gnu_type)),
1416 convert (gnu_result_type,
1417 TYPE_MIN_VALUE (gnu_type))),
1418 convert (gnu_result_type, integer_one_node)),
1419 convert (gnu_result_type, integer_zero_node));
1424 /* ... fall through ... */
1428 int Dimension = (Present (Expressions (gnat_node))
1429 ? UI_To_Int (Intval (First (Expressions (gnat_node))))
1431 struct parm_attr *pa = NULL;
1432 Entity_Id gnat_param = Empty;
1434 /* Make sure any implicit dereference gets done. */
1435 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1436 gnu_prefix = maybe_unconstrained_array (gnu_prefix);
1437 /* We treat unconstrained array In parameters specially. */
1438 if (Nkind (Prefix (gnat_node)) == N_Identifier
1439 && !Is_Constrained (Etype (Prefix (gnat_node)))
1440 && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter)
1441 gnat_param = Entity (Prefix (gnat_node));
1442 gnu_type = TREE_TYPE (gnu_prefix);
1443 prefix_unused = true;
1444 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1446 if (TYPE_CONVENTION_FORTRAN_P (gnu_type))
1451 for (ndim = 1, gnu_type_temp = gnu_type;
1452 TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE
1453 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp));
1454 ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp))
1457 Dimension = ndim + 1 - Dimension;
1460 for (i = 1; i < Dimension; i++)
1461 gnu_type = TREE_TYPE (gnu_type);
1463 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1465 /* When not optimizing, look up the slot associated with the parameter
1466 and the dimension in the cache and create a new one on failure. */
1467 if (!optimize && Present (gnat_param))
1469 for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++)
1470 if (pa->id == gnat_param && pa->dim == Dimension)
1475 pa = GGC_CNEW (struct parm_attr);
1476 pa->id = gnat_param;
1477 pa->dim = Dimension;
1478 VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa);
1482 /* Return the cached expression or build a new one. */
1483 if (attribute == Attr_First)
1485 if (pa && pa->first)
1487 gnu_result = pa->first;
1492 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1495 else if (attribute == Attr_Last)
1499 gnu_result = pa->last;
1504 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)));
1507 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1509 if (pa && pa->length)
1511 gnu_result = pa->length;
1516 /* We used to compute the length as max (hb - lb + 1, 0),
1517 which could overflow for some cases of empty arrays, e.g.
1518 when lb == index_type'first. We now compute the length as
1519 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1520 much rarer cases, for extremely large arrays we expect
1521 never to encounter in practice. In addition, the former
1522 computation required the use of potentially constraining
1523 signed arithmetic while the latter doesn't. Note that the
1524 comparison must be done in the original index base type,
1525 otherwise the conversion of either bound to gnu_compute_type
1528 tree gnu_compute_type = get_base_type (gnu_result_type);
1531 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
1533 = convert (gnu_compute_type, TYPE_MIN_VALUE (index_type));
1535 = convert (gnu_compute_type, TYPE_MAX_VALUE (index_type));
1539 (COND_EXPR, gnu_compute_type,
1540 build_binary_op (LT_EXPR, get_base_type (index_type),
1541 TYPE_MAX_VALUE (index_type),
1542 TYPE_MIN_VALUE (index_type)),
1543 convert (gnu_compute_type, integer_zero_node),
1545 (PLUS_EXPR, gnu_compute_type,
1546 build_binary_op (MINUS_EXPR, gnu_compute_type, hb, lb),
1547 convert (gnu_compute_type, integer_one_node)));
1551 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1552 handling. Note that these attributes could not have been used on
1553 an unconstrained array type. */
1554 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result,
1557 /* Cache the expression we have just computed. Since we want to do it
1558 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1559 create the temporary. */
1563 = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result);
1564 TREE_SIDE_EFFECTS (gnu_result) = 1;
1565 if (attribute == Attr_First)
1566 pa->first = gnu_result;
1567 else if (attribute == Attr_Last)
1568 pa->last = gnu_result;
1570 pa->length = gnu_result;
1575 case Attr_Bit_Position:
1577 case Attr_First_Bit:
1581 HOST_WIDE_INT bitsize;
1582 HOST_WIDE_INT bitpos;
1584 tree gnu_field_bitpos;
1585 tree gnu_field_offset;
1587 enum machine_mode mode;
1588 int unsignedp, volatilep;
1590 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1591 gnu_prefix = remove_conversions (gnu_prefix, true);
1592 prefix_unused = true;
1594 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1595 the result is 0. Don't allow 'Bit on a bare component, though. */
1596 if (attribute == Attr_Bit
1597 && TREE_CODE (gnu_prefix) != COMPONENT_REF
1598 && TREE_CODE (gnu_prefix) != FIELD_DECL)
1600 gnu_result = integer_zero_node;
1605 gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF
1606 || (attribute == Attr_Bit_Position
1607 && TREE_CODE (gnu_prefix) == FIELD_DECL));
1609 get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset,
1610 &mode, &unsignedp, &volatilep, false);
1612 if (TREE_CODE (gnu_prefix) == COMPONENT_REF)
1614 gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1));
1615 gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1));
1617 for (gnu_inner = TREE_OPERAND (gnu_prefix, 0);
1618 TREE_CODE (gnu_inner) == COMPONENT_REF
1619 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1));
1620 gnu_inner = TREE_OPERAND (gnu_inner, 0))
1623 = size_binop (PLUS_EXPR, gnu_field_bitpos,
1624 bit_position (TREE_OPERAND (gnu_inner, 1)));
1626 = size_binop (PLUS_EXPR, gnu_field_offset,
1627 byte_position (TREE_OPERAND (gnu_inner, 1)));
1630 else if (TREE_CODE (gnu_prefix) == FIELD_DECL)
1632 gnu_field_bitpos = bit_position (gnu_prefix);
1633 gnu_field_offset = byte_position (gnu_prefix);
1637 gnu_field_bitpos = bitsize_zero_node;
1638 gnu_field_offset = size_zero_node;
1644 gnu_result = gnu_field_offset;
1647 case Attr_First_Bit:
1649 gnu_result = size_int (bitpos % BITS_PER_UNIT);
1653 gnu_result = bitsize_int (bitpos % BITS_PER_UNIT);
1654 gnu_result = size_binop (PLUS_EXPR, gnu_result,
1655 TYPE_SIZE (TREE_TYPE (gnu_prefix)));
1656 gnu_result = size_binop (MINUS_EXPR, gnu_result,
1660 case Attr_Bit_Position:
1661 gnu_result = gnu_field_bitpos;
1665 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1667 gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix);
1674 tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node)));
1675 tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node))));
1677 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1678 gnu_result = build_binary_op (attribute == Attr_Min
1679 ? MIN_EXPR : MAX_EXPR,
1680 gnu_result_type, gnu_lhs, gnu_rhs);
1684 case Attr_Passed_By_Reference:
1685 gnu_result = size_int (default_pass_by_ref (gnu_type)
1686 || must_pass_by_ref (gnu_type));
1687 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1690 case Attr_Component_Size:
1691 if (TREE_CODE (gnu_prefix) == COMPONENT_REF
1692 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))
1694 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))))
1695 gnu_prefix = TREE_OPERAND (gnu_prefix, 0);
1697 gnu_prefix = maybe_implicit_deref (gnu_prefix);
1698 gnu_type = TREE_TYPE (gnu_prefix);
1700 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
1701 gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type))));
1703 while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
1704 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)))
1705 gnu_type = TREE_TYPE (gnu_type);
1707 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
1709 /* Note this size cannot be self-referential. */
1710 gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type));
1711 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1712 prefix_unused = true;
1715 case Attr_Null_Parameter:
1716 /* This is just a zero cast to the pointer type for our prefix and
1718 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1720 = build_unary_op (INDIRECT_REF, NULL_TREE,
1721 convert (build_pointer_type (gnu_result_type),
1722 integer_zero_node));
1723 TREE_PRIVATE (gnu_result) = 1;
1726 case Attr_Mechanism_Code:
1729 Entity_Id gnat_obj = Entity (Prefix (gnat_node));
1731 prefix_unused = true;
1732 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1733 if (Present (Expressions (gnat_node)))
1735 int i = UI_To_Int (Intval (First (Expressions (gnat_node))));
1737 for (gnat_obj = First_Formal (gnat_obj); i > 1;
1738 i--, gnat_obj = Next_Formal (gnat_obj))
1742 code = Mechanism (gnat_obj);
1743 if (code == Default)
1744 code = ((present_gnu_tree (gnat_obj)
1745 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj))
1746 || ((TREE_CODE (get_gnu_tree (gnat_obj))
1748 && (DECL_BY_COMPONENT_PTR_P
1749 (get_gnu_tree (gnat_obj))))))
1750 ? By_Reference : By_Copy);
1751 gnu_result = convert (gnu_result_type, size_int (- code));
1756 /* Say we have an unimplemented attribute. Then set the value to be
1757 returned to be a zero and hope that's something we can convert to
1758 the type of this attribute. */
1759 post_error ("unimplemented attribute", gnat_node);
1760 gnu_result_type = get_unpadded_type (Etype (gnat_node));
1761 gnu_result = integer_zero_node;
1765 /* If this is an attribute where the prefix was unused, force a use of it if
1766 it has a side-effect. But don't do it if the prefix is just an entity
1767 name. However, if an access check is needed, we must do it. See second
1768 example in AARM 11.6(5.e). */
1769 if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix)
1770 && !Is_Entity_Name (Prefix (gnat_node)))
1771 gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result),
1772 gnu_prefix, gnu_result);
1774 *gnu_result_type_p = gnu_result_type;
1778 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1779 to a GCC tree, which is returned. */
1782 Case_Statement_to_gnu (Node_Id gnat_node)
1788 gnu_expr = gnat_to_gnu (Expression (gnat_node));
1789 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1791 /* The range of values in a case statement is determined by the rules in
1792 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1793 of the expression. One exception arises in the case of a simple name that
1794 is parenthesized. This still has the Etype of the name, but since it is
1795 not a name, para 7 does not apply, and we need to go to the base type.
1796 This is the only case where parenthesization affects the dynamic
1797 semantics (i.e. the range of possible values at runtime that is covered
1798 by the others alternative.
1800 Another exception is if the subtype of the expression is non-static. In
1801 that case, we also have to use the base type. */
1802 if (Paren_Count (Expression (gnat_node)) != 0
1803 || !Is_OK_Static_Subtype (Underlying_Type
1804 (Etype (Expression (gnat_node)))))
1805 gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
1807 /* We build a SWITCH_EXPR that contains the code with interspersed
1808 CASE_LABEL_EXPRs for each label. */
1810 push_stack (&gnu_switch_label_stack, NULL_TREE, create_artificial_label ());
1811 start_stmt_group ();
1812 for (gnat_when = First_Non_Pragma (Alternatives (gnat_node));
1813 Present (gnat_when);
1814 gnat_when = Next_Non_Pragma (gnat_when))
1816 Node_Id gnat_choice;
1817 int choices_added = 0;
1819 /* First compile all the different case choices for the current WHEN
1821 for (gnat_choice = First (Discrete_Choices (gnat_when));
1822 Present (gnat_choice); gnat_choice = Next (gnat_choice))
1824 tree gnu_low = NULL_TREE, gnu_high = NULL_TREE;
1826 switch (Nkind (gnat_choice))
1829 gnu_low = gnat_to_gnu (Low_Bound (gnat_choice));
1830 gnu_high = gnat_to_gnu (High_Bound (gnat_choice));
1833 case N_Subtype_Indication:
1834 gnu_low = gnat_to_gnu (Low_Bound (Range_Expression
1835 (Constraint (gnat_choice))));
1836 gnu_high = gnat_to_gnu (High_Bound (Range_Expression
1837 (Constraint (gnat_choice))));
1841 case N_Expanded_Name:
1842 /* This represents either a subtype range or a static value of
1843 some kind; Ekind says which. */
1844 if (IN (Ekind (Entity (gnat_choice)), Type_Kind))
1846 tree gnu_type = get_unpadded_type (Entity (gnat_choice));
1848 gnu_low = fold (TYPE_MIN_VALUE (gnu_type));
1849 gnu_high = fold (TYPE_MAX_VALUE (gnu_type));
1853 /* ... fall through ... */
1855 case N_Character_Literal:
1856 case N_Integer_Literal:
1857 gnu_low = gnat_to_gnu (gnat_choice);
1860 case N_Others_Choice:
1867 /* If the case value is a subtype that raises Constraint_Error at
1868 run-time because of a wrong bound, then gnu_low or gnu_high is
1869 not translated into an INTEGER_CST. In such a case, we need
1870 to ensure that the when statement is not added in the tree,
1871 otherwise it will crash the gimplifier. */
1872 if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST)
1873 && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST))
1875 add_stmt_with_node (build3 (CASE_LABEL_EXPR, void_type_node,
1877 create_artificial_label ()),
1883 /* Push a binding level here in case variables are declared as we want
1884 them to be local to this set of statements instead of to the block
1885 containing the Case statement. */
1886 if (choices_added > 0)
1888 add_stmt (build_stmt_group (Statements (gnat_when), true));
1889 add_stmt (build1 (GOTO_EXPR, void_type_node,
1890 TREE_VALUE (gnu_switch_label_stack)));
1894 /* Now emit a definition of the label all the cases branched to. */
1895 add_stmt (build1 (LABEL_EXPR, void_type_node,
1896 TREE_VALUE (gnu_switch_label_stack)));
1897 gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr,
1898 end_stmt_group (), NULL_TREE);
1899 pop_stack (&gnu_switch_label_stack);
1904 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1905 to a GCC tree, which is returned. */
1908 Loop_Statement_to_gnu (Node_Id gnat_node)
1910 /* ??? It would be nice to use "build" here, but there's no build5. */
1911 tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE,
1912 NULL_TREE, NULL_TREE, NULL_TREE);
1913 tree gnu_loop_var = NULL_TREE;
1914 Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node);
1915 tree gnu_cond_expr = NULL_TREE;
1918 TREE_TYPE (gnu_loop_stmt) = void_type_node;
1919 TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1;
1920 LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label ();
1921 set_expr_location_from_node (gnu_loop_stmt, gnat_node);
1922 Sloc_to_locus (Sloc (End_Label (gnat_node)),
1923 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt)));
1925 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1926 N_Exit_Statement can find it. */
1927 push_stack (&gnu_loop_label_stack, NULL_TREE,
1928 LOOP_STMT_LABEL (gnu_loop_stmt));
1930 /* Set the condition under which the loop must keep going.
1931 For the case "LOOP .... END LOOP;" the condition is always true. */
1932 if (No (gnat_iter_scheme))
1935 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1936 else if (Present (Condition (gnat_iter_scheme)))
1937 LOOP_STMT_TOP_COND (gnu_loop_stmt)
1938 = gnat_to_gnu (Condition (gnat_iter_scheme));
1940 /* Otherwise we have an iteration scheme and the condition is given by
1941 the bounds of the subtype of the iteration variable. */
1944 Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme);
1945 Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec);
1946 Entity_Id gnat_type = Etype (gnat_loop_var);
1947 tree gnu_type = get_unpadded_type (gnat_type);
1948 tree gnu_low = TYPE_MIN_VALUE (gnu_type);
1949 tree gnu_high = TYPE_MAX_VALUE (gnu_type);
1950 tree gnu_first, gnu_last, gnu_limit;
1951 enum tree_code update_code, end_code;
1952 tree gnu_base_type = get_base_type (gnu_type);
1954 /* We must disable modulo reduction for the loop variable, if any,
1955 in order for the loop comparison to be effective. */
1956 if (Reverse_Present (gnat_loop_spec))
1958 gnu_first = gnu_high;
1960 update_code = MINUS_NOMOD_EXPR;
1962 gnu_limit = TYPE_MIN_VALUE (gnu_base_type);
1966 gnu_first = gnu_low;
1967 gnu_last = gnu_high;
1968 update_code = PLUS_NOMOD_EXPR;
1970 gnu_limit = TYPE_MAX_VALUE (gnu_base_type);
1973 /* We know the loop variable will not overflow if GNU_LAST is a constant
1974 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1975 the limit test to the end of the loop. In that case, we have to test
1976 for an empty loop outside the loop. */
1977 if (TREE_CODE (gnu_last) != INTEGER_CST
1978 || TREE_CODE (gnu_limit) != INTEGER_CST
1979 || tree_int_cst_equal (gnu_last, gnu_limit))
1982 = build3 (COND_EXPR, void_type_node,
1983 build_binary_op (LE_EXPR, integer_type_node,
1985 NULL_TREE, alloc_stmt_list ());
1986 set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec);
1989 /* Open a new nesting level that will surround the loop to declare the
1990 loop index variable. */
1991 start_stmt_group ();
1994 /* Declare the loop index and set it to its initial value. */
1995 gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1);
1996 if (DECL_BY_REF_P (gnu_loop_var))
1997 gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var);
1999 /* The loop variable might be a padded type, so use `convert' to get a
2000 reference to the inner variable if so. */
2001 gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var);
2003 /* Set either the top or bottom exit condition as appropriate depending
2004 on whether or not we know an overflow cannot occur. */
2006 LOOP_STMT_BOT_COND (gnu_loop_stmt)
2007 = build_binary_op (NE_EXPR, integer_type_node,
2008 gnu_loop_var, gnu_last);
2010 LOOP_STMT_TOP_COND (gnu_loop_stmt)
2011 = build_binary_op (end_code, integer_type_node,
2012 gnu_loop_var, gnu_last);
2014 LOOP_STMT_UPDATE (gnu_loop_stmt)
2015 = build_binary_op (MODIFY_EXPR, NULL_TREE,
2017 build_binary_op (update_code,
2018 TREE_TYPE (gnu_loop_var),
2020 convert (TREE_TYPE (gnu_loop_var),
2021 integer_one_node)));
2022 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt),
2026 /* If the loop was named, have the name point to this loop. In this case,
2027 the association is not a ..._DECL node, but the end label from this
2029 if (Present (Identifier (gnat_node)))
2030 save_gnu_tree (Entity (Identifier (gnat_node)),
2031 LOOP_STMT_LABEL (gnu_loop_stmt), true);
2033 /* Make the loop body into its own block, so any allocated storage will be
2034 released every iteration. This is needed for stack allocation. */
2035 LOOP_STMT_BODY (gnu_loop_stmt)
2036 = build_stmt_group (Statements (gnat_node), true);
2038 /* If we declared a variable, then we are in a statement group for that
2039 declaration. Add the LOOP_STMT to it and make that the "loop". */
2042 add_stmt (gnu_loop_stmt);
2044 gnu_loop_stmt = end_stmt_group ();
2047 /* If we have an outer COND_EXPR, that's our result and this loop is its
2048 "true" statement. Otherwise, the result is the LOOP_STMT. */
2051 COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt;
2052 gnu_result = gnu_cond_expr;
2053 recalculate_side_effects (gnu_cond_expr);
2056 gnu_result = gnu_loop_stmt;
2058 pop_stack (&gnu_loop_label_stack);
2063 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
2064 handler for the current function. */
2066 /* This is implemented by issuing a call to the appropriate VMS specific
2067 builtin. To avoid having VMS specific sections in the global gigi decls
2068 array, we maintain the decls of interest here. We can't declare them
2069 inside the function because we must mark them never to be GC'd, which we
2070 can only do at the global level. */
2072 static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE;
2073 static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE;
2076 establish_gnat_vms_condition_handler (void)
2078 tree establish_stmt;
2080 /* Elaborate the required decls on the first call. Check on the decl for
2081 the gnat condition handler to decide, as this is one we create so we are
2082 sure that it will be non null on subsequent calls. The builtin decl is
2083 looked up so remains null on targets where it is not implemented yet. */
2084 if (gnat_vms_condition_handler_decl == NULL_TREE)
2086 vms_builtin_establish_handler_decl
2088 (get_identifier ("__builtin_establish_vms_condition_handler"));
2090 gnat_vms_condition_handler_decl
2091 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
2093 build_function_type_list (integer_type_node,
2097 NULL_TREE, 0, 1, 1, 0, Empty);
2099 /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */
2100 DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE;
2103 /* Do nothing if the establish builtin is not available, which might happen
2104 on targets where the facility is not implemented. */
2105 if (vms_builtin_establish_handler_decl == NULL_TREE)
2109 = build_call_1_expr (vms_builtin_establish_handler_decl,
2111 (ADDR_EXPR, NULL_TREE,
2112 gnat_vms_condition_handler_decl));
2114 add_stmt (establish_stmt);
2117 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
2118 don't return anything. */
2121 Subprogram_Body_to_gnu (Node_Id gnat_node)
2123 /* Defining identifier of a parameter to the subprogram. */
2124 Entity_Id gnat_param;
2125 /* The defining identifier for the subprogram body. Note that if a
2126 specification has appeared before for this body, then the identifier
2127 occurring in that specification will also be a defining identifier and all
2128 the calls to this subprogram will point to that specification. */
2129 Entity_Id gnat_subprog_id
2130 = (Present (Corresponding_Spec (gnat_node))
2131 ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node));
2132 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2133 tree gnu_subprog_decl;
2134 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2135 tree gnu_subprog_type;
2138 VEC(parm_attr,gc) *cache;
2140 /* If this is a generic object or if it has been eliminated,
2142 if (Ekind (gnat_subprog_id) == E_Generic_Procedure
2143 || Ekind (gnat_subprog_id) == E_Generic_Function
2144 || Is_Eliminated (gnat_subprog_id))
2147 /* If this subprogram acts as its own spec, define it. Otherwise, just get
2148 the already-elaborated tree node. However, if this subprogram had its
2149 elaboration deferred, we will already have made a tree node for it. So
2150 treat it as not being defined in that case. Such a subprogram cannot
2151 have an address clause or a freeze node, so this test is safe, though it
2152 does disable some otherwise-useful error checking. */
2154 = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE,
2155 Acts_As_Spec (gnat_node)
2156 && !present_gnu_tree (gnat_subprog_id));
2158 gnu_subprog_type = TREE_TYPE (gnu_subprog_decl);
2160 /* Propagate the debug mode. */
2161 if (!Needs_Debug_Info (gnat_subprog_id))
2162 DECL_IGNORED_P (gnu_subprog_decl) = 1;
2164 /* Set the line number in the decl to correspond to that of the body so that
2165 the line number notes are written correctly. */
2166 Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl));
2168 /* Initialize the information structure for the function. */
2169 allocate_struct_function (gnu_subprog_decl, false);
2170 DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language
2171 = GGC_CNEW (struct language_function);
2173 begin_subprog_body (gnu_subprog_decl);
2174 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2176 /* If there are Out parameters, we need to ensure that the return statement
2177 properly copies them out. We do this by making a new block and converting
2178 any inner return into a goto to a label at the end of the block. */
2179 push_stack (&gnu_return_label_stack, NULL_TREE,
2180 gnu_cico_list ? create_artificial_label () : NULL_TREE);
2182 /* Get a tree corresponding to the code for the subprogram. */
2183 start_stmt_group ();
2186 /* See if there are any parameters for which we don't yet have GCC entities.
2187 These must be for Out parameters for which we will be making VAR_DECL
2188 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
2189 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
2190 the order of the parameters. */
2191 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2192 Present (gnat_param);
2193 gnat_param = Next_Formal_With_Extras (gnat_param))
2194 if (!present_gnu_tree (gnat_param))
2196 /* Skip any entries that have been already filled in; they must
2197 correspond to In Out parameters. */
2198 for (; gnu_cico_list && TREE_VALUE (gnu_cico_list);
2199 gnu_cico_list = TREE_CHAIN (gnu_cico_list))
2202 /* Do any needed references for padded types. */
2203 TREE_VALUE (gnu_cico_list)
2204 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)),
2205 gnat_to_gnu_entity (gnat_param, NULL_TREE, 1));
2208 /* On VMS, establish our condition handler to possibly turn a condition into
2209 the corresponding exception if the subprogram has a foreign convention or
2212 To ensure proper execution of local finalizations on condition instances,
2213 we must turn a condition into the corresponding exception even if there
2214 is no applicable Ada handler, and need at least one condition handler per
2215 possible call chain involving GNAT code. OTOH, establishing the handler
2216 has a cost so we want to minimize the number of subprograms into which
2217 this happens. The foreign or exported condition is expected to satisfy
2218 all the constraints. */
2219 if (TARGET_ABI_OPEN_VMS
2220 && (Has_Foreign_Convention (gnat_subprog_id)
2221 || Is_Exported (gnat_subprog_id)))
2222 establish_gnat_vms_condition_handler ();
2224 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
2226 /* Generate the code of the subprogram itself. A return statement will be
2227 present and any Out parameters will be handled there. */
2228 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
2230 gnu_result = end_stmt_group ();
2232 /* If we populated the parameter attributes cache, we need to make sure
2233 that the cached expressions are evaluated on all possible paths. */
2234 cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache;
2237 struct parm_attr *pa;
2240 start_stmt_group ();
2242 for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++)
2245 add_stmt_with_node (pa->first, gnat_node);
2247 add_stmt_with_node (pa->last, gnat_node);
2249 add_stmt_with_node (pa->length, gnat_node);
2252 add_stmt (gnu_result);
2253 gnu_result = end_stmt_group ();
2256 /* If we made a special return label, we need to make a block that contains
2257 the definition of that label and the copying to the return value. That
2258 block first contains the function, then the label and copy statement. */
2259 if (TREE_VALUE (gnu_return_label_stack))
2263 start_stmt_group ();
2265 add_stmt (gnu_result);
2266 add_stmt (build1 (LABEL_EXPR, void_type_node,
2267 TREE_VALUE (gnu_return_label_stack)));
2269 gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2270 if (list_length (gnu_cico_list) == 1)
2271 gnu_retval = TREE_VALUE (gnu_cico_list);
2273 gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
2276 if (DECL_P (gnu_retval) && DECL_BY_REF_P (gnu_retval))
2277 gnu_retval = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_retval);
2280 (build_return_expr (DECL_RESULT (gnu_subprog_decl), gnu_retval),
2281 End_Label (Handled_Statement_Sequence (gnat_node)));
2283 gnu_result = end_stmt_group ();
2286 pop_stack (&gnu_return_label_stack);
2288 /* Set the end location. */
2290 ((Present (End_Label (Handled_Statement_Sequence (gnat_node)))
2291 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node)))
2292 : Sloc (gnat_node)),
2293 &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus);
2295 end_subprog_body (gnu_result, false);
2297 /* Disconnect the trees for parameters that we made variables for from the
2298 GNAT entities since these are unusable after we end the function. */
2299 for (gnat_param = First_Formal_With_Extras (gnat_subprog_id);
2300 Present (gnat_param);
2301 gnat_param = Next_Formal_With_Extras (gnat_param))
2302 if (TREE_CODE (get_gnu_tree (gnat_param)) == VAR_DECL)
2303 save_gnu_tree (gnat_param, NULL_TREE, false);
2305 if (DECL_FUNCTION_STUB (gnu_subprog_decl))
2306 build_function_stub (gnu_subprog_decl, gnat_subprog_id);
2308 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node)));
2311 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2312 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2313 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2314 If GNU_TARGET is non-null, this must be a function call and the result
2315 of the call is to be placed into that object. */
2318 call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target)
2321 /* The GCC node corresponding to the GNAT subprogram name. This can either
2322 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2323 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2325 tree gnu_subprog_node = gnat_to_gnu (Name (gnat_node));
2326 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2327 tree gnu_subprog_type = TREE_TYPE (gnu_subprog_node);
2328 tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE,
2330 Entity_Id gnat_formal;
2331 Node_Id gnat_actual;
2332 tree gnu_actual_list = NULL_TREE;
2333 tree gnu_name_list = NULL_TREE;
2334 tree gnu_before_list = NULL_TREE;
2335 tree gnu_after_list = NULL_TREE;
2336 tree gnu_subprog_call;
2338 gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE);
2340 /* If we are calling a stubbed function, make this into a raise of
2341 Program_Error. Elaborate all our args first. */
2342 if (TREE_CODE (gnu_subprog_node) == FUNCTION_DECL
2343 && DECL_STUBBED_P (gnu_subprog_node))
2345 for (gnat_actual = First_Actual (gnat_node);
2346 Present (gnat_actual);
2347 gnat_actual = Next_Actual (gnat_actual))
2348 add_stmt (gnat_to_gnu (gnat_actual));
2352 = build_call_raise (PE_Stubbed_Subprogram_Called, gnat_node,
2353 N_Raise_Program_Error);
2355 if (Nkind (gnat_node) == N_Function_Call && !gnu_target)
2357 *gnu_result_type_p = TREE_TYPE (gnu_subprog_type);
2358 return build1 (NULL_EXPR, *gnu_result_type_p, call_expr);
2365 /* If we are calling by supplying a pointer to a target, set up that
2366 pointer as the first argument. Use GNU_TARGET if one was passed;
2367 otherwise, make a target by building a variable of the maximum size
2369 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2371 tree gnu_real_ret_type
2372 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2377 = maybe_pad_type (gnu_real_ret_type,
2378 max_size (TYPE_SIZE (gnu_real_ret_type), true),
2379 0, Etype (Name (gnat_node)), "PAD", false,
2382 /* ??? We may be about to create a static temporary if we happen to
2383 be at the global binding level. That's a regression from what
2384 the 3.x back-end would generate in the same situation, but we
2385 don't have a mechanism in Gigi for creating automatic variables
2386 in the elaboration routines. */
2388 = create_var_decl (create_tmp_var_name ("LR"), NULL, gnu_obj_type,
2389 NULL, false, false, false, false, NULL,
2394 = tree_cons (NULL_TREE,
2395 build_unary_op (ADDR_EXPR, NULL_TREE,
2396 unchecked_convert (gnu_real_ret_type,
2403 /* The only way we can be making a call via an access type is if Name is an
2404 explicit dereference. In that case, get the list of formal args from the
2405 type the access type is pointing to. Otherwise, get the formals from
2406 entity being called. */
2407 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2408 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2409 else if (Nkind (Name (gnat_node)) == N_Attribute_Reference)
2410 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2413 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2415 /* Create the list of the actual parameters as GCC expects it, namely a chain
2416 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2417 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2418 parameters not passed by reference and don't need to be copied in. */
2419 for (gnat_actual = First_Actual (gnat_node);
2420 Present (gnat_actual);
2421 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2422 gnat_actual = Next_Actual (gnat_actual))
2425 = (present_gnu_tree (gnat_formal)
2426 ? get_gnu_tree (gnat_formal) : NULL_TREE);
2427 tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal));
2428 /* We must suppress conversions that can cause the creation of a
2429 temporary in the Out or In Out case because we need the real
2430 object in this case, either to pass its address if it's passed
2431 by reference or as target of the back copy done after the call
2432 if it uses the copy-in copy-out mechanism. We do it in the In
2433 case too, except for an unchecked conversion because it alone
2434 can cause the actual to be misaligned and the addressability
2435 test is applied to the real object. */
2436 bool suppress_type_conversion
2437 = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion
2438 && Ekind (gnat_formal) != E_In_Parameter)
2439 || (Nkind (gnat_actual) == N_Type_Conversion
2440 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))));
2441 Node_Id gnat_name = (suppress_type_conversion
2442 ? Expression (gnat_actual) : gnat_actual);
2443 tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type;
2446 /* If it's possible we may need to use this expression twice, make sure
2447 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2448 to force side-effects before the call.
2449 ??? This is more conservative than we need since we don't need to do
2450 this for pass-by-ref with no conversion. */
2451 if (Ekind (gnat_formal) != E_In_Parameter)
2452 gnu_name = gnat_stabilize_reference (gnu_name, true);
2454 /* If we are passing a non-addressable parameter by reference, pass the
2455 address of a copy. In the Out or In Out case, set up to copy back
2456 out after the call. */
2458 && (DECL_BY_REF_P (gnu_formal)
2459 || (TREE_CODE (gnu_formal) == PARM_DECL
2460 && (DECL_BY_COMPONENT_PTR_P (gnu_formal)
2461 || (DECL_BY_DESCRIPTOR_P (gnu_formal)))))
2462 && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name)))
2463 && !addressable_p (gnu_name, gnu_name_type))
2465 tree gnu_copy = gnu_name, gnu_temp;
2467 /* If the type is by_reference, a copy is not allowed. */
2468 if (Is_By_Reference_Type (Etype (gnat_formal)))
2470 ("misaligned actual cannot be passed by reference", gnat_actual);
2472 /* For users of Starlet we issue a warning because the
2473 interface apparently assumes that by-ref parameters
2474 outlive the procedure invocation. The code still
2475 will not work as intended, but we cannot do much
2476 better since other low-level parts of the back-end
2477 would allocate temporaries at will because of the
2478 misalignment if we did not do so here. */
2479 else if (Is_Valued_Procedure (Entity (Name (gnat_node))))
2482 ("?possible violation of implicit assumption", gnat_actual);
2484 ("?made by pragma Import_Valued_Procedure on &", gnat_actual,
2485 Entity (Name (gnat_node)));
2486 post_error_ne ("?because of misalignment of &", gnat_actual,
2490 /* If the actual type of the object is already the nominal type,
2491 we have nothing to do, except if the size is self-referential
2492 in which case we'll remove the unpadding below. */
2493 if (TREE_TYPE (gnu_name) == gnu_name_type
2494 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type)))
2497 /* Otherwise remove unpadding from the object and reset the copy. */
2498 else if (TREE_CODE (gnu_name) == COMPONENT_REF
2499 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))
2501 && (TYPE_IS_PADDING_P
2502 (TREE_TYPE (TREE_OPERAND (gnu_name, 0))))))
2503 gnu_name = gnu_copy = TREE_OPERAND (gnu_name, 0);
2505 /* Otherwise convert to the nominal type of the object if it's
2506 a record type. There are several cases in which we need to
2507 make the temporary using this type instead of the actual type
2508 of the object if they are distinct, because the expectations
2509 of the callee would otherwise not be met:
2510 - if it's a justified modular type,
2511 - if the actual type is a smaller packable version of it. */
2512 else if (TREE_CODE (gnu_name_type) == RECORD_TYPE
2513 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type)
2514 || smaller_packable_type_p (TREE_TYPE (gnu_name),
2516 gnu_name = convert (gnu_name_type, gnu_name);
2518 /* Make a SAVE_EXPR to both properly account for potential side
2519 effects and handle the creation of a temporary copy. Special
2520 code in gnat_gimplify_expr ensures that the same temporary is
2521 used as the object and copied back after the call if needed. */
2522 gnu_name = build1 (SAVE_EXPR, TREE_TYPE (gnu_name), gnu_name);
2523 TREE_SIDE_EFFECTS (gnu_name) = 1;
2525 /* Set up to move the copy back to the original. */
2526 if (Ekind (gnat_formal) != E_In_Parameter)
2528 gnu_temp = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_copy,
2530 set_expr_location_from_node (gnu_temp, gnat_node);
2531 append_to_statement_list (gnu_temp, &gnu_after_list);
2535 /* Start from the real object and build the actual. */
2536 gnu_actual = gnu_name;
2538 /* If this was a procedure call, we may not have removed any padding.
2539 So do it here for the part we will use as an input, if any. */
2540 if (Ekind (gnat_formal) != E_Out_Parameter
2541 && TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2542 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual)))
2543 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2546 /* Do any needed conversions for the actual and make sure that it is
2547 in range of the formal's type. */
2548 if (suppress_type_conversion)
2550 /* Put back the conversion we suppressed above in the computation
2551 of the real object. Note that we treat a conversion between
2552 aggregate types as if it is an unchecked conversion here. */
2554 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)),
2556 (Nkind (gnat_actual)
2557 == N_Unchecked_Type_Conversion)
2558 && No_Truncation (gnat_actual));
2560 if (Ekind (gnat_formal) != E_Out_Parameter
2561 && Do_Range_Check (gnat_actual))
2562 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2567 if (Ekind (gnat_formal) != E_Out_Parameter
2568 && Do_Range_Check (gnat_actual))
2569 gnu_actual = emit_range_check (gnu_actual, Etype (gnat_formal),
2572 /* We may have suppressed a conversion to the Etype of the actual
2573 since the parent is a procedure call. So put it back here.
2574 ??? We use the reverse order compared to the case above because
2575 of an awkward interaction with the check and actually don't put
2576 back the conversion at all if a check is emitted. This is also
2577 done for the conversion to the formal's type just below. */
2578 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2579 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2583 if (TREE_CODE (gnu_actual) != SAVE_EXPR)
2584 gnu_actual = convert (gnu_formal_type, gnu_actual);
2586 /* Unless this is an In parameter, we must remove any justified modular
2587 building from GNU_NAME to get an lvalue. */
2588 if (Ekind (gnat_formal) != E_In_Parameter
2589 && TREE_CODE (gnu_name) == CONSTRUCTOR
2590 && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE
2591 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name)))
2592 gnu_name = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))),
2595 /* If we have not saved a GCC object for the formal, it means it is an
2596 Out parameter not passed by reference and that does not need to be
2597 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2600 && TREE_CODE (gnu_formal) == PARM_DECL
2601 && DECL_BY_REF_P (gnu_formal))
2603 if (Ekind (gnat_formal) != E_In_Parameter)
2605 /* In Out or Out parameters passed by reference don't use the
2606 copy-in copy-out mechanism so the address of the real object
2607 must be passed to the function. */
2608 gnu_actual = gnu_name;
2610 /* If we have a padded type, be sure we've removed padding. */
2611 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2612 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))
2613 && TREE_CODE (gnu_actual) != SAVE_EXPR)
2614 gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)),
2617 /* If we have the constructed subtype of an aliased object
2618 with an unconstrained nominal subtype, the type of the
2619 actual includes the template, although it is formally
2620 constrained. So we need to convert it back to the real
2621 constructed subtype to retrieve the constrained part
2622 and takes its address. */
2623 if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE
2624 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual))
2625 && TREE_CODE (gnu_actual) != SAVE_EXPR
2626 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual))
2627 && Is_Array_Type (Etype (gnat_actual)))
2628 gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)),
2632 /* The symmetry of the paths to the type of an entity is broken here
2633 since arguments don't know that they will be passed by ref. */
2634 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2635 gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual);
2638 && TREE_CODE (gnu_formal) == PARM_DECL
2639 && DECL_BY_COMPONENT_PTR_P (gnu_formal))
2641 gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal));
2642 gnu_actual = maybe_implicit_deref (gnu_actual);
2643 gnu_actual = maybe_unconstrained_array (gnu_actual);
2645 if (TREE_CODE (gnu_formal_type) == RECORD_TYPE
2646 && TYPE_IS_PADDING_P (gnu_formal_type))
2648 gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type));
2649 gnu_actual = convert (gnu_formal_type, gnu_actual);
2652 /* Take the address of the object and convert to the proper pointer
2653 type. We'd like to actually compute the address of the beginning
2654 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2655 possibility that the ARRAY_REF might return a constant and we'd be
2656 getting the wrong address. Neither approach is exactly correct,
2657 but this is the most likely to work in all cases. */
2658 gnu_actual = convert (gnu_formal_type,
2659 build_unary_op (ADDR_EXPR, NULL_TREE,
2663 && TREE_CODE (gnu_formal) == PARM_DECL
2664 && DECL_BY_DESCRIPTOR_P (gnu_formal))
2666 /* If arg is 'Null_Parameter, pass zero descriptor. */
2667 if ((TREE_CODE (gnu_actual) == INDIRECT_REF
2668 || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF)
2669 && TREE_PRIVATE (gnu_actual))
2670 gnu_actual = convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal)),
2673 gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE,
2674 fill_vms_descriptor (gnu_actual,
2680 tree gnu_actual_size = TYPE_SIZE (TREE_TYPE (gnu_actual));
2682 if (Ekind (gnat_formal) != E_In_Parameter)
2683 gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list);
2685 if (!gnu_formal || TREE_CODE (gnu_formal) != PARM_DECL)
2688 /* If this is 'Null_Parameter, pass a zero even though we are
2689 dereferencing it. */
2690 else if (TREE_CODE (gnu_actual) == INDIRECT_REF
2691 && TREE_PRIVATE (gnu_actual)
2692 && host_integerp (gnu_actual_size, 1)
2693 && 0 >= compare_tree_int (gnu_actual_size,
2696 = unchecked_convert (DECL_ARG_TYPE (gnu_formal),
2697 convert (gnat_type_for_size
2698 (tree_low_cst (gnu_actual_size, 1),
2703 gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual);
2706 gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list);
2709 gnu_subprog_call = build_call_list (TREE_TYPE (gnu_subprog_type),
2711 nreverse (gnu_actual_list));
2712 set_expr_location_from_node (gnu_subprog_call, gnat_node);
2714 /* If we return by passing a target, the result is the target after the
2715 call. We must not emit the call directly here because this might be
2716 evaluated as part of an expression with conditions to control whether
2717 the call should be emitted or not. */
2718 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
2720 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2721 by the target object converted to the proper type. Doing so would
2722 potentially be very inefficient, however, as this expression might
2723 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2724 pointless temporary copy of the whole object.
2726 What we do instead is build a COMPOUND_EXPR returning the address of
2727 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2728 SAVE_EXPR later on then only incurs a pointer copy. */
2730 tree gnu_result_type
2731 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type)));
2734 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2736 tree gnu_target_address
2737 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_target);
2738 set_expr_location_from_node (gnu_target_address, gnat_node);
2741 = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_target_address),
2742 gnu_subprog_call, gnu_target_address);
2745 = unchecked_convert (gnu_result_type,
2746 build_unary_op (INDIRECT_REF, NULL_TREE,
2750 *gnu_result_type_p = gnu_result_type;
2754 /* If it is a function call, the result is the call expression unless
2755 a target is specified, in which case we copy the result into the target
2756 and return the assignment statement. */
2757 else if (Nkind (gnat_node) == N_Function_Call)
2759 gnu_result = gnu_subprog_call;
2761 /* If the function returns an unconstrained array or by reference,
2762 we have to de-dereference the pointer. */
2763 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type)
2764 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type))
2765 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
2768 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2769 gnu_target, gnu_result);
2771 *gnu_result_type_p = get_unpadded_type (Etype (gnat_node));
2776 /* If this is the case where the GNAT tree contains a procedure call
2777 but the Ada procedure has copy in copy out parameters, the special
2778 parameter passing mechanism must be used. */
2779 else if (TYPE_CI_CO_LIST (gnu_subprog_type) != NULL_TREE)
2781 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2782 in copy out parameters. */
2783 tree scalar_return_list = TYPE_CI_CO_LIST (gnu_subprog_type);
2784 int length = list_length (scalar_return_list);
2790 gnu_subprog_call = save_expr (gnu_subprog_call);
2791 gnu_name_list = nreverse (gnu_name_list);
2793 /* If any of the names had side-effects, ensure they are all
2794 evaluated before the call. */
2795 for (gnu_name = gnu_name_list; gnu_name;
2796 gnu_name = TREE_CHAIN (gnu_name))
2797 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name)))
2798 append_to_statement_list (TREE_VALUE (gnu_name),
2802 if (Nkind (Name (gnat_node)) == N_Explicit_Dereference)
2803 gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node)));
2805 gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node)));
2807 for (gnat_actual = First_Actual (gnat_node);
2808 Present (gnat_actual);
2809 gnat_formal = Next_Formal_With_Extras (gnat_formal),
2810 gnat_actual = Next_Actual (gnat_actual))
2811 /* If we are dealing with a copy in copy out parameter, we must
2812 retrieve its value from the record returned in the call. */
2813 if (!(present_gnu_tree (gnat_formal)
2814 && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2815 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal))
2816 || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL
2817 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal))
2818 || (DECL_BY_DESCRIPTOR_P
2819 (get_gnu_tree (gnat_formal))))))))
2820 && Ekind (gnat_formal) != E_In_Parameter)
2822 /* Get the value to assign to this Out or In Out parameter. It is
2823 either the result of the function if there is only a single such
2824 parameter or the appropriate field from the record returned. */
2826 = length == 1 ? gnu_subprog_call
2827 : build_component_ref (gnu_subprog_call, NULL_TREE,
2828 TREE_PURPOSE (scalar_return_list),
2831 /* If the actual is a conversion, get the inner expression, which
2832 will be the real destination, and convert the result to the
2833 type of the actual parameter. */
2835 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list));
2837 /* If the result is a padded type, remove the padding. */
2838 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
2839 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
2840 gnu_result = convert (TREE_TYPE (TYPE_FIELDS
2841 (TREE_TYPE (gnu_result))),
2844 /* If the actual is a type conversion, the real target object is
2845 denoted by the inner Expression and we need to convert the
2846 result to the associated type.
2847 We also need to convert our gnu assignment target to this type
2848 if the corresponding GNU_NAME was constructed from the GNAT
2849 conversion node and not from the inner Expression. */
2850 if (Nkind (gnat_actual) == N_Type_Conversion)
2853 = convert_with_check
2854 (Etype (Expression (gnat_actual)), gnu_result,
2855 Do_Overflow_Check (gnat_actual),
2856 Do_Range_Check (Expression (gnat_actual)),
2857 Float_Truncate (gnat_actual), gnat_actual);
2859 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))
2860 gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual);
2863 /* Unchecked conversions as actuals for Out parameters are not
2864 allowed in user code because they are not variables, but do
2865 occur in front-end expansions. The associated GNU_NAME is
2866 always obtained from the inner expression in such cases. */
2867 else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion)
2868 gnu_result = unchecked_convert (TREE_TYPE (gnu_actual),
2870 No_Truncation (gnat_actual));
2873 if (Do_Range_Check (gnat_actual))
2875 = emit_range_check (gnu_result, Etype (gnat_actual),
2878 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual)))
2879 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result)))))
2880 gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result);
2883 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
2884 gnu_actual, gnu_result);
2885 set_expr_location_from_node (gnu_result, gnat_node);
2886 append_to_statement_list (gnu_result, &gnu_before_list);
2887 scalar_return_list = TREE_CHAIN (scalar_return_list);
2888 gnu_name_list = TREE_CHAIN (gnu_name_list);
2892 append_to_statement_list (gnu_subprog_call, &gnu_before_list);
2894 append_to_statement_list (gnu_after_list, &gnu_before_list);
2895 return gnu_before_list;
2898 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2899 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2902 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node)
2904 tree gnu_jmpsave_decl = NULL_TREE;
2905 tree gnu_jmpbuf_decl = NULL_TREE;
2906 /* If just annotating, ignore all EH and cleanups. */
2907 bool gcc_zcx = (!type_annotate_only
2908 && Present (Exception_Handlers (gnat_node))
2909 && Exception_Mechanism == Back_End_Exceptions);
2911 = (!type_annotate_only && Present (Exception_Handlers (gnat_node))
2912 && Exception_Mechanism == Setjmp_Longjmp);
2913 bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node));
2914 bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp);
2915 tree gnu_inner_block; /* The statement(s) for the block itself. */
2920 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2921 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2922 add_cleanup, and when we leave the binding, end_stmt_group will create
2923 the TRY_FINALLY_EXPR.
2925 ??? The region level calls down there have been specifically put in place
2926 for a ZCX context and currently the order in which things are emitted
2927 (region/handlers) is different from the SJLJ case. Instead of putting
2928 other calls with different conditions at other places for the SJLJ case,
2929 it seems cleaner to reorder things for the SJLJ case and generalize the
2930 condition to make it not ZCX specific.
2932 If there are any exceptions or cleanup processing involved, we need an
2933 outer statement group (for Setjmp_Longjmp) and binding level. */
2934 if (binding_for_block)
2936 start_stmt_group ();
2940 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2941 area for address of previous buffer. Do this first since we need to have
2942 the setjmp buf known for any decls in this block. */
2945 gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"),
2946 NULL_TREE, jmpbuf_ptr_type,
2947 build_call_0_expr (get_jmpbuf_decl),
2948 false, false, false, false, NULL,
2950 DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1;
2952 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2953 because of the unstructured form of EH used by setjmp_longjmp, there
2954 might be forward edges going to __builtin_setjmp receivers on which
2955 it is uninitialized, although they will never be actually taken. */
2956 TREE_NO_WARNING (gnu_jmpsave_decl) = 1;
2957 gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"),
2958 NULL_TREE, jmpbuf_type,
2959 NULL_TREE, false, false, false, false,
2961 DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1;
2963 set_block_jmpbuf_decl (gnu_jmpbuf_decl);
2965 /* When we exit this block, restore the saved value. */
2966 add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl),
2967 End_Label (gnat_node));
2970 /* If we are to call a function when exiting this block, add a cleanup
2971 to the binding level we made above. Note that add_cleanup is FIFO
2972 so we must register this cleanup after the EH cleanup just above. */
2974 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))),
2975 End_Label (gnat_node));
2977 /* Now build the tree for the declarations and statements inside this block.
2978 If this is SJLJ, set our jmp_buf as the current buffer. */
2979 start_stmt_group ();
2982 add_stmt (build_call_1_expr (set_jmpbuf_decl,
2983 build_unary_op (ADDR_EXPR, NULL_TREE,
2986 if (Present (First_Real_Statement (gnat_node)))
2987 process_decls (Statements (gnat_node), Empty,
2988 First_Real_Statement (gnat_node), true, true);
2990 /* Generate code for each statement in the block. */
2991 for (gnat_temp = (Present (First_Real_Statement (gnat_node))
2992 ? First_Real_Statement (gnat_node)
2993 : First (Statements (gnat_node)));
2994 Present (gnat_temp); gnat_temp = Next (gnat_temp))
2995 add_stmt (gnat_to_gnu (gnat_temp));
2996 gnu_inner_block = end_stmt_group ();
2998 /* Now generate code for the two exception models, if either is relevant for
3002 tree *gnu_else_ptr = 0;
3005 /* Make a binding level for the exception handling declarations and code
3006 and set up gnu_except_ptr_stack for the handlers to use. */
3007 start_stmt_group ();
3010 push_stack (&gnu_except_ptr_stack, NULL_TREE,
3011 create_var_decl (get_identifier ("EXCEPT_PTR"),
3013 build_pointer_type (except_type_node),
3014 build_call_0_expr (get_excptr_decl), false,
3015 false, false, false, NULL, gnat_node));
3017 /* Generate code for each handler. The N_Exception_Handler case does the
3018 real work and returns a COND_EXPR for each handler, which we chain
3020 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3021 Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp))
3023 gnu_expr = gnat_to_gnu (gnat_temp);
3025 /* If this is the first one, set it as the outer one. Otherwise,
3026 point the "else" part of the previous handler to us. Then point
3027 to our "else" part. */
3029 add_stmt (gnu_expr);
3031 *gnu_else_ptr = gnu_expr;
3033 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
3036 /* If none of the exception handlers did anything, re-raise but do not
3038 gnu_expr = build_call_1_expr (raise_nodefer_decl,
3039 TREE_VALUE (gnu_except_ptr_stack));
3040 set_expr_location_from_node (gnu_expr, gnat_node);
3043 *gnu_else_ptr = gnu_expr;
3045 add_stmt (gnu_expr);
3047 /* End the binding level dedicated to the exception handlers and get the
3048 whole statement group. */
3049 pop_stack (&gnu_except_ptr_stack);
3051 gnu_handler = end_stmt_group ();
3053 /* If the setjmp returns 1, we restore our incoming longjmp value and
3054 then check the handlers. */
3055 start_stmt_group ();
3056 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl,
3059 add_stmt (gnu_handler);
3060 gnu_handler = end_stmt_group ();
3062 /* This block is now "if (setjmp) ... <handlers> else <block>". */
3063 gnu_result = build3 (COND_EXPR, void_type_node,
3066 build_unary_op (ADDR_EXPR, NULL_TREE,
3068 gnu_handler, gnu_inner_block);
3074 /* First make a block containing the handlers. */
3075 start_stmt_group ();
3076 for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node));
3077 Present (gnat_temp);
3078 gnat_temp = Next_Non_Pragma (gnat_temp))
3079 add_stmt (gnat_to_gnu (gnat_temp));
3080 gnu_handlers = end_stmt_group ();
3082 /* Now make the TRY_CATCH_EXPR for the block. */
3083 gnu_result = build2 (TRY_CATCH_EXPR, void_type_node,
3084 gnu_inner_block, gnu_handlers);
3087 gnu_result = gnu_inner_block;
3089 /* Now close our outer block, if we had to make one. */
3090 if (binding_for_block)
3092 add_stmt (gnu_result);
3094 gnu_result = end_stmt_group ();
3100 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3101 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
3102 exception handling. */
3105 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node)
3107 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
3108 an "if" statement to select the proper exceptions. For "Others", exclude
3109 exceptions where Handled_By_Others is nonzero unless the All_Others flag
3110 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
3111 tree gnu_choice = integer_zero_node;
3112 tree gnu_body = build_stmt_group (Statements (gnat_node), false);
3115 for (gnat_temp = First (Exception_Choices (gnat_node));
3116 gnat_temp; gnat_temp = Next (gnat_temp))
3120 if (Nkind (gnat_temp) == N_Others_Choice)
3122 if (All_Others (gnat_temp))
3123 this_choice = integer_one_node;
3127 (EQ_EXPR, integer_type_node,
3132 (INDIRECT_REF, NULL_TREE,
3133 TREE_VALUE (gnu_except_ptr_stack)),
3134 get_identifier ("not_handled_by_others"), NULL_TREE,
3139 else if (Nkind (gnat_temp) == N_Identifier
3140 || Nkind (gnat_temp) == N_Expanded_Name)
3142 Entity_Id gnat_ex_id = Entity (gnat_temp);
3145 /* Exception may be a renaming. Recover original exception which is
3146 the one elaborated and registered. */
3147 if (Present (Renamed_Object (gnat_ex_id)))
3148 gnat_ex_id = Renamed_Object (gnat_ex_id);
3150 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3154 (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack),
3155 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)),
3156 build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr)));
3158 /* If this is the distinguished exception "Non_Ada_Error" (and we are
3159 in VMS mode), also allow a non-Ada exception (a VMS condition) t
3161 if (Is_Non_Ada_Error (Entity (gnat_temp)))
3164 = build_component_ref
3165 (build_unary_op (INDIRECT_REF, NULL_TREE,
3166 TREE_VALUE (gnu_except_ptr_stack)),
3167 get_identifier ("lang"), NULL_TREE, false);
3171 (TRUTH_ORIF_EXPR, integer_type_node,
3172 build_binary_op (EQ_EXPR, integer_type_node, gnu_comp,
3173 build_int_cst (TREE_TYPE (gnu_comp), 'V')),
3180 gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3181 gnu_choice, this_choice);
3184 return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE);
3187 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
3188 to a GCC tree, which is returned. This is the variant for ZCX. */
3191 Exception_Handler_to_gnu_zcx (Node_Id gnat_node)
3193 tree gnu_etypes_list = NULL_TREE;
3196 tree gnu_current_exc_ptr;
3197 tree gnu_incoming_exc_ptr;
3200 /* We build a TREE_LIST of nodes representing what exception types this
3201 handler can catch, with special cases for others and all others cases.
3203 Each exception type is actually identified by a pointer to the exception
3204 id, or to a dummy object for "others" and "all others".
3206 Care should be taken to ensure that the control flow impact of "others"
3207 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
3209 for (gnat_temp = First (Exception_Choices (gnat_node));
3210 gnat_temp; gnat_temp = Next (gnat_temp))
3212 if (Nkind (gnat_temp) == N_Others_Choice)
3215 = All_Others (gnat_temp) ? all_others_decl : others_decl;
3218 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3220 else if (Nkind (gnat_temp) == N_Identifier
3221 || Nkind (gnat_temp) == N_Expanded_Name)
3223 Entity_Id gnat_ex_id = Entity (gnat_temp);
3225 /* Exception may be a renaming. Recover original exception which is
3226 the one elaborated and registered. */
3227 if (Present (Renamed_Object (gnat_ex_id)))
3228 gnat_ex_id = Renamed_Object (gnat_ex_id);
3230 gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0);
3231 gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr);
3233 /* The Non_Ada_Error case for VMS exceptions is handled
3234 by the personality routine. */
3239 /* The GCC interface expects NULL to be passed for catch all handlers, so
3240 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3241 is integer_zero_node. It would not work, however, because GCC's
3242 notion of "catch all" is stronger than our notion of "others". Until
3243 we correctly use the cleanup interface as well, doing that would
3244 prevent the "all others" handlers from being seen, because nothing
3245 can be caught beyond a catch all from GCC's point of view. */
3246 gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list);
3249 start_stmt_group ();
3252 /* Expand a call to the begin_handler hook at the beginning of the handler,
3253 and arrange for a call to the end_handler hook to occur on every possible
3256 The hooks expect a pointer to the low level occurrence. This is required
3257 for our stack management scheme because a raise inside the handler pushes
3258 a new occurrence on top of the stack, which means that this top does not
3259 necessarily match the occurrence this handler was dealing with.
3261 The EXC_PTR_EXPR object references the exception occurrence being
3262 propagated. Upon handler entry, this is the exception for which the
3263 handler is triggered. This might not be the case upon handler exit,
3264 however, as we might have a new occurrence propagated by the handler's
3265 body, and the end_handler hook called as a cleanup in this context.
3267 We use a local variable to retrieve the incoming value at handler entry
3268 time, and reuse it to feed the end_handler hook's argument at exit. */
3269 gnu_current_exc_ptr = build0 (EXC_PTR_EXPR, ptr_type_node);
3270 gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE,
3271 ptr_type_node, gnu_current_exc_ptr,
3272 false, false, false, false, NULL,
3275 add_stmt_with_node (build_call_1_expr (begin_handler_decl,
3276 gnu_incoming_exc_ptr),
3278 /* ??? We don't seem to have an End_Label at hand to set the location. */
3279 add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr),
3281 add_stmt_list (Statements (gnat_node));
3284 return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list,
3288 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3291 Compilation_Unit_to_gnu (Node_Id gnat_node)
3293 /* Make the decl for the elaboration procedure. */
3294 bool body_p = (Defining_Entity (Unit (gnat_node)),
3295 Nkind (Unit (gnat_node)) == N_Package_Body
3296 || Nkind (Unit (gnat_node)) == N_Subprogram_Body);
3297 Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node));
3298 tree gnu_elab_proc_decl
3299 = create_subprog_decl
3300 (create_concat_name (gnat_unit_entity,
3301 body_p ? "elabb" : "elabs"),
3302 NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL,
3304 struct elab_info *info;
3306 push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl);
3308 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1;
3309 allocate_struct_function (gnu_elab_proc_decl, false);
3310 Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus);
3313 /* For a body, first process the spec if there is one. */
3314 if (Nkind (Unit (gnat_node)) == N_Package_Body
3315 || (Nkind (Unit (gnat_node)) == N_Subprogram_Body
3316 && !Acts_As_Spec (gnat_node)))
3318 add_stmt (gnat_to_gnu (Library_Unit (gnat_node)));
3319 finalize_from_with_types ();
3322 process_inlined_subprograms (gnat_node);
3324 if (type_annotate_only && gnat_node == Cunit (Main_Unit))
3326 elaborate_all_entities (gnat_node);
3328 if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration
3329 || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration
3330 || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration)
3334 process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty,
3336 add_stmt (gnat_to_gnu (Unit (gnat_node)));
3338 /* Process any pragmas and actions following the unit. */
3339 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node)));
3340 add_stmt_list (Actions (Aux_Decls_Node (gnat_node)));
3341 finalize_from_with_types ();
3343 /* Save away what we've made so far and record this potential elaboration
3345 info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info));
3346 set_current_block_context (gnu_elab_proc_decl);
3348 DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group ();
3349 info->next = elab_info_list;
3350 info->elab_proc = gnu_elab_proc_decl;
3351 info->gnat_node = gnat_node;
3352 elab_info_list = info;
3354 /* Generate elaboration code for this unit, if necessary, and say whether
3356 pop_stack (&gnu_elab_proc_stack);
3358 /* Invalidate the global renaming pointers. This is necessary because
3359 stabilization of the renamed entities may create SAVE_EXPRs which
3360 have been tied to a specific elaboration routine just above. */
3361 invalidate_global_renaming_pointers ();
3364 /* Return whether GNAT_NODE, an unchecked type conversion, is on the LHS
3365 of an assignment and a no-op as far as gigi is concerned. */
3368 unchecked_conversion_lhs_nop (Node_Id gnat_node)
3370 Entity_Id from_type, to_type;
3372 /* The conversion must be on the LHS of an assignment. Otherwise, even
3373 if the conversion was essentially a no-op, it could de facto ensure
3374 type consistency and this should be preserved. */
3375 if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement
3376 && Name (Parent (gnat_node)) == gnat_node))
3379 from_type = Etype (Expression (gnat_node));
3381 /* We're interested in artificial conversions generated by the front-end
3382 to make private types explicit, e.g. in Expand_Assign_Array. */
3383 if (!Is_Private_Type (from_type))
3386 from_type = Underlying_Type (from_type);
3387 to_type = Etype (gnat_node);
3389 /* The direct conversion to the underlying type is a no-op. */
3390 if (to_type == from_type)
3393 /* For an array type, the conversion to the PAT is a no-op. */
3394 if (Ekind (from_type) == E_Array_Subtype
3395 && to_type == Packed_Array_Type (from_type))
3401 /* This function is the driver of the GNAT to GCC tree transformation
3402 process. It is the entry point of the tree transformer. GNAT_NODE is the
3403 root of some GNAT tree. Return the root of the corresponding GCC tree.
3404 If this is an expression, return the GCC equivalent of the expression. If
3405 it is a statement, return the statement. In the case when called for a
3406 statement, it may also add statements to the current statement group, in
3407 which case anything it returns is to be interpreted as occurring after
3408 anything `it already added. */
3411 gnat_to_gnu (Node_Id gnat_node)
3413 bool went_into_elab_proc = false;
3414 tree gnu_result = error_mark_node; /* Default to no value. */
3415 tree gnu_result_type = void_type_node;
3417 tree gnu_lhs, gnu_rhs;
3420 /* Save node number for error message and set location information. */
3421 error_gnat_node = gnat_node;
3422 Sloc_to_locus (Sloc (gnat_node), &input_location);
3424 if (type_annotate_only
3425 && IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call))
3426 return alloc_stmt_list ();
3428 /* If this node is a non-static subexpression and we are only
3429 annotating types, make this into a NULL_EXPR. */
3430 if (type_annotate_only
3431 && IN (Nkind (gnat_node), N_Subexpr)
3432 && Nkind (gnat_node) != N_Identifier
3433 && !Compile_Time_Known_Value (gnat_node))
3434 return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)),
3435 build_call_raise (CE_Range_Check_Failed, gnat_node,
3436 N_Raise_Constraint_Error));
3438 /* If this is a Statement and we are at top level, it must be part of the
3439 elaboration procedure, so mark us as being in that procedure and push our
3442 If we are in the elaboration procedure, check if we are violating a
3443 No_Elaboration_Code restriction by having a statement there. */
3444 if ((IN (Nkind (gnat_node), N_Statement_Other_Than_Procedure_Call)
3445 && Nkind (gnat_node) != N_Null_Statement)
3446 || Nkind (gnat_node) == N_Procedure_Call_Statement
3447 || Nkind (gnat_node) == N_Label
3448 || Nkind (gnat_node) == N_Implicit_Label_Declaration
3449 || Nkind (gnat_node) == N_Handled_Sequence_Of_Statements
3450 || ((Nkind (gnat_node) == N_Raise_Constraint_Error
3451 || Nkind (gnat_node) == N_Raise_Storage_Error
3452 || Nkind (gnat_node) == N_Raise_Program_Error)
3453 && (Ekind (Etype (gnat_node)) == E_Void)))
3455 if (!current_function_decl)
3457 current_function_decl = TREE_VALUE (gnu_elab_proc_stack);
3458 start_stmt_group ();
3460 went_into_elab_proc = true;
3463 /* Don't check for a possible No_Elaboration_Code restriction violation
3464 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3465 every nested real statement instead. This also avoids triggering
3466 spurious errors on dummy (empty) sequences created by the front-end
3467 for package bodies in some cases. */
3469 if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack)
3470 && Nkind (gnat_node) != N_Handled_Sequence_Of_Statements)
3471 Check_Elaboration_Code_Allowed (gnat_node);
3474 switch (Nkind (gnat_node))
3476 /********************************/
3477 /* Chapter 2: Lexical Elements */
3478 /********************************/
3481 case N_Expanded_Name:
3482 case N_Operator_Symbol:
3483 case N_Defining_Identifier:
3484 gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type);
3487 case N_Integer_Literal:
3491 /* Get the type of the result, looking inside any padding and
3492 justified modular types. Then get the value in that type. */
3493 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
3495 if (TREE_CODE (gnu_type) == RECORD_TYPE
3496 && TYPE_JUSTIFIED_MODULAR_P (gnu_type))
3497 gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type));
3499 gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type);
3501 /* If the result overflows (meaning it doesn't fit in its base type),
3502 abort. We would like to check that the value is within the range
3503 of the subtype, but that causes problems with subtypes whose usage
3504 will raise Constraint_Error and with biased representation, so
3506 gcc_assert (!TREE_OVERFLOW (gnu_result));
3510 case N_Character_Literal:
3511 /* If a Entity is present, it means that this was one of the
3512 literals in a user-defined character type. In that case,
3513 just return the value in the CONST_DECL. Otherwise, use the
3514 character code. In that case, the base type should be an
3515 INTEGER_TYPE, but we won't bother checking for that. */
3516 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3517 if (Present (Entity (gnat_node)))
3518 gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node)));
3521 = build_int_cst_type
3522 (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node)));
3525 case N_Real_Literal:
3526 /* If this is of a fixed-point type, the value we want is the
3527 value of the corresponding integer. */
3528 if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind))
3530 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3531 gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node),
3533 gcc_assert (!TREE_OVERFLOW (gnu_result));
3536 /* We should never see a Vax_Float type literal, since the front end
3537 is supposed to transform these using appropriate conversions. */
3538 else if (Vax_Float (Underlying_Type (Etype (gnat_node))))
3543 Ureal ur_realval = Realval (gnat_node);
3545 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3547 /* If the real value is zero, so is the result. Otherwise,
3548 convert it to a machine number if it isn't already. That
3549 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3550 if (UR_Is_Zero (ur_realval))
3551 gnu_result = convert (gnu_result_type, integer_zero_node);
3554 if (!Is_Machine_Number (gnat_node))
3556 = Machine (Base_Type (Underlying_Type (Etype (gnat_node))),
3557 ur_realval, Round_Even, gnat_node);
3560 = UI_To_gnu (Numerator (ur_realval), gnu_result_type);
3562 /* If we have a base of zero, divide by the denominator.
3563 Otherwise, the base must be 2 and we scale the value, which
3564 we know can fit in the mantissa of the type (hence the use
3565 of that type above). */
3566 if (No (Rbase (ur_realval)))
3568 = build_binary_op (RDIV_EXPR,
3569 get_base_type (gnu_result_type),
3571 UI_To_gnu (Denominator (ur_realval),
3575 REAL_VALUE_TYPE tmp;
3577 gcc_assert (Rbase (ur_realval) == 2);
3578 real_ldexp (&tmp, &TREE_REAL_CST (gnu_result),
3579 - UI_To_Int (Denominator (ur_realval)));
3580 gnu_result = build_real (gnu_result_type, tmp);
3584 /* Now see if we need to negate the result. Do it this way to
3585 properly handle -0. */
3586 if (UR_Is_Negative (Realval (gnat_node)))
3588 = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type),
3594 case N_String_Literal:
3595 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3596 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR)
3598 String_Id gnat_string = Strval (gnat_node);
3599 int length = String_Length (gnat_string);
3602 if (length >= ALLOCA_THRESHOLD)
3603 string = XNEWVEC (char, length + 1);
3605 string = (char *) alloca (length + 1);
3607 /* Build the string with the characters in the literal. Note
3608 that Ada strings are 1-origin. */
3609 for (i = 0; i < length; i++)
3610 string[i] = Get_String_Char (gnat_string, i + 1);
3612 /* Put a null at the end of the string in case it's in a context
3613 where GCC will want to treat it as a C string. */
3616 gnu_result = build_string (length, string);
3618 /* Strings in GCC don't normally have types, but we want
3619 this to not be converted to the array type. */
3620 TREE_TYPE (gnu_result) = gnu_result_type;
3622 if (length >= ALLOCA_THRESHOLD)
3627 /* Build a list consisting of each character, then make
3629 String_Id gnat_string = Strval (gnat_node);
3630 int length = String_Length (gnat_string);
3632 tree gnu_list = NULL_TREE;
3633 tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3635 for (i = 0; i < length; i++)
3638 = tree_cons (gnu_idx,
3639 build_int_cst (TREE_TYPE (gnu_result_type),
3640 Get_String_Char (gnat_string,
3644 gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node,
3649 = gnat_build_constructor (gnu_result_type, nreverse (gnu_list));
3654 gnu_result = Pragma_to_gnu (gnat_node);
3657 /**************************************/
3658 /* Chapter 3: Declarations and Types */
3659 /**************************************/
3661 case N_Subtype_Declaration:
3662 case N_Full_Type_Declaration:
3663 case N_Incomplete_Type_Declaration:
3664 case N_Private_Type_Declaration:
3665 case N_Private_Extension_Declaration:
3666 case N_Task_Type_Declaration:
3667 process_type (Defining_Entity (gnat_node));
3668 gnu_result = alloc_stmt_list ();
3671 case N_Object_Declaration:
3672 case N_Exception_Declaration:
3673 gnat_temp = Defining_Entity (gnat_node);
3674 gnu_result = alloc_stmt_list ();
3676 /* If we are just annotating types and this object has an unconstrained
3677 or task type, don't elaborate it. */
3678 if (type_annotate_only
3679 && (((Is_Array_Type (Etype (gnat_temp))
3680 || Is_Record_Type (Etype (gnat_temp)))
3681 && !Is_Constrained (Etype (gnat_temp)))
3682 || Is_Concurrent_Type (Etype (gnat_temp))))
3685 if (Present (Expression (gnat_node))
3686 && !(Nkind (gnat_node) == N_Object_Declaration
3687 && No_Initialization (gnat_node))
3688 && (!type_annotate_only
3689 || Compile_Time_Known_Value (Expression (gnat_node))))
3691 gnu_expr = gnat_to_gnu (Expression (gnat_node));
3692 if (Do_Range_Check (Expression (gnat_node)))
3694 = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node);
3696 /* If this object has its elaboration delayed, we must force
3697 evaluation of GNU_EXPR right now and save it for when the object
3699 if (Present (Freeze_Node (gnat_temp)))
3701 if ((Is_Public (gnat_temp) || global_bindings_p ())
3702 && !TREE_CONSTANT (gnu_expr))
3704 = create_var_decl (create_concat_name (gnat_temp, "init"),
3705 NULL_TREE, TREE_TYPE (gnu_expr),
3706 gnu_expr, false, Is_Public (gnat_temp),
3707 false, false, NULL, gnat_temp);
3709 gnu_expr = maybe_variable (gnu_expr);
3711 save_gnu_tree (gnat_node, gnu_expr, true);
3715 gnu_expr = NULL_TREE;
3717 if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK)
3718 gnu_expr = NULL_TREE;
3720 /* If this is a deferred constant with an address clause, we ignore the
3721 full view since the clause is on the partial view and we cannot have
3722 2 different GCC trees for the object. The only bits of the full view
3723 we will use is the initializer, but it will be directly fetched. */
3724 if (Ekind(gnat_temp) == E_Constant
3725 && Present (Address_Clause (gnat_temp))
3726 && Present (Full_View (gnat_temp)))
3727 save_gnu_tree (Full_View (gnat_temp), error_mark_node, true);
3729 if (No (Freeze_Node (gnat_temp)))
3730 gnat_to_gnu_entity (gnat_temp, gnu_expr, 1);
3733 case N_Object_Renaming_Declaration:
3734 gnat_temp = Defining_Entity (gnat_node);
3736 /* Don't do anything if this renaming is handled by the front end or if
3737 we are just annotating types and this object has a composite or task
3738 type, don't elaborate it. We return the result in case it has any
3739 SAVE_EXPRs in it that need to be evaluated here. */
3740 if (!Is_Renaming_Of_Object (gnat_temp)
3741 && ! (type_annotate_only
3742 && (Is_Array_Type (Etype (gnat_temp))
3743 || Is_Record_Type (Etype (gnat_temp))
3744 || Is_Concurrent_Type (Etype (gnat_temp)))))
3746 = gnat_to_gnu_entity (gnat_temp,
3747 gnat_to_gnu (Renamed_Object (gnat_temp)), 1);
3749 gnu_result = alloc_stmt_list ();
3752 case N_Implicit_Label_Declaration:
3753 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
3754 gnu_result = alloc_stmt_list ();
3757 case N_Exception_Renaming_Declaration:
3758 case N_Number_Declaration:
3759 case N_Package_Renaming_Declaration:
3760 case N_Subprogram_Renaming_Declaration:
3761 /* These are fully handled in the front end. */
3762 gnu_result = alloc_stmt_list ();
3765 /*************************************/
3766 /* Chapter 4: Names and Expressions */
3767 /*************************************/
3769 case N_Explicit_Dereference:
3770 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3771 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3772 gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result);
3775 case N_Indexed_Component:
3777 tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node));
3781 Node_Id *gnat_expr_array;
3783 gnu_array_object = maybe_implicit_deref (gnu_array_object);
3784 gnu_array_object = maybe_unconstrained_array (gnu_array_object);
3786 /* If we got a padded type, remove it too. */
3787 if (TREE_CODE (TREE_TYPE (gnu_array_object)) == RECORD_TYPE
3788 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object)))
3790 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))),
3793 gnu_result = gnu_array_object;
3795 /* First compute the number of dimensions of the array, then
3796 fill the expression array, the order depending on whether
3797 this is a Convention_Fortran array or not. */
3798 for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object);
3799 TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE
3800 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type));
3801 ndim++, gnu_type = TREE_TYPE (gnu_type))
3804 gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id));
3806 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object)))
3807 for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node));
3809 i--, gnat_temp = Next (gnat_temp))
3810 gnat_expr_array[i] = gnat_temp;
3812 for (i = 0, gnat_temp = First (Expressions (gnat_node));
3814 i++, gnat_temp = Next (gnat_temp))
3815 gnat_expr_array[i] = gnat_temp;
3817 for (i = 0, gnu_type = TREE_TYPE (gnu_array_object);
3818 i < ndim; i++, gnu_type = TREE_TYPE (gnu_type))
3820 gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE);
3821 gnat_temp = gnat_expr_array[i];
3822 gnu_expr = gnat_to_gnu (gnat_temp);
3824 if (Do_Range_Check (gnat_temp))
3827 (gnu_array_object, gnu_expr,
3828 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3829 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))),
3832 gnu_result = build_binary_op (ARRAY_REF, NULL_TREE,
3833 gnu_result, gnu_expr);
3837 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3843 Node_Id gnat_range_node = Discrete_Range (gnat_node);
3845 gnu_result = gnat_to_gnu (Prefix (gnat_node));
3846 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3848 /* Do any implicit dereferences of the prefix and do any needed
3850 gnu_result = maybe_implicit_deref (gnu_result);
3851 gnu_result = maybe_unconstrained_array (gnu_result);
3852 gnu_type = TREE_TYPE (gnu_result);
3853 if (Do_Range_Check (gnat_range_node))
3855 /* Get the bounds of the slice. */
3857 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type));
3858 tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type);
3859 tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type);
3860 /* Get the permitted bounds. */
3861 tree gnu_base_index_type
3862 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type));
3863 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3864 (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result);
3865 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
3866 (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result);
3867 tree gnu_expr_l, gnu_expr_h, gnu_expr_type;
3869 gnu_min_expr = protect_multiple_eval (gnu_min_expr);
3870 gnu_max_expr = protect_multiple_eval (gnu_max_expr);
3872 /* Derive a good type to convert everything to. */
3873 gnu_expr_type = get_base_type (gnu_index_type);
3875 /* Test whether the minimum slice value is too small. */
3876 gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node,
3877 convert (gnu_expr_type,
3879 convert (gnu_expr_type,
3880 gnu_base_min_expr));
3882 /* Test whether the maximum slice value is too large. */
3883 gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node,
3884 convert (gnu_expr_type,
3886 convert (gnu_expr_type,
3887 gnu_base_max_expr));
3889 /* Build a slice index check that returns the low bound,
3890 assuming the slice is not empty. */
3891 gnu_expr = emit_check
3892 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
3893 gnu_expr_l, gnu_expr_h),
3894 gnu_min_expr, CE_Index_Check_Failed, gnat_node);
3896 /* Build a conditional expression that does the index checks and
3897 returns the low bound if the slice is not empty (max >= min),
3898 and returns the naked low bound otherwise (max < min), unless
3899 it is non-constant and the high bound is; this prevents VRP
3900 from inferring bogus ranges on the unlikely path. */
3901 gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type,
3902 build_binary_op (GE_EXPR, gnu_expr_type,
3903 convert (gnu_expr_type,
3905 convert (gnu_expr_type,
3908 TREE_CODE (gnu_min_expr) != INTEGER_CST
3909 && TREE_CODE (gnu_max_expr) == INTEGER_CST
3910 ? gnu_max_expr : gnu_min_expr);
3913 /* Simply return the naked low bound. */
3914 gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type));
3916 gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type,
3917 gnu_result, gnu_expr);
3921 case N_Selected_Component:
3923 tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node));
3924 Entity_Id gnat_field = Entity (Selector_Name (gnat_node));
3925 Entity_Id gnat_pref_type = Etype (Prefix (gnat_node));
3928 while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)
3929 || IN (Ekind (gnat_pref_type), Access_Kind))
3931 if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind))
3932 gnat_pref_type = Underlying_Type (gnat_pref_type);
3933 else if (IN (Ekind (gnat_pref_type), Access_Kind))
3934 gnat_pref_type = Designated_Type (gnat_pref_type);
3937 gnu_prefix = maybe_implicit_deref (gnu_prefix);
3939 /* For discriminant references in tagged types always substitute the
3940 corresponding discriminant as the actual selected component. */
3941 if (Is_Tagged_Type (gnat_pref_type))
3942 while (Present (Corresponding_Discriminant (gnat_field)))
3943 gnat_field = Corresponding_Discriminant (gnat_field);
3945 /* For discriminant references of untagged types always substitute the
3946 corresponding stored discriminant. */
3947 else if (Present (Corresponding_Discriminant (gnat_field)))
3948 gnat_field = Original_Record_Component (gnat_field);
3950 /* Handle extracting the real or imaginary part of a complex.
3951 The real part is the first field and the imaginary the last. */
3952 if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE)
3953 gnu_result = build_unary_op (Present (Next_Entity (gnat_field))
3954 ? REALPART_EXPR : IMAGPART_EXPR,
3955 NULL_TREE, gnu_prefix);
3958 gnu_field = gnat_to_gnu_field_decl (gnat_field);
3960 /* If there are discriminants, the prefix might be evaluated more
3961 than once, which is a problem if it has side-effects. */
3962 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node)))
3963 ? Designated_Type (Etype
3964 (Prefix (gnat_node)))
3965 : Etype (Prefix (gnat_node))))
3966 gnu_prefix = gnat_stabilize_reference (gnu_prefix, false);
3969 = build_component_ref (gnu_prefix, NULL_TREE, gnu_field,
3970 (Nkind (Parent (gnat_node))
3971 == N_Attribute_Reference));
3974 gcc_assert (gnu_result);
3975 gnu_result_type = get_unpadded_type (Etype (gnat_node));
3979 case N_Attribute_Reference:
3981 /* The attribute designator (like an enumeration value). */
3982 int attribute = Get_Attribute_Id (Attribute_Name (gnat_node));
3984 /* The Elab_Spec and Elab_Body attributes are special in that
3985 Prefix is a unit, not an object with a GCC equivalent. Similarly
3986 for Elaborated, since that variable isn't otherwise known. */
3987 if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec)
3988 return (create_subprog_decl
3989 (create_concat_name (Entity (Prefix (gnat_node)),
3990 attribute == Attr_Elab_Body
3991 ? "elabb" : "elabs"),
3992 NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL,
3995 gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute);
4000 /* Like 'Access as far as we are concerned. */
4001 gnu_result = gnat_to_gnu (Prefix (gnat_node));
4002 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4003 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4007 case N_Extension_Aggregate:
4011 /* ??? It is wrong to evaluate the type now, but there doesn't
4012 seem to be any other practical way of doing it. */
4014 gcc_assert (!Expansion_Delayed (gnat_node));
4016 gnu_aggr_type = gnu_result_type
4017 = get_unpadded_type (Etype (gnat_node));
4019 if (TREE_CODE (gnu_result_type) == RECORD_TYPE
4020 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type))
4022 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type)));
4024 if (Null_Record_Present (gnat_node))
4025 gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE);
4027 else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE
4028 || TREE_CODE (gnu_aggr_type) == UNION_TYPE)
4030 = assoc_to_constructor (Etype (gnat_node),
4031 First (Component_Associations (gnat_node)),
4033 else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE)
4034 gnu_result = pos_to_constructor (First (Expressions (gnat_node)),
4036 Component_Type (Etype (gnat_node)));
4037 else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE)
4040 (COMPLEX_EXPR, gnu_aggr_type,
4041 gnat_to_gnu (Expression (First
4042 (Component_Associations (gnat_node)))),
4043 gnat_to_gnu (Expression
4045 (First (Component_Associations (gnat_node))))));
4049 gnu_result = convert (gnu_result_type, gnu_result);
4054 if (TARGET_VTABLE_USES_DESCRIPTORS
4055 && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type
4056 && Is_Dispatch_Table_Entity (Etype (gnat_node)))
4057 gnu_result = null_fdesc_node;
4059 gnu_result = null_pointer_node;
4060 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4063 case N_Type_Conversion:
4064 case N_Qualified_Expression:
4065 /* Get the operand expression. */
4066 gnu_result = gnat_to_gnu (Expression (gnat_node));
4067 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4070 = convert_with_check (Etype (gnat_node), gnu_result,
4071 Do_Overflow_Check (gnat_node),
4072 Do_Range_Check (Expression (gnat_node)),
4073 Nkind (gnat_node) == N_Type_Conversion
4074 && Float_Truncate (gnat_node), gnat_node);
4077 case N_Unchecked_Type_Conversion:
4078 gnu_result = gnat_to_gnu (Expression (gnat_node));
4080 /* Skip further processing if the conversion is deemed a no-op. */
4081 if (unchecked_conversion_lhs_nop (gnat_node))
4083 gnu_result_type = TREE_TYPE (gnu_result);
4087 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4089 /* If the result is a pointer type, see if we are improperly
4090 converting to a stricter alignment. */
4091 if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type)
4092 && IN (Ekind (Etype (gnat_node)), Access_Kind))
4094 unsigned int align = known_alignment (gnu_result);
4095 tree gnu_obj_type = TREE_TYPE (gnu_result_type);
4096 unsigned int oalign = TYPE_ALIGN (gnu_obj_type);
4098 if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type))
4099 post_error_ne_tree_2
4100 ("?source alignment (^) '< alignment of & (^)",
4101 gnat_node, Designated_Type (Etype (gnat_node)),
4102 size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT);
4105 /* If we are converting a descriptor to a function pointer, first
4106 build the pointer. */
4107 if (TARGET_VTABLE_USES_DESCRIPTORS
4108 && TREE_TYPE (gnu_result) == fdesc_type_node
4109 && POINTER_TYPE_P (gnu_result_type))
4110 gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result);
4112 gnu_result = unchecked_convert (gnu_result_type, gnu_result,
4113 No_Truncation (gnat_node));
4119 tree gnu_object = gnat_to_gnu (Left_Opnd (gnat_node));
4120 Node_Id gnat_range = Right_Opnd (gnat_node);
4124 /* GNAT_RANGE is either an N_Range node or an identifier
4125 denoting a subtype. */
4126 if (Nkind (gnat_range) == N_Range)
4128 gnu_low = gnat_to_gnu (Low_Bound (gnat_range));
4129 gnu_high = gnat_to_gnu (High_Bound (gnat_range));
4131 else if (Nkind (gnat_range) == N_Identifier
4132 || Nkind (gnat_range) == N_Expanded_Name)
4134 tree gnu_range_type = get_unpadded_type (Entity (gnat_range));
4136 gnu_low = TYPE_MIN_VALUE (gnu_range_type);
4137 gnu_high = TYPE_MAX_VALUE (gnu_range_type);
4142 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4144 /* If LOW and HIGH are identical, perform an equality test.
4145 Otherwise, ensure that GNU_OBJECT is only evaluated once
4146 and perform a full range test. */
4147 if (operand_equal_p (gnu_low, gnu_high, 0))
4148 gnu_result = build_binary_op (EQ_EXPR, gnu_result_type,
4149 gnu_object, gnu_low);
4152 gnu_object = protect_multiple_eval (gnu_object);
4154 = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type,
4155 build_binary_op (GE_EXPR, gnu_result_type,
4156 gnu_object, gnu_low),
4157 build_binary_op (LE_EXPR, gnu_result_type,
4158 gnu_object, gnu_high));
4161 if (Nkind (gnat_node) == N_Not_In)
4162 gnu_result = invert_truthvalue (gnu_result);
4167 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4168 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4169 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4170 gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type)
4172 : (Rounded_Result (gnat_node)
4173 ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR),
4174 gnu_result_type, gnu_lhs, gnu_rhs);
4177 case N_Op_Or: case N_Op_And: case N_Op_Xor:
4178 /* These can either be operations on booleans or on modular types.
4179 Fall through for boolean types since that's the way GNU_CODES is
4181 if (IN (Ekind (Underlying_Type (Etype (gnat_node))),
4182 Modular_Integer_Kind))
4185 = (Nkind (gnat_node) == N_Op_Or ? BIT_IOR_EXPR
4186 : Nkind (gnat_node) == N_Op_And ? BIT_AND_EXPR
4189 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4190 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4191 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4192 gnu_result = build_binary_op (code, gnu_result_type,
4197 /* ... fall through ... */
4199 case N_Op_Eq: case N_Op_Ne: case N_Op_Lt:
4200 case N_Op_Le: case N_Op_Gt: case N_Op_Ge:
4201 case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply:
4202 case N_Op_Mod: case N_Op_Rem:
4203 case N_Op_Rotate_Left:
4204 case N_Op_Rotate_Right:
4205 case N_Op_Shift_Left:
4206 case N_Op_Shift_Right:
4207 case N_Op_Shift_Right_Arithmetic:
4208 case N_And_Then: case N_Or_Else:
4210 enum tree_code code = gnu_codes[Nkind (gnat_node)];
4211 bool ignore_lhs_overflow = false;
4214 gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node));
4215 gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node));
4216 gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node));
4218 /* If this is a comparison operator, convert any references to
4219 an unconstrained array value into a reference to the
4221 if (TREE_CODE_CLASS (code) == tcc_comparison)
4223 gnu_lhs = maybe_unconstrained_array (gnu_lhs);
4224 gnu_rhs = maybe_unconstrained_array (gnu_rhs);
4227 /* If the result type is a private type, its full view may be a
4228 numeric subtype. The representation we need is that of its base
4229 type, given that it is the result of an arithmetic operation. */
4230 else if (Is_Private_Type (Etype (gnat_node)))
4231 gnu_type = gnu_result_type
4232 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node))));
4234 /* If this is a shift whose count is not guaranteed to be correct,
4235 we need to adjust the shift count. */
4236 if (IN (Nkind (gnat_node), N_Op_Shift)
4237 && !Shift_Count_OK (gnat_node))
4239 tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs));
4241 = convert (gnu_count_type, TYPE_SIZE (gnu_type));
4243 if (Nkind (gnat_node) == N_Op_Rotate_Left
4244 || Nkind (gnat_node) == N_Op_Rotate_Right)
4245 gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type,
4246 gnu_rhs, gnu_max_shift);
4247 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic)
4250 (MIN_EXPR, gnu_count_type,
4251 build_binary_op (MINUS_EXPR,
4254 convert (gnu_count_type,
4259 /* For right shifts, the type says what kind of shift to do,
4260 so we may need to choose a different type. In this case,
4261 we have to ignore integer overflow lest it propagates all
4262 the way down and causes a CE to be explicitly raised. */
4263 if (Nkind (gnat_node) == N_Op_Shift_Right
4264 && !TYPE_UNSIGNED (gnu_type))
4266 gnu_type = gnat_unsigned_type (gnu_type);
4267 ignore_lhs_overflow = true;
4269 else if (Nkind (gnat_node) == N_Op_Shift_Right_Arithmetic
4270 && TYPE_UNSIGNED (gnu_type))
4272 gnu_type = gnat_signed_type (gnu_type);
4273 ignore_lhs_overflow = true;
4276 if (gnu_type != gnu_result_type)
4278 tree gnu_old_lhs = gnu_lhs;
4279 gnu_lhs = convert (gnu_type, gnu_lhs);
4280 if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow)
4281 TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs);
4282 gnu_rhs = convert (gnu_type, gnu_rhs);
4285 /* Instead of expanding overflow checks for addition, subtraction
4286 and multiplication itself, the front end will leave this to
4287 the back end when Backend_Overflow_Checks_On_Target is set.
4288 As the GCC back end itself does not know yet how to properly
4289 do overflow checking, do it here. The goal is to push
4290 the expansions further into the back end over time. */
4291 if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target
4292 && (Nkind (gnat_node) == N_Op_Add
4293 || Nkind (gnat_node) == N_Op_Subtract
4294 || Nkind (gnat_node) == N_Op_Multiply)
4295 && !TYPE_UNSIGNED (gnu_type)
4296 && !FLOAT_TYPE_P (gnu_type))
4297 gnu_result = build_binary_op_trapv (code, gnu_type,
4298 gnu_lhs, gnu_rhs, gnat_node);
4300 gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs);
4302 /* If this is a logical shift with the shift count not verified,
4303 we must return zero if it is too large. We cannot compensate
4304 above in this case. */
4305 if ((Nkind (gnat_node) == N_Op_Shift_Left
4306 || Nkind (gnat_node) == N_Op_Shift_Right)
4307 && !Shift_Count_OK (gnat_node))
4311 build_binary_op (GE_EXPR, integer_type_node,
4313 convert (TREE_TYPE (gnu_rhs),
4314 TYPE_SIZE (gnu_type))),
4315 convert (gnu_type, integer_zero_node),
4320 case N_Conditional_Expression:
4322 tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node)));
4323 tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node))));
4325 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node)))));
4327 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4328 gnu_result = build_cond_expr (gnu_result_type,
4329 gnat_truthvalue_conversion (gnu_cond),
4330 gnu_true, gnu_false);
4335 gnu_result = gnat_to_gnu (Right_Opnd (gnat_node));
4336 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4340 /* This case can apply to a boolean or a modular type.
4341 Fall through for a boolean operand since GNU_CODES is set
4342 up to handle this. */
4343 if (Is_Modular_Integer_Type (Etype (gnat_node))
4344 || (Ekind (Etype (gnat_node)) == E_Private_Type
4345 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node)))))
4347 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4348 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4349 gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type,
4354 /* ... fall through ... */
4356 case N_Op_Minus: case N_Op_Abs:
4357 gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node));
4359 if (Ekind (Etype (gnat_node)) != E_Private_Type)
4360 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4362 gnu_result_type = get_unpadded_type (Base_Type
4363 (Full_View (Etype (gnat_node))));
4365 if (Do_Overflow_Check (gnat_node)
4366 && !TYPE_UNSIGNED (gnu_result_type)
4367 && !FLOAT_TYPE_P (gnu_result_type))
4369 = build_unary_op_trapv (gnu_codes[Nkind (gnat_node)],
4370 gnu_result_type, gnu_expr, gnat_node);
4372 gnu_result = build_unary_op (gnu_codes[Nkind (gnat_node)],
4373 gnu_result_type, gnu_expr);
4380 bool ignore_init_type = false;
4382 gnat_temp = Expression (gnat_node);
4384 /* The Expression operand can either be an N_Identifier or
4385 Expanded_Name, which must represent a type, or a
4386 N_Qualified_Expression, which contains both the object type and an
4387 initial value for the object. */
4388 if (Nkind (gnat_temp) == N_Identifier
4389 || Nkind (gnat_temp) == N_Expanded_Name)
4390 gnu_type = gnat_to_gnu_type (Entity (gnat_temp));
4391 else if (Nkind (gnat_temp) == N_Qualified_Expression)
4393 Entity_Id gnat_desig_type
4394 = Designated_Type (Underlying_Type (Etype (gnat_node)));
4396 ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type);
4397 gnu_init = gnat_to_gnu (Expression (gnat_temp));
4399 gnu_init = maybe_unconstrained_array (gnu_init);
4400 if (Do_Range_Check (Expression (gnat_temp)))
4402 = emit_range_check (gnu_init, gnat_desig_type, gnat_temp);
4404 if (Is_Elementary_Type (gnat_desig_type)
4405 || Is_Constrained (gnat_desig_type))
4407 gnu_type = gnat_to_gnu_type (gnat_desig_type);
4408 gnu_init = convert (gnu_type, gnu_init);
4412 gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp)));
4413 if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE)
4414 gnu_type = TREE_TYPE (gnu_init);
4416 gnu_init = convert (gnu_type, gnu_init);
4422 gnu_result_type = get_unpadded_type (Etype (gnat_node));
4423 return build_allocator (gnu_type, gnu_init, gnu_result_type,
4424 Procedure_To_Call (gnat_node),
4425 Storage_Pool (gnat_node), gnat_node,
4430 /**************************/
4431 /* Chapter 5: Statements */
4432 /**************************/
4435 gnu_result = build1 (LABEL_EXPR, void_type_node,
4436 gnat_to_gnu (Identifier (gnat_node)));
4439 case N_Null_Statement:
4440 gnu_result = alloc_stmt_list ();
4443 case N_Assignment_Statement:
4444 /* Get the LHS and RHS of the statement and convert any reference to an
4445 unconstrained array into a reference to the underlying array.
4446 If we are not to do range checking and the RHS is an N_Function_Call,
4447 pass the LHS to the call function. */
4448 gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node)));
4450 /* If the type has a size that overflows, convert this into raise of
4451 Storage_Error: execution shouldn't have gotten here anyway. */
4452 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST
4453 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))))
4454 gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node,
4455 N_Raise_Storage_Error);
4456 else if (Nkind (Expression (gnat_node)) == N_Function_Call
4457 && !Do_Range_Check (Expression (gnat_node)))
4458 gnu_result = call_to_gnu (Expression (gnat_node),
4459 &gnu_result_type, gnu_lhs);
4463 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node)));
4465 /* If range check is needed, emit code to generate it. */
4466 if (Do_Range_Check (Expression (gnat_node)))
4467 gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)),
4471 = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs);
4473 /* If the type being assigned is an array type and the two sides
4474 are not completely disjoint, play safe and use memmove. */
4475 if (TREE_CODE (gnu_result) == MODIFY_EXPR
4476 && Is_Array_Type (Etype (Name (gnat_node)))
4477 && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node)))
4479 tree to, from, size, to_ptr, from_ptr, t;
4481 to = TREE_OPERAND (gnu_result, 0);
4482 from = TREE_OPERAND (gnu_result, 1);
4484 size = TYPE_SIZE_UNIT (TREE_TYPE (from));
4485 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from);
4487 to_ptr = build_fold_addr_expr (to);
4488 from_ptr = build_fold_addr_expr (from);
4490 t = implicit_built_in_decls[BUILT_IN_MEMMOVE];
4491 gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size);
4496 case N_If_Statement:
4498 tree *gnu_else_ptr; /* Point to put next "else if" or "else". */
4500 /* Make the outer COND_EXPR. Avoid non-determinism. */
4501 gnu_result = build3 (COND_EXPR, void_type_node,
4502 gnat_to_gnu (Condition (gnat_node)),
4503 NULL_TREE, NULL_TREE);
4504 COND_EXPR_THEN (gnu_result)
4505 = build_stmt_group (Then_Statements (gnat_node), false);
4506 TREE_SIDE_EFFECTS (gnu_result) = 1;
4507 gnu_else_ptr = &COND_EXPR_ELSE (gnu_result);
4509 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4510 into the previous "else" part and point to where to put any
4511 outer "else". Also avoid non-determinism. */
4512 if (Present (Elsif_Parts (gnat_node)))
4513 for (gnat_temp = First (Elsif_Parts (gnat_node));
4514 Present (gnat_temp); gnat_temp = Next (gnat_temp))
4516 gnu_expr = build3 (COND_EXPR, void_type_node,
4517 gnat_to_gnu (Condition (gnat_temp)),
4518 NULL_TREE, NULL_TREE);
4519 COND_EXPR_THEN (gnu_expr)
4520 = build_stmt_group (Then_Statements (gnat_temp), false);
4521 TREE_SIDE_EFFECTS (gnu_expr) = 1;
4522 set_expr_location_from_node (gnu_expr, gnat_temp);
4523 *gnu_else_ptr = gnu_expr;
4524 gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr);
4527 *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false);
4531 case N_Case_Statement:
4532 gnu_result = Case_Statement_to_gnu (gnat_node);
4535 case N_Loop_Statement:
4536 gnu_result = Loop_Statement_to_gnu (gnat_node);
4539 case N_Block_Statement:
4540 start_stmt_group ();
4542 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4543 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4545 gnu_result = end_stmt_group ();
4547 if (Present (Identifier (gnat_node)))
4548 mark_out_of_scope (Entity (Identifier (gnat_node)));
4551 case N_Exit_Statement:
4553 = build2 (EXIT_STMT, void_type_node,
4554 (Present (Condition (gnat_node))
4555 ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE),
4556 (Present (Name (gnat_node))
4557 ? get_gnu_tree (Entity (Name (gnat_node)))
4558 : TREE_VALUE (gnu_loop_label_stack)));
4561 case N_Return_Statement:
4563 /* The gnu function type of the subprogram currently processed. */
4564 tree gnu_subprog_type = TREE_TYPE (current_function_decl);
4565 /* The return value from the subprogram. */
4566 tree gnu_ret_val = NULL_TREE;
4567 /* The place to put the return value. */
4570 /* If we are dealing with a "return;" from an Ada procedure with
4571 parameters passed by copy in copy out, we need to return a record
4572 containing the final values of these parameters. If the list
4573 contains only one entry, return just that entry.
4575 For a full description of the copy in copy out parameter mechanism,
4576 see the part of the gnat_to_gnu_entity routine dealing with the
4577 translation of subprograms.
4579 But if we have a return label defined, convert this into
4580 a branch to that label. */
4582 if (TREE_VALUE (gnu_return_label_stack))
4584 gnu_result = build1 (GOTO_EXPR, void_type_node,
4585 TREE_VALUE (gnu_return_label_stack));
4589 else if (TYPE_CI_CO_LIST (gnu_subprog_type))
4591 gnu_lhs = DECL_RESULT (current_function_decl);
4592 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type)) == 1)
4593 gnu_ret_val = TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type));
4596 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type),
4597 TYPE_CI_CO_LIST (gnu_subprog_type));
4600 /* If the Ada subprogram is a function, we just need to return the
4601 expression. If the subprogram returns an unconstrained
4602 array, we have to allocate a new version of the result and
4603 return it. If we return by reference, return a pointer. */
4605 else if (Present (Expression (gnat_node)))
4607 /* If the current function returns by target pointer and we
4608 are doing a call, pass that target to the call. */
4609 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type)
4610 && Nkind (Expression (gnat_node)) == N_Function_Call)
4613 = build_unary_op (INDIRECT_REF, NULL_TREE,
4614 DECL_ARGUMENTS (current_function_decl));
4615 gnu_result = call_to_gnu (Expression (gnat_node),
4616 &gnu_result_type, gnu_lhs);
4620 gnu_ret_val = gnat_to_gnu (Expression (gnat_node));
4622 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4623 /* The original return type was unconstrained so dereference
4624 the TARGET pointer in the actual return value's type. */
4626 = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val),
4627 DECL_ARGUMENTS (current_function_decl));
4629 gnu_lhs = DECL_RESULT (current_function_decl);
4631 /* Do not remove the padding from GNU_RET_VAL if the inner
4632 type is self-referential since we want to allocate the fixed
4633 size in that case. */
4634 if (TREE_CODE (gnu_ret_val) == COMPONENT_REF
4635 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0)))
4637 && (TYPE_IS_PADDING_P
4638 (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))))
4639 && (CONTAINS_PLACEHOLDER_P
4640 (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))))
4641 gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0);
4643 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type)
4644 || By_Ref (gnat_node))
4646 = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val);
4648 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type))
4650 gnu_ret_val = maybe_unconstrained_array (gnu_ret_val);
4652 = build_allocator (TREE_TYPE (gnu_ret_val),
4654 TREE_TYPE (gnu_subprog_type),
4655 Procedure_To_Call (gnat_node),
4656 Storage_Pool (gnat_node),
4662 /* If the Ada subprogram is a regular procedure, just return. */
4663 gnu_lhs = NULL_TREE;
4665 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type))
4668 gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE,
4669 gnu_lhs, gnu_ret_val);
4670 add_stmt_with_node (gnu_result, gnat_node);
4671 gnu_lhs = NULL_TREE;
4674 gnu_result = build_return_expr (gnu_lhs, gnu_ret_val);
4678 case N_Goto_Statement:
4679 gnu_result = build1 (GOTO_EXPR, void_type_node,
4680 gnat_to_gnu (Name (gnat_node)));
4683 /***************************/
4684 /* Chapter 6: Subprograms */
4685 /***************************/
4687 case N_Subprogram_Declaration:
4688 /* Unless there is a freeze node, declare the subprogram. We consider
4689 this a "definition" even though we're not generating code for
4690 the subprogram because we will be making the corresponding GCC
4693 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node)))))
4694 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)),
4696 gnu_result = alloc_stmt_list ();
4699 case N_Abstract_Subprogram_Declaration:
4700 /* This subprogram doesn't exist for code generation purposes, but we
4701 have to elaborate the types of any parameters and result, unless
4702 they are imported types (nothing to generate in this case). */
4704 /* Process the parameter types first. */
4707 = First_Formal_With_Extras
4708 (Defining_Entity (Specification (gnat_node)));
4709 Present (gnat_temp);
4710 gnat_temp = Next_Formal_With_Extras (gnat_temp))
4711 if (Is_Itype (Etype (gnat_temp))
4712 && !From_With_Type (Etype (gnat_temp)))
4713 gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0);
4716 /* Then the result type, set to Standard_Void_Type for procedures. */
4719 Entity_Id gnat_temp_type
4720 = Etype (Defining_Entity (Specification (gnat_node)));
4722 if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type))
4723 gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0);
4726 gnu_result = alloc_stmt_list ();
4729 case N_Defining_Program_Unit_Name:
4730 /* For a child unit identifier go up a level to get the specification.
4731 We get this when we try to find the spec of a child unit package
4732 that is the compilation unit being compiled. */
4733 gnu_result = gnat_to_gnu (Parent (gnat_node));
4736 case N_Subprogram_Body:
4737 Subprogram_Body_to_gnu (gnat_node);
4738 gnu_result = alloc_stmt_list ();
4741 case N_Function_Call:
4742 case N_Procedure_Call_Statement:
4743 gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE);
4746 /************************/
4747 /* Chapter 7: Packages */
4748 /************************/
4750 case N_Package_Declaration:
4751 gnu_result = gnat_to_gnu (Specification (gnat_node));
4754 case N_Package_Specification:
4756 start_stmt_group ();
4757 process_decls (Visible_Declarations (gnat_node),
4758 Private_Declarations (gnat_node), Empty, true, true);
4759 gnu_result = end_stmt_group ();
4762 case N_Package_Body:
4764 /* If this is the body of a generic package - do nothing. */
4765 if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package)
4767 gnu_result = alloc_stmt_list ();
4771 start_stmt_group ();
4772 process_decls (Declarations (gnat_node), Empty, Empty, true, true);
4774 if (Present (Handled_Statement_Sequence (gnat_node)))
4775 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node)));
4777 gnu_result = end_stmt_group ();
4780 /********************************/
4781 /* Chapter 8: Visibility Rules */
4782 /********************************/
4784 case N_Use_Package_Clause:
4785 case N_Use_Type_Clause:
4786 /* Nothing to do here - but these may appear in list of declarations. */
4787 gnu_result = alloc_stmt_list ();
4790 /*********************/
4791 /* Chapter 9: Tasks */
4792 /*********************/
4794 case N_Protected_Type_Declaration:
4795 gnu_result = alloc_stmt_list ();
4798 case N_Single_Task_Declaration:
4799 gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1);
4800 gnu_result = alloc_stmt_list ();
4803 /*********************************************************/
4804 /* Chapter 10: Program Structure and Compilation Issues */
4805 /*********************************************************/
4807 case N_Compilation_Unit:
4809 /* This is not called for the main unit, which is handled in function
4811 start_stmt_group ();
4814 Compilation_Unit_to_gnu (gnat_node);
4815 gnu_result = alloc_stmt_list ();
4818 case N_Subprogram_Body_Stub:
4819 case N_Package_Body_Stub:
4820 case N_Protected_Body_Stub:
4821 case N_Task_Body_Stub:
4822 /* Simply process whatever unit is being inserted. */
4823 gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node)));
4827 gnu_result = gnat_to_gnu (Proper_Body (gnat_node));
4830 /***************************/
4831 /* Chapter 11: Exceptions */
4832 /***************************/
4834 case N_Handled_Sequence_Of_Statements:
4835 /* If there is an At_End procedure attached to this node, and the EH
4836 mechanism is SJLJ, we must have at least a corresponding At_End
4837 handler, unless the No_Exception_Handlers restriction is set. */
4838 gcc_assert (type_annotate_only
4839 || Exception_Mechanism != Setjmp_Longjmp
4840 || No (At_End_Proc (gnat_node))
4841 || Present (Exception_Handlers (gnat_node))
4842 || No_Exception_Handlers_Set ());
4844 gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node);
4847 case N_Exception_Handler:
4848 if (Exception_Mechanism == Setjmp_Longjmp)
4849 gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node);
4850 else if (Exception_Mechanism == Back_End_Exceptions)
4851 gnu_result = Exception_Handler_to_gnu_zcx (gnat_node);
4857 case N_Push_Constraint_Error_Label:
4858 push_exception_label_stack (&gnu_constraint_error_label_stack,
4859 Exception_Label (gnat_node));
4862 case N_Push_Storage_Error_Label:
4863 push_exception_label_stack (&gnu_storage_error_label_stack,
4864 Exception_Label (gnat_node));
4867 case N_Push_Program_Error_Label:
4868 push_exception_label_stack (&gnu_program_error_label_stack,
4869 Exception_Label (gnat_node));
4872 case N_Pop_Constraint_Error_Label:
4873 gnu_constraint_error_label_stack
4874 = TREE_CHAIN (gnu_constraint_error_label_stack);
4877 case N_Pop_Storage_Error_Label:
4878 gnu_storage_error_label_stack
4879 = TREE_CHAIN (gnu_storage_error_label_stack);
4882 case N_Pop_Program_Error_Label:
4883 gnu_program_error_label_stack
4884 = TREE_CHAIN (gnu_program_error_label_stack);
4887 /******************************/
4888 /* Chapter 12: Generic Units */
4889 /******************************/
4891 case N_Generic_Function_Renaming_Declaration:
4892 case N_Generic_Package_Renaming_Declaration:
4893 case N_Generic_Procedure_Renaming_Declaration:
4894 case N_Generic_Package_Declaration:
4895 case N_Generic_Subprogram_Declaration:
4896 case N_Package_Instantiation:
4897 case N_Procedure_Instantiation:
4898 case N_Function_Instantiation:
4899 /* These nodes can appear on a declaration list but there is nothing to
4900 to be done with them. */
4901 gnu_result = alloc_stmt_list ();
4904 /**************************************************/
4905 /* Chapter 13: Representation Clauses and */
4906 /* Implementation-Dependent Features */
4907 /**************************************************/
4909 case N_Attribute_Definition_Clause:
4910 gnu_result = alloc_stmt_list ();
4912 /* The only one we need to deal with is 'Address since, for the others,
4913 the front-end puts the information elsewhere. */
4914 if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address)
4917 /* And we only deal with 'Address if the object has a Freeze node. */
4918 gnat_temp = Entity (Name (gnat_node));
4919 if (No (Freeze_Node (gnat_temp)))
4922 /* Get the value to use as the address and save it as the equivalent
4923 for the object. When it is frozen, gnat_to_gnu_entity will do the
4925 save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true);
4928 case N_Enumeration_Representation_Clause:
4929 case N_Record_Representation_Clause:
4931 /* We do nothing with these. SEM puts the information elsewhere. */
4932 gnu_result = alloc_stmt_list ();
4935 case N_Code_Statement:
4936 if (!type_annotate_only)
4938 tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node));
4939 tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE;
4940 tree gnu_clobbers = NULL_TREE, tail;
4941 bool allows_mem, allows_reg, fake;
4942 int ninputs, noutputs, i;
4943 const char **oconstraints;
4944 const char *constraint;
4947 /* First retrieve the 3 operand lists built by the front-end. */
4948 Setup_Asm_Outputs (gnat_node);
4949 while (Present (gnat_temp = Asm_Output_Variable ()))
4951 tree gnu_value = gnat_to_gnu (gnat_temp);
4952 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4953 (Asm_Output_Constraint ()));
4955 gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs);
4959 Setup_Asm_Inputs (gnat_node);
4960 while (Present (gnat_temp = Asm_Input_Value ()))
4962 tree gnu_value = gnat_to_gnu (gnat_temp);
4963 tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu
4964 (Asm_Input_Constraint ()));
4966 gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs);
4970 Clobber_Setup (gnat_node);
4971 while ((clobber = Clobber_Get_Next ()))
4973 = tree_cons (NULL_TREE,
4974 build_string (strlen (clobber) + 1, clobber),
4977 /* Then perform some standard checking and processing on the
4978 operands. In particular, mark them addressable if needed. */
4979 gnu_outputs = nreverse (gnu_outputs);
4980 noutputs = list_length (gnu_outputs);
4981 gnu_inputs = nreverse (gnu_inputs);
4982 ninputs = list_length (gnu_inputs);
4984 = (const char **) alloca (noutputs * sizeof (const char *));
4986 for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail))
4988 tree output = TREE_VALUE (tail);
4990 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
4991 oconstraints[i] = constraint;
4993 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
4994 &allows_mem, &allows_reg, &fake))
4996 /* If the operand is going to end up in memory,
4997 mark it addressable. Note that we don't test
4998 allows_mem like in the input case below; this
4999 is modelled on the C front-end. */
5001 && !gnat_mark_addressable (output))
5002 output = error_mark_node;
5005 output = error_mark_node;
5007 TREE_VALUE (tail) = output;
5010 for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail))
5012 tree input = TREE_VALUE (tail);
5014 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
5016 if (parse_input_constraint (&constraint, i, ninputs, noutputs,
5018 &allows_mem, &allows_reg))
5020 /* If the operand is going to end up in memory,
5021 mark it addressable. */
5022 if (!allows_reg && allows_mem
5023 && !gnat_mark_addressable (input))
5024 input = error_mark_node;
5027 input = error_mark_node;
5029 TREE_VALUE (tail) = input;
5032 gnu_result = build4 (ASM_EXPR, void_type_node,
5033 gnu_template, gnu_outputs,
5034 gnu_inputs, gnu_clobbers);
5035 ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node);
5038 gnu_result = alloc_stmt_list ();
5046 case N_Freeze_Entity:
5047 start_stmt_group ();
5048 process_freeze_entity (gnat_node);
5049 process_decls (Actions (gnat_node), Empty, Empty, true, true);
5050 gnu_result = end_stmt_group ();
5053 case N_Itype_Reference:
5054 if (!present_gnu_tree (Itype (gnat_node)))
5055 process_type (Itype (gnat_node));
5057 gnu_result = alloc_stmt_list ();
5060 case N_Free_Statement:
5061 if (!type_annotate_only)
5063 tree gnu_ptr = gnat_to_gnu (Expression (gnat_node));
5064 tree gnu_ptr_type = TREE_TYPE (gnu_ptr);
5066 tree gnu_actual_obj_type = 0;
5069 unsigned int default_allocator_alignment
5070 = get_target_default_allocator_alignment () * BITS_PER_UNIT;
5072 /* If this is a thin pointer, we must dereference it to create
5073 a fat pointer, then go back below to a thin pointer. The
5074 reason for this is that we need a fat pointer someplace in
5075 order to properly compute the size. */
5076 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr)))
5077 gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE,
5078 build_unary_op (INDIRECT_REF, NULL_TREE,
5081 /* If this is an unconstrained array, we know the object must
5082 have been allocated with the template in front of the object.
5083 So pass the template address, but get the total size. Do this
5084 by converting to a thin pointer. */
5085 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr)))
5087 = convert (build_pointer_type
5088 (TYPE_OBJECT_RECORD_TYPE
5089 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))),
5092 gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr));
5094 if (Present (Actual_Designated_Subtype (gnat_node)))
5097 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node));
5099 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5101 = build_unc_object_type_from_ptr (gnu_ptr_type,
5102 gnu_actual_obj_type,
5103 get_identifier ("DEALLOC"));
5106 gnu_actual_obj_type = gnu_obj_type;
5108 gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type);
5109 align = TYPE_ALIGN (gnu_obj_type);
5111 if (TREE_CODE (gnu_obj_type) == RECORD_TYPE
5112 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type))
5114 tree gnu_char_ptr_type = build_pointer_type (char_type_node);
5115 tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type));
5116 tree gnu_byte_offset
5117 = convert (sizetype,
5118 size_diffop (size_zero_node, gnu_pos));
5119 gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset);
5121 gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr);
5122 gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type,
5123 gnu_ptr, gnu_byte_offset);
5126 /* If the object was allocated from the default storage pool, the
5127 alignment was greater than what the allocator provides, and this
5128 is not a fat or thin pointer, what we have in gnu_ptr here is an
5129 address dynamically adjusted to match the alignment requirement
5130 (see build_allocator). What we need to pass to free is the
5131 initial allocator's return value, which has been stored just in
5132 front of the block we have. */
5134 if (No (Procedure_To_Call (gnat_node))
5135 && align > default_allocator_alignment
5136 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type))
5139 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
5143 = (void *)GNU_PTR - (void *)sizeof (void *)) */
5146 (POINTER_PLUS_EXPR, ptr_void_type_node,
5147 convert (ptr_void_type_node, gnu_ptr),
5148 size_int (-POINTER_SIZE/BITS_PER_UNIT));
5150 /* GNU_PTR (void *) = *(void **)GNU_PTR */
5153 (INDIRECT_REF, NULL_TREE,
5154 convert (build_pointer_type (ptr_void_type_node),
5158 gnu_result = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, align,
5159 Procedure_To_Call (gnat_node),
5160 Storage_Pool (gnat_node),
5165 case N_Raise_Constraint_Error:
5166 case N_Raise_Program_Error:
5167 case N_Raise_Storage_Error:
5168 if (type_annotate_only)
5170 gnu_result = alloc_stmt_list ();
5174 gnu_result_type = get_unpadded_type (Etype (gnat_node));
5176 = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node,
5179 /* If the type is VOID, this is a statement, so we need to
5180 generate the code for the call. Handle a Condition, if there
5182 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5184 set_expr_location_from_node (gnu_result, gnat_node);
5186 if (Present (Condition (gnat_node)))
5187 gnu_result = build3 (COND_EXPR, void_type_node,
5188 gnat_to_gnu (Condition (gnat_node)),
5189 gnu_result, alloc_stmt_list ());
5192 gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result);
5195 case N_Validate_Unchecked_Conversion:
5197 Entity_Id gnat_target_type = Target_Type (gnat_node);
5198 tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node));
5199 tree gnu_target_type = gnat_to_gnu_type (gnat_target_type);
5201 /* No need for any warning in this case. */
5202 if (!flag_strict_aliasing)
5205 /* If the result is a pointer type, see if we are either converting
5206 from a non-pointer or from a pointer to a type with a different
5207 alias set and warn if so. If the result is defined in the same
5208 unit as this unchecked conversion, we can allow this because we
5209 can know to make the pointer type behave properly. */
5210 else if (POINTER_TYPE_P (gnu_target_type)
5211 && !In_Same_Source_Unit (gnat_target_type, gnat_node)
5212 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type)))
5214 tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type)
5215 ? TREE_TYPE (gnu_source_type)
5217 tree gnu_target_desig_type = TREE_TYPE (gnu_target_type);
5219 if ((TYPE_DUMMY_P (gnu_target_desig_type)
5220 || get_alias_set (gnu_target_desig_type) != 0)
5221 && (!POINTER_TYPE_P (gnu_source_type)
5222 || (TYPE_DUMMY_P (gnu_source_desig_type)
5223 != TYPE_DUMMY_P (gnu_target_desig_type))
5224 || (TYPE_DUMMY_P (gnu_source_desig_type)
5225 && gnu_source_desig_type != gnu_target_desig_type)
5226 || !alias_sets_conflict_p
5227 (get_alias_set (gnu_source_desig_type),
5228 get_alias_set (gnu_target_desig_type))))
5231 ("?possible aliasing problem for type&",
5232 gnat_node, Target_Type (gnat_node));
5234 ("\\?use -fno-strict-aliasing switch for references",
5237 ("\\?or use `pragma No_Strict_Aliasing (&);`",
5238 gnat_node, Target_Type (gnat_node));
5242 /* But if the result is a fat pointer type, we have no mechanism to
5243 do that, so we unconditionally warn in problematic cases. */
5244 else if (TYPE_FAT_POINTER_P (gnu_target_type))
5246 tree gnu_source_array_type
5247 = TYPE_FAT_POINTER_P (gnu_source_type)
5248 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type)))
5250 tree gnu_target_array_type
5251 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type)));
5253 if ((TYPE_DUMMY_P (gnu_target_array_type)
5254 || get_alias_set (gnu_target_array_type) != 0)
5255 && (!TYPE_FAT_POINTER_P (gnu_source_type)
5256 || (TYPE_DUMMY_P (gnu_source_array_type)
5257 != TYPE_DUMMY_P (gnu_target_array_type))
5258 || (TYPE_DUMMY_P (gnu_source_array_type)
5259 && gnu_source_array_type != gnu_target_array_type)
5260 || !alias_sets_conflict_p
5261 (get_alias_set (gnu_source_array_type),
5262 get_alias_set (gnu_target_array_type))))
5265 ("?possible aliasing problem for type&",
5266 gnat_node, Target_Type (gnat_node));
5268 ("\\?use -fno-strict-aliasing switch for references",
5273 gnu_result = alloc_stmt_list ();
5276 case N_Raise_Statement:
5277 case N_Function_Specification:
5278 case N_Procedure_Specification:
5280 case N_Component_Association:
5283 gcc_assert (type_annotate_only);
5284 gnu_result = alloc_stmt_list ();
5287 /* If we pushed our level as part of processing the elaboration routine,
5289 if (went_into_elab_proc)
5291 add_stmt (gnu_result);
5293 gnu_result = end_stmt_group ();
5294 current_function_decl = NULL_TREE;
5297 /* Set the location information on the result if it is a real expression.
5298 References can be reused for multiple GNAT nodes and they would get
5299 the location information of their last use. Note that we may have
5300 no result if we tried to build a CALL_EXPR node to a procedure with
5301 no side-effects and optimization is enabled. */
5303 && EXPR_P (gnu_result)
5304 && TREE_CODE (gnu_result) != NOP_EXPR
5305 && !REFERENCE_CLASS_P (gnu_result)
5306 && !EXPR_HAS_LOCATION (gnu_result))
5307 set_expr_location_from_node (gnu_result, gnat_node);
5309 /* If we're supposed to return something of void_type, it means we have
5310 something we're elaborating for effect, so just return. */
5311 if (TREE_CODE (gnu_result_type) == VOID_TYPE)
5314 /* If the result is a constant that overflowed, raise Constraint_Error. */
5315 if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result))
5317 post_error ("Constraint_Error will be raised at run-time?", gnat_node);
5319 = build1 (NULL_EXPR, gnu_result_type,
5320 build_call_raise (CE_Overflow_Check_Failed, gnat_node,
5321 N_Raise_Constraint_Error));
5324 /* If our result has side-effects and is of an unconstrained type,
5325 make a SAVE_EXPR so that we can be sure it will only be referenced
5326 once. Note we must do this before any conversions. */
5327 if (TREE_SIDE_EFFECTS (gnu_result)
5328 && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE
5329 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))))
5330 gnu_result = gnat_stabilize_reference (gnu_result, false);
5332 /* Now convert the result to the result type, unless we are in one of the
5335 1. If this is the Name of an assignment statement or a parameter of
5336 a procedure call, return the result almost unmodified since the
5337 RHS will have to be converted to our type in that case, unless
5338 the result type has a simpler size. Likewise if there is just
5339 a no-op unchecked conversion in-between. Similarly, don't convert
5340 integral types that are the operands of an unchecked conversion
5341 since we need to ignore those conversions (for 'Valid).
5343 2. If we have a label (which doesn't have any well-defined type), a
5344 field or an error, return the result almost unmodified. Also don't
5345 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5346 its size since those are the cases where the front end may have the
5347 type wrong due to "instantiating" the unconstrained record with
5348 discriminant values. Similarly, if the two types are record types
5349 with the same name don't convert. This will be the case when we are
5350 converting from a packable version of a type to its original type and
5351 we need those conversions to be NOPs in order for assignments into
5352 these types to work properly.
5354 3. If the type is void or if we have no result, return error_mark_node
5355 to show we have no result.
5357 4. Finally, if the type of the result is already correct. */
5359 if (Present (Parent (gnat_node))
5360 && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement
5361 && Name (Parent (gnat_node)) == gnat_node)
5362 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5363 && unchecked_conversion_lhs_nop (Parent (gnat_node)))
5364 || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement
5365 && Name (Parent (gnat_node)) != gnat_node)
5366 || Nkind (Parent (gnat_node)) == N_Parameter_Association
5367 || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion
5368 && !AGGREGATE_TYPE_P (gnu_result_type)
5369 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))))
5370 && !(TYPE_SIZE (gnu_result_type)
5371 && TYPE_SIZE (TREE_TYPE (gnu_result))
5372 && (AGGREGATE_TYPE_P (gnu_result_type)
5373 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))
5374 && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST
5375 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result)))
5377 || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5378 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))
5379 && (CONTAINS_PLACEHOLDER_P
5380 (TYPE_SIZE (TREE_TYPE (gnu_result))))))
5381 && !(TREE_CODE (gnu_result_type) == RECORD_TYPE
5382 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type))))
5384 /* Remove padding only if the inner object is of self-referential
5385 size: in that case it must be an object of unconstrained type
5386 with a default discriminant and we want to avoid copying too
5388 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5389 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))
5390 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5391 (TREE_TYPE (gnu_result))))))
5392 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5396 else if (TREE_CODE (gnu_result) == LABEL_DECL
5397 || TREE_CODE (gnu_result) == FIELD_DECL
5398 || TREE_CODE (gnu_result) == ERROR_MARK
5399 || (TYPE_SIZE (gnu_result_type)
5400 && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST
5401 && TREE_CODE (gnu_result) != INDIRECT_REF
5402 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))
5403 || ((TYPE_NAME (gnu_result_type)
5404 == TYPE_NAME (TREE_TYPE (gnu_result)))
5405 && TREE_CODE (gnu_result_type) == RECORD_TYPE
5406 && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE))
5408 /* Remove any padding. */
5409 if (TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE
5410 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)))
5411 gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))),
5415 else if (gnu_result == error_mark_node || gnu_result_type == void_type_node)
5416 gnu_result = error_mark_node;
5418 else if (gnu_result_type != TREE_TYPE (gnu_result))
5419 gnu_result = convert (gnu_result_type, gnu_result);
5421 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5422 while ((TREE_CODE (gnu_result) == NOP_EXPR
5423 || TREE_CODE (gnu_result) == NON_LVALUE_EXPR)
5424 && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result))
5425 gnu_result = TREE_OPERAND (gnu_result, 0);
5430 /* Subroutine of above to push the exception label stack. GNU_STACK is
5431 a pointer to the stack to update and GNAT_LABEL, if present, is the
5432 label to push onto the stack. */
5435 push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label)
5437 tree gnu_label = (Present (gnat_label)
5438 ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0)
5441 *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack);
5444 /* Record the current code position in GNAT_NODE. */
5447 record_code_position (Node_Id gnat_node)
5449 tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE);
5451 add_stmt_with_node (stmt_stmt, gnat_node);
5452 save_gnu_tree (gnat_node, stmt_stmt, true);
5455 /* Insert the code for GNAT_NODE at the position saved for that node. */
5458 insert_code_for (Node_Id gnat_node)
5460 STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node);
5461 save_gnu_tree (gnat_node, NULL_TREE, true);
5464 /* Start a new statement group chained to the previous group. */
5467 start_stmt_group (void)
5469 struct stmt_group *group = stmt_group_free_list;
5471 /* First see if we can get one from the free list. */
5473 stmt_group_free_list = group->previous;
5475 group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group));
5477 group->previous = current_stmt_group;
5478 group->stmt_list = group->block = group->cleanups = NULL_TREE;
5479 current_stmt_group = group;
5482 /* Add GNU_STMT to the current statement group. */
5485 add_stmt (tree gnu_stmt)
5487 append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list);
5490 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5493 add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node)
5495 if (Present (gnat_node))
5496 set_expr_location_from_node (gnu_stmt, gnat_node);
5497 add_stmt (gnu_stmt);
5500 /* Add a declaration statement for GNU_DECL to the current statement group.
5501 Get SLOC from Entity_Id. */
5504 add_decl_expr (tree gnu_decl, Entity_Id gnat_entity)
5506 tree type = TREE_TYPE (gnu_decl);
5507 tree gnu_stmt, gnu_init, t;
5509 /* If this is a variable that Gigi is to ignore, we may have been given
5510 an ERROR_MARK. So test for it. We also might have been given a
5511 reference for a renaming. So only do something for a decl. Also
5512 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5513 if (!DECL_P (gnu_decl)
5514 || (TREE_CODE (gnu_decl) == TYPE_DECL
5515 && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE))
5518 gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl);
5520 /* If we are global, we don't want to actually output the DECL_EXPR for
5521 this decl since we already have evaluated the expressions in the
5522 sizes and positions as globals and doing it again would be wrong. */
5523 if (global_bindings_p ())
5525 /* Mark everything as used to prevent node sharing with subprograms.
5526 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5527 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5528 mark_visited (&gnu_stmt);
5529 if (TREE_CODE (gnu_decl) == VAR_DECL
5530 || TREE_CODE (gnu_decl) == CONST_DECL)
5532 mark_visited (&DECL_SIZE (gnu_decl));
5533 mark_visited (&DECL_SIZE_UNIT (gnu_decl));
5534 mark_visited (&DECL_INITIAL (gnu_decl));
5536 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5537 if (TREE_CODE (gnu_decl) == TYPE_DECL
5538 && (TREE_CODE (type) == RECORD_TYPE
5539 || TREE_CODE (type) == UNION_TYPE
5540 || TREE_CODE (type) == QUAL_UNION_TYPE)
5541 && (t = TYPE_ADA_SIZE (type)))
5545 add_stmt_with_node (gnu_stmt, gnat_entity);
5547 /* If this is a variable and an initializer is attached to it, it must be
5548 valid for the context. Similar to init_const in create_var_decl_1. */
5549 if (TREE_CODE (gnu_decl) == VAR_DECL
5550 && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE
5551 && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init))
5552 || (TREE_STATIC (gnu_decl)
5553 && !initializer_constant_valid_p (gnu_init,
5554 TREE_TYPE (gnu_init)))))
5556 /* If GNU_DECL has a padded type, convert it to the unpadded
5557 type so the assignment is done properly. */
5558 if (TREE_CODE (type) == RECORD_TYPE && TYPE_IS_PADDING_P (type))
5559 t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl);
5563 gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, t, gnu_init);
5565 DECL_INITIAL (gnu_decl) = NULL_TREE;
5566 if (TREE_READONLY (gnu_decl))
5568 TREE_READONLY (gnu_decl) = 0;
5569 DECL_READONLY_ONCE_ELAB (gnu_decl) = 1;
5572 add_stmt_with_node (gnu_stmt, gnat_entity);
5576 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5579 mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5581 if (TREE_VISITED (*tp))
5584 /* Don't mark a dummy type as visited because we want to mark its sizes
5585 and fields once it's filled in. */
5586 else if (!TYPE_IS_DUMMY_P (*tp))
5587 TREE_VISITED (*tp) = 1;
5590 TYPE_SIZES_GIMPLIFIED (*tp) = 1;
5595 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5598 unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
5599 void *data ATTRIBUTE_UNUSED)
5603 if (TREE_CODE (t) == SAVE_EXPR)
5604 TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0));
5609 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5610 sized gimplified. We use this to indicate all variable sizes and
5611 positions in global types may not be shared by any subprogram. */
5614 mark_visited (tree *tp)
5616 walk_tree (tp, mark_visited_r, NULL, NULL);
5619 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5620 set its location to that of GNAT_NODE if present. */
5623 add_cleanup (tree gnu_cleanup, Node_Id gnat_node)
5625 if (Present (gnat_node))
5626 set_expr_location_from_node (gnu_cleanup, gnat_node);
5627 append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups);
5630 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5633 set_block_for_group (tree gnu_block)
5635 gcc_assert (!current_stmt_group->block);
5636 current_stmt_group->block = gnu_block;
5639 /* Return code corresponding to the current code group. It is normally
5640 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5641 BLOCK or cleanups were set. */
5644 end_stmt_group (void)
5646 struct stmt_group *group = current_stmt_group;
5647 tree gnu_retval = group->stmt_list;
5649 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5650 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5651 make a BIND_EXPR. Note that we nest in that because the cleanup may
5652 reference variables in the block. */
5653 if (gnu_retval == NULL_TREE)
5654 gnu_retval = alloc_stmt_list ();
5656 if (group->cleanups)
5657 gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval,
5660 if (current_stmt_group->block)
5661 gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block),
5662 gnu_retval, group->block);
5664 /* Remove this group from the stack and add it to the free list. */
5665 current_stmt_group = group->previous;
5666 group->previous = stmt_group_free_list;
5667 stmt_group_free_list = group;
5672 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5676 add_stmt_list (List_Id gnat_list)
5680 if (Present (gnat_list))
5681 for (gnat_node = First (gnat_list); Present (gnat_node);
5682 gnat_node = Next (gnat_node))
5683 add_stmt (gnat_to_gnu (gnat_node));
5686 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5687 If BINDING_P is true, push and pop a binding level around the list. */
5690 build_stmt_group (List_Id gnat_list, bool binding_p)
5692 start_stmt_group ();
5696 add_stmt_list (gnat_list);
5700 return end_stmt_group ();
5703 /* Push and pop routines for stacks. We keep a free list around so we
5704 don't waste tree nodes. */
5707 push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value)
5709 tree gnu_node = gnu_stack_free_list;
5713 gnu_stack_free_list = TREE_CHAIN (gnu_node);
5714 TREE_CHAIN (gnu_node) = *gnu_stack_ptr;
5715 TREE_PURPOSE (gnu_node) = gnu_purpose;
5716 TREE_VALUE (gnu_node) = gnu_value;
5719 gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr);
5721 *gnu_stack_ptr = gnu_node;
5725 pop_stack (tree *gnu_stack_ptr)
5727 tree gnu_node = *gnu_stack_ptr;
5729 *gnu_stack_ptr = TREE_CHAIN (gnu_node);
5730 TREE_CHAIN (gnu_node) = gnu_stack_free_list;
5731 gnu_stack_free_list = gnu_node;
5734 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5737 gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p,
5738 gimple_seq *post_p ATTRIBUTE_UNUSED)
5740 tree expr = *expr_p;
5743 if (IS_ADA_STMT (expr))
5744 return gnat_gimplify_stmt (expr_p);
5746 switch (TREE_CODE (expr))
5749 /* If this is for a scalar, just make a VAR_DECL for it. If for
5750 an aggregate, get a null pointer of the appropriate type and
5752 if (AGGREGATE_TYPE_P (TREE_TYPE (expr)))
5753 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr),
5754 convert (build_pointer_type (TREE_TYPE (expr)),
5755 integer_zero_node));
5758 *expr_p = create_tmp_var (TREE_TYPE (expr), NULL);
5759 TREE_NO_WARNING (*expr_p) = 1;
5762 gimplify_and_add (TREE_OPERAND (expr, 0), pre_p);
5765 case UNCONSTRAINED_ARRAY_REF:
5766 /* We should only do this if we are just elaborating for side-effects,
5767 but we can't know that yet. */
5768 *expr_p = TREE_OPERAND (*expr_p, 0);
5772 op = TREE_OPERAND (expr, 0);
5774 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5775 be put into static memory. We know it's going to be readonly given
5776 the semantics we have and it's required to be static memory in
5777 the case when the reference is in an elaboration procedure. */
5778 if (TREE_CODE (op) == CONSTRUCTOR && TREE_CONSTANT (op))
5780 tree new_var = create_tmp_var (TREE_TYPE (op), "C");
5782 TREE_READONLY (new_var) = 1;
5783 TREE_STATIC (new_var) = 1;
5784 TREE_ADDRESSABLE (new_var) = 1;
5785 DECL_INITIAL (new_var) = op;
5787 TREE_OPERAND (expr, 0) = new_var;
5788 recompute_tree_invariant_for_addr_expr (expr);
5792 /* If we are taking the address of a SAVE_EXPR, we are typically
5793 processing a misaligned argument to be passed by reference in a
5794 procedure call. We just mark the operand as addressable + not
5795 readonly here and let the common gimplifier code perform the
5796 temporary creation, initialization, and "instantiation" in place of
5797 the SAVE_EXPR in further operands, in particular in the copy back
5798 code inserted after the call. */
5799 else if (TREE_CODE (op) == SAVE_EXPR)
5801 TREE_ADDRESSABLE (op) = 1;
5802 TREE_READONLY (op) = 0;
5805 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5806 address of the selected operand when it is addressable. Besides, we
5807 also expect addressable_p to only let COND_EXPRs where both arms are
5808 addressable reach here. */
5809 else if (TREE_CODE (op) == COND_EXPR)
5812 /* Otherwise, if we are taking the address of something that is neither
5813 reference, declaration, or constant, make a variable for the operand
5814 here and then take its address. If we don't do it this way, we may
5815 confuse the gimplifier because it needs to know the variable is
5816 addressable at this point. This duplicates code in
5817 internal_get_tmp_var, which is unfortunate. */
5818 else if (TREE_CODE_CLASS (TREE_CODE (op)) != tcc_reference
5819 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_declaration
5820 && TREE_CODE_CLASS (TREE_CODE (op)) != tcc_constant)
5822 tree new_var = create_tmp_var (TREE_TYPE (op), "A");
5825 TREE_ADDRESSABLE (new_var) = 1;
5827 stmt = gimplify_assign (new_var, op, pre_p);
5828 if (EXPR_HAS_LOCATION (op))
5829 gimple_set_location (stmt, *EXPR_LOCUS (op));
5831 TREE_OPERAND (expr, 0) = new_var;
5832 recompute_tree_invariant_for_addr_expr (expr);
5836 /* ... fall through ... */
5839 return GS_UNHANDLED;
5843 /* Generate GIMPLE in place for the statement at *STMT_P. */
5845 static enum gimplify_status
5846 gnat_gimplify_stmt (tree *stmt_p)
5848 tree stmt = *stmt_p;
5850 switch (TREE_CODE (stmt))
5853 *stmt_p = STMT_STMT_STMT (stmt);
5858 tree gnu_start_label = create_artificial_label ();
5859 tree gnu_end_label = LOOP_STMT_LABEL (stmt);
5862 /* Set to emit the statements of the loop. */
5863 *stmt_p = NULL_TREE;
5865 /* We first emit the start label and then a conditional jump to
5866 the end label if there's a top condition, then the body of the
5867 loop, then a conditional branch to the end label, then the update,
5868 if any, and finally a jump to the start label and the definition
5869 of the end label. */
5870 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5874 if (LOOP_STMT_TOP_COND (stmt))
5875 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5876 LOOP_STMT_TOP_COND (stmt),
5883 append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p);
5885 if (LOOP_STMT_BOT_COND (stmt))
5886 append_to_statement_list (build3 (COND_EXPR, void_type_node,
5887 LOOP_STMT_BOT_COND (stmt),
5894 if (LOOP_STMT_UPDATE (stmt))
5895 append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p);
5897 t = build1 (GOTO_EXPR, void_type_node, gnu_start_label);
5898 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label));
5899 append_to_statement_list (t, stmt_p);
5901 append_to_statement_list (build1 (LABEL_EXPR, void_type_node,
5908 /* Build a statement to jump to the corresponding end label, then
5909 see if it needs to be conditional. */
5910 *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt));
5911 if (EXIT_STMT_COND (stmt))
5912 *stmt_p = build3 (COND_EXPR, void_type_node,
5913 EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ());
5921 /* Force references to each of the entities in packages withed by GNAT_NODE.
5922 Operate recursively but check that we aren't elaborating something more
5925 This routine is exclusively called in type_annotate mode, to compute DDA
5926 information for types in withed units, for ASIS use. */
5929 elaborate_all_entities (Node_Id gnat_node)
5931 Entity_Id gnat_with_clause, gnat_entity;
5933 /* Process each unit only once. As we trace the context of all relevant
5934 units transitively, including generic bodies, we may encounter the
5935 same generic unit repeatedly. */
5936 if (!present_gnu_tree (gnat_node))
5937 save_gnu_tree (gnat_node, integer_zero_node, true);
5939 /* Save entities in all context units. A body may have an implicit_with
5940 on its own spec, if the context includes a child unit, so don't save
5942 for (gnat_with_clause = First (Context_Items (gnat_node));
5943 Present (gnat_with_clause);
5944 gnat_with_clause = Next (gnat_with_clause))
5945 if (Nkind (gnat_with_clause) == N_With_Clause
5946 && !present_gnu_tree (Library_Unit (gnat_with_clause))
5947 && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit)))
5949 elaborate_all_entities (Library_Unit (gnat_with_clause));
5951 if (Ekind (Entity (Name (gnat_with_clause))) == E_Package)
5953 for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause)));
5954 Present (gnat_entity);
5955 gnat_entity = Next_Entity (gnat_entity))
5956 if (Is_Public (gnat_entity)
5957 && Convention (gnat_entity) != Convention_Intrinsic
5958 && Ekind (gnat_entity) != E_Package
5959 && Ekind (gnat_entity) != E_Package_Body
5960 && Ekind (gnat_entity) != E_Operator
5961 && !(IN (Ekind (gnat_entity), Type_Kind)
5962 && !Is_Frozen (gnat_entity))
5963 && !((Ekind (gnat_entity) == E_Procedure
5964 || Ekind (gnat_entity) == E_Function)
5965 && Is_Intrinsic_Subprogram (gnat_entity))
5966 && !IN (Ekind (gnat_entity), Named_Kind)
5967 && !IN (Ekind (gnat_entity), Generic_Unit_Kind))
5968 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
5970 else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package)
5973 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause)));
5975 /* Retrieve compilation unit node of generic body. */
5976 while (Present (gnat_body)
5977 && Nkind (gnat_body) != N_Compilation_Unit)
5978 gnat_body = Parent (gnat_body);
5980 /* If body is available, elaborate its context. */
5981 if (Present (gnat_body))
5982 elaborate_all_entities (gnat_body);
5986 if (Nkind (Unit (gnat_node)) == N_Package_Body)
5987 elaborate_all_entities (Library_Unit (gnat_node));
5990 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5993 process_freeze_entity (Node_Id gnat_node)
5995 Entity_Id gnat_entity = Entity (gnat_node);
5999 = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration
6000 && present_gnu_tree (Declaration_Node (gnat_entity)))
6001 ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE;
6003 /* If this is a package, need to generate code for the package. */
6004 if (Ekind (gnat_entity) == E_Package)
6007 (Parent (Corresponding_Body
6008 (Parent (Declaration_Node (gnat_entity)))));
6012 /* Check for old definition after the above call. This Freeze_Node
6013 might be for one its Itypes. */
6015 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6017 /* If this entity has an Address representation clause, GNU_OLD is the
6018 address, so discard it here. */
6019 if (Present (Address_Clause (gnat_entity)))
6022 /* Don't do anything for class-wide types they are always
6023 transformed into their root type. */
6024 if (Ekind (gnat_entity) == E_Class_Wide_Type
6025 || (Ekind (gnat_entity) == E_Class_Wide_Subtype
6026 && Present (Equivalent_Type (gnat_entity))))
6029 /* Don't do anything for subprograms that may have been elaborated before
6030 their freeze nodes. This can happen, for example because of an inner call
6031 in an instance body, or a previous compilation of a spec for inlining
6034 && ((TREE_CODE (gnu_old) == FUNCTION_DECL
6035 && (Ekind (gnat_entity) == E_Function
6036 || Ekind (gnat_entity) == E_Procedure))
6038 && TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE
6039 && Ekind (gnat_entity) == E_Subprogram_Type)))
6042 /* If we have a non-dummy type old tree, we have nothing to do, except
6043 aborting if this is the public view of a private type whose full view was
6044 not delayed, as this node was never delayed as it should have been. We
6045 let this happen for concurrent types and their Corresponding_Record_Type,
6046 however, because each might legitimately be elaborated before it's own
6047 freeze node, e.g. while processing the other. */
6049 && !(TREE_CODE (gnu_old) == TYPE_DECL
6050 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))))
6052 gcc_assert ((IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6053 && Present (Full_View (gnat_entity))
6054 && No (Freeze_Node (Full_View (gnat_entity))))
6055 || Is_Concurrent_Type (gnat_entity)
6056 || (IN (Ekind (gnat_entity), Record_Kind)
6057 && Is_Concurrent_Record_Type (gnat_entity)));
6061 /* Reset the saved tree, if any, and elaborate the object or type for real.
6062 If there is a full declaration, elaborate it and copy the type to
6063 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
6064 a class wide type or subtype. */
6067 save_gnu_tree (gnat_entity, NULL_TREE, false);
6068 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6069 && Present (Full_View (gnat_entity))
6070 && present_gnu_tree (Full_View (gnat_entity)))
6071 save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false);
6072 if (Present (Class_Wide_Type (gnat_entity))
6073 && Class_Wide_Type (gnat_entity) != gnat_entity)
6074 save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false);
6077 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6078 && Present (Full_View (gnat_entity)))
6080 gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1);
6082 /* Propagate back-annotations from full view to partial view. */
6083 if (Unknown_Alignment (gnat_entity))
6084 Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity)));
6086 if (Unknown_Esize (gnat_entity))
6087 Set_Esize (gnat_entity, Esize (Full_View (gnat_entity)));
6089 if (Unknown_RM_Size (gnat_entity))
6090 Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity)));
6092 /* The above call may have defined this entity (the simplest example
6093 of this is when we have a private enumeral type since the bounds
6094 will have the public view. */
6095 if (!present_gnu_tree (gnat_entity))
6096 save_gnu_tree (gnat_entity, gnu_new, false);
6097 if (Present (Class_Wide_Type (gnat_entity))
6098 && Class_Wide_Type (gnat_entity) != gnat_entity)
6099 save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false);
6102 gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1);
6104 /* If we've made any pointers to the old version of this type, we
6105 have to update them. */
6107 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
6108 TREE_TYPE (gnu_new));
6111 /* Process the list of inlined subprograms of GNAT_NODE, which is an
6112 N_Compilation_Unit. */
6115 process_inlined_subprograms (Node_Id gnat_node)
6117 Entity_Id gnat_entity;
6120 /* If we can inline, generate Gimple for all the inlined subprograms.
6121 Define the entity first so we set DECL_EXTERNAL. */
6123 for (gnat_entity = First_Inlined_Subprogram (gnat_node);
6124 Present (gnat_entity);
6125 gnat_entity = Next_Inlined_Subprogram (gnat_entity))
6127 gnat_body = Parent (Declaration_Node (gnat_entity));
6129 if (Nkind (gnat_body) != N_Subprogram_Body)
6131 /* ??? This really should always be Present. */
6132 if (No (Corresponding_Body (gnat_body)))
6136 = Parent (Declaration_Node (Corresponding_Body (gnat_body)));
6139 if (Present (gnat_body))
6141 gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0);
6142 add_stmt (gnat_to_gnu (gnat_body));
6147 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
6148 We make two passes, one to elaborate anything other than bodies (but
6149 we declare a function if there was no spec). The second pass
6150 elaborates the bodies.
6152 GNAT_END_LIST gives the element in the list past the end. Normally,
6153 this is Empty, but can be First_Real_Statement for a
6154 Handled_Sequence_Of_Statements.
6156 We make a complete pass through both lists if PASS1P is true, then make
6157 the second pass over both lists if PASS2P is true. The lists usually
6158 correspond to the public and private parts of a package. */
6161 process_decls (List_Id gnat_decls, List_Id gnat_decls2,
6162 Node_Id gnat_end_list, bool pass1p, bool pass2p)
6164 List_Id gnat_decl_array[2];
6168 gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2;
6171 for (i = 0; i <= 1; i++)
6172 if (Present (gnat_decl_array[i]))
6173 for (gnat_decl = First (gnat_decl_array[i]);
6174 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6176 /* For package specs, we recurse inside the declarations,
6177 thus taking the two pass approach inside the boundary. */
6178 if (Nkind (gnat_decl) == N_Package_Declaration
6179 && (Nkind (Specification (gnat_decl)
6180 == N_Package_Specification)))
6181 process_decls (Visible_Declarations (Specification (gnat_decl)),
6182 Private_Declarations (Specification (gnat_decl)),
6183 Empty, true, false);
6185 /* Similarly for any declarations in the actions of a
6187 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6189 process_freeze_entity (gnat_decl);
6190 process_decls (Actions (gnat_decl), Empty, Empty, true, false);
6193 /* Package bodies with freeze nodes get their elaboration deferred
6194 until the freeze node, but the code must be placed in the right
6195 place, so record the code position now. */
6196 else if (Nkind (gnat_decl) == N_Package_Body
6197 && Present (Freeze_Node (Corresponding_Spec (gnat_decl))))
6198 record_code_position (gnat_decl);
6200 else if (Nkind (gnat_decl) == N_Package_Body_Stub
6201 && Present (Library_Unit (gnat_decl))
6202 && Present (Freeze_Node
6205 (Library_Unit (gnat_decl)))))))
6206 record_code_position
6207 (Proper_Body (Unit (Library_Unit (gnat_decl))));
6209 /* We defer most subprogram bodies to the second pass. */
6210 else if (Nkind (gnat_decl) == N_Subprogram_Body)
6212 if (Acts_As_Spec (gnat_decl))
6214 Node_Id gnat_subprog_id = Defining_Entity (gnat_decl);
6216 if (Ekind (gnat_subprog_id) != E_Generic_Procedure
6217 && Ekind (gnat_subprog_id) != E_Generic_Function)
6218 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6222 /* For bodies and stubs that act as their own specs, the entity
6223 itself must be elaborated in the first pass, because it may
6224 be used in other declarations. */
6225 else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub)
6227 Node_Id gnat_subprog_id
6228 = Defining_Entity (Specification (gnat_decl));
6230 if (Ekind (gnat_subprog_id) != E_Subprogram_Body
6231 && Ekind (gnat_subprog_id) != E_Generic_Procedure
6232 && Ekind (gnat_subprog_id) != E_Generic_Function)
6233 gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1);
6236 /* Concurrent stubs stand for the corresponding subprogram bodies,
6237 which are deferred like other bodies. */
6238 else if (Nkind (gnat_decl) == N_Task_Body_Stub
6239 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6243 add_stmt (gnat_to_gnu (gnat_decl));
6246 /* Here we elaborate everything we deferred above except for package bodies,
6247 which are elaborated at their freeze nodes. Note that we must also
6248 go inside things (package specs and freeze nodes) the first pass did. */
6250 for (i = 0; i <= 1; i++)
6251 if (Present (gnat_decl_array[i]))
6252 for (gnat_decl = First (gnat_decl_array[i]);
6253 gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl))
6255 if (Nkind (gnat_decl) == N_Subprogram_Body
6256 || Nkind (gnat_decl) == N_Subprogram_Body_Stub
6257 || Nkind (gnat_decl) == N_Task_Body_Stub
6258 || Nkind (gnat_decl) == N_Protected_Body_Stub)
6259 add_stmt (gnat_to_gnu (gnat_decl));
6261 else if (Nkind (gnat_decl) == N_Package_Declaration
6262 && (Nkind (Specification (gnat_decl)
6263 == N_Package_Specification)))
6264 process_decls (Visible_Declarations (Specification (gnat_decl)),
6265 Private_Declarations (Specification (gnat_decl)),
6266 Empty, false, true);
6268 else if (Nkind (gnat_decl) == N_Freeze_Entity)
6269 process_decls (Actions (gnat_decl), Empty, Empty, false, true);
6273 /* Make a unary operation of kind CODE using build_unary_op, but guard
6274 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6275 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6276 the operation is to be performed in that type. GNAT_NODE is the gnat
6277 node conveying the source location for which the error should be
6281 build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand,
6284 gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR);
6286 operand = protect_multiple_eval (operand);
6288 return emit_check (build_binary_op (EQ_EXPR, integer_type_node,
6289 operand, TYPE_MIN_VALUE (gnu_type)),
6290 build_unary_op (code, gnu_type, operand),
6291 CE_Overflow_Check_Failed, gnat_node);
6294 /* Make a binary operation of kind CODE using build_binary_op, but guard
6295 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6296 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6297 Usually the operation is to be performed in that type. GNAT_NODE is
6298 the GNAT node conveying the source location for which the error should
6302 build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left,
6303 tree right, Node_Id gnat_node)
6305 tree lhs = protect_multiple_eval (left);
6306 tree rhs = protect_multiple_eval (right);
6307 tree type_max = TYPE_MAX_VALUE (gnu_type);
6308 tree type_min = TYPE_MIN_VALUE (gnu_type);
6311 tree zero = convert (gnu_type, integer_zero_node);
6316 int precision = TYPE_PRECISION (gnu_type);
6318 gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */
6320 /* Prefer a constant or known-positive rhs to simplify checks. */
6321 if (!TREE_CONSTANT (rhs)
6322 && commutative_tree_code (code)
6323 && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs)
6324 && tree_expr_nonnegative_p (lhs))))
6331 rhs_lt_zero = tree_expr_nonnegative_p (rhs)
6333 : build_binary_op (LT_EXPR, integer_type_node, rhs, zero);
6335 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6337 /* Try a few strategies that may be cheaper than the general
6338 code at the end of the function, if the rhs is not known.
6340 - Call library function for 64-bit multiplication (complex)
6341 - Widen, if input arguments are sufficiently small
6342 - Determine overflow using wrapped result for addition/subtraction. */
6344 if (!TREE_CONSTANT (rhs))
6346 /* Even for add/subtract double size to get another base type. */
6347 int needed_precision = precision * 2;
6349 if (code == MULT_EXPR && precision == 64)
6351 tree int_64 = gnat_type_for_size (64, 0);
6353 return convert (gnu_type, build_call_2_expr (mulv64_decl,
6354 convert (int_64, lhs),
6355 convert (int_64, rhs)));
6358 else if (needed_precision <= BITS_PER_WORD
6359 || (code == MULT_EXPR
6360 && needed_precision <= LONG_LONG_TYPE_SIZE))
6362 tree wide_type = gnat_type_for_size (needed_precision, 0);
6364 tree wide_result = build_binary_op (code, wide_type,
6365 convert (wide_type, lhs),
6366 convert (wide_type, rhs));
6368 tree check = build_binary_op
6369 (TRUTH_ORIF_EXPR, integer_type_node,
6370 build_binary_op (LT_EXPR, integer_type_node, wide_result,
6371 convert (wide_type, type_min)),
6372 build_binary_op (GT_EXPR, integer_type_node, wide_result,
6373 convert (wide_type, type_max)));
6375 tree result = convert (gnu_type, wide_result);
6378 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6381 else if (code == PLUS_EXPR || code == MINUS_EXPR)
6383 tree unsigned_type = gnat_type_for_size (precision, 1);
6384 tree wrapped_expr = convert
6385 (gnu_type, build_binary_op (code, unsigned_type,
6386 convert (unsigned_type, lhs),
6387 convert (unsigned_type, rhs)));
6389 tree result = convert
6390 (gnu_type, build_binary_op (code, gnu_type, lhs, rhs));
6392 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6393 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6394 tree check = build_binary_op
6395 (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero,
6396 build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR,
6397 integer_type_node, wrapped_expr, lhs));
6400 emit_check (check, result, CE_Overflow_Check_Failed, gnat_node);
6407 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6408 check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs,
6409 build_binary_op (MINUS_EXPR, gnu_type,
6412 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6413 check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs,
6414 build_binary_op (MINUS_EXPR, gnu_type,
6419 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6420 check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs,
6421 build_binary_op (PLUS_EXPR, gnu_type,
6424 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6425 check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs,
6426 build_binary_op (PLUS_EXPR, gnu_type,
6431 /* The check here is designed to be efficient if the rhs is constant,
6432 but it will work for any rhs by using integer division.
6433 Four different check expressions determine wether X * C overflows,
6436 C > 0 => X > type_max / C || X < type_min / C
6437 C == -1 => X == type_min
6438 C < -1 => X > type_min / C || X < type_max / C */
6440 tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs);
6441 tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs);
6443 check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node,
6444 build_binary_op (NE_EXPR, integer_type_node, zero, rhs),
6445 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6446 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1),
6447 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2)));
6449 check_neg = fold_build3 (COND_EXPR, integer_type_node,
6450 build_binary_op (EQ_EXPR, integer_type_node, rhs,
6451 build_int_cst (gnu_type, -1)),
6452 build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min),
6453 build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6454 build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2),
6455 build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1)));
6462 gnu_expr = build_binary_op (code, gnu_type, lhs, rhs);
6464 /* If we can fold the expression to a constant, just return it.
6465 The caller will deal with overflow, no need to generate a check. */
6466 if (TREE_CONSTANT (gnu_expr))
6469 check = fold_build3 (COND_EXPR, integer_type_node,
6470 rhs_lt_zero, check_neg, check_pos);
6472 return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node);
6475 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6476 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6477 which we have to check. GNAT_NODE is the GNAT node conveying the source
6478 location for which the error should be signaled. */
6481 emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node)
6483 tree gnu_range_type = get_unpadded_type (gnat_range_type);
6484 tree gnu_low = TYPE_MIN_VALUE (gnu_range_type);
6485 tree gnu_high = TYPE_MAX_VALUE (gnu_range_type);
6486 tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr));
6488 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6489 This can for example happen when translating 'Val or 'Value. */
6490 if (gnu_compare_type == gnu_range_type)
6493 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6494 we can't do anything since we might be truncating the bounds. No
6495 check is needed in this case. */
6496 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr))
6497 && (TYPE_PRECISION (gnu_compare_type)
6498 < TYPE_PRECISION (get_base_type (gnu_range_type))))
6501 /* Checked expressions must be evaluated only once. */
6502 gnu_expr = protect_multiple_eval (gnu_expr);
6504 /* There's no good type to use here, so we might as well use
6505 integer_type_node. Note that the form of the check is
6506 (not (expr >= lo)) or (not (expr <= hi))
6507 the reason for this slightly convoluted form is that NaNs
6508 are not considered to be in range in the float case. */
6510 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6512 (build_binary_op (GE_EXPR, integer_type_node,
6513 convert (gnu_compare_type, gnu_expr),
6514 convert (gnu_compare_type, gnu_low))),
6516 (build_binary_op (LE_EXPR, integer_type_node,
6517 convert (gnu_compare_type, gnu_expr),
6518 convert (gnu_compare_type,
6520 gnu_expr, CE_Range_Check_Failed, gnat_node);
6523 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
6524 we are about to index, GNU_EXPR is the index expression to be checked,
6525 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
6526 has to be checked. Note that for index checking we cannot simply use the
6527 emit_range_check function (although very similar code needs to be generated
6528 in both cases) since for index checking the array type against which we are
6529 checking the indices may be unconstrained and consequently we need to get
6530 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
6531 The place where we need to do that is in subprograms having unconstrained
6532 array formal parameters. GNAT_NODE is the GNAT node conveying the source
6533 location for which the error should be signaled. */
6536 emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low,
6537 tree gnu_high, Node_Id gnat_node)
6539 tree gnu_expr_check;
6541 /* Checked expressions must be evaluated only once. */
6542 gnu_expr = protect_multiple_eval (gnu_expr);
6544 /* Must do this computation in the base type in case the expression's
6545 type is an unsigned subtypes. */
6546 gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr);
6548 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6549 the object we are handling. */
6550 gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object);
6551 gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object);
6553 /* There's no good type to use here, so we might as well use
6554 integer_type_node. */
6556 (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node,
6557 build_binary_op (LT_EXPR, integer_type_node,
6559 convert (TREE_TYPE (gnu_expr_check),
6561 build_binary_op (GT_EXPR, integer_type_node,
6563 convert (TREE_TYPE (gnu_expr_check),
6565 gnu_expr, CE_Index_Check_Failed, gnat_node);
6568 /* GNU_COND contains the condition corresponding to an access, discriminant or
6569 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6570 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6571 REASON is the code that says why the exception was raised. GNAT_NODE is
6572 the GNAT node conveying the source location for which the error should be
6576 emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node)
6579 = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error);
6581 = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond,
6582 build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call,
6583 convert (TREE_TYPE (gnu_expr), integer_zero_node)),
6586 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6587 we don't need to evaluate it just for the check. */
6588 TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr);
6590 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6591 we will repeatedly do the test and, at compile time, we will repeatedly
6592 visit it during unsharing, which leads to an exponential explosion. */
6593 return save_expr (gnu_result);
6596 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
6597 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
6598 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
6599 float to integer conversion with truncation; otherwise round.
6600 GNAT_NODE is the GNAT node conveying the source location for which the
6601 error should be signaled. */
6604 convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp,
6605 bool rangep, bool truncatep, Node_Id gnat_node)
6607 tree gnu_type = get_unpadded_type (gnat_type);
6608 tree gnu_in_type = TREE_TYPE (gnu_expr);
6609 tree gnu_in_basetype = get_base_type (gnu_in_type);
6610 tree gnu_base_type = get_base_type (gnu_type);
6611 tree gnu_result = gnu_expr;
6613 /* If we are not doing any checks, the output is an integral type, and
6614 the input is not a floating type, just do the conversion. This
6615 shortcut is required to avoid problems with packed array types
6616 and simplifies code in all cases anyway. */
6617 if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type)
6618 && !FLOAT_TYPE_P (gnu_in_type))
6619 return convert (gnu_type, gnu_expr);
6621 /* First convert the expression to its base type. This
6622 will never generate code, but makes the tests below much simpler.
6623 But don't do this if converting from an integer type to an unconstrained
6624 array type since then we need to get the bounds from the original
6626 if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE)
6627 gnu_result = convert (gnu_in_basetype, gnu_result);
6629 /* If overflow checks are requested, we need to be sure the result will
6630 fit in the output base type. But don't do this if the input
6631 is integer and the output floating-point. */
6633 && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype)))
6635 /* Ensure GNU_EXPR only gets evaluated once. */
6636 tree gnu_input = protect_multiple_eval (gnu_result);
6637 tree gnu_cond = integer_zero_node;
6638 tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype);
6639 tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype);
6640 tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type);
6641 tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type);
6643 /* Convert the lower bounds to signed types, so we're sure we're
6644 comparing them properly. Likewise, convert the upper bounds
6645 to unsigned types. */
6646 if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype))
6647 gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb);
6649 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6650 && !TYPE_UNSIGNED (gnu_in_basetype))
6651 gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub);
6653 if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type))
6654 gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb);
6656 if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type))
6657 gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub);
6659 /* Check each bound separately and only if the result bound
6660 is tighter than the bound on the input type. Note that all the
6661 types are base types, so the bounds must be constant. Also,
6662 the comparison is done in the base type of the input, which
6663 always has the proper signedness. First check for input
6664 integer (which means output integer), output float (which means
6665 both float), or mixed, in which case we always compare.
6666 Note that we have to do the comparison which would *fail* in the
6667 case of an error since if it's an FP comparison and one of the
6668 values is a NaN or Inf, the comparison will fail. */
6669 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6670 ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb)
6671 : (FLOAT_TYPE_P (gnu_base_type)
6672 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb),
6673 TREE_REAL_CST (gnu_out_lb))
6677 (build_binary_op (GE_EXPR, integer_type_node,
6678 gnu_input, convert (gnu_in_basetype,
6681 if (INTEGRAL_TYPE_P (gnu_in_basetype)
6682 ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub)
6683 : (FLOAT_TYPE_P (gnu_base_type)
6684 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub),
6685 TREE_REAL_CST (gnu_in_lb))
6688 = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond,
6690 (build_binary_op (LE_EXPR, integer_type_node,
6692 convert (gnu_in_basetype,
6695 if (!integer_zerop (gnu_cond))
6696 gnu_result = emit_check (gnu_cond, gnu_input,
6697 CE_Overflow_Check_Failed, gnat_node);
6700 /* Now convert to the result base type. If this is a non-truncating
6701 float-to-integer conversion, round. */
6702 if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype)
6705 REAL_VALUE_TYPE half_minus_pred_half, pred_half;
6706 tree gnu_conv, gnu_zero, gnu_comp, gnu_saved_result, calc_type;
6707 tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half;
6708 const struct real_format *fmt;
6710 /* The following calculations depend on proper rounding to even
6711 of each arithmetic operation. In order to prevent excess
6712 precision from spoiling this property, use the widest hardware
6713 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6715 = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype;
6717 /* FIXME: Should not have padding in the first place. */
6718 if (TREE_CODE (calc_type) == RECORD_TYPE
6719 && TYPE_IS_PADDING_P (calc_type))
6720 calc_type = TREE_TYPE (TYPE_FIELDS (calc_type));
6722 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6723 fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type));
6724 real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type));
6725 REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf,
6726 half_minus_pred_half);
6727 gnu_pred_half = build_real (calc_type, pred_half);
6729 /* If the input is strictly negative, subtract this value
6730 and otherwise add it from the input. For 0.5, the result
6731 is exactly between 1.0 and the machine number preceding 1.0
6732 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6733 will round to 1.0, while all other number with an absolute
6734 value less than 0.5 round to 0.0. For larger numbers exactly
6735 halfway between integers, rounding will always be correct as
6736 the true mathematical result will be closer to the higher
6737 integer compared to the lower one. So, this constant works
6738 for all floating-point numbers.
6740 The reason to use the same constant with subtract/add instead
6741 of a positive and negative constant is to allow the comparison
6742 to be scheduled in parallel with retrieval of the constant and
6743 conversion of the input to the calc_type (if necessary). */
6745 gnu_zero = convert (gnu_in_basetype, integer_zero_node);
6746 gnu_saved_result = save_expr (gnu_result);
6747 gnu_conv = convert (calc_type, gnu_saved_result);
6748 gnu_comp = build2 (GE_EXPR, integer_type_node,
6749 gnu_saved_result, gnu_zero);
6751 = build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6752 gnu_subtract_pred_half
6753 = build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half);
6754 gnu_result = build3 (COND_EXPR, calc_type, gnu_comp,
6755 gnu_add_pred_half, gnu_subtract_pred_half);
6758 if (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6759 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type)
6760 && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF)
6761 gnu_result = unchecked_convert (gnu_base_type, gnu_result, false);
6763 gnu_result = convert (gnu_base_type, gnu_result);
6765 /* Finally, do the range check if requested. Note that if the
6766 result type is a modular type, the range check is actually
6767 an overflow check. */
6770 || (TREE_CODE (gnu_base_type) == INTEGER_TYPE
6771 && TYPE_MODULAR_P (gnu_base_type) && overflowp))
6772 gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node);
6774 return convert (gnu_type, gnu_result);
6777 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6780 smaller_packable_type_p (tree type, tree record_type)
6784 /* We're not interested in variants here. */
6785 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type))
6788 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6789 if (TYPE_NAME (type) != TYPE_NAME (record_type))
6792 size = TYPE_SIZE (type);
6793 rsize = TYPE_SIZE (record_type);
6795 if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST))
6798 return tree_int_cst_lt (size, rsize) != 0;
6801 /* Return true if GNU_EXPR can be directly addressed. This is the case
6802 unless it is an expression involving computation or if it involves a
6803 reference to a bitfield or to an object not sufficiently aligned for
6804 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6805 be directly addressed as an object of this type.
6807 *** Notes on addressability issues in the Ada compiler ***
6809 This predicate is necessary in order to bridge the gap between Gigi
6810 and the middle-end about addressability of GENERIC trees. A tree
6811 is said to be addressable if it can be directly addressed, i.e. if
6812 its address can be taken, is a multiple of the type's alignment on
6813 strict-alignment architectures and returns the first storage unit
6814 assigned to the object represented by the tree.
6816 In the C family of languages, everything is in practice addressable
6817 at the language level, except for bit-fields. This means that these
6818 compilers will take the address of any tree that doesn't represent
6819 a bit-field reference and expect the result to be the first storage
6820 unit assigned to the object. Even in cases where this will result
6821 in unaligned accesses at run time, nothing is supposed to be done
6822 and the program is considered as erroneous instead (see PR c/18287).
6824 The implicit assumptions made in the middle-end are in keeping with
6825 the C viewpoint described above:
6826 - the address of a bit-field reference is supposed to be never
6827 taken; the compiler (generally) will stop on such a construct,
6828 - any other tree is addressable if it is formally addressable,
6829 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6831 In Ada, the viewpoint is the opposite one: nothing is addressable
6832 at the language level unless explicitly declared so. This means
6833 that the compiler will both make sure that the trees representing
6834 references to addressable ("aliased" in Ada parlance) objects are
6835 addressable and make no real attempts at ensuring that the trees
6836 representing references to non-addressable objects are addressable.
6838 In the first case, Ada is effectively equivalent to C and handing
6839 down the direct result of applying ADDR_EXPR to these trees to the
6840 middle-end works flawlessly. In the second case, Ada cannot afford
6841 to consider the program as erroneous if the address of trees that
6842 are not addressable is requested for technical reasons, unlike C;
6843 as a consequence, the Ada compiler must arrange for either making
6844 sure that this address is not requested in the middle-end or for
6845 compensating by inserting temporaries if it is requested in Gigi.
6847 The first goal can be achieved because the middle-end should not
6848 request the address of non-addressable trees on its own; the only
6849 exception is for the invocation of low-level block operations like
6850 memcpy, for which the addressability requirements are lower since
6851 the type's alignment can be disregarded. In practice, this means
6852 that Gigi must make sure that such operations cannot be applied to
6853 non-BLKmode bit-fields.
6855 The second goal is achieved by means of the addressable_p predicate
6856 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6857 They will be turned during gimplification into proper temporaries
6858 whose address will be used in lieu of that of the original tree. */
6861 addressable_p (tree gnu_expr, tree gnu_type)
6863 /* The size of the real type of the object must not be smaller than
6864 that of the expected type, otherwise an indirect access in the
6865 latter type would be larger than the object. Only records need
6866 to be considered in practice. */
6868 && TREE_CODE (gnu_type) == RECORD_TYPE
6869 && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type))
6872 switch (TREE_CODE (gnu_expr))
6878 /* All DECLs are addressable: if they are in a register, we can force
6882 case UNCONSTRAINED_ARRAY_REF:
6893 /* We accept &COND_EXPR as soon as both operands are addressable and
6894 expect the outcome to be the address of the selected operand. */
6895 return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE)
6896 && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE));
6899 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1))
6900 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6901 the field is sufficiently aligned, in case it is subject
6902 to a pragma Component_Alignment. But we don't need to
6903 check the alignment of the containing record, as it is
6904 guaranteed to be not smaller than that of its most
6905 aligned field that is not a bit-field. */
6906 && (!STRICT_ALIGNMENT
6907 || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1))
6908 >= TYPE_ALIGN (TREE_TYPE (gnu_expr))))
6909 /* The field of a padding record is always addressable. */
6910 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))
6911 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6913 case ARRAY_REF: case ARRAY_RANGE_REF:
6914 case REALPART_EXPR: case IMAGPART_EXPR:
6916 return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE);
6919 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr))
6920 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6922 case VIEW_CONVERT_EXPR:
6924 /* This is addressable if we can avoid a copy. */
6925 tree type = TREE_TYPE (gnu_expr);
6926 tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0));
6927 return (((TYPE_MODE (type) == TYPE_MODE (inner_type)
6928 && (!STRICT_ALIGNMENT
6929 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6930 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT))
6931 || ((TYPE_MODE (type) == BLKmode
6932 || TYPE_MODE (inner_type) == BLKmode)
6933 && (!STRICT_ALIGNMENT
6934 || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type)
6935 || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT
6936 || TYPE_ALIGN_OK (type)
6937 || TYPE_ALIGN_OK (inner_type))))
6938 && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE));
6946 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6947 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6948 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6951 process_type (Entity_Id gnat_entity)
6954 = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0;
6957 /* If we are to delay elaboration of this type, just do any
6958 elaborations needed for expressions within the declaration and
6959 make a dummy type entry for this node and its Full_View (if
6960 any) in case something points to it. Don't do this if it
6961 has already been done (the only way that can happen is if
6962 the private completion is also delayed). */
6963 if (Present (Freeze_Node (gnat_entity))
6964 || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6965 && Present (Full_View (gnat_entity))
6966 && Freeze_Node (Full_View (gnat_entity))
6967 && !present_gnu_tree (Full_View (gnat_entity))))
6969 elaborate_entity (gnat_entity);
6973 tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity));
6974 save_gnu_tree (gnat_entity, gnu_decl, false);
6975 if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind)
6976 && Present (Full_View (gnat_entity)))
6977 save_gnu_tree (Full_View (gnat_entity), gnu_decl, false);
6983 /* If we saved away a dummy type for this node it means that this
6984 made the type that corresponds to the full type of an incomplete
6985 type. Clear that type for now and then update the type in the
6989 gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL
6990 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)));
6992 save_gnu_tree (gnat_entity, NULL_TREE, false);
6995 /* Now fully elaborate the type. */
6996 gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1);
6997 gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL);
6999 /* If we have an old type and we've made pointers to this type,
7000 update those pointers. */
7002 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)),
7003 TREE_TYPE (gnu_new));
7005 /* If this is a record type corresponding to a task or protected type
7006 that is a completion of an incomplete type, perform a similar update
7007 on the type. ??? Including protected types here is a guess. */
7008 if (IN (Ekind (gnat_entity), Record_Kind)
7009 && Is_Concurrent_Record_Type (gnat_entity)
7010 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)))
7013 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity));
7015 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7017 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity),
7020 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)),
7021 TREE_TYPE (gnu_new));
7025 /* GNAT_ENTITY is the type of the resulting constructors,
7026 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
7027 and GNU_TYPE is the GCC type of the corresponding record.
7029 Return a CONSTRUCTOR to build the record. */
7032 assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type)
7034 tree gnu_list, gnu_result;
7036 /* We test for GNU_FIELD being empty in the case where a variant
7037 was the last thing since we don't take things off GNAT_ASSOC in
7038 that case. We check GNAT_ASSOC in case we have a variant, but it
7041 for (gnu_list = NULL_TREE; Present (gnat_assoc);
7042 gnat_assoc = Next (gnat_assoc))
7044 Node_Id gnat_field = First (Choices (gnat_assoc));
7045 tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field));
7046 tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc));
7048 /* The expander is supposed to put a single component selector name
7049 in every record component association. */
7050 gcc_assert (No (Next (gnat_field)));
7052 /* Ignore fields that have Corresponding_Discriminants since we'll
7053 be setting that field in the parent. */
7054 if (Present (Corresponding_Discriminant (Entity (gnat_field)))
7055 && Is_Tagged_Type (Scope (Entity (gnat_field))))
7058 /* Also ignore discriminants of Unchecked_Unions. */
7059 else if (Is_Unchecked_Union (gnat_entity)
7060 && Ekind (Entity (gnat_field)) == E_Discriminant)
7063 /* Before assigning a value in an aggregate make sure range checks
7064 are done if required. Then convert to the type of the field. */
7065 if (Do_Range_Check (Expression (gnat_assoc)))
7066 gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty);
7068 gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr);
7070 /* Add the field and expression to the list. */
7071 gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list);
7074 gnu_result = extract_values (gnu_list, gnu_type);
7076 #ifdef ENABLE_CHECKING
7080 /* Verify every entry in GNU_LIST was used. */
7081 for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field))
7082 gcc_assert (TREE_ADDRESSABLE (gnu_field));
7089 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
7090 the first element of an array aggregate. It may itself be an aggregate.
7091 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
7092 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
7093 for range checking. */
7096 pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type,
7097 Entity_Id gnat_component_type)
7099 tree gnu_expr_list = NULL_TREE;
7100 tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type));
7103 for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr))
7105 /* If the expression is itself an array aggregate then first build the
7106 innermost constructor if it is part of our array (multi-dimensional
7108 if (Nkind (gnat_expr) == N_Aggregate
7109 && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE
7110 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type)))
7111 gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)),
7112 TREE_TYPE (gnu_array_type),
7113 gnat_component_type);
7116 gnu_expr = gnat_to_gnu (gnat_expr);
7118 /* Before assigning the element to the array, make sure it is
7120 if (Do_Range_Check (gnat_expr))
7121 gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty);
7125 = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr),
7128 gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0);
7131 return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list));
7134 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
7135 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
7136 of the associations that are from RECORD_TYPE. If we see an internal
7137 record, make a recursive call to fill it in as well. */
7140 extract_values (tree values, tree record_type)
7142 tree result = NULL_TREE;
7145 for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field))
7149 /* _Parent is an internal field, but may have values in the aggregate,
7150 so check for values first. */
7151 if ((tem = purpose_member (field, values)))
7153 value = TREE_VALUE (tem);
7154 TREE_ADDRESSABLE (tem) = 1;
7157 else if (DECL_INTERNAL_P (field))
7159 value = extract_values (values, TREE_TYPE (field));
7160 if (TREE_CODE (value) == CONSTRUCTOR
7161 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value)))
7165 /* If we have a record subtype, the names will match, but not the
7166 actual FIELD_DECLs. */
7167 for (tem = values; tem; tem = TREE_CHAIN (tem))
7168 if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field))
7170 value = convert (TREE_TYPE (field), TREE_VALUE (tem));
7171 TREE_ADDRESSABLE (tem) = 1;
7177 result = tree_cons (field, value, result);
7180 return gnat_build_constructor (record_type, nreverse (result));
7183 /* EXP is to be treated as an array or record. Handle the cases when it is
7184 an access object and perform the required dereferences. */
7187 maybe_implicit_deref (tree exp)
7189 /* If the type is a pointer, dereference it. */
7191 if (POINTER_TYPE_P (TREE_TYPE (exp)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp)))
7192 exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp);
7194 /* If we got a padded type, remove it too. */
7195 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
7196 && TYPE_IS_PADDING_P (TREE_TYPE (exp)))
7197 exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp);
7202 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
7205 protect_multiple_eval (tree exp)
7207 tree type = TREE_TYPE (exp);
7209 /* If this has no side effects, we don't need to do anything. */
7210 if (!TREE_SIDE_EFFECTS (exp))
7213 /* If it is a conversion, protect what's inside the conversion.
7214 Similarly, if we're indirectly referencing something, we only
7215 actually need to protect the address since the data itself can't
7216 change in these situations. */
7217 else if (TREE_CODE (exp) == NON_LVALUE_EXPR
7218 || CONVERT_EXPR_P (exp)
7219 || TREE_CODE (exp) == VIEW_CONVERT_EXPR
7220 || TREE_CODE (exp) == INDIRECT_REF
7221 || TREE_CODE (exp) == UNCONSTRAINED_ARRAY_REF)
7222 return build1 (TREE_CODE (exp), type,
7223 protect_multiple_eval (TREE_OPERAND (exp, 0)));
7225 /* If EXP is a fat pointer or something that can be placed into a register,
7226 just make a SAVE_EXPR. */
7227 if (TYPE_FAT_POINTER_P (type) || TYPE_MODE (type) != BLKmode)
7228 return save_expr (exp);
7230 /* Otherwise, dereference, protect the address, and re-reference. */
7233 build_unary_op (INDIRECT_REF, type,
7234 save_expr (build_unary_op (ADDR_EXPR,
7235 build_reference_type (type),
7239 /* This is equivalent to stabilize_reference in tree.c, but we know how to
7240 handle our own nodes and we take extra arguments. FORCE says whether to
7241 force evaluation of everything. We set SUCCESS to true unless we walk
7242 through something we don't know how to stabilize. */
7245 maybe_stabilize_reference (tree ref, bool force, bool *success)
7247 tree type = TREE_TYPE (ref);
7248 enum tree_code code = TREE_CODE (ref);
7251 /* Assume we'll success unless proven otherwise. */
7260 /* No action is needed in this case. */
7266 case FIX_TRUNC_EXPR:
7267 case VIEW_CONVERT_EXPR:
7269 = build1 (code, type,
7270 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7275 case UNCONSTRAINED_ARRAY_REF:
7276 result = build1 (code, type,
7277 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 0),
7282 result = build3 (COMPONENT_REF, type,
7283 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7285 TREE_OPERAND (ref, 1), NULL_TREE);
7289 result = build3 (BIT_FIELD_REF, type,
7290 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7292 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7294 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 2),
7299 case ARRAY_RANGE_REF:
7300 result = build4 (code, type,
7301 maybe_stabilize_reference (TREE_OPERAND (ref, 0), force,
7303 gnat_stabilize_reference_1 (TREE_OPERAND (ref, 1),
7305 NULL_TREE, NULL_TREE);
7309 result = gnat_stabilize_reference_1 (ref, force);
7313 /* This generates better code than the scheme in protect_multiple_eval
7314 because large objects will be returned via invisible reference in
7315 most ABIs so the temporary will directly be filled by the callee. */
7316 result = gnat_stabilize_reference_1 (ref, force);
7320 /* Constructors with 1 element are used extensively to formally
7321 convert objects to special wrapping types. */
7322 if (TREE_CODE (type) == RECORD_TYPE
7323 && VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ref)) == 1)
7326 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->index;
7328 = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ref), 0)->value;
7330 = build_constructor_single (type, index,
7331 gnat_stabilize_reference_1 (value,
7342 ref = error_mark_node;
7344 /* ... fall through to failure ... */
7346 /* If arg isn't a kind of lvalue we recognize, make no change.
7347 Caller should recognize the error for an invalid lvalue. */
7353 TREE_READONLY (result) = TREE_READONLY (ref);
7355 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7356 expression may not be sustained across some paths, such as the way via
7357 build1 for INDIRECT_REF. We re-populate those flags here for the general
7358 case, which is consistent with the GCC version of this routine.
7360 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7361 paths introduce side effects where there was none initially (e.g. calls
7362 to save_expr), and we also want to keep track of that. */
7364 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
7365 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (ref);
7370 /* Wrapper around maybe_stabilize_reference, for common uses without
7371 lvalue restrictions and without need to examine the success
7375 gnat_stabilize_reference (tree ref, bool force)
7378 return maybe_stabilize_reference (ref, force, &dummy);
7381 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7382 arg to force a SAVE_EXPR for everything. */
7385 gnat_stabilize_reference_1 (tree e, bool force)
7387 enum tree_code code = TREE_CODE (e);
7388 tree type = TREE_TYPE (e);
7391 /* We cannot ignore const expressions because it might be a reference
7392 to a const array but whose index contains side-effects. But we can
7393 ignore things that are actual constant or that already have been
7394 handled by this function. */
7396 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
7399 switch (TREE_CODE_CLASS (code))
7401 case tcc_exceptional:
7403 case tcc_declaration:
7404 case tcc_comparison:
7406 case tcc_expression:
7409 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7410 fat pointer. This may be more efficient, but will also allow
7411 us to more easily find the match for the PLACEHOLDER_EXPR. */
7412 if (code == COMPONENT_REF
7413 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e, 0))))
7414 result = build3 (COMPONENT_REF, type,
7415 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7417 TREE_OPERAND (e, 1), TREE_OPERAND (e, 2));
7418 else if (TREE_SIDE_EFFECTS (e) || force)
7419 return save_expr (e);
7425 /* Constants need no processing. In fact, we should never reach
7430 /* Recursively stabilize each operand. */
7431 result = build2 (code, type,
7432 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0), force),
7433 gnat_stabilize_reference_1 (TREE_OPERAND (e, 1),
7438 /* Recursively stabilize each operand. */
7439 result = build1 (code, type,
7440 gnat_stabilize_reference_1 (TREE_OPERAND (e, 0),
7448 TREE_READONLY (result) = TREE_READONLY (e);
7450 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
7451 TREE_SIDE_EFFECTS (result) |= TREE_SIDE_EFFECTS (e);
7455 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7456 location and false if it doesn't. In the former case, set the Gigi global
7457 variable REF_FILENAME to the simple debug file name as given by sinput. */
7460 Sloc_to_locus (Source_Ptr Sloc, location_t *locus)
7462 if (Sloc == No_Location)
7465 if (Sloc <= Standard_Location)
7467 *locus = BUILTINS_LOCATION;
7472 Source_File_Index file = Get_Source_File_Index (Sloc);
7473 Logical_Line_Number line = Get_Logical_Line_Number (Sloc);
7474 Column_Number column = Get_Column_Number (Sloc);
7475 struct line_map *map = &line_table->maps[file - 1];
7477 /* Translate the location according to the line-map.h formula. */
7478 *locus = map->start_location
7479 + ((line - map->to_line) << map->column_bits)
7480 + (column & ((1 << map->column_bits) - 1));
7484 = IDENTIFIER_POINTER
7486 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));;
7491 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7492 don't do anything if it doesn't correspond to a source location. */
7495 set_expr_location_from_node (tree node, Node_Id gnat_node)
7499 if (!Sloc_to_locus (Sloc (gnat_node), &locus))
7502 SET_EXPR_LOCATION (node, locus);
7505 /* Return a colon-separated list of encodings contained in encoded Ada
7509 extract_encoding (const char *name)
7511 char *encoding = GGC_NEWVEC (char, strlen (name));
7512 get_encoding (name, encoding);
7516 /* Extract the Ada name from an encoded name. */
7519 decode_name (const char *name)
7521 char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60);
7522 __gnat_decode (name, decoded, 0);
7526 /* Post an error message. MSG is the error message, properly annotated.
7527 NODE is the node at which to post the error and the node to use for the
7528 "&" substitution. */
7531 post_error (const char *msg, Node_Id node)
7533 String_Template temp;
7536 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7537 fp.Array = msg, fp.Bounds = &temp;
7539 Error_Msg_N (fp, node);
7542 /* Similar, but NODE is the node at which to post the error and ENT
7543 is the node to use for the "&" substitution. */
7546 post_error_ne (const char *msg, Node_Id node, Entity_Id ent)
7548 String_Template temp;
7551 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7552 fp.Array = msg, fp.Bounds = &temp;
7554 Error_Msg_NE (fp, node, ent);
7557 /* Similar, but NODE is the node at which to post the error, ENT is the node
7558 to use for the "&" substitution, and N is the number to use for the ^. */
7561 post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n)
7563 String_Template temp;
7566 temp.Low_Bound = 1, temp.High_Bound = strlen (msg);
7567 fp.Array = msg, fp.Bounds = &temp;
7568 Error_Msg_Uint_1 = UI_From_Int (n);
7571 Error_Msg_NE (fp, node, ent);
7574 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7575 number to write. If the tree represents a constant that fits within
7576 a host integer, the text inside curly brackets in MSG will be output
7577 (presumably including a '^'). Otherwise that text will not be output
7578 and the text inside square brackets will be output instead. */
7581 post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t)
7583 char *newmsg = XALLOCAVEC (char, strlen (msg) + 1);
7584 String_Template temp = {1, 0};
7586 char start_yes, end_yes, start_no, end_no;
7590 fp.Array = newmsg, fp.Bounds = &temp;
7592 if (host_integerp (t, 1)
7593 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7596 (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0
7600 Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1));
7601 start_yes = '{', end_yes = '}', start_no = '[', end_no = ']';
7604 start_yes = '[', end_yes = ']', start_no = '{', end_no = '}';
7606 for (p = msg, q = newmsg; *p; p++)
7608 if (*p == start_yes)
7609 for (p++; *p != end_yes; p++)
7611 else if (*p == start_no)
7612 for (p++; *p != end_no; p++)
7620 temp.High_Bound = strlen (newmsg);
7622 Error_Msg_NE (fp, node, ent);
7625 /* Similar to post_error_ne_tree, except that NUM is a second
7626 integer to write in the message. */
7629 post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t,
7632 Error_Msg_Uint_2 = UI_From_Int (num);
7633 post_error_ne_tree (msg, node, ent, t);
7636 /* Initialize the table that maps GNAT codes to GCC codes for simple
7637 binary and unary operations. */
7640 init_code_table (void)
7642 gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR;
7643 gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR;
7645 gnu_codes[N_Op_And] = TRUTH_AND_EXPR;
7646 gnu_codes[N_Op_Or] = TRUTH_OR_EXPR;
7647 gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR;
7648 gnu_codes[N_Op_Eq] = EQ_EXPR;
7649 gnu_codes[N_Op_Ne] = NE_EXPR;
7650 gnu_codes[N_Op_Lt] = LT_EXPR;
7651 gnu_codes[N_Op_Le] = LE_EXPR;
7652 gnu_codes[N_Op_Gt] = GT_EXPR;
7653 gnu_codes[N_Op_Ge] = GE_EXPR;
7654 gnu_codes[N_Op_Add] = PLUS_EXPR;
7655 gnu_codes[N_Op_Subtract] = MINUS_EXPR;
7656 gnu_codes[N_Op_Multiply] = MULT_EXPR;
7657 gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR;
7658 gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR;
7659 gnu_codes[N_Op_Minus] = NEGATE_EXPR;
7660 gnu_codes[N_Op_Abs] = ABS_EXPR;
7661 gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR;
7662 gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR;
7663 gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR;
7664 gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR;
7665 gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR;
7666 gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR;
7669 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7673 get_exception_label (char kind)
7675 if (kind == N_Raise_Constraint_Error)
7676 return TREE_VALUE (gnu_constraint_error_label_stack);
7677 else if (kind == N_Raise_Storage_Error)
7678 return TREE_VALUE (gnu_storage_error_label_stack);
7679 else if (kind == N_Raise_Program_Error)
7680 return TREE_VALUE (gnu_program_error_label_stack);
7685 #include "gt-ada-trans.h"