1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 1992-2008, 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 on 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
);
826 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Attribute,
827 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
828 where we should place the result type. ATTRIBUTE is the attribute ID. */
831 Attribute_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
, int attribute
)
833 tree gnu_result
= error_mark_node
;
834 tree gnu_result_type
;
836 bool prefix_unused
= false;
837 tree gnu_prefix
= gnat_to_gnu (Prefix (gnat_node
));
838 tree gnu_type
= TREE_TYPE (gnu_prefix
);
840 /* If the input is a NULL_EXPR, make a new one. */
841 if (TREE_CODE (gnu_prefix
) == NULL_EXPR
)
843 *gnu_result_type_p
= get_unpadded_type (Etype (gnat_node
));
844 return build1 (NULL_EXPR
, *gnu_result_type_p
,
845 TREE_OPERAND (gnu_prefix
, 0));
852 /* These are just conversions until since representation clauses for
853 enumerations are handled in the front end. */
855 bool checkp
= Do_Range_Check (First (Expressions (gnat_node
)));
857 gnu_result
= gnat_to_gnu (First (Expressions (gnat_node
)));
858 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
859 gnu_result
= convert_with_check (Etype (gnat_node
), gnu_result
,
860 checkp
, checkp
, true);
866 /* These just add or subject the constant 1. Representation clauses for
867 enumerations are handled in the front-end. */
868 gnu_expr
= gnat_to_gnu (First (Expressions (gnat_node
)));
869 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
871 if (Do_Range_Check (First (Expressions (gnat_node
))))
873 gnu_expr
= protect_multiple_eval (gnu_expr
);
876 (build_binary_op (EQ_EXPR
, integer_type_node
,
878 attribute
== Attr_Pred
879 ? TYPE_MIN_VALUE (gnu_result_type
)
880 : TYPE_MAX_VALUE (gnu_result_type
)),
881 gnu_expr
, CE_Range_Check_Failed
);
885 = build_binary_op (attribute
== Attr_Pred
886 ? MINUS_EXPR
: PLUS_EXPR
,
887 gnu_result_type
, gnu_expr
,
888 convert (gnu_result_type
, integer_one_node
));
892 case Attr_Unrestricted_Access
:
893 /* Conversions don't change something's address but can cause us to miss
894 the COMPONENT_REF case below, so strip them off. */
895 gnu_prefix
= remove_conversions (gnu_prefix
,
896 !Must_Be_Byte_Aligned (gnat_node
));
898 /* If we are taking 'Address of an unconstrained object, this is the
899 pointer to the underlying array. */
900 if (attribute
== Attr_Address
)
901 gnu_prefix
= maybe_unconstrained_array (gnu_prefix
);
903 /* If we are building a static dispatch table, we have to honor
904 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
905 with the C++ ABI. We do it in the non-static case as well,
906 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
907 else if (TARGET_VTABLE_USES_DESCRIPTORS
908 && Is_Dispatch_Table_Entity (Etype (gnat_node
)))
910 tree gnu_field
, gnu_list
= NULL_TREE
, t
;
911 /* Descriptors can only be built here for top-level functions. */
912 bool build_descriptor
= (global_bindings_p () != 0);
915 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
917 /* If we're not going to build the descriptor, we have to retrieve
918 the one which will be built by the linker (or by the compiler
919 later if a static chain is requested). */
920 if (!build_descriptor
)
922 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_prefix
);
923 gnu_result
= fold_convert (build_pointer_type (gnu_result_type
),
925 gnu_result
= build1 (INDIRECT_REF
, gnu_result_type
, gnu_result
);
928 for (gnu_field
= TYPE_FIELDS (gnu_result_type
), i
= 0;
929 i
< TARGET_VTABLE_USES_DESCRIPTORS
;
930 gnu_field
= TREE_CHAIN (gnu_field
), i
++)
932 if (build_descriptor
)
934 t
= build2 (FDESC_EXPR
, TREE_TYPE (gnu_field
), gnu_prefix
,
935 build_int_cst (NULL_TREE
, i
));
936 TREE_CONSTANT (t
) = 1;
939 t
= build3 (COMPONENT_REF
, ptr_void_ftype
, gnu_result
,
940 gnu_field
, NULL_TREE
);
942 gnu_list
= tree_cons (gnu_field
, t
, gnu_list
);
945 gnu_result
= gnat_build_constructor (gnu_result_type
, gnu_list
);
949 /* ... fall through ... */
952 case Attr_Unchecked_Access
:
953 case Attr_Code_Address
:
954 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
956 = build_unary_op (((attribute
== Attr_Address
957 || attribute
== Attr_Unrestricted_Access
)
958 && !Must_Be_Byte_Aligned (gnat_node
))
959 ? ATTR_ADDR_EXPR
: ADDR_EXPR
,
960 gnu_result_type
, gnu_prefix
);
962 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
963 don't try to build a trampoline. */
964 if (attribute
== Attr_Code_Address
)
966 for (gnu_expr
= gnu_result
;
967 CONVERT_EXPR_P (gnu_expr
);
968 gnu_expr
= TREE_OPERAND (gnu_expr
, 0))
969 TREE_CONSTANT (gnu_expr
) = 1;
971 if (TREE_CODE (gnu_expr
) == ADDR_EXPR
)
972 TREE_NO_TRAMPOLINE (gnu_expr
) = TREE_CONSTANT (gnu_expr
) = 1;
975 /* For other address attributes applied to a nested function,
976 find an inner ADDR_EXPR and annotate it so that we can issue
977 a useful warning with -Wtrampolines. */
978 else if (TREE_CODE (TREE_TYPE (gnu_prefix
)) == FUNCTION_TYPE
)
980 for (gnu_expr
= gnu_result
;
981 CONVERT_EXPR_P (gnu_expr
);
982 gnu_expr
= TREE_OPERAND (gnu_expr
, 0))
985 if (TREE_CODE (gnu_expr
) == ADDR_EXPR
986 && decl_function_context (TREE_OPERAND (gnu_expr
, 0)))
988 set_expr_location_from_node (gnu_expr
, gnat_node
);
990 /* Check that we're not violating the No_Implicit_Dynamic_Code
991 restriction. Be conservative if we don't know anything
992 about the trampoline strategy for the target. */
993 Check_Implicit_Dynamic_Code_Allowed (gnat_node
);
998 case Attr_Pool_Address
:
1001 tree gnu_ptr
= gnu_prefix
;
1003 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1005 /* If this is an unconstrained array, we know the object must have been
1006 allocated with the template in front of the object. So compute the
1008 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr
)))
1010 = convert (build_pointer_type
1011 (TYPE_OBJECT_RECORD_TYPE
1012 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr
)))),
1015 gnu_obj_type
= TREE_TYPE (TREE_TYPE (gnu_ptr
));
1016 if (TREE_CODE (gnu_obj_type
) == RECORD_TYPE
1017 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type
))
1019 tree gnu_char_ptr_type
= build_pointer_type (char_type_node
);
1020 tree gnu_pos
= byte_position (TYPE_FIELDS (gnu_obj_type
));
1021 tree gnu_byte_offset
1022 = convert (sizetype
,
1023 size_diffop (size_zero_node
, gnu_pos
));
1024 gnu_byte_offset
= fold_build1 (NEGATE_EXPR
, sizetype
, gnu_byte_offset
);
1026 gnu_ptr
= convert (gnu_char_ptr_type
, gnu_ptr
);
1027 gnu_ptr
= build_binary_op (POINTER_PLUS_EXPR
, gnu_char_ptr_type
,
1028 gnu_ptr
, gnu_byte_offset
);
1031 gnu_result
= convert (gnu_result_type
, gnu_ptr
);
1036 case Attr_Object_Size
:
1037 case Attr_Value_Size
:
1038 case Attr_Max_Size_In_Storage_Elements
:
1039 gnu_expr
= gnu_prefix
;
1041 /* Remove NOPS from gnu_expr and conversions from gnu_prefix.
1042 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1043 while (TREE_CODE (gnu_expr
) == NOP_EXPR
)
1044 gnu_expr
= TREE_OPERAND (gnu_expr
, 0);
1046 gnu_prefix
= remove_conversions (gnu_prefix
, true);
1047 prefix_unused
= true;
1048 gnu_type
= TREE_TYPE (gnu_prefix
);
1050 /* Replace an unconstrained array type with the type of the underlying
1051 array. We can't do this with a call to maybe_unconstrained_array
1052 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1053 use the record type that will be used to allocate the object and its
1055 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
1057 gnu_type
= TYPE_OBJECT_RECORD_TYPE (gnu_type
);
1058 if (attribute
!= Attr_Max_Size_In_Storage_Elements
)
1059 gnu_type
= TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type
)));
1062 /* If we're looking for the size of a field, return the field size.
1063 Otherwise, if the prefix is an object, or if 'Object_Size or
1064 'Max_Size_In_Storage_Elements has been specified, the result is the
1065 GCC size of the type. Otherwise, the result is the RM_Size of the
1067 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
)
1068 gnu_result
= DECL_SIZE (TREE_OPERAND (gnu_prefix
, 1));
1069 else if (TREE_CODE (gnu_prefix
) != TYPE_DECL
1070 || attribute
== Attr_Object_Size
1071 || attribute
== Attr_Max_Size_In_Storage_Elements
)
1073 /* If this is a padded type, the GCC size isn't relevant to the
1074 programmer. Normally, what we want is the RM_Size, which was set
1075 from the specified size, but if it was not set, we want the size
1076 of the relevant field. Using the MAX of those two produces the
1077 right result in all case. Don't use the size of the field if it's
1078 a self-referential type, since that's never what's wanted. */
1079 if (TREE_CODE (gnu_type
) == RECORD_TYPE
1080 && TYPE_IS_PADDING_P (gnu_type
)
1081 && TREE_CODE (gnu_expr
) == COMPONENT_REF
)
1083 gnu_result
= rm_size (gnu_type
);
1084 if (!(CONTAINS_PLACEHOLDER_P
1085 (DECL_SIZE (TREE_OPERAND (gnu_expr
, 1)))))
1087 = size_binop (MAX_EXPR
, gnu_result
,
1088 DECL_SIZE (TREE_OPERAND (gnu_expr
, 1)));
1090 else if (Nkind (Prefix (gnat_node
)) == N_Explicit_Dereference
)
1092 Node_Id gnat_deref
= Prefix (gnat_node
);
1093 Node_Id gnat_actual_subtype
= Actual_Designated_Subtype (gnat_deref
);
1094 tree gnu_ptr_type
= TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref
)));
1095 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
)
1096 && Present (gnat_actual_subtype
))
1098 tree gnu_actual_obj_type
= gnat_to_gnu_type (gnat_actual_subtype
);
1099 gnu_type
= build_unc_object_type_from_ptr (gnu_ptr_type
,
1100 gnu_actual_obj_type
, get_identifier ("SIZE"));
1103 gnu_result
= TYPE_SIZE (gnu_type
);
1106 gnu_result
= TYPE_SIZE (gnu_type
);
1109 gnu_result
= rm_size (gnu_type
);
1111 gcc_assert (gnu_result
);
1113 /* Deal with a self-referential size by returning the maximum size for a
1114 type and by qualifying the size with the object for 'Size of an
1116 if (CONTAINS_PLACEHOLDER_P (gnu_result
))
1118 if (TREE_CODE (gnu_prefix
) != TYPE_DECL
)
1119 gnu_result
= substitute_placeholder_in_expr (gnu_result
, gnu_expr
);
1121 gnu_result
= max_size (gnu_result
, true);
1124 /* If the type contains a template, subtract its size. */
1125 if (TREE_CODE (gnu_type
) == RECORD_TYPE
1126 && TYPE_CONTAINS_TEMPLATE_P (gnu_type
))
1127 gnu_result
= size_binop (MINUS_EXPR
, gnu_result
,
1128 DECL_SIZE (TYPE_FIELDS (gnu_type
)));
1130 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1132 /* Always perform division using unsigned arithmetic as the size cannot
1133 be negative, but may be an overflowed positive value. This provides
1134 correct results for sizes up to 512 MB.
1136 ??? Size should be calculated in storage elements directly. */
1138 if (attribute
== Attr_Max_Size_In_Storage_Elements
)
1139 gnu_result
= convert (sizetype
,
1140 fold_build2 (CEIL_DIV_EXPR
, bitsizetype
,
1141 gnu_result
, bitsize_unit_node
));
1144 case Attr_Alignment
:
1145 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1146 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))
1148 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))))
1149 gnu_prefix
= TREE_OPERAND (gnu_prefix
, 0);
1151 gnu_type
= TREE_TYPE (gnu_prefix
);
1152 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1153 prefix_unused
= true;
1155 gnu_result
= size_int ((TREE_CODE (gnu_prefix
) == COMPONENT_REF
1156 ? DECL_ALIGN (TREE_OPERAND (gnu_prefix
, 1))
1157 : TYPE_ALIGN (gnu_type
)) / BITS_PER_UNIT
);
1162 case Attr_Range_Length
:
1163 prefix_unused
= true;
1165 if (INTEGRAL_TYPE_P (gnu_type
) || TREE_CODE (gnu_type
) == REAL_TYPE
)
1167 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1169 if (attribute
== Attr_First
)
1170 gnu_result
= TYPE_MIN_VALUE (gnu_type
);
1171 else if (attribute
== Attr_Last
)
1172 gnu_result
= TYPE_MAX_VALUE (gnu_type
);
1176 (MAX_EXPR
, get_base_type (gnu_result_type
),
1178 (PLUS_EXPR
, get_base_type (gnu_result_type
),
1179 build_binary_op (MINUS_EXPR
,
1180 get_base_type (gnu_result_type
),
1181 convert (gnu_result_type
,
1182 TYPE_MAX_VALUE (gnu_type
)),
1183 convert (gnu_result_type
,
1184 TYPE_MIN_VALUE (gnu_type
))),
1185 convert (gnu_result_type
, integer_one_node
)),
1186 convert (gnu_result_type
, integer_zero_node
));
1191 /* ... fall through ... */
1195 int Dimension
= (Present (Expressions (gnat_node
))
1196 ? UI_To_Int (Intval (First (Expressions (gnat_node
))))
1198 struct parm_attr
*pa
= NULL
;
1199 Entity_Id gnat_param
= Empty
;
1201 /* Make sure any implicit dereference gets done. */
1202 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
1203 gnu_prefix
= maybe_unconstrained_array (gnu_prefix
);
1204 /* We treat unconstrained array In parameters specially. */
1205 if (Nkind (Prefix (gnat_node
)) == N_Identifier
1206 && !Is_Constrained (Etype (Prefix (gnat_node
)))
1207 && Ekind (Entity (Prefix (gnat_node
))) == E_In_Parameter
)
1208 gnat_param
= Entity (Prefix (gnat_node
));
1209 gnu_type
= TREE_TYPE (gnu_prefix
);
1210 prefix_unused
= true;
1211 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1213 if (TYPE_CONVENTION_FORTRAN_P (gnu_type
))
1218 for (ndim
= 1, gnu_type_temp
= gnu_type
;
1219 TREE_CODE (TREE_TYPE (gnu_type_temp
)) == ARRAY_TYPE
1220 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp
));
1221 ndim
++, gnu_type_temp
= TREE_TYPE (gnu_type_temp
))
1224 Dimension
= ndim
+ 1 - Dimension
;
1227 for (i
= 1; i
< Dimension
; i
++)
1228 gnu_type
= TREE_TYPE (gnu_type
);
1230 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
1232 /* When not optimizing, look up the slot associated with the parameter
1233 and the dimension in the cache and create a new one on failure. */
1234 if (!optimize
&& Present (gnat_param
))
1236 for (i
= 0; VEC_iterate (parm_attr
, f_parm_attr_cache
, i
, pa
); i
++)
1237 if (pa
->id
== gnat_param
&& pa
->dim
== Dimension
)
1242 pa
= GGC_CNEW (struct parm_attr
);
1243 pa
->id
= gnat_param
;
1244 pa
->dim
= Dimension
;
1245 VEC_safe_push (parm_attr
, gc
, f_parm_attr_cache
, pa
);
1249 /* Return the cached expression or build a new one. */
1250 if (attribute
== Attr_First
)
1252 if (pa
&& pa
->first
)
1254 gnu_result
= pa
->first
;
1259 = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
)));
1262 else if (attribute
== Attr_Last
)
1266 gnu_result
= pa
->last
;
1271 = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
)));
1274 else /* attribute == Attr_Range_Length || attribute == Attr_Length */
1276 if (pa
&& pa
->length
)
1278 gnu_result
= pa
->length
;
1283 /* We used to compute the length as max (hb - lb + 1, 0),
1284 which could overflow for some cases of empty arrays, e.g.
1285 when lb == index_type'first. We now compute the length as
1286 (hb < lb) ? 0 : hb - lb + 1, which would only overflow in
1287 much rarer cases, for extremely large arrays we expect
1288 never to encounter in practice. In addition, the former
1289 computation required the use of potentially constraining
1290 signed arithmetic while the latter doesn't. */
1292 tree gnu_compute_type
= get_base_type (gnu_result_type
);
1295 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
1297 = convert (gnu_compute_type
, TYPE_MIN_VALUE (index_type
));
1299 = convert (gnu_compute_type
, TYPE_MAX_VALUE (index_type
));
1303 (COND_EXPR
, gnu_compute_type
,
1304 build_binary_op (LT_EXPR
, gnu_compute_type
, hb
, lb
),
1305 convert (gnu_compute_type
, integer_zero_node
),
1307 (PLUS_EXPR
, gnu_compute_type
,
1308 build_binary_op (MINUS_EXPR
, gnu_compute_type
, hb
, lb
),
1309 convert (gnu_compute_type
, integer_one_node
)));
1313 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1314 handling. Note that these attributes could not have been used on
1315 an unconstrained array type. */
1316 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
,
1319 /* Cache the expression we have just computed. Since we want to do it
1320 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1321 create the temporary. */
1325 = build1 (SAVE_EXPR
, TREE_TYPE (gnu_result
), gnu_result
);
1326 TREE_SIDE_EFFECTS (gnu_result
) = 1;
1327 if (attribute
== Attr_First
)
1328 pa
->first
= gnu_result
;
1329 else if (attribute
== Attr_Last
)
1330 pa
->last
= gnu_result
;
1332 pa
->length
= gnu_result
;
1337 case Attr_Bit_Position
:
1339 case Attr_First_Bit
:
1343 HOST_WIDE_INT bitsize
;
1344 HOST_WIDE_INT bitpos
;
1346 tree gnu_field_bitpos
;
1347 tree gnu_field_offset
;
1349 enum machine_mode mode
;
1350 int unsignedp
, volatilep
;
1352 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1353 gnu_prefix
= remove_conversions (gnu_prefix
, true);
1354 prefix_unused
= true;
1356 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1357 the result is 0. Don't allow 'Bit on a bare component, though. */
1358 if (attribute
== Attr_Bit
1359 && TREE_CODE (gnu_prefix
) != COMPONENT_REF
1360 && TREE_CODE (gnu_prefix
) != FIELD_DECL
)
1362 gnu_result
= integer_zero_node
;
1367 gcc_assert (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1368 || (attribute
== Attr_Bit_Position
1369 && TREE_CODE (gnu_prefix
) == FIELD_DECL
));
1371 get_inner_reference (gnu_prefix
, &bitsize
, &bitpos
, &gnu_offset
,
1372 &mode
, &unsignedp
, &volatilep
, false);
1374 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
)
1376 gnu_field_bitpos
= bit_position (TREE_OPERAND (gnu_prefix
, 1));
1377 gnu_field_offset
= byte_position (TREE_OPERAND (gnu_prefix
, 1));
1379 for (gnu_inner
= TREE_OPERAND (gnu_prefix
, 0);
1380 TREE_CODE (gnu_inner
) == COMPONENT_REF
1381 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner
, 1));
1382 gnu_inner
= TREE_OPERAND (gnu_inner
, 0))
1385 = size_binop (PLUS_EXPR
, gnu_field_bitpos
,
1386 bit_position (TREE_OPERAND (gnu_inner
, 1)));
1388 = size_binop (PLUS_EXPR
, gnu_field_offset
,
1389 byte_position (TREE_OPERAND (gnu_inner
, 1)));
1392 else if (TREE_CODE (gnu_prefix
) == FIELD_DECL
)
1394 gnu_field_bitpos
= bit_position (gnu_prefix
);
1395 gnu_field_offset
= byte_position (gnu_prefix
);
1399 gnu_field_bitpos
= bitsize_zero_node
;
1400 gnu_field_offset
= size_zero_node
;
1406 gnu_result
= gnu_field_offset
;
1409 case Attr_First_Bit
:
1411 gnu_result
= size_int (bitpos
% BITS_PER_UNIT
);
1415 gnu_result
= bitsize_int (bitpos
% BITS_PER_UNIT
);
1416 gnu_result
= size_binop (PLUS_EXPR
, gnu_result
,
1417 TYPE_SIZE (TREE_TYPE (gnu_prefix
)));
1418 gnu_result
= size_binop (MINUS_EXPR
, gnu_result
,
1422 case Attr_Bit_Position
:
1423 gnu_result
= gnu_field_bitpos
;
1427 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1429 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
, gnu_prefix
);
1436 tree gnu_lhs
= gnat_to_gnu (First (Expressions (gnat_node
)));
1437 tree gnu_rhs
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
1439 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1440 gnu_result
= build_binary_op (attribute
== Attr_Min
1441 ? MIN_EXPR
: MAX_EXPR
,
1442 gnu_result_type
, gnu_lhs
, gnu_rhs
);
1446 case Attr_Passed_By_Reference
:
1447 gnu_result
= size_int (default_pass_by_ref (gnu_type
)
1448 || must_pass_by_ref (gnu_type
));
1449 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1452 case Attr_Component_Size
:
1453 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1454 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))
1456 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))))
1457 gnu_prefix
= TREE_OPERAND (gnu_prefix
, 0);
1459 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
1460 gnu_type
= TREE_TYPE (gnu_prefix
);
1462 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
1463 gnu_type
= TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type
))));
1465 while (TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
1466 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
)))
1467 gnu_type
= TREE_TYPE (gnu_type
);
1469 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
1471 /* Note this size cannot be self-referential. */
1472 gnu_result
= TYPE_SIZE (TREE_TYPE (gnu_type
));
1473 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1474 prefix_unused
= true;
1477 case Attr_Null_Parameter
:
1478 /* This is just a zero cast to the pointer type for
1479 our prefix and dereferenced. */
1480 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1482 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
1483 convert (build_pointer_type (gnu_result_type
),
1484 integer_zero_node
));
1485 TREE_PRIVATE (gnu_result
) = 1;
1488 case Attr_Mechanism_Code
:
1491 Entity_Id gnat_obj
= Entity (Prefix (gnat_node
));
1493 prefix_unused
= true;
1494 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1495 if (Present (Expressions (gnat_node
)))
1497 int i
= UI_To_Int (Intval (First (Expressions (gnat_node
))));
1499 for (gnat_obj
= First_Formal (gnat_obj
); i
> 1;
1500 i
--, gnat_obj
= Next_Formal (gnat_obj
))
1504 code
= Mechanism (gnat_obj
);
1505 if (code
== Default
)
1506 code
= ((present_gnu_tree (gnat_obj
)
1507 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj
))
1508 || ((TREE_CODE (get_gnu_tree (gnat_obj
))
1510 && (DECL_BY_COMPONENT_PTR_P
1511 (get_gnu_tree (gnat_obj
))))))
1512 ? By_Reference
: By_Copy
);
1513 gnu_result
= convert (gnu_result_type
, size_int (- code
));
1518 /* Say we have an unimplemented attribute. Then set the value to be
1519 returned to be a zero and hope that's something we can convert to the
1520 type of this attribute. */
1521 post_error ("unimplemented attribute", gnat_node
);
1522 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1523 gnu_result
= integer_zero_node
;
1527 /* If this is an attribute where the prefix was unused, force a use of it if
1528 it has a side-effect. But don't do it if the prefix is just an entity
1529 name. However, if an access check is needed, we must do it. See second
1530 example in AARM 11.6(5.e). */
1531 if (prefix_unused
&& TREE_SIDE_EFFECTS (gnu_prefix
)
1532 && !Is_Entity_Name (Prefix (gnat_node
)))
1533 gnu_result
= fold_build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_result
),
1534 gnu_prefix
, gnu_result
);
1536 *gnu_result_type_p
= gnu_result_type
;
1540 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1541 to a GCC tree, which is returned. */
1544 Case_Statement_to_gnu (Node_Id gnat_node
)
1550 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
1551 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1553 /* The range of values in a case statement is determined by the rules in
1554 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1555 of the expression. One exception arises in the case of a simple name that
1556 is parenthesized. This still has the Etype of the name, but since it is
1557 not a name, para 7 does not apply, and we need to go to the base type.
1558 This is the only case where parenthesization affects the dynamic
1559 semantics (i.e. the range of possible values at runtime that is covered
1560 by the others alternative.
1562 Another exception is if the subtype of the expression is non-static. In
1563 that case, we also have to use the base type. */
1564 if (Paren_Count (Expression (gnat_node
)) != 0
1565 || !Is_OK_Static_Subtype (Underlying_Type
1566 (Etype (Expression (gnat_node
)))))
1567 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1569 /* We build a SWITCH_EXPR that contains the code with interspersed
1570 CASE_LABEL_EXPRs for each label. */
1572 push_stack (&gnu_switch_label_stack
, NULL_TREE
, create_artificial_label ());
1573 start_stmt_group ();
1574 for (gnat_when
= First_Non_Pragma (Alternatives (gnat_node
));
1575 Present (gnat_when
);
1576 gnat_when
= Next_Non_Pragma (gnat_when
))
1578 Node_Id gnat_choice
;
1579 int choices_added
= 0;
1581 /* First compile all the different case choices for the current WHEN
1583 for (gnat_choice
= First (Discrete_Choices (gnat_when
));
1584 Present (gnat_choice
); gnat_choice
= Next (gnat_choice
))
1586 tree gnu_low
= NULL_TREE
, gnu_high
= NULL_TREE
;
1588 switch (Nkind (gnat_choice
))
1591 gnu_low
= gnat_to_gnu (Low_Bound (gnat_choice
));
1592 gnu_high
= gnat_to_gnu (High_Bound (gnat_choice
));
1595 case N_Subtype_Indication
:
1596 gnu_low
= gnat_to_gnu (Low_Bound (Range_Expression
1597 (Constraint (gnat_choice
))));
1598 gnu_high
= gnat_to_gnu (High_Bound (Range_Expression
1599 (Constraint (gnat_choice
))));
1603 case N_Expanded_Name
:
1604 /* This represents either a subtype range or a static value of
1605 some kind; Ekind says which. */
1606 if (IN (Ekind (Entity (gnat_choice
)), Type_Kind
))
1608 tree gnu_type
= get_unpadded_type (Entity (gnat_choice
));
1610 gnu_low
= fold (TYPE_MIN_VALUE (gnu_type
));
1611 gnu_high
= fold (TYPE_MAX_VALUE (gnu_type
));
1615 /* ... fall through ... */
1617 case N_Character_Literal
:
1618 case N_Integer_Literal
:
1619 gnu_low
= gnat_to_gnu (gnat_choice
);
1622 case N_Others_Choice
:
1629 /* If the case value is a subtype that raises Constraint_Error at
1630 run-time because of a wrong bound, then gnu_low or gnu_high is
1631 not translated into an INTEGER_CST. In such a case, we need
1632 to ensure that the when statement is not added in the tree,
1633 otherwise it will crash the gimplifier. */
1634 if ((!gnu_low
|| TREE_CODE (gnu_low
) == INTEGER_CST
)
1635 && (!gnu_high
|| TREE_CODE (gnu_high
) == INTEGER_CST
))
1637 add_stmt_with_node (build3 (CASE_LABEL_EXPR
, void_type_node
,
1639 create_artificial_label ()),
1645 /* Push a binding level here in case variables are declared as we want
1646 them to be local to this set of statements instead of to the block
1647 containing the Case statement. */
1648 if (choices_added
> 0)
1650 add_stmt (build_stmt_group (Statements (gnat_when
), true));
1651 add_stmt (build1 (GOTO_EXPR
, void_type_node
,
1652 TREE_VALUE (gnu_switch_label_stack
)));
1656 /* Now emit a definition of the label all the cases branched to. */
1657 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
1658 TREE_VALUE (gnu_switch_label_stack
)));
1659 gnu_result
= build3 (SWITCH_EXPR
, TREE_TYPE (gnu_expr
), gnu_expr
,
1660 end_stmt_group (), NULL_TREE
);
1661 pop_stack (&gnu_switch_label_stack
);
1666 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1667 to a GCC tree, which is returned. */
1670 Loop_Statement_to_gnu (Node_Id gnat_node
)
1672 /* ??? It would be nice to use "build" here, but there's no build5. */
1673 tree gnu_loop_stmt
= build_nt (LOOP_STMT
, NULL_TREE
, NULL_TREE
,
1674 NULL_TREE
, NULL_TREE
, NULL_TREE
);
1675 tree gnu_loop_var
= NULL_TREE
;
1676 Node_Id gnat_iter_scheme
= Iteration_Scheme (gnat_node
);
1677 tree gnu_cond_expr
= NULL_TREE
;
1680 TREE_TYPE (gnu_loop_stmt
) = void_type_node
;
1681 TREE_SIDE_EFFECTS (gnu_loop_stmt
) = 1;
1682 LOOP_STMT_LABEL (gnu_loop_stmt
) = create_artificial_label ();
1683 set_expr_location_from_node (gnu_loop_stmt
, gnat_node
);
1684 Sloc_to_locus (Sloc (End_Label (gnat_node
)),
1685 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt
)));
1687 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1688 N_Exit_Statement can find it. */
1689 push_stack (&gnu_loop_label_stack
, NULL_TREE
,
1690 LOOP_STMT_LABEL (gnu_loop_stmt
));
1692 /* Set the condition under which the loop must keep going.
1693 For the case "LOOP .... END LOOP;" the condition is always true. */
1694 if (No (gnat_iter_scheme
))
1697 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1698 else if (Present (Condition (gnat_iter_scheme
)))
1699 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1700 = gnat_to_gnu (Condition (gnat_iter_scheme
));
1702 /* Otherwise we have an iteration scheme and the condition is given by
1703 the bounds of the subtype of the iteration variable. */
1706 Node_Id gnat_loop_spec
= Loop_Parameter_Specification (gnat_iter_scheme
);
1707 Entity_Id gnat_loop_var
= Defining_Entity (gnat_loop_spec
);
1708 Entity_Id gnat_type
= Etype (gnat_loop_var
);
1709 tree gnu_type
= get_unpadded_type (gnat_type
);
1710 tree gnu_low
= TYPE_MIN_VALUE (gnu_type
);
1711 tree gnu_high
= TYPE_MAX_VALUE (gnu_type
);
1712 bool reversep
= Reverse_Present (gnat_loop_spec
);
1713 tree gnu_first
= reversep
? gnu_high
: gnu_low
;
1714 tree gnu_last
= reversep
? gnu_low
: gnu_high
;
1715 enum tree_code end_code
= reversep
? GE_EXPR
: LE_EXPR
;
1716 tree gnu_base_type
= get_base_type (gnu_type
);
1717 tree gnu_limit
= (reversep
? TYPE_MIN_VALUE (gnu_base_type
)
1718 : TYPE_MAX_VALUE (gnu_base_type
));
1720 /* We know the loop variable will not overflow if GNU_LAST is a constant
1721 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1722 the limit test to the end of the loop. In that case, we have to test
1723 for an empty loop outside the loop. */
1724 if (TREE_CODE (gnu_last
) != INTEGER_CST
1725 || TREE_CODE (gnu_limit
) != INTEGER_CST
1726 || tree_int_cst_equal (gnu_last
, gnu_limit
))
1729 = build3 (COND_EXPR
, void_type_node
,
1730 build_binary_op (LE_EXPR
, integer_type_node
,
1732 NULL_TREE
, alloc_stmt_list ());
1733 set_expr_location_from_node (gnu_cond_expr
, gnat_loop_spec
);
1736 /* Open a new nesting level that will surround the loop to declare the
1737 loop index variable. */
1738 start_stmt_group ();
1741 /* Declare the loop index and set it to its initial value. */
1742 gnu_loop_var
= gnat_to_gnu_entity (gnat_loop_var
, gnu_first
, 1);
1743 if (DECL_BY_REF_P (gnu_loop_var
))
1744 gnu_loop_var
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_loop_var
);
1746 /* The loop variable might be a padded type, so use `convert' to get a
1747 reference to the inner variable if so. */
1748 gnu_loop_var
= convert (get_base_type (gnu_type
), gnu_loop_var
);
1750 /* Set either the top or bottom exit condition as appropriate depending
1751 on whether or not we know an overflow cannot occur. */
1753 LOOP_STMT_BOT_COND (gnu_loop_stmt
)
1754 = build_binary_op (NE_EXPR
, integer_type_node
,
1755 gnu_loop_var
, gnu_last
);
1757 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1758 = build_binary_op (end_code
, integer_type_node
,
1759 gnu_loop_var
, gnu_last
);
1761 LOOP_STMT_UPDATE (gnu_loop_stmt
)
1762 = build_binary_op (reversep
? PREDECREMENT_EXPR
1763 : PREINCREMENT_EXPR
,
1764 TREE_TYPE (gnu_loop_var
),
1766 convert (TREE_TYPE (gnu_loop_var
),
1768 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt
),
1772 /* If the loop was named, have the name point to this loop. In this case,
1773 the association is not a ..._DECL node, but the end label from this
1775 if (Present (Identifier (gnat_node
)))
1776 save_gnu_tree (Entity (Identifier (gnat_node
)),
1777 LOOP_STMT_LABEL (gnu_loop_stmt
), true);
1779 /* Make the loop body into its own block, so any allocated storage will be
1780 released every iteration. This is needed for stack allocation. */
1781 LOOP_STMT_BODY (gnu_loop_stmt
)
1782 = build_stmt_group (Statements (gnat_node
), true);
1784 /* If we declared a variable, then we are in a statement group for that
1785 declaration. Add the LOOP_STMT to it and make that the "loop". */
1788 add_stmt (gnu_loop_stmt
);
1790 gnu_loop_stmt
= end_stmt_group ();
1793 /* If we have an outer COND_EXPR, that's our result and this loop is its
1794 "true" statement. Otherwise, the result is the LOOP_STMT. */
1797 COND_EXPR_THEN (gnu_cond_expr
) = gnu_loop_stmt
;
1798 gnu_result
= gnu_cond_expr
;
1799 recalculate_side_effects (gnu_cond_expr
);
1802 gnu_result
= gnu_loop_stmt
;
1804 pop_stack (&gnu_loop_label_stack
);
1809 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
1810 handler for the current function. */
1812 /* This is implemented by issuing a call to the appropriate VMS specific
1813 builtin. To avoid having VMS specific sections in the global gigi decls
1814 array, we maintain the decls of interest here. We can't declare them
1815 inside the function because we must mark them never to be GC'd, which we
1816 can only do at the global level. */
1818 static GTY(()) tree vms_builtin_establish_handler_decl
= NULL_TREE
;
1819 static GTY(()) tree gnat_vms_condition_handler_decl
= NULL_TREE
;
1822 establish_gnat_vms_condition_handler (void)
1824 tree establish_stmt
;
1826 /* Elaborate the required decls on the first call. Check on the decl for
1827 the gnat condition handler to decide, as this is one we create so we are
1828 sure that it will be non null on subsequent calls. The builtin decl is
1829 looked up so remains null on targets where it is not implemented yet. */
1830 if (gnat_vms_condition_handler_decl
== NULL_TREE
)
1832 vms_builtin_establish_handler_decl
1834 (get_identifier ("__builtin_establish_vms_condition_handler"));
1836 gnat_vms_condition_handler_decl
1837 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
1839 build_function_type_list (integer_type_node
,
1843 NULL_TREE
, 0, 1, 1, 0, Empty
);
1846 /* Do nothing if the establish builtin is not available, which might happen
1847 on targets where the facility is not implemented. */
1848 if (vms_builtin_establish_handler_decl
== NULL_TREE
)
1852 = build_call_1_expr (vms_builtin_establish_handler_decl
,
1854 (ADDR_EXPR
, NULL_TREE
,
1855 gnat_vms_condition_handler_decl
));
1857 add_stmt (establish_stmt
);
1860 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
1861 don't return anything. */
1864 Subprogram_Body_to_gnu (Node_Id gnat_node
)
1866 /* Defining identifier of a parameter to the subprogram. */
1867 Entity_Id gnat_param
;
1868 /* The defining identifier for the subprogram body. Note that if a
1869 specification has appeared before for this body, then the identifier
1870 occurring in that specification will also be a defining identifier and all
1871 the calls to this subprogram will point to that specification. */
1872 Entity_Id gnat_subprog_id
1873 = (Present (Corresponding_Spec (gnat_node
))
1874 ? Corresponding_Spec (gnat_node
) : Defining_Entity (gnat_node
));
1875 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
1876 tree gnu_subprog_decl
;
1877 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
1878 tree gnu_subprog_type
;
1881 VEC(parm_attr
,gc
) *cache
;
1883 /* If this is a generic object or if it has been eliminated,
1885 if (Ekind (gnat_subprog_id
) == E_Generic_Procedure
1886 || Ekind (gnat_subprog_id
) == E_Generic_Function
1887 || Is_Eliminated (gnat_subprog_id
))
1890 /* If this subprogram acts as its own spec, define it. Otherwise, just get
1891 the already-elaborated tree node. However, if this subprogram had its
1892 elaboration deferred, we will already have made a tree node for it. So
1893 treat it as not being defined in that case. Such a subprogram cannot
1894 have an address clause or a freeze node, so this test is safe, though it
1895 does disable some otherwise-useful error checking. */
1897 = gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
,
1898 Acts_As_Spec (gnat_node
)
1899 && !present_gnu_tree (gnat_subprog_id
));
1901 gnu_subprog_type
= TREE_TYPE (gnu_subprog_decl
);
1903 /* Propagate the debug mode. */
1904 if (!Needs_Debug_Info (gnat_subprog_id
))
1905 DECL_IGNORED_P (gnu_subprog_decl
) = 1;
1907 /* Set the line number in the decl to correspond to that of the body so that
1908 the line number notes are written correctly. */
1909 Sloc_to_locus (Sloc (gnat_node
), &DECL_SOURCE_LOCATION (gnu_subprog_decl
));
1911 /* Initialize the information structure for the function. */
1912 allocate_struct_function (gnu_subprog_decl
, false);
1913 DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
1914 = GGC_CNEW (struct language_function
);
1916 begin_subprog_body (gnu_subprog_decl
);
1917 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
1919 /* If there are Out parameters, we need to ensure that the return statement
1920 properly copies them out. We do this by making a new block and converting
1921 any inner return into a goto to a label at the end of the block. */
1922 push_stack (&gnu_return_label_stack
, NULL_TREE
,
1923 gnu_cico_list
? create_artificial_label () : NULL_TREE
);
1925 /* Get a tree corresponding to the code for the subprogram. */
1926 start_stmt_group ();
1929 /* See if there are any parameters for which we don't yet have GCC entities.
1930 These must be for Out parameters for which we will be making VAR_DECL
1931 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
1932 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
1933 the order of the parameters. */
1934 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
1935 Present (gnat_param
);
1936 gnat_param
= Next_Formal_With_Extras (gnat_param
))
1937 if (!present_gnu_tree (gnat_param
))
1939 /* Skip any entries that have been already filled in; they must
1940 correspond to In Out parameters. */
1941 for (; gnu_cico_list
&& TREE_VALUE (gnu_cico_list
);
1942 gnu_cico_list
= TREE_CHAIN (gnu_cico_list
))
1945 /* Do any needed references for padded types. */
1946 TREE_VALUE (gnu_cico_list
)
1947 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list
)),
1948 gnat_to_gnu_entity (gnat_param
, NULL_TREE
, 1));
1951 /* On VMS, establish our condition handler to possibly turn a condition into
1952 the corresponding exception if the subprogram has a foreign convention or
1955 To ensure proper execution of local finalizations on condition instances,
1956 we must turn a condition into the corresponding exception even if there
1957 is no applicable Ada handler, and need at least one condition handler per
1958 possible call chain involving GNAT code. OTOH, establishing the handler
1959 has a cost so we want to minimize the number of subprograms into which
1960 this happens. The foreign or exported condition is expected to satisfy
1961 all the constraints. */
1962 if (TARGET_ABI_OPEN_VMS
1963 && (Has_Foreign_Convention (gnat_node
) || Is_Exported (gnat_node
)))
1964 establish_gnat_vms_condition_handler ();
1966 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
1968 /* Generate the code of the subprogram itself. A return statement will be
1969 present and any Out parameters will be handled there. */
1970 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
1972 gnu_result
= end_stmt_group ();
1974 /* If we populated the parameter attributes cache, we need to make sure
1975 that the cached expressions are evaluated on all possible paths. */
1976 cache
= DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
->parm_attr_cache
;
1979 struct parm_attr
*pa
;
1982 start_stmt_group ();
1984 for (i
= 0; VEC_iterate (parm_attr
, cache
, i
, pa
); i
++)
1987 add_stmt_with_node (pa
->first
, gnat_node
);
1989 add_stmt_with_node (pa
->last
, gnat_node
);
1991 add_stmt_with_node (pa
->length
, gnat_node
);
1994 add_stmt (gnu_result
);
1995 gnu_result
= end_stmt_group ();
1998 /* If we made a special return label, we need to make a block that contains
1999 the definition of that label and the copying to the return value. That
2000 block first contains the function, then the label and copy statement. */
2001 if (TREE_VALUE (gnu_return_label_stack
))
2005 start_stmt_group ();
2007 add_stmt (gnu_result
);
2008 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
2009 TREE_VALUE (gnu_return_label_stack
)));
2011 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2012 if (list_length (gnu_cico_list
) == 1)
2013 gnu_retval
= TREE_VALUE (gnu_cico_list
);
2015 gnu_retval
= gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
2018 if (DECL_P (gnu_retval
) && DECL_BY_REF_P (gnu_retval
))
2019 gnu_retval
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_retval
);
2022 (build_return_expr (DECL_RESULT (gnu_subprog_decl
), gnu_retval
),
2023 End_Label (Handled_Statement_Sequence (gnat_node
)));
2025 gnu_result
= end_stmt_group ();
2028 pop_stack (&gnu_return_label_stack
);
2030 /* Set the end location. */
2032 ((Present (End_Label (Handled_Statement_Sequence (gnat_node
)))
2033 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node
)))
2034 : Sloc (gnat_node
)),
2035 &DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->function_end_locus
);
2037 end_subprog_body (gnu_result
, false);
2039 /* Disconnect the trees for parameters that we made variables for from the
2040 GNAT entities since these are unusable after we end the function. */
2041 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
2042 Present (gnat_param
);
2043 gnat_param
= Next_Formal_With_Extras (gnat_param
))
2044 if (TREE_CODE (get_gnu_tree (gnat_param
)) == VAR_DECL
)
2045 save_gnu_tree (gnat_param
, NULL_TREE
, false);
2047 if (DECL_FUNCTION_STUB (gnu_subprog_decl
))
2048 build_function_stub (gnu_subprog_decl
, gnat_subprog_id
);
2050 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node
)));
2053 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2054 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2055 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2056 If GNU_TARGET is non-null, this must be a function call and the result
2057 of the call is to be placed into that object. */
2060 call_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
, tree gnu_target
)
2063 /* The GCC node corresponding to the GNAT subprogram name. This can either
2064 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2065 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2067 tree gnu_subprog_node
= gnat_to_gnu (Name (gnat_node
));
2068 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2069 tree gnu_subprog_type
= TREE_TYPE (gnu_subprog_node
);
2070 tree gnu_subprog_addr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2072 Entity_Id gnat_formal
;
2073 Node_Id gnat_actual
;
2074 tree gnu_actual_list
= NULL_TREE
;
2075 tree gnu_name_list
= NULL_TREE
;
2076 tree gnu_before_list
= NULL_TREE
;
2077 tree gnu_after_list
= NULL_TREE
;
2078 tree gnu_subprog_call
;
2080 switch (Nkind (Name (gnat_node
)))
2083 case N_Operator_Symbol
:
2084 case N_Expanded_Name
:
2085 case N_Attribute_Reference
:
2086 if (Is_Eliminated (Entity (Name (gnat_node
))))
2087 Eliminate_Error_Msg (gnat_node
, Entity (Name (gnat_node
)));
2090 gcc_assert (TREE_CODE (gnu_subprog_type
) == FUNCTION_TYPE
);
2092 /* If we are calling a stubbed function, make this into a raise of
2093 Program_Error. Elaborate all our args first. */
2094 if (TREE_CODE (gnu_subprog_node
) == FUNCTION_DECL
2095 && DECL_STUBBED_P (gnu_subprog_node
))
2097 for (gnat_actual
= First_Actual (gnat_node
);
2098 Present (gnat_actual
);
2099 gnat_actual
= Next_Actual (gnat_actual
))
2100 add_stmt (gnat_to_gnu (gnat_actual
));
2104 = build_call_raise (PE_Stubbed_Subprogram_Called
, gnat_node
,
2105 N_Raise_Program_Error
);
2107 if (Nkind (gnat_node
) == N_Function_Call
&& !gnu_target
)
2109 *gnu_result_type_p
= TREE_TYPE (gnu_subprog_type
);
2110 return build1 (NULL_EXPR
, *gnu_result_type_p
, call_expr
);
2117 /* If we are calling by supplying a pointer to a target, set up that
2118 pointer as the first argument. Use GNU_TARGET if one was passed;
2119 otherwise, make a target by building a variable of the maximum size
2121 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2123 tree gnu_real_ret_type
2124 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2129 = maybe_pad_type (gnu_real_ret_type
,
2130 max_size (TYPE_SIZE (gnu_real_ret_type
), true),
2131 0, Etype (Name (gnat_node
)), "PAD", false,
2134 /* ??? We may be about to create a static temporary if we happen to
2135 be at the global binding level. That's a regression from what
2136 the 3.x back-end would generate in the same situation, but we
2137 don't have a mechanism in Gigi for creating automatic variables
2138 in the elaboration routines. */
2140 = create_var_decl (create_tmp_var_name ("LR"), NULL
, gnu_obj_type
,
2141 NULL
, false, false, false, false, NULL
,
2146 = tree_cons (NULL_TREE
,
2147 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2148 unchecked_convert (gnu_real_ret_type
,
2155 /* The only way we can be making a call via an access type is if Name is an
2156 explicit dereference. In that case, get the list of formal args from the
2157 type the access type is pointing to. Otherwise, get the formals from
2158 entity being called. */
2159 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2160 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2161 else if (Nkind (Name (gnat_node
)) == N_Attribute_Reference
)
2162 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2165 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2167 /* Create the list of the actual parameters as GCC expects it, namely a chain
2168 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2169 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2170 parameters not passed by reference and don't need to be copied in. */
2171 for (gnat_actual
= First_Actual (gnat_node
);
2172 Present (gnat_actual
);
2173 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2174 gnat_actual
= Next_Actual (gnat_actual
))
2177 = (present_gnu_tree (gnat_formal
)
2178 ? get_gnu_tree (gnat_formal
) : NULL_TREE
);
2179 tree gnu_formal_type
= gnat_to_gnu_type (Etype (gnat_formal
));
2180 /* We must suppress conversions that can cause the creation of a
2181 temporary in the Out or In Out case because we need the real
2182 object in this case, either to pass its address if it's passed
2183 by reference or as target of the back copy done after the call
2184 if it uses the copy-in copy-out mechanism. We do it in the In
2185 case too, except for an unchecked conversion because it alone
2186 can cause the actual to be misaligned and the addressability
2187 test is applied to the real object. */
2188 bool suppress_type_conversion
2189 = ((Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
2190 && Ekind (gnat_formal
) != E_In_Parameter
)
2191 || (Nkind (gnat_actual
) == N_Type_Conversion
2192 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal
)))));
2193 Node_Id gnat_name
= (suppress_type_conversion
2194 ? Expression (gnat_actual
) : gnat_actual
);
2195 tree gnu_name
= gnat_to_gnu (gnat_name
), gnu_name_type
;
2198 /* If it's possible we may need to use this expression twice, make sure
2199 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2200 to force side-effects before the call.
2201 ??? This is more conservative than we need since we don't need to do
2202 this for pass-by-ref with no conversion. */
2203 if (Ekind (gnat_formal
) != E_In_Parameter
)
2204 gnu_name
= gnat_stabilize_reference (gnu_name
, true);
2206 /* If we are passing a non-addressable parameter by reference, pass the
2207 address of a copy. In the Out or In Out case, set up to copy back
2208 out after the call. */
2210 && (DECL_BY_REF_P (gnu_formal
)
2211 || (TREE_CODE (gnu_formal
) == PARM_DECL
2212 && (DECL_BY_COMPONENT_PTR_P (gnu_formal
)
2213 || (DECL_BY_DESCRIPTOR_P (gnu_formal
)))))
2214 && (gnu_name_type
= gnat_to_gnu_type (Etype (gnat_name
)))
2215 && !addressable_p (gnu_name
, gnu_name_type
))
2217 tree gnu_copy
= gnu_name
, gnu_temp
;
2219 /* If the type is by_reference, a copy is not allowed. */
2220 if (Is_By_Reference_Type (Etype (gnat_formal
)))
2222 ("misaligned actual cannot be passed by reference", gnat_actual
);
2224 /* For users of Starlet we issue a warning because the
2225 interface apparently assumes that by-ref parameters
2226 outlive the procedure invocation. The code still
2227 will not work as intended, but we cannot do much
2228 better since other low-level parts of the back-end
2229 would allocate temporaries at will because of the
2230 misalignment if we did not do so here. */
2231 else if (Is_Valued_Procedure (Entity (Name (gnat_node
))))
2234 ("?possible violation of implicit assumption", gnat_actual
);
2236 ("?made by pragma Import_Valued_Procedure on &", gnat_actual
,
2237 Entity (Name (gnat_node
)));
2238 post_error_ne ("?because of misalignment of &", gnat_actual
,
2242 /* Remove any unpadding from the object and reset the copy. */
2243 if (TREE_CODE (gnu_name
) == COMPONENT_REF
2244 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name
, 0)))
2246 && (TYPE_IS_PADDING_P
2247 (TREE_TYPE (TREE_OPERAND (gnu_name
, 0))))))
2248 gnu_name
= gnu_copy
= TREE_OPERAND (gnu_name
, 0);
2250 /* Otherwise convert to the nominal type of the object if it's
2251 a record type. There are several cases in which we need to
2252 make the temporary using this type instead of the actual type
2253 of the object if they are distinct, because the expectations
2254 of the callee would otherwise not be met:
2255 - if it's a justified modular type,
2256 - if the actual type is a smaller packable version of it. */
2257 else if (TREE_CODE (gnu_name_type
) == RECORD_TYPE
2258 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type
)
2259 || smaller_packable_type_p (TREE_TYPE (gnu_name
),
2261 gnu_name
= convert (gnu_name_type
, gnu_name
);
2263 /* Make a SAVE_EXPR to both properly account for potential side
2264 effects and handle the creation of a temporary copy. Special
2265 code in gnat_gimplify_expr ensures that the same temporary is
2266 used as the object and copied back after the call if needed. */
2267 gnu_name
= build1 (SAVE_EXPR
, TREE_TYPE (gnu_name
), gnu_name
);
2268 TREE_SIDE_EFFECTS (gnu_name
) = 1;
2270 /* Set up to move the copy back to the original. */
2271 if (Ekind (gnat_formal
) != E_In_Parameter
)
2273 gnu_temp
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_copy
,
2275 set_expr_location_from_node (gnu_temp
, gnat_node
);
2276 append_to_statement_list (gnu_temp
, &gnu_after_list
);
2280 /* Start from the real object and build the actual. */
2281 gnu_actual
= gnu_name
;
2283 /* If this was a procedure call, we may not have removed any padding.
2284 So do it here for the part we will use as an input, if any. */
2285 if (Ekind (gnat_formal
) != E_Out_Parameter
2286 && TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2287 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
)))
2288 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2291 /* Do any needed conversions for the actual and make sure that it is
2292 in range of the formal's type. */
2293 if (suppress_type_conversion
)
2295 /* Put back the conversion we suppressed above in the computation
2296 of the real object. Note that we treat a conversion between
2297 aggregate types as if it is an unchecked conversion here. */
2299 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2301 (Nkind (gnat_actual
)
2302 == N_Unchecked_Type_Conversion
)
2303 && No_Truncation (gnat_actual
));
2305 if (Ekind (gnat_formal
) != E_Out_Parameter
2306 && Do_Range_Check (gnat_actual
))
2307 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2311 if (Ekind (gnat_formal
) != E_Out_Parameter
2312 && Do_Range_Check (gnat_actual
))
2313 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2315 /* We may have suppressed a conversion to the Etype of the actual
2316 since the parent is a procedure call. So put it back here.
2317 ??? We use the reverse order compared to the case above because
2318 of an awkward interaction with the check and actually don't put
2319 back the conversion at all if a check is emitted. This is also
2320 done for the conversion to the formal's type just below. */
2321 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2322 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2326 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2327 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2329 /* Unless this is an In parameter, we must remove any justified modular
2330 building from GNU_NAME to get an lvalue. */
2331 if (Ekind (gnat_formal
) != E_In_Parameter
2332 && TREE_CODE (gnu_name
) == CONSTRUCTOR
2333 && TREE_CODE (TREE_TYPE (gnu_name
)) == RECORD_TYPE
2334 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name
)))
2335 gnu_name
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name
))),
2338 /* If we have not saved a GCC object for the formal, it means it is an
2339 Out parameter not passed by reference and that does not need to be
2340 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2343 && TREE_CODE (gnu_formal
) == PARM_DECL
2344 && DECL_BY_REF_P (gnu_formal
))
2346 if (Ekind (gnat_formal
) != E_In_Parameter
)
2348 /* In Out or Out parameters passed by reference don't use the
2349 copy-in copy-out mechanism so the address of the real object
2350 must be passed to the function. */
2351 gnu_actual
= gnu_name
;
2353 /* If we have a padded type, be sure we've removed padding. */
2354 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2355 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
))
2356 && TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2357 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2360 /* If we have the constructed subtype of an aliased object
2361 with an unconstrained nominal subtype, the type of the
2362 actual includes the template, although it is formally
2363 constrained. So we need to convert it back to the real
2364 constructed subtype to retrieve the constrained part
2365 and takes its address. */
2366 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2367 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual
))
2368 && TREE_CODE (gnu_actual
) != SAVE_EXPR
2369 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual
))
2370 && Is_Array_Type (Etype (gnat_actual
)))
2371 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2375 /* The symmetry of the paths to the type of an entity is broken here
2376 since arguments don't know that they will be passed by ref. */
2377 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2378 gnu_actual
= build_unary_op (ADDR_EXPR
, gnu_formal_type
, gnu_actual
);
2381 && TREE_CODE (gnu_formal
) == PARM_DECL
2382 && DECL_BY_COMPONENT_PTR_P (gnu_formal
))
2384 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2385 gnu_actual
= maybe_implicit_deref (gnu_actual
);
2386 gnu_actual
= maybe_unconstrained_array (gnu_actual
);
2388 if (TREE_CODE (gnu_formal_type
) == RECORD_TYPE
2389 && TYPE_IS_PADDING_P (gnu_formal_type
))
2391 gnu_formal_type
= TREE_TYPE (TYPE_FIELDS (gnu_formal_type
));
2392 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2395 /* Take the address of the object and convert to the proper pointer
2396 type. We'd like to actually compute the address of the beginning
2397 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2398 possibility that the ARRAY_REF might return a constant and we'd be
2399 getting the wrong address. Neither approach is exactly correct,
2400 but this is the most likely to work in all cases. */
2401 gnu_actual
= convert (gnu_formal_type
,
2402 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2406 && TREE_CODE (gnu_formal
) == PARM_DECL
2407 && DECL_BY_DESCRIPTOR_P (gnu_formal
))
2409 /* If arg is 'Null_Parameter, pass zero descriptor. */
2410 if ((TREE_CODE (gnu_actual
) == INDIRECT_REF
2411 || TREE_CODE (gnu_actual
) == UNCONSTRAINED_ARRAY_REF
)
2412 && TREE_PRIVATE (gnu_actual
))
2413 gnu_actual
= convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal
)),
2416 gnu_actual
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2417 fill_vms_descriptor (gnu_actual
,
2423 tree gnu_actual_size
= TYPE_SIZE (TREE_TYPE (gnu_actual
));
2425 if (Ekind (gnat_formal
) != E_In_Parameter
)
2426 gnu_name_list
= tree_cons (NULL_TREE
, gnu_name
, gnu_name_list
);
2428 if (!gnu_formal
|| TREE_CODE (gnu_formal
) != PARM_DECL
)
2431 /* If this is 'Null_Parameter, pass a zero even though we are
2432 dereferencing it. */
2433 else if (TREE_CODE (gnu_actual
) == INDIRECT_REF
2434 && TREE_PRIVATE (gnu_actual
)
2435 && host_integerp (gnu_actual_size
, 1)
2436 && 0 >= compare_tree_int (gnu_actual_size
,
2439 = unchecked_convert (DECL_ARG_TYPE (gnu_formal
),
2440 convert (gnat_type_for_size
2441 (tree_low_cst (gnu_actual_size
, 1),
2446 gnu_actual
= convert (DECL_ARG_TYPE (gnu_formal
), gnu_actual
);
2449 gnu_actual_list
= tree_cons (NULL_TREE
, gnu_actual
, gnu_actual_list
);
2452 gnu_subprog_call
= build_call_list (TREE_TYPE (gnu_subprog_type
),
2454 nreverse (gnu_actual_list
));
2455 set_expr_location_from_node (gnu_subprog_call
, gnat_node
);
2457 /* If we return by passing a target, the result is the target after the
2458 call. We must not emit the call directly here because this might be
2459 evaluated as part of an expression with conditions to control whether
2460 the call should be emitted or not. */
2461 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2463 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2464 by the target object converted to the proper type. Doing so would
2465 potentially be very inefficient, however, as this expression might
2466 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2467 pointless temporary copy of the whole object.
2469 What we do instead is build a COMPOUND_EXPR returning the address of
2470 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2471 SAVE_EXPR later on then only incurs a pointer copy. */
2473 tree gnu_result_type
2474 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2477 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2479 tree gnu_target_address
2480 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_target
);
2481 set_expr_location_from_node (gnu_target_address
, gnat_node
);
2484 = build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_target_address
),
2485 gnu_subprog_call
, gnu_target_address
);
2488 = unchecked_convert (gnu_result_type
,
2489 build_unary_op (INDIRECT_REF
, NULL_TREE
,
2493 *gnu_result_type_p
= gnu_result_type
;
2497 /* If it is a function call, the result is the call expression unless
2498 a target is specified, in which case we copy the result into the target
2499 and return the assignment statement. */
2500 else if (Nkind (gnat_node
) == N_Function_Call
)
2502 gnu_result
= gnu_subprog_call
;
2504 /* If the function returns an unconstrained array or by reference,
2505 we have to de-dereference the pointer. */
2506 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
)
2507 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type
))
2508 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
2511 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2512 gnu_target
, gnu_result
);
2514 *gnu_result_type_p
= get_unpadded_type (Etype (gnat_node
));
2519 /* If this is the case where the GNAT tree contains a procedure call
2520 but the Ada procedure has copy in copy out parameters, the special
2521 parameter passing mechanism must be used. */
2522 else if (TYPE_CI_CO_LIST (gnu_subprog_type
) != NULL_TREE
)
2524 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2525 in copy out parameters. */
2526 tree scalar_return_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2527 int length
= list_length (scalar_return_list
);
2533 gnu_subprog_call
= save_expr (gnu_subprog_call
);
2534 gnu_name_list
= nreverse (gnu_name_list
);
2536 /* If any of the names had side-effects, ensure they are all
2537 evaluated before the call. */
2538 for (gnu_name
= gnu_name_list
; gnu_name
;
2539 gnu_name
= TREE_CHAIN (gnu_name
))
2540 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name
)))
2541 append_to_statement_list (TREE_VALUE (gnu_name
),
2545 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2546 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2548 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2550 for (gnat_actual
= First_Actual (gnat_node
);
2551 Present (gnat_actual
);
2552 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2553 gnat_actual
= Next_Actual (gnat_actual
))
2554 /* If we are dealing with a copy in copy out parameter, we must
2555 retrieve its value from the record returned in the call. */
2556 if (!(present_gnu_tree (gnat_formal
)
2557 && TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2558 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal
))
2559 || (TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2560 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal
))
2561 || (DECL_BY_DESCRIPTOR_P
2562 (get_gnu_tree (gnat_formal
))))))))
2563 && Ekind (gnat_formal
) != E_In_Parameter
)
2565 /* Get the value to assign to this Out or In Out parameter. It is
2566 either the result of the function if there is only a single such
2567 parameter or the appropriate field from the record returned. */
2569 = length
== 1 ? gnu_subprog_call
2570 : build_component_ref (gnu_subprog_call
, NULL_TREE
,
2571 TREE_PURPOSE (scalar_return_list
),
2574 /* If the actual is a conversion, get the inner expression, which
2575 will be the real destination, and convert the result to the
2576 type of the actual parameter. */
2578 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list
));
2580 /* If the result is a padded type, remove the padding. */
2581 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
2582 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
2583 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS
2584 (TREE_TYPE (gnu_result
))),
2587 /* If the actual is a type conversion, the real target object is
2588 denoted by the inner Expression and we need to convert the
2589 result to the associated type.
2590 We also need to convert our gnu assignment target to this type
2591 if the corresponding GNU_NAME was constructed from the GNAT
2592 conversion node and not from the inner Expression. */
2593 if (Nkind (gnat_actual
) == N_Type_Conversion
)
2596 = convert_with_check
2597 (Etype (Expression (gnat_actual
)), gnu_result
,
2598 Do_Overflow_Check (gnat_actual
),
2599 Do_Range_Check (Expression (gnat_actual
)),
2600 Float_Truncate (gnat_actual
));
2602 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal
))))
2603 gnu_actual
= convert (TREE_TYPE (gnu_result
), gnu_actual
);
2606 /* Unchecked conversions as actuals for Out parameters are not
2607 allowed in user code because they are not variables, but do
2608 occur in front-end expansions. The associated GNU_NAME is
2609 always obtained from the inner expression in such cases. */
2610 else if (Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
)
2611 gnu_result
= unchecked_convert (TREE_TYPE (gnu_actual
),
2613 No_Truncation (gnat_actual
));
2616 if (Do_Range_Check (gnat_actual
))
2617 gnu_result
= emit_range_check (gnu_result
,
2618 Etype (gnat_actual
));
2620 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual
)))
2621 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result
)))))
2622 gnu_result
= convert (TREE_TYPE (gnu_actual
), gnu_result
);
2625 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2626 gnu_actual
, gnu_result
);
2627 set_expr_location_from_node (gnu_result
, gnat_node
);
2628 append_to_statement_list (gnu_result
, &gnu_before_list
);
2629 scalar_return_list
= TREE_CHAIN (scalar_return_list
);
2630 gnu_name_list
= TREE_CHAIN (gnu_name_list
);
2634 append_to_statement_list (gnu_subprog_call
, &gnu_before_list
);
2636 append_to_statement_list (gnu_after_list
, &gnu_before_list
);
2637 return gnu_before_list
;
2640 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2641 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2644 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node
)
2646 tree gnu_jmpsave_decl
= NULL_TREE
;
2647 tree gnu_jmpbuf_decl
= NULL_TREE
;
2648 /* If just annotating, ignore all EH and cleanups. */
2649 bool gcc_zcx
= (!type_annotate_only
2650 && Present (Exception_Handlers (gnat_node
))
2651 && Exception_Mechanism
== Back_End_Exceptions
);
2653 = (!type_annotate_only
&& Present (Exception_Handlers (gnat_node
))
2654 && Exception_Mechanism
== Setjmp_Longjmp
);
2655 bool at_end
= !type_annotate_only
&& Present (At_End_Proc (gnat_node
));
2656 bool binding_for_block
= (at_end
|| gcc_zcx
|| setjmp_longjmp
);
2657 tree gnu_inner_block
; /* The statement(s) for the block itself. */
2662 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2663 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2664 add_cleanup, and when we leave the binding, end_stmt_group will create
2665 the TRY_FINALLY_EXPR.
2667 ??? The region level calls down there have been specifically put in place
2668 for a ZCX context and currently the order in which things are emitted
2669 (region/handlers) is different from the SJLJ case. Instead of putting
2670 other calls with different conditions at other places for the SJLJ case,
2671 it seems cleaner to reorder things for the SJLJ case and generalize the
2672 condition to make it not ZCX specific.
2674 If there are any exceptions or cleanup processing involved, we need an
2675 outer statement group (for Setjmp_Longjmp) and binding level. */
2676 if (binding_for_block
)
2678 start_stmt_group ();
2682 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2683 area for address of previous buffer. Do this first since we need to have
2684 the setjmp buf known for any decls in this block. */
2687 gnu_jmpsave_decl
= create_var_decl (get_identifier ("JMPBUF_SAVE"),
2688 NULL_TREE
, jmpbuf_ptr_type
,
2689 build_call_0_expr (get_jmpbuf_decl
),
2690 false, false, false, false, NULL
,
2692 DECL_ARTIFICIAL (gnu_jmpsave_decl
) = 1;
2694 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2695 because of the unstructured form of EH used by setjmp_longjmp, there
2696 might be forward edges going to __builtin_setjmp receivers on which
2697 it is uninitialized, although they will never be actually taken. */
2698 TREE_NO_WARNING (gnu_jmpsave_decl
) = 1;
2699 gnu_jmpbuf_decl
= create_var_decl (get_identifier ("JMP_BUF"),
2700 NULL_TREE
, jmpbuf_type
,
2701 NULL_TREE
, false, false, false, false,
2703 DECL_ARTIFICIAL (gnu_jmpbuf_decl
) = 1;
2705 set_block_jmpbuf_decl (gnu_jmpbuf_decl
);
2707 /* When we exit this block, restore the saved value. */
2708 add_cleanup (build_call_1_expr (set_jmpbuf_decl
, gnu_jmpsave_decl
),
2709 End_Label (gnat_node
));
2712 /* If we are to call a function when exiting this block, add a cleanup
2713 to the binding level we made above. Note that add_cleanup is FIFO
2714 so we must register this cleanup after the EH cleanup just above. */
2716 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node
))),
2717 End_Label (gnat_node
));
2719 /* Now build the tree for the declarations and statements inside this block.
2720 If this is SJLJ, set our jmp_buf as the current buffer. */
2721 start_stmt_group ();
2724 add_stmt (build_call_1_expr (set_jmpbuf_decl
,
2725 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2728 if (Present (First_Real_Statement (gnat_node
)))
2729 process_decls (Statements (gnat_node
), Empty
,
2730 First_Real_Statement (gnat_node
), true, true);
2732 /* Generate code for each statement in the block. */
2733 for (gnat_temp
= (Present (First_Real_Statement (gnat_node
))
2734 ? First_Real_Statement (gnat_node
)
2735 : First (Statements (gnat_node
)));
2736 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
2737 add_stmt (gnat_to_gnu (gnat_temp
));
2738 gnu_inner_block
= end_stmt_group ();
2740 /* Now generate code for the two exception models, if either is relevant for
2744 tree
*gnu_else_ptr
= 0;
2747 /* Make a binding level for the exception handling declarations and code
2748 and set up gnu_except_ptr_stack for the handlers to use. */
2749 start_stmt_group ();
2752 push_stack (&gnu_except_ptr_stack
, NULL_TREE
,
2753 create_var_decl (get_identifier ("EXCEPT_PTR"),
2755 build_pointer_type (except_type_node
),
2756 build_call_0_expr (get_excptr_decl
), false,
2757 false, false, false, NULL
, gnat_node
));
2759 /* Generate code for each handler. The N_Exception_Handler case does the
2760 real work and returns a COND_EXPR for each handler, which we chain
2762 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2763 Present (gnat_temp
); gnat_temp
= Next_Non_Pragma (gnat_temp
))
2765 gnu_expr
= gnat_to_gnu (gnat_temp
);
2767 /* If this is the first one, set it as the outer one. Otherwise,
2768 point the "else" part of the previous handler to us. Then point
2769 to our "else" part. */
2771 add_stmt (gnu_expr
);
2773 *gnu_else_ptr
= gnu_expr
;
2775 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
2778 /* If none of the exception handlers did anything, re-raise but do not
2780 gnu_expr
= build_call_1_expr (raise_nodefer_decl
,
2781 TREE_VALUE (gnu_except_ptr_stack
));
2782 set_expr_location_from_node (gnu_expr
, gnat_node
);
2785 *gnu_else_ptr
= gnu_expr
;
2787 add_stmt (gnu_expr
);
2789 /* End the binding level dedicated to the exception handlers and get the
2790 whole statement group. */
2791 pop_stack (&gnu_except_ptr_stack
);
2793 gnu_handler
= end_stmt_group ();
2795 /* If the setjmp returns 1, we restore our incoming longjmp value and
2796 then check the handlers. */
2797 start_stmt_group ();
2798 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl
,
2801 add_stmt (gnu_handler
);
2802 gnu_handler
= end_stmt_group ();
2804 /* This block is now "if (setjmp) ... <handlers> else <block>". */
2805 gnu_result
= build3 (COND_EXPR
, void_type_node
,
2808 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2810 gnu_handler
, gnu_inner_block
);
2816 /* First make a block containing the handlers. */
2817 start_stmt_group ();
2818 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2819 Present (gnat_temp
);
2820 gnat_temp
= Next_Non_Pragma (gnat_temp
))
2821 add_stmt (gnat_to_gnu (gnat_temp
));
2822 gnu_handlers
= end_stmt_group ();
2824 /* Now make the TRY_CATCH_EXPR for the block. */
2825 gnu_result
= build2 (TRY_CATCH_EXPR
, void_type_node
,
2826 gnu_inner_block
, gnu_handlers
);
2829 gnu_result
= gnu_inner_block
;
2831 /* Now close our outer block, if we had to make one. */
2832 if (binding_for_block
)
2834 add_stmt (gnu_result
);
2836 gnu_result
= end_stmt_group ();
2842 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2843 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
2844 exception handling. */
2847 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node
)
2849 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
2850 an "if" statement to select the proper exceptions. For "Others", exclude
2851 exceptions where Handled_By_Others is nonzero unless the All_Others flag
2852 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
2853 tree gnu_choice
= integer_zero_node
;
2854 tree gnu_body
= build_stmt_group (Statements (gnat_node
), false);
2857 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2858 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2862 if (Nkind (gnat_temp
) == N_Others_Choice
)
2864 if (All_Others (gnat_temp
))
2865 this_choice
= integer_one_node
;
2869 (EQ_EXPR
, integer_type_node
,
2874 (INDIRECT_REF
, NULL_TREE
,
2875 TREE_VALUE (gnu_except_ptr_stack
)),
2876 get_identifier ("not_handled_by_others"), NULL_TREE
,
2881 else if (Nkind (gnat_temp
) == N_Identifier
2882 || Nkind (gnat_temp
) == N_Expanded_Name
)
2884 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
2887 /* Exception may be a renaming. Recover original exception which is
2888 the one elaborated and registered. */
2889 if (Present (Renamed_Object (gnat_ex_id
)))
2890 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
2892 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
2896 (EQ_EXPR
, integer_type_node
, TREE_VALUE (gnu_except_ptr_stack
),
2897 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack
)),
2898 build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
)));
2900 /* If this is the distinguished exception "Non_Ada_Error" (and we are
2901 in VMS mode), also allow a non-Ada exception (a VMS condition) t
2903 if (Is_Non_Ada_Error (Entity (gnat_temp
)))
2906 = build_component_ref
2907 (build_unary_op (INDIRECT_REF
, NULL_TREE
,
2908 TREE_VALUE (gnu_except_ptr_stack
)),
2909 get_identifier ("lang"), NULL_TREE
, false);
2913 (TRUTH_ORIF_EXPR
, integer_type_node
,
2914 build_binary_op (EQ_EXPR
, integer_type_node
, gnu_comp
,
2915 build_int_cst (TREE_TYPE (gnu_comp
), 'V')),
2922 gnu_choice
= build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
2923 gnu_choice
, this_choice
);
2926 return build3 (COND_EXPR
, void_type_node
, gnu_choice
, gnu_body
, NULL_TREE
);
2929 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2930 to a GCC tree, which is returned. This is the variant for ZCX. */
2933 Exception_Handler_to_gnu_zcx (Node_Id gnat_node
)
2935 tree gnu_etypes_list
= NULL_TREE
;
2938 tree gnu_current_exc_ptr
;
2939 tree gnu_incoming_exc_ptr
;
2942 /* We build a TREE_LIST of nodes representing what exception types this
2943 handler can catch, with special cases for others and all others cases.
2945 Each exception type is actually identified by a pointer to the exception
2946 id, or to a dummy object for "others" and "all others".
2948 Care should be taken to ensure that the control flow impact of "others"
2949 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
2951 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2952 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2954 if (Nkind (gnat_temp
) == N_Others_Choice
)
2957 = All_Others (gnat_temp
) ? all_others_decl
: others_decl
;
2960 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
2962 else if (Nkind (gnat_temp
) == N_Identifier
2963 || Nkind (gnat_temp
) == N_Expanded_Name
)
2965 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
2967 /* Exception may be a renaming. Recover original exception which is
2968 the one elaborated and registered. */
2969 if (Present (Renamed_Object (gnat_ex_id
)))
2970 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
2972 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
2973 gnu_etype
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
2975 /* The Non_Ada_Error case for VMS exceptions is handled
2976 by the personality routine. */
2981 /* The GCC interface expects NULL to be passed for catch all handlers, so
2982 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
2983 is integer_zero_node. It would not work, however, because GCC's
2984 notion of "catch all" is stronger than our notion of "others". Until
2985 we correctly use the cleanup interface as well, doing that would
2986 prevent the "all others" handlers from being seen, because nothing
2987 can be caught beyond a catch all from GCC's point of view. */
2988 gnu_etypes_list
= tree_cons (NULL_TREE
, gnu_etype
, gnu_etypes_list
);
2991 start_stmt_group ();
2994 /* Expand a call to the begin_handler hook at the beginning of the handler,
2995 and arrange for a call to the end_handler hook to occur on every possible
2998 The hooks expect a pointer to the low level occurrence. This is required
2999 for our stack management scheme because a raise inside the handler pushes
3000 a new occurrence on top of the stack, which means that this top does not
3001 necessarily match the occurrence this handler was dealing with.
3003 The EXC_PTR_EXPR object references the exception occurrence being
3004 propagated. Upon handler entry, this is the exception for which the
3005 handler is triggered. This might not be the case upon handler exit,
3006 however, as we might have a new occurrence propagated by the handler's
3007 body, and the end_handler hook called as a cleanup in this context.
3009 We use a local variable to retrieve the incoming value at handler entry
3010 time, and reuse it to feed the end_handler hook's argument at exit. */
3011 gnu_current_exc_ptr
= build0 (EXC_PTR_EXPR
, ptr_type_node
);
3012 gnu_incoming_exc_ptr
= create_var_decl (get_identifier ("EXPTR"), NULL_TREE
,
3013 ptr_type_node
, gnu_current_exc_ptr
,
3014 false, false, false, false, NULL
,
3017 add_stmt_with_node (build_call_1_expr (begin_handler_decl
,
3018 gnu_incoming_exc_ptr
),
3020 /* ??? We don't seem to have an End_Label at hand to set the location. */
3021 add_cleanup (build_call_1_expr (end_handler_decl
, gnu_incoming_exc_ptr
),
3023 add_stmt_list (Statements (gnat_node
));
3026 return build2 (CATCH_EXPR
, void_type_node
, gnu_etypes_list
,
3030 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3033 Compilation_Unit_to_gnu (Node_Id gnat_node
)
3035 /* Make the decl for the elaboration procedure. */
3036 bool body_p
= (Defining_Entity (Unit (gnat_node
)),
3037 Nkind (Unit (gnat_node
)) == N_Package_Body
3038 || Nkind (Unit (gnat_node
)) == N_Subprogram_Body
);
3039 Entity_Id gnat_unit_entity
= Defining_Entity (Unit (gnat_node
));
3040 tree gnu_elab_proc_decl
3041 = create_subprog_decl
3042 (create_concat_name (gnat_unit_entity
,
3043 body_p
? "elabb" : "elabs"),
3044 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, false, NULL
,
3046 struct elab_info
*info
;
3048 push_stack (&gnu_elab_proc_stack
, NULL_TREE
, gnu_elab_proc_decl
);
3050 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl
) = 1;
3051 allocate_struct_function (gnu_elab_proc_decl
, false);
3052 Sloc_to_locus (Sloc (gnat_unit_entity
), &cfun
->function_end_locus
);
3055 /* For a body, first process the spec if there is one. */
3056 if (Nkind (Unit (gnat_node
)) == N_Package_Body
3057 || (Nkind (Unit (gnat_node
)) == N_Subprogram_Body
3058 && !Acts_As_Spec (gnat_node
)))
3060 add_stmt (gnat_to_gnu (Library_Unit (gnat_node
)));
3061 finalize_from_with_types ();
3064 process_inlined_subprograms (gnat_node
);
3066 if (type_annotate_only
&& gnat_node
== Cunit (Main_Unit
))
3068 elaborate_all_entities (gnat_node
);
3070 if (Nkind (Unit (gnat_node
)) == N_Subprogram_Declaration
3071 || Nkind (Unit (gnat_node
)) == N_Generic_Package_Declaration
3072 || Nkind (Unit (gnat_node
)) == N_Generic_Subprogram_Declaration
)
3076 process_decls (Declarations (Aux_Decls_Node (gnat_node
)), Empty
, Empty
,
3078 add_stmt (gnat_to_gnu (Unit (gnat_node
)));
3080 /* Process any pragmas and actions following the unit. */
3081 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node
)));
3082 add_stmt_list (Actions (Aux_Decls_Node (gnat_node
)));
3083 finalize_from_with_types ();
3085 /* Save away what we've made so far and record this potential elaboration
3087 info
= (struct elab_info
*) ggc_alloc (sizeof (struct elab_info
));
3088 set_current_block_context (gnu_elab_proc_decl
);
3090 DECL_SAVED_TREE (gnu_elab_proc_decl
) = end_stmt_group ();
3091 info
->next
= elab_info_list
;
3092 info
->elab_proc
= gnu_elab_proc_decl
;
3093 info
->gnat_node
= gnat_node
;
3094 elab_info_list
= info
;
3096 /* Generate elaboration code for this unit, if necessary, and say whether
3098 pop_stack (&gnu_elab_proc_stack
);
3100 /* Invalidate the global renaming pointers. This is necessary because
3101 stabilization of the renamed entities may create SAVE_EXPRs which
3102 have been tied to a specific elaboration routine just above. */
3103 invalidate_global_renaming_pointers ();
3106 /* This function is the driver of the GNAT to GCC tree transformation
3107 process. It is the entry point of the tree transformer. GNAT_NODE is the
3108 root of some GNAT tree. Return the root of the corresponding GCC tree.
3109 If this is an expression, return the GCC equivalent of the expression. If
3110 it is a statement, return the statement. In the case when called for a
3111 statement, it may also add statements to the current statement group, in
3112 which case anything it returns is to be interpreted as occurring after
3113 anything `it already added. */
3116 gnat_to_gnu (Node_Id gnat_node
)
3118 bool went_into_elab_proc
= false;
3119 tree gnu_result
= error_mark_node
; /* Default to no value. */
3120 tree gnu_result_type
= void_type_node
;
3122 tree gnu_lhs
, gnu_rhs
;
3125 /* Save node number for error message and set location information. */
3126 error_gnat_node
= gnat_node
;
3127 Sloc_to_locus (Sloc (gnat_node
), &input_location
);
3129 if (type_annotate_only
3130 && IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
))
3131 return alloc_stmt_list ();
3133 /* If this node is a non-static subexpression and we are only
3134 annotating types, make this into a NULL_EXPR. */
3135 if (type_annotate_only
3136 && IN (Nkind (gnat_node
), N_Subexpr
)
3137 && Nkind (gnat_node
) != N_Identifier
3138 && !Compile_Time_Known_Value (gnat_node
))
3139 return build1 (NULL_EXPR
, get_unpadded_type (Etype (gnat_node
)),
3140 build_call_raise (CE_Range_Check_Failed
, gnat_node
,
3141 N_Raise_Constraint_Error
));
3143 /* If this is a Statement and we are at top level, it must be part of the
3144 elaboration procedure, so mark us as being in that procedure and push our
3147 If we are in the elaboration procedure, check if we are violating a
3148 No_Elaboration_Code restriction by having a statement there. */
3149 if ((IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
)
3150 && Nkind (gnat_node
) != N_Null_Statement
)
3151 || Nkind (gnat_node
) == N_Procedure_Call_Statement
3152 || Nkind (gnat_node
) == N_Label
3153 || Nkind (gnat_node
) == N_Implicit_Label_Declaration
3154 || Nkind (gnat_node
) == N_Handled_Sequence_Of_Statements
3155 || ((Nkind (gnat_node
) == N_Raise_Constraint_Error
3156 || Nkind (gnat_node
) == N_Raise_Storage_Error
3157 || Nkind (gnat_node
) == N_Raise_Program_Error
)
3158 && (Ekind (Etype (gnat_node
)) == E_Void
)))
3160 if (!current_function_decl
)
3162 current_function_decl
= TREE_VALUE (gnu_elab_proc_stack
);
3163 start_stmt_group ();
3165 went_into_elab_proc
= true;
3168 /* Don't check for a possible No_Elaboration_Code restriction violation
3169 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3170 every nested real statement instead. This also avoids triggering
3171 spurious errors on dummy (empty) sequences created by the front-end
3172 for package bodies in some cases. */
3174 if (current_function_decl
== TREE_VALUE (gnu_elab_proc_stack
)
3175 && Nkind (gnat_node
) != N_Handled_Sequence_Of_Statements
)
3176 Check_Elaboration_Code_Allowed (gnat_node
);
3179 switch (Nkind (gnat_node
))
3181 /********************************/
3182 /* Chapter 2: Lexical Elements: */
3183 /********************************/
3186 case N_Expanded_Name
:
3187 case N_Operator_Symbol
:
3188 case N_Defining_Identifier
:
3189 gnu_result
= Identifier_to_gnu (gnat_node
, &gnu_result_type
);
3192 case N_Integer_Literal
:
3196 /* Get the type of the result, looking inside any padding and
3197 justified modular types. Then get the value in that type. */
3198 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3200 if (TREE_CODE (gnu_type
) == RECORD_TYPE
3201 && TYPE_JUSTIFIED_MODULAR_P (gnu_type
))
3202 gnu_type
= TREE_TYPE (TYPE_FIELDS (gnu_type
));
3204 gnu_result
= UI_To_gnu (Intval (gnat_node
), gnu_type
);
3206 /* If the result overflows (meaning it doesn't fit in its base type),
3207 abort. We would like to check that the value is within the range
3208 of the subtype, but that causes problems with subtypes whose usage
3209 will raise Constraint_Error and with biased representation, so
3211 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3215 case N_Character_Literal
:
3216 /* If a Entity is present, it means that this was one of the
3217 literals in a user-defined character type. In that case,
3218 just return the value in the CONST_DECL. Otherwise, use the
3219 character code. In that case, the base type should be an
3220 INTEGER_TYPE, but we won't bother checking for that. */
3221 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3222 if (Present (Entity (gnat_node
)))
3223 gnu_result
= DECL_INITIAL (get_gnu_tree (Entity (gnat_node
)));
3226 = build_int_cst_type
3227 (gnu_result_type
, UI_To_CC (Char_Literal_Value (gnat_node
)));
3230 case N_Real_Literal
:
3231 /* If this is of a fixed-point type, the value we want is the
3232 value of the corresponding integer. */
3233 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))), Fixed_Point_Kind
))
3235 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3236 gnu_result
= UI_To_gnu (Corresponding_Integer_Value (gnat_node
),
3238 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3241 /* We should never see a Vax_Float type literal, since the front end
3242 is supposed to transform these using appropriate conversions */
3243 else if (Vax_Float (Underlying_Type (Etype (gnat_node
))))
3248 Ureal ur_realval
= Realval (gnat_node
);
3250 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3252 /* If the real value is zero, so is the result. Otherwise,
3253 convert it to a machine number if it isn't already. That
3254 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3255 if (UR_Is_Zero (ur_realval
))
3256 gnu_result
= convert (gnu_result_type
, integer_zero_node
);
3259 if (!Is_Machine_Number (gnat_node
))
3261 = Machine (Base_Type (Underlying_Type (Etype (gnat_node
))),
3262 ur_realval
, Round_Even
, gnat_node
);
3265 = UI_To_gnu (Numerator (ur_realval
), gnu_result_type
);
3267 /* If we have a base of zero, divide by the denominator.
3268 Otherwise, the base must be 2 and we scale the value, which
3269 we know can fit in the mantissa of the type (hence the use
3270 of that type above). */
3271 if (No (Rbase (ur_realval
)))
3273 = build_binary_op (RDIV_EXPR
,
3274 get_base_type (gnu_result_type
),
3276 UI_To_gnu (Denominator (ur_realval
),
3280 REAL_VALUE_TYPE tmp
;
3282 gcc_assert (Rbase (ur_realval
) == 2);
3283 real_ldexp (&tmp
, &TREE_REAL_CST (gnu_result
),
3284 - UI_To_Int (Denominator (ur_realval
)));
3285 gnu_result
= build_real (gnu_result_type
, tmp
);
3289 /* Now see if we need to negate the result. Do it this way to
3290 properly handle -0. */
3291 if (UR_Is_Negative (Realval (gnat_node
)))
3293 = build_unary_op (NEGATE_EXPR
, get_base_type (gnu_result_type
),
3299 case N_String_Literal
:
3300 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3301 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type
)) == HOST_BITS_PER_CHAR
)
3303 String_Id gnat_string
= Strval (gnat_node
);
3304 int length
= String_Length (gnat_string
);
3307 if (length
>= ALLOCA_THRESHOLD
)
3308 string
= XNEWVEC (char, length
+ 1); /* in case of large strings */
3310 string
= (char *) alloca (length
+ 1);
3312 /* Build the string with the characters in the literal. Note
3313 that Ada strings are 1-origin. */
3314 for (i
= 0; i
< length
; i
++)
3315 string
[i
] = Get_String_Char (gnat_string
, i
+ 1);
3317 /* Put a null at the end of the string in case it's in a context
3318 where GCC will want to treat it as a C string. */
3321 gnu_result
= build_string (length
, string
);
3323 /* Strings in GCC don't normally have types, but we want
3324 this to not be converted to the array type. */
3325 TREE_TYPE (gnu_result
) = gnu_result_type
;
3327 if (length
>= ALLOCA_THRESHOLD
) /* free if heap-allocated */
3332 /* Build a list consisting of each character, then make
3334 String_Id gnat_string
= Strval (gnat_node
);
3335 int length
= String_Length (gnat_string
);
3337 tree gnu_list
= NULL_TREE
;
3338 tree gnu_idx
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3340 for (i
= 0; i
< length
; i
++)
3343 = tree_cons (gnu_idx
,
3344 build_int_cst (TREE_TYPE (gnu_result_type
),
3345 Get_String_Char (gnat_string
,
3349 gnu_idx
= int_const_binop (PLUS_EXPR
, gnu_idx
, integer_one_node
,
3354 = gnat_build_constructor (gnu_result_type
, nreverse (gnu_list
));
3359 gnu_result
= Pragma_to_gnu (gnat_node
);
3362 /**************************************/
3363 /* Chapter 3: Declarations and Types: */
3364 /**************************************/
3366 case N_Subtype_Declaration
:
3367 case N_Full_Type_Declaration
:
3368 case N_Incomplete_Type_Declaration
:
3369 case N_Private_Type_Declaration
:
3370 case N_Private_Extension_Declaration
:
3371 case N_Task_Type_Declaration
:
3372 process_type (Defining_Entity (gnat_node
));
3373 gnu_result
= alloc_stmt_list ();
3376 case N_Object_Declaration
:
3377 case N_Exception_Declaration
:
3378 gnat_temp
= Defining_Entity (gnat_node
);
3379 gnu_result
= alloc_stmt_list ();
3381 /* If we are just annotating types and this object has an unconstrained
3382 or task type, don't elaborate it. */
3383 if (type_annotate_only
3384 && (((Is_Array_Type (Etype (gnat_temp
))
3385 || Is_Record_Type (Etype (gnat_temp
)))
3386 && !Is_Constrained (Etype (gnat_temp
)))
3387 || Is_Concurrent_Type (Etype (gnat_temp
))))
3390 if (Present (Expression (gnat_node
))
3391 && !(Nkind (gnat_node
) == N_Object_Declaration
3392 && No_Initialization (gnat_node
))
3393 && (!type_annotate_only
3394 || Compile_Time_Known_Value (Expression (gnat_node
))))
3396 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
3397 if (Do_Range_Check (Expression (gnat_node
)))
3398 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_temp
));
3400 /* If this object has its elaboration delayed, we must force
3401 evaluation of GNU_EXPR right now and save it for when the object
3403 if (Present (Freeze_Node (gnat_temp
)))
3405 if ((Is_Public (gnat_temp
) || global_bindings_p ())
3406 && !TREE_CONSTANT (gnu_expr
))
3408 = create_var_decl (create_concat_name (gnat_temp
, "init"),
3409 NULL_TREE
, TREE_TYPE (gnu_expr
),
3410 gnu_expr
, false, Is_Public (gnat_temp
),
3411 false, false, NULL
, gnat_temp
);
3413 gnu_expr
= maybe_variable (gnu_expr
);
3415 save_gnu_tree (gnat_node
, gnu_expr
, true);
3419 gnu_expr
= NULL_TREE
;
3421 if (type_annotate_only
&& gnu_expr
&& TREE_CODE (gnu_expr
) == ERROR_MARK
)
3422 gnu_expr
= NULL_TREE
;
3424 /* If this is a deferred constant with an address clause, we ignore the
3425 full view since the clause is on the partial view and we cannot have
3426 2 different GCC trees for the object. The only bits of the full view
3427 we will use is the initializer, but it will be directly fetched. */
3428 if (Ekind(gnat_temp
) == E_Constant
3429 && Present (Address_Clause (gnat_temp
))
3430 && Present (Full_View (gnat_temp
)))
3431 save_gnu_tree (Full_View (gnat_temp
), error_mark_node
, true);
3433 if (No (Freeze_Node (gnat_temp
)))
3434 gnat_to_gnu_entity (gnat_temp
, gnu_expr
, 1);
3437 case N_Object_Renaming_Declaration
:
3438 gnat_temp
= Defining_Entity (gnat_node
);
3440 /* Don't do anything if this renaming is handled by the front end or if
3441 we are just annotating types and this object has a composite or task
3442 type, don't elaborate it. We return the result in case it has any
3443 SAVE_EXPRs in it that need to be evaluated here. */
3444 if (!Is_Renaming_Of_Object (gnat_temp
)
3445 && ! (type_annotate_only
3446 && (Is_Array_Type (Etype (gnat_temp
))
3447 || Is_Record_Type (Etype (gnat_temp
))
3448 || Is_Concurrent_Type (Etype (gnat_temp
)))))
3450 = gnat_to_gnu_entity (gnat_temp
,
3451 gnat_to_gnu (Renamed_Object (gnat_temp
)), 1);
3453 gnu_result
= alloc_stmt_list ();
3456 case N_Implicit_Label_Declaration
:
3457 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
3458 gnu_result
= alloc_stmt_list ();
3461 case N_Exception_Renaming_Declaration
:
3462 case N_Number_Declaration
:
3463 case N_Package_Renaming_Declaration
:
3464 case N_Subprogram_Renaming_Declaration
:
3465 /* These are fully handled in the front end. */
3466 gnu_result
= alloc_stmt_list ();
3469 /*************************************/
3470 /* Chapter 4: Names and Expressions: */
3471 /*************************************/
3473 case N_Explicit_Dereference
:
3474 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3475 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3476 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
3479 case N_Indexed_Component
:
3481 tree gnu_array_object
= gnat_to_gnu (Prefix (gnat_node
));
3485 Node_Id
*gnat_expr_array
;
3487 gnu_array_object
= maybe_implicit_deref (gnu_array_object
);
3488 gnu_array_object
= maybe_unconstrained_array (gnu_array_object
);
3490 /* If we got a padded type, remove it too. */
3491 if (TREE_CODE (TREE_TYPE (gnu_array_object
)) == RECORD_TYPE
3492 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object
)))
3494 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object
))),
3497 gnu_result
= gnu_array_object
;
3499 /* First compute the number of dimensions of the array, then
3500 fill the expression array, the order depending on whether
3501 this is a Convention_Fortran array or not. */
3502 for (ndim
= 1, gnu_type
= TREE_TYPE (gnu_array_object
);
3503 TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
3504 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
));
3505 ndim
++, gnu_type
= TREE_TYPE (gnu_type
))
3508 gnat_expr_array
= (Node_Id
*) alloca (ndim
* sizeof (Node_Id
));
3510 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object
)))
3511 for (i
= ndim
- 1, gnat_temp
= First (Expressions (gnat_node
));
3513 i
--, gnat_temp
= Next (gnat_temp
))
3514 gnat_expr_array
[i
] = gnat_temp
;
3516 for (i
= 0, gnat_temp
= First (Expressions (gnat_node
));
3518 i
++, gnat_temp
= Next (gnat_temp
))
3519 gnat_expr_array
[i
] = gnat_temp
;
3521 for (i
= 0, gnu_type
= TREE_TYPE (gnu_array_object
);
3522 i
< ndim
; i
++, gnu_type
= TREE_TYPE (gnu_type
))
3524 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
3525 gnat_temp
= gnat_expr_array
[i
];
3526 gnu_expr
= gnat_to_gnu (gnat_temp
);
3528 if (Do_Range_Check (gnat_temp
))
3531 (gnu_array_object
, gnu_expr
,
3532 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))),
3533 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))));
3535 gnu_result
= build_binary_op (ARRAY_REF
, NULL_TREE
,
3536 gnu_result
, gnu_expr
);
3540 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3546 Node_Id gnat_range_node
= Discrete_Range (gnat_node
);
3548 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3549 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3551 /* Do any implicit dereferences of the prefix and do any needed
3553 gnu_result
= maybe_implicit_deref (gnu_result
);
3554 gnu_result
= maybe_unconstrained_array (gnu_result
);
3555 gnu_type
= TREE_TYPE (gnu_result
);
3556 if (Do_Range_Check (gnat_range_node
))
3558 /* Get the bounds of the slice. */
3560 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type
));
3561 tree gnu_min_expr
= TYPE_MIN_VALUE (gnu_index_type
);
3562 tree gnu_max_expr
= TYPE_MAX_VALUE (gnu_index_type
);
3563 /* Get the permitted bounds. */
3564 tree gnu_base_index_type
3565 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
3566 tree gnu_base_min_expr
= TYPE_MIN_VALUE (gnu_base_index_type
);
3567 tree gnu_base_max_expr
= TYPE_MAX_VALUE (gnu_base_index_type
);
3568 tree gnu_expr_l
, gnu_expr_h
, gnu_expr_type
;
3570 /* Check to see that the minimum slice value is in range. */
3571 gnu_expr_l
= emit_index_check (gnu_result
,
3576 /* Check to see that the maximum slice value is in range. */
3577 gnu_expr_h
= emit_index_check (gnu_result
,
3582 /* Derive a good type to convert everything to. */
3583 gnu_expr_type
= get_base_type (TREE_TYPE (gnu_expr_l
));
3585 /* Build a compound expression that does the range checks and
3586 returns the low bound. */
3587 gnu_expr
= build_binary_op (COMPOUND_EXPR
, gnu_expr_type
,
3588 convert (gnu_expr_type
, gnu_expr_h
),
3589 convert (gnu_expr_type
, gnu_expr_l
));
3591 /* Build a conditional expression that does the range check and
3592 returns the low bound if the slice is not empty (max >= min),
3593 and returns the naked low bound otherwise (max < min), unless
3594 it is non-constant and the high bound is; this prevents VRP
3595 from inferring bogus ranges on the unlikely path. */
3596 gnu_expr
= fold_build3 (COND_EXPR
, gnu_expr_type
,
3597 build_binary_op (GE_EXPR
, gnu_expr_type
,
3598 convert (gnu_expr_type
,
3600 convert (gnu_expr_type
,
3603 TREE_CODE (gnu_min_expr
) != INTEGER_CST
3604 && TREE_CODE (gnu_max_expr
) == INTEGER_CST
3605 ? gnu_max_expr
: gnu_min_expr
);
3608 /* Simply return the naked low bound. */
3609 gnu_expr
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3611 gnu_result
= build_binary_op (ARRAY_RANGE_REF
, gnu_result_type
,
3612 gnu_result
, gnu_expr
);
3616 case N_Selected_Component
:
3618 tree gnu_prefix
= gnat_to_gnu (Prefix (gnat_node
));
3619 Entity_Id gnat_field
= Entity (Selector_Name (gnat_node
));
3620 Entity_Id gnat_pref_type
= Etype (Prefix (gnat_node
));
3623 while (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
)
3624 || IN (Ekind (gnat_pref_type
), Access_Kind
))
3626 if (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
))
3627 gnat_pref_type
= Underlying_Type (gnat_pref_type
);
3628 else if (IN (Ekind (gnat_pref_type
), Access_Kind
))
3629 gnat_pref_type
= Designated_Type (gnat_pref_type
);
3632 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
3634 /* For discriminant references in tagged types always substitute the
3635 corresponding discriminant as the actual selected component. */
3637 if (Is_Tagged_Type (gnat_pref_type
))
3638 while (Present (Corresponding_Discriminant (gnat_field
)))
3639 gnat_field
= Corresponding_Discriminant (gnat_field
);
3641 /* For discriminant references of untagged types always substitute the
3642 corresponding stored discriminant. */
3644 else if (Present (Corresponding_Discriminant (gnat_field
)))
3645 gnat_field
= Original_Record_Component (gnat_field
);
3647 /* Handle extracting the real or imaginary part of a complex.
3648 The real part is the first field and the imaginary the last. */
3650 if (TREE_CODE (TREE_TYPE (gnu_prefix
)) == COMPLEX_TYPE
)
3651 gnu_result
= build_unary_op (Present (Next_Entity (gnat_field
))
3652 ? REALPART_EXPR
: IMAGPART_EXPR
,
3653 NULL_TREE
, gnu_prefix
);
3656 gnu_field
= gnat_to_gnu_field_decl (gnat_field
);
3658 /* If there are discriminants, the prefix might be
3659 evaluated more than once, which is a problem if it has
3661 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node
)))
3662 ? Designated_Type (Etype
3663 (Prefix (gnat_node
)))
3664 : Etype (Prefix (gnat_node
))))
3665 gnu_prefix
= gnat_stabilize_reference (gnu_prefix
, false);
3668 = build_component_ref (gnu_prefix
, NULL_TREE
, gnu_field
,
3669 (Nkind (Parent (gnat_node
))
3670 == N_Attribute_Reference
));
3673 gcc_assert (gnu_result
);
3674 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3678 case N_Attribute_Reference
:
3680 /* The attribute designator (like an enumeration value). */
3681 int attribute
= Get_Attribute_Id (Attribute_Name (gnat_node
));
3683 /* The Elab_Spec and Elab_Body attributes are special in that
3684 Prefix is a unit, not an object with a GCC equivalent. Similarly
3685 for Elaborated, since that variable isn't otherwise known. */
3686 if (attribute
== Attr_Elab_Body
|| attribute
== Attr_Elab_Spec
)
3687 return (create_subprog_decl
3688 (create_concat_name (Entity (Prefix (gnat_node
)),
3689 attribute
== Attr_Elab_Body
3690 ? "elabb" : "elabs"),
3691 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, true, NULL
,
3694 gnu_result
= Attribute_to_gnu (gnat_node
, &gnu_result_type
, attribute
);
3699 /* Like 'Access as far as we are concerned. */
3700 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3701 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3702 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3706 case N_Extension_Aggregate
:
3710 /* ??? It is wrong to evaluate the type now, but there doesn't
3711 seem to be any other practical way of doing it. */
3713 gcc_assert (!Expansion_Delayed (gnat_node
));
3715 gnu_aggr_type
= gnu_result_type
3716 = get_unpadded_type (Etype (gnat_node
));
3718 if (TREE_CODE (gnu_result_type
) == RECORD_TYPE
3719 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type
))
3721 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type
)));
3723 if (Null_Record_Present (gnat_node
))
3724 gnu_result
= gnat_build_constructor (gnu_aggr_type
, NULL_TREE
);
3726 else if (TREE_CODE (gnu_aggr_type
) == RECORD_TYPE
3727 || TREE_CODE (gnu_aggr_type
) == UNION_TYPE
)
3729 = assoc_to_constructor (Etype (gnat_node
),
3730 First (Component_Associations (gnat_node
)),
3732 else if (TREE_CODE (gnu_aggr_type
) == ARRAY_TYPE
)
3733 gnu_result
= pos_to_constructor (First (Expressions (gnat_node
)),
3735 Component_Type (Etype (gnat_node
)));
3736 else if (TREE_CODE (gnu_aggr_type
) == COMPLEX_TYPE
)
3739 (COMPLEX_EXPR
, gnu_aggr_type
,
3740 gnat_to_gnu (Expression (First
3741 (Component_Associations (gnat_node
)))),
3742 gnat_to_gnu (Expression
3744 (First (Component_Associations (gnat_node
))))));
3748 gnu_result
= convert (gnu_result_type
, gnu_result
);
3753 if (TARGET_VTABLE_USES_DESCRIPTORS
3754 && Ekind (Etype (gnat_node
)) == E_Access_Subprogram_Type
3755 && Is_Dispatch_Table_Entity (Etype (gnat_node
)))
3756 gnu_result
= null_fdesc_node
;
3758 gnu_result
= null_pointer_node
;
3759 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3762 case N_Type_Conversion
:
3763 case N_Qualified_Expression
:
3764 /* Get the operand expression. */
3765 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3766 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3769 = convert_with_check (Etype (gnat_node
), gnu_result
,
3770 Do_Overflow_Check (gnat_node
),
3771 Do_Range_Check (Expression (gnat_node
)),
3772 Nkind (gnat_node
) == N_Type_Conversion
3773 && Float_Truncate (gnat_node
));
3776 case N_Unchecked_Type_Conversion
:
3777 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3778 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3780 /* If the result is a pointer type, see if we are improperly
3781 converting to a stricter alignment. */
3782 if (STRICT_ALIGNMENT
&& POINTER_TYPE_P (gnu_result_type
)
3783 && IN (Ekind (Etype (gnat_node
)), Access_Kind
))
3785 unsigned int align
= known_alignment (gnu_result
);
3786 tree gnu_obj_type
= TREE_TYPE (gnu_result_type
);
3787 unsigned int oalign
= TYPE_ALIGN (gnu_obj_type
);
3789 if (align
!= 0 && align
< oalign
&& !TYPE_ALIGN_OK (gnu_obj_type
))
3790 post_error_ne_tree_2
3791 ("?source alignment (^) '< alignment of & (^)",
3792 gnat_node
, Designated_Type (Etype (gnat_node
)),
3793 size_int (align
/ BITS_PER_UNIT
), oalign
/ BITS_PER_UNIT
);
3796 /* If we are converting a descriptor to a function pointer, first
3797 build the pointer. */
3798 if (TARGET_VTABLE_USES_DESCRIPTORS
3799 && TREE_TYPE (gnu_result
) == fdesc_type_node
3800 && POINTER_TYPE_P (gnu_result_type
))
3801 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3803 gnu_result
= unchecked_convert (gnu_result_type
, gnu_result
,
3804 No_Truncation (gnat_node
));
3810 tree gnu_object
= gnat_to_gnu (Left_Opnd (gnat_node
));
3811 Node_Id gnat_range
= Right_Opnd (gnat_node
);
3815 /* GNAT_RANGE is either an N_Range node or an identifier
3816 denoting a subtype. */
3817 if (Nkind (gnat_range
) == N_Range
)
3819 gnu_low
= gnat_to_gnu (Low_Bound (gnat_range
));
3820 gnu_high
= gnat_to_gnu (High_Bound (gnat_range
));
3822 else if (Nkind (gnat_range
) == N_Identifier
3823 || Nkind (gnat_range
) == N_Expanded_Name
)
3825 tree gnu_range_type
= get_unpadded_type (Entity (gnat_range
));
3827 gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
3828 gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
3833 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3835 /* If LOW and HIGH are identical, perform an equality test.
3836 Otherwise, ensure that GNU_OBJECT is only evaluated once
3837 and perform a full range test. */
3838 if (operand_equal_p (gnu_low
, gnu_high
, 0))
3839 gnu_result
= build_binary_op (EQ_EXPR
, gnu_result_type
,
3840 gnu_object
, gnu_low
);
3843 gnu_object
= protect_multiple_eval (gnu_object
);
3845 = build_binary_op (TRUTH_ANDIF_EXPR
, gnu_result_type
,
3846 build_binary_op (GE_EXPR
, gnu_result_type
,
3847 gnu_object
, gnu_low
),
3848 build_binary_op (LE_EXPR
, gnu_result_type
,
3849 gnu_object
, gnu_high
));
3852 if (Nkind (gnat_node
) == N_Not_In
)
3853 gnu_result
= invert_truthvalue (gnu_result
);
3858 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3859 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3860 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3861 gnu_result
= build_binary_op (FLOAT_TYPE_P (gnu_result_type
)
3863 : (Rounded_Result (gnat_node
)
3864 ? ROUND_DIV_EXPR
: TRUNC_DIV_EXPR
),
3865 gnu_result_type
, gnu_lhs
, gnu_rhs
);
3868 case N_Op_Or
: case N_Op_And
: case N_Op_Xor
:
3869 /* These can either be operations on booleans or on modular types.
3870 Fall through for boolean types since that's the way GNU_CODES is
3872 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))),
3873 Modular_Integer_Kind
))
3876 = (Nkind (gnat_node
) == N_Op_Or
? BIT_IOR_EXPR
3877 : Nkind (gnat_node
) == N_Op_And
? BIT_AND_EXPR
3880 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3881 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3882 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3883 gnu_result
= build_binary_op (code
, gnu_result_type
,
3888 /* ... fall through ... */
3890 case N_Op_Eq
: case N_Op_Ne
: case N_Op_Lt
:
3891 case N_Op_Le
: case N_Op_Gt
: case N_Op_Ge
:
3892 case N_Op_Add
: case N_Op_Subtract
: case N_Op_Multiply
:
3893 case N_Op_Mod
: case N_Op_Rem
:
3894 case N_Op_Rotate_Left
:
3895 case N_Op_Rotate_Right
:
3896 case N_Op_Shift_Left
:
3897 case N_Op_Shift_Right
:
3898 case N_Op_Shift_Right_Arithmetic
:
3899 case N_And_Then
: case N_Or_Else
:
3901 enum tree_code code
= gnu_codes
[Nkind (gnat_node
)];
3902 bool ignore_lhs_overflow
= false;
3905 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3906 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3907 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3909 /* If this is a comparison operator, convert any references to
3910 an unconstrained array value into a reference to the
3912 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3914 gnu_lhs
= maybe_unconstrained_array (gnu_lhs
);
3915 gnu_rhs
= maybe_unconstrained_array (gnu_rhs
);
3918 /* If the result type is a private type, its full view may be a
3919 numeric subtype. The representation we need is that of its base
3920 type, given that it is the result of an arithmetic operation. */
3921 else if (Is_Private_Type (Etype (gnat_node
)))
3922 gnu_type
= gnu_result_type
3923 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node
))));
3925 /* If this is a shift whose count is not guaranteed to be correct,
3926 we need to adjust the shift count. */
3927 if (IN (Nkind (gnat_node
), N_Op_Shift
)
3928 && !Shift_Count_OK (gnat_node
))
3930 tree gnu_count_type
= get_base_type (TREE_TYPE (gnu_rhs
));
3932 = convert (gnu_count_type
, TYPE_SIZE (gnu_type
));
3934 if (Nkind (gnat_node
) == N_Op_Rotate_Left
3935 || Nkind (gnat_node
) == N_Op_Rotate_Right
)
3936 gnu_rhs
= build_binary_op (TRUNC_MOD_EXPR
, gnu_count_type
,
3937 gnu_rhs
, gnu_max_shift
);
3938 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
)
3941 (MIN_EXPR
, gnu_count_type
,
3942 build_binary_op (MINUS_EXPR
,
3945 convert (gnu_count_type
,
3950 /* For right shifts, the type says what kind of shift to do,
3951 so we may need to choose a different type. In this case,
3952 we have to ignore integer overflow lest it propagates all
3953 the way down and causes a CE to be explicitly raised. */
3954 if (Nkind (gnat_node
) == N_Op_Shift_Right
3955 && !TYPE_UNSIGNED (gnu_type
))
3957 gnu_type
= gnat_unsigned_type (gnu_type
);
3958 ignore_lhs_overflow
= true;
3960 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
3961 && TYPE_UNSIGNED (gnu_type
))
3963 gnu_type
= gnat_signed_type (gnu_type
);
3964 ignore_lhs_overflow
= true;
3967 if (gnu_type
!= gnu_result_type
)
3969 tree gnu_old_lhs
= gnu_lhs
;
3970 gnu_lhs
= convert (gnu_type
, gnu_lhs
);
3971 if (TREE_CODE (gnu_lhs
) == INTEGER_CST
&& ignore_lhs_overflow
)
3972 TREE_OVERFLOW (gnu_lhs
) = TREE_OVERFLOW (gnu_old_lhs
);
3973 gnu_rhs
= convert (gnu_type
, gnu_rhs
);
3976 /* Instead of expanding overflow checks for addition, subtraction
3977 and multiplication itself, the front end will leave this to
3978 the back end when Backend_Overflow_Checks_On_Target is set.
3979 As the GCC back end itself does not know yet how to properly
3980 do overflow checking, do it here. The goal is to push
3981 the expansions further into the back end over time. */
3982 if (Do_Overflow_Check (gnat_node
) && Backend_Overflow_Checks_On_Target
3983 && (Nkind (gnat_node
) == N_Op_Add
3984 || Nkind (gnat_node
) == N_Op_Subtract
3985 || Nkind (gnat_node
) == N_Op_Multiply
)
3986 && !TYPE_UNSIGNED (gnu_type
)
3987 && !FLOAT_TYPE_P (gnu_type
))
3989 = build_binary_op_trapv (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
3991 gnu_result
= build_binary_op (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
3993 /* If this is a logical shift with the shift count not verified,
3994 we must return zero if it is too large. We cannot compensate
3995 above in this case. */
3996 if ((Nkind (gnat_node
) == N_Op_Shift_Left
3997 || Nkind (gnat_node
) == N_Op_Shift_Right
)
3998 && !Shift_Count_OK (gnat_node
))
4002 build_binary_op (GE_EXPR
, integer_type_node
,
4004 convert (TREE_TYPE (gnu_rhs
),
4005 TYPE_SIZE (gnu_type
))),
4006 convert (gnu_type
, integer_zero_node
),
4011 case N_Conditional_Expression
:
4013 tree gnu_cond
= gnat_to_gnu (First (Expressions (gnat_node
)));
4014 tree gnu_true
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
4016 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node
)))));
4018 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4019 gnu_result
= build_cond_expr (gnu_result_type
,
4020 gnat_truthvalue_conversion (gnu_cond
),
4021 gnu_true
, gnu_false
);
4026 gnu_result
= gnat_to_gnu (Right_Opnd (gnat_node
));
4027 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4031 /* This case can apply to a boolean or a modular type.
4032 Fall through for a boolean operand since GNU_CODES is set
4033 up to handle this. */
4034 if (Is_Modular_Integer_Type (Etype (gnat_node
))
4035 || (Ekind (Etype (gnat_node
)) == E_Private_Type
4036 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node
)))))
4038 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4039 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4040 gnu_result
= build_unary_op (BIT_NOT_EXPR
, gnu_result_type
,
4045 /* ... fall through ... */
4047 case N_Op_Minus
: case N_Op_Abs
:
4048 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4050 if (Ekind (Etype (gnat_node
)) != E_Private_Type
)
4051 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4053 gnu_result_type
= get_unpadded_type (Base_Type
4054 (Full_View (Etype (gnat_node
))));
4056 if (Do_Overflow_Check (gnat_node
)
4057 && !TYPE_UNSIGNED (gnu_result_type
)
4058 && !FLOAT_TYPE_P (gnu_result_type
))
4059 gnu_result
= build_unary_op_trapv (gnu_codes
[Nkind (gnat_node
)],
4060 gnu_result_type
, gnu_expr
);
4062 gnu_result
= build_unary_op (gnu_codes
[Nkind (gnat_node
)],
4063 gnu_result_type
, gnu_expr
);
4070 bool ignore_init_type
= false;
4072 gnat_temp
= Expression (gnat_node
);
4074 /* The Expression operand can either be an N_Identifier or
4075 Expanded_Name, which must represent a type, or a
4076 N_Qualified_Expression, which contains both the object type and an
4077 initial value for the object. */
4078 if (Nkind (gnat_temp
) == N_Identifier
4079 || Nkind (gnat_temp
) == N_Expanded_Name
)
4080 gnu_type
= gnat_to_gnu_type (Entity (gnat_temp
));
4081 else if (Nkind (gnat_temp
) == N_Qualified_Expression
)
4083 Entity_Id gnat_desig_type
4084 = Designated_Type (Underlying_Type (Etype (gnat_node
)));
4086 ignore_init_type
= Has_Constrained_Partial_View (gnat_desig_type
);
4087 gnu_init
= gnat_to_gnu (Expression (gnat_temp
));
4089 gnu_init
= maybe_unconstrained_array (gnu_init
);
4090 if (Do_Range_Check (Expression (gnat_temp
)))
4091 gnu_init
= emit_range_check (gnu_init
, gnat_desig_type
);
4093 if (Is_Elementary_Type (gnat_desig_type
)
4094 || Is_Constrained (gnat_desig_type
))
4096 gnu_type
= gnat_to_gnu_type (gnat_desig_type
);
4097 gnu_init
= convert (gnu_type
, gnu_init
);
4101 gnu_type
= gnat_to_gnu_type (Etype (Expression (gnat_temp
)));
4102 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
4103 gnu_type
= TREE_TYPE (gnu_init
);
4105 gnu_init
= convert (gnu_type
, gnu_init
);
4111 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4112 return build_allocator (gnu_type
, gnu_init
, gnu_result_type
,
4113 Procedure_To_Call (gnat_node
),
4114 Storage_Pool (gnat_node
), gnat_node
,
4119 /***************************/
4120 /* Chapter 5: Statements: */
4121 /***************************/
4124 gnu_result
= build1 (LABEL_EXPR
, void_type_node
,
4125 gnat_to_gnu (Identifier (gnat_node
)));
4128 case N_Null_Statement
:
4129 gnu_result
= alloc_stmt_list ();
4132 case N_Assignment_Statement
:
4133 /* Get the LHS and RHS of the statement and convert any reference to an
4134 unconstrained array into a reference to the underlying array.
4135 If we are not to do range checking and the RHS is an N_Function_Call,
4136 pass the LHS to the call function. */
4137 gnu_lhs
= maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node
)));
4139 /* If the type has a size that overflows, convert this into raise of
4140 Storage_Error: execution shouldn't have gotten here anyway. */
4141 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))) == INTEGER_CST
4142 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))))
4143 gnu_result
= build_call_raise (SE_Object_Too_Large
, gnat_node
,
4144 N_Raise_Storage_Error
);
4145 else if (Nkind (Expression (gnat_node
)) == N_Function_Call
4146 && !Do_Range_Check (Expression (gnat_node
)))
4147 gnu_result
= call_to_gnu (Expression (gnat_node
),
4148 &gnu_result_type
, gnu_lhs
);
4152 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node
)));
4154 /* If range check is needed, emit code to generate it */
4155 if (Do_Range_Check (Expression (gnat_node
)))
4156 gnu_rhs
= emit_range_check (gnu_rhs
, Etype (Name (gnat_node
)));
4159 = build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_lhs
, gnu_rhs
);
4163 case N_If_Statement
:
4165 tree
*gnu_else_ptr
; /* Point to put next "else if" or "else". */
4167 /* Make the outer COND_EXPR. Avoid non-determinism. */
4168 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4169 gnat_to_gnu (Condition (gnat_node
)),
4170 NULL_TREE
, NULL_TREE
);
4171 COND_EXPR_THEN (gnu_result
)
4172 = build_stmt_group (Then_Statements (gnat_node
), false);
4173 TREE_SIDE_EFFECTS (gnu_result
) = 1;
4174 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_result
);
4176 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4177 into the previous "else" part and point to where to put any
4178 outer "else". Also avoid non-determinism. */
4179 if (Present (Elsif_Parts (gnat_node
)))
4180 for (gnat_temp
= First (Elsif_Parts (gnat_node
));
4181 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
4183 gnu_expr
= build3 (COND_EXPR
, void_type_node
,
4184 gnat_to_gnu (Condition (gnat_temp
)),
4185 NULL_TREE
, NULL_TREE
);
4186 COND_EXPR_THEN (gnu_expr
)
4187 = build_stmt_group (Then_Statements (gnat_temp
), false);
4188 TREE_SIDE_EFFECTS (gnu_expr
) = 1;
4189 set_expr_location_from_node (gnu_expr
, gnat_temp
);
4190 *gnu_else_ptr
= gnu_expr
;
4191 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
4194 *gnu_else_ptr
= build_stmt_group (Else_Statements (gnat_node
), false);
4198 case N_Case_Statement
:
4199 gnu_result
= Case_Statement_to_gnu (gnat_node
);
4202 case N_Loop_Statement
:
4203 gnu_result
= Loop_Statement_to_gnu (gnat_node
);
4206 case N_Block_Statement
:
4207 start_stmt_group ();
4209 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4210 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4212 gnu_result
= end_stmt_group ();
4214 if (Present (Identifier (gnat_node
)))
4215 mark_out_of_scope (Entity (Identifier (gnat_node
)));
4218 case N_Exit_Statement
:
4220 = build2 (EXIT_STMT
, void_type_node
,
4221 (Present (Condition (gnat_node
))
4222 ? gnat_to_gnu (Condition (gnat_node
)) : NULL_TREE
),
4223 (Present (Name (gnat_node
))
4224 ? get_gnu_tree (Entity (Name (gnat_node
)))
4225 : TREE_VALUE (gnu_loop_label_stack
)));
4228 case N_Return_Statement
:
4230 /* The gnu function type of the subprogram currently processed. */
4231 tree gnu_subprog_type
= TREE_TYPE (current_function_decl
);
4232 /* The return value from the subprogram. */
4233 tree gnu_ret_val
= NULL_TREE
;
4234 /* The place to put the return value. */
4237 /* If we are dealing with a "return;" from an Ada procedure with
4238 parameters passed by copy in copy out, we need to return a record
4239 containing the final values of these parameters. If the list
4240 contains only one entry, return just that entry.
4242 For a full description of the copy in copy out parameter mechanism,
4243 see the part of the gnat_to_gnu_entity routine dealing with the
4244 translation of subprograms.
4246 But if we have a return label defined, convert this into
4247 a branch to that label. */
4249 if (TREE_VALUE (gnu_return_label_stack
))
4251 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4252 TREE_VALUE (gnu_return_label_stack
));
4256 else if (TYPE_CI_CO_LIST (gnu_subprog_type
))
4258 gnu_lhs
= DECL_RESULT (current_function_decl
);
4259 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type
)) == 1)
4260 gnu_ret_val
= TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type
));
4263 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
4264 TYPE_CI_CO_LIST (gnu_subprog_type
));
4267 /* If the Ada subprogram is a function, we just need to return the
4268 expression. If the subprogram returns an unconstrained
4269 array, we have to allocate a new version of the result and
4270 return it. If we return by reference, return a pointer. */
4272 else if (Present (Expression (gnat_node
)))
4274 /* If the current function returns by target pointer and we
4275 are doing a call, pass that target to the call. */
4276 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
)
4277 && Nkind (Expression (gnat_node
)) == N_Function_Call
)
4280 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
4281 DECL_ARGUMENTS (current_function_decl
));
4282 gnu_result
= call_to_gnu (Expression (gnat_node
),
4283 &gnu_result_type
, gnu_lhs
);
4287 gnu_ret_val
= gnat_to_gnu (Expression (gnat_node
));
4289 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4290 /* The original return type was unconstrained so dereference
4291 the TARGET pointer in the actual return value's type. */
4293 = build_unary_op (INDIRECT_REF
, TREE_TYPE (gnu_ret_val
),
4294 DECL_ARGUMENTS (current_function_decl
));
4296 gnu_lhs
= DECL_RESULT (current_function_decl
);
4298 /* Do not remove the padding from GNU_RET_VAL if the inner
4299 type is self-referential since we want to allocate the fixed
4300 size in that case. */
4301 if (TREE_CODE (gnu_ret_val
) == COMPONENT_REF
4302 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0)))
4304 && (TYPE_IS_PADDING_P
4305 (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0))))
4306 && (CONTAINS_PLACEHOLDER_P
4307 (TYPE_SIZE (TREE_TYPE (gnu_ret_val
)))))
4308 gnu_ret_val
= TREE_OPERAND (gnu_ret_val
, 0);
4310 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type
)
4311 || By_Ref (gnat_node
))
4313 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_ret_val
);
4315 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
))
4317 gnu_ret_val
= maybe_unconstrained_array (gnu_ret_val
);
4319 = build_allocator (TREE_TYPE (gnu_ret_val
),
4321 TREE_TYPE (gnu_subprog_type
),
4322 Procedure_To_Call (gnat_node
),
4323 Storage_Pool (gnat_node
),
4329 /* If the Ada subprogram is a regular procedure, just return. */
4330 gnu_lhs
= NULL_TREE
;
4332 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4335 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
4336 gnu_lhs
, gnu_ret_val
);
4337 add_stmt_with_node (gnu_result
, gnat_node
);
4338 gnu_lhs
= NULL_TREE
;
4341 gnu_result
= build_return_expr (gnu_lhs
, gnu_ret_val
);
4345 case N_Goto_Statement
:
4346 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4347 gnat_to_gnu (Name (gnat_node
)));
4350 /****************************/
4351 /* Chapter 6: Subprograms: */
4352 /****************************/
4354 case N_Subprogram_Declaration
:
4355 /* Unless there is a freeze node, declare the subprogram. We consider
4356 this a "definition" even though we're not generating code for
4357 the subprogram because we will be making the corresponding GCC
4360 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node
)))))
4361 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node
)),
4363 gnu_result
= alloc_stmt_list ();
4366 case N_Abstract_Subprogram_Declaration
:
4367 /* This subprogram doesn't exist for code generation purposes, but we
4368 have to elaborate the types of any parameters and result, unless
4369 they are imported types (nothing to generate in this case). */
4371 /* Process the parameter types first. */
4374 = First_Formal_With_Extras
4375 (Defining_Entity (Specification (gnat_node
)));
4376 Present (gnat_temp
);
4377 gnat_temp
= Next_Formal_With_Extras (gnat_temp
))
4378 if (Is_Itype (Etype (gnat_temp
))
4379 && !From_With_Type (Etype (gnat_temp
)))
4380 gnat_to_gnu_entity (Etype (gnat_temp
), NULL_TREE
, 0);
4383 /* Then the result type, set to Standard_Void_Type for procedures. */
4386 Entity_Id gnat_temp_type
4387 = Etype (Defining_Entity (Specification (gnat_node
)));
4389 if (Is_Itype (gnat_temp_type
) && !From_With_Type (gnat_temp_type
))
4390 gnat_to_gnu_entity (Etype (gnat_temp_type
), NULL_TREE
, 0);
4393 gnu_result
= alloc_stmt_list ();
4396 case N_Defining_Program_Unit_Name
:
4397 /* For a child unit identifier go up a level to get the
4398 specification. We get this when we try to find the spec of
4399 a child unit package that is the compilation unit being compiled. */
4400 gnu_result
= gnat_to_gnu (Parent (gnat_node
));
4403 case N_Subprogram_Body
:
4404 Subprogram_Body_to_gnu (gnat_node
);
4405 gnu_result
= alloc_stmt_list ();
4408 case N_Function_Call
:
4409 case N_Procedure_Call_Statement
:
4410 gnu_result
= call_to_gnu (gnat_node
, &gnu_result_type
, NULL_TREE
);
4413 /*************************/
4414 /* Chapter 7: Packages: */
4415 /*************************/
4417 case N_Package_Declaration
:
4418 gnu_result
= gnat_to_gnu (Specification (gnat_node
));
4421 case N_Package_Specification
:
4423 start_stmt_group ();
4424 process_decls (Visible_Declarations (gnat_node
),
4425 Private_Declarations (gnat_node
), Empty
, true, true);
4426 gnu_result
= end_stmt_group ();
4429 case N_Package_Body
:
4431 /* If this is the body of a generic package - do nothing */
4432 if (Ekind (Corresponding_Spec (gnat_node
)) == E_Generic_Package
)
4434 gnu_result
= alloc_stmt_list ();
4438 start_stmt_group ();
4439 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4441 if (Present (Handled_Statement_Sequence (gnat_node
)))
4442 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4444 gnu_result
= end_stmt_group ();
4447 /*********************************/
4448 /* Chapter 8: Visibility Rules: */
4449 /*********************************/
4451 case N_Use_Package_Clause
:
4452 case N_Use_Type_Clause
:
4453 /* Nothing to do here - but these may appear in list of declarations */
4454 gnu_result
= alloc_stmt_list ();
4457 /***********************/
4458 /* Chapter 9: Tasks: */
4459 /***********************/
4461 case N_Protected_Type_Declaration
:
4462 gnu_result
= alloc_stmt_list ();
4465 case N_Single_Task_Declaration
:
4466 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
4467 gnu_result
= alloc_stmt_list ();
4470 /***********************************************************/
4471 /* Chapter 10: Program Structure and Compilation Issues: */
4472 /***********************************************************/
4474 case N_Compilation_Unit
:
4476 /* This is not called for the main unit, which is handled in function
4478 start_stmt_group ();
4481 Compilation_Unit_to_gnu (gnat_node
);
4482 gnu_result
= alloc_stmt_list ();
4485 case N_Subprogram_Body_Stub
:
4486 case N_Package_Body_Stub
:
4487 case N_Protected_Body_Stub
:
4488 case N_Task_Body_Stub
:
4489 /* Simply process whatever unit is being inserted. */
4490 gnu_result
= gnat_to_gnu (Unit (Library_Unit (gnat_node
)));
4494 gnu_result
= gnat_to_gnu (Proper_Body (gnat_node
));
4497 /***************************/
4498 /* Chapter 11: Exceptions: */
4499 /***************************/
4501 case N_Handled_Sequence_Of_Statements
:
4502 /* If there is an At_End procedure attached to this node, and the EH
4503 mechanism is SJLJ, we must have at least a corresponding At_End
4504 handler, unless the No_Exception_Handlers restriction is set. */
4505 gcc_assert (type_annotate_only
4506 || Exception_Mechanism
!= Setjmp_Longjmp
4507 || No (At_End_Proc (gnat_node
))
4508 || Present (Exception_Handlers (gnat_node
))
4509 || No_Exception_Handlers_Set ());
4511 gnu_result
= Handled_Sequence_Of_Statements_to_gnu (gnat_node
);
4514 case N_Exception_Handler
:
4515 if (Exception_Mechanism
== Setjmp_Longjmp
)
4516 gnu_result
= Exception_Handler_to_gnu_sjlj (gnat_node
);
4517 else if (Exception_Mechanism
== Back_End_Exceptions
)
4518 gnu_result
= Exception_Handler_to_gnu_zcx (gnat_node
);
4524 case N_Push_Constraint_Error_Label
:
4525 push_exception_label_stack (&gnu_constraint_error_label_stack
,
4526 Exception_Label (gnat_node
));
4529 case N_Push_Storage_Error_Label
:
4530 push_exception_label_stack (&gnu_storage_error_label_stack
,
4531 Exception_Label (gnat_node
));
4534 case N_Push_Program_Error_Label
:
4535 push_exception_label_stack (&gnu_program_error_label_stack
,
4536 Exception_Label (gnat_node
));
4539 case N_Pop_Constraint_Error_Label
:
4540 gnu_constraint_error_label_stack
4541 = TREE_CHAIN (gnu_constraint_error_label_stack
);
4544 case N_Pop_Storage_Error_Label
:
4545 gnu_storage_error_label_stack
4546 = TREE_CHAIN (gnu_storage_error_label_stack
);
4549 case N_Pop_Program_Error_Label
:
4550 gnu_program_error_label_stack
4551 = TREE_CHAIN (gnu_program_error_label_stack
);
4554 /*******************************/
4555 /* Chapter 12: Generic Units: */
4556 /*******************************/
4558 case N_Generic_Function_Renaming_Declaration
:
4559 case N_Generic_Package_Renaming_Declaration
:
4560 case N_Generic_Procedure_Renaming_Declaration
:
4561 case N_Generic_Package_Declaration
:
4562 case N_Generic_Subprogram_Declaration
:
4563 case N_Package_Instantiation
:
4564 case N_Procedure_Instantiation
:
4565 case N_Function_Instantiation
:
4566 /* These nodes can appear on a declaration list but there is nothing to
4567 to be done with them. */
4568 gnu_result
= alloc_stmt_list ();
4571 /***************************************************/
4572 /* Chapter 13: Representation Clauses and */
4573 /* Implementation-Dependent Features: */
4574 /***************************************************/
4576 case N_Attribute_Definition_Clause
:
4577 gnu_result
= alloc_stmt_list ();
4579 /* The only one we need to deal with is 'Address since, for the others,
4580 the front-end puts the information elsewhere. */
4581 if (Get_Attribute_Id (Chars (gnat_node
)) != Attr_Address
)
4584 /* And we only deal with 'Address if the object has a Freeze node. */
4585 gnat_temp
= Entity (Name (gnat_node
));
4586 if (No (Freeze_Node (gnat_temp
)))
4589 /* Get the value to use as the address and save it as the equivalent
4590 for the object. When it is frozen, gnat_to_gnu_entity will do the
4592 save_gnu_tree (gnat_temp
, gnat_to_gnu (Expression (gnat_node
)), true);
4595 case N_Enumeration_Representation_Clause
:
4596 case N_Record_Representation_Clause
:
4598 /* We do nothing with these. SEM puts the information elsewhere. */
4599 gnu_result
= alloc_stmt_list ();
4602 case N_Code_Statement
:
4603 if (!type_annotate_only
)
4605 tree gnu_template
= gnat_to_gnu (Asm_Template (gnat_node
));
4606 tree gnu_inputs
= NULL_TREE
, gnu_outputs
= NULL_TREE
;
4607 tree gnu_clobbers
= NULL_TREE
, tail
;
4608 bool allows_mem
, allows_reg
, fake
;
4609 int ninputs
, noutputs
, i
;
4610 const char **oconstraints
;
4611 const char *constraint
;
4614 /* First retrieve the 3 operand lists built by the front-end. */
4615 Setup_Asm_Outputs (gnat_node
);
4616 while (Present (gnat_temp
= Asm_Output_Variable ()))
4618 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4619 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4620 (Asm_Output_Constraint ()));
4622 gnu_outputs
= tree_cons (gnu_constr
, gnu_value
, gnu_outputs
);
4626 Setup_Asm_Inputs (gnat_node
);
4627 while (Present (gnat_temp
= Asm_Input_Value ()))
4629 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4630 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4631 (Asm_Input_Constraint ()));
4633 gnu_inputs
= tree_cons (gnu_constr
, gnu_value
, gnu_inputs
);
4637 Clobber_Setup (gnat_node
);
4638 while ((clobber
= Clobber_Get_Next ()))
4640 = tree_cons (NULL_TREE
,
4641 build_string (strlen (clobber
) + 1, clobber
),
4644 /* Then perform some standard checking and processing on the
4645 operands. In particular, mark them addressable if needed. */
4646 gnu_outputs
= nreverse (gnu_outputs
);
4647 noutputs
= list_length (gnu_outputs
);
4648 gnu_inputs
= nreverse (gnu_inputs
);
4649 ninputs
= list_length (gnu_inputs
);
4651 = (const char **) alloca (noutputs
* sizeof (const char *));
4653 for (i
= 0, tail
= gnu_outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4655 tree output
= TREE_VALUE (tail
);
4657 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4658 oconstraints
[i
] = constraint
;
4660 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
4661 &allows_mem
, &allows_reg
, &fake
))
4663 /* If the operand is going to end up in memory,
4664 mark it addressable. Note that we don't test
4665 allows_mem like in the input case below; this
4666 is modelled on the C front-end. */
4668 && !gnat_mark_addressable (output
))
4669 output
= error_mark_node
;
4672 output
= error_mark_node
;
4674 TREE_VALUE (tail
) = output
;
4677 for (i
= 0, tail
= gnu_inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4679 tree input
= TREE_VALUE (tail
);
4681 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4683 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
,
4685 &allows_mem
, &allows_reg
))
4687 /* If the operand is going to end up in memory,
4688 mark it addressable. */
4689 if (!allows_reg
&& allows_mem
4690 && !gnat_mark_addressable (input
))
4691 input
= error_mark_node
;
4694 input
= error_mark_node
;
4696 TREE_VALUE (tail
) = input
;
4699 gnu_result
= build4 (ASM_EXPR
, void_type_node
,
4700 gnu_template
, gnu_outputs
,
4701 gnu_inputs
, gnu_clobbers
);
4702 ASM_VOLATILE_P (gnu_result
) = Is_Asm_Volatile (gnat_node
);
4705 gnu_result
= alloc_stmt_list ();
4709 /***************************************************/
4711 /***************************************************/
4713 case N_Freeze_Entity
:
4714 start_stmt_group ();
4715 process_freeze_entity (gnat_node
);
4716 process_decls (Actions (gnat_node
), Empty
, Empty
, true, true);
4717 gnu_result
= end_stmt_group ();
4720 case N_Itype_Reference
:
4721 if (!present_gnu_tree (Itype (gnat_node
)))
4722 process_type (Itype (gnat_node
));
4724 gnu_result
= alloc_stmt_list ();
4727 case N_Free_Statement
:
4728 if (!type_annotate_only
)
4730 tree gnu_ptr
= gnat_to_gnu (Expression (gnat_node
));
4731 tree gnu_ptr_type
= TREE_TYPE (gnu_ptr
);
4733 tree gnu_actual_obj_type
= 0;
4736 unsigned int default_allocator_alignment
4737 = get_target_default_allocator_alignment () * BITS_PER_UNIT
;
4739 /* If this is a thin pointer, we must dereference it to create
4740 a fat pointer, then go back below to a thin pointer. The
4741 reason for this is that we need a fat pointer someplace in
4742 order to properly compute the size. */
4743 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr
)))
4744 gnu_ptr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
4745 build_unary_op (INDIRECT_REF
, NULL_TREE
,
4748 /* If this is an unconstrained array, we know the object must
4749 have been allocated with the template in front of the object.
4750 So pass the template address, but get the total size. Do this
4751 by converting to a thin pointer. */
4752 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr
)))
4754 = convert (build_pointer_type
4755 (TYPE_OBJECT_RECORD_TYPE
4756 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr
)))),
4759 gnu_obj_type
= TREE_TYPE (TREE_TYPE (gnu_ptr
));
4761 if (Present (Actual_Designated_Subtype (gnat_node
)))
4764 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node
));
4766 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4768 = build_unc_object_type_from_ptr (gnu_ptr_type
,
4769 gnu_actual_obj_type
,
4770 get_identifier ("DEALLOC"));
4773 gnu_actual_obj_type
= gnu_obj_type
;
4775 gnu_obj_size
= TYPE_SIZE_UNIT (gnu_actual_obj_type
);
4776 align
= TYPE_ALIGN (gnu_obj_type
);
4778 if (TREE_CODE (gnu_obj_type
) == RECORD_TYPE
4779 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type
))
4781 tree gnu_char_ptr_type
= build_pointer_type (char_type_node
);
4782 tree gnu_pos
= byte_position (TYPE_FIELDS (gnu_obj_type
));
4783 tree gnu_byte_offset
4784 = convert (sizetype
,
4785 size_diffop (size_zero_node
, gnu_pos
));
4786 gnu_byte_offset
= fold_build1 (NEGATE_EXPR
, sizetype
, gnu_byte_offset
);
4788 gnu_ptr
= convert (gnu_char_ptr_type
, gnu_ptr
);
4789 gnu_ptr
= build_binary_op (POINTER_PLUS_EXPR
, gnu_char_ptr_type
,
4790 gnu_ptr
, gnu_byte_offset
);
4793 /* If the object was allocated from the default storage pool, the
4794 alignment was greater than what the allocator provides, and this
4795 is not a fat or thin pointer, what we have in gnu_ptr here is an
4796 address dynamically adjusted to match the alignment requirement
4797 (see build_allocator). What we need to pass to free is the
4798 initial allocator's return value, which has been stored just in
4799 front of the block we have. */
4801 if (No (Procedure_To_Call (gnat_node
))
4802 && align
> default_allocator_alignment
4803 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4806 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
4810 = (void *)GNU_PTR - (void *)sizeof (void *)) */
4813 (POINTER_PLUS_EXPR
, ptr_void_type_node
,
4814 convert (ptr_void_type_node
, gnu_ptr
),
4815 size_int (-POINTER_SIZE
/BITS_PER_UNIT
));
4817 /* GNU_PTR (void *) = *(void **)GNU_PTR */
4820 (INDIRECT_REF
, NULL_TREE
,
4821 convert (build_pointer_type (ptr_void_type_node
),
4825 gnu_result
= build_call_alloc_dealloc (gnu_ptr
, gnu_obj_size
, align
,
4826 Procedure_To_Call (gnat_node
),
4827 Storage_Pool (gnat_node
),
4832 case N_Raise_Constraint_Error
:
4833 case N_Raise_Program_Error
:
4834 case N_Raise_Storage_Error
:
4835 if (type_annotate_only
)
4837 gnu_result
= alloc_stmt_list ();
4841 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4843 = build_call_raise (UI_To_Int (Reason (gnat_node
)), gnat_node
,
4846 /* If the type is VOID, this is a statement, so we need to
4847 generate the code for the call. Handle a Condition, if there
4849 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
4851 set_expr_location_from_node (gnu_result
, gnat_node
);
4853 if (Present (Condition (gnat_node
)))
4854 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4855 gnat_to_gnu (Condition (gnat_node
)),
4856 gnu_result
, alloc_stmt_list ());
4859 gnu_result
= build1 (NULL_EXPR
, gnu_result_type
, gnu_result
);
4862 case N_Validate_Unchecked_Conversion
:
4864 Entity_Id gnat_target_type
= Target_Type (gnat_node
);
4865 tree gnu_source_type
= gnat_to_gnu_type (Source_Type (gnat_node
));
4866 tree gnu_target_type
= gnat_to_gnu_type (gnat_target_type
);
4868 /* No need for any warning in this case. */
4869 if (!flag_strict_aliasing
)
4872 /* If the result is a pointer type, see if we are either converting
4873 from a non-pointer or from a pointer to a type with a different
4874 alias set and warn if so. If the result is defined in the same
4875 unit as this unchecked conversion, we can allow this because we
4876 can know to make the pointer type behave properly. */
4877 else if (POINTER_TYPE_P (gnu_target_type
)
4878 && !In_Same_Source_Unit (gnat_target_type
, gnat_node
)
4879 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type
)))
4881 tree gnu_source_desig_type
= POINTER_TYPE_P (gnu_source_type
)
4882 ? TREE_TYPE (gnu_source_type
)
4884 tree gnu_target_desig_type
= TREE_TYPE (gnu_target_type
);
4886 if ((TYPE_DUMMY_P (gnu_target_desig_type
)
4887 || get_alias_set (gnu_target_desig_type
) != 0)
4888 && (!POINTER_TYPE_P (gnu_source_type
)
4889 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4890 != TYPE_DUMMY_P (gnu_target_desig_type
))
4891 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4892 && gnu_source_desig_type
!= gnu_target_desig_type
)
4893 || (get_alias_set (gnu_source_desig_type
)
4894 != get_alias_set (gnu_target_desig_type
))))
4897 ("?possible aliasing problem for type&",
4898 gnat_node
, Target_Type (gnat_node
));
4900 ("\\?use -fno-strict-aliasing switch for references",
4903 ("\\?or use `pragma No_Strict_Aliasing (&);`",
4904 gnat_node
, Target_Type (gnat_node
));
4908 /* But if the result is a fat pointer type, we have no mechanism to
4909 do that, so we unconditionally warn in problematic cases. */
4910 else if (TYPE_FAT_POINTER_P (gnu_target_type
))
4912 tree gnu_source_array_type
4913 = TYPE_FAT_POINTER_P (gnu_source_type
)
4914 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type
)))
4916 tree gnu_target_array_type
4917 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type
)));
4919 if ((TYPE_DUMMY_P (gnu_target_array_type
)
4920 || get_alias_set (gnu_target_array_type
) != 0)
4921 && (!TYPE_FAT_POINTER_P (gnu_source_type
)
4922 || (TYPE_DUMMY_P (gnu_source_array_type
)
4923 != TYPE_DUMMY_P (gnu_target_array_type
))
4924 || (TYPE_DUMMY_P (gnu_source_array_type
)
4925 && gnu_source_array_type
!= gnu_target_array_type
)
4926 || (get_alias_set (gnu_source_array_type
)
4927 != get_alias_set (gnu_target_array_type
))))
4930 ("?possible aliasing problem for type&",
4931 gnat_node
, Target_Type (gnat_node
));
4933 ("\\?use -fno-strict-aliasing switch for references",
4938 gnu_result
= alloc_stmt_list ();
4941 case N_Raise_Statement
:
4942 case N_Function_Specification
:
4943 case N_Procedure_Specification
:
4945 case N_Component_Association
:
4948 gcc_assert (type_annotate_only
);
4949 gnu_result
= alloc_stmt_list ();
4952 /* If we pushed our level as part of processing the elaboration routine,
4954 if (went_into_elab_proc
)
4956 add_stmt (gnu_result
);
4958 gnu_result
= end_stmt_group ();
4959 current_function_decl
= NULL_TREE
;
4962 /* Set the location information on the result if it is a real expression.
4963 References can be reused for multiple GNAT nodes and they would get
4964 the location information of their last use. Note that we may have
4965 no result if we tried to build a CALL_EXPR node to a procedure with
4966 no side-effects and optimization is enabled. */
4968 && EXPR_P (gnu_result
)
4969 && TREE_CODE (gnu_result
) != NOP_EXPR
4970 && !REFERENCE_CLASS_P (gnu_result
))
4971 set_expr_location_from_node (gnu_result
, gnat_node
);
4973 /* If we're supposed to return something of void_type, it means we have
4974 something we're elaborating for effect, so just return. */
4975 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
4978 /* If the result is a constant that overflows, raise constraint error. */
4979 else if (TREE_CODE (gnu_result
) == INTEGER_CST
4980 && TREE_OVERFLOW (gnu_result
))
4982 post_error ("Constraint_Error will be raised at run-time?", gnat_node
);
4985 = build1 (NULL_EXPR
, gnu_result_type
,
4986 build_call_raise (CE_Overflow_Check_Failed
, gnat_node
,
4987 N_Raise_Constraint_Error
));
4990 /* If our result has side-effects and is of an unconstrained type,
4991 make a SAVE_EXPR so that we can be sure it will only be referenced
4992 once. Note we must do this before any conversions. */
4993 if (TREE_SIDE_EFFECTS (gnu_result
)
4994 && (TREE_CODE (gnu_result_type
) == UNCONSTRAINED_ARRAY_TYPE
4995 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))))
4996 gnu_result
= gnat_stabilize_reference (gnu_result
, false);
4998 /* Now convert the result to the result type, unless we are in one of the
5001 1. If this is the Name of an assignment statement or a parameter of
5002 a procedure call, return the result almost unmodified since the
5003 RHS will have to be converted to our type in that case, unless
5004 the result type has a simpler size. Similarly, don't convert
5005 integral types that are the operands of an unchecked conversion
5006 since we need to ignore those conversions (for 'Valid).
5008 2. If we have a label (which doesn't have any well-defined type), a
5009 field or an error, return the result almost unmodified. Also don't
5010 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5011 its size since those are the cases where the front end may have the
5012 type wrong due to "instantiating" the unconstrained record with
5013 discriminant values. Similarly, if the two types are record types
5014 with the same name don't convert. This will be the case when we are
5015 converting from a packable version of a type to its original type and
5016 we need those conversions to be NOPs in order for assignments into
5017 these types to work properly.
5019 3. If the type is void or if we have no result, return error_mark_node
5020 to show we have no result.
5022 4. Finally, if the type of the result is already correct. */
5024 if (Present (Parent (gnat_node
))
5025 && ((Nkind (Parent (gnat_node
)) == N_Assignment_Statement
5026 && Name (Parent (gnat_node
)) == gnat_node
)
5027 || (Nkind (Parent (gnat_node
)) == N_Procedure_Call_Statement
5028 && Name (Parent (gnat_node
)) != gnat_node
)
5029 || Nkind (Parent (gnat_node
)) == N_Parameter_Association
5030 || (Nkind (Parent (gnat_node
)) == N_Unchecked_Type_Conversion
5031 && !AGGREGATE_TYPE_P (gnu_result_type
)
5032 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
))))
5033 && !(TYPE_SIZE (gnu_result_type
)
5034 && TYPE_SIZE (TREE_TYPE (gnu_result
))
5035 && (AGGREGATE_TYPE_P (gnu_result_type
)
5036 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
)))
5037 && ((TREE_CODE (TYPE_SIZE (gnu_result_type
)) == INTEGER_CST
5038 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result
)))
5040 || (TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5041 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))
5042 && (CONTAINS_PLACEHOLDER_P
5043 (TYPE_SIZE (TREE_TYPE (gnu_result
))))))
5044 && !(TREE_CODE (gnu_result_type
) == RECORD_TYPE
5045 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type
))))
5047 /* Remove padding only if the inner object is of self-referential
5048 size: in that case it must be an object of unconstrained type
5049 with a default discriminant and we want to avoid copying too
5051 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5052 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
))
5053 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5054 (TREE_TYPE (gnu_result
))))))
5055 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5059 else if (TREE_CODE (gnu_result
) == LABEL_DECL
5060 || TREE_CODE (gnu_result
) == FIELD_DECL
5061 || TREE_CODE (gnu_result
) == ERROR_MARK
5062 || (TYPE_SIZE (gnu_result_type
)
5063 && TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5064 && TREE_CODE (gnu_result
) != INDIRECT_REF
5065 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
)))
5066 || ((TYPE_NAME (gnu_result_type
)
5067 == TYPE_NAME (TREE_TYPE (gnu_result
)))
5068 && TREE_CODE (gnu_result_type
) == RECORD_TYPE
5069 && TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
))
5071 /* Remove any padding. */
5072 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5073 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
5074 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5078 else if (gnu_result
== error_mark_node
|| gnu_result_type
== void_type_node
)
5079 gnu_result
= error_mark_node
;
5081 else if (gnu_result_type
!= TREE_TYPE (gnu_result
))
5082 gnu_result
= convert (gnu_result_type
, gnu_result
);
5084 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5085 while ((TREE_CODE (gnu_result
) == NOP_EXPR
5086 || TREE_CODE (gnu_result
) == NON_LVALUE_EXPR
)
5087 && TREE_TYPE (TREE_OPERAND (gnu_result
, 0)) == TREE_TYPE (gnu_result
))
5088 gnu_result
= TREE_OPERAND (gnu_result
, 0);
5093 /* Subroutine of above to push the exception label stack. GNU_STACK is
5094 a pointer to the stack to update and GNAT_LABEL, if present, is the
5095 label to push onto the stack. */
5098 push_exception_label_stack (tree
*gnu_stack
, Entity_Id gnat_label
)
5100 tree gnu_label
= (Present (gnat_label
)
5101 ? gnat_to_gnu_entity (gnat_label
, NULL_TREE
, 0)
5104 *gnu_stack
= tree_cons (NULL_TREE
, gnu_label
, *gnu_stack
);
5107 /* Record the current code position in GNAT_NODE. */
5110 record_code_position (Node_Id gnat_node
)
5112 tree stmt_stmt
= build1 (STMT_STMT
, void_type_node
, NULL_TREE
);
5114 add_stmt_with_node (stmt_stmt
, gnat_node
);
5115 save_gnu_tree (gnat_node
, stmt_stmt
, true);
5118 /* Insert the code for GNAT_NODE at the position saved for that node. */
5121 insert_code_for (Node_Id gnat_node
)
5123 STMT_STMT_STMT (get_gnu_tree (gnat_node
)) = gnat_to_gnu (gnat_node
);
5124 save_gnu_tree (gnat_node
, NULL_TREE
, true);
5127 /* Start a new statement group chained to the previous group. */
5130 start_stmt_group (void)
5132 struct stmt_group
*group
= stmt_group_free_list
;
5134 /* First see if we can get one from the free list. */
5136 stmt_group_free_list
= group
->previous
;
5138 group
= (struct stmt_group
*) ggc_alloc (sizeof (struct stmt_group
));
5140 group
->previous
= current_stmt_group
;
5141 group
->stmt_list
= group
->block
= group
->cleanups
= NULL_TREE
;
5142 current_stmt_group
= group
;
5145 /* Add GNU_STMT to the current statement group. */
5148 add_stmt (tree gnu_stmt
)
5150 append_to_statement_list (gnu_stmt
, ¤t_stmt_group
->stmt_list
);
5153 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5156 add_stmt_with_node (tree gnu_stmt
, Node_Id gnat_node
)
5158 if (Present (gnat_node
))
5159 set_expr_location_from_node (gnu_stmt
, gnat_node
);
5160 add_stmt (gnu_stmt
);
5163 /* Add a declaration statement for GNU_DECL to the current statement group.
5164 Get SLOC from Entity_Id. */
5167 add_decl_expr (tree gnu_decl
, Entity_Id gnat_entity
)
5169 tree type
= TREE_TYPE (gnu_decl
);
5170 tree gnu_stmt
, gnu_init
, t
;
5172 /* If this is a variable that Gigi is to ignore, we may have been given
5173 an ERROR_MARK. So test for it. We also might have been given a
5174 reference for a renaming. So only do something for a decl. Also
5175 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5176 if (!DECL_P (gnu_decl
)
5177 || (TREE_CODE (gnu_decl
) == TYPE_DECL
5178 && TREE_CODE (type
) == UNCONSTRAINED_ARRAY_TYPE
))
5181 gnu_stmt
= build1 (DECL_EXPR
, void_type_node
, gnu_decl
);
5183 /* If we are global, we don't want to actually output the DECL_EXPR for
5184 this decl since we already have evaluated the expressions in the
5185 sizes and positions as globals and doing it again would be wrong. */
5186 if (global_bindings_p ())
5188 /* Mark everything as used to prevent node sharing with subprograms.
5189 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5190 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5191 mark_visited (&gnu_stmt
);
5192 if (TREE_CODE (gnu_decl
) == VAR_DECL
5193 || TREE_CODE (gnu_decl
) == CONST_DECL
)
5195 mark_visited (&DECL_SIZE (gnu_decl
));
5196 mark_visited (&DECL_SIZE_UNIT (gnu_decl
));
5197 mark_visited (&DECL_INITIAL (gnu_decl
));
5199 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5200 if (TREE_CODE (gnu_decl
) == TYPE_DECL
5201 && (TREE_CODE (type
) == RECORD_TYPE
5202 || TREE_CODE (type
) == UNION_TYPE
5203 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5204 && (t
= TYPE_ADA_SIZE (type
)))
5208 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5210 /* If this is a variable and an initializer is attached to it, it must be
5211 valid for the context. Similar to init_const in create_var_decl_1. */
5212 if (TREE_CODE (gnu_decl
) == VAR_DECL
5213 && (gnu_init
= DECL_INITIAL (gnu_decl
)) != NULL_TREE
5214 && (!gnat_types_compatible_p (type
, TREE_TYPE (gnu_init
))
5215 || (TREE_STATIC (gnu_decl
)
5216 && !initializer_constant_valid_p (gnu_init
,
5217 TREE_TYPE (gnu_init
)))))
5219 /* If GNU_DECL has a padded type, convert it to the unpadded
5220 type so the assignment is done properly. */
5221 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_IS_PADDING_P (type
))
5222 t
= convert (TREE_TYPE (TYPE_FIELDS (type
)), gnu_decl
);
5226 gnu_stmt
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, t
, gnu_init
);
5228 DECL_INITIAL (gnu_decl
) = NULL_TREE
;
5229 if (TREE_READONLY (gnu_decl
))
5231 TREE_READONLY (gnu_decl
) = 0;
5232 DECL_READONLY_ONCE_ELAB (gnu_decl
) = 1;
5235 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5239 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5242 mark_visited_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5244 if (TREE_VISITED (*tp
))
5247 /* Don't mark a dummy type as visited because we want to mark its sizes
5248 and fields once it's filled in. */
5249 else if (!TYPE_IS_DUMMY_P (*tp
))
5250 TREE_VISITED (*tp
) = 1;
5253 TYPE_SIZES_GIMPLIFIED (*tp
) = 1;
5258 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5261 unshare_save_expr (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
5262 void *data ATTRIBUTE_UNUSED
)
5266 if (TREE_CODE (t
) == SAVE_EXPR
)
5267 TREE_OPERAND (t
, 0) = unshare_expr (TREE_OPERAND (t
, 0));
5272 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5273 sized gimplified. We use this to indicate all variable sizes and
5274 positions in global types may not be shared by any subprogram. */
5277 mark_visited (tree
*tp
)
5279 walk_tree (tp
, mark_visited_r
, NULL
, NULL
);
5282 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5283 set its location to that of GNAT_NODE if present. */
5286 add_cleanup (tree gnu_cleanup
, Node_Id gnat_node
)
5288 if (Present (gnat_node
))
5289 set_expr_location_from_node (gnu_cleanup
, gnat_node
);
5290 append_to_statement_list (gnu_cleanup
, ¤t_stmt_group
->cleanups
);
5293 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5296 set_block_for_group (tree gnu_block
)
5298 gcc_assert (!current_stmt_group
->block
);
5299 current_stmt_group
->block
= gnu_block
;
5302 /* Return code corresponding to the current code group. It is normally
5303 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5304 BLOCK or cleanups were set. */
5307 end_stmt_group (void)
5309 struct stmt_group
*group
= current_stmt_group
;
5310 tree gnu_retval
= group
->stmt_list
;
5312 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5313 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5314 make a BIND_EXPR. Note that we nest in that because the cleanup may
5315 reference variables in the block. */
5316 if (gnu_retval
== NULL_TREE
)
5317 gnu_retval
= alloc_stmt_list ();
5319 if (group
->cleanups
)
5320 gnu_retval
= build2 (TRY_FINALLY_EXPR
, void_type_node
, gnu_retval
,
5323 if (current_stmt_group
->block
)
5324 gnu_retval
= build3 (BIND_EXPR
, void_type_node
, BLOCK_VARS (group
->block
),
5325 gnu_retval
, group
->block
);
5327 /* Remove this group from the stack and add it to the free list. */
5328 current_stmt_group
= group
->previous
;
5329 group
->previous
= stmt_group_free_list
;
5330 stmt_group_free_list
= group
;
5335 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5339 add_stmt_list (List_Id gnat_list
)
5343 if (Present (gnat_list
))
5344 for (gnat_node
= First (gnat_list
); Present (gnat_node
);
5345 gnat_node
= Next (gnat_node
))
5346 add_stmt (gnat_to_gnu (gnat_node
));
5349 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5350 If BINDING_P is true, push and pop a binding level around the list. */
5353 build_stmt_group (List_Id gnat_list
, bool binding_p
)
5355 start_stmt_group ();
5359 add_stmt_list (gnat_list
);
5363 return end_stmt_group ();
5366 /* Push and pop routines for stacks. We keep a free list around so we
5367 don't waste tree nodes. */
5370 push_stack (tree
*gnu_stack_ptr
, tree gnu_purpose
, tree gnu_value
)
5372 tree gnu_node
= gnu_stack_free_list
;
5376 gnu_stack_free_list
= TREE_CHAIN (gnu_node
);
5377 TREE_CHAIN (gnu_node
) = *gnu_stack_ptr
;
5378 TREE_PURPOSE (gnu_node
) = gnu_purpose
;
5379 TREE_VALUE (gnu_node
) = gnu_value
;
5382 gnu_node
= tree_cons (gnu_purpose
, gnu_value
, *gnu_stack_ptr
);
5384 *gnu_stack_ptr
= gnu_node
;
5388 pop_stack (tree
*gnu_stack_ptr
)
5390 tree gnu_node
= *gnu_stack_ptr
;
5392 *gnu_stack_ptr
= TREE_CHAIN (gnu_node
);
5393 TREE_CHAIN (gnu_node
) = gnu_stack_free_list
;
5394 gnu_stack_free_list
= gnu_node
;
5397 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5400 gnat_gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
,
5401 gimple_seq
*post_p ATTRIBUTE_UNUSED
)
5403 tree expr
= *expr_p
;
5406 if (IS_ADA_STMT (expr
))
5407 return gnat_gimplify_stmt (expr_p
);
5409 switch (TREE_CODE (expr
))
5412 /* If this is for a scalar, just make a VAR_DECL for it. If for
5413 an aggregate, get a null pointer of the appropriate type and
5415 if (AGGREGATE_TYPE_P (TREE_TYPE (expr
)))
5416 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (expr
),
5417 convert (build_pointer_type (TREE_TYPE (expr
)),
5418 integer_zero_node
));
5421 *expr_p
= create_tmp_var (TREE_TYPE (expr
), NULL
);
5422 TREE_NO_WARNING (*expr_p
) = 1;
5425 gimplify_and_add (TREE_OPERAND (expr
, 0), pre_p
);
5428 case UNCONSTRAINED_ARRAY_REF
:
5429 /* We should only do this if we are just elaborating for side-effects,
5430 but we can't know that yet. */
5431 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5435 op
= TREE_OPERAND (expr
, 0);
5437 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5438 be put into static memory. We know it's going to be readonly given
5439 the semantics we have and it's required to be static memory in
5440 the case when the reference is in an elaboration procedure. */
5441 if (TREE_CODE (op
) == CONSTRUCTOR
&& TREE_CONSTANT (op
))
5443 tree new_var
= create_tmp_var (TREE_TYPE (op
), "C");
5445 TREE_READONLY (new_var
) = 1;
5446 TREE_STATIC (new_var
) = 1;
5447 TREE_ADDRESSABLE (new_var
) = 1;
5448 DECL_INITIAL (new_var
) = op
;
5450 TREE_OPERAND (expr
, 0) = new_var
;
5451 recompute_tree_invariant_for_addr_expr (expr
);
5455 /* If we are taking the address of a SAVE_EXPR, we are typically
5456 processing a misaligned argument to be passed by reference in a
5457 procedure call. We just mark the operand as addressable + not
5458 readonly here and let the common gimplifier code perform the
5459 temporary creation, initialization, and "instantiation" in place of
5460 the SAVE_EXPR in further operands, in particular in the copy back
5461 code inserted after the call. */
5462 else if (TREE_CODE (op
) == SAVE_EXPR
)
5464 TREE_ADDRESSABLE (op
) = 1;
5465 TREE_READONLY (op
) = 0;
5468 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5469 address of the selected operand when it is addressable. Besides, we
5470 also expect addressable_p to only let COND_EXPRs where both arms are
5471 addressable reach here. */
5472 else if (TREE_CODE (op
) == COND_EXPR
)
5475 /* Otherwise, if we are taking the address of something that is neither
5476 reference, declaration, or constant, make a variable for the operand
5477 here and then take its address. If we don't do it this way, we may
5478 confuse the gimplifier because it needs to know the variable is
5479 addressable at this point. This duplicates code in
5480 internal_get_tmp_var, which is unfortunate. */
5481 else if (TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_reference
5482 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_declaration
5483 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_constant
)
5485 tree new_var
= create_tmp_var (TREE_TYPE (op
), "A");
5488 TREE_ADDRESSABLE (new_var
) = 1;
5490 stmt
= gimplify_assign (new_var
, op
, pre_p
);
5491 if (EXPR_HAS_LOCATION (op
))
5492 gimple_set_location (stmt
, *EXPR_LOCUS (op
));
5494 TREE_OPERAND (expr
, 0) = new_var
;
5495 recompute_tree_invariant_for_addr_expr (expr
);
5499 /* ... fall through ... */
5502 return GS_UNHANDLED
;
5506 /* Generate GIMPLE in place for the statement at *STMT_P. */
5508 static enum gimplify_status
5509 gnat_gimplify_stmt (tree
*stmt_p
)
5511 tree stmt
= *stmt_p
;
5513 switch (TREE_CODE (stmt
))
5516 *stmt_p
= STMT_STMT_STMT (stmt
);
5521 tree gnu_start_label
= create_artificial_label ();
5522 tree gnu_end_label
= LOOP_STMT_LABEL (stmt
);
5525 /* Set to emit the statements of the loop. */
5526 *stmt_p
= NULL_TREE
;
5528 /* We first emit the start label and then a conditional jump to
5529 the end label if there's a top condition, then the body of the
5530 loop, then a conditional branch to the end label, then the update,
5531 if any, and finally a jump to the start label and the definition
5532 of the end label. */
5533 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5537 if (LOOP_STMT_TOP_COND (stmt
))
5538 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5539 LOOP_STMT_TOP_COND (stmt
),
5546 append_to_statement_list (LOOP_STMT_BODY (stmt
), stmt_p
);
5548 if (LOOP_STMT_BOT_COND (stmt
))
5549 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5550 LOOP_STMT_BOT_COND (stmt
),
5557 if (LOOP_STMT_UPDATE (stmt
))
5558 append_to_statement_list (LOOP_STMT_UPDATE (stmt
), stmt_p
);
5560 t
= build1 (GOTO_EXPR
, void_type_node
, gnu_start_label
);
5561 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (gnu_end_label
));
5562 append_to_statement_list (t
, stmt_p
);
5564 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5571 /* Build a statement to jump to the corresponding end label, then
5572 see if it needs to be conditional. */
5573 *stmt_p
= build1 (GOTO_EXPR
, void_type_node
, EXIT_STMT_LABEL (stmt
));
5574 if (EXIT_STMT_COND (stmt
))
5575 *stmt_p
= build3 (COND_EXPR
, void_type_node
,
5576 EXIT_STMT_COND (stmt
), *stmt_p
, alloc_stmt_list ());
5584 /* Force references to each of the entities in packages withed by GNAT_NODE.
5585 Operate recursively but check that we aren't elaborating something more
5588 This routine is exclusively called in type_annotate mode, to compute DDA
5589 information for types in withed units, for ASIS use. */
5592 elaborate_all_entities (Node_Id gnat_node
)
5594 Entity_Id gnat_with_clause
, gnat_entity
;
5596 /* Process each unit only once. As we trace the context of all relevant
5597 units transitively, including generic bodies, we may encounter the
5598 same generic unit repeatedly. */
5599 if (!present_gnu_tree (gnat_node
))
5600 save_gnu_tree (gnat_node
, integer_zero_node
, true);
5602 /* Save entities in all context units. A body may have an implicit_with
5603 on its own spec, if the context includes a child unit, so don't save
5605 for (gnat_with_clause
= First (Context_Items (gnat_node
));
5606 Present (gnat_with_clause
);
5607 gnat_with_clause
= Next (gnat_with_clause
))
5608 if (Nkind (gnat_with_clause
) == N_With_Clause
5609 && !present_gnu_tree (Library_Unit (gnat_with_clause
))
5610 && Library_Unit (gnat_with_clause
) != Library_Unit (Cunit (Main_Unit
)))
5612 elaborate_all_entities (Library_Unit (gnat_with_clause
));
5614 if (Ekind (Entity (Name (gnat_with_clause
))) == E_Package
)
5616 for (gnat_entity
= First_Entity (Entity (Name (gnat_with_clause
)));
5617 Present (gnat_entity
);
5618 gnat_entity
= Next_Entity (gnat_entity
))
5619 if (Is_Public (gnat_entity
)
5620 && Convention (gnat_entity
) != Convention_Intrinsic
5621 && Ekind (gnat_entity
) != E_Package
5622 && Ekind (gnat_entity
) != E_Package_Body
5623 && Ekind (gnat_entity
) != E_Operator
5624 && !(IN (Ekind (gnat_entity
), Type_Kind
)
5625 && !Is_Frozen (gnat_entity
))
5626 && !((Ekind (gnat_entity
) == E_Procedure
5627 || Ekind (gnat_entity
) == E_Function
)
5628 && Is_Intrinsic_Subprogram (gnat_entity
))
5629 && !IN (Ekind (gnat_entity
), Named_Kind
)
5630 && !IN (Ekind (gnat_entity
), Generic_Unit_Kind
))
5631 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5633 else if (Ekind (Entity (Name (gnat_with_clause
))) == E_Generic_Package
)
5636 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause
)));
5638 /* Retrieve compilation unit node of generic body. */
5639 while (Present (gnat_body
)
5640 && Nkind (gnat_body
) != N_Compilation_Unit
)
5641 gnat_body
= Parent (gnat_body
);
5643 /* If body is available, elaborate its context. */
5644 if (Present (gnat_body
))
5645 elaborate_all_entities (gnat_body
);
5649 if (Nkind (Unit (gnat_node
)) == N_Package_Body
)
5650 elaborate_all_entities (Library_Unit (gnat_node
));
5653 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5656 process_freeze_entity (Node_Id gnat_node
)
5658 Entity_Id gnat_entity
= Entity (gnat_node
);
5662 = (Nkind (Declaration_Node (gnat_entity
)) == N_Object_Declaration
5663 && present_gnu_tree (Declaration_Node (gnat_entity
)))
5664 ? get_gnu_tree (Declaration_Node (gnat_entity
)) : NULL_TREE
;
5666 /* If this is a package, need to generate code for the package. */
5667 if (Ekind (gnat_entity
) == E_Package
)
5670 (Parent (Corresponding_Body
5671 (Parent (Declaration_Node (gnat_entity
)))));
5675 /* Check for old definition after the above call. This Freeze_Node
5676 might be for one its Itypes. */
5678 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
5680 /* If this entity has an Address representation clause, GNU_OLD is the
5681 address, so discard it here. */
5682 if (Present (Address_Clause (gnat_entity
)))
5685 /* Don't do anything for class-wide types they are always
5686 transformed into their root type. */
5687 if (Ekind (gnat_entity
) == E_Class_Wide_Type
5688 || (Ekind (gnat_entity
) == E_Class_Wide_Subtype
5689 && Present (Equivalent_Type (gnat_entity
))))
5692 /* Don't do anything for subprograms that may have been elaborated before
5693 their freeze nodes. This can happen, for example because of an inner call
5694 in an instance body, or a previous compilation of a spec for inlining
5697 && ((TREE_CODE (gnu_old
) == FUNCTION_DECL
5698 && (Ekind (gnat_entity
) == E_Function
5699 || Ekind (gnat_entity
) == E_Procedure
))
5701 && TREE_CODE (TREE_TYPE (gnu_old
)) == FUNCTION_TYPE
5702 && Ekind (gnat_entity
) == E_Subprogram_Type
)))
5705 /* If we have a non-dummy type old tree, we have nothing to do, except
5706 aborting if this is the public view of a private type whose full view was
5707 not delayed, as this node was never delayed as it should have been. We
5708 let this happen for concurrent types and their Corresponding_Record_Type,
5709 however, because each might legitimately be elaborated before it's own
5710 freeze node, e.g. while processing the other. */
5712 && !(TREE_CODE (gnu_old
) == TYPE_DECL
5713 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
))))
5715 gcc_assert ((IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5716 && Present (Full_View (gnat_entity
))
5717 && No (Freeze_Node (Full_View (gnat_entity
))))
5718 || Is_Concurrent_Type (gnat_entity
)
5719 || (IN (Ekind (gnat_entity
), Record_Kind
)
5720 && Is_Concurrent_Record_Type (gnat_entity
)));
5724 /* Reset the saved tree, if any, and elaborate the object or type for real.
5725 If there is a full declaration, elaborate it and copy the type to
5726 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
5727 a class wide type or subtype. */
5730 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
5731 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5732 && Present (Full_View (gnat_entity
))
5733 && present_gnu_tree (Full_View (gnat_entity
)))
5734 save_gnu_tree (Full_View (gnat_entity
), NULL_TREE
, false);
5735 if (Present (Class_Wide_Type (gnat_entity
))
5736 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5737 save_gnu_tree (Class_Wide_Type (gnat_entity
), NULL_TREE
, false);
5740 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5741 && Present (Full_View (gnat_entity
)))
5743 gnu_new
= gnat_to_gnu_entity (Full_View (gnat_entity
), NULL_TREE
, 1);
5745 /* Propagate back-annotations from full view to partial view. */
5746 if (Unknown_Alignment (gnat_entity
))
5747 Set_Alignment (gnat_entity
, Alignment (Full_View (gnat_entity
)));
5749 if (Unknown_Esize (gnat_entity
))
5750 Set_Esize (gnat_entity
, Esize (Full_View (gnat_entity
)));
5752 if (Unknown_RM_Size (gnat_entity
))
5753 Set_RM_Size (gnat_entity
, RM_Size (Full_View (gnat_entity
)));
5755 /* The above call may have defined this entity (the simplest example
5756 of this is when we have a private enumeral type since the bounds
5757 will have the public view. */
5758 if (!present_gnu_tree (gnat_entity
))
5759 save_gnu_tree (gnat_entity
, gnu_new
, false);
5760 if (Present (Class_Wide_Type (gnat_entity
))
5761 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5762 save_gnu_tree (Class_Wide_Type (gnat_entity
), gnu_new
, false);
5765 gnu_new
= gnat_to_gnu_entity (gnat_entity
, gnu_init
, 1);
5767 /* If we've made any pointers to the old version of this type, we
5768 have to update them. */
5770 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
5771 TREE_TYPE (gnu_new
));
5774 /* Process the list of inlined subprograms of GNAT_NODE, which is an
5775 N_Compilation_Unit. */
5778 process_inlined_subprograms (Node_Id gnat_node
)
5780 Entity_Id gnat_entity
;
5783 /* If we can inline, generate Gimple for all the inlined subprograms.
5784 Define the entity first so we set DECL_EXTERNAL. */
5786 for (gnat_entity
= First_Inlined_Subprogram (gnat_node
);
5787 Present (gnat_entity
);
5788 gnat_entity
= Next_Inlined_Subprogram (gnat_entity
))
5790 gnat_body
= Parent (Declaration_Node (gnat_entity
));
5792 if (Nkind (gnat_body
) != N_Subprogram_Body
)
5794 /* ??? This really should always be Present. */
5795 if (No (Corresponding_Body (gnat_body
)))
5799 = Parent (Declaration_Node (Corresponding_Body (gnat_body
)));
5802 if (Present (gnat_body
))
5804 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5805 add_stmt (gnat_to_gnu (gnat_body
));
5810 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
5811 We make two passes, one to elaborate anything other than bodies (but
5812 we declare a function if there was no spec). The second pass
5813 elaborates the bodies.
5815 GNAT_END_LIST gives the element in the list past the end. Normally,
5816 this is Empty, but can be First_Real_Statement for a
5817 Handled_Sequence_Of_Statements.
5819 We make a complete pass through both lists if PASS1P is true, then make
5820 the second pass over both lists if PASS2P is true. The lists usually
5821 correspond to the public and private parts of a package. */
5824 process_decls (List_Id gnat_decls
, List_Id gnat_decls2
,
5825 Node_Id gnat_end_list
, bool pass1p
, bool pass2p
)
5827 List_Id gnat_decl_array
[2];
5831 gnat_decl_array
[0] = gnat_decls
, gnat_decl_array
[1] = gnat_decls2
;
5834 for (i
= 0; i
<= 1; i
++)
5835 if (Present (gnat_decl_array
[i
]))
5836 for (gnat_decl
= First (gnat_decl_array
[i
]);
5837 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5839 /* For package specs, we recurse inside the declarations,
5840 thus taking the two pass approach inside the boundary. */
5841 if (Nkind (gnat_decl
) == N_Package_Declaration
5842 && (Nkind (Specification (gnat_decl
)
5843 == N_Package_Specification
)))
5844 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5845 Private_Declarations (Specification (gnat_decl
)),
5846 Empty
, true, false);
5848 /* Similarly for any declarations in the actions of a
5850 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5852 process_freeze_entity (gnat_decl
);
5853 process_decls (Actions (gnat_decl
), Empty
, Empty
, true, false);
5856 /* Package bodies with freeze nodes get their elaboration deferred
5857 until the freeze node, but the code must be placed in the right
5858 place, so record the code position now. */
5859 else if (Nkind (gnat_decl
) == N_Package_Body
5860 && Present (Freeze_Node (Corresponding_Spec (gnat_decl
))))
5861 record_code_position (gnat_decl
);
5863 else if (Nkind (gnat_decl
) == N_Package_Body_Stub
5864 && Present (Library_Unit (gnat_decl
))
5865 && Present (Freeze_Node
5868 (Library_Unit (gnat_decl
)))))))
5869 record_code_position
5870 (Proper_Body (Unit (Library_Unit (gnat_decl
))));
5872 /* We defer most subprogram bodies to the second pass. */
5873 else if (Nkind (gnat_decl
) == N_Subprogram_Body
)
5875 if (Acts_As_Spec (gnat_decl
))
5877 Node_Id gnat_subprog_id
= Defining_Entity (gnat_decl
);
5879 if (Ekind (gnat_subprog_id
) != E_Generic_Procedure
5880 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5881 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5884 /* For bodies and stubs that act as their own specs, the entity
5885 itself must be elaborated in the first pass, because it may
5886 be used in other declarations. */
5887 else if (Nkind (gnat_decl
) == N_Subprogram_Body_Stub
)
5889 Node_Id gnat_subprog_id
=
5890 Defining_Entity (Specification (gnat_decl
));
5892 if (Ekind (gnat_subprog_id
) != E_Subprogram_Body
5893 && Ekind (gnat_subprog_id
) != E_Generic_Procedure
5894 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5895 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5898 /* Concurrent stubs stand for the corresponding subprogram bodies,
5899 which are deferred like other bodies. */
5900 else if (Nkind (gnat_decl
) == N_Task_Body_Stub
5901 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5904 add_stmt (gnat_to_gnu (gnat_decl
));
5907 /* Here we elaborate everything we deferred above except for package bodies,
5908 which are elaborated at their freeze nodes. Note that we must also
5909 go inside things (package specs and freeze nodes) the first pass did. */
5911 for (i
= 0; i
<= 1; i
++)
5912 if (Present (gnat_decl_array
[i
]))
5913 for (gnat_decl
= First (gnat_decl_array
[i
]);
5914 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5916 if (Nkind (gnat_decl
) == N_Subprogram_Body
5917 || Nkind (gnat_decl
) == N_Subprogram_Body_Stub
5918 || Nkind (gnat_decl
) == N_Task_Body_Stub
5919 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5920 add_stmt (gnat_to_gnu (gnat_decl
));
5922 else if (Nkind (gnat_decl
) == N_Package_Declaration
5923 && (Nkind (Specification (gnat_decl
)
5924 == N_Package_Specification
)))
5925 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5926 Private_Declarations (Specification (gnat_decl
)),
5927 Empty
, false, true);
5929 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5930 process_decls (Actions (gnat_decl
), Empty
, Empty
, false, true);
5934 /* Make a unary operation of kind CODE using build_unary_op, but guard
5935 the operation by an overflow check. CODE can be one of NEGATE_EXPR
5936 or ABS_EXPR. GNU_TYPE is the type desired for the result.
5937 Usually the operation is to be performed in that type. */
5940 build_unary_op_trapv (enum tree_code code
,
5944 gcc_assert ((code
== NEGATE_EXPR
) || (code
== ABS_EXPR
));
5946 operand
= protect_multiple_eval (operand
);
5948 return emit_check (build_binary_op (EQ_EXPR
, integer_type_node
,
5949 operand
, TYPE_MIN_VALUE (gnu_type
)),
5950 build_unary_op (code
, gnu_type
, operand
),
5951 CE_Overflow_Check_Failed
);
5954 /* Make a binary operation of kind CODE using build_binary_op, but
5955 guard the operation by an overflow check. CODE can be one of
5956 PLUS_EXPR, MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired
5957 for the result. Usually the operation is to be performed in that type. */
5960 build_binary_op_trapv (enum tree_code code
,
5965 tree lhs
= protect_multiple_eval (left
);
5966 tree rhs
= protect_multiple_eval (right
);
5967 tree type_max
= TYPE_MAX_VALUE (gnu_type
);
5968 tree type_min
= TYPE_MIN_VALUE (gnu_type
);
5971 tree zero
= convert (gnu_type
, integer_zero_node
);
5976 int precision
= TYPE_PRECISION (gnu_type
);
5978 /* Prefer a constant rhs to simplify checks */
5980 if (TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
)
5981 && commutative_tree_code (code
))
5988 /* In the case the right-hand size is still not constant, try to
5989 use an exact operation in a wider type. */
5991 if (!TREE_CONSTANT (rhs
))
5993 int needed_precision
= code
== MULT_EXPR
? 2 * precision
: precision
+ 1;
5995 if (code
== MULT_EXPR
&& precision
== 64)
5997 return build_call_2_expr (mulv64_decl
, lhs
, rhs
);
5999 else if (needed_precision
<= LONG_LONG_TYPE_SIZE
)
6001 tree calc_type
= gnat_type_for_size (needed_precision
, 0);
6005 result
= build_binary_op (code
, calc_type
,
6006 convert (calc_type
, lhs
),
6007 convert (calc_type
, rhs
));
6009 check
= build_binary_op
6010 (TRUTH_ORIF_EXPR
, integer_type_node
,
6011 build_binary_op (LT_EXPR
, integer_type_node
, result
,
6012 convert (calc_type
, type_min
)),
6013 build_binary_op (GT_EXPR
, integer_type_node
, result
,
6014 convert (calc_type
, type_max
)));
6016 result
= convert (gnu_type
, result
);
6018 return emit_check (check
, result
, CE_Overflow_Check_Failed
);
6022 gnu_expr
= build_binary_op (code
, gnu_type
, lhs
, rhs
);
6023 rhs_ge_zero
= build_binary_op (GE_EXPR
, integer_type_node
, rhs
, zero
);
6028 /* When rhs >= 0, overflow when lhs > type_max - rhs */
6029 check_pos
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6030 build_binary_op (MINUS_EXPR
, gnu_type
,
6033 /* When rhs < 0, overflow when lhs < type_min - rhs */
6034 check_neg
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6035 build_binary_op (MINUS_EXPR
, gnu_type
,
6040 /* When rhs >= 0, overflow when lhs < type_min + rhs */
6041 check_pos
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6042 build_binary_op (PLUS_EXPR
, gnu_type
,
6045 /* When rhs < 0, overflow when lhs > type_max + rhs */
6046 check_neg
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6047 build_binary_op (PLUS_EXPR
, gnu_type
,
6052 /* The check here is designed to be efficient if the rhs is constant,
6053 Four different check expressions determine wether X * C overflows,
6056 C > 0 => X > type_max / C || X < type_min / C
6057 C == -1 => X == type_min
6058 C < -1 => X > type_min / C || X < type_max / C */
6060 tmp1
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_max
, rhs
);
6061 tmp2
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_min
, rhs
);
6063 check_pos
= build_binary_op (TRUTH_ANDIF_EXPR
, integer_type_node
,
6064 build_binary_op (NE_EXPR
, integer_type_node
, zero
, rhs
),
6065 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6066 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp1
),
6067 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp2
)));
6069 check_neg
= fold_build3 (COND_EXPR
, integer_type_node
,
6070 build_binary_op (EQ_EXPR
, integer_type_node
, rhs
,
6071 build_int_cst (gnu_type
, -1)),
6072 build_binary_op (EQ_EXPR
, integer_type_node
, lhs
, type_min
),
6073 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6074 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp2
),
6075 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp1
)));
6082 return emit_check (fold_build3 (COND_EXPR
, integer_type_node
, rhs_ge_zero
,
6083 check_pos
, check_neg
),
6084 gnu_expr
, CE_Overflow_Check_Failed
);
6087 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6088 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6089 which we have to check. */
6092 emit_range_check (tree gnu_expr
, Entity_Id gnat_range_type
)
6094 tree gnu_range_type
= get_unpadded_type (gnat_range_type
);
6095 tree gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
6096 tree gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
6097 tree gnu_compare_type
= get_base_type (TREE_TYPE (gnu_expr
));
6099 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6100 This can for example happen when translating 'Val or 'Value. */
6101 if (gnu_compare_type
== gnu_range_type
)
6104 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6105 we can't do anything since we might be truncating the bounds. No
6106 check is needed in this case. */
6107 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr
))
6108 && (TYPE_PRECISION (gnu_compare_type
)
6109 < TYPE_PRECISION (get_base_type (gnu_range_type
))))
6112 /* Checked expressions must be evaluated only once. */
6113 gnu_expr
= protect_multiple_eval (gnu_expr
);
6115 /* There's no good type to use here, so we might as well use
6116 integer_type_node. Note that the form of the check is
6117 (not (expr >= lo)) or (not (expr <= hi))
6118 the reason for this slightly convoluted form is that NaNs
6119 are not considered to be in range in the float case. */
6121 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6123 (build_binary_op (GE_EXPR
, integer_type_node
,
6124 convert (gnu_compare_type
, gnu_expr
),
6125 convert (gnu_compare_type
, gnu_low
))),
6127 (build_binary_op (LE_EXPR
, integer_type_node
,
6128 convert (gnu_compare_type
, gnu_expr
),
6129 convert (gnu_compare_type
,
6131 gnu_expr
, CE_Range_Check_Failed
);
6134 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object
6135 which we are about to index, GNU_EXPR is the index expression to be
6136 checked, GNU_LOW and GNU_HIGH are the lower and upper bounds
6137 against which GNU_EXPR has to be checked. Note that for index
6138 checking we cannot use the emit_range_check function (although very
6139 similar code needs to be generated in both cases) since for index
6140 checking the array type against which we are checking the indices
6141 may be unconstrained and consequently we need to retrieve the
6142 actual index bounds from the array object itself
6143 (GNU_ARRAY_OBJECT). The place where we need to do that is in
6144 subprograms having unconstrained array formal parameters */
6147 emit_index_check (tree gnu_array_object
,
6152 tree gnu_expr_check
;
6154 /* Checked expressions must be evaluated only once. */
6155 gnu_expr
= protect_multiple_eval (gnu_expr
);
6157 /* Must do this computation in the base type in case the expression's
6158 type is an unsigned subtypes. */
6159 gnu_expr_check
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
6161 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6162 the object we are handling. */
6163 gnu_low
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low
, gnu_array_object
);
6164 gnu_high
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high
, gnu_array_object
);
6166 /* There's no good type to use here, so we might as well use
6167 integer_type_node. */
6169 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6170 build_binary_op (LT_EXPR
, integer_type_node
,
6172 convert (TREE_TYPE (gnu_expr_check
),
6174 build_binary_op (GT_EXPR
, integer_type_node
,
6176 convert (TREE_TYPE (gnu_expr_check
),
6178 gnu_expr
, CE_Index_Check_Failed
);
6181 /* GNU_COND contains the condition corresponding to an access, discriminant or
6182 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6183 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6184 REASON is the code that says why the exception was raised. */
6187 emit_check (tree gnu_cond
, tree gnu_expr
, int reason
)
6192 gnu_call
= build_call_raise (reason
, Empty
, N_Raise_Constraint_Error
);
6194 /* Use an outer COMPOUND_EXPR to make sure that GNU_EXPR will get evaluated
6195 in front of the comparison in case it ends up being a SAVE_EXPR. Put the
6196 whole thing inside its own SAVE_EXPR so the inner SAVE_EXPR doesn't leak
6198 gnu_result
= fold_build3 (COND_EXPR
, TREE_TYPE (gnu_expr
), gnu_cond
,
6199 build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_expr
),
6200 gnu_call
, gnu_expr
),
6203 /* If GNU_EXPR has side effects, make the outer COMPOUND_EXPR and
6204 protect it. Otherwise, show GNU_RESULT has no side effects: we
6205 don't need to evaluate it just for the check. */
6206 if (TREE_SIDE_EFFECTS (gnu_expr
))
6208 = build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_expr
), gnu_expr
, gnu_result
);
6210 TREE_SIDE_EFFECTS (gnu_result
) = 0;
6212 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
6213 we will repeatedly do the test. It would be nice if GCC was able
6214 to optimize this and only do it once. */
6215 return save_expr (gnu_result
);
6218 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing
6219 overflow checks if OVERFLOW_P is nonzero and range checks if
6220 RANGE_P is nonzero. GNAT_TYPE is known to be an integral type.
6221 If TRUNCATE_P is nonzero, do a float to integer conversion with
6222 truncation; otherwise round. */
6225 convert_with_check (Entity_Id gnat_type
, tree gnu_expr
, bool overflowp
,
6226 bool rangep
, bool truncatep
)
6228 tree gnu_type
= get_unpadded_type (gnat_type
);
6229 tree gnu_in_type
= TREE_TYPE (gnu_expr
);
6230 tree gnu_in_basetype
= get_base_type (gnu_in_type
);
6231 tree gnu_base_type
= get_base_type (gnu_type
);
6232 tree gnu_result
= gnu_expr
;
6234 /* If we are not doing any checks, the output is an integral type, and
6235 the input is not a floating type, just do the conversion. This
6236 shortcut is required to avoid problems with packed array types
6237 and simplifies code in all cases anyway. */
6238 if (!rangep
&& !overflowp
&& INTEGRAL_TYPE_P (gnu_base_type
)
6239 && !FLOAT_TYPE_P (gnu_in_type
))
6240 return convert (gnu_type
, gnu_expr
);
6242 /* First convert the expression to its base type. This
6243 will never generate code, but makes the tests below much simpler.
6244 But don't do this if converting from an integer type to an unconstrained
6245 array type since then we need to get the bounds from the original
6247 if (TREE_CODE (gnu_type
) != UNCONSTRAINED_ARRAY_TYPE
)
6248 gnu_result
= convert (gnu_in_basetype
, gnu_result
);
6250 /* If overflow checks are requested, we need to be sure the result will
6251 fit in the output base type. But don't do this if the input
6252 is integer and the output floating-point. */
6254 && !(FLOAT_TYPE_P (gnu_base_type
) && INTEGRAL_TYPE_P (gnu_in_basetype
)))
6256 /* Ensure GNU_EXPR only gets evaluated once. */
6257 tree gnu_input
= protect_multiple_eval (gnu_result
);
6258 tree gnu_cond
= integer_zero_node
;
6259 tree gnu_in_lb
= TYPE_MIN_VALUE (gnu_in_basetype
);
6260 tree gnu_in_ub
= TYPE_MAX_VALUE (gnu_in_basetype
);
6261 tree gnu_out_lb
= TYPE_MIN_VALUE (gnu_base_type
);
6262 tree gnu_out_ub
= TYPE_MAX_VALUE (gnu_base_type
);
6264 /* Convert the lower bounds to signed types, so we're sure we're
6265 comparing them properly. Likewise, convert the upper bounds
6266 to unsigned types. */
6267 if (INTEGRAL_TYPE_P (gnu_in_basetype
) && TYPE_UNSIGNED (gnu_in_basetype
))
6268 gnu_in_lb
= convert (gnat_signed_type (gnu_in_basetype
), gnu_in_lb
);
6270 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6271 && !TYPE_UNSIGNED (gnu_in_basetype
))
6272 gnu_in_ub
= convert (gnat_unsigned_type (gnu_in_basetype
), gnu_in_ub
);
6274 if (INTEGRAL_TYPE_P (gnu_base_type
) && TYPE_UNSIGNED (gnu_base_type
))
6275 gnu_out_lb
= convert (gnat_signed_type (gnu_base_type
), gnu_out_lb
);
6277 if (INTEGRAL_TYPE_P (gnu_base_type
) && !TYPE_UNSIGNED (gnu_base_type
))
6278 gnu_out_ub
= convert (gnat_unsigned_type (gnu_base_type
), gnu_out_ub
);
6280 /* Check each bound separately and only if the result bound
6281 is tighter than the bound on the input type. Note that all the
6282 types are base types, so the bounds must be constant. Also,
6283 the comparison is done in the base type of the input, which
6284 always has the proper signedness. First check for input
6285 integer (which means output integer), output float (which means
6286 both float), or mixed, in which case we always compare.
6287 Note that we have to do the comparison which would *fail* in the
6288 case of an error since if it's an FP comparison and one of the
6289 values is a NaN or Inf, the comparison will fail. */
6290 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6291 ? tree_int_cst_lt (gnu_in_lb
, gnu_out_lb
)
6292 : (FLOAT_TYPE_P (gnu_base_type
)
6293 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb
),
6294 TREE_REAL_CST (gnu_out_lb
))
6298 (build_binary_op (GE_EXPR
, integer_type_node
,
6299 gnu_input
, convert (gnu_in_basetype
,
6302 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6303 ? tree_int_cst_lt (gnu_out_ub
, gnu_in_ub
)
6304 : (FLOAT_TYPE_P (gnu_base_type
)
6305 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub
),
6306 TREE_REAL_CST (gnu_in_lb
))
6309 = build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
, gnu_cond
,
6311 (build_binary_op (LE_EXPR
, integer_type_node
,
6313 convert (gnu_in_basetype
,
6316 if (!integer_zerop (gnu_cond
))
6317 gnu_result
= emit_check (gnu_cond
, gnu_input
,
6318 CE_Overflow_Check_Failed
);
6321 /* Now convert to the result base type. If this is a non-truncating
6322 float-to-integer conversion, round. */
6323 if (INTEGRAL_TYPE_P (gnu_base_type
) && FLOAT_TYPE_P (gnu_in_basetype
)
6326 REAL_VALUE_TYPE half_minus_pred_half
, pred_half
;
6327 tree gnu_conv
, gnu_zero
, gnu_comp
, gnu_saved_result
, calc_type
;
6328 tree gnu_pred_half
, gnu_add_pred_half
, gnu_subtract_pred_half
;
6329 const struct real_format
*fmt
;
6331 /* The following calculations depend on proper rounding to even
6332 of each arithmetic operation. In order to prevent excess
6333 precision from spoiling this property, use the widest hardware
6334 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6336 calc_type
= (FP_ARITH_MAY_WIDEN
? longest_float_type_node
6339 /* FIXME: Should not have padding in the first place */
6340 if (TREE_CODE (calc_type
) == RECORD_TYPE
6341 && TYPE_IS_PADDING_P (calc_type
))
6342 calc_type
= TREE_TYPE (TYPE_FIELDS (calc_type
));
6344 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6345 fmt
= REAL_MODE_FORMAT (TYPE_MODE (calc_type
));
6346 real_2expN (&half_minus_pred_half
, -(fmt
->p
) - 1, TYPE_MODE (calc_type
));
6347 REAL_ARITHMETIC (pred_half
, MINUS_EXPR
, dconsthalf
,
6348 half_minus_pred_half
);
6349 gnu_pred_half
= build_real (calc_type
, pred_half
);
6351 /* If the input is strictly negative, subtract this value
6352 and otherwise add it from the input. For 0.5, the result
6353 is exactly between 1.0 and the machine number preceding 1.0
6354 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6355 will round to 1.0, while all other number with an absolute
6356 value less than 0.5 round to 0.0. For larger numbers exactly
6357 halfway between integers, rounding will always be correct as
6358 the true mathematical result will be closer to the higher
6359 integer compared to the lower one. So, this constant works
6360 for all floating-point numbers.
6362 The reason to use the same constant with subtract/add instead
6363 of a positive and negative constant is to allow the comparison
6364 to be scheduled in parallel with retrieval of the constant and
6365 conversion of the input to the calc_type (if necessary).
6368 gnu_zero
= convert (gnu_in_basetype
, integer_zero_node
);
6369 gnu_saved_result
= save_expr (gnu_result
);
6370 gnu_conv
= convert (calc_type
, gnu_saved_result
);
6371 gnu_comp
= build2 (GE_EXPR
, integer_type_node
,
6372 gnu_saved_result
, gnu_zero
);
6374 = build2 (PLUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6375 gnu_subtract_pred_half
6376 = build2 (MINUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6377 gnu_result
= build3 (COND_EXPR
, calc_type
, gnu_comp
,
6378 gnu_add_pred_half
, gnu_subtract_pred_half
);
6381 if (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6382 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type
)
6383 && TREE_CODE (gnu_result
) == UNCONSTRAINED_ARRAY_REF
)
6384 gnu_result
= unchecked_convert (gnu_base_type
, gnu_result
, false);
6386 gnu_result
= convert (gnu_base_type
, gnu_result
);
6388 /* Finally, do the range check if requested. Note that if the
6389 result type is a modular type, the range check is actually
6390 an overflow check. */
6393 || (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6394 && TYPE_MODULAR_P (gnu_base_type
) && overflowp
))
6395 gnu_result
= emit_range_check (gnu_result
, gnat_type
);
6397 return convert (gnu_type
, gnu_result
);
6400 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6403 smaller_packable_type_p (tree type
, tree record_type
)
6407 /* We're not interested in variants here. */
6408 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (record_type
))
6411 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6412 if (TYPE_NAME (type
) != TYPE_NAME (record_type
))
6415 size
= TYPE_SIZE (type
);
6416 rsize
= TYPE_SIZE (record_type
);
6418 if (!(TREE_CODE (size
) == INTEGER_CST
&& TREE_CODE (rsize
) == INTEGER_CST
))
6421 return tree_int_cst_lt (size
, rsize
) != 0;
6424 /* Return true if GNU_EXPR can be directly addressed. This is the case
6425 unless it is an expression involving computation or if it involves a
6426 reference to a bitfield or to an object not sufficiently aligned for
6427 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6428 be directly addressed as an object of this type.
6430 *** Notes on addressability issues in the Ada compiler ***
6432 This predicate is necessary in order to bridge the gap between Gigi
6433 and the middle-end about addressability of GENERIC trees. A tree
6434 is said to be addressable if it can be directly addressed, i.e. if
6435 its address can be taken, is a multiple of the type's alignment on
6436 strict-alignment architectures and returns the first storage unit
6437 assigned to the object represented by the tree.
6439 In the C family of languages, everything is in practice addressable
6440 at the language level, except for bit-fields. This means that these
6441 compilers will take the address of any tree that doesn't represent
6442 a bit-field reference and expect the result to be the first storage
6443 unit assigned to the object. Even in cases where this will result
6444 in unaligned accesses at run time, nothing is supposed to be done
6445 and the program is considered as erroneous instead (see PR c/18287).
6447 The implicit assumptions made in the middle-end are in keeping with
6448 the C viewpoint described above:
6449 - the address of a bit-field reference is supposed to be never
6450 taken; the compiler (generally) will stop on such a construct,
6451 - any other tree is addressable if it is formally addressable,
6452 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6454 In Ada, the viewpoint is the opposite one: nothing is addressable
6455 at the language level unless explicitly declared so. This means
6456 that the compiler will both make sure that the trees representing
6457 references to addressable ("aliased" in Ada parlance) objects are
6458 addressable and make no real attempts at ensuring that the trees
6459 representing references to non-addressable objects are addressable.
6461 In the first case, Ada is effectively equivalent to C and handing
6462 down the direct result of applying ADDR_EXPR to these trees to the
6463 middle-end works flawlessly. In the second case, Ada cannot afford
6464 to consider the program as erroneous if the address of trees that
6465 are not addressable is requested for technical reasons, unlike C;
6466 as a consequence, the Ada compiler must arrange for either making
6467 sure that this address is not requested in the middle-end or for
6468 compensating by inserting temporaries if it is requested in Gigi.
6470 The first goal can be achieved because the middle-end should not
6471 request the address of non-addressable trees on its own; the only
6472 exception is for the invocation of low-level block operations like
6473 memcpy, for which the addressability requirements are lower since
6474 the type's alignment can be disregarded. In practice, this means
6475 that Gigi must make sure that such operations cannot be applied to
6476 non-BLKmode bit-fields.
6478 The second goal is achieved by means of the addressable_p predicate
6479 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6480 They will be turned during gimplification into proper temporaries
6481 whose address will be used in lieu of that of the original tree. */
6484 addressable_p (tree gnu_expr
, tree gnu_type
)
6486 /* The size of the real type of the object must not be smaller than
6487 that of the expected type, otherwise an indirect access in the
6488 latter type would be larger than the object. Only records need
6489 to be considered in practice. */
6491 && TREE_CODE (gnu_type
) == RECORD_TYPE
6492 && smaller_packable_type_p (TREE_TYPE (gnu_expr
), gnu_type
))
6495 switch (TREE_CODE (gnu_expr
))
6501 /* All DECLs are addressable: if they are in a register, we can force
6505 case UNCONSTRAINED_ARRAY_REF
:
6516 /* We accept &COND_EXPR as soon as both operands are addressable and
6517 expect the outcome to be the address of the selected operand. */
6518 return (addressable_p (TREE_OPERAND (gnu_expr
, 1), NULL_TREE
)
6519 && addressable_p (TREE_OPERAND (gnu_expr
, 2), NULL_TREE
));
6522 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr
, 1))
6523 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6524 the field is sufficiently aligned, in case it is subject
6525 to a pragma Component_Alignment. But we don't need to
6526 check the alignment of the containing record, as it is
6527 guaranteed to be not smaller than that of its most
6528 aligned field that is not a bit-field. */
6529 && (!STRICT_ALIGNMENT
6530 || DECL_ALIGN (TREE_OPERAND (gnu_expr
, 1))
6531 >= TYPE_ALIGN (TREE_TYPE (gnu_expr
))))
6532 /* The field of a padding record is always addressable. */
6533 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr
, 0))))
6534 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6536 case ARRAY_REF
: case ARRAY_RANGE_REF
:
6537 case REALPART_EXPR
: case IMAGPART_EXPR
:
6539 return addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
);
6542 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr
))
6543 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6545 case VIEW_CONVERT_EXPR
:
6547 /* This is addressable if we can avoid a copy. */
6548 tree type
= TREE_TYPE (gnu_expr
);
6549 tree inner_type
= TREE_TYPE (TREE_OPERAND (gnu_expr
, 0));
6550 return (((TYPE_MODE (type
) == TYPE_MODE (inner_type
)
6551 && (!STRICT_ALIGNMENT
6552 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6553 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
))
6554 || ((TYPE_MODE (type
) == BLKmode
6555 || TYPE_MODE (inner_type
) == BLKmode
)
6556 && (!STRICT_ALIGNMENT
6557 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6558 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
6559 || TYPE_ALIGN_OK (type
)
6560 || TYPE_ALIGN_OK (inner_type
))))
6561 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6569 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6570 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6571 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6574 process_type (Entity_Id gnat_entity
)
6577 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
6580 /* If we are to delay elaboration of this type, just do any
6581 elaborations needed for expressions within the declaration and
6582 make a dummy type entry for this node and its Full_View (if
6583 any) in case something points to it. Don't do this if it
6584 has already been done (the only way that can happen is if
6585 the private completion is also delayed). */
6586 if (Present (Freeze_Node (gnat_entity
))
6587 || (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6588 && Present (Full_View (gnat_entity
))
6589 && Freeze_Node (Full_View (gnat_entity
))
6590 && !present_gnu_tree (Full_View (gnat_entity
))))
6592 elaborate_entity (gnat_entity
);
6596 tree gnu_decl
= create_type_decl (get_entity_name (gnat_entity
),
6597 make_dummy_type (gnat_entity
),
6598 NULL
, false, false, gnat_entity
);
6600 save_gnu_tree (gnat_entity
, gnu_decl
, false);
6601 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6602 && Present (Full_View (gnat_entity
)))
6603 save_gnu_tree (Full_View (gnat_entity
), gnu_decl
, false);
6609 /* If we saved away a dummy type for this node it means that this
6610 made the type that corresponds to the full type of an incomplete
6611 type. Clear that type for now and then update the type in the
6615 gcc_assert (TREE_CODE (gnu_old
) == TYPE_DECL
6616 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
)));
6618 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
6621 /* Now fully elaborate the type. */
6622 gnu_new
= gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 1);
6623 gcc_assert (TREE_CODE (gnu_new
) == TYPE_DECL
);
6625 /* If we have an old type and we've made pointers to this type,
6626 update those pointers. */
6628 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
6629 TREE_TYPE (gnu_new
));
6631 /* If this is a record type corresponding to a task or protected type
6632 that is a completion of an incomplete type, perform a similar update
6634 /* ??? Including protected types here is a guess. */
6636 if (IN (Ekind (gnat_entity
), Record_Kind
)
6637 && Is_Concurrent_Record_Type (gnat_entity
)
6638 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
)))
6641 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
));
6643 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6645 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6648 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old
)),
6649 TREE_TYPE (gnu_new
));
6653 /* GNAT_ENTITY is the type of the resulting constructors,
6654 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
6655 and GNU_TYPE is the GCC type of the corresponding record.
6657 Return a CONSTRUCTOR to build the record. */
6660 assoc_to_constructor (Entity_Id gnat_entity
, Node_Id gnat_assoc
, tree gnu_type
)
6662 tree gnu_list
, gnu_result
;
6664 /* We test for GNU_FIELD being empty in the case where a variant
6665 was the last thing since we don't take things off GNAT_ASSOC in
6666 that case. We check GNAT_ASSOC in case we have a variant, but it
6669 for (gnu_list
= NULL_TREE
; Present (gnat_assoc
);
6670 gnat_assoc
= Next (gnat_assoc
))
6672 Node_Id gnat_field
= First (Choices (gnat_assoc
));
6673 tree gnu_field
= gnat_to_gnu_field_decl (Entity (gnat_field
));
6674 tree gnu_expr
= gnat_to_gnu (Expression (gnat_assoc
));
6676 /* The expander is supposed to put a single component selector name
6677 in every record component association */
6678 gcc_assert (No (Next (gnat_field
)));
6680 /* Ignore fields that have Corresponding_Discriminants since we'll
6681 be setting that field in the parent. */
6682 if (Present (Corresponding_Discriminant (Entity (gnat_field
)))
6683 && Is_Tagged_Type (Scope (Entity (gnat_field
))))
6686 /* Also ignore discriminants of Unchecked_Unions. */
6687 else if (Is_Unchecked_Union (gnat_entity
)
6688 && Ekind (Entity (gnat_field
)) == E_Discriminant
)
6691 /* Before assigning a value in an aggregate make sure range checks
6692 are done if required. Then convert to the type of the field. */
6693 if (Do_Range_Check (Expression (gnat_assoc
)))
6694 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_field
));
6696 gnu_expr
= convert (TREE_TYPE (gnu_field
), gnu_expr
);
6698 /* Add the field and expression to the list. */
6699 gnu_list
= tree_cons (gnu_field
, gnu_expr
, gnu_list
);
6702 gnu_result
= extract_values (gnu_list
, gnu_type
);
6704 #ifdef ENABLE_CHECKING
6708 /* Verify every entry in GNU_LIST was used. */
6709 for (gnu_field
= gnu_list
; gnu_field
; gnu_field
= TREE_CHAIN (gnu_field
))
6710 gcc_assert (TREE_ADDRESSABLE (gnu_field
));
6717 /* Builds a possibly nested constructor for array aggregates. GNAT_EXPR
6718 is the first element of an array aggregate. It may itself be an
6719 aggregate (an array or record aggregate). GNU_ARRAY_TYPE is the gnu type
6720 corresponding to the array aggregate. GNAT_COMPONENT_TYPE is the type
6721 of the array component. It is needed for range checking. */
6724 pos_to_constructor (Node_Id gnat_expr
, tree gnu_array_type
,
6725 Entity_Id gnat_component_type
)
6727 tree gnu_expr_list
= NULL_TREE
;
6728 tree gnu_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type
));
6731 for ( ; Present (gnat_expr
); gnat_expr
= Next (gnat_expr
))
6733 /* If the expression is itself an array aggregate then first build the
6734 innermost constructor if it is part of our array (multi-dimensional
6737 if (Nkind (gnat_expr
) == N_Aggregate
6738 && TREE_CODE (TREE_TYPE (gnu_array_type
)) == ARRAY_TYPE
6739 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type
)))
6740 gnu_expr
= pos_to_constructor (First (Expressions (gnat_expr
)),
6741 TREE_TYPE (gnu_array_type
),
6742 gnat_component_type
);
6745 gnu_expr
= gnat_to_gnu (gnat_expr
);
6747 /* before assigning the element to the array make sure it is
6749 if (Do_Range_Check (gnat_expr
))
6750 gnu_expr
= emit_range_check (gnu_expr
, gnat_component_type
);
6754 = tree_cons (gnu_index
, convert (TREE_TYPE (gnu_array_type
), gnu_expr
),
6757 gnu_index
= int_const_binop (PLUS_EXPR
, gnu_index
, integer_one_node
, 0);
6760 return gnat_build_constructor (gnu_array_type
, nreverse (gnu_expr_list
));
6763 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
6764 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
6765 of the associations that are from RECORD_TYPE. If we see an internal
6766 record, make a recursive call to fill it in as well. */
6769 extract_values (tree values
, tree record_type
)
6771 tree result
= NULL_TREE
;
6774 for (field
= TYPE_FIELDS (record_type
); field
; field
= TREE_CHAIN (field
))
6778 /* _Parent is an internal field, but may have values in the aggregate,
6779 so check for values first. */
6780 if ((tem
= purpose_member (field
, values
)))
6782 value
= TREE_VALUE (tem
);
6783 TREE_ADDRESSABLE (tem
) = 1;
6786 else if (DECL_INTERNAL_P (field
))
6788 value
= extract_values (values
, TREE_TYPE (field
));
6789 if (TREE_CODE (value
) == CONSTRUCTOR
6790 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (value
)))
6794 /* If we have a record subtype, the names will match, but not the
6795 actual FIELD_DECLs. */
6796 for (tem
= values
; tem
; tem
= TREE_CHAIN (tem
))
6797 if (DECL_NAME (TREE_PURPOSE (tem
)) == DECL_NAME (field
))
6799 value
= convert (TREE_TYPE (field
), TREE_VALUE (tem
));
6800 TREE_ADDRESSABLE (tem
) = 1;
6806 result
= tree_cons (field
, value
, result
);
6809 return gnat_build_constructor (record_type
, nreverse (result
));
6812 /* EXP is to be treated as an array or record. Handle the cases when it is
6813 an access object and perform the required dereferences. */
6816 maybe_implicit_deref (tree exp
)
6818 /* If the type is a pointer, dereference it. */
6820 if (POINTER_TYPE_P (TREE_TYPE (exp
)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp
)))
6821 exp
= build_unary_op (INDIRECT_REF
, NULL_TREE
, exp
);
6823 /* If we got a padded type, remove it too. */
6824 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
6825 && TYPE_IS_PADDING_P (TREE_TYPE (exp
)))
6826 exp
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp
))), exp
);
6831 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
6834 protect_multiple_eval (tree exp
)
6836 tree type
= TREE_TYPE (exp
);
6838 /* If this has no side effects, we don't need to do anything. */
6839 if (!TREE_SIDE_EFFECTS (exp
))
6842 /* If it is a conversion, protect what's inside the conversion.
6843 Similarly, if we're indirectly referencing something, we only
6844 actually need to protect the address since the data itself can't
6845 change in these situations. */
6846 else if (TREE_CODE (exp
) == NON_LVALUE_EXPR
6847 || CONVERT_EXPR_P (exp
)
6848 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
6849 || TREE_CODE (exp
) == INDIRECT_REF
6850 || TREE_CODE (exp
) == UNCONSTRAINED_ARRAY_REF
)
6851 return build1 (TREE_CODE (exp
), type
,
6852 protect_multiple_eval (TREE_OPERAND (exp
, 0)));
6854 /* If EXP is a fat pointer or something that can be placed into a register,
6855 just make a SAVE_EXPR. */
6856 if (TYPE_FAT_POINTER_P (type
) || TYPE_MODE (type
) != BLKmode
)
6857 return save_expr (exp
);
6859 /* Otherwise, dereference, protect the address, and re-reference. */
6862 build_unary_op (INDIRECT_REF
, type
,
6863 save_expr (build_unary_op (ADDR_EXPR
,
6864 build_reference_type (type
),
6868 /* This is equivalent to stabilize_reference in tree.c, but we know how to
6869 handle our own nodes and we take extra arguments. FORCE says whether to
6870 force evaluation of everything. We set SUCCESS to true unless we walk
6871 through something we don't know how to stabilize. */
6874 maybe_stabilize_reference (tree ref
, bool force
, bool *success
)
6876 tree type
= TREE_TYPE (ref
);
6877 enum tree_code code
= TREE_CODE (ref
);
6880 /* Assume we'll success unless proven otherwise. */
6889 /* No action is needed in this case. */
6895 case FIX_TRUNC_EXPR
:
6896 case VIEW_CONVERT_EXPR
:
6898 = build1 (code
, type
,
6899 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6904 case UNCONSTRAINED_ARRAY_REF
:
6905 result
= build1 (code
, type
,
6906 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 0),
6911 result
= build3 (COMPONENT_REF
, type
,
6912 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6914 TREE_OPERAND (ref
, 1), NULL_TREE
);
6918 result
= build3 (BIT_FIELD_REF
, type
,
6919 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6921 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
6923 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 2),
6928 case ARRAY_RANGE_REF
:
6929 result
= build4 (code
, type
,
6930 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6932 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
6934 NULL_TREE
, NULL_TREE
);
6938 result
= gnat_stabilize_reference_1 (ref
, force
);
6942 /* This generates better code than the scheme in protect_multiple_eval
6943 because large objects will be returned via invisible reference in
6944 most ABIs so the temporary will directly be filled by the callee. */
6945 result
= gnat_stabilize_reference_1 (ref
, force
);
6949 /* Constructors with 1 element are used extensively to formally
6950 convert objects to special wrapping types. */
6951 if (TREE_CODE (type
) == RECORD_TYPE
6952 && VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (ref
)) == 1)
6955 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->index
;
6957 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->value
;
6959 = build_constructor_single (type
, index
,
6960 gnat_stabilize_reference_1 (value
,
6971 ref
= error_mark_node
;
6973 /* ... Fallthru to failure ... */
6975 /* If arg isn't a kind of lvalue we recognize, make no change.
6976 Caller should recognize the error for an invalid lvalue. */
6982 TREE_READONLY (result
) = TREE_READONLY (ref
);
6984 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
6985 expression may not be sustained across some paths, such as the way via
6986 build1 for INDIRECT_REF. We re-populate those flags here for the general
6987 case, which is consistent with the GCC version of this routine.
6989 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
6990 paths introduce side effects where there was none initially (e.g. calls
6991 to save_expr), and we also want to keep track of that. */
6993 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
6994 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (ref
);
6999 /* Wrapper around maybe_stabilize_reference, for common uses without
7000 lvalue restrictions and without need to examine the success
7004 gnat_stabilize_reference (tree ref
, bool force
)
7007 return maybe_stabilize_reference (ref
, force
, &dummy
);
7010 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7011 arg to force a SAVE_EXPR for everything. */
7014 gnat_stabilize_reference_1 (tree e
, bool force
)
7016 enum tree_code code
= TREE_CODE (e
);
7017 tree type
= TREE_TYPE (e
);
7020 /* We cannot ignore const expressions because it might be a reference
7021 to a const array but whose index contains side-effects. But we can
7022 ignore things that are actual constant or that already have been
7023 handled by this function. */
7025 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
7028 switch (TREE_CODE_CLASS (code
))
7030 case tcc_exceptional
:
7032 case tcc_declaration
:
7033 case tcc_comparison
:
7035 case tcc_expression
:
7038 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7039 fat pointer. This may be more efficient, but will also allow
7040 us to more easily find the match for the PLACEHOLDER_EXPR. */
7041 if (code
== COMPONENT_REF
7042 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e
, 0))))
7043 result
= build3 (COMPONENT_REF
, type
,
7044 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7046 TREE_OPERAND (e
, 1), TREE_OPERAND (e
, 2));
7047 else if (TREE_SIDE_EFFECTS (e
) || force
)
7048 return save_expr (e
);
7054 /* Constants need no processing. In fact, we should never reach
7059 /* Recursively stabilize each operand. */
7060 result
= build2 (code
, type
,
7061 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0), force
),
7062 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 1),
7067 /* Recursively stabilize each operand. */
7068 result
= build1 (code
, type
,
7069 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7077 TREE_READONLY (result
) = TREE_READONLY (e
);
7079 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
7080 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (e
);
7084 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7085 location and false if it doesn't. In the former case, set the Gigi global
7086 variable REF_FILENAME to the simple debug file name as given by sinput. */
7089 Sloc_to_locus (Source_Ptr Sloc
, location_t
*locus
)
7091 if (Sloc
== No_Location
)
7094 if (Sloc
<= Standard_Location
)
7096 if (*locus
== UNKNOWN_LOCATION
)
7097 *locus
= BUILTINS_LOCATION
;
7102 Source_File_Index file
= Get_Source_File_Index (Sloc
);
7103 Logical_Line_Number line
= Get_Logical_Line_Number (Sloc
);
7104 Column_Number column
= Get_Column_Number (Sloc
);
7105 struct line_map
*map
= &line_table
->maps
[file
- 1];
7107 /* Translate the location according to the line-map.h formula. */
7108 *locus
= map
->start_location
7109 + ((line
- map
->to_line
) << map
->column_bits
)
7110 + (column
& ((1 << map
->column_bits
) - 1));
7114 = IDENTIFIER_POINTER
7116 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc
)))));;
7121 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7122 don't do anything if it doesn't correspond to a source location. */
7125 set_expr_location_from_node (tree node
, Node_Id gnat_node
)
7129 if (!Sloc_to_locus (Sloc (gnat_node
), &locus
))
7132 SET_EXPR_LOCATION (node
, locus
);
7135 /* Return a colon-separated list of encodings contained in encoded Ada
7139 extract_encoding (const char *name
)
7141 char *encoding
= GGC_NEWVEC (char, strlen (name
));
7143 get_encoding (name
, encoding
);
7148 /* Extract the Ada name from an encoded name. */
7151 decode_name (const char *name
)
7153 char *decoded
= GGC_NEWVEC (char, strlen (name
) * 2 + 60);
7155 __gnat_decode (name
, decoded
, 0);
7160 /* Post an error message. MSG is the error message, properly annotated.
7161 NODE is the node at which to post the error and the node to use for the
7162 "&" substitution. */
7165 post_error (const char *msg
, Node_Id node
)
7167 String_Template temp
;
7170 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7171 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7173 Error_Msg_N (fp
, node
);
7176 /* Similar, but NODE is the node at which to post the error and ENT
7177 is the node to use for the "&" substitution. */
7180 post_error_ne (const char *msg
, Node_Id node
, Entity_Id ent
)
7182 String_Template temp
;
7185 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7186 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7188 Error_Msg_NE (fp
, node
, ent
);
7191 /* Similar, but NODE is the node at which to post the error, ENT is the node
7192 to use for the "&" substitution, and N is the number to use for the ^. */
7195 post_error_ne_num (const char *msg
, Node_Id node
, Entity_Id ent
, int n
)
7197 String_Template temp
;
7200 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7201 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7202 Error_Msg_Uint_1
= UI_From_Int (n
);
7205 Error_Msg_NE (fp
, node
, ent
);
7208 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7209 number to write. If the tree represents a constant that fits within
7210 a host integer, the text inside curly brackets in MSG will be output
7211 (presumably including a '^'). Otherwise that text will not be output
7212 and the text inside square brackets will be output instead. */
7215 post_error_ne_tree (const char *msg
, Node_Id node
, Entity_Id ent
, tree t
)
7217 char *newmsg
= XALLOCAVEC (char, strlen (msg
) + 1);
7218 String_Template temp
= {1, 0};
7220 char start_yes
, end_yes
, start_no
, end_no
;
7224 fp
.Array
= newmsg
, fp
.Bounds
= &temp
;
7226 if (host_integerp (t
, 1)
7227 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7230 (t
, (((unsigned HOST_WIDE_INT
) 1 << (HOST_BITS_PER_INT
- 1)) - 1)) < 0
7234 Error_Msg_Uint_1
= UI_From_Int (tree_low_cst (t
, 1));
7235 start_yes
= '{', end_yes
= '}', start_no
= '[', end_no
= ']';
7238 start_yes
= '[', end_yes
= ']', start_no
= '{', end_no
= '}';
7240 for (p
= msg
, q
= newmsg
; *p
; p
++)
7242 if (*p
== start_yes
)
7243 for (p
++; *p
!= end_yes
; p
++)
7245 else if (*p
== start_no
)
7246 for (p
++; *p
!= end_no
; p
++)
7254 temp
.High_Bound
= strlen (newmsg
);
7256 Error_Msg_NE (fp
, node
, ent
);
7259 /* Similar to post_error_ne_tree, except that NUM is a second
7260 integer to write in the message. */
7263 post_error_ne_tree_2 (const char *msg
,
7269 Error_Msg_Uint_2
= UI_From_Int (num
);
7270 post_error_ne_tree (msg
, node
, ent
, t
);
7273 /* Initialize the table that maps GNAT codes to GCC codes for simple
7274 binary and unary operations. */
7277 init_code_table (void)
7279 gnu_codes
[N_And_Then
] = TRUTH_ANDIF_EXPR
;
7280 gnu_codes
[N_Or_Else
] = TRUTH_ORIF_EXPR
;
7282 gnu_codes
[N_Op_And
] = TRUTH_AND_EXPR
;
7283 gnu_codes
[N_Op_Or
] = TRUTH_OR_EXPR
;
7284 gnu_codes
[N_Op_Xor
] = TRUTH_XOR_EXPR
;
7285 gnu_codes
[N_Op_Eq
] = EQ_EXPR
;
7286 gnu_codes
[N_Op_Ne
] = NE_EXPR
;
7287 gnu_codes
[N_Op_Lt
] = LT_EXPR
;
7288 gnu_codes
[N_Op_Le
] = LE_EXPR
;
7289 gnu_codes
[N_Op_Gt
] = GT_EXPR
;
7290 gnu_codes
[N_Op_Ge
] = GE_EXPR
;
7291 gnu_codes
[N_Op_Add
] = PLUS_EXPR
;
7292 gnu_codes
[N_Op_Subtract
] = MINUS_EXPR
;
7293 gnu_codes
[N_Op_Multiply
] = MULT_EXPR
;
7294 gnu_codes
[N_Op_Mod
] = FLOOR_MOD_EXPR
;
7295 gnu_codes
[N_Op_Rem
] = TRUNC_MOD_EXPR
;
7296 gnu_codes
[N_Op_Minus
] = NEGATE_EXPR
;
7297 gnu_codes
[N_Op_Abs
] = ABS_EXPR
;
7298 gnu_codes
[N_Op_Not
] = TRUTH_NOT_EXPR
;
7299 gnu_codes
[N_Op_Rotate_Left
] = LROTATE_EXPR
;
7300 gnu_codes
[N_Op_Rotate_Right
] = RROTATE_EXPR
;
7301 gnu_codes
[N_Op_Shift_Left
] = LSHIFT_EXPR
;
7302 gnu_codes
[N_Op_Shift_Right
] = RSHIFT_EXPR
;
7303 gnu_codes
[N_Op_Shift_Right_Arithmetic
] = RSHIFT_EXPR
;
7306 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7310 get_exception_label (char kind
)
7312 if (kind
== N_Raise_Constraint_Error
)
7313 return TREE_VALUE (gnu_constraint_error_label_stack
);
7314 else if (kind
== N_Raise_Storage_Error
)
7315 return TREE_VALUE (gnu_storage_error_label_stack
);
7316 else if (kind
== N_Raise_Program_Error
)
7317 return TREE_VALUE (gnu_program_error_label_stack
);
7322 #include "gt-ada-trans.h"