1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2009, Free Software Foundation, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 2, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING. If not, write *
19 * to the Free Software Foundation, 51 Franklin Street, Fifth Floor, *
20 * Boston, MA 02110-1301, USA. *
22 * GNAT was originally developed by the GNAT team at New York University. *
23 * Extensive contributions were provided by Ada Core Technologies Inc. *
25 ****************************************************************************/
29 #include "coretypes.h"
43 #include "tree-iterator.h"
60 #include "adadecode.h"
63 #include "dwarf2out.h"
65 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
66 for fear of running out of stack space. If we need more, we use xmalloc
68 #define ALLOCA_THRESHOLD 1000
70 /* Let code below know whether we are targetting VMS without need of
71 intrusive preprocessor directives. */
72 #ifndef TARGET_ABI_OPEN_VMS
73 #define TARGET_ABI_OPEN_VMS 0
76 /* For efficient float-to-int rounding, it is necessary to know whether
77 floating-point arithmetic may use wider intermediate results.
78 When FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume
79 floating-point arithmetic does not widen if double precision is emulated. */
81 #ifndef FP_ARITH_MAY_WIDEN
82 #if defined(HAVE_extendsfdf2)
83 #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2
85 #define FP_ARITH_MAY_WIDEN 0
89 extern char *__gnat_to_canonical_file_spec (char *);
94 struct Node
*Nodes_Ptr
;
95 Node_Id
*Next_Node_Ptr
;
96 Node_Id
*Prev_Node_Ptr
;
97 struct Elist_Header
*Elists_Ptr
;
98 struct Elmt_Item
*Elmts_Ptr
;
99 struct String_Entry
*Strings_Ptr
;
100 Char_Code
*String_Chars_Ptr
;
101 struct List_Header
*List_Headers_Ptr
;
103 /* Current filename without path. */
104 const char *ref_filename
;
106 /* If true, then gigi is being called on an analyzed but unexpanded
107 tree, and the only purpose of the call is to properly annotate
108 types with representation information. */
109 bool type_annotate_only
;
111 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
112 of unconstrained array IN parameters to avoid emitting a great deal of
113 redundant instructions to recompute them each time. */
114 struct parm_attr
GTY (())
116 int id
; /* GTY doesn't like Entity_Id. */
123 typedef struct parm_attr
*parm_attr
;
125 DEF_VEC_P(parm_attr
);
126 DEF_VEC_ALLOC_P(parm_attr
,gc
);
128 struct language_function
GTY(())
130 VEC(parm_attr
,gc
) *parm_attr_cache
;
133 #define f_parm_attr_cache \
134 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
136 /* A structure used to gather together information about a statement group.
137 We use this to gather related statements, for example the "then" part
138 of a IF. In the case where it represents a lexical scope, we may also
139 have a BLOCK node corresponding to it and/or cleanups. */
141 struct stmt_group
GTY((chain_next ("%h.previous"))) {
142 struct stmt_group
*previous
; /* Previous code group. */
143 tree stmt_list
; /* List of statements for this code group. */
144 tree block
; /* BLOCK for this code group, if any. */
145 tree cleanups
; /* Cleanups for this code group, if any. */
148 static GTY(()) struct stmt_group
*current_stmt_group
;
150 /* List of unused struct stmt_group nodes. */
151 static GTY((deletable
)) struct stmt_group
*stmt_group_free_list
;
153 /* A structure used to record information on elaboration procedures
154 we've made and need to process.
156 ??? gnat_node should be Node_Id, but gengtype gets confused. */
158 struct elab_info
GTY((chain_next ("%h.next"))) {
159 struct elab_info
*next
; /* Pointer to next in chain. */
160 tree elab_proc
; /* Elaboration procedure. */
161 int gnat_node
; /* The N_Compilation_Unit. */
164 static GTY(()) struct elab_info
*elab_info_list
;
166 /* Free list of TREE_LIST nodes used for stacks. */
167 static GTY((deletable
)) tree gnu_stack_free_list
;
169 /* List of TREE_LIST nodes representing a stack of exception pointer
170 variables. TREE_VALUE is the VAR_DECL that stores the address of
171 the raised exception. Nonzero means we are in an exception
172 handler. Not used in the zero-cost case. */
173 static GTY(()) tree gnu_except_ptr_stack
;
175 /* List of TREE_LIST nodes used to store the current elaboration procedure
176 decl. TREE_VALUE is the decl. */
177 static GTY(()) tree gnu_elab_proc_stack
;
179 /* Variable that stores a list of labels to be used as a goto target instead of
180 a return in some functions. See processing for N_Subprogram_Body. */
181 static GTY(()) tree gnu_return_label_stack
;
183 /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes.
184 TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */
185 static GTY(()) tree gnu_loop_label_stack
;
187 /* List of TREE_LIST nodes representing labels for switch statements.
188 TREE_VALUE of each entry is the label at the end of the switch. */
189 static GTY(()) tree gnu_switch_label_stack
;
191 /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */
192 static GTY(()) tree gnu_constraint_error_label_stack
;
193 static GTY(()) tree gnu_storage_error_label_stack
;
194 static GTY(()) tree gnu_program_error_label_stack
;
196 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
197 static enum tree_code gnu_codes
[Number_Node_Kinds
];
199 /* Current node being treated, in case abort called. */
200 Node_Id error_gnat_node
;
202 static void init_code_table (void);
203 static void Compilation_Unit_to_gnu (Node_Id
);
204 static void record_code_position (Node_Id
);
205 static void insert_code_for (Node_Id
);
206 static void add_cleanup (tree
, Node_Id
);
207 static tree
unshare_save_expr (tree
*, int *, void *);
208 static void add_stmt_list (List_Id
);
209 static void push_exception_label_stack (tree
*, Entity_Id
);
210 static tree
build_stmt_group (List_Id
, bool);
211 static void push_stack (tree
*, tree
, tree
);
212 static void pop_stack (tree
*);
213 static enum gimplify_status
gnat_gimplify_stmt (tree
*);
214 static void elaborate_all_entities (Node_Id
);
215 static void process_freeze_entity (Node_Id
);
216 static void process_inlined_subprograms (Node_Id
);
217 static void process_decls (List_Id
, List_Id
, Node_Id
, bool, bool);
218 static tree
emit_range_check (tree
, Node_Id
);
219 static tree
emit_index_check (tree
, tree
, tree
, tree
);
220 static tree
emit_check (tree
, tree
, int);
221 static tree
build_unary_op_trapv (enum tree_code
, tree
, tree
);
222 static tree
build_binary_op_trapv (enum tree_code
, tree
, tree
, tree
);
223 static tree
convert_with_check (Entity_Id
, tree
, bool, bool, bool);
224 static bool smaller_packable_type_p (tree
, tree
);
225 static bool addressable_p (tree
, tree
);
226 static tree
assoc_to_constructor (Entity_Id
, Node_Id
, tree
);
227 static tree
extract_values (tree
, tree
);
228 static tree
pos_to_constructor (Node_Id
, tree
, Entity_Id
);
229 static tree
maybe_implicit_deref (tree
);
230 static tree
gnat_stabilize_reference (tree
, bool);
231 static tree
gnat_stabilize_reference_1 (tree
, bool);
232 static void set_expr_location_from_node (tree
, Node_Id
);
233 static int lvalue_required_p (Node_Id
, tree
, int);
235 /* Hooks for debug info back-ends, only supported and used in a restricted set
236 of configurations. */
237 static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED
;
238 static const char *decode_name (const char *) ATTRIBUTE_UNUSED
;
240 /* This is the main program of the back-end. It sets up all the table
241 structures and then generates code. */
244 gigi (Node_Id gnat_root
, int max_gnat_node
, int number_name
,
245 struct Node
*nodes_ptr
, Node_Id
*next_node_ptr
, Node_Id
*prev_node_ptr
,
246 struct Elist_Header
*elists_ptr
, struct Elmt_Item
*elmts_ptr
,
247 struct String_Entry
*strings_ptr
, Char_Code
*string_chars_ptr
,
248 struct List_Header
*list_headers_ptr
, Nat number_file
,
249 struct File_Info_Type
*file_info_ptr
, Entity_Id standard_boolean
,
250 Entity_Id standard_integer
, Entity_Id standard_long_long_float
,
251 Entity_Id standard_exception_type
, Int gigi_operating_mode
)
253 Entity_Id gnat_literal
;
254 tree gnu_standard_long_long_float
, gnu_standard_exception_type
, t
;
255 struct elab_info
*info
;
258 max_gnat_nodes
= max_gnat_node
;
259 number_names
= number_name
;
260 number_files
= number_file
;
261 Nodes_Ptr
= nodes_ptr
;
262 Next_Node_Ptr
= next_node_ptr
;
263 Prev_Node_Ptr
= prev_node_ptr
;
264 Elists_Ptr
= elists_ptr
;
265 Elmts_Ptr
= elmts_ptr
;
266 Strings_Ptr
= strings_ptr
;
267 String_Chars_Ptr
= string_chars_ptr
;
268 List_Headers_Ptr
= list_headers_ptr
;
270 type_annotate_only
= (gigi_operating_mode
== 1);
272 for (i
= 0; i
< number_files
; i
++)
274 /* Use the identifier table to make a permanent copy of the filename as
275 the name table gets reallocated after Gigi returns but before all the
276 debugging information is output. The __gnat_to_canonical_file_spec
277 call translates filenames from pragmas Source_Reference that contain
278 host style syntax not understood by gdb. */
282 (__gnat_to_canonical_file_spec
283 (Get_Name_String (file_info_ptr
[i
].File_Name
))));
285 /* We rely on the order isomorphism between files and line maps. */
286 gcc_assert ((int) line_table
->used
== i
);
288 /* We create the line map for a source file at once, with a fixed number
289 of columns chosen to avoid jumping over the next power of 2. */
290 linemap_add (line_table
, LC_ENTER
, 0, filename
, 1);
291 linemap_line_start (line_table
, file_info_ptr
[i
].Num_Source_Lines
, 252);
292 linemap_position_for_column (line_table
, 252 - 1);
293 linemap_add (line_table
, LC_LEAVE
, 0, NULL
, 0);
296 /* Initialize ourselves. */
299 gnat_compute_largest_alignment ();
302 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
304 if (type_annotate_only
)
306 TYPE_SIZE (void_type_node
) = bitsize_zero_node
;
307 TYPE_SIZE_UNIT (void_type_node
) = size_zero_node
;
310 /* If the GNU type extensions to DWARF are available, setup the hooks. */
311 #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS)
312 /* We condition the name demangling and the generation of type encoding
313 strings on -gdwarf+ and always set descriptive types on. */
314 if (use_gnu_debug_info_extensions
)
316 dwarf2out_set_type_encoding_func (extract_encoding
);
317 dwarf2out_set_demangle_name_func (decode_name
);
319 dwarf2out_set_descriptive_type_func (get_parallel_type
);
322 /* Enable GNAT stack checking method if needed */
323 if (!Stack_Check_Probes_On_Target
)
324 set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode
, "_gnat_stack_check"));
326 /* Give names and make TYPE_DECLs for common types. */
327 create_type_decl (get_identifier (SIZE_TYPE
), sizetype
,
328 NULL
, false, true, Empty
);
329 create_type_decl (get_identifier ("boolean"), boolean_type_node
,
330 NULL
, false, true, Empty
);
331 create_type_decl (get_identifier ("integer"), integer_type_node
,
332 NULL
, false, true, Empty
);
333 create_type_decl (get_identifier ("unsigned char"), char_type_node
,
334 NULL
, false, true, Empty
);
335 create_type_decl (get_identifier ("long integer"), long_integer_type_node
,
336 NULL
, false, true, Empty
);
338 /* Save the type we made for boolean as the type for Standard.Boolean. */
339 save_gnu_tree (Base_Type (standard_boolean
), TYPE_NAME (boolean_type_node
),
341 gnat_literal
= First_Literal (Base_Type (standard_boolean
));
342 t
= UI_To_gnu (Enumeration_Rep (gnat_literal
), boolean_type_node
);
343 gcc_assert (t
== boolean_false_node
);
344 t
= create_var_decl (get_entity_name (gnat_literal
), NULL_TREE
,
345 boolean_type_node
, t
, true, false, false, false,
347 DECL_IGNORED_P (t
) = 1;
348 save_gnu_tree (gnat_literal
, t
, false);
349 gnat_literal
= Next_Literal (gnat_literal
);
350 t
= UI_To_gnu (Enumeration_Rep (gnat_literal
), boolean_type_node
);
351 gcc_assert (t
== boolean_true_node
);
352 t
= create_var_decl (get_entity_name (gnat_literal
), NULL_TREE
,
353 boolean_type_node
, t
, true, false, false, false,
355 DECL_IGNORED_P (t
) = 1;
356 save_gnu_tree (gnat_literal
, t
, false);
358 /* Save the type we made for integer as the type for Standard.Integer.
359 Then make the rest of the standard types. Note that some of these
361 save_gnu_tree (Base_Type (standard_integer
), TYPE_NAME (integer_type_node
),
364 gnu_except_ptr_stack
= tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
);
365 gnu_constraint_error_label_stack
366 = tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
);
367 gnu_storage_error_label_stack
= tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
);
368 gnu_program_error_label_stack
= tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
);
370 gnu_standard_long_long_float
371 = gnat_to_gnu_entity (Base_Type (standard_long_long_float
), NULL_TREE
, 0);
372 gnu_standard_exception_type
373 = gnat_to_gnu_entity (Base_Type (standard_exception_type
), NULL_TREE
, 0);
375 init_gigi_decls (gnu_standard_long_long_float
, gnu_standard_exception_type
);
377 /* Process any Pragma Ident for the main unit. */
378 #ifdef ASM_OUTPUT_IDENT
379 if (Present (Ident_String (Main_Unit
)))
382 TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit
))));
385 /* If we are using the GCC exception mechanism, let GCC know. */
386 if (Exception_Mechanism
== Back_End_Exceptions
)
389 gcc_assert (Nkind (gnat_root
) == N_Compilation_Unit
);
391 /* Declare the name of the compilation unit as the first global
392 name in order to make the middle-end fully deterministic. */
393 t
= create_concat_name (Defining_Entity (Unit (gnat_root
)), NULL
);
394 first_global_object_name
= ggc_strdup (IDENTIFIER_POINTER (t
));
396 /* Now translate the compilation unit proper. */
398 Compilation_Unit_to_gnu (gnat_root
);
400 /* Finally see if we have any elaboration procedures to deal with. */
401 for (info
= elab_info_list
; info
; info
= info
->next
)
403 tree gnu_body
= DECL_SAVED_TREE (info
->elab_proc
);
405 /* Unshare SAVE_EXPRs between subprograms. These are not unshared by
406 the gimplifier for obvious reasons, but it turns out that we need to
407 unshare them for the global level because of SAVE_EXPRs made around
408 checks for global objects and around allocators for global objects
409 of variable size, in order to prevent node sharing in the underlying
410 expression. Note that this implicitly assumes that the SAVE_EXPR
411 nodes themselves are not shared between subprograms, which would be
412 an upstream bug for which we would not change the outcome. */
413 walk_tree_without_duplicates (&gnu_body
, unshare_save_expr
, NULL
);
415 /* Process the function as others, but for indicating this is an
416 elab proc, to be discarded if empty, then propagate the status
417 up to the GNAT tree node. */
418 begin_subprog_body (info
->elab_proc
);
419 end_subprog_body (gnu_body
, true);
421 if (empty_body_p (gimple_body (info
->elab_proc
)))
422 Set_Has_No_Elaboration_Code (info
->gnat_node
, 1);
425 /* We cannot track the location of errors past this point. */
426 error_gnat_node
= Empty
;
429 /* Return a positive value if an lvalue is required for GNAT_NODE.
430 GNU_TYPE is the type that will be used for GNAT_NODE in the
431 translated GNU tree. ALIASED indicates whether the underlying
432 object represented by GNAT_NODE is aliased in the Ada sense.
434 The function climbs up the GNAT tree starting from the node and
435 returns 1 upon encountering a node that effectively requires an
436 lvalue downstream. It returns int instead of bool to facilitate
437 usage in non purely binary logic contexts. */
440 lvalue_required_p (Node_Id gnat_node
, tree gnu_type
, int aliased
)
442 Node_Id gnat_parent
= Parent (gnat_node
), gnat_temp
;
444 switch (Nkind (gnat_parent
))
449 case N_Attribute_Reference
:
451 unsigned char id
= Get_Attribute_Id (Attribute_Name (gnat_parent
));
452 return id
== Attr_Address
454 || id
== Attr_Unchecked_Access
455 || id
== Attr_Unrestricted_Access
;
458 case N_Parameter_Association
:
459 case N_Function_Call
:
460 case N_Procedure_Call_Statement
:
461 return (must_pass_by_ref (gnu_type
) || default_pass_by_ref (gnu_type
));
463 case N_Indexed_Component
:
464 /* Only the array expression can require an lvalue. */
465 if (Prefix (gnat_parent
) != gnat_node
)
468 /* ??? Consider that referencing an indexed component with a
469 non-constant index forces the whole aggregate to memory.
470 Note that N_Integer_Literal is conservative, any static
471 expression in the RM sense could probably be accepted. */
472 for (gnat_temp
= First (Expressions (gnat_parent
));
474 gnat_temp
= Next (gnat_temp
))
475 if (Nkind (gnat_temp
) != N_Integer_Literal
)
478 /* ... fall through ... */
481 /* Only the array expression can require an lvalue. */
482 if (Prefix (gnat_parent
) != gnat_node
)
485 aliased
|= Has_Aliased_Components (Etype (gnat_node
));
486 return lvalue_required_p (gnat_parent
, gnu_type
, aliased
);
488 case N_Selected_Component
:
489 aliased
|= Is_Aliased (Entity (Selector_Name (gnat_parent
)));
490 return lvalue_required_p (gnat_parent
, gnu_type
, aliased
);
492 case N_Object_Renaming_Declaration
:
493 /* We need to make a real renaming only if the constant object is
494 aliased or if we may use a renaming pointer; otherwise we can
495 optimize and return the rvalue. We make an exception if the object
496 is an identifier since in this case the rvalue can be propagated
497 attached to the CONST_DECL. */
499 /* This should match the constant case of the renaming code. */
500 || Is_Composite_Type (Etype (Name (gnat_parent
)))
501 || Nkind (Name (gnat_parent
)) == N_Identifier
);
510 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
511 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
512 to where we should place the result type. */
515 Identifier_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
)
517 Node_Id gnat_temp
, gnat_temp_type
;
518 tree gnu_result
, gnu_result_type
;
520 /* Whether we should require an lvalue for GNAT_NODE. Needed in
521 specific circumstances only, so evaluated lazily. < 0 means
522 unknown, > 0 means known true, 0 means known false. */
523 int require_lvalue
= -1;
525 /* If GNAT_NODE is a constant, whether we should use the initialization
526 value instead of the constant entity, typically for scalars with an
527 address clause when the parent doesn't require an lvalue. */
528 bool use_constant_initializer
= false;
530 /* If the Etype of this node does not equal the Etype of the Entity,
531 something is wrong with the entity map, probably in generic
532 instantiation. However, this does not apply to types. Since we sometime
533 have strange Ekind's, just do this test for objects. Also, if the Etype of
534 the Entity is private, the Etype of the N_Identifier is allowed to be the
535 full type and also we consider a packed array type to be the same as the
536 original type. Similarly, a class-wide type is equivalent to a subtype of
537 itself. Finally, if the types are Itypes, one may be a copy of the other,
538 which is also legal. */
539 gnat_temp
= (Nkind (gnat_node
) == N_Defining_Identifier
540 ? gnat_node
: Entity (gnat_node
));
541 gnat_temp_type
= Etype (gnat_temp
);
543 gcc_assert (Etype (gnat_node
) == gnat_temp_type
544 || (Is_Packed (gnat_temp_type
)
545 && Etype (gnat_node
) == Packed_Array_Type (gnat_temp_type
))
546 || (Is_Class_Wide_Type (Etype (gnat_node
)))
547 || (IN (Ekind (gnat_temp_type
), Private_Kind
)
548 && Present (Full_View (gnat_temp_type
))
549 && ((Etype (gnat_node
) == Full_View (gnat_temp_type
))
550 || (Is_Packed (Full_View (gnat_temp_type
))
551 && (Etype (gnat_node
)
552 == Packed_Array_Type (Full_View
553 (gnat_temp_type
))))))
554 || (Is_Itype (Etype (gnat_node
)) && Is_Itype (gnat_temp_type
))
555 || !(Ekind (gnat_temp
) == E_Variable
556 || Ekind (gnat_temp
) == E_Component
557 || Ekind (gnat_temp
) == E_Constant
558 || Ekind (gnat_temp
) == E_Loop_Parameter
559 || IN (Ekind (gnat_temp
), Formal_Kind
)));
561 /* If this is a reference to a deferred constant whose partial view is an
562 unconstrained private type, the proper type is on the full view of the
563 constant, not on the full view of the type, which may be unconstrained.
565 This may be a reference to a type, for example in the prefix of the
566 attribute Position, generated for dispatching code (see Make_DT in
567 exp_disp,adb). In that case we need the type itself, not is parent,
568 in particular if it is a derived type */
569 if (Is_Private_Type (gnat_temp_type
)
570 && Has_Unknown_Discriminants (gnat_temp_type
)
571 && Ekind (gnat_temp
) == E_Constant
572 && Present (Full_View (gnat_temp
)))
574 gnat_temp
= Full_View (gnat_temp
);
575 gnat_temp_type
= Etype (gnat_temp
);
579 /* We want to use the Actual_Subtype if it has already been elaborated,
580 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
582 if ((Ekind (gnat_temp
) == E_Constant
583 || Ekind (gnat_temp
) == E_Variable
|| Is_Formal (gnat_temp
))
584 && !(Is_Array_Type (Etype (gnat_temp
))
585 && Present (Packed_Array_Type (Etype (gnat_temp
))))
586 && Present (Actual_Subtype (gnat_temp
))
587 && present_gnu_tree (Actual_Subtype (gnat_temp
)))
588 gnat_temp_type
= Actual_Subtype (gnat_temp
);
590 gnat_temp_type
= Etype (gnat_node
);
593 /* Expand the type of this identifier first, in case it is an enumeral
594 literal, which only get made when the type is expanded. There is no
595 order-of-elaboration issue here. */
596 gnu_result_type
= get_unpadded_type (gnat_temp_type
);
598 /* If this is a non-imported scalar constant with an address clause,
599 retrieve the value instead of a pointer to be dereferenced unless
600 an lvalue is required. This is generally more efficient and actually
601 required if this is a static expression because it might be used
602 in a context where a dereference is inappropriate, such as a case
603 statement alternative or a record discriminant. There is no possible
604 volatile-ness short-circuit here since Volatile constants must be imported
606 if (Ekind (gnat_temp
) == E_Constant
&& Is_Scalar_Type (gnat_temp_type
)
607 && !Is_Imported (gnat_temp
)
608 && Present (Address_Clause (gnat_temp
)))
610 require_lvalue
= lvalue_required_p (gnat_node
, gnu_result_type
,
611 Is_Aliased (gnat_temp
));
612 use_constant_initializer
= !require_lvalue
;
615 if (use_constant_initializer
)
617 /* If this is a deferred constant, the initializer is attached to
619 if (Present (Full_View (gnat_temp
)))
620 gnat_temp
= Full_View (gnat_temp
);
622 gnu_result
= gnat_to_gnu (Expression (Declaration_Node (gnat_temp
)));
625 gnu_result
= gnat_to_gnu_entity (gnat_temp
, NULL_TREE
, 0);
627 /* If we are in an exception handler, force this variable into memory to
628 ensure optimization does not remove stores that appear redundant but are
629 actually needed in case an exception occurs.
631 ??? Note that we need not do this if the variable is declared within the
632 handler, only if it is referenced in the handler and declared in an
633 enclosing block, but we have no way of testing that right now.
635 ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable
636 here, but it can now be removed by the Tree aliasing machinery if the
637 address of the variable is never taken. All we can do is to make the
638 variable volatile, which might incur the generation of temporaries just
639 to access the memory in some circumstances. This can be avoided for
640 variables of non-constant size because they are automatically allocated
641 to memory. There might be no way of allocating a proper temporary for
642 them in any case. We only do this for SJLJ though. */
643 if (TREE_VALUE (gnu_except_ptr_stack
)
644 && TREE_CODE (gnu_result
) == VAR_DECL
645 && TREE_CODE (DECL_SIZE_UNIT (gnu_result
)) == INTEGER_CST
)
646 TREE_THIS_VOLATILE (gnu_result
) = TREE_SIDE_EFFECTS (gnu_result
) = 1;
648 /* Some objects (such as parameters passed by reference, globals of
649 variable size, and renamed objects) actually represent the address
650 of the object. In that case, we must do the dereference. Likewise,
651 deal with parameters to foreign convention subprograms. */
652 if (DECL_P (gnu_result
)
653 && (DECL_BY_REF_P (gnu_result
)
654 || (TREE_CODE (gnu_result
) == PARM_DECL
655 && DECL_BY_COMPONENT_PTR_P (gnu_result
))))
657 bool ro
= DECL_POINTS_TO_READONLY_P (gnu_result
);
660 if (TREE_CODE (gnu_result
) == PARM_DECL
661 && DECL_BY_COMPONENT_PTR_P (gnu_result
))
663 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
664 convert (build_pointer_type (gnu_result_type
),
667 /* If it's a renaming pointer and we are at the right binding level,
668 we can reference the renamed object directly, since the renamed
669 expression has been protected against multiple evaluations. */
670 else if (TREE_CODE (gnu_result
) == VAR_DECL
671 && (renamed_obj
= DECL_RENAMED_OBJECT (gnu_result
)) != 0
672 && (! DECL_RENAMING_GLOBAL_P (gnu_result
)
673 || global_bindings_p ()))
674 gnu_result
= renamed_obj
;
676 /* Return the underlying CST for a CONST_DECL like a few lines below,
677 after dereferencing in this case. */
678 else if (TREE_CODE (gnu_result
) == CONST_DECL
)
679 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
,
680 DECL_INITIAL (gnu_result
));
683 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
685 TREE_READONLY (gnu_result
) = TREE_STATIC (gnu_result
) = ro
;
688 /* The GNAT tree has the type of a function as the type of its result. Also
689 use the type of the result if the Etype is a subtype which is nominally
690 unconstrained. But remove any padding from the resulting type. */
691 if (TREE_CODE (TREE_TYPE (gnu_result
)) == FUNCTION_TYPE
692 || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type
))
694 gnu_result_type
= TREE_TYPE (gnu_result
);
695 if (TREE_CODE (gnu_result_type
) == RECORD_TYPE
696 && TYPE_IS_PADDING_P (gnu_result_type
))
697 gnu_result_type
= TREE_TYPE (TYPE_FIELDS (gnu_result_type
));
700 /* If we have a constant declaration and its initializer at hand,
701 try to return the latter to avoid the need to call fold in lots
702 of places and the need of elaboration code if this Id is used as
703 an initializer itself. */
704 if (TREE_CONSTANT (gnu_result
)
705 && DECL_P (gnu_result
)
706 && DECL_INITIAL (gnu_result
))
709 = (TREE_CODE (gnu_result
) == CONST_DECL
710 ? DECL_CONST_CORRESPONDING_VAR (gnu_result
) : gnu_result
);
712 /* If there is a corresponding variable, we only want to return
713 the CST value if an lvalue is not required. Evaluate this
714 now if we have not already done so. */
715 if (object
&& require_lvalue
< 0)
716 require_lvalue
= lvalue_required_p (gnat_node
, gnu_result_type
,
717 Is_Aliased (gnat_temp
));
719 if (!object
|| !require_lvalue
)
720 gnu_result
= unshare_expr (DECL_INITIAL (gnu_result
));
723 *gnu_result_type_p
= gnu_result_type
;
727 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
728 any statements we generate. */
731 Pragma_to_gnu (Node_Id gnat_node
)
734 tree gnu_result
= alloc_stmt_list ();
736 /* Check for (and ignore) unrecognized pragma and do nothing if we are just
738 if (type_annotate_only
739 || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node
))))
742 switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node
))))
744 case Pragma_Inspection_Point
:
745 /* Do nothing at top level: all such variables are already viewable. */
746 if (global_bindings_p ())
749 for (gnat_temp
= First (Pragma_Argument_Associations (gnat_node
));
751 gnat_temp
= Next (gnat_temp
))
753 Node_Id gnat_expr
= Expression (gnat_temp
);
754 tree gnu_expr
= gnat_to_gnu (gnat_expr
);
756 enum machine_mode mode
;
757 tree asm_constraint
= NULL_TREE
;
758 #ifdef ASM_COMMENT_START
762 if (TREE_CODE (gnu_expr
) == UNCONSTRAINED_ARRAY_REF
)
763 gnu_expr
= TREE_OPERAND (gnu_expr
, 0);
765 /* Use the value only if it fits into a normal register,
766 otherwise use the address. */
767 mode
= TYPE_MODE (TREE_TYPE (gnu_expr
));
768 use_address
= ((GET_MODE_CLASS (mode
) != MODE_INT
769 && GET_MODE_CLASS (mode
) != MODE_PARTIAL_INT
)
770 || GET_MODE_SIZE (mode
) > UNITS_PER_WORD
);
773 gnu_expr
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
775 #ifdef ASM_COMMENT_START
776 comment
= concat (ASM_COMMENT_START
,
777 " inspection point: ",
778 Get_Name_String (Chars (gnat_expr
)),
779 use_address
? " address" : "",
782 asm_constraint
= build_string (strlen (comment
), comment
);
785 gnu_expr
= build4 (ASM_EXPR
, void_type_node
,
789 (build_tree_list (NULL_TREE
,
790 build_string (1, "g")),
791 gnu_expr
, NULL_TREE
),
793 ASM_VOLATILE_P (gnu_expr
) = 1;
794 set_expr_location_from_node (gnu_expr
, gnat_node
);
795 append_to_statement_list (gnu_expr
, &gnu_result
);
799 case Pragma_Optimize
:
800 switch (Chars (Expression
801 (First (Pragma_Argument_Associations (gnat_node
)))))
803 case Name_Time
: case Name_Space
:
805 post_error ("insufficient -O value?", gnat_node
);
810 post_error ("must specify -O0?", gnat_node
);
818 case Pragma_Reviewable
:
819 if (write_symbols
== NO_DEBUG
)
820 post_error ("must specify -g?", gnat_node
);
827 /* Issue an error message if GNAT_NODE references an eliminated entity. */
830 check_for_eliminated_entity (Node_Id gnat_node
)
832 switch (Nkind (gnat_node
))
835 case N_Operator_Symbol
:
836 case N_Expanded_Name
:
837 case N_Attribute_Reference
:
838 if (Is_Eliminated (Entity (gnat_node
)))
839 Eliminate_Error_Msg (gnat_node
, Entity (gnat_node
));
844 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Attribute,
845 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
846 where we should place the result type. ATTRIBUTE is the attribute ID. */
849 Attribute_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
, int attribute
)
851 tree gnu_result
= error_mark_node
;
852 tree gnu_result_type
;
854 bool prefix_unused
= false;
855 tree gnu_prefix
= gnat_to_gnu (Prefix (gnat_node
));
856 tree gnu_type
= TREE_TYPE (gnu_prefix
);
858 /* If the input is a NULL_EXPR, make a new one. */
859 if (TREE_CODE (gnu_prefix
) == NULL_EXPR
)
861 *gnu_result_type_p
= get_unpadded_type (Etype (gnat_node
));
862 return build1 (NULL_EXPR
, *gnu_result_type_p
,
863 TREE_OPERAND (gnu_prefix
, 0));
870 /* These are just conversions until since representation clauses for
871 enumerations are handled in the front end. */
873 bool checkp
= Do_Range_Check (First (Expressions (gnat_node
)));
875 gnu_result
= gnat_to_gnu (First (Expressions (gnat_node
)));
876 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
877 gnu_result
= convert_with_check (Etype (gnat_node
), gnu_result
,
878 checkp
, checkp
, true);
884 /* These just add or subject the constant 1. Representation clauses for
885 enumerations are handled in the front-end. */
886 gnu_expr
= gnat_to_gnu (First (Expressions (gnat_node
)));
887 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
889 if (Do_Range_Check (First (Expressions (gnat_node
))))
891 gnu_expr
= protect_multiple_eval (gnu_expr
);
894 (build_binary_op (EQ_EXPR
, integer_type_node
,
896 attribute
== Attr_Pred
897 ? TYPE_MIN_VALUE (gnu_result_type
)
898 : TYPE_MAX_VALUE (gnu_result_type
)),
899 gnu_expr
, CE_Range_Check_Failed
);
903 = build_binary_op (attribute
== Attr_Pred
904 ? MINUS_EXPR
: PLUS_EXPR
,
905 gnu_result_type
, gnu_expr
,
906 convert (gnu_result_type
, integer_one_node
));
910 case Attr_Unrestricted_Access
:
911 /* Conversions don't change something's address but can cause us to miss
912 the COMPONENT_REF case below, so strip them off. */
913 gnu_prefix
= remove_conversions (gnu_prefix
,
914 !Must_Be_Byte_Aligned (gnat_node
));
916 /* If we are taking 'Address of an unconstrained object, this is the
917 pointer to the underlying array. */
918 if (attribute
== Attr_Address
)
919 gnu_prefix
= maybe_unconstrained_array (gnu_prefix
);
921 /* If we are building a static dispatch table, we have to honor
922 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
923 with the C++ ABI. We do it in the non-static case as well,
924 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
925 else if (TARGET_VTABLE_USES_DESCRIPTORS
926 && Is_Dispatch_Table_Entity (Etype (gnat_node
)))
928 tree gnu_field
, gnu_list
= NULL_TREE
, t
;
929 /* Descriptors can only be built here for top-level functions. */
930 bool build_descriptor
= (global_bindings_p () != 0);
933 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
935 /* If we're not going to build the descriptor, we have to retrieve
936 the one which will be built by the linker (or by the compiler
937 later if a static chain is requested). */
938 if (!build_descriptor
)
940 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_prefix
);
941 gnu_result
= fold_convert (build_pointer_type (gnu_result_type
),
943 gnu_result
= build1 (INDIRECT_REF
, gnu_result_type
, gnu_result
);
946 for (gnu_field
= TYPE_FIELDS (gnu_result_type
), i
= 0;
947 i
< TARGET_VTABLE_USES_DESCRIPTORS
;
948 gnu_field
= TREE_CHAIN (gnu_field
), i
++)
950 if (build_descriptor
)
952 t
= build2 (FDESC_EXPR
, TREE_TYPE (gnu_field
), gnu_prefix
,
953 build_int_cst (NULL_TREE
, i
));
954 TREE_CONSTANT (t
) = 1;
957 t
= build3 (COMPONENT_REF
, ptr_void_ftype
, gnu_result
,
958 gnu_field
, NULL_TREE
);
960 gnu_list
= tree_cons (gnu_field
, t
, gnu_list
);
963 gnu_result
= gnat_build_constructor (gnu_result_type
, gnu_list
);
967 /* ... fall through ... */
970 case Attr_Unchecked_Access
:
971 case Attr_Code_Address
:
972 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
974 = build_unary_op (((attribute
== Attr_Address
975 || attribute
== Attr_Unrestricted_Access
)
976 && !Must_Be_Byte_Aligned (gnat_node
))
977 ? ATTR_ADDR_EXPR
: ADDR_EXPR
,
978 gnu_result_type
, gnu_prefix
);
980 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
981 don't try to build a trampoline. */
982 if (attribute
== Attr_Code_Address
)
984 check_for_eliminated_entity (Prefix (gnat_node
));
986 for (gnu_expr
= gnu_result
;
987 CONVERT_EXPR_P (gnu_expr
);
988 gnu_expr
= TREE_OPERAND (gnu_expr
, 0))
989 TREE_CONSTANT (gnu_expr
) = 1;
991 if (TREE_CODE (gnu_expr
) == ADDR_EXPR
)
992 TREE_NO_TRAMPOLINE (gnu_expr
) = TREE_CONSTANT (gnu_expr
) = 1;
995 /* For other address attributes applied to a nested function,
996 find an inner ADDR_EXPR and annotate it so that we can issue
997 a useful warning with -Wtrampolines. */
998 else if (TREE_CODE (TREE_TYPE (gnu_prefix
)) == FUNCTION_TYPE
)
1000 check_for_eliminated_entity (Prefix (gnat_node
));
1002 for (gnu_expr
= gnu_result
;
1003 CONVERT_EXPR_P (gnu_expr
);
1004 gnu_expr
= TREE_OPERAND (gnu_expr
, 0))
1007 if (TREE_CODE (gnu_expr
) == ADDR_EXPR
1008 && decl_function_context (TREE_OPERAND (gnu_expr
, 0)))
1010 set_expr_location_from_node (gnu_expr
, gnat_node
);
1012 /* Check that we're not violating the No_Implicit_Dynamic_Code
1013 restriction. Be conservative if we don't know anything
1014 about the trampoline strategy for the target. */
1015 Check_Implicit_Dynamic_Code_Allowed (gnat_node
);
1020 case Attr_Pool_Address
:
1023 tree gnu_ptr
= gnu_prefix
;
1025 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1027 /* If this is an unconstrained array, we know the object must have been
1028 allocated with the template in front of the object. So compute the
1030 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr
)))
1032 = convert (build_pointer_type
1033 (TYPE_OBJECT_RECORD_TYPE
1034 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr
)))),
1037 gnu_obj_type
= TREE_TYPE (TREE_TYPE (gnu_ptr
));
1038 if (TREE_CODE (gnu_obj_type
) == RECORD_TYPE
1039 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type
))
1041 tree gnu_char_ptr_type
= build_pointer_type (char_type_node
);
1042 tree gnu_pos
= byte_position (TYPE_FIELDS (gnu_obj_type
));
1043 tree gnu_byte_offset
1044 = convert (sizetype
,
1045 size_diffop (size_zero_node
, gnu_pos
));
1046 gnu_byte_offset
= fold_build1 (NEGATE_EXPR
, sizetype
, gnu_byte_offset
);
1048 gnu_ptr
= convert (gnu_char_ptr_type
, gnu_ptr
);
1049 gnu_ptr
= build_binary_op (POINTER_PLUS_EXPR
, gnu_char_ptr_type
,
1050 gnu_ptr
, gnu_byte_offset
);
1053 gnu_result
= convert (gnu_result_type
, gnu_ptr
);
1058 case Attr_Object_Size
:
1059 case Attr_Value_Size
:
1060 case Attr_Max_Size_In_Storage_Elements
:
1061 gnu_expr
= gnu_prefix
;
1063 /* Remove NOPS from gnu_expr and conversions from gnu_prefix.
1064 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1065 while (TREE_CODE (gnu_expr
) == NOP_EXPR
)
1066 gnu_expr
= TREE_OPERAND (gnu_expr
, 0);
1068 gnu_prefix
= remove_conversions (gnu_prefix
, true);
1069 prefix_unused
= true;
1070 gnu_type
= TREE_TYPE (gnu_prefix
);
1072 /* Replace an unconstrained array type with the type of the underlying
1073 array. We can't do this with a call to maybe_unconstrained_array
1074 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1075 use the record type that will be used to allocate the object and its
1077 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
1079 gnu_type
= TYPE_OBJECT_RECORD_TYPE (gnu_type
);
1080 if (attribute
!= Attr_Max_Size_In_Storage_Elements
)
1081 gnu_type
= TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type
)));
1084 /* If we're looking for the size of a field, return the field size.
1085 Otherwise, if the prefix is an object, or if 'Object_Size or
1086 'Max_Size_In_Storage_Elements has been specified, the result is the
1087 GCC size of the type. Otherwise, the result is the RM_Size of the
1089 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
)
1090 gnu_result
= DECL_SIZE (TREE_OPERAND (gnu_prefix
, 1));
1091 else if (TREE_CODE (gnu_prefix
) != TYPE_DECL
1092 || attribute
== Attr_Object_Size
1093 || attribute
== Attr_Max_Size_In_Storage_Elements
)
1095 /* If this is a padded type, the GCC size isn't relevant to the
1096 programmer. Normally, what we want is the RM_Size, which was set
1097 from the specified size, but if it was not set, we want the size
1098 of the relevant field. Using the MAX of those two produces the
1099 right result in all case. Don't use the size of the field if it's
1100 a self-referential type, since that's never what's wanted. */
1101 if (TREE_CODE (gnu_type
) == RECORD_TYPE
1102 && TYPE_IS_PADDING_P (gnu_type
)
1103 && TREE_CODE (gnu_expr
) == COMPONENT_REF
)
1105 gnu_result
= rm_size (gnu_type
);
1106 if (!(CONTAINS_PLACEHOLDER_P
1107 (DECL_SIZE (TREE_OPERAND (gnu_expr
, 1)))))
1109 = size_binop (MAX_EXPR
, gnu_result
,
1110 DECL_SIZE (TREE_OPERAND (gnu_expr
, 1)));
1112 else if (Nkind (Prefix (gnat_node
)) == N_Explicit_Dereference
)
1114 Node_Id gnat_deref
= Prefix (gnat_node
);
1115 Node_Id gnat_actual_subtype
= Actual_Designated_Subtype (gnat_deref
);
1116 tree gnu_ptr_type
= TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref
)));
1117 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
)
1118 && Present (gnat_actual_subtype
))
1120 tree gnu_actual_obj_type
= gnat_to_gnu_type (gnat_actual_subtype
);
1121 gnu_type
= build_unc_object_type_from_ptr (gnu_ptr_type
,
1122 gnu_actual_obj_type
, get_identifier ("SIZE"));
1125 gnu_result
= TYPE_SIZE (gnu_type
);
1128 gnu_result
= TYPE_SIZE (gnu_type
);
1131 gnu_result
= rm_size (gnu_type
);
1133 gcc_assert (gnu_result
);
1135 /* Deal with a self-referential size by returning the maximum size for a
1136 type and by qualifying the size with the object for 'Size of an
1138 if (CONTAINS_PLACEHOLDER_P (gnu_result
))
1140 if (TREE_CODE (gnu_prefix
) != TYPE_DECL
)
1141 gnu_result
= substitute_placeholder_in_expr (gnu_result
, gnu_expr
);
1143 gnu_result
= max_size (gnu_result
, true);
1146 /* If the type contains a template, subtract its size. */
1147 if (TREE_CODE (gnu_type
) == RECORD_TYPE
1148 && TYPE_CONTAINS_TEMPLATE_P (gnu_type
))
1149 gnu_result
= size_binop (MINUS_EXPR
, gnu_result
,
1150 DECL_SIZE (TYPE_FIELDS (gnu_type
)));
1152 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1154 /* Always perform division using unsigned arithmetic as the size cannot
1155 be negative, but may be an overflowed positive value. This provides
1156 correct results for sizes up to 512 MB.
1158 ??? Size should be calculated in storage elements directly. */
1160 if (attribute
== Attr_Max_Size_In_Storage_Elements
)
1161 gnu_result
= convert (sizetype
,
1162 fold_build2 (CEIL_DIV_EXPR
, bitsizetype
,
1163 gnu_result
, bitsize_unit_node
));
1166 case Attr_Alignment
:
1167 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1168 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))
1170 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))))
1171 gnu_prefix
= TREE_OPERAND (gnu_prefix
, 0);
1173 gnu_type
= TREE_TYPE (gnu_prefix
);
1174 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1175 prefix_unused
= true;
1177 gnu_result
= size_int ((TREE_CODE (gnu_prefix
) == COMPONENT_REF
1178 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix
, 1))
1179 : TYPE_ALIGN (gnu_type
)) / BITS_PER_UNIT
);
1184 case Attr_Range_Length
:
1185 prefix_unused
= true;
1187 if (INTEGRAL_TYPE_P (gnu_type
) || TREE_CODE (gnu_type
) == REAL_TYPE
)
1189 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1191 if (attribute
== Attr_First
)
1192 gnu_result
= TYPE_MIN_VALUE (gnu_type
);
1193 else if (attribute
== Attr_Last
)
1194 gnu_result
= TYPE_MAX_VALUE (gnu_type
);
1198 (MAX_EXPR
, get_base_type (gnu_result_type
),
1200 (PLUS_EXPR
, get_base_type (gnu_result_type
),
1201 build_binary_op (MINUS_EXPR
,
1202 get_base_type (gnu_result_type
),
1203 convert (gnu_result_type
,
1204 TYPE_MAX_VALUE (gnu_type
)),
1205 convert (gnu_result_type
,
1206 TYPE_MIN_VALUE (gnu_type
))),
1207 convert (gnu_result_type
, integer_one_node
)),
1208 convert (gnu_result_type
, integer_zero_node
));
1213 /* ... fall through ... */
1217 int Dimension
= (Present (Expressions (gnat_node
))
1218 ? UI_To_Int (Intval (First (Expressions (gnat_node
))))
1220 struct parm_attr
*pa
= NULL
;
1221 Entity_Id gnat_param
= Empty
;
1223 /* Make sure any implicit dereference gets done. */
1224 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
1225 gnu_prefix
= maybe_unconstrained_array (gnu_prefix
);
1226 /* We treat unconstrained array In parameters specially. */
1227 if (Nkind (Prefix (gnat_node
)) == N_Identifier
1228 && !Is_Constrained (Etype (Prefix (gnat_node
)))
1229 && Ekind (Entity (Prefix (gnat_node
))) == E_In_Parameter
)
1230 gnat_param
= Entity (Prefix (gnat_node
));
1231 gnu_type
= TREE_TYPE (gnu_prefix
);
1232 prefix_unused
= true;
1233 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1235 if (TYPE_CONVENTION_FORTRAN_P (gnu_type
))
1240 for (ndim
= 1, gnu_type_temp
= gnu_type
;
1241 TREE_CODE (TREE_TYPE (gnu_type_temp
)) == ARRAY_TYPE
1242 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp
));
1243 ndim
++, gnu_type_temp
= TREE_TYPE (gnu_type_temp
))
1246 Dimension
= ndim
+ 1 - Dimension
;
1249 for (i
= 1; i
< Dimension
; i
++)
1250 gnu_type
= TREE_TYPE (gnu_type
);
1252 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
1254 /* When not optimizing, look up the slot associated with the parameter
1255 and the dimension in the cache and create a new one on failure. */
1256 if (!optimize
&& Present (gnat_param
))
1258 for (i
= 0; VEC_iterate (parm_attr
, f_parm_attr_cache
, i
, pa
); i
++)
1259 if (pa
->id
== gnat_param
&& pa
->dim
== Dimension
)
1264 pa
= GGC_CNEW (struct parm_attr
);
1265 pa
->id
= gnat_param
;
1266 pa
->dim
= Dimension
;
1267 VEC_safe_push (parm_attr
, gc
, f_parm_attr_cache
, pa
);
1271 /* Return the cached expression or build a new one. */
1272 if (attribute
== Attr_First
)
1274 if (pa
&& pa
->first
)
1276 gnu_result
= pa
->first
;
1281 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
)));
1284 else if (attribute
== Attr_Last
)
1288 gnu_result
= pa
->last
;
1293 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
)));
1296 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1298 if (pa
&& pa
->length
)
1300 gnu_result
= pa
->length
;
1305 /* We used to compute the length as max (hb - lb + 1, 0),
1306 which could overflow for some cases of empty arrays, e.g.
1307 when lb == index_type'first. We now compute the length as
1308 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1309 much rarer cases, for extremely large arrays we expect
1310 never to encounter in practice. In addition, the former
1311 computation required the use of potentially constraining
1312 signed arithmetic while the latter doesn't. Note that the
1313 comparison must be done in the original index base type,
1314 otherwise the conversion of either bound to gnu_compute_type
1317 tree gnu_compute_type
= get_base_type (gnu_result_type
);
1320 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
1322 = convert (gnu_compute_type
, TYPE_MIN_VALUE (index_type
));
1324 = convert (gnu_compute_type
, TYPE_MAX_VALUE (index_type
));
1328 (COND_EXPR
, gnu_compute_type
,
1329 build_binary_op (LT_EXPR
, get_base_type (index_type
),
1330 TYPE_MAX_VALUE (index_type
),
1331 TYPE_MIN_VALUE (index_type
)),
1332 convert (gnu_compute_type
, integer_zero_node
),
1334 (PLUS_EXPR
, gnu_compute_type
,
1335 build_binary_op (MINUS_EXPR
, gnu_compute_type
, hb
, lb
),
1336 convert (gnu_compute_type
, integer_one_node
)));
1340 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1341 handling. Note that these attributes could not have been used on
1342 an unconstrained array type. */
1343 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
,
1346 /* Cache the expression we have just computed. Since we want to do it
1347 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1348 create the temporary. */
1352 = build1 (SAVE_EXPR
, TREE_TYPE (gnu_result
), gnu_result
);
1353 TREE_SIDE_EFFECTS (gnu_result
) = 1;
1354 if (attribute
== Attr_First
)
1355 pa
->first
= gnu_result
;
1356 else if (attribute
== Attr_Last
)
1357 pa
->last
= gnu_result
;
1359 pa
->length
= gnu_result
;
1364 case Attr_Bit_Position
:
1366 case Attr_First_Bit
:
1370 HOST_WIDE_INT bitsize
;
1371 HOST_WIDE_INT bitpos
;
1373 tree gnu_field_bitpos
;
1374 tree gnu_field_offset
;
1376 enum machine_mode mode
;
1377 int unsignedp
, volatilep
;
1379 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1380 gnu_prefix
= remove_conversions (gnu_prefix
, true);
1381 prefix_unused
= true;
1383 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1384 the result is 0. Don't allow 'Bit on a bare component, though. */
1385 if (attribute
== Attr_Bit
1386 && TREE_CODE (gnu_prefix
) != COMPONENT_REF
1387 && TREE_CODE (gnu_prefix
) != FIELD_DECL
)
1389 gnu_result
= integer_zero_node
;
1394 gcc_assert (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1395 || (attribute
== Attr_Bit_Position
1396 && TREE_CODE (gnu_prefix
) == FIELD_DECL
));
1398 get_inner_reference (gnu_prefix
, &bitsize
, &bitpos
, &gnu_offset
,
1399 &mode
, &unsignedp
, &volatilep
, false);
1401 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
)
1403 gnu_field_bitpos
= bit_position (TREE_OPERAND (gnu_prefix
, 1));
1404 gnu_field_offset
= byte_position (TREE_OPERAND (gnu_prefix
, 1));
1406 for (gnu_inner
= TREE_OPERAND (gnu_prefix
, 0);
1407 TREE_CODE (gnu_inner
) == COMPONENT_REF
1408 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner
, 1));
1409 gnu_inner
= TREE_OPERAND (gnu_inner
, 0))
1412 = size_binop (PLUS_EXPR
, gnu_field_bitpos
,
1413 bit_position (TREE_OPERAND (gnu_inner
, 1)));
1415 = size_binop (PLUS_EXPR
, gnu_field_offset
,
1416 byte_position (TREE_OPERAND (gnu_inner
, 1)));
1419 else if (TREE_CODE (gnu_prefix
) == FIELD_DECL
)
1421 gnu_field_bitpos
= bit_position (gnu_prefix
);
1422 gnu_field_offset
= byte_position (gnu_prefix
);
1426 gnu_field_bitpos
= bitsize_zero_node
;
1427 gnu_field_offset
= size_zero_node
;
1433 gnu_result
= gnu_field_offset
;
1436 case Attr_First_Bit
:
1438 gnu_result
= size_int (bitpos
% BITS_PER_UNIT
);
1442 gnu_result
= bitsize_int (bitpos
% BITS_PER_UNIT
);
1443 gnu_result
= size_binop (PLUS_EXPR
, gnu_result
,
1444 TYPE_SIZE (TREE_TYPE (gnu_prefix
)));
1445 gnu_result
= size_binop (MINUS_EXPR
, gnu_result
,
1449 case Attr_Bit_Position
:
1450 gnu_result
= gnu_field_bitpos
;
1454 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1456 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
, gnu_prefix
);
1463 tree gnu_lhs
= gnat_to_gnu (First (Expressions (gnat_node
)));
1464 tree gnu_rhs
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
1466 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1467 gnu_result
= build_binary_op (attribute
== Attr_Min
1468 ? MIN_EXPR
: MAX_EXPR
,
1469 gnu_result_type
, gnu_lhs
, gnu_rhs
);
1473 case Attr_Passed_By_Reference
:
1474 gnu_result
= size_int (default_pass_by_ref (gnu_type
)
1475 || must_pass_by_ref (gnu_type
));
1476 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1479 case Attr_Component_Size
:
1480 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1481 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))
1483 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))))
1484 gnu_prefix
= TREE_OPERAND (gnu_prefix
, 0);
1486 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
1487 gnu_type
= TREE_TYPE (gnu_prefix
);
1489 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
1490 gnu_type
= TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type
))));
1492 while (TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
1493 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
)))
1494 gnu_type
= TREE_TYPE (gnu_type
);
1496 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
1498 /* Note this size cannot be self-referential. */
1499 gnu_result
= TYPE_SIZE (TREE_TYPE (gnu_type
));
1500 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1501 prefix_unused
= true;
1504 case Attr_Null_Parameter
:
1505 /* This is just a zero cast to the pointer type for
1506 our prefix and dereferenced. */
1507 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1509 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
1510 convert (build_pointer_type (gnu_result_type
),
1511 integer_zero_node
));
1512 TREE_PRIVATE (gnu_result
) = 1;
1515 case Attr_Mechanism_Code
:
1518 Entity_Id gnat_obj
= Entity (Prefix (gnat_node
));
1520 prefix_unused
= true;
1521 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1522 if (Present (Expressions (gnat_node
)))
1524 int i
= UI_To_Int (Intval (First (Expressions (gnat_node
))));
1526 for (gnat_obj
= First_Formal (gnat_obj
); i
> 1;
1527 i
--, gnat_obj
= Next_Formal (gnat_obj
))
1531 code
= Mechanism (gnat_obj
);
1532 if (code
== Default
)
1533 code
= ((present_gnu_tree (gnat_obj
)
1534 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj
))
1535 || ((TREE_CODE (get_gnu_tree (gnat_obj
))
1537 && (DECL_BY_COMPONENT_PTR_P
1538 (get_gnu_tree (gnat_obj
))))))
1539 ? By_Reference
: By_Copy
);
1540 gnu_result
= convert (gnu_result_type
, size_int (- code
));
1545 /* Say we have an unimplemented attribute. Then set the value to be
1546 returned to be a zero and hope that's something we can convert to the
1547 type of this attribute. */
1548 post_error ("unimplemented attribute", gnat_node
);
1549 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1550 gnu_result
= integer_zero_node
;
1554 /* If this is an attribute where the prefix was unused, force a use of it if
1555 it has a side-effect. But don't do it if the prefix is just an entity
1556 name. However, if an access check is needed, we must do it. See second
1557 example in AARM 11.6(5.e). */
1558 if (prefix_unused
&& TREE_SIDE_EFFECTS (gnu_prefix
)
1559 && !Is_Entity_Name (Prefix (gnat_node
)))
1560 gnu_result
= fold_build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_result
),
1561 gnu_prefix
, gnu_result
);
1563 *gnu_result_type_p
= gnu_result_type
;
1567 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1568 to a GCC tree, which is returned. */
1571 Case_Statement_to_gnu (Node_Id gnat_node
)
1577 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
1578 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1580 /* The range of values in a case statement is determined by the rules in
1581 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1582 of the expression. One exception arises in the case of a simple name that
1583 is parenthesized. This still has the Etype of the name, but since it is
1584 not a name, para 7 does not apply, and we need to go to the base type.
1585 This is the only case where parenthesization affects the dynamic
1586 semantics (i.e. the range of possible values at runtime that is covered
1587 by the others alternative.
1589 Another exception is if the subtype of the expression is non-static. In
1590 that case, we also have to use the base type. */
1591 if (Paren_Count (Expression (gnat_node
)) != 0
1592 || !Is_OK_Static_Subtype (Underlying_Type
1593 (Etype (Expression (gnat_node
)))))
1594 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1596 /* We build a SWITCH_EXPR that contains the code with interspersed
1597 CASE_LABEL_EXPRs for each label. */
1599 push_stack (&gnu_switch_label_stack
, NULL_TREE
, create_artificial_label ());
1600 start_stmt_group ();
1601 for (gnat_when
= First_Non_Pragma (Alternatives (gnat_node
));
1602 Present (gnat_when
);
1603 gnat_when
= Next_Non_Pragma (gnat_when
))
1605 Node_Id gnat_choice
;
1606 int choices_added
= 0;
1608 /* First compile all the different case choices for the current WHEN
1610 for (gnat_choice
= First (Discrete_Choices (gnat_when
));
1611 Present (gnat_choice
); gnat_choice
= Next (gnat_choice
))
1613 tree gnu_low
= NULL_TREE
, gnu_high
= NULL_TREE
;
1615 switch (Nkind (gnat_choice
))
1618 gnu_low
= gnat_to_gnu (Low_Bound (gnat_choice
));
1619 gnu_high
= gnat_to_gnu (High_Bound (gnat_choice
));
1622 case N_Subtype_Indication
:
1623 gnu_low
= gnat_to_gnu (Low_Bound (Range_Expression
1624 (Constraint (gnat_choice
))));
1625 gnu_high
= gnat_to_gnu (High_Bound (Range_Expression
1626 (Constraint (gnat_choice
))));
1630 case N_Expanded_Name
:
1631 /* This represents either a subtype range or a static value of
1632 some kind; Ekind says which. */
1633 if (IN (Ekind (Entity (gnat_choice
)), Type_Kind
))
1635 tree gnu_type
= get_unpadded_type (Entity (gnat_choice
));
1637 gnu_low
= fold (TYPE_MIN_VALUE (gnu_type
));
1638 gnu_high
= fold (TYPE_MAX_VALUE (gnu_type
));
1642 /* ... fall through ... */
1644 case N_Character_Literal
:
1645 case N_Integer_Literal
:
1646 gnu_low
= gnat_to_gnu (gnat_choice
);
1649 case N_Others_Choice
:
1656 /* If the case value is a subtype that raises Constraint_Error at
1657 run-time because of a wrong bound, then gnu_low or gnu_high is
1658 not translated into an INTEGER_CST. In such a case, we need
1659 to ensure that the when statement is not added in the tree,
1660 otherwise it will crash the gimplifier. */
1661 if ((!gnu_low
|| TREE_CODE (gnu_low
) == INTEGER_CST
)
1662 && (!gnu_high
|| TREE_CODE (gnu_high
) == INTEGER_CST
))
1664 add_stmt_with_node (build3 (CASE_LABEL_EXPR
, void_type_node
,
1666 create_artificial_label ()),
1672 /* Push a binding level here in case variables are declared as we want
1673 them to be local to this set of statements instead of to the block
1674 containing the Case statement. */
1675 if (choices_added
> 0)
1677 add_stmt (build_stmt_group (Statements (gnat_when
), true));
1678 add_stmt (build1 (GOTO_EXPR
, void_type_node
,
1679 TREE_VALUE (gnu_switch_label_stack
)));
1683 /* Now emit a definition of the label all the cases branched to. */
1684 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
1685 TREE_VALUE (gnu_switch_label_stack
)));
1686 gnu_result
= build3 (SWITCH_EXPR
, TREE_TYPE (gnu_expr
), gnu_expr
,
1687 end_stmt_group (), NULL_TREE
);
1688 pop_stack (&gnu_switch_label_stack
);
1693 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1694 to a GCC tree, which is returned. */
1697 Loop_Statement_to_gnu (Node_Id gnat_node
)
1699 /* ??? It would be nice to use "build" here, but there's no build5. */
1700 tree gnu_loop_stmt
= build_nt (LOOP_STMT
, NULL_TREE
, NULL_TREE
,
1701 NULL_TREE
, NULL_TREE
, NULL_TREE
);
1702 tree gnu_loop_var
= NULL_TREE
;
1703 Node_Id gnat_iter_scheme
= Iteration_Scheme (gnat_node
);
1704 tree gnu_cond_expr
= NULL_TREE
;
1707 TREE_TYPE (gnu_loop_stmt
) = void_type_node
;
1708 TREE_SIDE_EFFECTS (gnu_loop_stmt
) = 1;
1709 LOOP_STMT_LABEL (gnu_loop_stmt
) = create_artificial_label ();
1710 set_expr_location_from_node (gnu_loop_stmt
, gnat_node
);
1711 Sloc_to_locus (Sloc (End_Label (gnat_node
)),
1712 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt
)));
1714 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1715 N_Exit_Statement can find it. */
1716 push_stack (&gnu_loop_label_stack
, NULL_TREE
,
1717 LOOP_STMT_LABEL (gnu_loop_stmt
));
1719 /* Set the condition under which the loop must keep going.
1720 For the case "LOOP .... END LOOP;" the condition is always true. */
1721 if (No (gnat_iter_scheme
))
1724 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1725 else if (Present (Condition (gnat_iter_scheme
)))
1726 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1727 = gnat_to_gnu (Condition (gnat_iter_scheme
));
1729 /* Otherwise we have an iteration scheme and the condition is given by
1730 the bounds of the subtype of the iteration variable. */
1733 Node_Id gnat_loop_spec
= Loop_Parameter_Specification (gnat_iter_scheme
);
1734 Entity_Id gnat_loop_var
= Defining_Entity (gnat_loop_spec
);
1735 Entity_Id gnat_type
= Etype (gnat_loop_var
);
1736 tree gnu_type
= get_unpadded_type (gnat_type
);
1737 tree gnu_low
= TYPE_MIN_VALUE (gnu_type
);
1738 tree gnu_high
= TYPE_MAX_VALUE (gnu_type
);
1739 tree gnu_first
, gnu_last
, gnu_limit
;
1740 enum tree_code update_code
, end_code
;
1741 tree gnu_base_type
= get_base_type (gnu_type
);
1743 /* We must disable modulo reduction for the loop variable, if any,
1744 in order for the loop comparison to be effective. */
1745 if (Reverse_Present (gnat_loop_spec
))
1747 gnu_first
= gnu_high
;
1749 update_code
= MINUS_NOMOD_EXPR
;
1751 gnu_limit
= TYPE_MIN_VALUE (gnu_base_type
);
1755 gnu_first
= gnu_low
;
1756 gnu_last
= gnu_high
;
1757 update_code
= PLUS_NOMOD_EXPR
;
1759 gnu_limit
= TYPE_MAX_VALUE (gnu_base_type
);
1762 /* We know the loop variable will not overflow if GNU_LAST is a constant
1763 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1764 the limit test to the end of the loop. In that case, we have to test
1765 for an empty loop outside the loop. */
1766 if (TREE_CODE (gnu_last
) != INTEGER_CST
1767 || TREE_CODE (gnu_limit
) != INTEGER_CST
1768 || tree_int_cst_equal (gnu_last
, gnu_limit
))
1771 = build3 (COND_EXPR
, void_type_node
,
1772 build_binary_op (LE_EXPR
, integer_type_node
,
1774 NULL_TREE
, alloc_stmt_list ());
1775 set_expr_location_from_node (gnu_cond_expr
, gnat_loop_spec
);
1778 /* Open a new nesting level that will surround the loop to declare the
1779 loop index variable. */
1780 start_stmt_group ();
1783 /* Declare the loop index and set it to its initial value. */
1784 gnu_loop_var
= gnat_to_gnu_entity (gnat_loop_var
, gnu_first
, 1);
1785 if (DECL_BY_REF_P (gnu_loop_var
))
1786 gnu_loop_var
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_loop_var
);
1788 /* The loop variable might be a padded type, so use `convert' to get a
1789 reference to the inner variable if so. */
1790 gnu_loop_var
= convert (get_base_type (gnu_type
), gnu_loop_var
);
1792 /* Set either the top or bottom exit condition as appropriate depending
1793 on whether or not we know an overflow cannot occur. */
1795 LOOP_STMT_BOT_COND (gnu_loop_stmt
)
1796 = build_binary_op (NE_EXPR
, integer_type_node
,
1797 gnu_loop_var
, gnu_last
);
1799 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1800 = build_binary_op (end_code
, integer_type_node
,
1801 gnu_loop_var
, gnu_last
);
1803 LOOP_STMT_UPDATE (gnu_loop_stmt
)
1804 = build_binary_op (MODIFY_EXPR
, NULL_TREE
,
1806 build_binary_op (update_code
,
1807 TREE_TYPE (gnu_loop_var
),
1809 convert (TREE_TYPE (gnu_loop_var
),
1810 integer_one_node
)));
1811 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt
),
1815 /* If the loop was named, have the name point to this loop. In this case,
1816 the association is not a ..._DECL node, but the end label from this
1818 if (Present (Identifier (gnat_node
)))
1819 save_gnu_tree (Entity (Identifier (gnat_node
)),
1820 LOOP_STMT_LABEL (gnu_loop_stmt
), true);
1822 /* Make the loop body into its own block, so any allocated storage will be
1823 released every iteration. This is needed for stack allocation. */
1824 LOOP_STMT_BODY (gnu_loop_stmt
)
1825 = build_stmt_group (Statements (gnat_node
), true);
1827 /* If we declared a variable, then we are in a statement group for that
1828 declaration. Add the LOOP_STMT to it and make that the "loop". */
1831 add_stmt (gnu_loop_stmt
);
1833 gnu_loop_stmt
= end_stmt_group ();
1836 /* If we have an outer COND_EXPR, that's our result and this loop is its
1837 "true" statement. Otherwise, the result is the LOOP_STMT. */
1840 COND_EXPR_THEN (gnu_cond_expr
) = gnu_loop_stmt
;
1841 gnu_result
= gnu_cond_expr
;
1842 recalculate_side_effects (gnu_cond_expr
);
1845 gnu_result
= gnu_loop_stmt
;
1847 pop_stack (&gnu_loop_label_stack
);
1852 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
1853 handler for the current function. */
1855 /* This is implemented by issuing a call to the appropriate VMS specific
1856 builtin. To avoid having VMS specific sections in the global gigi decls
1857 array, we maintain the decls of interest here. We can't declare them
1858 inside the function because we must mark them never to be GC'd, which we
1859 can only do at the global level. */
1861 static GTY(()) tree vms_builtin_establish_handler_decl
= NULL_TREE
;
1862 static GTY(()) tree gnat_vms_condition_handler_decl
= NULL_TREE
;
1865 establish_gnat_vms_condition_handler (void)
1867 tree establish_stmt
;
1869 /* Elaborate the required decls on the first call. Check on the decl for
1870 the gnat condition handler to decide, as this is one we create so we are
1871 sure that it will be non null on subsequent calls. The builtin decl is
1872 looked up so remains null on targets where it is not implemented yet. */
1873 if (gnat_vms_condition_handler_decl
== NULL_TREE
)
1875 vms_builtin_establish_handler_decl
1877 (get_identifier ("__builtin_establish_vms_condition_handler"));
1879 gnat_vms_condition_handler_decl
1880 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
1882 build_function_type_list (integer_type_node
,
1886 NULL_TREE
, 0, 1, 1, 0, Empty
);
1889 /* Do nothing if the establish builtin is not available, which might happen
1890 on targets where the facility is not implemented. */
1891 if (vms_builtin_establish_handler_decl
== NULL_TREE
)
1895 = build_call_1_expr (vms_builtin_establish_handler_decl
,
1897 (ADDR_EXPR
, NULL_TREE
,
1898 gnat_vms_condition_handler_decl
));
1900 add_stmt (establish_stmt
);
1903 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
1904 don't return anything. */
1907 Subprogram_Body_to_gnu (Node_Id gnat_node
)
1909 /* Defining identifier of a parameter to the subprogram. */
1910 Entity_Id gnat_param
;
1911 /* The defining identifier for the subprogram body. Note that if a
1912 specification has appeared before for this body, then the identifier
1913 occurring in that specification will also be a defining identifier and all
1914 the calls to this subprogram will point to that specification. */
1915 Entity_Id gnat_subprog_id
1916 = (Present (Corresponding_Spec (gnat_node
))
1917 ? Corresponding_Spec (gnat_node
) : Defining_Entity (gnat_node
));
1918 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
1919 tree gnu_subprog_decl
;
1920 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
1921 tree gnu_subprog_type
;
1924 VEC(parm_attr
,gc
) *cache
;
1926 /* If this is a generic object or if it has been eliminated,
1928 if (Ekind (gnat_subprog_id
) == E_Generic_Procedure
1929 || Ekind (gnat_subprog_id
) == E_Generic_Function
1930 || Is_Eliminated (gnat_subprog_id
))
1933 /* If this subprogram acts as its own spec, define it. Otherwise, just get
1934 the already-elaborated tree node. However, if this subprogram had its
1935 elaboration deferred, we will already have made a tree node for it. So
1936 treat it as not being defined in that case. Such a subprogram cannot
1937 have an address clause or a freeze node, so this test is safe, though it
1938 does disable some otherwise-useful error checking. */
1940 = gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
,
1941 Acts_As_Spec (gnat_node
)
1942 && !present_gnu_tree (gnat_subprog_id
));
1944 gnu_subprog_type
= TREE_TYPE (gnu_subprog_decl
);
1946 /* Propagate the debug mode. */
1947 if (!Needs_Debug_Info (gnat_subprog_id
))
1948 DECL_IGNORED_P (gnu_subprog_decl
) = 1;
1950 /* Set the line number in the decl to correspond to that of the body so that
1951 the line number notes are written correctly. */
1952 Sloc_to_locus (Sloc (gnat_node
), &DECL_SOURCE_LOCATION (gnu_subprog_decl
));
1954 /* Initialize the information structure for the function. */
1955 allocate_struct_function (gnu_subprog_decl
, false);
1956 DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
1957 = GGC_CNEW (struct language_function
);
1959 begin_subprog_body (gnu_subprog_decl
);
1960 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
1962 /* If there are Out parameters, we need to ensure that the return statement
1963 properly copies them out. We do this by making a new block and converting
1964 any inner return into a goto to a label at the end of the block. */
1965 push_stack (&gnu_return_label_stack
, NULL_TREE
,
1966 gnu_cico_list
? create_artificial_label () : NULL_TREE
);
1968 /* Get a tree corresponding to the code for the subprogram. */
1969 start_stmt_group ();
1972 /* See if there are any parameters for which we don't yet have GCC entities.
1973 These must be for Out parameters for which we will be making VAR_DECL
1974 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
1975 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
1976 the order of the parameters. */
1977 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
1978 Present (gnat_param
);
1979 gnat_param
= Next_Formal_With_Extras (gnat_param
))
1980 if (!present_gnu_tree (gnat_param
))
1982 /* Skip any entries that have been already filled in; they must
1983 correspond to In Out parameters. */
1984 for (; gnu_cico_list
&& TREE_VALUE (gnu_cico_list
);
1985 gnu_cico_list
= TREE_CHAIN (gnu_cico_list
))
1988 /* Do any needed references for padded types. */
1989 TREE_VALUE (gnu_cico_list
)
1990 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list
)),
1991 gnat_to_gnu_entity (gnat_param
, NULL_TREE
, 1));
1994 /* On VMS, establish our condition handler to possibly turn a condition into
1995 the corresponding exception if the subprogram has a foreign convention or
1998 To ensure proper execution of local finalizations on condition instances,
1999 we must turn a condition into the corresponding exception even if there
2000 is no applicable Ada handler, and need at least one condition handler per
2001 possible call chain involving GNAT code. OTOH, establishing the handler
2002 has a cost so we want to minimize the number of subprograms into which
2003 this happens. The foreign or exported condition is expected to satisfy
2004 all the constraints. */
2005 if (TARGET_ABI_OPEN_VMS
2006 && (Has_Foreign_Convention (gnat_node
) || Is_Exported (gnat_node
)))
2007 establish_gnat_vms_condition_handler ();
2009 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
2011 /* Generate the code of the subprogram itself. A return statement will be
2012 present and any Out parameters will be handled there. */
2013 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
2015 gnu_result
= end_stmt_group ();
2017 /* If we populated the parameter attributes cache, we need to make sure
2018 that the cached expressions are evaluated on all possible paths. */
2019 cache
= DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
->parm_attr_cache
;
2022 struct parm_attr
*pa
;
2025 start_stmt_group ();
2027 for (i
= 0; VEC_iterate (parm_attr
, cache
, i
, pa
); i
++)
2030 add_stmt_with_node (pa
->first
, gnat_node
);
2032 add_stmt_with_node (pa
->last
, gnat_node
);
2034 add_stmt_with_node (pa
->length
, gnat_node
);
2037 add_stmt (gnu_result
);
2038 gnu_result
= end_stmt_group ();
2041 /* If we made a special return label, we need to make a block that contains
2042 the definition of that label and the copying to the return value. That
2043 block first contains the function, then the label and copy statement. */
2044 if (TREE_VALUE (gnu_return_label_stack
))
2048 start_stmt_group ();
2050 add_stmt (gnu_result
);
2051 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
2052 TREE_VALUE (gnu_return_label_stack
)));
2054 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2055 if (list_length (gnu_cico_list
) == 1)
2056 gnu_retval
= TREE_VALUE (gnu_cico_list
);
2058 gnu_retval
= gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
2061 if (DECL_P (gnu_retval
) && DECL_BY_REF_P (gnu_retval
))
2062 gnu_retval
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_retval
);
2065 (build_return_expr (DECL_RESULT (gnu_subprog_decl
), gnu_retval
),
2066 End_Label (Handled_Statement_Sequence (gnat_node
)));
2068 gnu_result
= end_stmt_group ();
2071 pop_stack (&gnu_return_label_stack
);
2073 /* Set the end location. */
2075 ((Present (End_Label (Handled_Statement_Sequence (gnat_node
)))
2076 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node
)))
2077 : Sloc (gnat_node
)),
2078 &DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->function_end_locus
);
2080 end_subprog_body (gnu_result
, false);
2082 /* Disconnect the trees for parameters that we made variables for from the
2083 GNAT entities since these are unusable after we end the function. */
2084 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
2085 Present (gnat_param
);
2086 gnat_param
= Next_Formal_With_Extras (gnat_param
))
2087 if (TREE_CODE (get_gnu_tree (gnat_param
)) == VAR_DECL
)
2088 save_gnu_tree (gnat_param
, NULL_TREE
, false);
2090 if (DECL_FUNCTION_STUB (gnu_subprog_decl
))
2091 build_function_stub (gnu_subprog_decl
, gnat_subprog_id
);
2093 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node
)));
2096 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2097 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2098 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2099 If GNU_TARGET is non-null, this must be a function call and the result
2100 of the call is to be placed into that object. */
2103 call_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
, tree gnu_target
)
2106 /* The GCC node corresponding to the GNAT subprogram name. This can either
2107 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2108 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2110 tree gnu_subprog_node
= gnat_to_gnu (Name (gnat_node
));
2111 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2112 tree gnu_subprog_type
= TREE_TYPE (gnu_subprog_node
);
2113 tree gnu_subprog_addr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2115 Entity_Id gnat_formal
;
2116 Node_Id gnat_actual
;
2117 tree gnu_actual_list
= NULL_TREE
;
2118 tree gnu_name_list
= NULL_TREE
;
2119 tree gnu_before_list
= NULL_TREE
;
2120 tree gnu_after_list
= NULL_TREE
;
2121 tree gnu_subprog_call
;
2123 check_for_eliminated_entity (Name (gnat_node
));
2125 gcc_assert (TREE_CODE (gnu_subprog_type
) == FUNCTION_TYPE
);
2127 /* If we are calling a stubbed function, make this into a raise of
2128 Program_Error. Elaborate all our args first. */
2129 if (TREE_CODE (gnu_subprog_node
) == FUNCTION_DECL
2130 && DECL_STUBBED_P (gnu_subprog_node
))
2132 for (gnat_actual
= First_Actual (gnat_node
);
2133 Present (gnat_actual
);
2134 gnat_actual
= Next_Actual (gnat_actual
))
2135 add_stmt (gnat_to_gnu (gnat_actual
));
2139 = build_call_raise (PE_Stubbed_Subprogram_Called
, gnat_node
,
2140 N_Raise_Program_Error
);
2142 if (Nkind (gnat_node
) == N_Function_Call
&& !gnu_target
)
2144 *gnu_result_type_p
= TREE_TYPE (gnu_subprog_type
);
2145 return build1 (NULL_EXPR
, *gnu_result_type_p
, call_expr
);
2152 /* If we are calling by supplying a pointer to a target, set up that
2153 pointer as the first argument. Use GNU_TARGET if one was passed;
2154 otherwise, make a target by building a variable of the maximum size
2156 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2158 tree gnu_real_ret_type
2159 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2164 = maybe_pad_type (gnu_real_ret_type
,
2165 max_size (TYPE_SIZE (gnu_real_ret_type
), true),
2166 0, Etype (Name (gnat_node
)), "PAD", false,
2169 /* ??? We may be about to create a static temporary if we happen to
2170 be at the global binding level. That's a regression from what
2171 the 3.x back-end would generate in the same situation, but we
2172 don't have a mechanism in Gigi for creating automatic variables
2173 in the elaboration routines. */
2175 = create_var_decl (create_tmp_var_name ("LR"), NULL
, gnu_obj_type
,
2176 NULL
, false, false, false, false, NULL
,
2181 = tree_cons (NULL_TREE
,
2182 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2183 unchecked_convert (gnu_real_ret_type
,
2190 /* The only way we can be making a call via an access type is if Name is an
2191 explicit dereference. In that case, get the list of formal args from the
2192 type the access type is pointing to. Otherwise, get the formals from
2193 entity being called. */
2194 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2195 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2196 else if (Nkind (Name (gnat_node
)) == N_Attribute_Reference
)
2197 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2200 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2202 /* Create the list of the actual parameters as GCC expects it, namely a chain
2203 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2204 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2205 parameters not passed by reference and don't need to be copied in. */
2206 for (gnat_actual
= First_Actual (gnat_node
);
2207 Present (gnat_actual
);
2208 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2209 gnat_actual
= Next_Actual (gnat_actual
))
2212 = (present_gnu_tree (gnat_formal
)
2213 ? get_gnu_tree (gnat_formal
) : NULL_TREE
);
2214 tree gnu_formal_type
= gnat_to_gnu_type (Etype (gnat_formal
));
2215 /* We must suppress conversions that can cause the creation of a
2216 temporary in the Out or In Out case because we need the real
2217 object in this case, either to pass its address if it's passed
2218 by reference or as target of the back copy done after the call
2219 if it uses the copy-in copy-out mechanism. We do it in the In
2220 case too, except for an unchecked conversion because it alone
2221 can cause the actual to be misaligned and the addressability
2222 test is applied to the real object. */
2223 bool suppress_type_conversion
2224 = ((Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
2225 && Ekind (gnat_formal
) != E_In_Parameter
)
2226 || (Nkind (gnat_actual
) == N_Type_Conversion
2227 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal
)))));
2228 Node_Id gnat_name
= (suppress_type_conversion
2229 ? Expression (gnat_actual
) : gnat_actual
);
2230 tree gnu_name
= gnat_to_gnu (gnat_name
), gnu_name_type
;
2233 /* If it's possible we may need to use this expression twice, make sure
2234 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2235 to force side-effects before the call.
2236 ??? This is more conservative than we need since we don't need to do
2237 this for pass-by-ref with no conversion. */
2238 if (Ekind (gnat_formal
) != E_In_Parameter
)
2239 gnu_name
= gnat_stabilize_reference (gnu_name
, true);
2241 /* If we are passing a non-addressable parameter by reference, pass the
2242 address of a copy. In the Out or In Out case, set up to copy back
2243 out after the call. */
2245 && (DECL_BY_REF_P (gnu_formal
)
2246 || (TREE_CODE (gnu_formal
) == PARM_DECL
2247 && (DECL_BY_COMPONENT_PTR_P (gnu_formal
)
2248 || (DECL_BY_DESCRIPTOR_P (gnu_formal
)))))
2249 && (gnu_name_type
= gnat_to_gnu_type (Etype (gnat_name
)))
2250 && !addressable_p (gnu_name
, gnu_name_type
))
2252 tree gnu_copy
= gnu_name
, gnu_temp
;
2254 /* If the type is by_reference, a copy is not allowed. */
2255 if (Is_By_Reference_Type (Etype (gnat_formal
)))
2257 ("misaligned actual cannot be passed by reference", gnat_actual
);
2259 /* For users of Starlet we issue a warning because the
2260 interface apparently assumes that by-ref parameters
2261 outlive the procedure invocation. The code still
2262 will not work as intended, but we cannot do much
2263 better since other low-level parts of the back-end
2264 would allocate temporaries at will because of the
2265 misalignment if we did not do so here. */
2266 else if (Is_Valued_Procedure (Entity (Name (gnat_node
))))
2269 ("?possible violation of implicit assumption", gnat_actual
);
2271 ("?made by pragma Import_Valued_Procedure on &", gnat_actual
,
2272 Entity (Name (gnat_node
)));
2273 post_error_ne ("?because of misalignment of &", gnat_actual
,
2277 /* Remove any unpadding from the object and reset the copy. */
2278 if (TREE_CODE (gnu_name
) == COMPONENT_REF
2279 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name
, 0)))
2281 && (TYPE_IS_PADDING_P
2282 (TREE_TYPE (TREE_OPERAND (gnu_name
, 0))))))
2283 gnu_name
= gnu_copy
= TREE_OPERAND (gnu_name
, 0);
2285 /* Otherwise convert to the nominal type of the object if it's
2286 a record type. There are several cases in which we need to
2287 make the temporary using this type instead of the actual type
2288 of the object if they are distinct, because the expectations
2289 of the callee would otherwise not be met:
2290 - if it's a justified modular type,
2291 - if the actual type is a smaller packable version of it. */
2292 else if (TREE_CODE (gnu_name_type
) == RECORD_TYPE
2293 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type
)
2294 || smaller_packable_type_p (TREE_TYPE (gnu_name
),
2296 gnu_name
= convert (gnu_name_type
, gnu_name
);
2298 /* Make a SAVE_EXPR to both properly account for potential side
2299 effects and handle the creation of a temporary copy. Special
2300 code in gnat_gimplify_expr ensures that the same temporary is
2301 used as the object and copied back after the call if needed. */
2302 gnu_name
= build1 (SAVE_EXPR
, TREE_TYPE (gnu_name
), gnu_name
);
2303 TREE_SIDE_EFFECTS (gnu_name
) = 1;
2305 /* Set up to move the copy back to the original. */
2306 if (Ekind (gnat_formal
) != E_In_Parameter
)
2308 gnu_temp
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_copy
,
2310 set_expr_location_from_node (gnu_temp
, gnat_node
);
2311 append_to_statement_list (gnu_temp
, &gnu_after_list
);
2315 /* Start from the real object and build the actual. */
2316 gnu_actual
= gnu_name
;
2318 /* If this was a procedure call, we may not have removed any padding.
2319 So do it here for the part we will use as an input, if any. */
2320 if (Ekind (gnat_formal
) != E_Out_Parameter
2321 && TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2322 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
)))
2323 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2326 /* Do any needed conversions for the actual and make sure that it is
2327 in range of the formal's type. */
2328 if (suppress_type_conversion
)
2330 /* Put back the conversion we suppressed above in the computation
2331 of the real object. Note that we treat a conversion between
2332 aggregate types as if it is an unchecked conversion here. */
2334 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2336 (Nkind (gnat_actual
)
2337 == N_Unchecked_Type_Conversion
)
2338 && No_Truncation (gnat_actual
));
2340 if (Ekind (gnat_formal
) != E_Out_Parameter
2341 && Do_Range_Check (gnat_actual
))
2342 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2346 if (Ekind (gnat_formal
) != E_Out_Parameter
2347 && Do_Range_Check (gnat_actual
))
2348 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2350 /* We may have suppressed a conversion to the Etype of the actual
2351 since the parent is a procedure call. So put it back here.
2352 ??? We use the reverse order compared to the case above because
2353 of an awkward interaction with the check and actually don't put
2354 back the conversion at all if a check is emitted. This is also
2355 done for the conversion to the formal's type just below. */
2356 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2357 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2361 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2362 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2364 /* Unless this is an In parameter, we must remove any justified modular
2365 building from GNU_NAME to get an lvalue. */
2366 if (Ekind (gnat_formal
) != E_In_Parameter
2367 && TREE_CODE (gnu_name
) == CONSTRUCTOR
2368 && TREE_CODE (TREE_TYPE (gnu_name
)) == RECORD_TYPE
2369 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name
)))
2370 gnu_name
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name
))),
2373 /* If we have not saved a GCC object for the formal, it means it is an
2374 Out parameter not passed by reference and that does not need to be
2375 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2378 && TREE_CODE (gnu_formal
) == PARM_DECL
2379 && DECL_BY_REF_P (gnu_formal
))
2381 if (Ekind (gnat_formal
) != E_In_Parameter
)
2383 /* In Out or Out parameters passed by reference don't use the
2384 copy-in copy-out mechanism so the address of the real object
2385 must be passed to the function. */
2386 gnu_actual
= gnu_name
;
2388 /* If we have a padded type, be sure we've removed padding. */
2389 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2390 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
))
2391 && TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2392 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2395 /* If we have the constructed subtype of an aliased object
2396 with an unconstrained nominal subtype, the type of the
2397 actual includes the template, although it is formally
2398 constrained. So we need to convert it back to the real
2399 constructed subtype to retrieve the constrained part
2400 and takes its address. */
2401 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2402 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual
))
2403 && TREE_CODE (gnu_actual
) != SAVE_EXPR
2404 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual
))
2405 && Is_Array_Type (Etype (gnat_actual
)))
2406 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2410 /* The symmetry of the paths to the type of an entity is broken here
2411 since arguments don't know that they will be passed by ref. */
2412 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2413 gnu_actual
= build_unary_op (ADDR_EXPR
, gnu_formal_type
, gnu_actual
);
2416 && TREE_CODE (gnu_formal
) == PARM_DECL
2417 && DECL_BY_COMPONENT_PTR_P (gnu_formal
))
2419 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2420 gnu_actual
= maybe_implicit_deref (gnu_actual
);
2421 gnu_actual
= maybe_unconstrained_array (gnu_actual
);
2423 if (TREE_CODE (gnu_formal_type
) == RECORD_TYPE
2424 && TYPE_IS_PADDING_P (gnu_formal_type
))
2426 gnu_formal_type
= TREE_TYPE (TYPE_FIELDS (gnu_formal_type
));
2427 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2430 /* Take the address of the object and convert to the proper pointer
2431 type. We'd like to actually compute the address of the beginning
2432 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2433 possibility that the ARRAY_REF might return a constant and we'd be
2434 getting the wrong address. Neither approach is exactly correct,
2435 but this is the most likely to work in all cases. */
2436 gnu_actual
= convert (gnu_formal_type
,
2437 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2441 && TREE_CODE (gnu_formal
) == PARM_DECL
2442 && DECL_BY_DESCRIPTOR_P (gnu_formal
))
2444 /* If arg is 'Null_Parameter, pass zero descriptor. */
2445 if ((TREE_CODE (gnu_actual
) == INDIRECT_REF
2446 || TREE_CODE (gnu_actual
) == UNCONSTRAINED_ARRAY_REF
)
2447 && TREE_PRIVATE (gnu_actual
))
2448 gnu_actual
= convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal
)),
2451 gnu_actual
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2452 fill_vms_descriptor (gnu_actual
,
2458 tree gnu_actual_size
= TYPE_SIZE (TREE_TYPE (gnu_actual
));
2460 if (Ekind (gnat_formal
) != E_In_Parameter
)
2461 gnu_name_list
= tree_cons (NULL_TREE
, gnu_name
, gnu_name_list
);
2463 if (!gnu_formal
|| TREE_CODE (gnu_formal
) != PARM_DECL
)
2466 /* If this is 'Null_Parameter, pass a zero even though we are
2467 dereferencing it. */
2468 else if (TREE_CODE (gnu_actual
) == INDIRECT_REF
2469 && TREE_PRIVATE (gnu_actual
)
2470 && host_integerp (gnu_actual_size
, 1)
2471 && 0 >= compare_tree_int (gnu_actual_size
,
2474 = unchecked_convert (DECL_ARG_TYPE (gnu_formal
),
2475 convert (gnat_type_for_size
2476 (tree_low_cst (gnu_actual_size
, 1),
2481 gnu_actual
= convert (DECL_ARG_TYPE (gnu_formal
), gnu_actual
);
2484 gnu_actual_list
= tree_cons (NULL_TREE
, gnu_actual
, gnu_actual_list
);
2487 gnu_subprog_call
= build_call_list (TREE_TYPE (gnu_subprog_type
),
2489 nreverse (gnu_actual_list
));
2490 set_expr_location_from_node (gnu_subprog_call
, gnat_node
);
2492 /* If we return by passing a target, the result is the target after the
2493 call. We must not emit the call directly here because this might be
2494 evaluated as part of an expression with conditions to control whether
2495 the call should be emitted or not. */
2496 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2498 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2499 by the target object converted to the proper type. Doing so would
2500 potentially be very inefficient, however, as this expression might
2501 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2502 pointless temporary copy of the whole object.
2504 What we do instead is build a COMPOUND_EXPR returning the address of
2505 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2506 SAVE_EXPR later on then only incurs a pointer copy. */
2508 tree gnu_result_type
2509 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2512 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2514 tree gnu_target_address
2515 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_target
);
2516 set_expr_location_from_node (gnu_target_address
, gnat_node
);
2519 = build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_target_address
),
2520 gnu_subprog_call
, gnu_target_address
);
2523 = unchecked_convert (gnu_result_type
,
2524 build_unary_op (INDIRECT_REF
, NULL_TREE
,
2528 *gnu_result_type_p
= gnu_result_type
;
2532 /* If it is a function call, the result is the call expression unless
2533 a target is specified, in which case we copy the result into the target
2534 and return the assignment statement. */
2535 else if (Nkind (gnat_node
) == N_Function_Call
)
2537 gnu_result
= gnu_subprog_call
;
2539 /* If the function returns an unconstrained array or by reference,
2540 we have to de-dereference the pointer. */
2541 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
)
2542 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type
))
2543 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
2546 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2547 gnu_target
, gnu_result
);
2549 *gnu_result_type_p
= get_unpadded_type (Etype (gnat_node
));
2554 /* If this is the case where the GNAT tree contains a procedure call
2555 but the Ada procedure has copy in copy out parameters, the special
2556 parameter passing mechanism must be used. */
2557 else if (TYPE_CI_CO_LIST (gnu_subprog_type
) != NULL_TREE
)
2559 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2560 in copy out parameters. */
2561 tree scalar_return_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2562 int length
= list_length (scalar_return_list
);
2568 gnu_subprog_call
= save_expr (gnu_subprog_call
);
2569 gnu_name_list
= nreverse (gnu_name_list
);
2571 /* If any of the names had side-effects, ensure they are all
2572 evaluated before the call. */
2573 for (gnu_name
= gnu_name_list
; gnu_name
;
2574 gnu_name
= TREE_CHAIN (gnu_name
))
2575 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name
)))
2576 append_to_statement_list (TREE_VALUE (gnu_name
),
2580 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2581 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2583 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2585 for (gnat_actual
= First_Actual (gnat_node
);
2586 Present (gnat_actual
);
2587 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2588 gnat_actual
= Next_Actual (gnat_actual
))
2589 /* If we are dealing with a copy in copy out parameter, we must
2590 retrieve its value from the record returned in the call. */
2591 if (!(present_gnu_tree (gnat_formal
)
2592 && TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2593 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal
))
2594 || (TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2595 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal
))
2596 || (DECL_BY_DESCRIPTOR_P
2597 (get_gnu_tree (gnat_formal
))))))))
2598 && Ekind (gnat_formal
) != E_In_Parameter
)
2600 /* Get the value to assign to this Out or In Out parameter. It is
2601 either the result of the function if there is only a single such
2602 parameter or the appropriate field from the record returned. */
2604 = length
== 1 ? gnu_subprog_call
2605 : build_component_ref (gnu_subprog_call
, NULL_TREE
,
2606 TREE_PURPOSE (scalar_return_list
),
2609 /* If the actual is a conversion, get the inner expression, which
2610 will be the real destination, and convert the result to the
2611 type of the actual parameter. */
2613 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list
));
2615 /* If the result is a padded type, remove the padding. */
2616 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
2617 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
2618 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS
2619 (TREE_TYPE (gnu_result
))),
2622 /* If the actual is a type conversion, the real target object is
2623 denoted by the inner Expression and we need to convert the
2624 result to the associated type.
2625 We also need to convert our gnu assignment target to this type
2626 if the corresponding GNU_NAME was constructed from the GNAT
2627 conversion node and not from the inner Expression. */
2628 if (Nkind (gnat_actual
) == N_Type_Conversion
)
2631 = convert_with_check
2632 (Etype (Expression (gnat_actual
)), gnu_result
,
2633 Do_Overflow_Check (gnat_actual
),
2634 Do_Range_Check (Expression (gnat_actual
)),
2635 Float_Truncate (gnat_actual
));
2637 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal
))))
2638 gnu_actual
= convert (TREE_TYPE (gnu_result
), gnu_actual
);
2641 /* Unchecked conversions as actuals for Out parameters are not
2642 allowed in user code because they are not variables, but do
2643 occur in front-end expansions. The associated GNU_NAME is
2644 always obtained from the inner expression in such cases. */
2645 else if (Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
)
2646 gnu_result
= unchecked_convert (TREE_TYPE (gnu_actual
),
2648 No_Truncation (gnat_actual
));
2651 if (Do_Range_Check (gnat_actual
))
2652 gnu_result
= emit_range_check (gnu_result
,
2653 Etype (gnat_actual
));
2655 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual
)))
2656 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result
)))))
2657 gnu_result
= convert (TREE_TYPE (gnu_actual
), gnu_result
);
2660 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2661 gnu_actual
, gnu_result
);
2662 set_expr_location_from_node (gnu_result
, gnat_node
);
2663 append_to_statement_list (gnu_result
, &gnu_before_list
);
2664 scalar_return_list
= TREE_CHAIN (scalar_return_list
);
2665 gnu_name_list
= TREE_CHAIN (gnu_name_list
);
2669 append_to_statement_list (gnu_subprog_call
, &gnu_before_list
);
2671 append_to_statement_list (gnu_after_list
, &gnu_before_list
);
2672 return gnu_before_list
;
2675 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2676 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2679 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node
)
2681 tree gnu_jmpsave_decl
= NULL_TREE
;
2682 tree gnu_jmpbuf_decl
= NULL_TREE
;
2683 /* If just annotating, ignore all EH and cleanups. */
2684 bool gcc_zcx
= (!type_annotate_only
2685 && Present (Exception_Handlers (gnat_node
))
2686 && Exception_Mechanism
== Back_End_Exceptions
);
2688 = (!type_annotate_only
&& Present (Exception_Handlers (gnat_node
))
2689 && Exception_Mechanism
== Setjmp_Longjmp
);
2690 bool at_end
= !type_annotate_only
&& Present (At_End_Proc (gnat_node
));
2691 bool binding_for_block
= (at_end
|| gcc_zcx
|| setjmp_longjmp
);
2692 tree gnu_inner_block
; /* The statement(s) for the block itself. */
2697 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2698 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2699 add_cleanup, and when we leave the binding, end_stmt_group will create
2700 the TRY_FINALLY_EXPR.
2702 ??? The region level calls down there have been specifically put in place
2703 for a ZCX context and currently the order in which things are emitted
2704 (region/handlers) is different from the SJLJ case. Instead of putting
2705 other calls with different conditions at other places for the SJLJ case,
2706 it seems cleaner to reorder things for the SJLJ case and generalize the
2707 condition to make it not ZCX specific.
2709 If there are any exceptions or cleanup processing involved, we need an
2710 outer statement group (for Setjmp_Longjmp) and binding level. */
2711 if (binding_for_block
)
2713 start_stmt_group ();
2717 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2718 area for address of previous buffer. Do this first since we need to have
2719 the setjmp buf known for any decls in this block. */
2722 gnu_jmpsave_decl
= create_var_decl (get_identifier ("JMPBUF_SAVE"),
2723 NULL_TREE
, jmpbuf_ptr_type
,
2724 build_call_0_expr (get_jmpbuf_decl
),
2725 false, false, false, false, NULL
,
2727 DECL_ARTIFICIAL (gnu_jmpsave_decl
) = 1;
2729 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2730 because of the unstructured form of EH used by setjmp_longjmp, there
2731 might be forward edges going to __builtin_setjmp receivers on which
2732 it is uninitialized, although they will never be actually taken. */
2733 TREE_NO_WARNING (gnu_jmpsave_decl
) = 1;
2734 gnu_jmpbuf_decl
= create_var_decl (get_identifier ("JMP_BUF"),
2735 NULL_TREE
, jmpbuf_type
,
2736 NULL_TREE
, false, false, false, false,
2738 DECL_ARTIFICIAL (gnu_jmpbuf_decl
) = 1;
2740 set_block_jmpbuf_decl (gnu_jmpbuf_decl
);
2742 /* When we exit this block, restore the saved value. */
2743 add_cleanup (build_call_1_expr (set_jmpbuf_decl
, gnu_jmpsave_decl
),
2744 End_Label (gnat_node
));
2747 /* If we are to call a function when exiting this block, add a cleanup
2748 to the binding level we made above. Note that add_cleanup is FIFO
2749 so we must register this cleanup after the EH cleanup just above. */
2751 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node
))),
2752 End_Label (gnat_node
));
2754 /* Now build the tree for the declarations and statements inside this block.
2755 If this is SJLJ, set our jmp_buf as the current buffer. */
2756 start_stmt_group ();
2759 add_stmt (build_call_1_expr (set_jmpbuf_decl
,
2760 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2763 if (Present (First_Real_Statement (gnat_node
)))
2764 process_decls (Statements (gnat_node
), Empty
,
2765 First_Real_Statement (gnat_node
), true, true);
2767 /* Generate code for each statement in the block. */
2768 for (gnat_temp
= (Present (First_Real_Statement (gnat_node
))
2769 ? First_Real_Statement (gnat_node
)
2770 : First (Statements (gnat_node
)));
2771 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
2772 add_stmt (gnat_to_gnu (gnat_temp
));
2773 gnu_inner_block
= end_stmt_group ();
2775 /* Now generate code for the two exception models, if either is relevant for
2779 tree
*gnu_else_ptr
= 0;
2782 /* Make a binding level for the exception handling declarations and code
2783 and set up gnu_except_ptr_stack for the handlers to use. */
2784 start_stmt_group ();
2787 push_stack (&gnu_except_ptr_stack
, NULL_TREE
,
2788 create_var_decl (get_identifier ("EXCEPT_PTR"),
2790 build_pointer_type (except_type_node
),
2791 build_call_0_expr (get_excptr_decl
), false,
2792 false, false, false, NULL
, gnat_node
));
2794 /* Generate code for each handler. The N_Exception_Handler case does the
2795 real work and returns a COND_EXPR for each handler, which we chain
2797 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2798 Present (gnat_temp
); gnat_temp
= Next_Non_Pragma (gnat_temp
))
2800 gnu_expr
= gnat_to_gnu (gnat_temp
);
2802 /* If this is the first one, set it as the outer one. Otherwise,
2803 point the "else" part of the previous handler to us. Then point
2804 to our "else" part. */
2806 add_stmt (gnu_expr
);
2808 *gnu_else_ptr
= gnu_expr
;
2810 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
2813 /* If none of the exception handlers did anything, re-raise but do not
2815 gnu_expr
= build_call_1_expr (raise_nodefer_decl
,
2816 TREE_VALUE (gnu_except_ptr_stack
));
2817 set_expr_location_from_node (gnu_expr
, gnat_node
);
2820 *gnu_else_ptr
= gnu_expr
;
2822 add_stmt (gnu_expr
);
2824 /* End the binding level dedicated to the exception handlers and get the
2825 whole statement group. */
2826 pop_stack (&gnu_except_ptr_stack
);
2828 gnu_handler
= end_stmt_group ();
2830 /* If the setjmp returns 1, we restore our incoming longjmp value and
2831 then check the handlers. */
2832 start_stmt_group ();
2833 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl
,
2836 add_stmt (gnu_handler
);
2837 gnu_handler
= end_stmt_group ();
2839 /* This block is now "if (setjmp) ... <handlers> else <block>". */
2840 gnu_result
= build3 (COND_EXPR
, void_type_node
,
2843 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2845 gnu_handler
, gnu_inner_block
);
2851 /* First make a block containing the handlers. */
2852 start_stmt_group ();
2853 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2854 Present (gnat_temp
);
2855 gnat_temp
= Next_Non_Pragma (gnat_temp
))
2856 add_stmt (gnat_to_gnu (gnat_temp
));
2857 gnu_handlers
= end_stmt_group ();
2859 /* Now make the TRY_CATCH_EXPR for the block. */
2860 gnu_result
= build2 (TRY_CATCH_EXPR
, void_type_node
,
2861 gnu_inner_block
, gnu_handlers
);
2864 gnu_result
= gnu_inner_block
;
2866 /* Now close our outer block, if we had to make one. */
2867 if (binding_for_block
)
2869 add_stmt (gnu_result
);
2871 gnu_result
= end_stmt_group ();
2877 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2878 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
2879 exception handling. */
2882 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node
)
2884 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
2885 an "if" statement to select the proper exceptions. For "Others", exclude
2886 exceptions where Handled_By_Others is nonzero unless the All_Others flag
2887 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
2888 tree gnu_choice
= integer_zero_node
;
2889 tree gnu_body
= build_stmt_group (Statements (gnat_node
), false);
2892 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2893 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2897 if (Nkind (gnat_temp
) == N_Others_Choice
)
2899 if (All_Others (gnat_temp
))
2900 this_choice
= integer_one_node
;
2904 (EQ_EXPR
, integer_type_node
,
2909 (INDIRECT_REF
, NULL_TREE
,
2910 TREE_VALUE (gnu_except_ptr_stack
)),
2911 get_identifier ("not_handled_by_others"), NULL_TREE
,
2916 else if (Nkind (gnat_temp
) == N_Identifier
2917 || Nkind (gnat_temp
) == N_Expanded_Name
)
2919 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
2922 /* Exception may be a renaming. Recover original exception which is
2923 the one elaborated and registered. */
2924 if (Present (Renamed_Object (gnat_ex_id
)))
2925 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
2927 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
2931 (EQ_EXPR
, integer_type_node
, TREE_VALUE (gnu_except_ptr_stack
),
2932 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack
)),
2933 build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
)));
2935 /* If this is the distinguished exception "Non_Ada_Error" (and we are
2936 in VMS mode), also allow a non-Ada exception (a VMS condition) t
2938 if (Is_Non_Ada_Error (Entity (gnat_temp
)))
2941 = build_component_ref
2942 (build_unary_op (INDIRECT_REF
, NULL_TREE
,
2943 TREE_VALUE (gnu_except_ptr_stack
)),
2944 get_identifier ("lang"), NULL_TREE
, false);
2948 (TRUTH_ORIF_EXPR
, integer_type_node
,
2949 build_binary_op (EQ_EXPR
, integer_type_node
, gnu_comp
,
2950 build_int_cst (TREE_TYPE (gnu_comp
), 'V')),
2957 gnu_choice
= build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
2958 gnu_choice
, this_choice
);
2961 return build3 (COND_EXPR
, void_type_node
, gnu_choice
, gnu_body
, NULL_TREE
);
2964 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2965 to a GCC tree, which is returned. This is the variant for ZCX. */
2968 Exception_Handler_to_gnu_zcx (Node_Id gnat_node
)
2970 tree gnu_etypes_list
= NULL_TREE
;
2973 tree gnu_current_exc_ptr
;
2974 tree gnu_incoming_exc_ptr
;
2977 /* We build a TREE_LIST of nodes representing what exception types this
2978 handler can catch, with special cases for others and all others cases.
2980 Each exception type is actually identified by a pointer to the exception
2981 id, or to a dummy object for "others" and "all others".
2983 Care should be taken to ensure that the control flow impact of "others"
2984 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
2986 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2987 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2989 if (Nkind (gnat_temp
) == N_Others_Choice
)
2992 = All_Others (gnat_temp
) ? all_others_decl
: others_decl
;
2995 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
2997 else if (Nkind (gnat_temp
) == N_Identifier
2998 || Nkind (gnat_temp
) == N_Expanded_Name
)
3000 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
3002 /* Exception may be a renaming. Recover original exception which is
3003 the one elaborated and registered. */
3004 if (Present (Renamed_Object (gnat_ex_id
)))
3005 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
3007 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
3008 gnu_etype
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
3010 /* The Non_Ada_Error case for VMS exceptions is handled
3011 by the personality routine. */
3016 /* The GCC interface expects NULL to be passed for catch all handlers, so
3017 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
3018 is integer_zero_node. It would not work, however, because GCC's
3019 notion of "catch all" is stronger than our notion of "others". Until
3020 we correctly use the cleanup interface as well, doing that would
3021 prevent the "all others" handlers from being seen, because nothing
3022 can be caught beyond a catch all from GCC's point of view. */
3023 gnu_etypes_list
= tree_cons (NULL_TREE
, gnu_etype
, gnu_etypes_list
);
3026 start_stmt_group ();
3029 /* Expand a call to the begin_handler hook at the beginning of the handler,
3030 and arrange for a call to the end_handler hook to occur on every possible
3033 The hooks expect a pointer to the low level occurrence. This is required
3034 for our stack management scheme because a raise inside the handler pushes
3035 a new occurrence on top of the stack, which means that this top does not
3036 necessarily match the occurrence this handler was dealing with.
3038 The EXC_PTR_EXPR object references the exception occurrence being
3039 propagated. Upon handler entry, this is the exception for which the
3040 handler is triggered. This might not be the case upon handler exit,
3041 however, as we might have a new occurrence propagated by the handler's
3042 body, and the end_handler hook called as a cleanup in this context.
3044 We use a local variable to retrieve the incoming value at handler entry
3045 time, and reuse it to feed the end_handler hook's argument at exit. */
3046 gnu_current_exc_ptr
= build0 (EXC_PTR_EXPR
, ptr_type_node
);
3047 gnu_incoming_exc_ptr
= create_var_decl (get_identifier ("EXPTR"), NULL_TREE
,
3048 ptr_type_node
, gnu_current_exc_ptr
,
3049 false, false, false, false, NULL
,
3052 add_stmt_with_node (build_call_1_expr (begin_handler_decl
,
3053 gnu_incoming_exc_ptr
),
3055 /* ??? We don't seem to have an End_Label at hand to set the location. */
3056 add_cleanup (build_call_1_expr (end_handler_decl
, gnu_incoming_exc_ptr
),
3058 add_stmt_list (Statements (gnat_node
));
3061 return build2 (CATCH_EXPR
, void_type_node
, gnu_etypes_list
,
3065 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3068 Compilation_Unit_to_gnu (Node_Id gnat_node
)
3070 /* Make the decl for the elaboration procedure. */
3071 bool body_p
= (Defining_Entity (Unit (gnat_node
)),
3072 Nkind (Unit (gnat_node
)) == N_Package_Body
3073 || Nkind (Unit (gnat_node
)) == N_Subprogram_Body
);
3074 Entity_Id gnat_unit_entity
= Defining_Entity (Unit (gnat_node
));
3075 tree gnu_elab_proc_decl
3076 = create_subprog_decl
3077 (create_concat_name (gnat_unit_entity
,
3078 body_p
? "elabb" : "elabs"),
3079 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, false, NULL
,
3081 struct elab_info
*info
;
3083 push_stack (&gnu_elab_proc_stack
, NULL_TREE
, gnu_elab_proc_decl
);
3085 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl
) = 1;
3086 allocate_struct_function (gnu_elab_proc_decl
, false);
3087 Sloc_to_locus (Sloc (gnat_unit_entity
), &cfun
->function_end_locus
);
3090 /* For a body, first process the spec if there is one. */
3091 if (Nkind (Unit (gnat_node
)) == N_Package_Body
3092 || (Nkind (Unit (gnat_node
)) == N_Subprogram_Body
3093 && !Acts_As_Spec (gnat_node
)))
3095 add_stmt (gnat_to_gnu (Library_Unit (gnat_node
)));
3096 finalize_from_with_types ();
3099 process_inlined_subprograms (gnat_node
);
3101 if (type_annotate_only
&& gnat_node
== Cunit (Main_Unit
))
3103 elaborate_all_entities (gnat_node
);
3105 if (Nkind (Unit (gnat_node
)) == N_Subprogram_Declaration
3106 || Nkind (Unit (gnat_node
)) == N_Generic_Package_Declaration
3107 || Nkind (Unit (gnat_node
)) == N_Generic_Subprogram_Declaration
)
3111 process_decls (Declarations (Aux_Decls_Node (gnat_node
)), Empty
, Empty
,
3113 add_stmt (gnat_to_gnu (Unit (gnat_node
)));
3115 /* Process any pragmas and actions following the unit. */
3116 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node
)));
3117 add_stmt_list (Actions (Aux_Decls_Node (gnat_node
)));
3118 finalize_from_with_types ();
3120 /* Save away what we've made so far and record this potential elaboration
3122 info
= (struct elab_info
*) ggc_alloc (sizeof (struct elab_info
));
3123 set_current_block_context (gnu_elab_proc_decl
);
3125 DECL_SAVED_TREE (gnu_elab_proc_decl
) = end_stmt_group ();
3126 info
->next
= elab_info_list
;
3127 info
->elab_proc
= gnu_elab_proc_decl
;
3128 info
->gnat_node
= gnat_node
;
3129 elab_info_list
= info
;
3131 /* Generate elaboration code for this unit, if necessary, and say whether
3133 pop_stack (&gnu_elab_proc_stack
);
3135 /* Invalidate the global renaming pointers. This is necessary because
3136 stabilization of the renamed entities may create SAVE_EXPRs which
3137 have been tied to a specific elaboration routine just above. */
3138 invalidate_global_renaming_pointers ();
3141 /* This function is the driver of the GNAT to GCC tree transformation
3142 process. It is the entry point of the tree transformer. GNAT_NODE is the
3143 root of some GNAT tree. Return the root of the corresponding GCC tree.
3144 If this is an expression, return the GCC equivalent of the expression. If
3145 it is a statement, return the statement. In the case when called for a
3146 statement, it may also add statements to the current statement group, in
3147 which case anything it returns is to be interpreted as occurring after
3148 anything `it already added. */
3151 gnat_to_gnu (Node_Id gnat_node
)
3153 bool went_into_elab_proc
= false;
3154 tree gnu_result
= error_mark_node
; /* Default to no value. */
3155 tree gnu_result_type
= void_type_node
;
3157 tree gnu_lhs
, gnu_rhs
;
3160 /* Save node number for error message and set location information. */
3161 error_gnat_node
= gnat_node
;
3162 Sloc_to_locus (Sloc (gnat_node
), &input_location
);
3164 if (type_annotate_only
3165 && IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
))
3166 return alloc_stmt_list ();
3168 /* If this node is a non-static subexpression and we are only
3169 annotating types, make this into a NULL_EXPR. */
3170 if (type_annotate_only
3171 && IN (Nkind (gnat_node
), N_Subexpr
)
3172 && Nkind (gnat_node
) != N_Identifier
3173 && !Compile_Time_Known_Value (gnat_node
))
3174 return build1 (NULL_EXPR
, get_unpadded_type (Etype (gnat_node
)),
3175 build_call_raise (CE_Range_Check_Failed
, gnat_node
,
3176 N_Raise_Constraint_Error
));
3178 /* If this is a Statement and we are at top level, it must be part of the
3179 elaboration procedure, so mark us as being in that procedure and push our
3182 If we are in the elaboration procedure, check if we are violating a
3183 No_Elaboration_Code restriction by having a statement there. */
3184 if ((IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
)
3185 && Nkind (gnat_node
) != N_Null_Statement
)
3186 || Nkind (gnat_node
) == N_Procedure_Call_Statement
3187 || Nkind (gnat_node
) == N_Label
3188 || Nkind (gnat_node
) == N_Implicit_Label_Declaration
3189 || Nkind (gnat_node
) == N_Handled_Sequence_Of_Statements
3190 || ((Nkind (gnat_node
) == N_Raise_Constraint_Error
3191 || Nkind (gnat_node
) == N_Raise_Storage_Error
3192 || Nkind (gnat_node
) == N_Raise_Program_Error
)
3193 && (Ekind (Etype (gnat_node
)) == E_Void
)))
3195 if (!current_function_decl
)
3197 current_function_decl
= TREE_VALUE (gnu_elab_proc_stack
);
3198 start_stmt_group ();
3200 went_into_elab_proc
= true;
3203 /* Don't check for a possible No_Elaboration_Code restriction violation
3204 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3205 every nested real statement instead. This also avoids triggering
3206 spurious errors on dummy (empty) sequences created by the front-end
3207 for package bodies in some cases. */
3209 if (current_function_decl
== TREE_VALUE (gnu_elab_proc_stack
)
3210 && Nkind (gnat_node
) != N_Handled_Sequence_Of_Statements
)
3211 Check_Elaboration_Code_Allowed (gnat_node
);
3214 switch (Nkind (gnat_node
))
3216 /********************************/
3217 /* Chapter 2: Lexical Elements: */
3218 /********************************/
3221 case N_Expanded_Name
:
3222 case N_Operator_Symbol
:
3223 case N_Defining_Identifier
:
3224 gnu_result
= Identifier_to_gnu (gnat_node
, &gnu_result_type
);
3227 case N_Integer_Literal
:
3231 /* Get the type of the result, looking inside any padding and
3232 justified modular types. Then get the value in that type. */
3233 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3235 if (TREE_CODE (gnu_type
) == RECORD_TYPE
3236 && TYPE_JUSTIFIED_MODULAR_P (gnu_type
))
3237 gnu_type
= TREE_TYPE (TYPE_FIELDS (gnu_type
));
3239 gnu_result
= UI_To_gnu (Intval (gnat_node
), gnu_type
);
3241 /* If the result overflows (meaning it doesn't fit in its base type),
3242 abort. We would like to check that the value is within the range
3243 of the subtype, but that causes problems with subtypes whose usage
3244 will raise Constraint_Error and with biased representation, so
3246 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3250 case N_Character_Literal
:
3251 /* If a Entity is present, it means that this was one of the
3252 literals in a user-defined character type. In that case,
3253 just return the value in the CONST_DECL. Otherwise, use the
3254 character code. In that case, the base type should be an
3255 INTEGER_TYPE, but we won't bother checking for that. */
3256 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3257 if (Present (Entity (gnat_node
)))
3258 gnu_result
= DECL_INITIAL (get_gnu_tree (Entity (gnat_node
)));
3261 = build_int_cst_type
3262 (gnu_result_type
, UI_To_CC (Char_Literal_Value (gnat_node
)));
3265 case N_Real_Literal
:
3266 /* If this is of a fixed-point type, the value we want is the
3267 value of the corresponding integer. */
3268 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))), Fixed_Point_Kind
))
3270 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3271 gnu_result
= UI_To_gnu (Corresponding_Integer_Value (gnat_node
),
3273 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3276 /* We should never see a Vax_Float type literal, since the front end
3277 is supposed to transform these using appropriate conversions */
3278 else if (Vax_Float (Underlying_Type (Etype (gnat_node
))))
3283 Ureal ur_realval
= Realval (gnat_node
);
3285 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3287 /* If the real value is zero, so is the result. Otherwise,
3288 convert it to a machine number if it isn't already. That
3289 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3290 if (UR_Is_Zero (ur_realval
))
3291 gnu_result
= convert (gnu_result_type
, integer_zero_node
);
3294 if (!Is_Machine_Number (gnat_node
))
3296 = Machine (Base_Type (Underlying_Type (Etype (gnat_node
))),
3297 ur_realval
, Round_Even
, gnat_node
);
3300 = UI_To_gnu (Numerator (ur_realval
), gnu_result_type
);
3302 /* If we have a base of zero, divide by the denominator.
3303 Otherwise, the base must be 2 and we scale the value, which
3304 we know can fit in the mantissa of the type (hence the use
3305 of that type above). */
3306 if (No (Rbase (ur_realval
)))
3308 = build_binary_op (RDIV_EXPR
,
3309 get_base_type (gnu_result_type
),
3311 UI_To_gnu (Denominator (ur_realval
),
3315 REAL_VALUE_TYPE tmp
;
3317 gcc_assert (Rbase (ur_realval
) == 2);
3318 real_ldexp (&tmp
, &TREE_REAL_CST (gnu_result
),
3319 - UI_To_Int (Denominator (ur_realval
)));
3320 gnu_result
= build_real (gnu_result_type
, tmp
);
3324 /* Now see if we need to negate the result. Do it this way to
3325 properly handle -0. */
3326 if (UR_Is_Negative (Realval (gnat_node
)))
3328 = build_unary_op (NEGATE_EXPR
, get_base_type (gnu_result_type
),
3334 case N_String_Literal
:
3335 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3336 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type
)) == HOST_BITS_PER_CHAR
)
3338 String_Id gnat_string
= Strval (gnat_node
);
3339 int length
= String_Length (gnat_string
);
3342 if (length
>= ALLOCA_THRESHOLD
)
3343 string
= XNEWVEC (char, length
+ 1); /* in case of large strings */
3345 string
= (char *) alloca (length
+ 1);
3347 /* Build the string with the characters in the literal. Note
3348 that Ada strings are 1-origin. */
3349 for (i
= 0; i
< length
; i
++)
3350 string
[i
] = Get_String_Char (gnat_string
, i
+ 1);
3352 /* Put a null at the end of the string in case it's in a context
3353 where GCC will want to treat it as a C string. */
3356 gnu_result
= build_string (length
, string
);
3358 /* Strings in GCC don't normally have types, but we want
3359 this to not be converted to the array type. */
3360 TREE_TYPE (gnu_result
) = gnu_result_type
;
3362 if (length
>= ALLOCA_THRESHOLD
) /* free if heap-allocated */
3367 /* Build a list consisting of each character, then make
3369 String_Id gnat_string
= Strval (gnat_node
);
3370 int length
= String_Length (gnat_string
);
3372 tree gnu_list
= NULL_TREE
;
3373 tree gnu_idx
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3375 for (i
= 0; i
< length
; i
++)
3378 = tree_cons (gnu_idx
,
3379 build_int_cst (TREE_TYPE (gnu_result_type
),
3380 Get_String_Char (gnat_string
,
3384 gnu_idx
= int_const_binop (PLUS_EXPR
, gnu_idx
, integer_one_node
,
3389 = gnat_build_constructor (gnu_result_type
, nreverse (gnu_list
));
3394 gnu_result
= Pragma_to_gnu (gnat_node
);
3397 /**************************************/
3398 /* Chapter 3: Declarations and Types: */
3399 /**************************************/
3401 case N_Subtype_Declaration
:
3402 case N_Full_Type_Declaration
:
3403 case N_Incomplete_Type_Declaration
:
3404 case N_Private_Type_Declaration
:
3405 case N_Private_Extension_Declaration
:
3406 case N_Task_Type_Declaration
:
3407 process_type (Defining_Entity (gnat_node
));
3408 gnu_result
= alloc_stmt_list ();
3411 case N_Object_Declaration
:
3412 case N_Exception_Declaration
:
3413 gnat_temp
= Defining_Entity (gnat_node
);
3414 gnu_result
= alloc_stmt_list ();
3416 /* If we are just annotating types and this object has an unconstrained
3417 or task type, don't elaborate it. */
3418 if (type_annotate_only
3419 && (((Is_Array_Type (Etype (gnat_temp
))
3420 || Is_Record_Type (Etype (gnat_temp
)))
3421 && !Is_Constrained (Etype (gnat_temp
)))
3422 || Is_Concurrent_Type (Etype (gnat_temp
))))
3425 if (Present (Expression (gnat_node
))
3426 && !(Nkind (gnat_node
) == N_Object_Declaration
3427 && No_Initialization (gnat_node
))
3428 && (!type_annotate_only
3429 || Compile_Time_Known_Value (Expression (gnat_node
))))
3431 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
3432 if (Do_Range_Check (Expression (gnat_node
)))
3433 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_temp
));
3435 /* If this object has its elaboration delayed, we must force
3436 evaluation of GNU_EXPR right now and save it for when the object
3438 if (Present (Freeze_Node (gnat_temp
)))
3440 if ((Is_Public (gnat_temp
) || global_bindings_p ())
3441 && !TREE_CONSTANT (gnu_expr
))
3443 = create_var_decl (create_concat_name (gnat_temp
, "init"),
3444 NULL_TREE
, TREE_TYPE (gnu_expr
),
3445 gnu_expr
, false, Is_Public (gnat_temp
),
3446 false, false, NULL
, gnat_temp
);
3448 gnu_expr
= maybe_variable (gnu_expr
);
3450 save_gnu_tree (gnat_node
, gnu_expr
, true);
3454 gnu_expr
= NULL_TREE
;
3456 if (type_annotate_only
&& gnu_expr
&& TREE_CODE (gnu_expr
) == ERROR_MARK
)
3457 gnu_expr
= NULL_TREE
;
3459 /* If this is a deferred constant with an address clause, we ignore the
3460 full view since the clause is on the partial view and we cannot have
3461 2 different GCC trees for the object. The only bits of the full view
3462 we will use is the initializer, but it will be directly fetched. */
3463 if (Ekind(gnat_temp
) == E_Constant
3464 && Present (Address_Clause (gnat_temp
))
3465 && Present (Full_View (gnat_temp
)))
3466 save_gnu_tree (Full_View (gnat_temp
), error_mark_node
, true);
3468 if (No (Freeze_Node (gnat_temp
)))
3469 gnat_to_gnu_entity (gnat_temp
, gnu_expr
, 1);
3472 case N_Object_Renaming_Declaration
:
3473 gnat_temp
= Defining_Entity (gnat_node
);
3475 /* Don't do anything if this renaming is handled by the front end or if
3476 we are just annotating types and this object has a composite or task
3477 type, don't elaborate it. We return the result in case it has any
3478 SAVE_EXPRs in it that need to be evaluated here. */
3479 if (!Is_Renaming_Of_Object (gnat_temp
)
3480 && ! (type_annotate_only
3481 && (Is_Array_Type (Etype (gnat_temp
))
3482 || Is_Record_Type (Etype (gnat_temp
))
3483 || Is_Concurrent_Type (Etype (gnat_temp
)))))
3485 = gnat_to_gnu_entity (gnat_temp
,
3486 gnat_to_gnu (Renamed_Object (gnat_temp
)), 1);
3488 gnu_result
= alloc_stmt_list ();
3491 case N_Implicit_Label_Declaration
:
3492 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
3493 gnu_result
= alloc_stmt_list ();
3496 case N_Exception_Renaming_Declaration
:
3497 case N_Number_Declaration
:
3498 case N_Package_Renaming_Declaration
:
3499 case N_Subprogram_Renaming_Declaration
:
3500 /* These are fully handled in the front end. */
3501 gnu_result
= alloc_stmt_list ();
3504 /*************************************/
3505 /* Chapter 4: Names and Expressions: */
3506 /*************************************/
3508 case N_Explicit_Dereference
:
3509 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3510 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3511 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
3514 case N_Indexed_Component
:
3516 tree gnu_array_object
= gnat_to_gnu (Prefix (gnat_node
));
3520 Node_Id
*gnat_expr_array
;
3522 gnu_array_object
= maybe_implicit_deref (gnu_array_object
);
3523 gnu_array_object
= maybe_unconstrained_array (gnu_array_object
);
3525 /* If we got a padded type, remove it too. */
3526 if (TREE_CODE (TREE_TYPE (gnu_array_object
)) == RECORD_TYPE
3527 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object
)))
3529 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object
))),
3532 gnu_result
= gnu_array_object
;
3534 /* First compute the number of dimensions of the array, then
3535 fill the expression array, the order depending on whether
3536 this is a Convention_Fortran array or not. */
3537 for (ndim
= 1, gnu_type
= TREE_TYPE (gnu_array_object
);
3538 TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
3539 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
));
3540 ndim
++, gnu_type
= TREE_TYPE (gnu_type
))
3543 gnat_expr_array
= (Node_Id
*) alloca (ndim
* sizeof (Node_Id
));
3545 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object
)))
3546 for (i
= ndim
- 1, gnat_temp
= First (Expressions (gnat_node
));
3548 i
--, gnat_temp
= Next (gnat_temp
))
3549 gnat_expr_array
[i
] = gnat_temp
;
3551 for (i
= 0, gnat_temp
= First (Expressions (gnat_node
));
3553 i
++, gnat_temp
= Next (gnat_temp
))
3554 gnat_expr_array
[i
] = gnat_temp
;
3556 for (i
= 0, gnu_type
= TREE_TYPE (gnu_array_object
);
3557 i
< ndim
; i
++, gnu_type
= TREE_TYPE (gnu_type
))
3559 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
3560 gnat_temp
= gnat_expr_array
[i
];
3561 gnu_expr
= gnat_to_gnu (gnat_temp
);
3563 if (Do_Range_Check (gnat_temp
))
3566 (gnu_array_object
, gnu_expr
,
3567 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))),
3568 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))));
3570 gnu_result
= build_binary_op (ARRAY_REF
, NULL_TREE
,
3571 gnu_result
, gnu_expr
);
3575 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3581 Node_Id gnat_range_node
= Discrete_Range (gnat_node
);
3583 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3584 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3586 /* Do any implicit dereferences of the prefix and do any needed
3588 gnu_result
= maybe_implicit_deref (gnu_result
);
3589 gnu_result
= maybe_unconstrained_array (gnu_result
);
3590 gnu_type
= TREE_TYPE (gnu_result
);
3591 if (Do_Range_Check (gnat_range_node
))
3593 /* Get the bounds of the slice. */
3595 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type
));
3596 tree gnu_min_expr
= TYPE_MIN_VALUE (gnu_index_type
);
3597 tree gnu_max_expr
= TYPE_MAX_VALUE (gnu_index_type
);
3598 /* Get the permitted bounds. */
3599 tree gnu_base_index_type
3600 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
3601 tree gnu_base_min_expr
= SUBSTITUTE_PLACEHOLDER_IN_EXPR
3602 (TYPE_MIN_VALUE (gnu_base_index_type
), gnu_result
);
3603 tree gnu_base_max_expr
= SUBSTITUTE_PLACEHOLDER_IN_EXPR
3604 (TYPE_MAX_VALUE (gnu_base_index_type
), gnu_result
);
3605 tree gnu_expr_l
, gnu_expr_h
, gnu_expr_type
;
3607 gnu_min_expr
= protect_multiple_eval (gnu_min_expr
);
3608 gnu_max_expr
= protect_multiple_eval (gnu_max_expr
);
3610 /* Derive a good type to convert everything to. */
3611 gnu_expr_type
= get_base_type (gnu_index_type
);
3613 /* Test whether the minimum slice value is too small. */
3614 gnu_expr_l
= build_binary_op (LT_EXPR
, integer_type_node
,
3615 convert (gnu_expr_type
,
3617 convert (gnu_expr_type
,
3618 gnu_base_min_expr
));
3620 /* Test whether the maximum slice value is too large. */
3621 gnu_expr_h
= build_binary_op (GT_EXPR
, integer_type_node
,
3622 convert (gnu_expr_type
,
3624 convert (gnu_expr_type
,
3625 gnu_base_max_expr
));
3627 /* Build a slice index check that returns the low bound,
3628 assuming the slice is not empty. */
3629 gnu_expr
= emit_check
3630 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
3631 gnu_expr_l
, gnu_expr_h
),
3632 gnu_min_expr
, CE_Index_Check_Failed
);
3634 /* Build a conditional expression that does the index checks and
3635 returns the low bound if the slice is not empty (max >= min),
3636 and returns the naked low bound otherwise (max < min), unless
3637 it is non-constant and the high bound is; this prevents VRP
3638 from inferring bogus ranges on the unlikely path. */
3639 gnu_expr
= fold_build3 (COND_EXPR
, gnu_expr_type
,
3640 build_binary_op (GE_EXPR
, gnu_expr_type
,
3641 convert (gnu_expr_type
,
3643 convert (gnu_expr_type
,
3646 TREE_CODE (gnu_min_expr
) != INTEGER_CST
3647 && TREE_CODE (gnu_max_expr
) == INTEGER_CST
3648 ? gnu_max_expr
: gnu_min_expr
);
3651 /* Simply return the naked low bound. */
3652 gnu_expr
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3654 gnu_result
= build_binary_op (ARRAY_RANGE_REF
, gnu_result_type
,
3655 gnu_result
, gnu_expr
);
3659 case N_Selected_Component
:
3661 tree gnu_prefix
= gnat_to_gnu (Prefix (gnat_node
));
3662 Entity_Id gnat_field
= Entity (Selector_Name (gnat_node
));
3663 Entity_Id gnat_pref_type
= Etype (Prefix (gnat_node
));
3666 while (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
)
3667 || IN (Ekind (gnat_pref_type
), Access_Kind
))
3669 if (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
))
3670 gnat_pref_type
= Underlying_Type (gnat_pref_type
);
3671 else if (IN (Ekind (gnat_pref_type
), Access_Kind
))
3672 gnat_pref_type
= Designated_Type (gnat_pref_type
);
3675 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
3677 /* For discriminant references in tagged types always substitute the
3678 corresponding discriminant as the actual selected component. */
3680 if (Is_Tagged_Type (gnat_pref_type
))
3681 while (Present (Corresponding_Discriminant (gnat_field
)))
3682 gnat_field
= Corresponding_Discriminant (gnat_field
);
3684 /* For discriminant references of untagged types always substitute the
3685 corresponding stored discriminant. */
3687 else if (Present (Corresponding_Discriminant (gnat_field
)))
3688 gnat_field
= Original_Record_Component (gnat_field
);
3690 /* Handle extracting the real or imaginary part of a complex.
3691 The real part is the first field and the imaginary the last. */
3693 if (TREE_CODE (TREE_TYPE (gnu_prefix
)) == COMPLEX_TYPE
)
3694 gnu_result
= build_unary_op (Present (Next_Entity (gnat_field
))
3695 ? REALPART_EXPR
: IMAGPART_EXPR
,
3696 NULL_TREE
, gnu_prefix
);
3699 gnu_field
= gnat_to_gnu_field_decl (gnat_field
);
3701 /* If there are discriminants, the prefix might be
3702 evaluated more than once, which is a problem if it has
3704 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node
)))
3705 ? Designated_Type (Etype
3706 (Prefix (gnat_node
)))
3707 : Etype (Prefix (gnat_node
))))
3708 gnu_prefix
= gnat_stabilize_reference (gnu_prefix
, false);
3711 = build_component_ref (gnu_prefix
, NULL_TREE
, gnu_field
,
3712 (Nkind (Parent (gnat_node
))
3713 == N_Attribute_Reference
));
3716 gcc_assert (gnu_result
);
3717 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3721 case N_Attribute_Reference
:
3723 /* The attribute designator (like an enumeration value). */
3724 int attribute
= Get_Attribute_Id (Attribute_Name (gnat_node
));
3726 /* The Elab_Spec and Elab_Body attributes are special in that
3727 Prefix is a unit, not an object with a GCC equivalent. Similarly
3728 for Elaborated, since that variable isn't otherwise known. */
3729 if (attribute
== Attr_Elab_Body
|| attribute
== Attr_Elab_Spec
)
3730 return (create_subprog_decl
3731 (create_concat_name (Entity (Prefix (gnat_node
)),
3732 attribute
== Attr_Elab_Body
3733 ? "elabb" : "elabs"),
3734 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, true, NULL
,
3737 gnu_result
= Attribute_to_gnu (gnat_node
, &gnu_result_type
, attribute
);
3742 /* Like 'Access as far as we are concerned. */
3743 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3744 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3745 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3749 case N_Extension_Aggregate
:
3753 /* ??? It is wrong to evaluate the type now, but there doesn't
3754 seem to be any other practical way of doing it. */
3756 gcc_assert (!Expansion_Delayed (gnat_node
));
3758 gnu_aggr_type
= gnu_result_type
3759 = get_unpadded_type (Etype (gnat_node
));
3761 if (TREE_CODE (gnu_result_type
) == RECORD_TYPE
3762 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type
))
3764 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type
)));
3766 if (Null_Record_Present (gnat_node
))
3767 gnu_result
= gnat_build_constructor (gnu_aggr_type
, NULL_TREE
);
3769 else if (TREE_CODE (gnu_aggr_type
) == RECORD_TYPE
3770 || TREE_CODE (gnu_aggr_type
) == UNION_TYPE
)
3772 = assoc_to_constructor (Etype (gnat_node
),
3773 First (Component_Associations (gnat_node
)),
3775 else if (TREE_CODE (gnu_aggr_type
) == ARRAY_TYPE
)
3776 gnu_result
= pos_to_constructor (First (Expressions (gnat_node
)),
3778 Component_Type (Etype (gnat_node
)));
3779 else if (TREE_CODE (gnu_aggr_type
) == COMPLEX_TYPE
)
3782 (COMPLEX_EXPR
, gnu_aggr_type
,
3783 gnat_to_gnu (Expression (First
3784 (Component_Associations (gnat_node
)))),
3785 gnat_to_gnu (Expression
3787 (First (Component_Associations (gnat_node
))))));
3791 gnu_result
= convert (gnu_result_type
, gnu_result
);
3796 if (TARGET_VTABLE_USES_DESCRIPTORS
3797 && Ekind (Etype (gnat_node
)) == E_Access_Subprogram_Type
3798 && Is_Dispatch_Table_Entity (Etype (gnat_node
)))
3799 gnu_result
= null_fdesc_node
;
3801 gnu_result
= null_pointer_node
;
3802 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3805 case N_Type_Conversion
:
3806 case N_Qualified_Expression
:
3807 /* Get the operand expression. */
3808 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3809 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3812 = convert_with_check (Etype (gnat_node
), gnu_result
,
3813 Do_Overflow_Check (gnat_node
),
3814 Do_Range_Check (Expression (gnat_node
)),
3815 Nkind (gnat_node
) == N_Type_Conversion
3816 && Float_Truncate (gnat_node
));
3819 case N_Unchecked_Type_Conversion
:
3820 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3821 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3823 /* If the result is a pointer type, see if we are improperly
3824 converting to a stricter alignment. */
3825 if (STRICT_ALIGNMENT
&& POINTER_TYPE_P (gnu_result_type
)
3826 && IN (Ekind (Etype (gnat_node
)), Access_Kind
))
3828 unsigned int align
= known_alignment (gnu_result
);
3829 tree gnu_obj_type
= TREE_TYPE (gnu_result_type
);
3830 unsigned int oalign
= TYPE_ALIGN (gnu_obj_type
);
3832 if (align
!= 0 && align
< oalign
&& !TYPE_ALIGN_OK (gnu_obj_type
))
3833 post_error_ne_tree_2
3834 ("?source alignment (^) '< alignment of & (^)",
3835 gnat_node
, Designated_Type (Etype (gnat_node
)),
3836 size_int (align
/ BITS_PER_UNIT
), oalign
/ BITS_PER_UNIT
);
3839 /* If we are converting a descriptor to a function pointer, first
3840 build the pointer. */
3841 if (TARGET_VTABLE_USES_DESCRIPTORS
3842 && TREE_TYPE (gnu_result
) == fdesc_type_node
3843 && POINTER_TYPE_P (gnu_result_type
))
3844 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3846 gnu_result
= unchecked_convert (gnu_result_type
, gnu_result
,
3847 No_Truncation (gnat_node
));
3853 tree gnu_object
= gnat_to_gnu (Left_Opnd (gnat_node
));
3854 Node_Id gnat_range
= Right_Opnd (gnat_node
);
3858 /* GNAT_RANGE is either an N_Range node or an identifier
3859 denoting a subtype. */
3860 if (Nkind (gnat_range
) == N_Range
)
3862 gnu_low
= gnat_to_gnu (Low_Bound (gnat_range
));
3863 gnu_high
= gnat_to_gnu (High_Bound (gnat_range
));
3865 else if (Nkind (gnat_range
) == N_Identifier
3866 || Nkind (gnat_range
) == N_Expanded_Name
)
3868 tree gnu_range_type
= get_unpadded_type (Entity (gnat_range
));
3870 gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
3871 gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
3876 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3878 /* If LOW and HIGH are identical, perform an equality test.
3879 Otherwise, ensure that GNU_OBJECT is only evaluated once
3880 and perform a full range test. */
3881 if (operand_equal_p (gnu_low
, gnu_high
, 0))
3882 gnu_result
= build_binary_op (EQ_EXPR
, gnu_result_type
,
3883 gnu_object
, gnu_low
);
3886 gnu_object
= protect_multiple_eval (gnu_object
);
3888 = build_binary_op (TRUTH_ANDIF_EXPR
, gnu_result_type
,
3889 build_binary_op (GE_EXPR
, gnu_result_type
,
3890 gnu_object
, gnu_low
),
3891 build_binary_op (LE_EXPR
, gnu_result_type
,
3892 gnu_object
, gnu_high
));
3895 if (Nkind (gnat_node
) == N_Not_In
)
3896 gnu_result
= invert_truthvalue (gnu_result
);
3901 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3902 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3903 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3904 gnu_result
= build_binary_op (FLOAT_TYPE_P (gnu_result_type
)
3906 : (Rounded_Result (gnat_node
)
3907 ? ROUND_DIV_EXPR
: TRUNC_DIV_EXPR
),
3908 gnu_result_type
, gnu_lhs
, gnu_rhs
);
3911 case N_Op_Or
: case N_Op_And
: case N_Op_Xor
:
3912 /* These can either be operations on booleans or on modular types.
3913 Fall through for boolean types since that's the way GNU_CODES is
3915 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))),
3916 Modular_Integer_Kind
))
3919 = (Nkind (gnat_node
) == N_Op_Or
? BIT_IOR_EXPR
3920 : Nkind (gnat_node
) == N_Op_And
? BIT_AND_EXPR
3923 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3924 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3925 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3926 gnu_result
= build_binary_op (code
, gnu_result_type
,
3931 /* ... fall through ... */
3933 case N_Op_Eq
: case N_Op_Ne
: case N_Op_Lt
:
3934 case N_Op_Le
: case N_Op_Gt
: case N_Op_Ge
:
3935 case N_Op_Add
: case N_Op_Subtract
: case N_Op_Multiply
:
3936 case N_Op_Mod
: case N_Op_Rem
:
3937 case N_Op_Rotate_Left
:
3938 case N_Op_Rotate_Right
:
3939 case N_Op_Shift_Left
:
3940 case N_Op_Shift_Right
:
3941 case N_Op_Shift_Right_Arithmetic
:
3942 case N_And_Then
: case N_Or_Else
:
3944 enum tree_code code
= gnu_codes
[Nkind (gnat_node
)];
3945 bool ignore_lhs_overflow
= false;
3948 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3949 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3950 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3952 /* If this is a comparison operator, convert any references to
3953 an unconstrained array value into a reference to the
3955 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3957 gnu_lhs
= maybe_unconstrained_array (gnu_lhs
);
3958 gnu_rhs
= maybe_unconstrained_array (gnu_rhs
);
3961 /* If the result type is a private type, its full view may be a
3962 numeric subtype. The representation we need is that of its base
3963 type, given that it is the result of an arithmetic operation. */
3964 else if (Is_Private_Type (Etype (gnat_node
)))
3965 gnu_type
= gnu_result_type
3966 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node
))));
3968 /* If this is a shift whose count is not guaranteed to be correct,
3969 we need to adjust the shift count. */
3970 if (IN (Nkind (gnat_node
), N_Op_Shift
)
3971 && !Shift_Count_OK (gnat_node
))
3973 tree gnu_count_type
= get_base_type (TREE_TYPE (gnu_rhs
));
3975 = convert (gnu_count_type
, TYPE_SIZE (gnu_type
));
3977 if (Nkind (gnat_node
) == N_Op_Rotate_Left
3978 || Nkind (gnat_node
) == N_Op_Rotate_Right
)
3979 gnu_rhs
= build_binary_op (TRUNC_MOD_EXPR
, gnu_count_type
,
3980 gnu_rhs
, gnu_max_shift
);
3981 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
)
3984 (MIN_EXPR
, gnu_count_type
,
3985 build_binary_op (MINUS_EXPR
,
3988 convert (gnu_count_type
,
3993 /* For right shifts, the type says what kind of shift to do,
3994 so we may need to choose a different type. In this case,
3995 we have to ignore integer overflow lest it propagates all
3996 the way down and causes a CE to be explicitly raised. */
3997 if (Nkind (gnat_node
) == N_Op_Shift_Right
3998 && !TYPE_UNSIGNED (gnu_type
))
4000 gnu_type
= gnat_unsigned_type (gnu_type
);
4001 ignore_lhs_overflow
= true;
4003 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
4004 && TYPE_UNSIGNED (gnu_type
))
4006 gnu_type
= gnat_signed_type (gnu_type
);
4007 ignore_lhs_overflow
= true;
4010 if (gnu_type
!= gnu_result_type
)
4012 tree gnu_old_lhs
= gnu_lhs
;
4013 gnu_lhs
= convert (gnu_type
, gnu_lhs
);
4014 if (TREE_CODE (gnu_lhs
) == INTEGER_CST
&& ignore_lhs_overflow
)
4015 TREE_OVERFLOW (gnu_lhs
) = TREE_OVERFLOW (gnu_old_lhs
);
4016 gnu_rhs
= convert (gnu_type
, gnu_rhs
);
4019 /* Instead of expanding overflow checks for addition, subtraction
4020 and multiplication itself, the front end will leave this to
4021 the back end when Backend_Overflow_Checks_On_Target is set.
4022 As the GCC back end itself does not know yet how to properly
4023 do overflow checking, do it here. The goal is to push
4024 the expansions further into the back end over time. */
4025 if (Do_Overflow_Check (gnat_node
) && Backend_Overflow_Checks_On_Target
4026 && (Nkind (gnat_node
) == N_Op_Add
4027 || Nkind (gnat_node
) == N_Op_Subtract
4028 || Nkind (gnat_node
) == N_Op_Multiply
)
4029 && !TYPE_UNSIGNED (gnu_type
)
4030 && !FLOAT_TYPE_P (gnu_type
))
4032 = build_binary_op_trapv (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
4034 gnu_result
= build_binary_op (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
4036 /* If this is a logical shift with the shift count not verified,
4037 we must return zero if it is too large. We cannot compensate
4038 above in this case. */
4039 if ((Nkind (gnat_node
) == N_Op_Shift_Left
4040 || Nkind (gnat_node
) == N_Op_Shift_Right
)
4041 && !Shift_Count_OK (gnat_node
))
4045 build_binary_op (GE_EXPR
, integer_type_node
,
4047 convert (TREE_TYPE (gnu_rhs
),
4048 TYPE_SIZE (gnu_type
))),
4049 convert (gnu_type
, integer_zero_node
),
4054 case N_Conditional_Expression
:
4056 tree gnu_cond
= gnat_to_gnu (First (Expressions (gnat_node
)));
4057 tree gnu_true
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
4059 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node
)))));
4061 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4062 gnu_result
= build_cond_expr (gnu_result_type
,
4063 gnat_truthvalue_conversion (gnu_cond
),
4064 gnu_true
, gnu_false
);
4069 gnu_result
= gnat_to_gnu (Right_Opnd (gnat_node
));
4070 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4074 /* This case can apply to a boolean or a modular type.
4075 Fall through for a boolean operand since GNU_CODES is set
4076 up to handle this. */
4077 if (Is_Modular_Integer_Type (Etype (gnat_node
))
4078 || (Ekind (Etype (gnat_node
)) == E_Private_Type
4079 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node
)))))
4081 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4082 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4083 gnu_result
= build_unary_op (BIT_NOT_EXPR
, gnu_result_type
,
4088 /* ... fall through ... */
4090 case N_Op_Minus
: case N_Op_Abs
:
4091 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4093 if (Ekind (Etype (gnat_node
)) != E_Private_Type
)
4094 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4096 gnu_result_type
= get_unpadded_type (Base_Type
4097 (Full_View (Etype (gnat_node
))));
4099 if (Do_Overflow_Check (gnat_node
)
4100 && !TYPE_UNSIGNED (gnu_result_type
)
4101 && !FLOAT_TYPE_P (gnu_result_type
))
4102 gnu_result
= build_unary_op_trapv (gnu_codes
[Nkind (gnat_node
)],
4103 gnu_result_type
, gnu_expr
);
4105 gnu_result
= build_unary_op (gnu_codes
[Nkind (gnat_node
)],
4106 gnu_result_type
, gnu_expr
);
4113 bool ignore_init_type
= false;
4115 gnat_temp
= Expression (gnat_node
);
4117 /* The Expression operand can either be an N_Identifier or
4118 Expanded_Name, which must represent a type, or a
4119 N_Qualified_Expression, which contains both the object type and an
4120 initial value for the object. */
4121 if (Nkind (gnat_temp
) == N_Identifier
4122 || Nkind (gnat_temp
) == N_Expanded_Name
)
4123 gnu_type
= gnat_to_gnu_type (Entity (gnat_temp
));
4124 else if (Nkind (gnat_temp
) == N_Qualified_Expression
)
4126 Entity_Id gnat_desig_type
4127 = Designated_Type (Underlying_Type (Etype (gnat_node
)));
4129 ignore_init_type
= Has_Constrained_Partial_View (gnat_desig_type
);
4130 gnu_init
= gnat_to_gnu (Expression (gnat_temp
));
4132 gnu_init
= maybe_unconstrained_array (gnu_init
);
4133 if (Do_Range_Check (Expression (gnat_temp
)))
4134 gnu_init
= emit_range_check (gnu_init
, gnat_desig_type
);
4136 if (Is_Elementary_Type (gnat_desig_type
)
4137 || Is_Constrained (gnat_desig_type
))
4139 gnu_type
= gnat_to_gnu_type (gnat_desig_type
);
4140 gnu_init
= convert (gnu_type
, gnu_init
);
4144 gnu_type
= gnat_to_gnu_type (Etype (Expression (gnat_temp
)));
4145 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
4146 gnu_type
= TREE_TYPE (gnu_init
);
4148 gnu_init
= convert (gnu_type
, gnu_init
);
4154 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4155 return build_allocator (gnu_type
, gnu_init
, gnu_result_type
,
4156 Procedure_To_Call (gnat_node
),
4157 Storage_Pool (gnat_node
), gnat_node
,
4162 /***************************/
4163 /* Chapter 5: Statements: */
4164 /***************************/
4167 gnu_result
= build1 (LABEL_EXPR
, void_type_node
,
4168 gnat_to_gnu (Identifier (gnat_node
)));
4171 case N_Null_Statement
:
4172 gnu_result
= alloc_stmt_list ();
4175 case N_Assignment_Statement
:
4176 /* Get the LHS and RHS of the statement and convert any reference to an
4177 unconstrained array into a reference to the underlying array.
4178 If we are not to do range checking and the RHS is an N_Function_Call,
4179 pass the LHS to the call function. */
4180 gnu_lhs
= maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node
)));
4182 /* If the type has a size that overflows, convert this into raise of
4183 Storage_Error: execution shouldn't have gotten here anyway. */
4184 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))) == INTEGER_CST
4185 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))))
4186 gnu_result
= build_call_raise (SE_Object_Too_Large
, gnat_node
,
4187 N_Raise_Storage_Error
);
4188 else if (Nkind (Expression (gnat_node
)) == N_Function_Call
4189 && !Do_Range_Check (Expression (gnat_node
)))
4190 gnu_result
= call_to_gnu (Expression (gnat_node
),
4191 &gnu_result_type
, gnu_lhs
);
4195 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node
)));
4197 /* If range check is needed, emit code to generate it. */
4198 if (Do_Range_Check (Expression (gnat_node
)))
4199 gnu_rhs
= emit_range_check (gnu_rhs
, Etype (Name (gnat_node
)));
4202 = build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_lhs
, gnu_rhs
);
4204 /* If the type being assigned is an array type and the two sides
4205 are not completely disjoint, play safe and use memmove. */
4206 if (TREE_CODE (gnu_result
) == MODIFY_EXPR
4207 && Is_Array_Type (Etype (Name (gnat_node
)))
4208 && !(Forwards_OK (gnat_node
) && Backwards_OK (gnat_node
)))
4210 tree to
, from
, size
, to_ptr
, from_ptr
, t
;
4212 to
= TREE_OPERAND (gnu_result
, 0);
4213 from
= TREE_OPERAND (gnu_result
, 1);
4215 size
= TYPE_SIZE_UNIT (TREE_TYPE (from
));
4216 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, from
);
4218 to_ptr
= build_fold_addr_expr (to
);
4219 from_ptr
= build_fold_addr_expr (from
);
4221 t
= implicit_built_in_decls
[BUILT_IN_MEMMOVE
];
4222 gnu_result
= build_call_expr (t
, 3, to_ptr
, from_ptr
, size
);
4227 case N_If_Statement
:
4229 tree
*gnu_else_ptr
; /* Point to put next "else if" or "else". */
4231 /* Make the outer COND_EXPR. Avoid non-determinism. */
4232 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4233 gnat_to_gnu (Condition (gnat_node
)),
4234 NULL_TREE
, NULL_TREE
);
4235 COND_EXPR_THEN (gnu_result
)
4236 = build_stmt_group (Then_Statements (gnat_node
), false);
4237 TREE_SIDE_EFFECTS (gnu_result
) = 1;
4238 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_result
);
4240 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4241 into the previous "else" part and point to where to put any
4242 outer "else". Also avoid non-determinism. */
4243 if (Present (Elsif_Parts (gnat_node
)))
4244 for (gnat_temp
= First (Elsif_Parts (gnat_node
));
4245 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
4247 gnu_expr
= build3 (COND_EXPR
, void_type_node
,
4248 gnat_to_gnu (Condition (gnat_temp
)),
4249 NULL_TREE
, NULL_TREE
);
4250 COND_EXPR_THEN (gnu_expr
)
4251 = build_stmt_group (Then_Statements (gnat_temp
), false);
4252 TREE_SIDE_EFFECTS (gnu_expr
) = 1;
4253 set_expr_location_from_node (gnu_expr
, gnat_temp
);
4254 *gnu_else_ptr
= gnu_expr
;
4255 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
4258 *gnu_else_ptr
= build_stmt_group (Else_Statements (gnat_node
), false);
4262 case N_Case_Statement
:
4263 gnu_result
= Case_Statement_to_gnu (gnat_node
);
4266 case N_Loop_Statement
:
4267 gnu_result
= Loop_Statement_to_gnu (gnat_node
);
4270 case N_Block_Statement
:
4271 start_stmt_group ();
4273 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4274 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4276 gnu_result
= end_stmt_group ();
4278 if (Present (Identifier (gnat_node
)))
4279 mark_out_of_scope (Entity (Identifier (gnat_node
)));
4282 case N_Exit_Statement
:
4284 = build2 (EXIT_STMT
, void_type_node
,
4285 (Present (Condition (gnat_node
))
4286 ? gnat_to_gnu (Condition (gnat_node
)) : NULL_TREE
),
4287 (Present (Name (gnat_node
))
4288 ? get_gnu_tree (Entity (Name (gnat_node
)))
4289 : TREE_VALUE (gnu_loop_label_stack
)));
4292 case N_Return_Statement
:
4294 /* The gnu function type of the subprogram currently processed. */
4295 tree gnu_subprog_type
= TREE_TYPE (current_function_decl
);
4296 /* The return value from the subprogram. */
4297 tree gnu_ret_val
= NULL_TREE
;
4298 /* The place to put the return value. */
4301 /* If we are dealing with a "return;" from an Ada procedure with
4302 parameters passed by copy in copy out, we need to return a record
4303 containing the final values of these parameters. If the list
4304 contains only one entry, return just that entry.
4306 For a full description of the copy in copy out parameter mechanism,
4307 see the part of the gnat_to_gnu_entity routine dealing with the
4308 translation of subprograms.
4310 But if we have a return label defined, convert this into
4311 a branch to that label. */
4313 if (TREE_VALUE (gnu_return_label_stack
))
4315 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4316 TREE_VALUE (gnu_return_label_stack
));
4320 else if (TYPE_CI_CO_LIST (gnu_subprog_type
))
4322 gnu_lhs
= DECL_RESULT (current_function_decl
);
4323 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type
)) == 1)
4324 gnu_ret_val
= TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type
));
4327 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
4328 TYPE_CI_CO_LIST (gnu_subprog_type
));
4331 /* If the Ada subprogram is a function, we just need to return the
4332 expression. If the subprogram returns an unconstrained
4333 array, we have to allocate a new version of the result and
4334 return it. If we return by reference, return a pointer. */
4336 else if (Present (Expression (gnat_node
)))
4338 /* If the current function returns by target pointer and we
4339 are doing a call, pass that target to the call. */
4340 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
)
4341 && Nkind (Expression (gnat_node
)) == N_Function_Call
)
4344 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
4345 DECL_ARGUMENTS (current_function_decl
));
4346 gnu_result
= call_to_gnu (Expression (gnat_node
),
4347 &gnu_result_type
, gnu_lhs
);
4351 gnu_ret_val
= gnat_to_gnu (Expression (gnat_node
));
4353 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4354 /* The original return type was unconstrained so dereference
4355 the TARGET pointer in the actual return value's type. */
4357 = build_unary_op (INDIRECT_REF
, TREE_TYPE (gnu_ret_val
),
4358 DECL_ARGUMENTS (current_function_decl
));
4360 gnu_lhs
= DECL_RESULT (current_function_decl
);
4362 /* Do not remove the padding from GNU_RET_VAL if the inner
4363 type is self-referential since we want to allocate the fixed
4364 size in that case. */
4365 if (TREE_CODE (gnu_ret_val
) == COMPONENT_REF
4366 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0)))
4368 && (TYPE_IS_PADDING_P
4369 (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0))))
4370 && (CONTAINS_PLACEHOLDER_P
4371 (TYPE_SIZE (TREE_TYPE (gnu_ret_val
)))))
4372 gnu_ret_val
= TREE_OPERAND (gnu_ret_val
, 0);
4374 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type
)
4375 || By_Ref (gnat_node
))
4377 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_ret_val
);
4379 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
))
4381 gnu_ret_val
= maybe_unconstrained_array (gnu_ret_val
);
4383 = build_allocator (TREE_TYPE (gnu_ret_val
),
4385 TREE_TYPE (gnu_subprog_type
),
4386 Procedure_To_Call (gnat_node
),
4387 Storage_Pool (gnat_node
),
4393 /* If the Ada subprogram is a regular procedure, just return. */
4394 gnu_lhs
= NULL_TREE
;
4396 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4399 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
4400 gnu_lhs
, gnu_ret_val
);
4401 add_stmt_with_node (gnu_result
, gnat_node
);
4402 gnu_lhs
= NULL_TREE
;
4405 gnu_result
= build_return_expr (gnu_lhs
, gnu_ret_val
);
4409 case N_Goto_Statement
:
4410 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4411 gnat_to_gnu (Name (gnat_node
)));
4414 /****************************/
4415 /* Chapter 6: Subprograms: */
4416 /****************************/
4418 case N_Subprogram_Declaration
:
4419 /* Unless there is a freeze node, declare the subprogram. We consider
4420 this a "definition" even though we're not generating code for
4421 the subprogram because we will be making the corresponding GCC
4424 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node
)))))
4425 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node
)),
4427 gnu_result
= alloc_stmt_list ();
4430 case N_Abstract_Subprogram_Declaration
:
4431 /* This subprogram doesn't exist for code generation purposes, but we
4432 have to elaborate the types of any parameters and result, unless
4433 they are imported types (nothing to generate in this case). */
4435 /* Process the parameter types first. */
4438 = First_Formal_With_Extras
4439 (Defining_Entity (Specification (gnat_node
)));
4440 Present (gnat_temp
);
4441 gnat_temp
= Next_Formal_With_Extras (gnat_temp
))
4442 if (Is_Itype (Etype (gnat_temp
))
4443 && !From_With_Type (Etype (gnat_temp
)))
4444 gnat_to_gnu_entity (Etype (gnat_temp
), NULL_TREE
, 0);
4447 /* Then the result type, set to Standard_Void_Type for procedures. */
4450 Entity_Id gnat_temp_type
4451 = Etype (Defining_Entity (Specification (gnat_node
)));
4453 if (Is_Itype (gnat_temp_type
) && !From_With_Type (gnat_temp_type
))
4454 gnat_to_gnu_entity (Etype (gnat_temp_type
), NULL_TREE
, 0);
4457 gnu_result
= alloc_stmt_list ();
4460 case N_Defining_Program_Unit_Name
:
4461 /* For a child unit identifier go up a level to get the
4462 specification. We get this when we try to find the spec of
4463 a child unit package that is the compilation unit being compiled. */
4464 gnu_result
= gnat_to_gnu (Parent (gnat_node
));
4467 case N_Subprogram_Body
:
4468 Subprogram_Body_to_gnu (gnat_node
);
4469 gnu_result
= alloc_stmt_list ();
4472 case N_Function_Call
:
4473 case N_Procedure_Call_Statement
:
4474 gnu_result
= call_to_gnu (gnat_node
, &gnu_result_type
, NULL_TREE
);
4477 /*************************/
4478 /* Chapter 7: Packages: */
4479 /*************************/
4481 case N_Package_Declaration
:
4482 gnu_result
= gnat_to_gnu (Specification (gnat_node
));
4485 case N_Package_Specification
:
4487 start_stmt_group ();
4488 process_decls (Visible_Declarations (gnat_node
),
4489 Private_Declarations (gnat_node
), Empty
, true, true);
4490 gnu_result
= end_stmt_group ();
4493 case N_Package_Body
:
4495 /* If this is the body of a generic package - do nothing */
4496 if (Ekind (Corresponding_Spec (gnat_node
)) == E_Generic_Package
)
4498 gnu_result
= alloc_stmt_list ();
4502 start_stmt_group ();
4503 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4505 if (Present (Handled_Statement_Sequence (gnat_node
)))
4506 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4508 gnu_result
= end_stmt_group ();
4511 /*********************************/
4512 /* Chapter 8: Visibility Rules: */
4513 /*********************************/
4515 case N_Use_Package_Clause
:
4516 case N_Use_Type_Clause
:
4517 /* Nothing to do here - but these may appear in list of declarations */
4518 gnu_result
= alloc_stmt_list ();
4521 /***********************/
4522 /* Chapter 9: Tasks: */
4523 /***********************/
4525 case N_Protected_Type_Declaration
:
4526 gnu_result
= alloc_stmt_list ();
4529 case N_Single_Task_Declaration
:
4530 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
4531 gnu_result
= alloc_stmt_list ();
4534 /***********************************************************/
4535 /* Chapter 10: Program Structure and Compilation Issues: */
4536 /***********************************************************/
4538 case N_Compilation_Unit
:
4540 /* This is not called for the main unit, which is handled in function
4542 start_stmt_group ();
4545 Compilation_Unit_to_gnu (gnat_node
);
4546 gnu_result
= alloc_stmt_list ();
4549 case N_Subprogram_Body_Stub
:
4550 case N_Package_Body_Stub
:
4551 case N_Protected_Body_Stub
:
4552 case N_Task_Body_Stub
:
4553 /* Simply process whatever unit is being inserted. */
4554 gnu_result
= gnat_to_gnu (Unit (Library_Unit (gnat_node
)));
4558 gnu_result
= gnat_to_gnu (Proper_Body (gnat_node
));
4561 /***************************/
4562 /* Chapter 11: Exceptions: */
4563 /***************************/
4565 case N_Handled_Sequence_Of_Statements
:
4566 /* If there is an At_End procedure attached to this node, and the EH
4567 mechanism is SJLJ, we must have at least a corresponding At_End
4568 handler, unless the No_Exception_Handlers restriction is set. */
4569 gcc_assert (type_annotate_only
4570 || Exception_Mechanism
!= Setjmp_Longjmp
4571 || No (At_End_Proc (gnat_node
))
4572 || Present (Exception_Handlers (gnat_node
))
4573 || No_Exception_Handlers_Set ());
4575 gnu_result
= Handled_Sequence_Of_Statements_to_gnu (gnat_node
);
4578 case N_Exception_Handler
:
4579 if (Exception_Mechanism
== Setjmp_Longjmp
)
4580 gnu_result
= Exception_Handler_to_gnu_sjlj (gnat_node
);
4581 else if (Exception_Mechanism
== Back_End_Exceptions
)
4582 gnu_result
= Exception_Handler_to_gnu_zcx (gnat_node
);
4588 case N_Push_Constraint_Error_Label
:
4589 push_exception_label_stack (&gnu_constraint_error_label_stack
,
4590 Exception_Label (gnat_node
));
4593 case N_Push_Storage_Error_Label
:
4594 push_exception_label_stack (&gnu_storage_error_label_stack
,
4595 Exception_Label (gnat_node
));
4598 case N_Push_Program_Error_Label
:
4599 push_exception_label_stack (&gnu_program_error_label_stack
,
4600 Exception_Label (gnat_node
));
4603 case N_Pop_Constraint_Error_Label
:
4604 gnu_constraint_error_label_stack
4605 = TREE_CHAIN (gnu_constraint_error_label_stack
);
4608 case N_Pop_Storage_Error_Label
:
4609 gnu_storage_error_label_stack
4610 = TREE_CHAIN (gnu_storage_error_label_stack
);
4613 case N_Pop_Program_Error_Label
:
4614 gnu_program_error_label_stack
4615 = TREE_CHAIN (gnu_program_error_label_stack
);
4618 /*******************************/
4619 /* Chapter 12: Generic Units: */
4620 /*******************************/
4622 case N_Generic_Function_Renaming_Declaration
:
4623 case N_Generic_Package_Renaming_Declaration
:
4624 case N_Generic_Procedure_Renaming_Declaration
:
4625 case N_Generic_Package_Declaration
:
4626 case N_Generic_Subprogram_Declaration
:
4627 case N_Package_Instantiation
:
4628 case N_Procedure_Instantiation
:
4629 case N_Function_Instantiation
:
4630 /* These nodes can appear on a declaration list but there is nothing to
4631 to be done with them. */
4632 gnu_result
= alloc_stmt_list ();
4635 /***************************************************/
4636 /* Chapter 13: Representation Clauses and */
4637 /* Implementation-Dependent Features: */
4638 /***************************************************/
4640 case N_Attribute_Definition_Clause
:
4641 gnu_result
= alloc_stmt_list ();
4643 /* The only one we need to deal with is 'Address since, for the others,
4644 the front-end puts the information elsewhere. */
4645 if (Get_Attribute_Id (Chars (gnat_node
)) != Attr_Address
)
4648 /* And we only deal with 'Address if the object has a Freeze node. */
4649 gnat_temp
= Entity (Name (gnat_node
));
4650 if (No (Freeze_Node (gnat_temp
)))
4653 /* Get the value to use as the address and save it as the equivalent
4654 for the object. When it is frozen, gnat_to_gnu_entity will do the
4656 save_gnu_tree (gnat_temp
, gnat_to_gnu (Expression (gnat_node
)), true);
4659 case N_Enumeration_Representation_Clause
:
4660 case N_Record_Representation_Clause
:
4662 /* We do nothing with these. SEM puts the information elsewhere. */
4663 gnu_result
= alloc_stmt_list ();
4666 case N_Code_Statement
:
4667 if (!type_annotate_only
)
4669 tree gnu_template
= gnat_to_gnu (Asm_Template (gnat_node
));
4670 tree gnu_inputs
= NULL_TREE
, gnu_outputs
= NULL_TREE
;
4671 tree gnu_clobbers
= NULL_TREE
, tail
;
4672 bool allows_mem
, allows_reg
, fake
;
4673 int ninputs
, noutputs
, i
;
4674 const char **oconstraints
;
4675 const char *constraint
;
4678 /* First retrieve the 3 operand lists built by the front-end. */
4679 Setup_Asm_Outputs (gnat_node
);
4680 while (Present (gnat_temp
= Asm_Output_Variable ()))
4682 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4683 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4684 (Asm_Output_Constraint ()));
4686 gnu_outputs
= tree_cons (gnu_constr
, gnu_value
, gnu_outputs
);
4690 Setup_Asm_Inputs (gnat_node
);
4691 while (Present (gnat_temp
= Asm_Input_Value ()))
4693 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4694 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4695 (Asm_Input_Constraint ()));
4697 gnu_inputs
= tree_cons (gnu_constr
, gnu_value
, gnu_inputs
);
4701 Clobber_Setup (gnat_node
);
4702 while ((clobber
= Clobber_Get_Next ()))
4704 = tree_cons (NULL_TREE
,
4705 build_string (strlen (clobber
) + 1, clobber
),
4708 /* Then perform some standard checking and processing on the
4709 operands. In particular, mark them addressable if needed. */
4710 gnu_outputs
= nreverse (gnu_outputs
);
4711 noutputs
= list_length (gnu_outputs
);
4712 gnu_inputs
= nreverse (gnu_inputs
);
4713 ninputs
= list_length (gnu_inputs
);
4715 = (const char **) alloca (noutputs
* sizeof (const char *));
4717 for (i
= 0, tail
= gnu_outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4719 tree output
= TREE_VALUE (tail
);
4721 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4722 oconstraints
[i
] = constraint
;
4724 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
4725 &allows_mem
, &allows_reg
, &fake
))
4727 /* If the operand is going to end up in memory,
4728 mark it addressable. Note that we don't test
4729 allows_mem like in the input case below; this
4730 is modelled on the C front-end. */
4732 && !gnat_mark_addressable (output
))
4733 output
= error_mark_node
;
4736 output
= error_mark_node
;
4738 TREE_VALUE (tail
) = output
;
4741 for (i
= 0, tail
= gnu_inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4743 tree input
= TREE_VALUE (tail
);
4745 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4747 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
,
4749 &allows_mem
, &allows_reg
))
4751 /* If the operand is going to end up in memory,
4752 mark it addressable. */
4753 if (!allows_reg
&& allows_mem
4754 && !gnat_mark_addressable (input
))
4755 input
= error_mark_node
;
4758 input
= error_mark_node
;
4760 TREE_VALUE (tail
) = input
;
4763 gnu_result
= build4 (ASM_EXPR
, void_type_node
,
4764 gnu_template
, gnu_outputs
,
4765 gnu_inputs
, gnu_clobbers
);
4766 ASM_VOLATILE_P (gnu_result
) = Is_Asm_Volatile (gnat_node
);
4769 gnu_result
= alloc_stmt_list ();
4773 /***************************************************/
4775 /***************************************************/
4777 case N_Freeze_Entity
:
4778 start_stmt_group ();
4779 process_freeze_entity (gnat_node
);
4780 process_decls (Actions (gnat_node
), Empty
, Empty
, true, true);
4781 gnu_result
= end_stmt_group ();
4784 case N_Itype_Reference
:
4785 if (!present_gnu_tree (Itype (gnat_node
)))
4786 process_type (Itype (gnat_node
));
4788 gnu_result
= alloc_stmt_list ();
4791 case N_Free_Statement
:
4792 if (!type_annotate_only
)
4794 tree gnu_ptr
= gnat_to_gnu (Expression (gnat_node
));
4795 tree gnu_ptr_type
= TREE_TYPE (gnu_ptr
);
4797 tree gnu_actual_obj_type
= 0;
4800 unsigned int default_allocator_alignment
4801 = get_target_default_allocator_alignment () * BITS_PER_UNIT
;
4803 /* If this is a thin pointer, we must dereference it to create
4804 a fat pointer, then go back below to a thin pointer. The
4805 reason for this is that we need a fat pointer someplace in
4806 order to properly compute the size. */
4807 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr
)))
4808 gnu_ptr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
4809 build_unary_op (INDIRECT_REF
, NULL_TREE
,
4812 /* If this is an unconstrained array, we know the object must
4813 have been allocated with the template in front of the object.
4814 So pass the template address, but get the total size. Do this
4815 by converting to a thin pointer. */
4816 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr
)))
4818 = convert (build_pointer_type
4819 (TYPE_OBJECT_RECORD_TYPE
4820 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr
)))),
4823 gnu_obj_type
= TREE_TYPE (TREE_TYPE (gnu_ptr
));
4825 if (Present (Actual_Designated_Subtype (gnat_node
)))
4828 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node
));
4830 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4832 = build_unc_object_type_from_ptr (gnu_ptr_type
,
4833 gnu_actual_obj_type
,
4834 get_identifier ("DEALLOC"));
4837 gnu_actual_obj_type
= gnu_obj_type
;
4839 gnu_obj_size
= TYPE_SIZE_UNIT (gnu_actual_obj_type
);
4840 align
= TYPE_ALIGN (gnu_obj_type
);
4842 if (TREE_CODE (gnu_obj_type
) == RECORD_TYPE
4843 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type
))
4845 tree gnu_char_ptr_type
= build_pointer_type (char_type_node
);
4846 tree gnu_pos
= byte_position (TYPE_FIELDS (gnu_obj_type
));
4847 tree gnu_byte_offset
4848 = convert (sizetype
,
4849 size_diffop (size_zero_node
, gnu_pos
));
4850 gnu_byte_offset
= fold_build1 (NEGATE_EXPR
, sizetype
, gnu_byte_offset
);
4852 gnu_ptr
= convert (gnu_char_ptr_type
, gnu_ptr
);
4853 gnu_ptr
= build_binary_op (POINTER_PLUS_EXPR
, gnu_char_ptr_type
,
4854 gnu_ptr
, gnu_byte_offset
);
4857 /* If the object was allocated from the default storage pool, the
4858 alignment was greater than what the allocator provides, and this
4859 is not a fat or thin pointer, what we have in gnu_ptr here is an
4860 address dynamically adjusted to match the alignment requirement
4861 (see build_allocator). What we need to pass to free is the
4862 initial allocator's return value, which has been stored just in
4863 front of the block we have. */
4865 if (No (Procedure_To_Call (gnat_node
))
4866 && align
> default_allocator_alignment
4867 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4870 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
4874 = (void *)GNU_PTR - (void *)sizeof (void *)) */
4877 (POINTER_PLUS_EXPR
, ptr_void_type_node
,
4878 convert (ptr_void_type_node
, gnu_ptr
),
4879 size_int (-POINTER_SIZE
/BITS_PER_UNIT
));
4881 /* GNU_PTR (void *) = *(void **)GNU_PTR */
4884 (INDIRECT_REF
, NULL_TREE
,
4885 convert (build_pointer_type (ptr_void_type_node
),
4889 gnu_result
= build_call_alloc_dealloc (gnu_ptr
, gnu_obj_size
, align
,
4890 Procedure_To_Call (gnat_node
),
4891 Storage_Pool (gnat_node
),
4896 case N_Raise_Constraint_Error
:
4897 case N_Raise_Program_Error
:
4898 case N_Raise_Storage_Error
:
4899 if (type_annotate_only
)
4901 gnu_result
= alloc_stmt_list ();
4905 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4907 = build_call_raise (UI_To_Int (Reason (gnat_node
)), gnat_node
,
4910 /* If the type is VOID, this is a statement, so we need to
4911 generate the code for the call. Handle a Condition, if there
4913 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
4915 set_expr_location_from_node (gnu_result
, gnat_node
);
4917 if (Present (Condition (gnat_node
)))
4918 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4919 gnat_to_gnu (Condition (gnat_node
)),
4920 gnu_result
, alloc_stmt_list ());
4923 gnu_result
= build1 (NULL_EXPR
, gnu_result_type
, gnu_result
);
4926 case N_Validate_Unchecked_Conversion
:
4928 Entity_Id gnat_target_type
= Target_Type (gnat_node
);
4929 tree gnu_source_type
= gnat_to_gnu_type (Source_Type (gnat_node
));
4930 tree gnu_target_type
= gnat_to_gnu_type (gnat_target_type
);
4932 /* No need for any warning in this case. */
4933 if (!flag_strict_aliasing
)
4936 /* If the result is a pointer type, see if we are either converting
4937 from a non-pointer or from a pointer to a type with a different
4938 alias set and warn if so. If the result is defined in the same
4939 unit as this unchecked conversion, we can allow this because we
4940 can know to make the pointer type behave properly. */
4941 else if (POINTER_TYPE_P (gnu_target_type
)
4942 && !In_Same_Source_Unit (gnat_target_type
, gnat_node
)
4943 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type
)))
4945 tree gnu_source_desig_type
= POINTER_TYPE_P (gnu_source_type
)
4946 ? TREE_TYPE (gnu_source_type
)
4948 tree gnu_target_desig_type
= TREE_TYPE (gnu_target_type
);
4950 if ((TYPE_DUMMY_P (gnu_target_desig_type
)
4951 || get_alias_set (gnu_target_desig_type
) != 0)
4952 && (!POINTER_TYPE_P (gnu_source_type
)
4953 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4954 != TYPE_DUMMY_P (gnu_target_desig_type
))
4955 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4956 && gnu_source_desig_type
!= gnu_target_desig_type
)
4957 || !alias_sets_conflict_p
4958 (get_alias_set (gnu_source_desig_type
),
4959 get_alias_set (gnu_target_desig_type
))))
4962 ("?possible aliasing problem for type&",
4963 gnat_node
, Target_Type (gnat_node
));
4965 ("\\?use -fno-strict-aliasing switch for references",
4968 ("\\?or use `pragma No_Strict_Aliasing (&);`",
4969 gnat_node
, Target_Type (gnat_node
));
4973 /* But if the result is a fat pointer type, we have no mechanism to
4974 do that, so we unconditionally warn in problematic cases. */
4975 else if (TYPE_FAT_POINTER_P (gnu_target_type
))
4977 tree gnu_source_array_type
4978 = TYPE_FAT_POINTER_P (gnu_source_type
)
4979 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type
)))
4981 tree gnu_target_array_type
4982 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type
)));
4984 if ((TYPE_DUMMY_P (gnu_target_array_type
)
4985 || get_alias_set (gnu_target_array_type
) != 0)
4986 && (!TYPE_FAT_POINTER_P (gnu_source_type
)
4987 || (TYPE_DUMMY_P (gnu_source_array_type
)
4988 != TYPE_DUMMY_P (gnu_target_array_type
))
4989 || (TYPE_DUMMY_P (gnu_source_array_type
)
4990 && gnu_source_array_type
!= gnu_target_array_type
)
4991 || !alias_sets_conflict_p
4992 (get_alias_set (gnu_source_array_type
),
4993 get_alias_set (gnu_target_array_type
))))
4996 ("?possible aliasing problem for type&",
4997 gnat_node
, Target_Type (gnat_node
));
4999 ("\\?use -fno-strict-aliasing switch for references",
5004 gnu_result
= alloc_stmt_list ();
5007 case N_Raise_Statement
:
5008 case N_Function_Specification
:
5009 case N_Procedure_Specification
:
5011 case N_Component_Association
:
5014 gcc_assert (type_annotate_only
);
5015 gnu_result
= alloc_stmt_list ();
5018 /* If we pushed our level as part of processing the elaboration routine,
5020 if (went_into_elab_proc
)
5022 add_stmt (gnu_result
);
5024 gnu_result
= end_stmt_group ();
5025 current_function_decl
= NULL_TREE
;
5028 /* Set the location information on the result if it is a real expression.
5029 References can be reused for multiple GNAT nodes and they would get
5030 the location information of their last use. Note that we may have
5031 no result if we tried to build a CALL_EXPR node to a procedure with
5032 no side-effects and optimization is enabled. */
5034 && EXPR_P (gnu_result
)
5035 && TREE_CODE (gnu_result
) != NOP_EXPR
5036 && !REFERENCE_CLASS_P (gnu_result
))
5037 set_expr_location_from_node (gnu_result
, gnat_node
);
5039 /* If we're supposed to return something of void_type, it means we have
5040 something we're elaborating for effect, so just return. */
5041 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
5044 /* If the result is a constant that overflows, raise constraint error. */
5045 else if (TREE_CODE (gnu_result
) == INTEGER_CST
5046 && TREE_OVERFLOW (gnu_result
))
5048 post_error ("Constraint_Error will be raised at run-time?", gnat_node
);
5051 = build1 (NULL_EXPR
, gnu_result_type
,
5052 build_call_raise (CE_Overflow_Check_Failed
, gnat_node
,
5053 N_Raise_Constraint_Error
));
5056 /* If our result has side-effects and is of an unconstrained type,
5057 make a SAVE_EXPR so that we can be sure it will only be referenced
5058 once. Note we must do this before any conversions. */
5059 if (TREE_SIDE_EFFECTS (gnu_result
)
5060 && (TREE_CODE (gnu_result_type
) == UNCONSTRAINED_ARRAY_TYPE
5061 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))))
5062 gnu_result
= gnat_stabilize_reference (gnu_result
, false);
5064 /* Now convert the result to the result type, unless we are in one of the
5067 1. If this is the Name of an assignment statement or a parameter of
5068 a procedure call, return the result almost unmodified since the
5069 RHS will have to be converted to our type in that case, unless
5070 the result type has a simpler size. Similarly, don't convert
5071 integral types that are the operands of an unchecked conversion
5072 since we need to ignore those conversions (for 'Valid).
5074 2. If we have a label (which doesn't have any well-defined type), a
5075 field or an error, return the result almost unmodified. Also don't
5076 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5077 its size since those are the cases where the front end may have the
5078 type wrong due to "instantiating" the unconstrained record with
5079 discriminant values. Similarly, if the two types are record types
5080 with the same name don't convert. This will be the case when we are
5081 converting from a packable version of a type to its original type and
5082 we need those conversions to be NOPs in order for assignments into
5083 these types to work properly.
5085 3. If the type is void or if we have no result, return error_mark_node
5086 to show we have no result.
5088 4. Finally, if the type of the result is already correct. */
5090 if (Present (Parent (gnat_node
))
5091 && ((Nkind (Parent (gnat_node
)) == N_Assignment_Statement
5092 && Name (Parent (gnat_node
)) == gnat_node
)
5093 || (Nkind (Parent (gnat_node
)) == N_Procedure_Call_Statement
5094 && Name (Parent (gnat_node
)) != gnat_node
)
5095 || Nkind (Parent (gnat_node
)) == N_Parameter_Association
5096 || (Nkind (Parent (gnat_node
)) == N_Unchecked_Type_Conversion
5097 && !AGGREGATE_TYPE_P (gnu_result_type
)
5098 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
))))
5099 && !(TYPE_SIZE (gnu_result_type
)
5100 && TYPE_SIZE (TREE_TYPE (gnu_result
))
5101 && (AGGREGATE_TYPE_P (gnu_result_type
)
5102 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
)))
5103 && ((TREE_CODE (TYPE_SIZE (gnu_result_type
)) == INTEGER_CST
5104 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result
)))
5106 || (TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5107 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))
5108 && (CONTAINS_PLACEHOLDER_P
5109 (TYPE_SIZE (TREE_TYPE (gnu_result
))))))
5110 && !(TREE_CODE (gnu_result_type
) == RECORD_TYPE
5111 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type
))))
5113 /* Remove padding only if the inner object is of self-referential
5114 size: in that case it must be an object of unconstrained type
5115 with a default discriminant and we want to avoid copying too
5117 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5118 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
))
5119 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5120 (TREE_TYPE (gnu_result
))))))
5121 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5125 else if (TREE_CODE (gnu_result
) == LABEL_DECL
5126 || TREE_CODE (gnu_result
) == FIELD_DECL
5127 || TREE_CODE (gnu_result
) == ERROR_MARK
5128 || (TYPE_SIZE (gnu_result_type
)
5129 && TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5130 && TREE_CODE (gnu_result
) != INDIRECT_REF
5131 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
)))
5132 || ((TYPE_NAME (gnu_result_type
)
5133 == TYPE_NAME (TREE_TYPE (gnu_result
)))
5134 && TREE_CODE (gnu_result_type
) == RECORD_TYPE
5135 && TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
))
5137 /* Remove any padding. */
5138 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5139 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
5140 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5144 else if (gnu_result
== error_mark_node
|| gnu_result_type
== void_type_node
)
5145 gnu_result
= error_mark_node
;
5147 else if (gnu_result_type
!= TREE_TYPE (gnu_result
))
5148 gnu_result
= convert (gnu_result_type
, gnu_result
);
5150 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5151 while ((TREE_CODE (gnu_result
) == NOP_EXPR
5152 || TREE_CODE (gnu_result
) == NON_LVALUE_EXPR
)
5153 && TREE_TYPE (TREE_OPERAND (gnu_result
, 0)) == TREE_TYPE (gnu_result
))
5154 gnu_result
= TREE_OPERAND (gnu_result
, 0);
5159 /* Subroutine of above to push the exception label stack. GNU_STACK is
5160 a pointer to the stack to update and GNAT_LABEL, if present, is the
5161 label to push onto the stack. */
5164 push_exception_label_stack (tree
*gnu_stack
, Entity_Id gnat_label
)
5166 tree gnu_label
= (Present (gnat_label
)
5167 ? gnat_to_gnu_entity (gnat_label
, NULL_TREE
, 0)
5170 *gnu_stack
= tree_cons (NULL_TREE
, gnu_label
, *gnu_stack
);
5173 /* Record the current code position in GNAT_NODE. */
5176 record_code_position (Node_Id gnat_node
)
5178 tree stmt_stmt
= build1 (STMT_STMT
, void_type_node
, NULL_TREE
);
5180 add_stmt_with_node (stmt_stmt
, gnat_node
);
5181 save_gnu_tree (gnat_node
, stmt_stmt
, true);
5184 /* Insert the code for GNAT_NODE at the position saved for that node. */
5187 insert_code_for (Node_Id gnat_node
)
5189 STMT_STMT_STMT (get_gnu_tree (gnat_node
)) = gnat_to_gnu (gnat_node
);
5190 save_gnu_tree (gnat_node
, NULL_TREE
, true);
5193 /* Start a new statement group chained to the previous group. */
5196 start_stmt_group (void)
5198 struct stmt_group
*group
= stmt_group_free_list
;
5200 /* First see if we can get one from the free list. */
5202 stmt_group_free_list
= group
->previous
;
5204 group
= (struct stmt_group
*) ggc_alloc (sizeof (struct stmt_group
));
5206 group
->previous
= current_stmt_group
;
5207 group
->stmt_list
= group
->block
= group
->cleanups
= NULL_TREE
;
5208 current_stmt_group
= group
;
5211 /* Add GNU_STMT to the current statement group. */
5214 add_stmt (tree gnu_stmt
)
5216 append_to_statement_list (gnu_stmt
, ¤t_stmt_group
->stmt_list
);
5219 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5222 add_stmt_with_node (tree gnu_stmt
, Node_Id gnat_node
)
5224 if (Present (gnat_node
))
5225 set_expr_location_from_node (gnu_stmt
, gnat_node
);
5226 add_stmt (gnu_stmt
);
5229 /* Add a declaration statement for GNU_DECL to the current statement group.
5230 Get SLOC from Entity_Id. */
5233 add_decl_expr (tree gnu_decl
, Entity_Id gnat_entity
)
5235 tree type
= TREE_TYPE (gnu_decl
);
5236 tree gnu_stmt
, gnu_init
, t
;
5238 /* If this is a variable that Gigi is to ignore, we may have been given
5239 an ERROR_MARK. So test for it. We also might have been given a
5240 reference for a renaming. So only do something for a decl. Also
5241 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5242 if (!DECL_P (gnu_decl
)
5243 || (TREE_CODE (gnu_decl
) == TYPE_DECL
5244 && TREE_CODE (type
) == UNCONSTRAINED_ARRAY_TYPE
))
5247 gnu_stmt
= build1 (DECL_EXPR
, void_type_node
, gnu_decl
);
5249 /* If we are global, we don't want to actually output the DECL_EXPR for
5250 this decl since we already have evaluated the expressions in the
5251 sizes and positions as globals and doing it again would be wrong. */
5252 if (global_bindings_p ())
5254 /* Mark everything as used to prevent node sharing with subprograms.
5255 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5256 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5257 mark_visited (&gnu_stmt
);
5258 if (TREE_CODE (gnu_decl
) == VAR_DECL
5259 || TREE_CODE (gnu_decl
) == CONST_DECL
)
5261 mark_visited (&DECL_SIZE (gnu_decl
));
5262 mark_visited (&DECL_SIZE_UNIT (gnu_decl
));
5263 mark_visited (&DECL_INITIAL (gnu_decl
));
5265 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5266 if (TREE_CODE (gnu_decl
) == TYPE_DECL
5267 && (TREE_CODE (type
) == RECORD_TYPE
5268 || TREE_CODE (type
) == UNION_TYPE
5269 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5270 && (t
= TYPE_ADA_SIZE (type
)))
5274 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5276 /* If this is a variable and an initializer is attached to it, it must be
5277 valid for the context. Similar to init_const in create_var_decl_1. */
5278 if (TREE_CODE (gnu_decl
) == VAR_DECL
5279 && (gnu_init
= DECL_INITIAL (gnu_decl
)) != NULL_TREE
5280 && (!gnat_types_compatible_p (type
, TREE_TYPE (gnu_init
))
5281 || (TREE_STATIC (gnu_decl
)
5282 && !initializer_constant_valid_p (gnu_init
,
5283 TREE_TYPE (gnu_init
)))))
5285 /* If GNU_DECL has a padded type, convert it to the unpadded
5286 type so the assignment is done properly. */
5287 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_IS_PADDING_P (type
))
5288 t
= convert (TREE_TYPE (TYPE_FIELDS (type
)), gnu_decl
);
5292 gnu_stmt
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, t
, gnu_init
);
5294 DECL_INITIAL (gnu_decl
) = NULL_TREE
;
5295 if (TREE_READONLY (gnu_decl
))
5297 TREE_READONLY (gnu_decl
) = 0;
5298 DECL_READONLY_ONCE_ELAB (gnu_decl
) = 1;
5301 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5305 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5308 mark_visited_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5310 if (TREE_VISITED (*tp
))
5313 /* Don't mark a dummy type as visited because we want to mark its sizes
5314 and fields once it's filled in. */
5315 else if (!TYPE_IS_DUMMY_P (*tp
))
5316 TREE_VISITED (*tp
) = 1;
5319 TYPE_SIZES_GIMPLIFIED (*tp
) = 1;
5324 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5327 unshare_save_expr (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
5328 void *data ATTRIBUTE_UNUSED
)
5332 if (TREE_CODE (t
) == SAVE_EXPR
)
5333 TREE_OPERAND (t
, 0) = unshare_expr (TREE_OPERAND (t
, 0));
5338 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5339 sized gimplified. We use this to indicate all variable sizes and
5340 positions in global types may not be shared by any subprogram. */
5343 mark_visited (tree
*tp
)
5345 walk_tree (tp
, mark_visited_r
, NULL
, NULL
);
5348 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5349 set its location to that of GNAT_NODE if present. */
5352 add_cleanup (tree gnu_cleanup
, Node_Id gnat_node
)
5354 if (Present (gnat_node
))
5355 set_expr_location_from_node (gnu_cleanup
, gnat_node
);
5356 append_to_statement_list (gnu_cleanup
, ¤t_stmt_group
->cleanups
);
5359 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5362 set_block_for_group (tree gnu_block
)
5364 gcc_assert (!current_stmt_group
->block
);
5365 current_stmt_group
->block
= gnu_block
;
5368 /* Return code corresponding to the current code group. It is normally
5369 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5370 BLOCK or cleanups were set. */
5373 end_stmt_group (void)
5375 struct stmt_group
*group
= current_stmt_group
;
5376 tree gnu_retval
= group
->stmt_list
;
5378 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5379 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5380 make a BIND_EXPR. Note that we nest in that because the cleanup may
5381 reference variables in the block. */
5382 if (gnu_retval
== NULL_TREE
)
5383 gnu_retval
= alloc_stmt_list ();
5385 if (group
->cleanups
)
5386 gnu_retval
= build2 (TRY_FINALLY_EXPR
, void_type_node
, gnu_retval
,
5389 if (current_stmt_group
->block
)
5390 gnu_retval
= build3 (BIND_EXPR
, void_type_node
, BLOCK_VARS (group
->block
),
5391 gnu_retval
, group
->block
);
5393 /* Remove this group from the stack and add it to the free list. */
5394 current_stmt_group
= group
->previous
;
5395 group
->previous
= stmt_group_free_list
;
5396 stmt_group_free_list
= group
;
5401 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5405 add_stmt_list (List_Id gnat_list
)
5409 if (Present (gnat_list
))
5410 for (gnat_node
= First (gnat_list
); Present (gnat_node
);
5411 gnat_node
= Next (gnat_node
))
5412 add_stmt (gnat_to_gnu (gnat_node
));
5415 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5416 If BINDING_P is true, push and pop a binding level around the list. */
5419 build_stmt_group (List_Id gnat_list
, bool binding_p
)
5421 start_stmt_group ();
5425 add_stmt_list (gnat_list
);
5429 return end_stmt_group ();
5432 /* Push and pop routines for stacks. We keep a free list around so we
5433 don't waste tree nodes. */
5436 push_stack (tree
*gnu_stack_ptr
, tree gnu_purpose
, tree gnu_value
)
5438 tree gnu_node
= gnu_stack_free_list
;
5442 gnu_stack_free_list
= TREE_CHAIN (gnu_node
);
5443 TREE_CHAIN (gnu_node
) = *gnu_stack_ptr
;
5444 TREE_PURPOSE (gnu_node
) = gnu_purpose
;
5445 TREE_VALUE (gnu_node
) = gnu_value
;
5448 gnu_node
= tree_cons (gnu_purpose
, gnu_value
, *gnu_stack_ptr
);
5450 *gnu_stack_ptr
= gnu_node
;
5454 pop_stack (tree
*gnu_stack_ptr
)
5456 tree gnu_node
= *gnu_stack_ptr
;
5458 *gnu_stack_ptr
= TREE_CHAIN (gnu_node
);
5459 TREE_CHAIN (gnu_node
) = gnu_stack_free_list
;
5460 gnu_stack_free_list
= gnu_node
;
5463 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5466 gnat_gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
,
5467 gimple_seq
*post_p ATTRIBUTE_UNUSED
)
5469 tree expr
= *expr_p
;
5472 if (IS_ADA_STMT (expr
))
5473 return gnat_gimplify_stmt (expr_p
);
5475 switch (TREE_CODE (expr
))
5478 /* If this is for a scalar, just make a VAR_DECL for it. If for
5479 an aggregate, get a null pointer of the appropriate type and
5481 if (AGGREGATE_TYPE_P (TREE_TYPE (expr
)))
5482 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (expr
),
5483 convert (build_pointer_type (TREE_TYPE (expr
)),
5484 integer_zero_node
));
5487 *expr_p
= create_tmp_var (TREE_TYPE (expr
), NULL
);
5488 TREE_NO_WARNING (*expr_p
) = 1;
5491 gimplify_and_add (TREE_OPERAND (expr
, 0), pre_p
);
5494 case UNCONSTRAINED_ARRAY_REF
:
5495 /* We should only do this if we are just elaborating for side-effects,
5496 but we can't know that yet. */
5497 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5501 op
= TREE_OPERAND (expr
, 0);
5503 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5504 be put into static memory. We know it's going to be readonly given
5505 the semantics we have and it's required to be static memory in
5506 the case when the reference is in an elaboration procedure. */
5507 if (TREE_CODE (op
) == CONSTRUCTOR
&& TREE_CONSTANT (op
))
5509 tree new_var
= create_tmp_var (TREE_TYPE (op
), "C");
5511 TREE_READONLY (new_var
) = 1;
5512 TREE_STATIC (new_var
) = 1;
5513 TREE_ADDRESSABLE (new_var
) = 1;
5514 DECL_INITIAL (new_var
) = op
;
5516 TREE_OPERAND (expr
, 0) = new_var
;
5517 recompute_tree_invariant_for_addr_expr (expr
);
5521 /* If we are taking the address of a SAVE_EXPR, we are typically
5522 processing a misaligned argument to be passed by reference in a
5523 procedure call. We just mark the operand as addressable + not
5524 readonly here and let the common gimplifier code perform the
5525 temporary creation, initialization, and "instantiation" in place of
5526 the SAVE_EXPR in further operands, in particular in the copy back
5527 code inserted after the call. */
5528 else if (TREE_CODE (op
) == SAVE_EXPR
)
5530 TREE_ADDRESSABLE (op
) = 1;
5531 TREE_READONLY (op
) = 0;
5534 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5535 address of the selected operand when it is addressable. Besides, we
5536 also expect addressable_p to only let COND_EXPRs where both arms are
5537 addressable reach here. */
5538 else if (TREE_CODE (op
) == COND_EXPR
)
5541 /* Otherwise, if we are taking the address of something that is neither
5542 reference, declaration, or constant, make a variable for the operand
5543 here and then take its address. If we don't do it this way, we may
5544 confuse the gimplifier because it needs to know the variable is
5545 addressable at this point. This duplicates code in
5546 internal_get_tmp_var, which is unfortunate. */
5547 else if (TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_reference
5548 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_declaration
5549 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_constant
)
5551 tree new_var
= create_tmp_var (TREE_TYPE (op
), "A");
5554 TREE_ADDRESSABLE (new_var
) = 1;
5556 stmt
= gimplify_assign (new_var
, op
, pre_p
);
5557 if (EXPR_HAS_LOCATION (op
))
5558 gimple_set_location (stmt
, *EXPR_LOCUS (op
));
5560 TREE_OPERAND (expr
, 0) = new_var
;
5561 recompute_tree_invariant_for_addr_expr (expr
);
5565 /* ... fall through ... */
5568 return GS_UNHANDLED
;
5572 /* Generate GIMPLE in place for the statement at *STMT_P. */
5574 static enum gimplify_status
5575 gnat_gimplify_stmt (tree
*stmt_p
)
5577 tree stmt
= *stmt_p
;
5579 switch (TREE_CODE (stmt
))
5582 *stmt_p
= STMT_STMT_STMT (stmt
);
5587 tree gnu_start_label
= create_artificial_label ();
5588 tree gnu_end_label
= LOOP_STMT_LABEL (stmt
);
5591 /* Set to emit the statements of the loop. */
5592 *stmt_p
= NULL_TREE
;
5594 /* We first emit the start label and then a conditional jump to
5595 the end label if there's a top condition, then the body of the
5596 loop, then a conditional branch to the end label, then the update,
5597 if any, and finally a jump to the start label and the definition
5598 of the end label. */
5599 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5603 if (LOOP_STMT_TOP_COND (stmt
))
5604 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5605 LOOP_STMT_TOP_COND (stmt
),
5612 append_to_statement_list (LOOP_STMT_BODY (stmt
), stmt_p
);
5614 if (LOOP_STMT_BOT_COND (stmt
))
5615 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5616 LOOP_STMT_BOT_COND (stmt
),
5623 if (LOOP_STMT_UPDATE (stmt
))
5624 append_to_statement_list (LOOP_STMT_UPDATE (stmt
), stmt_p
);
5626 t
= build1 (GOTO_EXPR
, void_type_node
, gnu_start_label
);
5627 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (gnu_end_label
));
5628 append_to_statement_list (t
, stmt_p
);
5630 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5637 /* Build a statement to jump to the corresponding end label, then
5638 see if it needs to be conditional. */
5639 *stmt_p
= build1 (GOTO_EXPR
, void_type_node
, EXIT_STMT_LABEL (stmt
));
5640 if (EXIT_STMT_COND (stmt
))
5641 *stmt_p
= build3 (COND_EXPR
, void_type_node
,
5642 EXIT_STMT_COND (stmt
), *stmt_p
, alloc_stmt_list ());
5650 /* Force references to each of the entities in packages withed by GNAT_NODE.
5651 Operate recursively but check that we aren't elaborating something more
5654 This routine is exclusively called in type_annotate mode, to compute DDA
5655 information for types in withed units, for ASIS use. */
5658 elaborate_all_entities (Node_Id gnat_node
)
5660 Entity_Id gnat_with_clause
, gnat_entity
;
5662 /* Process each unit only once. As we trace the context of all relevant
5663 units transitively, including generic bodies, we may encounter the
5664 same generic unit repeatedly. */
5665 if (!present_gnu_tree (gnat_node
))
5666 save_gnu_tree (gnat_node
, integer_zero_node
, true);
5668 /* Save entities in all context units. A body may have an implicit_with
5669 on its own spec, if the context includes a child unit, so don't save
5671 for (gnat_with_clause
= First (Context_Items (gnat_node
));
5672 Present (gnat_with_clause
);
5673 gnat_with_clause
= Next (gnat_with_clause
))
5674 if (Nkind (gnat_with_clause
) == N_With_Clause
5675 && !present_gnu_tree (Library_Unit (gnat_with_clause
))
5676 && Library_Unit (gnat_with_clause
) != Library_Unit (Cunit (Main_Unit
)))
5678 elaborate_all_entities (Library_Unit (gnat_with_clause
));
5680 if (Ekind (Entity (Name (gnat_with_clause
))) == E_Package
)
5682 for (gnat_entity
= First_Entity (Entity (Name (gnat_with_clause
)));
5683 Present (gnat_entity
);
5684 gnat_entity
= Next_Entity (gnat_entity
))
5685 if (Is_Public (gnat_entity
)
5686 && Convention (gnat_entity
) != Convention_Intrinsic
5687 && Ekind (gnat_entity
) != E_Package
5688 && Ekind (gnat_entity
) != E_Package_Body
5689 && Ekind (gnat_entity
) != E_Operator
5690 && !(IN (Ekind (gnat_entity
), Type_Kind
)
5691 && !Is_Frozen (gnat_entity
))
5692 && !((Ekind (gnat_entity
) == E_Procedure
5693 || Ekind (gnat_entity
) == E_Function
)
5694 && Is_Intrinsic_Subprogram (gnat_entity
))
5695 && !IN (Ekind (gnat_entity
), Named_Kind
)
5696 && !IN (Ekind (gnat_entity
), Generic_Unit_Kind
))
5697 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5699 else if (Ekind (Entity (Name (gnat_with_clause
))) == E_Generic_Package
)
5702 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause
)));
5704 /* Retrieve compilation unit node of generic body. */
5705 while (Present (gnat_body
)
5706 && Nkind (gnat_body
) != N_Compilation_Unit
)
5707 gnat_body
= Parent (gnat_body
);
5709 /* If body is available, elaborate its context. */
5710 if (Present (gnat_body
))
5711 elaborate_all_entities (gnat_body
);
5715 if (Nkind (Unit (gnat_node
)) == N_Package_Body
)
5716 elaborate_all_entities (Library_Unit (gnat_node
));
5719 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5722 process_freeze_entity (Node_Id gnat_node
)
5724 Entity_Id gnat_entity
= Entity (gnat_node
);
5728 = (Nkind (Declaration_Node (gnat_entity
)) == N_Object_Declaration
5729 && present_gnu_tree (Declaration_Node (gnat_entity
)))
5730 ? get_gnu_tree (Declaration_Node (gnat_entity
)) : NULL_TREE
;
5732 /* If this is a package, need to generate code for the package. */
5733 if (Ekind (gnat_entity
) == E_Package
)
5736 (Parent (Corresponding_Body
5737 (Parent (Declaration_Node (gnat_entity
)))));
5741 /* Check for old definition after the above call. This Freeze_Node
5742 might be for one its Itypes. */
5744 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
5746 /* If this entity has an Address representation clause, GNU_OLD is the
5747 address, so discard it here. */
5748 if (Present (Address_Clause (gnat_entity
)))
5751 /* Don't do anything for class-wide types they are always
5752 transformed into their root type. */
5753 if (Ekind (gnat_entity
) == E_Class_Wide_Type
5754 || (Ekind (gnat_entity
) == E_Class_Wide_Subtype
5755 && Present (Equivalent_Type (gnat_entity
))))
5758 /* Don't do anything for subprograms that may have been elaborated before
5759 their freeze nodes. This can happen, for example because of an inner call
5760 in an instance body, or a previous compilation of a spec for inlining
5763 && ((TREE_CODE (gnu_old
) == FUNCTION_DECL
5764 && (Ekind (gnat_entity
) == E_Function
5765 || Ekind (gnat_entity
) == E_Procedure
))
5767 && TREE_CODE (TREE_TYPE (gnu_old
)) == FUNCTION_TYPE
5768 && Ekind (gnat_entity
) == E_Subprogram_Type
)))
5771 /* If we have a non-dummy type old tree, we have nothing to do, except
5772 aborting if this is the public view of a private type whose full view was
5773 not delayed, as this node was never delayed as it should have been. We
5774 let this happen for concurrent types and their Corresponding_Record_Type,
5775 however, because each might legitimately be elaborated before it's own
5776 freeze node, e.g. while processing the other. */
5778 && !(TREE_CODE (gnu_old
) == TYPE_DECL
5779 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
))))
5781 gcc_assert ((IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5782 && Present (Full_View (gnat_entity
))
5783 && No (Freeze_Node (Full_View (gnat_entity
))))
5784 || Is_Concurrent_Type (gnat_entity
)
5785 || (IN (Ekind (gnat_entity
), Record_Kind
)
5786 && Is_Concurrent_Record_Type (gnat_entity
)));
5790 /* Reset the saved tree, if any, and elaborate the object or type for real.
5791 If there is a full declaration, elaborate it and copy the type to
5792 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
5793 a class wide type or subtype. */
5796 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
5797 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5798 && Present (Full_View (gnat_entity
))
5799 && present_gnu_tree (Full_View (gnat_entity
)))
5800 save_gnu_tree (Full_View (gnat_entity
), NULL_TREE
, false);
5801 if (Present (Class_Wide_Type (gnat_entity
))
5802 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5803 save_gnu_tree (Class_Wide_Type (gnat_entity
), NULL_TREE
, false);
5806 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5807 && Present (Full_View (gnat_entity
)))
5809 gnu_new
= gnat_to_gnu_entity (Full_View (gnat_entity
), NULL_TREE
, 1);
5811 /* Propagate back-annotations from full view to partial view. */
5812 if (Unknown_Alignment (gnat_entity
))
5813 Set_Alignment (gnat_entity
, Alignment (Full_View (gnat_entity
)));
5815 if (Unknown_Esize (gnat_entity
))
5816 Set_Esize (gnat_entity
, Esize (Full_View (gnat_entity
)));
5818 if (Unknown_RM_Size (gnat_entity
))
5819 Set_RM_Size (gnat_entity
, RM_Size (Full_View (gnat_entity
)));
5821 /* The above call may have defined this entity (the simplest example
5822 of this is when we have a private enumeral type since the bounds
5823 will have the public view. */
5824 if (!present_gnu_tree (gnat_entity
))
5825 save_gnu_tree (gnat_entity
, gnu_new
, false);
5826 if (Present (Class_Wide_Type (gnat_entity
))
5827 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5828 save_gnu_tree (Class_Wide_Type (gnat_entity
), gnu_new
, false);
5831 gnu_new
= gnat_to_gnu_entity (gnat_entity
, gnu_init
, 1);
5833 /* If we've made any pointers to the old version of this type, we
5834 have to update them. */
5836 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
5837 TREE_TYPE (gnu_new
));
5840 /* Process the list of inlined subprograms of GNAT_NODE, which is an
5841 N_Compilation_Unit. */
5844 process_inlined_subprograms (Node_Id gnat_node
)
5846 Entity_Id gnat_entity
;
5849 /* If we can inline, generate Gimple for all the inlined subprograms.
5850 Define the entity first so we set DECL_EXTERNAL. */
5852 for (gnat_entity
= First_Inlined_Subprogram (gnat_node
);
5853 Present (gnat_entity
);
5854 gnat_entity
= Next_Inlined_Subprogram (gnat_entity
))
5856 gnat_body
= Parent (Declaration_Node (gnat_entity
));
5858 if (Nkind (gnat_body
) != N_Subprogram_Body
)
5860 /* ??? This really should always be Present. */
5861 if (No (Corresponding_Body (gnat_body
)))
5865 = Parent (Declaration_Node (Corresponding_Body (gnat_body
)));
5868 if (Present (gnat_body
))
5870 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5871 add_stmt (gnat_to_gnu (gnat_body
));
5876 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
5877 We make two passes, one to elaborate anything other than bodies (but
5878 we declare a function if there was no spec). The second pass
5879 elaborates the bodies.
5881 GNAT_END_LIST gives the element in the list past the end. Normally,
5882 this is Empty, but can be First_Real_Statement for a
5883 Handled_Sequence_Of_Statements.
5885 We make a complete pass through both lists if PASS1P is true, then make
5886 the second pass over both lists if PASS2P is true. The lists usually
5887 correspond to the public and private parts of a package. */
5890 process_decls (List_Id gnat_decls
, List_Id gnat_decls2
,
5891 Node_Id gnat_end_list
, bool pass1p
, bool pass2p
)
5893 List_Id gnat_decl_array
[2];
5897 gnat_decl_array
[0] = gnat_decls
, gnat_decl_array
[1] = gnat_decls2
;
5900 for (i
= 0; i
<= 1; i
++)
5901 if (Present (gnat_decl_array
[i
]))
5902 for (gnat_decl
= First (gnat_decl_array
[i
]);
5903 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5905 /* For package specs, we recurse inside the declarations,
5906 thus taking the two pass approach inside the boundary. */
5907 if (Nkind (gnat_decl
) == N_Package_Declaration
5908 && (Nkind (Specification (gnat_decl
)
5909 == N_Package_Specification
)))
5910 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5911 Private_Declarations (Specification (gnat_decl
)),
5912 Empty
, true, false);
5914 /* Similarly for any declarations in the actions of a
5916 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5918 process_freeze_entity (gnat_decl
);
5919 process_decls (Actions (gnat_decl
), Empty
, Empty
, true, false);
5922 /* Package bodies with freeze nodes get their elaboration deferred
5923 until the freeze node, but the code must be placed in the right
5924 place, so record the code position now. */
5925 else if (Nkind (gnat_decl
) == N_Package_Body
5926 && Present (Freeze_Node (Corresponding_Spec (gnat_decl
))))
5927 record_code_position (gnat_decl
);
5929 else if (Nkind (gnat_decl
) == N_Package_Body_Stub
5930 && Present (Library_Unit (gnat_decl
))
5931 && Present (Freeze_Node
5934 (Library_Unit (gnat_decl
)))))))
5935 record_code_position
5936 (Proper_Body (Unit (Library_Unit (gnat_decl
))));
5938 /* We defer most subprogram bodies to the second pass. */
5939 else if (Nkind (gnat_decl
) == N_Subprogram_Body
)
5941 if (Acts_As_Spec (gnat_decl
))
5943 Node_Id gnat_subprog_id
= Defining_Entity (gnat_decl
);
5945 if (Ekind (gnat_subprog_id
) != E_Generic_Procedure
5946 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5947 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5950 /* For bodies and stubs that act as their own specs, the entity
5951 itself must be elaborated in the first pass, because it may
5952 be used in other declarations. */
5953 else if (Nkind (gnat_decl
) == N_Subprogram_Body_Stub
)
5955 Node_Id gnat_subprog_id
=
5956 Defining_Entity (Specification (gnat_decl
));
5958 if (Ekind (gnat_subprog_id
) != E_Subprogram_Body
5959 && Ekind (gnat_subprog_id
) != E_Generic_Procedure
5960 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5961 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5964 /* Concurrent stubs stand for the corresponding subprogram bodies,
5965 which are deferred like other bodies. */
5966 else if (Nkind (gnat_decl
) == N_Task_Body_Stub
5967 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5970 add_stmt (gnat_to_gnu (gnat_decl
));
5973 /* Here we elaborate everything we deferred above except for package bodies,
5974 which are elaborated at their freeze nodes. Note that we must also
5975 go inside things (package specs and freeze nodes) the first pass did. */
5977 for (i
= 0; i
<= 1; i
++)
5978 if (Present (gnat_decl_array
[i
]))
5979 for (gnat_decl
= First (gnat_decl_array
[i
]);
5980 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5982 if (Nkind (gnat_decl
) == N_Subprogram_Body
5983 || Nkind (gnat_decl
) == N_Subprogram_Body_Stub
5984 || Nkind (gnat_decl
) == N_Task_Body_Stub
5985 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5986 add_stmt (gnat_to_gnu (gnat_decl
));
5988 else if (Nkind (gnat_decl
) == N_Package_Declaration
5989 && (Nkind (Specification (gnat_decl
)
5990 == N_Package_Specification
)))
5991 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5992 Private_Declarations (Specification (gnat_decl
)),
5993 Empty
, false, true);
5995 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5996 process_decls (Actions (gnat_decl
), Empty
, Empty
, false, true);
6000 /* Make a unary operation of kind CODE using build_unary_op, but guard
6001 the operation by an overflow check. CODE can be one of NEGATE_EXPR
6002 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
6003 the operation is to be performed in that type. */
6006 build_unary_op_trapv (enum tree_code code
, tree gnu_type
, tree operand
)
6008 gcc_assert (code
== NEGATE_EXPR
|| code
== ABS_EXPR
);
6010 operand
= protect_multiple_eval (operand
);
6012 return emit_check (build_binary_op (EQ_EXPR
, integer_type_node
,
6013 operand
, TYPE_MIN_VALUE (gnu_type
)),
6014 build_unary_op (code
, gnu_type
, operand
),
6015 CE_Overflow_Check_Failed
);
6018 /* Make a binary operation of kind CODE using build_binary_op, but guard
6019 the operation by an overflow check. CODE can be one of PLUS_EXPR,
6020 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
6021 Usually the operation is to be performed in that type. */
6024 build_binary_op_trapv (enum tree_code code
, tree gnu_type
, tree left
,
6027 tree lhs
= protect_multiple_eval (left
);
6028 tree rhs
= protect_multiple_eval (right
);
6029 tree type_max
= TYPE_MAX_VALUE (gnu_type
);
6030 tree type_min
= TYPE_MIN_VALUE (gnu_type
);
6033 tree zero
= convert (gnu_type
, integer_zero_node
);
6038 int precision
= TYPE_PRECISION (gnu_type
);
6040 gcc_assert (!(precision
& (precision
- 1))); /* ensure power of 2 */
6042 /* Prefer a constant or known-positive rhs to simplify checks. */
6043 if (!TREE_CONSTANT (rhs
)
6044 && commutative_tree_code (code
)
6045 && (TREE_CONSTANT (lhs
) || (!tree_expr_nonnegative_p (rhs
)
6046 && tree_expr_nonnegative_p (lhs
))))
6053 rhs_lt_zero
= tree_expr_nonnegative_p (rhs
)
6055 : build_binary_op (LT_EXPR
, integer_type_node
, rhs
, zero
);
6057 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6059 /* Try a few strategies that may be cheaper than the general
6060 code at the end of the function, if the rhs is not known.
6062 - Call library function for 64-bit multiplication (complex)
6063 - Widen, if input arguments are sufficiently small
6064 - Determine overflow using wrapped result for addition/subtraction. */
6066 if (!TREE_CONSTANT (rhs
))
6068 /* Even for add/subtract double size to get another base type. */
6069 int needed_precision
= precision
* 2;
6071 if (code
== MULT_EXPR
&& precision
== 64)
6073 tree int_64
= gnat_type_for_size (64, 0);
6075 return convert (gnu_type
, build_call_2_expr (mulv64_decl
,
6076 convert (int_64
, lhs
),
6077 convert (int_64
, rhs
)));
6080 else if (needed_precision
<= BITS_PER_WORD
6081 || (code
== MULT_EXPR
6082 && needed_precision
<= LONG_LONG_TYPE_SIZE
))
6084 tree wide_type
= gnat_type_for_size (needed_precision
, 0);
6086 tree wide_result
= build_binary_op (code
, wide_type
,
6087 convert (wide_type
, lhs
),
6088 convert (wide_type
, rhs
));
6090 tree check
= build_binary_op
6091 (TRUTH_ORIF_EXPR
, integer_type_node
,
6092 build_binary_op (LT_EXPR
, integer_type_node
, wide_result
,
6093 convert (wide_type
, type_min
)),
6094 build_binary_op (GT_EXPR
, integer_type_node
, wide_result
,
6095 convert (wide_type
, type_max
)));
6097 tree result
= convert (gnu_type
, wide_result
);
6099 return emit_check (check
, result
, CE_Overflow_Check_Failed
);
6102 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
6104 tree unsigned_type
= gnat_type_for_size (precision
, 1);
6105 tree wrapped_expr
= convert
6106 (gnu_type
, build_binary_op (code
, unsigned_type
,
6107 convert (unsigned_type
, lhs
),
6108 convert (unsigned_type
, rhs
)));
6110 tree result
= convert
6111 (gnu_type
, build_binary_op (code
, gnu_type
, lhs
, rhs
));
6113 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6114 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6115 tree check
= build_binary_op
6116 (TRUTH_XOR_EXPR
, integer_type_node
, rhs_lt_zero
,
6117 build_binary_op (code
== PLUS_EXPR
? LT_EXPR
: GT_EXPR
,
6118 integer_type_node
, wrapped_expr
, lhs
));
6120 return emit_check (check
, result
, CE_Overflow_Check_Failed
);
6127 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6128 check_pos
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6129 build_binary_op (MINUS_EXPR
, gnu_type
,
6132 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6133 check_neg
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6134 build_binary_op (MINUS_EXPR
, gnu_type
,
6139 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6140 check_pos
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6141 build_binary_op (PLUS_EXPR
, gnu_type
,
6144 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6145 check_neg
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6146 build_binary_op (PLUS_EXPR
, gnu_type
,
6151 /* The check here is designed to be efficient if the rhs is constant,
6152 but it will work for any rhs by using integer division.
6153 Four different check expressions determine wether X * C overflows,
6156 C > 0 => X > type_max / C || X < type_min / C
6157 C == -1 => X == type_min
6158 C < -1 => X > type_min / C || X < type_max / C */
6160 tmp1
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_max
, rhs
);
6161 tmp2
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_min
, rhs
);
6163 check_pos
= build_binary_op (TRUTH_ANDIF_EXPR
, integer_type_node
,
6164 build_binary_op (NE_EXPR
, integer_type_node
, zero
, rhs
),
6165 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6166 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp1
),
6167 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp2
)));
6169 check_neg
= fold_build3 (COND_EXPR
, integer_type_node
,
6170 build_binary_op (EQ_EXPR
, integer_type_node
, rhs
,
6171 build_int_cst (gnu_type
, -1)),
6172 build_binary_op (EQ_EXPR
, integer_type_node
, lhs
, type_min
),
6173 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6174 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp2
),
6175 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp1
)));
6182 gnu_expr
= build_binary_op (code
, gnu_type
, lhs
, rhs
);
6184 /* If we can fold the expression to a constant, just return it.
6185 The caller will deal with overflow, no need to generate a check. */
6186 if (TREE_CONSTANT (gnu_expr
))
6189 check
= fold_build3 (COND_EXPR
, integer_type_node
,
6190 rhs_lt_zero
, check_neg
, check_pos
);
6192 return emit_check (check
, gnu_expr
, CE_Overflow_Check_Failed
);
6195 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6196 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6197 which we have to check. */
6200 emit_range_check (tree gnu_expr
, Entity_Id gnat_range_type
)
6202 tree gnu_range_type
= get_unpadded_type (gnat_range_type
);
6203 tree gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
6204 tree gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
6205 tree gnu_compare_type
= get_base_type (TREE_TYPE (gnu_expr
));
6207 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6208 This can for example happen when translating 'Val or 'Value. */
6209 if (gnu_compare_type
== gnu_range_type
)
6212 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6213 we can't do anything since we might be truncating the bounds. No
6214 check is needed in this case. */
6215 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr
))
6216 && (TYPE_PRECISION (gnu_compare_type
)
6217 < TYPE_PRECISION (get_base_type (gnu_range_type
))))
6220 /* Checked expressions must be evaluated only once. */
6221 gnu_expr
= protect_multiple_eval (gnu_expr
);
6223 /* There's no good type to use here, so we might as well use
6224 integer_type_node. Note that the form of the check is
6225 (not (expr >= lo)) or (not (expr <= hi))
6226 the reason for this slightly convoluted form is that NaNs
6227 are not considered to be in range in the float case. */
6229 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6231 (build_binary_op (GE_EXPR
, integer_type_node
,
6232 convert (gnu_compare_type
, gnu_expr
),
6233 convert (gnu_compare_type
, gnu_low
))),
6235 (build_binary_op (LE_EXPR
, integer_type_node
,
6236 convert (gnu_compare_type
, gnu_expr
),
6237 convert (gnu_compare_type
,
6239 gnu_expr
, CE_Range_Check_Failed
);
6242 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object
6243 which we are about to index, GNU_EXPR is the index expression to be
6244 checked, GNU_LOW and GNU_HIGH are the lower and upper bounds
6245 against which GNU_EXPR has to be checked. Note that for index
6246 checking we cannot use the emit_range_check function (although very
6247 similar code needs to be generated in both cases) since for index
6248 checking the array type against which we are checking the indices
6249 may be unconstrained and consequently we need to retrieve the
6250 actual index bounds from the array object itself
6251 (GNU_ARRAY_OBJECT). The place where we need to do that is in
6252 subprograms having unconstrained array formal parameters */
6255 emit_index_check (tree gnu_array_object
,
6260 tree gnu_expr_check
;
6262 /* Checked expressions must be evaluated only once. */
6263 gnu_expr
= protect_multiple_eval (gnu_expr
);
6265 /* Must do this computation in the base type in case the expression's
6266 type is an unsigned subtypes. */
6267 gnu_expr_check
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
6269 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6270 the object we are handling. */
6271 gnu_low
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low
, gnu_array_object
);
6272 gnu_high
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high
, gnu_array_object
);
6274 /* There's no good type to use here, so we might as well use
6275 integer_type_node. */
6277 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6278 build_binary_op (LT_EXPR
, integer_type_node
,
6280 convert (TREE_TYPE (gnu_expr_check
),
6282 build_binary_op (GT_EXPR
, integer_type_node
,
6284 convert (TREE_TYPE (gnu_expr_check
),
6286 gnu_expr
, CE_Index_Check_Failed
);
6289 /* GNU_COND contains the condition corresponding to an access, discriminant or
6290 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6291 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6292 REASON is the code that says why the exception was raised. */
6295 emit_check (tree gnu_cond
, tree gnu_expr
, int reason
)
6297 tree gnu_call
= build_call_raise (reason
, Empty
, N_Raise_Constraint_Error
);
6299 = fold_build3 (COND_EXPR
, TREE_TYPE (gnu_expr
), gnu_cond
,
6300 build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_expr
), gnu_call
,
6301 convert (TREE_TYPE (gnu_expr
), integer_zero_node
)),
6304 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6305 we don't need to evaluate it just for the check. */
6306 TREE_SIDE_EFFECTS (gnu_result
) = TREE_SIDE_EFFECTS (gnu_expr
);
6308 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6309 we will repeatedly do the test and, at compile time, we will repeatedly
6310 visit it during unsharing, which leads to an exponential explosion. */
6311 return save_expr (gnu_result
);
6314 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing
6315 overflow checks if OVERFLOW_P is nonzero and range checks if
6316 RANGE_P is nonzero. GNAT_TYPE is known to be an integral type.
6317 If TRUNCATE_P is nonzero, do a float to integer conversion with
6318 truncation; otherwise round. */
6321 convert_with_check (Entity_Id gnat_type
, tree gnu_expr
, bool overflowp
,
6322 bool rangep
, bool truncatep
)
6324 tree gnu_type
= get_unpadded_type (gnat_type
);
6325 tree gnu_in_type
= TREE_TYPE (gnu_expr
);
6326 tree gnu_in_basetype
= get_base_type (gnu_in_type
);
6327 tree gnu_base_type
= get_base_type (gnu_type
);
6328 tree gnu_result
= gnu_expr
;
6330 /* If we are not doing any checks, the output is an integral type, and
6331 the input is not a floating type, just do the conversion. This
6332 shortcut is required to avoid problems with packed array types
6333 and simplifies code in all cases anyway. */
6334 if (!rangep
&& !overflowp
&& INTEGRAL_TYPE_P (gnu_base_type
)
6335 && !FLOAT_TYPE_P (gnu_in_type
))
6336 return convert (gnu_type
, gnu_expr
);
6338 /* First convert the expression to its base type. This
6339 will never generate code, but makes the tests below much simpler.
6340 But don't do this if converting from an integer type to an unconstrained
6341 array type since then we need to get the bounds from the original
6343 if (TREE_CODE (gnu_type
) != UNCONSTRAINED_ARRAY_TYPE
)
6344 gnu_result
= convert (gnu_in_basetype
, gnu_result
);
6346 /* If overflow checks are requested, we need to be sure the result will
6347 fit in the output base type. But don't do this if the input
6348 is integer and the output floating-point. */
6350 && !(FLOAT_TYPE_P (gnu_base_type
) && INTEGRAL_TYPE_P (gnu_in_basetype
)))
6352 /* Ensure GNU_EXPR only gets evaluated once. */
6353 tree gnu_input
= protect_multiple_eval (gnu_result
);
6354 tree gnu_cond
= integer_zero_node
;
6355 tree gnu_in_lb
= TYPE_MIN_VALUE (gnu_in_basetype
);
6356 tree gnu_in_ub
= TYPE_MAX_VALUE (gnu_in_basetype
);
6357 tree gnu_out_lb
= TYPE_MIN_VALUE (gnu_base_type
);
6358 tree gnu_out_ub
= TYPE_MAX_VALUE (gnu_base_type
);
6360 /* Convert the lower bounds to signed types, so we're sure we're
6361 comparing them properly. Likewise, convert the upper bounds
6362 to unsigned types. */
6363 if (INTEGRAL_TYPE_P (gnu_in_basetype
) && TYPE_UNSIGNED (gnu_in_basetype
))
6364 gnu_in_lb
= convert (gnat_signed_type (gnu_in_basetype
), gnu_in_lb
);
6366 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6367 && !TYPE_UNSIGNED (gnu_in_basetype
))
6368 gnu_in_ub
= convert (gnat_unsigned_type (gnu_in_basetype
), gnu_in_ub
);
6370 if (INTEGRAL_TYPE_P (gnu_base_type
) && TYPE_UNSIGNED (gnu_base_type
))
6371 gnu_out_lb
= convert (gnat_signed_type (gnu_base_type
), gnu_out_lb
);
6373 if (INTEGRAL_TYPE_P (gnu_base_type
) && !TYPE_UNSIGNED (gnu_base_type
))
6374 gnu_out_ub
= convert (gnat_unsigned_type (gnu_base_type
), gnu_out_ub
);
6376 /* Check each bound separately and only if the result bound
6377 is tighter than the bound on the input type. Note that all the
6378 types are base types, so the bounds must be constant. Also,
6379 the comparison is done in the base type of the input, which
6380 always has the proper signedness. First check for input
6381 integer (which means output integer), output float (which means
6382 both float), or mixed, in which case we always compare.
6383 Note that we have to do the comparison which would *fail* in the
6384 case of an error since if it's an FP comparison and one of the
6385 values is a NaN or Inf, the comparison will fail. */
6386 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6387 ? tree_int_cst_lt (gnu_in_lb
, gnu_out_lb
)
6388 : (FLOAT_TYPE_P (gnu_base_type
)
6389 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb
),
6390 TREE_REAL_CST (gnu_out_lb
))
6394 (build_binary_op (GE_EXPR
, integer_type_node
,
6395 gnu_input
, convert (gnu_in_basetype
,
6398 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6399 ? tree_int_cst_lt (gnu_out_ub
, gnu_in_ub
)
6400 : (FLOAT_TYPE_P (gnu_base_type
)
6401 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub
),
6402 TREE_REAL_CST (gnu_in_lb
))
6405 = build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
, gnu_cond
,
6407 (build_binary_op (LE_EXPR
, integer_type_node
,
6409 convert (gnu_in_basetype
,
6412 if (!integer_zerop (gnu_cond
))
6413 gnu_result
= emit_check (gnu_cond
, gnu_input
,
6414 CE_Overflow_Check_Failed
);
6417 /* Now convert to the result base type. If this is a non-truncating
6418 float-to-integer conversion, round. */
6419 if (INTEGRAL_TYPE_P (gnu_base_type
) && FLOAT_TYPE_P (gnu_in_basetype
)
6422 REAL_VALUE_TYPE half_minus_pred_half
, pred_half
;
6423 tree gnu_conv
, gnu_zero
, gnu_comp
, gnu_saved_result
, calc_type
;
6424 tree gnu_pred_half
, gnu_add_pred_half
, gnu_subtract_pred_half
;
6425 const struct real_format
*fmt
;
6427 /* The following calculations depend on proper rounding to even
6428 of each arithmetic operation. In order to prevent excess
6429 precision from spoiling this property, use the widest hardware
6430 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6432 calc_type
= (FP_ARITH_MAY_WIDEN
? longest_float_type_node
6435 /* FIXME: Should not have padding in the first place */
6436 if (TREE_CODE (calc_type
) == RECORD_TYPE
6437 && TYPE_IS_PADDING_P (calc_type
))
6438 calc_type
= TREE_TYPE (TYPE_FIELDS (calc_type
));
6440 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6441 fmt
= REAL_MODE_FORMAT (TYPE_MODE (calc_type
));
6442 real_2expN (&half_minus_pred_half
, -(fmt
->p
) - 1, TYPE_MODE (calc_type
));
6443 REAL_ARITHMETIC (pred_half
, MINUS_EXPR
, dconsthalf
,
6444 half_minus_pred_half
);
6445 gnu_pred_half
= build_real (calc_type
, pred_half
);
6447 /* If the input is strictly negative, subtract this value
6448 and otherwise add it from the input. For 0.5, the result
6449 is exactly between 1.0 and the machine number preceding 1.0
6450 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6451 will round to 1.0, while all other number with an absolute
6452 value less than 0.5 round to 0.0. For larger numbers exactly
6453 halfway between integers, rounding will always be correct as
6454 the true mathematical result will be closer to the higher
6455 integer compared to the lower one. So, this constant works
6456 for all floating-point numbers.
6458 The reason to use the same constant with subtract/add instead
6459 of a positive and negative constant is to allow the comparison
6460 to be scheduled in parallel with retrieval of the constant and
6461 conversion of the input to the calc_type (if necessary).
6464 gnu_zero
= convert (gnu_in_basetype
, integer_zero_node
);
6465 gnu_saved_result
= save_expr (gnu_result
);
6466 gnu_conv
= convert (calc_type
, gnu_saved_result
);
6467 gnu_comp
= build2 (GE_EXPR
, integer_type_node
,
6468 gnu_saved_result
, gnu_zero
);
6470 = build2 (PLUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6471 gnu_subtract_pred_half
6472 = build2 (MINUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6473 gnu_result
= build3 (COND_EXPR
, calc_type
, gnu_comp
,
6474 gnu_add_pred_half
, gnu_subtract_pred_half
);
6477 if (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6478 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type
)
6479 && TREE_CODE (gnu_result
) == UNCONSTRAINED_ARRAY_REF
)
6480 gnu_result
= unchecked_convert (gnu_base_type
, gnu_result
, false);
6482 gnu_result
= convert (gnu_base_type
, gnu_result
);
6484 /* Finally, do the range check if requested. Note that if the
6485 result type is a modular type, the range check is actually
6486 an overflow check. */
6489 || (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6490 && TYPE_MODULAR_P (gnu_base_type
) && overflowp
))
6491 gnu_result
= emit_range_check (gnu_result
, gnat_type
);
6493 return convert (gnu_type
, gnu_result
);
6496 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6499 smaller_packable_type_p (tree type
, tree record_type
)
6503 /* We're not interested in variants here. */
6504 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (record_type
))
6507 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6508 if (TYPE_NAME (type
) != TYPE_NAME (record_type
))
6511 size
= TYPE_SIZE (type
);
6512 rsize
= TYPE_SIZE (record_type
);
6514 if (!(TREE_CODE (size
) == INTEGER_CST
&& TREE_CODE (rsize
) == INTEGER_CST
))
6517 return tree_int_cst_lt (size
, rsize
) != 0;
6520 /* Return true if GNU_EXPR can be directly addressed. This is the case
6521 unless it is an expression involving computation or if it involves a
6522 reference to a bitfield or to an object not sufficiently aligned for
6523 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6524 be directly addressed as an object of this type.
6526 *** Notes on addressability issues in the Ada compiler ***
6528 This predicate is necessary in order to bridge the gap between Gigi
6529 and the middle-end about addressability of GENERIC trees. A tree
6530 is said to be addressable if it can be directly addressed, i.e. if
6531 its address can be taken, is a multiple of the type's alignment on
6532 strict-alignment architectures and returns the first storage unit
6533 assigned to the object represented by the tree.
6535 In the C family of languages, everything is in practice addressable
6536 at the language level, except for bit-fields. This means that these
6537 compilers will take the address of any tree that doesn't represent
6538 a bit-field reference and expect the result to be the first storage
6539 unit assigned to the object. Even in cases where this will result
6540 in unaligned accesses at run time, nothing is supposed to be done
6541 and the program is considered as erroneous instead (see PR c/18287).
6543 The implicit assumptions made in the middle-end are in keeping with
6544 the C viewpoint described above:
6545 - the address of a bit-field reference is supposed to be never
6546 taken; the compiler (generally) will stop on such a construct,
6547 - any other tree is addressable if it is formally addressable,
6548 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6550 In Ada, the viewpoint is the opposite one: nothing is addressable
6551 at the language level unless explicitly declared so. This means
6552 that the compiler will both make sure that the trees representing
6553 references to addressable ("aliased" in Ada parlance) objects are
6554 addressable and make no real attempts at ensuring that the trees
6555 representing references to non-addressable objects are addressable.
6557 In the first case, Ada is effectively equivalent to C and handing
6558 down the direct result of applying ADDR_EXPR to these trees to the
6559 middle-end works flawlessly. In the second case, Ada cannot afford
6560 to consider the program as erroneous if the address of trees that
6561 are not addressable is requested for technical reasons, unlike C;
6562 as a consequence, the Ada compiler must arrange for either making
6563 sure that this address is not requested in the middle-end or for
6564 compensating by inserting temporaries if it is requested in Gigi.
6566 The first goal can be achieved because the middle-end should not
6567 request the address of non-addressable trees on its own; the only
6568 exception is for the invocation of low-level block operations like
6569 memcpy, for which the addressability requirements are lower since
6570 the type's alignment can be disregarded. In practice, this means
6571 that Gigi must make sure that such operations cannot be applied to
6572 non-BLKmode bit-fields.
6574 The second goal is achieved by means of the addressable_p predicate
6575 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6576 They will be turned during gimplification into proper temporaries
6577 whose address will be used in lieu of that of the original tree. */
6580 addressable_p (tree gnu_expr
, tree gnu_type
)
6582 /* The size of the real type of the object must not be smaller than
6583 that of the expected type, otherwise an indirect access in the
6584 latter type would be larger than the object. Only records need
6585 to be considered in practice. */
6587 && TREE_CODE (gnu_type
) == RECORD_TYPE
6588 && smaller_packable_type_p (TREE_TYPE (gnu_expr
), gnu_type
))
6591 switch (TREE_CODE (gnu_expr
))
6597 /* All DECLs are addressable: if they are in a register, we can force
6601 case UNCONSTRAINED_ARRAY_REF
:
6612 /* We accept &COND_EXPR as soon as both operands are addressable and
6613 expect the outcome to be the address of the selected operand. */
6614 return (addressable_p (TREE_OPERAND (gnu_expr
, 1), NULL_TREE
)
6615 && addressable_p (TREE_OPERAND (gnu_expr
, 2), NULL_TREE
));
6618 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr
, 1))
6619 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6620 the field is sufficiently aligned, in case it is subject
6621 to a pragma Component_Alignment. But we don't need to
6622 check the alignment of the containing record, as it is
6623 guaranteed to be not smaller than that of its most
6624 aligned field that is not a bit-field. */
6625 && (!STRICT_ALIGNMENT
6626 || DECL_ALIGN (TREE_OPERAND (gnu_expr
, 1))
6627 >= TYPE_ALIGN (TREE_TYPE (gnu_expr
))))
6628 /* The field of a padding record is always addressable. */
6629 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr
, 0))))
6630 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6632 case ARRAY_REF
: case ARRAY_RANGE_REF
:
6633 case REALPART_EXPR
: case IMAGPART_EXPR
:
6635 return addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
);
6638 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr
))
6639 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6641 case VIEW_CONVERT_EXPR
:
6643 /* This is addressable if we can avoid a copy. */
6644 tree type
= TREE_TYPE (gnu_expr
);
6645 tree inner_type
= TREE_TYPE (TREE_OPERAND (gnu_expr
, 0));
6646 return (((TYPE_MODE (type
) == TYPE_MODE (inner_type
)
6647 && (!STRICT_ALIGNMENT
6648 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6649 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
))
6650 || ((TYPE_MODE (type
) == BLKmode
6651 || TYPE_MODE (inner_type
) == BLKmode
)
6652 && (!STRICT_ALIGNMENT
6653 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6654 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
6655 || TYPE_ALIGN_OK (type
)
6656 || TYPE_ALIGN_OK (inner_type
))))
6657 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6665 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6666 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6667 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6670 process_type (Entity_Id gnat_entity
)
6673 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
6676 /* If we are to delay elaboration of this type, just do any
6677 elaborations needed for expressions within the declaration and
6678 make a dummy type entry for this node and its Full_View (if
6679 any) in case something points to it. Don't do this if it
6680 has already been done (the only way that can happen is if
6681 the private completion is also delayed). */
6682 if (Present (Freeze_Node (gnat_entity
))
6683 || (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6684 && Present (Full_View (gnat_entity
))
6685 && Freeze_Node (Full_View (gnat_entity
))
6686 && !present_gnu_tree (Full_View (gnat_entity
))))
6688 elaborate_entity (gnat_entity
);
6692 tree gnu_decl
= create_type_decl (get_entity_name (gnat_entity
),
6693 make_dummy_type (gnat_entity
),
6694 NULL
, false, false, gnat_entity
);
6696 save_gnu_tree (gnat_entity
, gnu_decl
, false);
6697 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6698 && Present (Full_View (gnat_entity
)))
6699 save_gnu_tree (Full_View (gnat_entity
), gnu_decl
, false);
6705 /* If we saved away a dummy type for this node it means that this
6706 made the type that corresponds to the full type of an incomplete
6707 type. Clear that type for now and then update the type in the
6711 gcc_assert (TREE_CODE (gnu_old
) == TYPE_DECL
6712 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
)));
6714 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
6717 /* Now fully elaborate the type. */
6718 gnu_new
= gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 1);
6719 gcc_assert (TREE_CODE (gnu_new
) == TYPE_DECL
);
6721 /* If we have an old type and we've made pointers to this type,
6722 update those pointers. */
6724 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
6725 TREE_TYPE (gnu_new
));
6727 /* If this is a record type corresponding to a task or protected type
6728 that is a completion of an incomplete type, perform a similar update
6730 /* ??? Including protected types here is a guess. */
6732 if (IN (Ekind (gnat_entity
), Record_Kind
)
6733 && Is_Concurrent_Record_Type (gnat_entity
)
6734 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
)))
6737 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
));
6739 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6741 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6744 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old
)),
6745 TREE_TYPE (gnu_new
));
6749 /* GNAT_ENTITY is the type of the resulting constructors,
6750 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
6751 and GNU_TYPE is the GCC type of the corresponding record.
6753 Return a CONSTRUCTOR to build the record. */
6756 assoc_to_constructor (Entity_Id gnat_entity
, Node_Id gnat_assoc
, tree gnu_type
)
6758 tree gnu_list
, gnu_result
;
6760 /* We test for GNU_FIELD being empty in the case where a variant
6761 was the last thing since we don't take things off GNAT_ASSOC in
6762 that case. We check GNAT_ASSOC in case we have a variant, but it
6765 for (gnu_list
= NULL_TREE
; Present (gnat_assoc
);
6766 gnat_assoc
= Next (gnat_assoc
))
6768 Node_Id gnat_field
= First (Choices (gnat_assoc
));
6769 tree gnu_field
= gnat_to_gnu_field_decl (Entity (gnat_field
));
6770 tree gnu_expr
= gnat_to_gnu (Expression (gnat_assoc
));
6772 /* The expander is supposed to put a single component selector name
6773 in every record component association */
6774 gcc_assert (No (Next (gnat_field
)));
6776 /* Ignore fields that have Corresponding_Discriminants since we'll
6777 be setting that field in the parent. */
6778 if (Present (Corresponding_Discriminant (Entity (gnat_field
)))
6779 && Is_Tagged_Type (Scope (Entity (gnat_field
))))
6782 /* Also ignore discriminants of Unchecked_Unions. */
6783 else if (Is_Unchecked_Union (gnat_entity
)
6784 && Ekind (Entity (gnat_field
)) == E_Discriminant
)
6787 /* Before assigning a value in an aggregate make sure range checks
6788 are done if required. Then convert to the type of the field. */
6789 if (Do_Range_Check (Expression (gnat_assoc
)))
6790 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_field
));
6792 gnu_expr
= convert (TREE_TYPE (gnu_field
), gnu_expr
);
6794 /* Add the field and expression to the list. */
6795 gnu_list
= tree_cons (gnu_field
, gnu_expr
, gnu_list
);
6798 gnu_result
= extract_values (gnu_list
, gnu_type
);
6800 #ifdef ENABLE_CHECKING
6804 /* Verify every entry in GNU_LIST was used. */
6805 for (gnu_field
= gnu_list
; gnu_field
; gnu_field
= TREE_CHAIN (gnu_field
))
6806 gcc_assert (TREE_ADDRESSABLE (gnu_field
));
6813 /* Builds a possibly nested constructor for array aggregates. GNAT_EXPR
6814 is the first element of an array aggregate. It may itself be an
6815 aggregate (an array or record aggregate). GNU_ARRAY_TYPE is the gnu type
6816 corresponding to the array aggregate. GNAT_COMPONENT_TYPE is the type
6817 of the array component. It is needed for range checking. */
6820 pos_to_constructor (Node_Id gnat_expr
, tree gnu_array_type
,
6821 Entity_Id gnat_component_type
)
6823 tree gnu_expr_list
= NULL_TREE
;
6824 tree gnu_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type
));
6827 for ( ; Present (gnat_expr
); gnat_expr
= Next (gnat_expr
))
6829 /* If the expression is itself an array aggregate then first build the
6830 innermost constructor if it is part of our array (multi-dimensional
6833 if (Nkind (gnat_expr
) == N_Aggregate
6834 && TREE_CODE (TREE_TYPE (gnu_array_type
)) == ARRAY_TYPE
6835 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type
)))
6836 gnu_expr
= pos_to_constructor (First (Expressions (gnat_expr
)),
6837 TREE_TYPE (gnu_array_type
),
6838 gnat_component_type
);
6841 gnu_expr
= gnat_to_gnu (gnat_expr
);
6843 /* before assigning the element to the array make sure it is
6845 if (Do_Range_Check (gnat_expr
))
6846 gnu_expr
= emit_range_check (gnu_expr
, gnat_component_type
);
6850 = tree_cons (gnu_index
, convert (TREE_TYPE (gnu_array_type
), gnu_expr
),
6853 gnu_index
= int_const_binop (PLUS_EXPR
, gnu_index
, integer_one_node
, 0);
6856 return gnat_build_constructor (gnu_array_type
, nreverse (gnu_expr_list
));
6859 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
6860 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
6861 of the associations that are from RECORD_TYPE. If we see an internal
6862 record, make a recursive call to fill it in as well. */
6865 extract_values (tree values
, tree record_type
)
6867 tree result
= NULL_TREE
;
6870 for (field
= TYPE_FIELDS (record_type
); field
; field
= TREE_CHAIN (field
))
6874 /* _Parent is an internal field, but may have values in the aggregate,
6875 so check for values first. */
6876 if ((tem
= purpose_member (field
, values
)))
6878 value
= TREE_VALUE (tem
);
6879 TREE_ADDRESSABLE (tem
) = 1;
6882 else if (DECL_INTERNAL_P (field
))
6884 value
= extract_values (values
, TREE_TYPE (field
));
6885 if (TREE_CODE (value
) == CONSTRUCTOR
6886 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (value
)))
6890 /* If we have a record subtype, the names will match, but not the
6891 actual FIELD_DECLs. */
6892 for (tem
= values
; tem
; tem
= TREE_CHAIN (tem
))
6893 if (DECL_NAME (TREE_PURPOSE (tem
)) == DECL_NAME (field
))
6895 value
= convert (TREE_TYPE (field
), TREE_VALUE (tem
));
6896 TREE_ADDRESSABLE (tem
) = 1;
6902 result
= tree_cons (field
, value
, result
);
6905 return gnat_build_constructor (record_type
, nreverse (result
));
6908 /* EXP is to be treated as an array or record. Handle the cases when it is
6909 an access object and perform the required dereferences. */
6912 maybe_implicit_deref (tree exp
)
6914 /* If the type is a pointer, dereference it. */
6916 if (POINTER_TYPE_P (TREE_TYPE (exp
)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp
)))
6917 exp
= build_unary_op (INDIRECT_REF
, NULL_TREE
, exp
);
6919 /* If we got a padded type, remove it too. */
6920 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
6921 && TYPE_IS_PADDING_P (TREE_TYPE (exp
)))
6922 exp
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp
))), exp
);
6927 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
6930 protect_multiple_eval (tree exp
)
6932 tree type
= TREE_TYPE (exp
);
6934 /* If this has no side effects, we don't need to do anything. */
6935 if (!TREE_SIDE_EFFECTS (exp
))
6938 /* If it is a conversion, protect what's inside the conversion.
6939 Similarly, if we're indirectly referencing something, we only
6940 actually need to protect the address since the data itself can't
6941 change in these situations. */
6942 else if (TREE_CODE (exp
) == NON_LVALUE_EXPR
6943 || CONVERT_EXPR_P (exp
)
6944 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
6945 || TREE_CODE (exp
) == INDIRECT_REF
6946 || TREE_CODE (exp
) == UNCONSTRAINED_ARRAY_REF
)
6947 return build1 (TREE_CODE (exp
), type
,
6948 protect_multiple_eval (TREE_OPERAND (exp
, 0)));
6950 /* If EXP is a fat pointer or something that can be placed into a register,
6951 just make a SAVE_EXPR. */
6952 if (TYPE_FAT_POINTER_P (type
) || TYPE_MODE (type
) != BLKmode
)
6953 return save_expr (exp
);
6955 /* Otherwise, dereference, protect the address, and re-reference. */
6958 build_unary_op (INDIRECT_REF
, type
,
6959 save_expr (build_unary_op (ADDR_EXPR
,
6960 build_reference_type (type
),
6964 /* This is equivalent to stabilize_reference in tree.c, but we know how to
6965 handle our own nodes and we take extra arguments. FORCE says whether to
6966 force evaluation of everything. We set SUCCESS to true unless we walk
6967 through something we don't know how to stabilize. */
6970 maybe_stabilize_reference (tree ref
, bool force
, bool *success
)
6972 tree type
= TREE_TYPE (ref
);
6973 enum tree_code code
= TREE_CODE (ref
);
6976 /* Assume we'll success unless proven otherwise. */
6985 /* No action is needed in this case. */
6991 case FIX_TRUNC_EXPR
:
6992 case VIEW_CONVERT_EXPR
:
6994 = build1 (code
, type
,
6995 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
7000 case UNCONSTRAINED_ARRAY_REF
:
7001 result
= build1 (code
, type
,
7002 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 0),
7007 result
= build3 (COMPONENT_REF
, type
,
7008 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
7010 TREE_OPERAND (ref
, 1), NULL_TREE
);
7014 result
= build3 (BIT_FIELD_REF
, type
,
7015 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
7017 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
7019 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 2),
7024 case ARRAY_RANGE_REF
:
7025 result
= build4 (code
, type
,
7026 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
7028 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
7030 NULL_TREE
, NULL_TREE
);
7034 result
= gnat_stabilize_reference_1 (ref
, force
);
7038 /* This generates better code than the scheme in protect_multiple_eval
7039 because large objects will be returned via invisible reference in
7040 most ABIs so the temporary will directly be filled by the callee. */
7041 result
= gnat_stabilize_reference_1 (ref
, force
);
7045 /* Constructors with 1 element are used extensively to formally
7046 convert objects to special wrapping types. */
7047 if (TREE_CODE (type
) == RECORD_TYPE
7048 && VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (ref
)) == 1)
7051 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->index
;
7053 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->value
;
7055 = build_constructor_single (type
, index
,
7056 gnat_stabilize_reference_1 (value
,
7067 ref
= error_mark_node
;
7069 /* ... Fallthru to failure ... */
7071 /* If arg isn't a kind of lvalue we recognize, make no change.
7072 Caller should recognize the error for an invalid lvalue. */
7078 TREE_READONLY (result
) = TREE_READONLY (ref
);
7080 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7081 expression may not be sustained across some paths, such as the way via
7082 build1 for INDIRECT_REF. We re-populate those flags here for the general
7083 case, which is consistent with the GCC version of this routine.
7085 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7086 paths introduce side effects where there was none initially (e.g. calls
7087 to save_expr), and we also want to keep track of that. */
7089 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
7090 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (ref
);
7095 /* Wrapper around maybe_stabilize_reference, for common uses without
7096 lvalue restrictions and without need to examine the success
7100 gnat_stabilize_reference (tree ref
, bool force
)
7103 return maybe_stabilize_reference (ref
, force
, &dummy
);
7106 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7107 arg to force a SAVE_EXPR for everything. */
7110 gnat_stabilize_reference_1 (tree e
, bool force
)
7112 enum tree_code code
= TREE_CODE (e
);
7113 tree type
= TREE_TYPE (e
);
7116 /* We cannot ignore const expressions because it might be a reference
7117 to a const array but whose index contains side-effects. But we can
7118 ignore things that are actual constant or that already have been
7119 handled by this function. */
7121 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
7124 switch (TREE_CODE_CLASS (code
))
7126 case tcc_exceptional
:
7128 case tcc_declaration
:
7129 case tcc_comparison
:
7131 case tcc_expression
:
7134 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7135 fat pointer. This may be more efficient, but will also allow
7136 us to more easily find the match for the PLACEHOLDER_EXPR. */
7137 if (code
== COMPONENT_REF
7138 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e
, 0))))
7139 result
= build3 (COMPONENT_REF
, type
,
7140 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7142 TREE_OPERAND (e
, 1), TREE_OPERAND (e
, 2));
7143 else if (TREE_SIDE_EFFECTS (e
) || force
)
7144 return save_expr (e
);
7150 /* Constants need no processing. In fact, we should never reach
7155 /* Recursively stabilize each operand. */
7156 result
= build2 (code
, type
,
7157 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0), force
),
7158 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 1),
7163 /* Recursively stabilize each operand. */
7164 result
= build1 (code
, type
,
7165 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7173 TREE_READONLY (result
) = TREE_READONLY (e
);
7175 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
7176 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (e
);
7180 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7181 location and false if it doesn't. In the former case, set the Gigi global
7182 variable REF_FILENAME to the simple debug file name as given by sinput. */
7185 Sloc_to_locus (Source_Ptr Sloc
, location_t
*locus
)
7187 if (Sloc
== No_Location
)
7190 if (Sloc
<= Standard_Location
)
7192 if (*locus
== UNKNOWN_LOCATION
)
7193 *locus
= BUILTINS_LOCATION
;
7198 Source_File_Index file
= Get_Source_File_Index (Sloc
);
7199 Logical_Line_Number line
= Get_Logical_Line_Number (Sloc
);
7200 Column_Number column
= Get_Column_Number (Sloc
);
7201 struct line_map
*map
= &line_table
->maps
[file
- 1];
7203 /* Translate the location according to the line-map.h formula. */
7204 *locus
= map
->start_location
7205 + ((line
- map
->to_line
) << map
->column_bits
)
7206 + (column
& ((1 << map
->column_bits
) - 1));
7210 = IDENTIFIER_POINTER
7212 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc
)))));;
7217 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7218 don't do anything if it doesn't correspond to a source location. */
7221 set_expr_location_from_node (tree node
, Node_Id gnat_node
)
7225 if (!Sloc_to_locus (Sloc (gnat_node
), &locus
))
7228 SET_EXPR_LOCATION (node
, locus
);
7231 /* Return a colon-separated list of encodings contained in encoded Ada
7235 extract_encoding (const char *name
)
7237 char *encoding
= GGC_NEWVEC (char, strlen (name
));
7239 get_encoding (name
, encoding
);
7244 /* Extract the Ada name from an encoded name. */
7247 decode_name (const char *name
)
7249 char *decoded
= GGC_NEWVEC (char, strlen (name
) * 2 + 60);
7251 __gnat_decode (name
, decoded
, 0);
7256 /* Post an error message. MSG is the error message, properly annotated.
7257 NODE is the node at which to post the error and the node to use for the
7258 "&" substitution. */
7261 post_error (const char *msg
, Node_Id node
)
7263 String_Template temp
;
7266 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7267 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7269 Error_Msg_N (fp
, node
);
7272 /* Similar, but NODE is the node at which to post the error and ENT
7273 is the node to use for the "&" substitution. */
7276 post_error_ne (const char *msg
, Node_Id node
, Entity_Id ent
)
7278 String_Template temp
;
7281 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7282 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7284 Error_Msg_NE (fp
, node
, ent
);
7287 /* Similar, but NODE is the node at which to post the error, ENT is the node
7288 to use for the "&" substitution, and N is the number to use for the ^. */
7291 post_error_ne_num (const char *msg
, Node_Id node
, Entity_Id ent
, int n
)
7293 String_Template temp
;
7296 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7297 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7298 Error_Msg_Uint_1
= UI_From_Int (n
);
7301 Error_Msg_NE (fp
, node
, ent
);
7304 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7305 number to write. If the tree represents a constant that fits within
7306 a host integer, the text inside curly brackets in MSG will be output
7307 (presumably including a '^'). Otherwise that text will not be output
7308 and the text inside square brackets will be output instead. */
7311 post_error_ne_tree (const char *msg
, Node_Id node
, Entity_Id ent
, tree t
)
7313 char *newmsg
= XALLOCAVEC (char, strlen (msg
) + 1);
7314 String_Template temp
= {1, 0};
7316 char start_yes
, end_yes
, start_no
, end_no
;
7320 fp
.Array
= newmsg
, fp
.Bounds
= &temp
;
7322 if (host_integerp (t
, 1)
7323 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7326 (t
, (((unsigned HOST_WIDE_INT
) 1 << (HOST_BITS_PER_INT
- 1)) - 1)) < 0
7330 Error_Msg_Uint_1
= UI_From_Int (tree_low_cst (t
, 1));
7331 start_yes
= '{', end_yes
= '}', start_no
= '[', end_no
= ']';
7334 start_yes
= '[', end_yes
= ']', start_no
= '{', end_no
= '}';
7336 for (p
= msg
, q
= newmsg
; *p
; p
++)
7338 if (*p
== start_yes
)
7339 for (p
++; *p
!= end_yes
; p
++)
7341 else if (*p
== start_no
)
7342 for (p
++; *p
!= end_no
; p
++)
7350 temp
.High_Bound
= strlen (newmsg
);
7352 Error_Msg_NE (fp
, node
, ent
);
7355 /* Similar to post_error_ne_tree, except that NUM is a second
7356 integer to write in the message. */
7359 post_error_ne_tree_2 (const char *msg
,
7365 Error_Msg_Uint_2
= UI_From_Int (num
);
7366 post_error_ne_tree (msg
, node
, ent
, t
);
7369 /* Initialize the table that maps GNAT codes to GCC codes for simple
7370 binary and unary operations. */
7373 init_code_table (void)
7375 gnu_codes
[N_And_Then
] = TRUTH_ANDIF_EXPR
;
7376 gnu_codes
[N_Or_Else
] = TRUTH_ORIF_EXPR
;
7378 gnu_codes
[N_Op_And
] = TRUTH_AND_EXPR
;
7379 gnu_codes
[N_Op_Or
] = TRUTH_OR_EXPR
;
7380 gnu_codes
[N_Op_Xor
] = TRUTH_XOR_EXPR
;
7381 gnu_codes
[N_Op_Eq
] = EQ_EXPR
;
7382 gnu_codes
[N_Op_Ne
] = NE_EXPR
;
7383 gnu_codes
[N_Op_Lt
] = LT_EXPR
;
7384 gnu_codes
[N_Op_Le
] = LE_EXPR
;
7385 gnu_codes
[N_Op_Gt
] = GT_EXPR
;
7386 gnu_codes
[N_Op_Ge
] = GE_EXPR
;
7387 gnu_codes
[N_Op_Add
] = PLUS_EXPR
;
7388 gnu_codes
[N_Op_Subtract
] = MINUS_EXPR
;
7389 gnu_codes
[N_Op_Multiply
] = MULT_EXPR
;
7390 gnu_codes
[N_Op_Mod
] = FLOOR_MOD_EXPR
;
7391 gnu_codes
[N_Op_Rem
] = TRUNC_MOD_EXPR
;
7392 gnu_codes
[N_Op_Minus
] = NEGATE_EXPR
;
7393 gnu_codes
[N_Op_Abs
] = ABS_EXPR
;
7394 gnu_codes
[N_Op_Not
] = TRUTH_NOT_EXPR
;
7395 gnu_codes
[N_Op_Rotate_Left
] = LROTATE_EXPR
;
7396 gnu_codes
[N_Op_Rotate_Right
] = RROTATE_EXPR
;
7397 gnu_codes
[N_Op_Shift_Left
] = LSHIFT_EXPR
;
7398 gnu_codes
[N_Op_Shift_Right
] = RSHIFT_EXPR
;
7399 gnu_codes
[N_Op_Shift_Right_Arithmetic
] = RSHIFT_EXPR
;
7402 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7406 get_exception_label (char kind
)
7408 if (kind
== N_Raise_Constraint_Error
)
7409 return TREE_VALUE (gnu_constraint_error_label_stack
);
7410 else if (kind
== N_Raise_Storage_Error
)
7411 return TREE_VALUE (gnu_storage_error_label_stack
);
7412 else if (kind
== N_Raise_Program_Error
)
7413 return TREE_VALUE (gnu_program_error_label_stack
);
7418 #include "gt-ada-trans.h"