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. Note that the
1291 comparison must be done in the original index base type,
1292 otherwise the conversion of either bound to gnu_compute_type
1295 tree gnu_compute_type
= get_base_type (gnu_result_type
);
1298 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
1300 = convert (gnu_compute_type
, TYPE_MIN_VALUE (index_type
));
1302 = convert (gnu_compute_type
, TYPE_MAX_VALUE (index_type
));
1306 (COND_EXPR
, gnu_compute_type
,
1307 build_binary_op (LT_EXPR
, get_base_type (index_type
),
1308 TYPE_MAX_VALUE (index_type
),
1309 TYPE_MIN_VALUE (index_type
)),
1310 convert (gnu_compute_type
, integer_zero_node
),
1312 (PLUS_EXPR
, gnu_compute_type
,
1313 build_binary_op (MINUS_EXPR
, gnu_compute_type
, hb
, lb
),
1314 convert (gnu_compute_type
, integer_one_node
)));
1318 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
1319 handling. Note that these attributes could not have been used on
1320 an unconstrained array type. */
1321 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
,
1324 /* Cache the expression we have just computed. Since we want to do it
1325 at runtime, we force the use of a SAVE_EXPR and let the gimplifier
1326 create the temporary. */
1330 = build1 (SAVE_EXPR
, TREE_TYPE (gnu_result
), gnu_result
);
1331 TREE_SIDE_EFFECTS (gnu_result
) = 1;
1332 if (attribute
== Attr_First
)
1333 pa
->first
= gnu_result
;
1334 else if (attribute
== Attr_Last
)
1335 pa
->last
= gnu_result
;
1337 pa
->length
= gnu_result
;
1342 case Attr_Bit_Position
:
1344 case Attr_First_Bit
:
1348 HOST_WIDE_INT bitsize
;
1349 HOST_WIDE_INT bitpos
;
1351 tree gnu_field_bitpos
;
1352 tree gnu_field_offset
;
1354 enum machine_mode mode
;
1355 int unsignedp
, volatilep
;
1357 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1358 gnu_prefix
= remove_conversions (gnu_prefix
, true);
1359 prefix_unused
= true;
1361 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
1362 the result is 0. Don't allow 'Bit on a bare component, though. */
1363 if (attribute
== Attr_Bit
1364 && TREE_CODE (gnu_prefix
) != COMPONENT_REF
1365 && TREE_CODE (gnu_prefix
) != FIELD_DECL
)
1367 gnu_result
= integer_zero_node
;
1372 gcc_assert (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1373 || (attribute
== Attr_Bit_Position
1374 && TREE_CODE (gnu_prefix
) == FIELD_DECL
));
1376 get_inner_reference (gnu_prefix
, &bitsize
, &bitpos
, &gnu_offset
,
1377 &mode
, &unsignedp
, &volatilep
, false);
1379 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
)
1381 gnu_field_bitpos
= bit_position (TREE_OPERAND (gnu_prefix
, 1));
1382 gnu_field_offset
= byte_position (TREE_OPERAND (gnu_prefix
, 1));
1384 for (gnu_inner
= TREE_OPERAND (gnu_prefix
, 0);
1385 TREE_CODE (gnu_inner
) == COMPONENT_REF
1386 && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner
, 1));
1387 gnu_inner
= TREE_OPERAND (gnu_inner
, 0))
1390 = size_binop (PLUS_EXPR
, gnu_field_bitpos
,
1391 bit_position (TREE_OPERAND (gnu_inner
, 1)));
1393 = size_binop (PLUS_EXPR
, gnu_field_offset
,
1394 byte_position (TREE_OPERAND (gnu_inner
, 1)));
1397 else if (TREE_CODE (gnu_prefix
) == FIELD_DECL
)
1399 gnu_field_bitpos
= bit_position (gnu_prefix
);
1400 gnu_field_offset
= byte_position (gnu_prefix
);
1404 gnu_field_bitpos
= bitsize_zero_node
;
1405 gnu_field_offset
= size_zero_node
;
1411 gnu_result
= gnu_field_offset
;
1414 case Attr_First_Bit
:
1416 gnu_result
= size_int (bitpos
% BITS_PER_UNIT
);
1420 gnu_result
= bitsize_int (bitpos
% BITS_PER_UNIT
);
1421 gnu_result
= size_binop (PLUS_EXPR
, gnu_result
,
1422 TYPE_SIZE (TREE_TYPE (gnu_prefix
)));
1423 gnu_result
= size_binop (MINUS_EXPR
, gnu_result
,
1427 case Attr_Bit_Position
:
1428 gnu_result
= gnu_field_bitpos
;
1432 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1434 gnu_result
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result
, gnu_prefix
);
1441 tree gnu_lhs
= gnat_to_gnu (First (Expressions (gnat_node
)));
1442 tree gnu_rhs
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
1444 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1445 gnu_result
= build_binary_op (attribute
== Attr_Min
1446 ? MIN_EXPR
: MAX_EXPR
,
1447 gnu_result_type
, gnu_lhs
, gnu_rhs
);
1451 case Attr_Passed_By_Reference
:
1452 gnu_result
= size_int (default_pass_by_ref (gnu_type
)
1453 || must_pass_by_ref (gnu_type
));
1454 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1457 case Attr_Component_Size
:
1458 if (TREE_CODE (gnu_prefix
) == COMPONENT_REF
1459 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))
1461 && (TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix
, 0)))))
1462 gnu_prefix
= TREE_OPERAND (gnu_prefix
, 0);
1464 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
1465 gnu_type
= TREE_TYPE (gnu_prefix
);
1467 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
1468 gnu_type
= TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type
))));
1470 while (TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
1471 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
)))
1472 gnu_type
= TREE_TYPE (gnu_type
);
1474 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
1476 /* Note this size cannot be self-referential. */
1477 gnu_result
= TYPE_SIZE (TREE_TYPE (gnu_type
));
1478 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1479 prefix_unused
= true;
1482 case Attr_Null_Parameter
:
1483 /* This is just a zero cast to the pointer type for
1484 our prefix and dereferenced. */
1485 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1487 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
1488 convert (build_pointer_type (gnu_result_type
),
1489 integer_zero_node
));
1490 TREE_PRIVATE (gnu_result
) = 1;
1493 case Attr_Mechanism_Code
:
1496 Entity_Id gnat_obj
= Entity (Prefix (gnat_node
));
1498 prefix_unused
= true;
1499 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1500 if (Present (Expressions (gnat_node
)))
1502 int i
= UI_To_Int (Intval (First (Expressions (gnat_node
))));
1504 for (gnat_obj
= First_Formal (gnat_obj
); i
> 1;
1505 i
--, gnat_obj
= Next_Formal (gnat_obj
))
1509 code
= Mechanism (gnat_obj
);
1510 if (code
== Default
)
1511 code
= ((present_gnu_tree (gnat_obj
)
1512 && (DECL_BY_REF_P (get_gnu_tree (gnat_obj
))
1513 || ((TREE_CODE (get_gnu_tree (gnat_obj
))
1515 && (DECL_BY_COMPONENT_PTR_P
1516 (get_gnu_tree (gnat_obj
))))))
1517 ? By_Reference
: By_Copy
);
1518 gnu_result
= convert (gnu_result_type
, size_int (- code
));
1523 /* Say we have an unimplemented attribute. Then set the value to be
1524 returned to be a zero and hope that's something we can convert to the
1525 type of this attribute. */
1526 post_error ("unimplemented attribute", gnat_node
);
1527 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
1528 gnu_result
= integer_zero_node
;
1532 /* If this is an attribute where the prefix was unused, force a use of it if
1533 it has a side-effect. But don't do it if the prefix is just an entity
1534 name. However, if an access check is needed, we must do it. See second
1535 example in AARM 11.6(5.e). */
1536 if (prefix_unused
&& TREE_SIDE_EFFECTS (gnu_prefix
)
1537 && !Is_Entity_Name (Prefix (gnat_node
)))
1538 gnu_result
= fold_build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_result
),
1539 gnu_prefix
, gnu_result
);
1541 *gnu_result_type_p
= gnu_result_type
;
1545 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
1546 to a GCC tree, which is returned. */
1549 Case_Statement_to_gnu (Node_Id gnat_node
)
1555 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
1556 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1558 /* The range of values in a case statement is determined by the rules in
1559 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
1560 of the expression. One exception arises in the case of a simple name that
1561 is parenthesized. This still has the Etype of the name, but since it is
1562 not a name, para 7 does not apply, and we need to go to the base type.
1563 This is the only case where parenthesization affects the dynamic
1564 semantics (i.e. the range of possible values at runtime that is covered
1565 by the others alternative.
1567 Another exception is if the subtype of the expression is non-static. In
1568 that case, we also have to use the base type. */
1569 if (Paren_Count (Expression (gnat_node
)) != 0
1570 || !Is_OK_Static_Subtype (Underlying_Type
1571 (Etype (Expression (gnat_node
)))))
1572 gnu_expr
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
1574 /* We build a SWITCH_EXPR that contains the code with interspersed
1575 CASE_LABEL_EXPRs for each label. */
1577 push_stack (&gnu_switch_label_stack
, NULL_TREE
, create_artificial_label ());
1578 start_stmt_group ();
1579 for (gnat_when
= First_Non_Pragma (Alternatives (gnat_node
));
1580 Present (gnat_when
);
1581 gnat_when
= Next_Non_Pragma (gnat_when
))
1583 Node_Id gnat_choice
;
1584 int choices_added
= 0;
1586 /* First compile all the different case choices for the current WHEN
1588 for (gnat_choice
= First (Discrete_Choices (gnat_when
));
1589 Present (gnat_choice
); gnat_choice
= Next (gnat_choice
))
1591 tree gnu_low
= NULL_TREE
, gnu_high
= NULL_TREE
;
1593 switch (Nkind (gnat_choice
))
1596 gnu_low
= gnat_to_gnu (Low_Bound (gnat_choice
));
1597 gnu_high
= gnat_to_gnu (High_Bound (gnat_choice
));
1600 case N_Subtype_Indication
:
1601 gnu_low
= gnat_to_gnu (Low_Bound (Range_Expression
1602 (Constraint (gnat_choice
))));
1603 gnu_high
= gnat_to_gnu (High_Bound (Range_Expression
1604 (Constraint (gnat_choice
))));
1608 case N_Expanded_Name
:
1609 /* This represents either a subtype range or a static value of
1610 some kind; Ekind says which. */
1611 if (IN (Ekind (Entity (gnat_choice
)), Type_Kind
))
1613 tree gnu_type
= get_unpadded_type (Entity (gnat_choice
));
1615 gnu_low
= fold (TYPE_MIN_VALUE (gnu_type
));
1616 gnu_high
= fold (TYPE_MAX_VALUE (gnu_type
));
1620 /* ... fall through ... */
1622 case N_Character_Literal
:
1623 case N_Integer_Literal
:
1624 gnu_low
= gnat_to_gnu (gnat_choice
);
1627 case N_Others_Choice
:
1634 /* If the case value is a subtype that raises Constraint_Error at
1635 run-time because of a wrong bound, then gnu_low or gnu_high is
1636 not translated into an INTEGER_CST. In such a case, we need
1637 to ensure that the when statement is not added in the tree,
1638 otherwise it will crash the gimplifier. */
1639 if ((!gnu_low
|| TREE_CODE (gnu_low
) == INTEGER_CST
)
1640 && (!gnu_high
|| TREE_CODE (gnu_high
) == INTEGER_CST
))
1642 add_stmt_with_node (build3 (CASE_LABEL_EXPR
, void_type_node
,
1644 create_artificial_label ()),
1650 /* Push a binding level here in case variables are declared as we want
1651 them to be local to this set of statements instead of to the block
1652 containing the Case statement. */
1653 if (choices_added
> 0)
1655 add_stmt (build_stmt_group (Statements (gnat_when
), true));
1656 add_stmt (build1 (GOTO_EXPR
, void_type_node
,
1657 TREE_VALUE (gnu_switch_label_stack
)));
1661 /* Now emit a definition of the label all the cases branched to. */
1662 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
1663 TREE_VALUE (gnu_switch_label_stack
)));
1664 gnu_result
= build3 (SWITCH_EXPR
, TREE_TYPE (gnu_expr
), gnu_expr
,
1665 end_stmt_group (), NULL_TREE
);
1666 pop_stack (&gnu_switch_label_stack
);
1671 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
1672 to a GCC tree, which is returned. */
1675 Loop_Statement_to_gnu (Node_Id gnat_node
)
1677 /* ??? It would be nice to use "build" here, but there's no build5. */
1678 tree gnu_loop_stmt
= build_nt (LOOP_STMT
, NULL_TREE
, NULL_TREE
,
1679 NULL_TREE
, NULL_TREE
, NULL_TREE
);
1680 tree gnu_loop_var
= NULL_TREE
;
1681 Node_Id gnat_iter_scheme
= Iteration_Scheme (gnat_node
);
1682 tree gnu_cond_expr
= NULL_TREE
;
1685 TREE_TYPE (gnu_loop_stmt
) = void_type_node
;
1686 TREE_SIDE_EFFECTS (gnu_loop_stmt
) = 1;
1687 LOOP_STMT_LABEL (gnu_loop_stmt
) = create_artificial_label ();
1688 set_expr_location_from_node (gnu_loop_stmt
, gnat_node
);
1689 Sloc_to_locus (Sloc (End_Label (gnat_node
)),
1690 &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt
)));
1692 /* Save the end label of this LOOP_STMT in a stack so that the corresponding
1693 N_Exit_Statement can find it. */
1694 push_stack (&gnu_loop_label_stack
, NULL_TREE
,
1695 LOOP_STMT_LABEL (gnu_loop_stmt
));
1697 /* Set the condition under which the loop must keep going.
1698 For the case "LOOP .... END LOOP;" the condition is always true. */
1699 if (No (gnat_iter_scheme
))
1702 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
1703 else if (Present (Condition (gnat_iter_scheme
)))
1704 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1705 = gnat_to_gnu (Condition (gnat_iter_scheme
));
1707 /* Otherwise we have an iteration scheme and the condition is given by
1708 the bounds of the subtype of the iteration variable. */
1711 Node_Id gnat_loop_spec
= Loop_Parameter_Specification (gnat_iter_scheme
);
1712 Entity_Id gnat_loop_var
= Defining_Entity (gnat_loop_spec
);
1713 Entity_Id gnat_type
= Etype (gnat_loop_var
);
1714 tree gnu_type
= get_unpadded_type (gnat_type
);
1715 tree gnu_low
= TYPE_MIN_VALUE (gnu_type
);
1716 tree gnu_high
= TYPE_MAX_VALUE (gnu_type
);
1717 bool reversep
= Reverse_Present (gnat_loop_spec
);
1718 tree gnu_first
= reversep
? gnu_high
: gnu_low
;
1719 tree gnu_last
= reversep
? gnu_low
: gnu_high
;
1720 enum tree_code end_code
= reversep
? GE_EXPR
: LE_EXPR
;
1721 tree gnu_base_type
= get_base_type (gnu_type
);
1722 tree gnu_limit
= (reversep
? TYPE_MIN_VALUE (gnu_base_type
)
1723 : TYPE_MAX_VALUE (gnu_base_type
));
1725 /* We know the loop variable will not overflow if GNU_LAST is a constant
1726 and is not equal to GNU_LIMIT. If it might overflow, we have to move
1727 the limit test to the end of the loop. In that case, we have to test
1728 for an empty loop outside the loop. */
1729 if (TREE_CODE (gnu_last
) != INTEGER_CST
1730 || TREE_CODE (gnu_limit
) != INTEGER_CST
1731 || tree_int_cst_equal (gnu_last
, gnu_limit
))
1734 = build3 (COND_EXPR
, void_type_node
,
1735 build_binary_op (LE_EXPR
, integer_type_node
,
1737 NULL_TREE
, alloc_stmt_list ());
1738 set_expr_location_from_node (gnu_cond_expr
, gnat_loop_spec
);
1741 /* Open a new nesting level that will surround the loop to declare the
1742 loop index variable. */
1743 start_stmt_group ();
1746 /* Declare the loop index and set it to its initial value. */
1747 gnu_loop_var
= gnat_to_gnu_entity (gnat_loop_var
, gnu_first
, 1);
1748 if (DECL_BY_REF_P (gnu_loop_var
))
1749 gnu_loop_var
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_loop_var
);
1751 /* The loop variable might be a padded type, so use `convert' to get a
1752 reference to the inner variable if so. */
1753 gnu_loop_var
= convert (get_base_type (gnu_type
), gnu_loop_var
);
1755 /* Set either the top or bottom exit condition as appropriate depending
1756 on whether or not we know an overflow cannot occur. */
1758 LOOP_STMT_BOT_COND (gnu_loop_stmt
)
1759 = build_binary_op (NE_EXPR
, integer_type_node
,
1760 gnu_loop_var
, gnu_last
);
1762 LOOP_STMT_TOP_COND (gnu_loop_stmt
)
1763 = build_binary_op (end_code
, integer_type_node
,
1764 gnu_loop_var
, gnu_last
);
1766 LOOP_STMT_UPDATE (gnu_loop_stmt
)
1767 = build_binary_op (reversep
? PREDECREMENT_EXPR
1768 : PREINCREMENT_EXPR
,
1769 TREE_TYPE (gnu_loop_var
),
1771 convert (TREE_TYPE (gnu_loop_var
),
1773 set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt
),
1777 /* If the loop was named, have the name point to this loop. In this case,
1778 the association is not a ..._DECL node, but the end label from this
1780 if (Present (Identifier (gnat_node
)))
1781 save_gnu_tree (Entity (Identifier (gnat_node
)),
1782 LOOP_STMT_LABEL (gnu_loop_stmt
), true);
1784 /* Make the loop body into its own block, so any allocated storage will be
1785 released every iteration. This is needed for stack allocation. */
1786 LOOP_STMT_BODY (gnu_loop_stmt
)
1787 = build_stmt_group (Statements (gnat_node
), true);
1789 /* If we declared a variable, then we are in a statement group for that
1790 declaration. Add the LOOP_STMT to it and make that the "loop". */
1793 add_stmt (gnu_loop_stmt
);
1795 gnu_loop_stmt
= end_stmt_group ();
1798 /* If we have an outer COND_EXPR, that's our result and this loop is its
1799 "true" statement. Otherwise, the result is the LOOP_STMT. */
1802 COND_EXPR_THEN (gnu_cond_expr
) = gnu_loop_stmt
;
1803 gnu_result
= gnu_cond_expr
;
1804 recalculate_side_effects (gnu_cond_expr
);
1807 gnu_result
= gnu_loop_stmt
;
1809 pop_stack (&gnu_loop_label_stack
);
1814 /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition
1815 handler for the current function. */
1817 /* This is implemented by issuing a call to the appropriate VMS specific
1818 builtin. To avoid having VMS specific sections in the global gigi decls
1819 array, we maintain the decls of interest here. We can't declare them
1820 inside the function because we must mark them never to be GC'd, which we
1821 can only do at the global level. */
1823 static GTY(()) tree vms_builtin_establish_handler_decl
= NULL_TREE
;
1824 static GTY(()) tree gnat_vms_condition_handler_decl
= NULL_TREE
;
1827 establish_gnat_vms_condition_handler (void)
1829 tree establish_stmt
;
1831 /* Elaborate the required decls on the first call. Check on the decl for
1832 the gnat condition handler to decide, as this is one we create so we are
1833 sure that it will be non null on subsequent calls. The builtin decl is
1834 looked up so remains null on targets where it is not implemented yet. */
1835 if (gnat_vms_condition_handler_decl
== NULL_TREE
)
1837 vms_builtin_establish_handler_decl
1839 (get_identifier ("__builtin_establish_vms_condition_handler"));
1841 gnat_vms_condition_handler_decl
1842 = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"),
1844 build_function_type_list (integer_type_node
,
1848 NULL_TREE
, 0, 1, 1, 0, Empty
);
1851 /* Do nothing if the establish builtin is not available, which might happen
1852 on targets where the facility is not implemented. */
1853 if (vms_builtin_establish_handler_decl
== NULL_TREE
)
1857 = build_call_1_expr (vms_builtin_establish_handler_decl
,
1859 (ADDR_EXPR
, NULL_TREE
,
1860 gnat_vms_condition_handler_decl
));
1862 add_stmt (establish_stmt
);
1865 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
1866 don't return anything. */
1869 Subprogram_Body_to_gnu (Node_Id gnat_node
)
1871 /* Defining identifier of a parameter to the subprogram. */
1872 Entity_Id gnat_param
;
1873 /* The defining identifier for the subprogram body. Note that if a
1874 specification has appeared before for this body, then the identifier
1875 occurring in that specification will also be a defining identifier and all
1876 the calls to this subprogram will point to that specification. */
1877 Entity_Id gnat_subprog_id
1878 = (Present (Corresponding_Spec (gnat_node
))
1879 ? Corresponding_Spec (gnat_node
) : Defining_Entity (gnat_node
));
1880 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
1881 tree gnu_subprog_decl
;
1882 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
1883 tree gnu_subprog_type
;
1886 VEC(parm_attr
,gc
) *cache
;
1888 /* If this is a generic object or if it has been eliminated,
1890 if (Ekind (gnat_subprog_id
) == E_Generic_Procedure
1891 || Ekind (gnat_subprog_id
) == E_Generic_Function
1892 || Is_Eliminated (gnat_subprog_id
))
1895 /* If this subprogram acts as its own spec, define it. Otherwise, just get
1896 the already-elaborated tree node. However, if this subprogram had its
1897 elaboration deferred, we will already have made a tree node for it. So
1898 treat it as not being defined in that case. Such a subprogram cannot
1899 have an address clause or a freeze node, so this test is safe, though it
1900 does disable some otherwise-useful error checking. */
1902 = gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
,
1903 Acts_As_Spec (gnat_node
)
1904 && !present_gnu_tree (gnat_subprog_id
));
1906 gnu_subprog_type
= TREE_TYPE (gnu_subprog_decl
);
1908 /* Propagate the debug mode. */
1909 if (!Needs_Debug_Info (gnat_subprog_id
))
1910 DECL_IGNORED_P (gnu_subprog_decl
) = 1;
1912 /* Set the line number in the decl to correspond to that of the body so that
1913 the line number notes are written correctly. */
1914 Sloc_to_locus (Sloc (gnat_node
), &DECL_SOURCE_LOCATION (gnu_subprog_decl
));
1916 /* Initialize the information structure for the function. */
1917 allocate_struct_function (gnu_subprog_decl
, false);
1918 DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
1919 = GGC_CNEW (struct language_function
);
1921 begin_subprog_body (gnu_subprog_decl
);
1922 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
1924 /* If there are Out parameters, we need to ensure that the return statement
1925 properly copies them out. We do this by making a new block and converting
1926 any inner return into a goto to a label at the end of the block. */
1927 push_stack (&gnu_return_label_stack
, NULL_TREE
,
1928 gnu_cico_list
? create_artificial_label () : NULL_TREE
);
1930 /* Get a tree corresponding to the code for the subprogram. */
1931 start_stmt_group ();
1934 /* See if there are any parameters for which we don't yet have GCC entities.
1935 These must be for Out parameters for which we will be making VAR_DECL
1936 nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty
1937 entry as well. We can match up the entries because TYPE_CI_CO_LIST is in
1938 the order of the parameters. */
1939 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
1940 Present (gnat_param
);
1941 gnat_param
= Next_Formal_With_Extras (gnat_param
))
1942 if (!present_gnu_tree (gnat_param
))
1944 /* Skip any entries that have been already filled in; they must
1945 correspond to In Out parameters. */
1946 for (; gnu_cico_list
&& TREE_VALUE (gnu_cico_list
);
1947 gnu_cico_list
= TREE_CHAIN (gnu_cico_list
))
1950 /* Do any needed references for padded types. */
1951 TREE_VALUE (gnu_cico_list
)
1952 = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list
)),
1953 gnat_to_gnu_entity (gnat_param
, NULL_TREE
, 1));
1956 /* On VMS, establish our condition handler to possibly turn a condition into
1957 the corresponding exception if the subprogram has a foreign convention or
1960 To ensure proper execution of local finalizations on condition instances,
1961 we must turn a condition into the corresponding exception even if there
1962 is no applicable Ada handler, and need at least one condition handler per
1963 possible call chain involving GNAT code. OTOH, establishing the handler
1964 has a cost so we want to minimize the number of subprograms into which
1965 this happens. The foreign or exported condition is expected to satisfy
1966 all the constraints. */
1967 if (TARGET_ABI_OPEN_VMS
1968 && (Has_Foreign_Convention (gnat_node
) || Is_Exported (gnat_node
)))
1969 establish_gnat_vms_condition_handler ();
1971 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
1973 /* Generate the code of the subprogram itself. A return statement will be
1974 present and any Out parameters will be handled there. */
1975 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
1977 gnu_result
= end_stmt_group ();
1979 /* If we populated the parameter attributes cache, we need to make sure
1980 that the cached expressions are evaluated on all possible paths. */
1981 cache
= DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->language
->parm_attr_cache
;
1984 struct parm_attr
*pa
;
1987 start_stmt_group ();
1989 for (i
= 0; VEC_iterate (parm_attr
, cache
, i
, pa
); i
++)
1992 add_stmt_with_node (pa
->first
, gnat_node
);
1994 add_stmt_with_node (pa
->last
, gnat_node
);
1996 add_stmt_with_node (pa
->length
, gnat_node
);
1999 add_stmt (gnu_result
);
2000 gnu_result
= end_stmt_group ();
2003 /* If we made a special return label, we need to make a block that contains
2004 the definition of that label and the copying to the return value. That
2005 block first contains the function, then the label and copy statement. */
2006 if (TREE_VALUE (gnu_return_label_stack
))
2010 start_stmt_group ();
2012 add_stmt (gnu_result
);
2013 add_stmt (build1 (LABEL_EXPR
, void_type_node
,
2014 TREE_VALUE (gnu_return_label_stack
)));
2016 gnu_cico_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2017 if (list_length (gnu_cico_list
) == 1)
2018 gnu_retval
= TREE_VALUE (gnu_cico_list
);
2020 gnu_retval
= gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
2023 if (DECL_P (gnu_retval
) && DECL_BY_REF_P (gnu_retval
))
2024 gnu_retval
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_retval
);
2027 (build_return_expr (DECL_RESULT (gnu_subprog_decl
), gnu_retval
),
2028 End_Label (Handled_Statement_Sequence (gnat_node
)));
2030 gnu_result
= end_stmt_group ();
2033 pop_stack (&gnu_return_label_stack
);
2035 /* Set the end location. */
2037 ((Present (End_Label (Handled_Statement_Sequence (gnat_node
)))
2038 ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node
)))
2039 : Sloc (gnat_node
)),
2040 &DECL_STRUCT_FUNCTION (gnu_subprog_decl
)->function_end_locus
);
2042 end_subprog_body (gnu_result
, false);
2044 /* Disconnect the trees for parameters that we made variables for from the
2045 GNAT entities since these are unusable after we end the function. */
2046 for (gnat_param
= First_Formal_With_Extras (gnat_subprog_id
);
2047 Present (gnat_param
);
2048 gnat_param
= Next_Formal_With_Extras (gnat_param
))
2049 if (TREE_CODE (get_gnu_tree (gnat_param
)) == VAR_DECL
)
2050 save_gnu_tree (gnat_param
, NULL_TREE
, false);
2052 if (DECL_FUNCTION_STUB (gnu_subprog_decl
))
2053 build_function_stub (gnu_subprog_decl
, gnat_subprog_id
);
2055 mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node
)));
2058 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
2059 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
2060 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
2061 If GNU_TARGET is non-null, this must be a function call and the result
2062 of the call is to be placed into that object. */
2065 call_to_gnu (Node_Id gnat_node
, tree
*gnu_result_type_p
, tree gnu_target
)
2068 /* The GCC node corresponding to the GNAT subprogram name. This can either
2069 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
2070 or an indirect reference expression (an INDIRECT_REF node) pointing to a
2072 tree gnu_subprog_node
= gnat_to_gnu (Name (gnat_node
));
2073 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2074 tree gnu_subprog_type
= TREE_TYPE (gnu_subprog_node
);
2075 tree gnu_subprog_addr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2077 Entity_Id gnat_formal
;
2078 Node_Id gnat_actual
;
2079 tree gnu_actual_list
= NULL_TREE
;
2080 tree gnu_name_list
= NULL_TREE
;
2081 tree gnu_before_list
= NULL_TREE
;
2082 tree gnu_after_list
= NULL_TREE
;
2083 tree gnu_subprog_call
;
2085 switch (Nkind (Name (gnat_node
)))
2088 case N_Operator_Symbol
:
2089 case N_Expanded_Name
:
2090 case N_Attribute_Reference
:
2091 if (Is_Eliminated (Entity (Name (gnat_node
))))
2092 Eliminate_Error_Msg (gnat_node
, Entity (Name (gnat_node
)));
2095 gcc_assert (TREE_CODE (gnu_subprog_type
) == FUNCTION_TYPE
);
2097 /* If we are calling a stubbed function, make this into a raise of
2098 Program_Error. Elaborate all our args first. */
2099 if (TREE_CODE (gnu_subprog_node
) == FUNCTION_DECL
2100 && DECL_STUBBED_P (gnu_subprog_node
))
2102 for (gnat_actual
= First_Actual (gnat_node
);
2103 Present (gnat_actual
);
2104 gnat_actual
= Next_Actual (gnat_actual
))
2105 add_stmt (gnat_to_gnu (gnat_actual
));
2109 = build_call_raise (PE_Stubbed_Subprogram_Called
, gnat_node
,
2110 N_Raise_Program_Error
);
2112 if (Nkind (gnat_node
) == N_Function_Call
&& !gnu_target
)
2114 *gnu_result_type_p
= TREE_TYPE (gnu_subprog_type
);
2115 return build1 (NULL_EXPR
, *gnu_result_type_p
, call_expr
);
2122 /* If we are calling by supplying a pointer to a target, set up that
2123 pointer as the first argument. Use GNU_TARGET if one was passed;
2124 otherwise, make a target by building a variable of the maximum size
2126 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2128 tree gnu_real_ret_type
2129 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2134 = maybe_pad_type (gnu_real_ret_type
,
2135 max_size (TYPE_SIZE (gnu_real_ret_type
), true),
2136 0, Etype (Name (gnat_node
)), "PAD", false,
2139 /* ??? We may be about to create a static temporary if we happen to
2140 be at the global binding level. That's a regression from what
2141 the 3.x back-end would generate in the same situation, but we
2142 don't have a mechanism in Gigi for creating automatic variables
2143 in the elaboration routines. */
2145 = create_var_decl (create_tmp_var_name ("LR"), NULL
, gnu_obj_type
,
2146 NULL
, false, false, false, false, NULL
,
2151 = tree_cons (NULL_TREE
,
2152 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2153 unchecked_convert (gnu_real_ret_type
,
2160 /* The only way we can be making a call via an access type is if Name is an
2161 explicit dereference. In that case, get the list of formal args from the
2162 type the access type is pointing to. Otherwise, get the formals from
2163 entity being called. */
2164 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2165 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2166 else if (Nkind (Name (gnat_node
)) == N_Attribute_Reference
)
2167 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2170 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2172 /* Create the list of the actual parameters as GCC expects it, namely a chain
2173 of TREE_LIST nodes in which the TREE_VALUE field of each node is a
2174 parameter-expression and the TREE_PURPOSE field is null. Skip Out
2175 parameters not passed by reference and don't need to be copied in. */
2176 for (gnat_actual
= First_Actual (gnat_node
);
2177 Present (gnat_actual
);
2178 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2179 gnat_actual
= Next_Actual (gnat_actual
))
2182 = (present_gnu_tree (gnat_formal
)
2183 ? get_gnu_tree (gnat_formal
) : NULL_TREE
);
2184 tree gnu_formal_type
= gnat_to_gnu_type (Etype (gnat_formal
));
2185 /* We must suppress conversions that can cause the creation of a
2186 temporary in the Out or In Out case because we need the real
2187 object in this case, either to pass its address if it's passed
2188 by reference or as target of the back copy done after the call
2189 if it uses the copy-in copy-out mechanism. We do it in the In
2190 case too, except for an unchecked conversion because it alone
2191 can cause the actual to be misaligned and the addressability
2192 test is applied to the real object. */
2193 bool suppress_type_conversion
2194 = ((Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
2195 && Ekind (gnat_formal
) != E_In_Parameter
)
2196 || (Nkind (gnat_actual
) == N_Type_Conversion
2197 && Is_Composite_Type (Underlying_Type (Etype (gnat_formal
)))));
2198 Node_Id gnat_name
= (suppress_type_conversion
2199 ? Expression (gnat_actual
) : gnat_actual
);
2200 tree gnu_name
= gnat_to_gnu (gnat_name
), gnu_name_type
;
2203 /* If it's possible we may need to use this expression twice, make sure
2204 that any side-effects are handled via SAVE_EXPRs. Likewise if we need
2205 to force side-effects before the call.
2206 ??? This is more conservative than we need since we don't need to do
2207 this for pass-by-ref with no conversion. */
2208 if (Ekind (gnat_formal
) != E_In_Parameter
)
2209 gnu_name
= gnat_stabilize_reference (gnu_name
, true);
2211 /* If we are passing a non-addressable parameter by reference, pass the
2212 address of a copy. In the Out or In Out case, set up to copy back
2213 out after the call. */
2215 && (DECL_BY_REF_P (gnu_formal
)
2216 || (TREE_CODE (gnu_formal
) == PARM_DECL
2217 && (DECL_BY_COMPONENT_PTR_P (gnu_formal
)
2218 || (DECL_BY_DESCRIPTOR_P (gnu_formal
)))))
2219 && (gnu_name_type
= gnat_to_gnu_type (Etype (gnat_name
)))
2220 && !addressable_p (gnu_name
, gnu_name_type
))
2222 tree gnu_copy
= gnu_name
, gnu_temp
;
2224 /* If the type is by_reference, a copy is not allowed. */
2225 if (Is_By_Reference_Type (Etype (gnat_formal
)))
2227 ("misaligned actual cannot be passed by reference", gnat_actual
);
2229 /* For users of Starlet we issue a warning because the
2230 interface apparently assumes that by-ref parameters
2231 outlive the procedure invocation. The code still
2232 will not work as intended, but we cannot do much
2233 better since other low-level parts of the back-end
2234 would allocate temporaries at will because of the
2235 misalignment if we did not do so here. */
2236 else if (Is_Valued_Procedure (Entity (Name (gnat_node
))))
2239 ("?possible violation of implicit assumption", gnat_actual
);
2241 ("?made by pragma Import_Valued_Procedure on &", gnat_actual
,
2242 Entity (Name (gnat_node
)));
2243 post_error_ne ("?because of misalignment of &", gnat_actual
,
2247 /* Remove any unpadding from the object and reset the copy. */
2248 if (TREE_CODE (gnu_name
) == COMPONENT_REF
2249 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_name
, 0)))
2251 && (TYPE_IS_PADDING_P
2252 (TREE_TYPE (TREE_OPERAND (gnu_name
, 0))))))
2253 gnu_name
= gnu_copy
= TREE_OPERAND (gnu_name
, 0);
2255 /* Otherwise convert to the nominal type of the object if it's
2256 a record type. There are several cases in which we need to
2257 make the temporary using this type instead of the actual type
2258 of the object if they are distinct, because the expectations
2259 of the callee would otherwise not be met:
2260 - if it's a justified modular type,
2261 - if the actual type is a smaller packable version of it. */
2262 else if (TREE_CODE (gnu_name_type
) == RECORD_TYPE
2263 && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type
)
2264 || smaller_packable_type_p (TREE_TYPE (gnu_name
),
2266 gnu_name
= convert (gnu_name_type
, gnu_name
);
2268 /* Make a SAVE_EXPR to both properly account for potential side
2269 effects and handle the creation of a temporary copy. Special
2270 code in gnat_gimplify_expr ensures that the same temporary is
2271 used as the object and copied back after the call if needed. */
2272 gnu_name
= build1 (SAVE_EXPR
, TREE_TYPE (gnu_name
), gnu_name
);
2273 TREE_SIDE_EFFECTS (gnu_name
) = 1;
2275 /* Set up to move the copy back to the original. */
2276 if (Ekind (gnat_formal
) != E_In_Parameter
)
2278 gnu_temp
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_copy
,
2280 set_expr_location_from_node (gnu_temp
, gnat_node
);
2281 append_to_statement_list (gnu_temp
, &gnu_after_list
);
2285 /* Start from the real object and build the actual. */
2286 gnu_actual
= gnu_name
;
2288 /* If this was a procedure call, we may not have removed any padding.
2289 So do it here for the part we will use as an input, if any. */
2290 if (Ekind (gnat_formal
) != E_Out_Parameter
2291 && TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2292 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
)))
2293 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2296 /* Do any needed conversions for the actual and make sure that it is
2297 in range of the formal's type. */
2298 if (suppress_type_conversion
)
2300 /* Put back the conversion we suppressed above in the computation
2301 of the real object. Note that we treat a conversion between
2302 aggregate types as if it is an unchecked conversion here. */
2304 = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2306 (Nkind (gnat_actual
)
2307 == N_Unchecked_Type_Conversion
)
2308 && No_Truncation (gnat_actual
));
2310 if (Ekind (gnat_formal
) != E_Out_Parameter
2311 && Do_Range_Check (gnat_actual
))
2312 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2316 if (Ekind (gnat_formal
) != E_Out_Parameter
2317 && Do_Range_Check (gnat_actual
))
2318 gnu_actual
= emit_range_check (gnu_actual
, Etype (gnat_formal
));
2320 /* We may have suppressed a conversion to the Etype of the actual
2321 since the parent is a procedure call. So put it back here.
2322 ??? We use the reverse order compared to the case above because
2323 of an awkward interaction with the check and actually don't put
2324 back the conversion at all if a check is emitted. This is also
2325 done for the conversion to the formal's type just below. */
2326 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2327 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2331 if (TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2332 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2334 /* Unless this is an In parameter, we must remove any justified modular
2335 building from GNU_NAME to get an lvalue. */
2336 if (Ekind (gnat_formal
) != E_In_Parameter
2337 && TREE_CODE (gnu_name
) == CONSTRUCTOR
2338 && TREE_CODE (TREE_TYPE (gnu_name
)) == RECORD_TYPE
2339 && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name
)))
2340 gnu_name
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name
))),
2343 /* If we have not saved a GCC object for the formal, it means it is an
2344 Out parameter not passed by reference and that does not need to be
2345 copied in. Otherwise, look at the PARM_DECL to see if it is passed by
2348 && TREE_CODE (gnu_formal
) == PARM_DECL
2349 && DECL_BY_REF_P (gnu_formal
))
2351 if (Ekind (gnat_formal
) != E_In_Parameter
)
2353 /* In Out or Out parameters passed by reference don't use the
2354 copy-in copy-out mechanism so the address of the real object
2355 must be passed to the function. */
2356 gnu_actual
= gnu_name
;
2358 /* If we have a padded type, be sure we've removed padding. */
2359 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2360 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual
))
2361 && TREE_CODE (gnu_actual
) != SAVE_EXPR
)
2362 gnu_actual
= convert (get_unpadded_type (Etype (gnat_actual
)),
2365 /* If we have the constructed subtype of an aliased object
2366 with an unconstrained nominal subtype, the type of the
2367 actual includes the template, although it is formally
2368 constrained. So we need to convert it back to the real
2369 constructed subtype to retrieve the constrained part
2370 and takes its address. */
2371 if (TREE_CODE (TREE_TYPE (gnu_actual
)) == RECORD_TYPE
2372 && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual
))
2373 && TREE_CODE (gnu_actual
) != SAVE_EXPR
2374 && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual
))
2375 && Is_Array_Type (Etype (gnat_actual
)))
2376 gnu_actual
= convert (gnat_to_gnu_type (Etype (gnat_actual
)),
2380 /* The symmetry of the paths to the type of an entity is broken here
2381 since arguments don't know that they will be passed by ref. */
2382 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2383 gnu_actual
= build_unary_op (ADDR_EXPR
, gnu_formal_type
, gnu_actual
);
2386 && TREE_CODE (gnu_formal
) == PARM_DECL
2387 && DECL_BY_COMPONENT_PTR_P (gnu_formal
))
2389 gnu_formal_type
= TREE_TYPE (get_gnu_tree (gnat_formal
));
2390 gnu_actual
= maybe_implicit_deref (gnu_actual
);
2391 gnu_actual
= maybe_unconstrained_array (gnu_actual
);
2393 if (TREE_CODE (gnu_formal_type
) == RECORD_TYPE
2394 && TYPE_IS_PADDING_P (gnu_formal_type
))
2396 gnu_formal_type
= TREE_TYPE (TYPE_FIELDS (gnu_formal_type
));
2397 gnu_actual
= convert (gnu_formal_type
, gnu_actual
);
2400 /* Take the address of the object and convert to the proper pointer
2401 type. We'd like to actually compute the address of the beginning
2402 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
2403 possibility that the ARRAY_REF might return a constant and we'd be
2404 getting the wrong address. Neither approach is exactly correct,
2405 but this is the most likely to work in all cases. */
2406 gnu_actual
= convert (gnu_formal_type
,
2407 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2411 && TREE_CODE (gnu_formal
) == PARM_DECL
2412 && DECL_BY_DESCRIPTOR_P (gnu_formal
))
2414 /* If arg is 'Null_Parameter, pass zero descriptor. */
2415 if ((TREE_CODE (gnu_actual
) == INDIRECT_REF
2416 || TREE_CODE (gnu_actual
) == UNCONSTRAINED_ARRAY_REF
)
2417 && TREE_PRIVATE (gnu_actual
))
2418 gnu_actual
= convert (DECL_ARG_TYPE (get_gnu_tree (gnat_formal
)),
2421 gnu_actual
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
2422 fill_vms_descriptor (gnu_actual
,
2428 tree gnu_actual_size
= TYPE_SIZE (TREE_TYPE (gnu_actual
));
2430 if (Ekind (gnat_formal
) != E_In_Parameter
)
2431 gnu_name_list
= tree_cons (NULL_TREE
, gnu_name
, gnu_name_list
);
2433 if (!gnu_formal
|| TREE_CODE (gnu_formal
) != PARM_DECL
)
2436 /* If this is 'Null_Parameter, pass a zero even though we are
2437 dereferencing it. */
2438 else if (TREE_CODE (gnu_actual
) == INDIRECT_REF
2439 && TREE_PRIVATE (gnu_actual
)
2440 && host_integerp (gnu_actual_size
, 1)
2441 && 0 >= compare_tree_int (gnu_actual_size
,
2444 = unchecked_convert (DECL_ARG_TYPE (gnu_formal
),
2445 convert (gnat_type_for_size
2446 (tree_low_cst (gnu_actual_size
, 1),
2451 gnu_actual
= convert (DECL_ARG_TYPE (gnu_formal
), gnu_actual
);
2454 gnu_actual_list
= tree_cons (NULL_TREE
, gnu_actual
, gnu_actual_list
);
2457 gnu_subprog_call
= build_call_list (TREE_TYPE (gnu_subprog_type
),
2459 nreverse (gnu_actual_list
));
2460 set_expr_location_from_node (gnu_subprog_call
, gnat_node
);
2462 /* If we return by passing a target, the result is the target after the
2463 call. We must not emit the call directly here because this might be
2464 evaluated as part of an expression with conditions to control whether
2465 the call should be emitted or not. */
2466 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
2468 /* Conceptually, what we need is a COMPOUND_EXPR with the call followed
2469 by the target object converted to the proper type. Doing so would
2470 potentially be very inefficient, however, as this expression might
2471 end up wrapped into an outer SAVE_EXPR later on, which would incur a
2472 pointless temporary copy of the whole object.
2474 What we do instead is build a COMPOUND_EXPR returning the address of
2475 the target, and then dereference. Wrapping the COMPOUND_EXPR into a
2476 SAVE_EXPR later on then only incurs a pointer copy. */
2478 tree gnu_result_type
2479 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (gnu_subprog_type
)));
2482 (result_type) *[gnu_subprog_call (&gnu_target, ...), &gnu_target] */
2484 tree gnu_target_address
2485 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_target
);
2486 set_expr_location_from_node (gnu_target_address
, gnat_node
);
2489 = build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_target_address
),
2490 gnu_subprog_call
, gnu_target_address
);
2493 = unchecked_convert (gnu_result_type
,
2494 build_unary_op (INDIRECT_REF
, NULL_TREE
,
2498 *gnu_result_type_p
= gnu_result_type
;
2502 /* If it is a function call, the result is the call expression unless
2503 a target is specified, in which case we copy the result into the target
2504 and return the assignment statement. */
2505 else if (Nkind (gnat_node
) == N_Function_Call
)
2507 gnu_result
= gnu_subprog_call
;
2509 /* If the function returns an unconstrained array or by reference,
2510 we have to de-dereference the pointer. */
2511 if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
)
2512 || TYPE_RETURNS_BY_REF_P (gnu_subprog_type
))
2513 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
2516 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2517 gnu_target
, gnu_result
);
2519 *gnu_result_type_p
= get_unpadded_type (Etype (gnat_node
));
2524 /* If this is the case where the GNAT tree contains a procedure call
2525 but the Ada procedure has copy in copy out parameters, the special
2526 parameter passing mechanism must be used. */
2527 else if (TYPE_CI_CO_LIST (gnu_subprog_type
) != NULL_TREE
)
2529 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
2530 in copy out parameters. */
2531 tree scalar_return_list
= TYPE_CI_CO_LIST (gnu_subprog_type
);
2532 int length
= list_length (scalar_return_list
);
2538 gnu_subprog_call
= save_expr (gnu_subprog_call
);
2539 gnu_name_list
= nreverse (gnu_name_list
);
2541 /* If any of the names had side-effects, ensure they are all
2542 evaluated before the call. */
2543 for (gnu_name
= gnu_name_list
; gnu_name
;
2544 gnu_name
= TREE_CHAIN (gnu_name
))
2545 if (TREE_SIDE_EFFECTS (TREE_VALUE (gnu_name
)))
2546 append_to_statement_list (TREE_VALUE (gnu_name
),
2550 if (Nkind (Name (gnat_node
)) == N_Explicit_Dereference
)
2551 gnat_formal
= First_Formal_With_Extras (Etype (Name (gnat_node
)));
2553 gnat_formal
= First_Formal_With_Extras (Entity (Name (gnat_node
)));
2555 for (gnat_actual
= First_Actual (gnat_node
);
2556 Present (gnat_actual
);
2557 gnat_formal
= Next_Formal_With_Extras (gnat_formal
),
2558 gnat_actual
= Next_Actual (gnat_actual
))
2559 /* If we are dealing with a copy in copy out parameter, we must
2560 retrieve its value from the record returned in the call. */
2561 if (!(present_gnu_tree (gnat_formal
)
2562 && TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2563 && (DECL_BY_REF_P (get_gnu_tree (gnat_formal
))
2564 || (TREE_CODE (get_gnu_tree (gnat_formal
)) == PARM_DECL
2565 && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal
))
2566 || (DECL_BY_DESCRIPTOR_P
2567 (get_gnu_tree (gnat_formal
))))))))
2568 && Ekind (gnat_formal
) != E_In_Parameter
)
2570 /* Get the value to assign to this Out or In Out parameter. It is
2571 either the result of the function if there is only a single such
2572 parameter or the appropriate field from the record returned. */
2574 = length
== 1 ? gnu_subprog_call
2575 : build_component_ref (gnu_subprog_call
, NULL_TREE
,
2576 TREE_PURPOSE (scalar_return_list
),
2579 /* If the actual is a conversion, get the inner expression, which
2580 will be the real destination, and convert the result to the
2581 type of the actual parameter. */
2583 = maybe_unconstrained_array (TREE_VALUE (gnu_name_list
));
2585 /* If the result is a padded type, remove the padding. */
2586 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
2587 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
2588 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS
2589 (TREE_TYPE (gnu_result
))),
2592 /* If the actual is a type conversion, the real target object is
2593 denoted by the inner Expression and we need to convert the
2594 result to the associated type.
2595 We also need to convert our gnu assignment target to this type
2596 if the corresponding GNU_NAME was constructed from the GNAT
2597 conversion node and not from the inner Expression. */
2598 if (Nkind (gnat_actual
) == N_Type_Conversion
)
2601 = convert_with_check
2602 (Etype (Expression (gnat_actual
)), gnu_result
,
2603 Do_Overflow_Check (gnat_actual
),
2604 Do_Range_Check (Expression (gnat_actual
)),
2605 Float_Truncate (gnat_actual
));
2607 if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal
))))
2608 gnu_actual
= convert (TREE_TYPE (gnu_result
), gnu_actual
);
2611 /* Unchecked conversions as actuals for Out parameters are not
2612 allowed in user code because they are not variables, but do
2613 occur in front-end expansions. The associated GNU_NAME is
2614 always obtained from the inner expression in such cases. */
2615 else if (Nkind (gnat_actual
) == N_Unchecked_Type_Conversion
)
2616 gnu_result
= unchecked_convert (TREE_TYPE (gnu_actual
),
2618 No_Truncation (gnat_actual
));
2621 if (Do_Range_Check (gnat_actual
))
2622 gnu_result
= emit_range_check (gnu_result
,
2623 Etype (gnat_actual
));
2625 if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual
)))
2626 && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result
)))))
2627 gnu_result
= convert (TREE_TYPE (gnu_actual
), gnu_result
);
2630 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
2631 gnu_actual
, gnu_result
);
2632 set_expr_location_from_node (gnu_result
, gnat_node
);
2633 append_to_statement_list (gnu_result
, &gnu_before_list
);
2634 scalar_return_list
= TREE_CHAIN (scalar_return_list
);
2635 gnu_name_list
= TREE_CHAIN (gnu_name_list
);
2639 append_to_statement_list (gnu_subprog_call
, &gnu_before_list
);
2641 append_to_statement_list (gnu_after_list
, &gnu_before_list
);
2642 return gnu_before_list
;
2645 /* Subroutine of gnat_to_gnu to translate gnat_node, an
2646 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
2649 Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node
)
2651 tree gnu_jmpsave_decl
= NULL_TREE
;
2652 tree gnu_jmpbuf_decl
= NULL_TREE
;
2653 /* If just annotating, ignore all EH and cleanups. */
2654 bool gcc_zcx
= (!type_annotate_only
2655 && Present (Exception_Handlers (gnat_node
))
2656 && Exception_Mechanism
== Back_End_Exceptions
);
2658 = (!type_annotate_only
&& Present (Exception_Handlers (gnat_node
))
2659 && Exception_Mechanism
== Setjmp_Longjmp
);
2660 bool at_end
= !type_annotate_only
&& Present (At_End_Proc (gnat_node
));
2661 bool binding_for_block
= (at_end
|| gcc_zcx
|| setjmp_longjmp
);
2662 tree gnu_inner_block
; /* The statement(s) for the block itself. */
2667 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
2668 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
2669 add_cleanup, and when we leave the binding, end_stmt_group will create
2670 the TRY_FINALLY_EXPR.
2672 ??? The region level calls down there have been specifically put in place
2673 for a ZCX context and currently the order in which things are emitted
2674 (region/handlers) is different from the SJLJ case. Instead of putting
2675 other calls with different conditions at other places for the SJLJ case,
2676 it seems cleaner to reorder things for the SJLJ case and generalize the
2677 condition to make it not ZCX specific.
2679 If there are any exceptions or cleanup processing involved, we need an
2680 outer statement group (for Setjmp_Longjmp) and binding level. */
2681 if (binding_for_block
)
2683 start_stmt_group ();
2687 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
2688 area for address of previous buffer. Do this first since we need to have
2689 the setjmp buf known for any decls in this block. */
2692 gnu_jmpsave_decl
= create_var_decl (get_identifier ("JMPBUF_SAVE"),
2693 NULL_TREE
, jmpbuf_ptr_type
,
2694 build_call_0_expr (get_jmpbuf_decl
),
2695 false, false, false, false, NULL
,
2697 DECL_ARTIFICIAL (gnu_jmpsave_decl
) = 1;
2699 /* The __builtin_setjmp receivers will immediately reinstall it. Now
2700 because of the unstructured form of EH used by setjmp_longjmp, there
2701 might be forward edges going to __builtin_setjmp receivers on which
2702 it is uninitialized, although they will never be actually taken. */
2703 TREE_NO_WARNING (gnu_jmpsave_decl
) = 1;
2704 gnu_jmpbuf_decl
= create_var_decl (get_identifier ("JMP_BUF"),
2705 NULL_TREE
, jmpbuf_type
,
2706 NULL_TREE
, false, false, false, false,
2708 DECL_ARTIFICIAL (gnu_jmpbuf_decl
) = 1;
2710 set_block_jmpbuf_decl (gnu_jmpbuf_decl
);
2712 /* When we exit this block, restore the saved value. */
2713 add_cleanup (build_call_1_expr (set_jmpbuf_decl
, gnu_jmpsave_decl
),
2714 End_Label (gnat_node
));
2717 /* If we are to call a function when exiting this block, add a cleanup
2718 to the binding level we made above. Note that add_cleanup is FIFO
2719 so we must register this cleanup after the EH cleanup just above. */
2721 add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node
))),
2722 End_Label (gnat_node
));
2724 /* Now build the tree for the declarations and statements inside this block.
2725 If this is SJLJ, set our jmp_buf as the current buffer. */
2726 start_stmt_group ();
2729 add_stmt (build_call_1_expr (set_jmpbuf_decl
,
2730 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2733 if (Present (First_Real_Statement (gnat_node
)))
2734 process_decls (Statements (gnat_node
), Empty
,
2735 First_Real_Statement (gnat_node
), true, true);
2737 /* Generate code for each statement in the block. */
2738 for (gnat_temp
= (Present (First_Real_Statement (gnat_node
))
2739 ? First_Real_Statement (gnat_node
)
2740 : First (Statements (gnat_node
)));
2741 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
2742 add_stmt (gnat_to_gnu (gnat_temp
));
2743 gnu_inner_block
= end_stmt_group ();
2745 /* Now generate code for the two exception models, if either is relevant for
2749 tree
*gnu_else_ptr
= 0;
2752 /* Make a binding level for the exception handling declarations and code
2753 and set up gnu_except_ptr_stack for the handlers to use. */
2754 start_stmt_group ();
2757 push_stack (&gnu_except_ptr_stack
, NULL_TREE
,
2758 create_var_decl (get_identifier ("EXCEPT_PTR"),
2760 build_pointer_type (except_type_node
),
2761 build_call_0_expr (get_excptr_decl
), false,
2762 false, false, false, NULL
, gnat_node
));
2764 /* Generate code for each handler. The N_Exception_Handler case does the
2765 real work and returns a COND_EXPR for each handler, which we chain
2767 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2768 Present (gnat_temp
); gnat_temp
= Next_Non_Pragma (gnat_temp
))
2770 gnu_expr
= gnat_to_gnu (gnat_temp
);
2772 /* If this is the first one, set it as the outer one. Otherwise,
2773 point the "else" part of the previous handler to us. Then point
2774 to our "else" part. */
2776 add_stmt (gnu_expr
);
2778 *gnu_else_ptr
= gnu_expr
;
2780 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
2783 /* If none of the exception handlers did anything, re-raise but do not
2785 gnu_expr
= build_call_1_expr (raise_nodefer_decl
,
2786 TREE_VALUE (gnu_except_ptr_stack
));
2787 set_expr_location_from_node (gnu_expr
, gnat_node
);
2790 *gnu_else_ptr
= gnu_expr
;
2792 add_stmt (gnu_expr
);
2794 /* End the binding level dedicated to the exception handlers and get the
2795 whole statement group. */
2796 pop_stack (&gnu_except_ptr_stack
);
2798 gnu_handler
= end_stmt_group ();
2800 /* If the setjmp returns 1, we restore our incoming longjmp value and
2801 then check the handlers. */
2802 start_stmt_group ();
2803 add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl
,
2806 add_stmt (gnu_handler
);
2807 gnu_handler
= end_stmt_group ();
2809 /* This block is now "if (setjmp) ... <handlers> else <block>". */
2810 gnu_result
= build3 (COND_EXPR
, void_type_node
,
2813 build_unary_op (ADDR_EXPR
, NULL_TREE
,
2815 gnu_handler
, gnu_inner_block
);
2821 /* First make a block containing the handlers. */
2822 start_stmt_group ();
2823 for (gnat_temp
= First_Non_Pragma (Exception_Handlers (gnat_node
));
2824 Present (gnat_temp
);
2825 gnat_temp
= Next_Non_Pragma (gnat_temp
))
2826 add_stmt (gnat_to_gnu (gnat_temp
));
2827 gnu_handlers
= end_stmt_group ();
2829 /* Now make the TRY_CATCH_EXPR for the block. */
2830 gnu_result
= build2 (TRY_CATCH_EXPR
, void_type_node
,
2831 gnu_inner_block
, gnu_handlers
);
2834 gnu_result
= gnu_inner_block
;
2836 /* Now close our outer block, if we had to make one. */
2837 if (binding_for_block
)
2839 add_stmt (gnu_result
);
2841 gnu_result
= end_stmt_group ();
2847 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2848 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
2849 exception handling. */
2852 Exception_Handler_to_gnu_sjlj (Node_Id gnat_node
)
2854 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
2855 an "if" statement to select the proper exceptions. For "Others", exclude
2856 exceptions where Handled_By_Others is nonzero unless the All_Others flag
2857 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
2858 tree gnu_choice
= integer_zero_node
;
2859 tree gnu_body
= build_stmt_group (Statements (gnat_node
), false);
2862 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2863 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2867 if (Nkind (gnat_temp
) == N_Others_Choice
)
2869 if (All_Others (gnat_temp
))
2870 this_choice
= integer_one_node
;
2874 (EQ_EXPR
, integer_type_node
,
2879 (INDIRECT_REF
, NULL_TREE
,
2880 TREE_VALUE (gnu_except_ptr_stack
)),
2881 get_identifier ("not_handled_by_others"), NULL_TREE
,
2886 else if (Nkind (gnat_temp
) == N_Identifier
2887 || Nkind (gnat_temp
) == N_Expanded_Name
)
2889 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
2892 /* Exception may be a renaming. Recover original exception which is
2893 the one elaborated and registered. */
2894 if (Present (Renamed_Object (gnat_ex_id
)))
2895 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
2897 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
2901 (EQ_EXPR
, integer_type_node
, TREE_VALUE (gnu_except_ptr_stack
),
2902 convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack
)),
2903 build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
)));
2905 /* If this is the distinguished exception "Non_Ada_Error" (and we are
2906 in VMS mode), also allow a non-Ada exception (a VMS condition) t
2908 if (Is_Non_Ada_Error (Entity (gnat_temp
)))
2911 = build_component_ref
2912 (build_unary_op (INDIRECT_REF
, NULL_TREE
,
2913 TREE_VALUE (gnu_except_ptr_stack
)),
2914 get_identifier ("lang"), NULL_TREE
, false);
2918 (TRUTH_ORIF_EXPR
, integer_type_node
,
2919 build_binary_op (EQ_EXPR
, integer_type_node
, gnu_comp
,
2920 build_int_cst (TREE_TYPE (gnu_comp
), 'V')),
2927 gnu_choice
= build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
2928 gnu_choice
, this_choice
);
2931 return build3 (COND_EXPR
, void_type_node
, gnu_choice
, gnu_body
, NULL_TREE
);
2934 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
2935 to a GCC tree, which is returned. This is the variant for ZCX. */
2938 Exception_Handler_to_gnu_zcx (Node_Id gnat_node
)
2940 tree gnu_etypes_list
= NULL_TREE
;
2943 tree gnu_current_exc_ptr
;
2944 tree gnu_incoming_exc_ptr
;
2947 /* We build a TREE_LIST of nodes representing what exception types this
2948 handler can catch, with special cases for others and all others cases.
2950 Each exception type is actually identified by a pointer to the exception
2951 id, or to a dummy object for "others" and "all others".
2953 Care should be taken to ensure that the control flow impact of "others"
2954 and "all others" is known to GCC. lang_eh_type_covers is doing the trick
2956 for (gnat_temp
= First (Exception_Choices (gnat_node
));
2957 gnat_temp
; gnat_temp
= Next (gnat_temp
))
2959 if (Nkind (gnat_temp
) == N_Others_Choice
)
2962 = All_Others (gnat_temp
) ? all_others_decl
: others_decl
;
2965 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
2967 else if (Nkind (gnat_temp
) == N_Identifier
2968 || Nkind (gnat_temp
) == N_Expanded_Name
)
2970 Entity_Id gnat_ex_id
= Entity (gnat_temp
);
2972 /* Exception may be a renaming. Recover original exception which is
2973 the one elaborated and registered. */
2974 if (Present (Renamed_Object (gnat_ex_id
)))
2975 gnat_ex_id
= Renamed_Object (gnat_ex_id
);
2977 gnu_expr
= gnat_to_gnu_entity (gnat_ex_id
, NULL_TREE
, 0);
2978 gnu_etype
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_expr
);
2980 /* The Non_Ada_Error case for VMS exceptions is handled
2981 by the personality routine. */
2986 /* The GCC interface expects NULL to be passed for catch all handlers, so
2987 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
2988 is integer_zero_node. It would not work, however, because GCC's
2989 notion of "catch all" is stronger than our notion of "others". Until
2990 we correctly use the cleanup interface as well, doing that would
2991 prevent the "all others" handlers from being seen, because nothing
2992 can be caught beyond a catch all from GCC's point of view. */
2993 gnu_etypes_list
= tree_cons (NULL_TREE
, gnu_etype
, gnu_etypes_list
);
2996 start_stmt_group ();
2999 /* Expand a call to the begin_handler hook at the beginning of the handler,
3000 and arrange for a call to the end_handler hook to occur on every possible
3003 The hooks expect a pointer to the low level occurrence. This is required
3004 for our stack management scheme because a raise inside the handler pushes
3005 a new occurrence on top of the stack, which means that this top does not
3006 necessarily match the occurrence this handler was dealing with.
3008 The EXC_PTR_EXPR object references the exception occurrence being
3009 propagated. Upon handler entry, this is the exception for which the
3010 handler is triggered. This might not be the case upon handler exit,
3011 however, as we might have a new occurrence propagated by the handler's
3012 body, and the end_handler hook called as a cleanup in this context.
3014 We use a local variable to retrieve the incoming value at handler entry
3015 time, and reuse it to feed the end_handler hook's argument at exit. */
3016 gnu_current_exc_ptr
= build0 (EXC_PTR_EXPR
, ptr_type_node
);
3017 gnu_incoming_exc_ptr
= create_var_decl (get_identifier ("EXPTR"), NULL_TREE
,
3018 ptr_type_node
, gnu_current_exc_ptr
,
3019 false, false, false, false, NULL
,
3022 add_stmt_with_node (build_call_1_expr (begin_handler_decl
,
3023 gnu_incoming_exc_ptr
),
3025 /* ??? We don't seem to have an End_Label at hand to set the location. */
3026 add_cleanup (build_call_1_expr (end_handler_decl
, gnu_incoming_exc_ptr
),
3028 add_stmt_list (Statements (gnat_node
));
3031 return build2 (CATCH_EXPR
, void_type_node
, gnu_etypes_list
,
3035 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
3038 Compilation_Unit_to_gnu (Node_Id gnat_node
)
3040 /* Make the decl for the elaboration procedure. */
3041 bool body_p
= (Defining_Entity (Unit (gnat_node
)),
3042 Nkind (Unit (gnat_node
)) == N_Package_Body
3043 || Nkind (Unit (gnat_node
)) == N_Subprogram_Body
);
3044 Entity_Id gnat_unit_entity
= Defining_Entity (Unit (gnat_node
));
3045 tree gnu_elab_proc_decl
3046 = create_subprog_decl
3047 (create_concat_name (gnat_unit_entity
,
3048 body_p
? "elabb" : "elabs"),
3049 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, false, NULL
,
3051 struct elab_info
*info
;
3053 push_stack (&gnu_elab_proc_stack
, NULL_TREE
, gnu_elab_proc_decl
);
3055 DECL_ELABORATION_PROC_P (gnu_elab_proc_decl
) = 1;
3056 allocate_struct_function (gnu_elab_proc_decl
, false);
3057 Sloc_to_locus (Sloc (gnat_unit_entity
), &cfun
->function_end_locus
);
3060 /* For a body, first process the spec if there is one. */
3061 if (Nkind (Unit (gnat_node
)) == N_Package_Body
3062 || (Nkind (Unit (gnat_node
)) == N_Subprogram_Body
3063 && !Acts_As_Spec (gnat_node
)))
3065 add_stmt (gnat_to_gnu (Library_Unit (gnat_node
)));
3066 finalize_from_with_types ();
3069 process_inlined_subprograms (gnat_node
);
3071 if (type_annotate_only
&& gnat_node
== Cunit (Main_Unit
))
3073 elaborate_all_entities (gnat_node
);
3075 if (Nkind (Unit (gnat_node
)) == N_Subprogram_Declaration
3076 || Nkind (Unit (gnat_node
)) == N_Generic_Package_Declaration
3077 || Nkind (Unit (gnat_node
)) == N_Generic_Subprogram_Declaration
)
3081 process_decls (Declarations (Aux_Decls_Node (gnat_node
)), Empty
, Empty
,
3083 add_stmt (gnat_to_gnu (Unit (gnat_node
)));
3085 /* Process any pragmas and actions following the unit. */
3086 add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node
)));
3087 add_stmt_list (Actions (Aux_Decls_Node (gnat_node
)));
3088 finalize_from_with_types ();
3090 /* Save away what we've made so far and record this potential elaboration
3092 info
= (struct elab_info
*) ggc_alloc (sizeof (struct elab_info
));
3093 set_current_block_context (gnu_elab_proc_decl
);
3095 DECL_SAVED_TREE (gnu_elab_proc_decl
) = end_stmt_group ();
3096 info
->next
= elab_info_list
;
3097 info
->elab_proc
= gnu_elab_proc_decl
;
3098 info
->gnat_node
= gnat_node
;
3099 elab_info_list
= info
;
3101 /* Generate elaboration code for this unit, if necessary, and say whether
3103 pop_stack (&gnu_elab_proc_stack
);
3105 /* Invalidate the global renaming pointers. This is necessary because
3106 stabilization of the renamed entities may create SAVE_EXPRs which
3107 have been tied to a specific elaboration routine just above. */
3108 invalidate_global_renaming_pointers ();
3111 /* This function is the driver of the GNAT to GCC tree transformation
3112 process. It is the entry point of the tree transformer. GNAT_NODE is the
3113 root of some GNAT tree. Return the root of the corresponding GCC tree.
3114 If this is an expression, return the GCC equivalent of the expression. If
3115 it is a statement, return the statement. In the case when called for a
3116 statement, it may also add statements to the current statement group, in
3117 which case anything it returns is to be interpreted as occurring after
3118 anything `it already added. */
3121 gnat_to_gnu (Node_Id gnat_node
)
3123 bool went_into_elab_proc
= false;
3124 tree gnu_result
= error_mark_node
; /* Default to no value. */
3125 tree gnu_result_type
= void_type_node
;
3127 tree gnu_lhs
, gnu_rhs
;
3130 /* Save node number for error message and set location information. */
3131 error_gnat_node
= gnat_node
;
3132 Sloc_to_locus (Sloc (gnat_node
), &input_location
);
3134 if (type_annotate_only
3135 && IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
))
3136 return alloc_stmt_list ();
3138 /* If this node is a non-static subexpression and we are only
3139 annotating types, make this into a NULL_EXPR. */
3140 if (type_annotate_only
3141 && IN (Nkind (gnat_node
), N_Subexpr
)
3142 && Nkind (gnat_node
) != N_Identifier
3143 && !Compile_Time_Known_Value (gnat_node
))
3144 return build1 (NULL_EXPR
, get_unpadded_type (Etype (gnat_node
)),
3145 build_call_raise (CE_Range_Check_Failed
, gnat_node
,
3146 N_Raise_Constraint_Error
));
3148 /* If this is a Statement and we are at top level, it must be part of the
3149 elaboration procedure, so mark us as being in that procedure and push our
3152 If we are in the elaboration procedure, check if we are violating a
3153 No_Elaboration_Code restriction by having a statement there. */
3154 if ((IN (Nkind (gnat_node
), N_Statement_Other_Than_Procedure_Call
)
3155 && Nkind (gnat_node
) != N_Null_Statement
)
3156 || Nkind (gnat_node
) == N_Procedure_Call_Statement
3157 || Nkind (gnat_node
) == N_Label
3158 || Nkind (gnat_node
) == N_Implicit_Label_Declaration
3159 || Nkind (gnat_node
) == N_Handled_Sequence_Of_Statements
3160 || ((Nkind (gnat_node
) == N_Raise_Constraint_Error
3161 || Nkind (gnat_node
) == N_Raise_Storage_Error
3162 || Nkind (gnat_node
) == N_Raise_Program_Error
)
3163 && (Ekind (Etype (gnat_node
)) == E_Void
)))
3165 if (!current_function_decl
)
3167 current_function_decl
= TREE_VALUE (gnu_elab_proc_stack
);
3168 start_stmt_group ();
3170 went_into_elab_proc
= true;
3173 /* Don't check for a possible No_Elaboration_Code restriction violation
3174 on N_Handled_Sequence_Of_Statements, as we want to signal an error on
3175 every nested real statement instead. This also avoids triggering
3176 spurious errors on dummy (empty) sequences created by the front-end
3177 for package bodies in some cases. */
3179 if (current_function_decl
== TREE_VALUE (gnu_elab_proc_stack
)
3180 && Nkind (gnat_node
) != N_Handled_Sequence_Of_Statements
)
3181 Check_Elaboration_Code_Allowed (gnat_node
);
3184 switch (Nkind (gnat_node
))
3186 /********************************/
3187 /* Chapter 2: Lexical Elements: */
3188 /********************************/
3191 case N_Expanded_Name
:
3192 case N_Operator_Symbol
:
3193 case N_Defining_Identifier
:
3194 gnu_result
= Identifier_to_gnu (gnat_node
, &gnu_result_type
);
3197 case N_Integer_Literal
:
3201 /* Get the type of the result, looking inside any padding and
3202 justified modular types. Then get the value in that type. */
3203 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3205 if (TREE_CODE (gnu_type
) == RECORD_TYPE
3206 && TYPE_JUSTIFIED_MODULAR_P (gnu_type
))
3207 gnu_type
= TREE_TYPE (TYPE_FIELDS (gnu_type
));
3209 gnu_result
= UI_To_gnu (Intval (gnat_node
), gnu_type
);
3211 /* If the result overflows (meaning it doesn't fit in its base type),
3212 abort. We would like to check that the value is within the range
3213 of the subtype, but that causes problems with subtypes whose usage
3214 will raise Constraint_Error and with biased representation, so
3216 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3220 case N_Character_Literal
:
3221 /* If a Entity is present, it means that this was one of the
3222 literals in a user-defined character type. In that case,
3223 just return the value in the CONST_DECL. Otherwise, use the
3224 character code. In that case, the base type should be an
3225 INTEGER_TYPE, but we won't bother checking for that. */
3226 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3227 if (Present (Entity (gnat_node
)))
3228 gnu_result
= DECL_INITIAL (get_gnu_tree (Entity (gnat_node
)));
3231 = build_int_cst_type
3232 (gnu_result_type
, UI_To_CC (Char_Literal_Value (gnat_node
)));
3235 case N_Real_Literal
:
3236 /* If this is of a fixed-point type, the value we want is the
3237 value of the corresponding integer. */
3238 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))), Fixed_Point_Kind
))
3240 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3241 gnu_result
= UI_To_gnu (Corresponding_Integer_Value (gnat_node
),
3243 gcc_assert (!TREE_OVERFLOW (gnu_result
));
3246 /* We should never see a Vax_Float type literal, since the front end
3247 is supposed to transform these using appropriate conversions */
3248 else if (Vax_Float (Underlying_Type (Etype (gnat_node
))))
3253 Ureal ur_realval
= Realval (gnat_node
);
3255 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3257 /* If the real value is zero, so is the result. Otherwise,
3258 convert it to a machine number if it isn't already. That
3259 forces BASE to 0 or 2 and simplifies the rest of our logic. */
3260 if (UR_Is_Zero (ur_realval
))
3261 gnu_result
= convert (gnu_result_type
, integer_zero_node
);
3264 if (!Is_Machine_Number (gnat_node
))
3266 = Machine (Base_Type (Underlying_Type (Etype (gnat_node
))),
3267 ur_realval
, Round_Even
, gnat_node
);
3270 = UI_To_gnu (Numerator (ur_realval
), gnu_result_type
);
3272 /* If we have a base of zero, divide by the denominator.
3273 Otherwise, the base must be 2 and we scale the value, which
3274 we know can fit in the mantissa of the type (hence the use
3275 of that type above). */
3276 if (No (Rbase (ur_realval
)))
3278 = build_binary_op (RDIV_EXPR
,
3279 get_base_type (gnu_result_type
),
3281 UI_To_gnu (Denominator (ur_realval
),
3285 REAL_VALUE_TYPE tmp
;
3287 gcc_assert (Rbase (ur_realval
) == 2);
3288 real_ldexp (&tmp
, &TREE_REAL_CST (gnu_result
),
3289 - UI_To_Int (Denominator (ur_realval
)));
3290 gnu_result
= build_real (gnu_result_type
, tmp
);
3294 /* Now see if we need to negate the result. Do it this way to
3295 properly handle -0. */
3296 if (UR_Is_Negative (Realval (gnat_node
)))
3298 = build_unary_op (NEGATE_EXPR
, get_base_type (gnu_result_type
),
3304 case N_String_Literal
:
3305 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3306 if (TYPE_PRECISION (TREE_TYPE (gnu_result_type
)) == HOST_BITS_PER_CHAR
)
3308 String_Id gnat_string
= Strval (gnat_node
);
3309 int length
= String_Length (gnat_string
);
3312 if (length
>= ALLOCA_THRESHOLD
)
3313 string
= XNEWVEC (char, length
+ 1); /* in case of large strings */
3315 string
= (char *) alloca (length
+ 1);
3317 /* Build the string with the characters in the literal. Note
3318 that Ada strings are 1-origin. */
3319 for (i
= 0; i
< length
; i
++)
3320 string
[i
] = Get_String_Char (gnat_string
, i
+ 1);
3322 /* Put a null at the end of the string in case it's in a context
3323 where GCC will want to treat it as a C string. */
3326 gnu_result
= build_string (length
, string
);
3328 /* Strings in GCC don't normally have types, but we want
3329 this to not be converted to the array type. */
3330 TREE_TYPE (gnu_result
) = gnu_result_type
;
3332 if (length
>= ALLOCA_THRESHOLD
) /* free if heap-allocated */
3337 /* Build a list consisting of each character, then make
3339 String_Id gnat_string
= Strval (gnat_node
);
3340 int length
= String_Length (gnat_string
);
3342 tree gnu_list
= NULL_TREE
;
3343 tree gnu_idx
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3345 for (i
= 0; i
< length
; i
++)
3348 = tree_cons (gnu_idx
,
3349 build_int_cst (TREE_TYPE (gnu_result_type
),
3350 Get_String_Char (gnat_string
,
3354 gnu_idx
= int_const_binop (PLUS_EXPR
, gnu_idx
, integer_one_node
,
3359 = gnat_build_constructor (gnu_result_type
, nreverse (gnu_list
));
3364 gnu_result
= Pragma_to_gnu (gnat_node
);
3367 /**************************************/
3368 /* Chapter 3: Declarations and Types: */
3369 /**************************************/
3371 case N_Subtype_Declaration
:
3372 case N_Full_Type_Declaration
:
3373 case N_Incomplete_Type_Declaration
:
3374 case N_Private_Type_Declaration
:
3375 case N_Private_Extension_Declaration
:
3376 case N_Task_Type_Declaration
:
3377 process_type (Defining_Entity (gnat_node
));
3378 gnu_result
= alloc_stmt_list ();
3381 case N_Object_Declaration
:
3382 case N_Exception_Declaration
:
3383 gnat_temp
= Defining_Entity (gnat_node
);
3384 gnu_result
= alloc_stmt_list ();
3386 /* If we are just annotating types and this object has an unconstrained
3387 or task type, don't elaborate it. */
3388 if (type_annotate_only
3389 && (((Is_Array_Type (Etype (gnat_temp
))
3390 || Is_Record_Type (Etype (gnat_temp
)))
3391 && !Is_Constrained (Etype (gnat_temp
)))
3392 || Is_Concurrent_Type (Etype (gnat_temp
))))
3395 if (Present (Expression (gnat_node
))
3396 && !(Nkind (gnat_node
) == N_Object_Declaration
3397 && No_Initialization (gnat_node
))
3398 && (!type_annotate_only
3399 || Compile_Time_Known_Value (Expression (gnat_node
))))
3401 gnu_expr
= gnat_to_gnu (Expression (gnat_node
));
3402 if (Do_Range_Check (Expression (gnat_node
)))
3403 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_temp
));
3405 /* If this object has its elaboration delayed, we must force
3406 evaluation of GNU_EXPR right now and save it for when the object
3408 if (Present (Freeze_Node (gnat_temp
)))
3410 if ((Is_Public (gnat_temp
) || global_bindings_p ())
3411 && !TREE_CONSTANT (gnu_expr
))
3413 = create_var_decl (create_concat_name (gnat_temp
, "init"),
3414 NULL_TREE
, TREE_TYPE (gnu_expr
),
3415 gnu_expr
, false, Is_Public (gnat_temp
),
3416 false, false, NULL
, gnat_temp
);
3418 gnu_expr
= maybe_variable (gnu_expr
);
3420 save_gnu_tree (gnat_node
, gnu_expr
, true);
3424 gnu_expr
= NULL_TREE
;
3426 if (type_annotate_only
&& gnu_expr
&& TREE_CODE (gnu_expr
) == ERROR_MARK
)
3427 gnu_expr
= NULL_TREE
;
3429 /* If this is a deferred constant with an address clause, we ignore the
3430 full view since the clause is on the partial view and we cannot have
3431 2 different GCC trees for the object. The only bits of the full view
3432 we will use is the initializer, but it will be directly fetched. */
3433 if (Ekind(gnat_temp
) == E_Constant
3434 && Present (Address_Clause (gnat_temp
))
3435 && Present (Full_View (gnat_temp
)))
3436 save_gnu_tree (Full_View (gnat_temp
), error_mark_node
, true);
3438 if (No (Freeze_Node (gnat_temp
)))
3439 gnat_to_gnu_entity (gnat_temp
, gnu_expr
, 1);
3442 case N_Object_Renaming_Declaration
:
3443 gnat_temp
= Defining_Entity (gnat_node
);
3445 /* Don't do anything if this renaming is handled by the front end or if
3446 we are just annotating types and this object has a composite or task
3447 type, don't elaborate it. We return the result in case it has any
3448 SAVE_EXPRs in it that need to be evaluated here. */
3449 if (!Is_Renaming_Of_Object (gnat_temp
)
3450 && ! (type_annotate_only
3451 && (Is_Array_Type (Etype (gnat_temp
))
3452 || Is_Record_Type (Etype (gnat_temp
))
3453 || Is_Concurrent_Type (Etype (gnat_temp
)))))
3455 = gnat_to_gnu_entity (gnat_temp
,
3456 gnat_to_gnu (Renamed_Object (gnat_temp
)), 1);
3458 gnu_result
= alloc_stmt_list ();
3461 case N_Implicit_Label_Declaration
:
3462 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
3463 gnu_result
= alloc_stmt_list ();
3466 case N_Exception_Renaming_Declaration
:
3467 case N_Number_Declaration
:
3468 case N_Package_Renaming_Declaration
:
3469 case N_Subprogram_Renaming_Declaration
:
3470 /* These are fully handled in the front end. */
3471 gnu_result
= alloc_stmt_list ();
3474 /*************************************/
3475 /* Chapter 4: Names and Expressions: */
3476 /*************************************/
3478 case N_Explicit_Dereference
:
3479 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3480 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3481 gnu_result
= build_unary_op (INDIRECT_REF
, NULL_TREE
, gnu_result
);
3484 case N_Indexed_Component
:
3486 tree gnu_array_object
= gnat_to_gnu (Prefix (gnat_node
));
3490 Node_Id
*gnat_expr_array
;
3492 gnu_array_object
= maybe_implicit_deref (gnu_array_object
);
3493 gnu_array_object
= maybe_unconstrained_array (gnu_array_object
);
3495 /* If we got a padded type, remove it too. */
3496 if (TREE_CODE (TREE_TYPE (gnu_array_object
)) == RECORD_TYPE
3497 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object
)))
3499 = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object
))),
3502 gnu_result
= gnu_array_object
;
3504 /* First compute the number of dimensions of the array, then
3505 fill the expression array, the order depending on whether
3506 this is a Convention_Fortran array or not. */
3507 for (ndim
= 1, gnu_type
= TREE_TYPE (gnu_array_object
);
3508 TREE_CODE (TREE_TYPE (gnu_type
)) == ARRAY_TYPE
3509 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type
));
3510 ndim
++, gnu_type
= TREE_TYPE (gnu_type
))
3513 gnat_expr_array
= (Node_Id
*) alloca (ndim
* sizeof (Node_Id
));
3515 if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object
)))
3516 for (i
= ndim
- 1, gnat_temp
= First (Expressions (gnat_node
));
3518 i
--, gnat_temp
= Next (gnat_temp
))
3519 gnat_expr_array
[i
] = gnat_temp
;
3521 for (i
= 0, gnat_temp
= First (Expressions (gnat_node
));
3523 i
++, gnat_temp
= Next (gnat_temp
))
3524 gnat_expr_array
[i
] = gnat_temp
;
3526 for (i
= 0, gnu_type
= TREE_TYPE (gnu_array_object
);
3527 i
< ndim
; i
++, gnu_type
= TREE_TYPE (gnu_type
))
3529 gcc_assert (TREE_CODE (gnu_type
) == ARRAY_TYPE
);
3530 gnat_temp
= gnat_expr_array
[i
];
3531 gnu_expr
= gnat_to_gnu (gnat_temp
);
3533 if (Do_Range_Check (gnat_temp
))
3536 (gnu_array_object
, gnu_expr
,
3537 TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))),
3538 TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
))));
3540 gnu_result
= build_binary_op (ARRAY_REF
, NULL_TREE
,
3541 gnu_result
, gnu_expr
);
3545 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3551 Node_Id gnat_range_node
= Discrete_Range (gnat_node
);
3553 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3554 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3556 /* Do any implicit dereferences of the prefix and do any needed
3558 gnu_result
= maybe_implicit_deref (gnu_result
);
3559 gnu_result
= maybe_unconstrained_array (gnu_result
);
3560 gnu_type
= TREE_TYPE (gnu_result
);
3561 if (Do_Range_Check (gnat_range_node
))
3563 /* Get the bounds of the slice. */
3565 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type
));
3566 tree gnu_min_expr
= TYPE_MIN_VALUE (gnu_index_type
);
3567 tree gnu_max_expr
= TYPE_MAX_VALUE (gnu_index_type
);
3568 /* Get the permitted bounds. */
3569 tree gnu_base_index_type
3570 = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type
));
3571 tree gnu_base_min_expr
= SUBSTITUTE_PLACEHOLDER_IN_EXPR
3572 (TYPE_MIN_VALUE (gnu_base_index_type
), gnu_result
);
3573 tree gnu_base_max_expr
= SUBSTITUTE_PLACEHOLDER_IN_EXPR
3574 (TYPE_MAX_VALUE (gnu_base_index_type
), gnu_result
);
3575 tree gnu_expr_l
, gnu_expr_h
, gnu_expr_type
;
3577 gnu_min_expr
= protect_multiple_eval (gnu_min_expr
);
3578 gnu_max_expr
= protect_multiple_eval (gnu_max_expr
);
3580 /* Derive a good type to convert everything to. */
3581 gnu_expr_type
= get_base_type (TREE_TYPE (gnu_index_type
));
3583 /* Test whether the minimum slice value is too small. */
3584 gnu_expr_l
= build_binary_op (LT_EXPR
, integer_type_node
,
3585 convert (gnu_expr_type
,
3587 convert (gnu_expr_type
,
3588 gnu_base_min_expr
));
3590 /* Test whether the maximum slice value is too large. */
3591 gnu_expr_h
= build_binary_op (GT_EXPR
, integer_type_node
,
3592 convert (gnu_expr_type
,
3594 convert (gnu_expr_type
,
3595 gnu_base_max_expr
));
3597 /* Build a slice index check that returns the low bound,
3598 assuming the slice is not empty. */
3599 gnu_expr
= emit_check
3600 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
3601 gnu_expr_l
, gnu_expr_h
),
3602 gnu_min_expr
, CE_Index_Check_Failed
);
3604 /* Build a conditional expression that does the index checks and
3605 returns the low bound if the slice is not empty (max >= min),
3606 and returns the naked low bound otherwise (max < min), unless
3607 it is non-constant and the high bound is; this prevents VRP
3608 from inferring bogus ranges on the unlikely path. */
3609 gnu_expr
= fold_build3 (COND_EXPR
, gnu_expr_type
,
3610 build_binary_op (GE_EXPR
, gnu_expr_type
,
3611 convert (gnu_expr_type
,
3613 convert (gnu_expr_type
,
3616 TREE_CODE (gnu_min_expr
) != INTEGER_CST
3617 && TREE_CODE (gnu_max_expr
) == INTEGER_CST
3618 ? gnu_max_expr
: gnu_min_expr
);
3621 /* Simply return the naked low bound. */
3622 gnu_expr
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type
));
3624 gnu_result
= build_binary_op (ARRAY_RANGE_REF
, gnu_result_type
,
3625 gnu_result
, gnu_expr
);
3629 case N_Selected_Component
:
3631 tree gnu_prefix
= gnat_to_gnu (Prefix (gnat_node
));
3632 Entity_Id gnat_field
= Entity (Selector_Name (gnat_node
));
3633 Entity_Id gnat_pref_type
= Etype (Prefix (gnat_node
));
3636 while (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
)
3637 || IN (Ekind (gnat_pref_type
), Access_Kind
))
3639 if (IN (Ekind (gnat_pref_type
), Incomplete_Or_Private_Kind
))
3640 gnat_pref_type
= Underlying_Type (gnat_pref_type
);
3641 else if (IN (Ekind (gnat_pref_type
), Access_Kind
))
3642 gnat_pref_type
= Designated_Type (gnat_pref_type
);
3645 gnu_prefix
= maybe_implicit_deref (gnu_prefix
);
3647 /* For discriminant references in tagged types always substitute the
3648 corresponding discriminant as the actual selected component. */
3650 if (Is_Tagged_Type (gnat_pref_type
))
3651 while (Present (Corresponding_Discriminant (gnat_field
)))
3652 gnat_field
= Corresponding_Discriminant (gnat_field
);
3654 /* For discriminant references of untagged types always substitute the
3655 corresponding stored discriminant. */
3657 else if (Present (Corresponding_Discriminant (gnat_field
)))
3658 gnat_field
= Original_Record_Component (gnat_field
);
3660 /* Handle extracting the real or imaginary part of a complex.
3661 The real part is the first field and the imaginary the last. */
3663 if (TREE_CODE (TREE_TYPE (gnu_prefix
)) == COMPLEX_TYPE
)
3664 gnu_result
= build_unary_op (Present (Next_Entity (gnat_field
))
3665 ? REALPART_EXPR
: IMAGPART_EXPR
,
3666 NULL_TREE
, gnu_prefix
);
3669 gnu_field
= gnat_to_gnu_field_decl (gnat_field
);
3671 /* If there are discriminants, the prefix might be
3672 evaluated more than once, which is a problem if it has
3674 if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node
)))
3675 ? Designated_Type (Etype
3676 (Prefix (gnat_node
)))
3677 : Etype (Prefix (gnat_node
))))
3678 gnu_prefix
= gnat_stabilize_reference (gnu_prefix
, false);
3681 = build_component_ref (gnu_prefix
, NULL_TREE
, gnu_field
,
3682 (Nkind (Parent (gnat_node
))
3683 == N_Attribute_Reference
));
3686 gcc_assert (gnu_result
);
3687 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3691 case N_Attribute_Reference
:
3693 /* The attribute designator (like an enumeration value). */
3694 int attribute
= Get_Attribute_Id (Attribute_Name (gnat_node
));
3696 /* The Elab_Spec and Elab_Body attributes are special in that
3697 Prefix is a unit, not an object with a GCC equivalent. Similarly
3698 for Elaborated, since that variable isn't otherwise known. */
3699 if (attribute
== Attr_Elab_Body
|| attribute
== Attr_Elab_Spec
)
3700 return (create_subprog_decl
3701 (create_concat_name (Entity (Prefix (gnat_node
)),
3702 attribute
== Attr_Elab_Body
3703 ? "elabb" : "elabs"),
3704 NULL_TREE
, void_ftype
, NULL_TREE
, false, true, true, NULL
,
3707 gnu_result
= Attribute_to_gnu (gnat_node
, &gnu_result_type
, attribute
);
3712 /* Like 'Access as far as we are concerned. */
3713 gnu_result
= gnat_to_gnu (Prefix (gnat_node
));
3714 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3715 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3719 case N_Extension_Aggregate
:
3723 /* ??? It is wrong to evaluate the type now, but there doesn't
3724 seem to be any other practical way of doing it. */
3726 gcc_assert (!Expansion_Delayed (gnat_node
));
3728 gnu_aggr_type
= gnu_result_type
3729 = get_unpadded_type (Etype (gnat_node
));
3731 if (TREE_CODE (gnu_result_type
) == RECORD_TYPE
3732 && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type
))
3734 = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type
)));
3736 if (Null_Record_Present (gnat_node
))
3737 gnu_result
= gnat_build_constructor (gnu_aggr_type
, NULL_TREE
);
3739 else if (TREE_CODE (gnu_aggr_type
) == RECORD_TYPE
3740 || TREE_CODE (gnu_aggr_type
) == UNION_TYPE
)
3742 = assoc_to_constructor (Etype (gnat_node
),
3743 First (Component_Associations (gnat_node
)),
3745 else if (TREE_CODE (gnu_aggr_type
) == ARRAY_TYPE
)
3746 gnu_result
= pos_to_constructor (First (Expressions (gnat_node
)),
3748 Component_Type (Etype (gnat_node
)));
3749 else if (TREE_CODE (gnu_aggr_type
) == COMPLEX_TYPE
)
3752 (COMPLEX_EXPR
, gnu_aggr_type
,
3753 gnat_to_gnu (Expression (First
3754 (Component_Associations (gnat_node
)))),
3755 gnat_to_gnu (Expression
3757 (First (Component_Associations (gnat_node
))))));
3761 gnu_result
= convert (gnu_result_type
, gnu_result
);
3766 if (TARGET_VTABLE_USES_DESCRIPTORS
3767 && Ekind (Etype (gnat_node
)) == E_Access_Subprogram_Type
3768 && Is_Dispatch_Table_Entity (Etype (gnat_node
)))
3769 gnu_result
= null_fdesc_node
;
3771 gnu_result
= null_pointer_node
;
3772 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3775 case N_Type_Conversion
:
3776 case N_Qualified_Expression
:
3777 /* Get the operand expression. */
3778 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3779 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3782 = convert_with_check (Etype (gnat_node
), gnu_result
,
3783 Do_Overflow_Check (gnat_node
),
3784 Do_Range_Check (Expression (gnat_node
)),
3785 Nkind (gnat_node
) == N_Type_Conversion
3786 && Float_Truncate (gnat_node
));
3789 case N_Unchecked_Type_Conversion
:
3790 gnu_result
= gnat_to_gnu (Expression (gnat_node
));
3791 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3793 /* If the result is a pointer type, see if we are improperly
3794 converting to a stricter alignment. */
3795 if (STRICT_ALIGNMENT
&& POINTER_TYPE_P (gnu_result_type
)
3796 && IN (Ekind (Etype (gnat_node
)), Access_Kind
))
3798 unsigned int align
= known_alignment (gnu_result
);
3799 tree gnu_obj_type
= TREE_TYPE (gnu_result_type
);
3800 unsigned int oalign
= TYPE_ALIGN (gnu_obj_type
);
3802 if (align
!= 0 && align
< oalign
&& !TYPE_ALIGN_OK (gnu_obj_type
))
3803 post_error_ne_tree_2
3804 ("?source alignment (^) '< alignment of & (^)",
3805 gnat_node
, Designated_Type (Etype (gnat_node
)),
3806 size_int (align
/ BITS_PER_UNIT
), oalign
/ BITS_PER_UNIT
);
3809 /* If we are converting a descriptor to a function pointer, first
3810 build the pointer. */
3811 if (TARGET_VTABLE_USES_DESCRIPTORS
3812 && TREE_TYPE (gnu_result
) == fdesc_type_node
3813 && POINTER_TYPE_P (gnu_result_type
))
3814 gnu_result
= build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_result
);
3816 gnu_result
= unchecked_convert (gnu_result_type
, gnu_result
,
3817 No_Truncation (gnat_node
));
3823 tree gnu_object
= gnat_to_gnu (Left_Opnd (gnat_node
));
3824 Node_Id gnat_range
= Right_Opnd (gnat_node
);
3828 /* GNAT_RANGE is either an N_Range node or an identifier
3829 denoting a subtype. */
3830 if (Nkind (gnat_range
) == N_Range
)
3832 gnu_low
= gnat_to_gnu (Low_Bound (gnat_range
));
3833 gnu_high
= gnat_to_gnu (High_Bound (gnat_range
));
3835 else if (Nkind (gnat_range
) == N_Identifier
3836 || Nkind (gnat_range
) == N_Expanded_Name
)
3838 tree gnu_range_type
= get_unpadded_type (Entity (gnat_range
));
3840 gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
3841 gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
3846 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3848 /* If LOW and HIGH are identical, perform an equality test.
3849 Otherwise, ensure that GNU_OBJECT is only evaluated once
3850 and perform a full range test. */
3851 if (operand_equal_p (gnu_low
, gnu_high
, 0))
3852 gnu_result
= build_binary_op (EQ_EXPR
, gnu_result_type
,
3853 gnu_object
, gnu_low
);
3856 gnu_object
= protect_multiple_eval (gnu_object
);
3858 = build_binary_op (TRUTH_ANDIF_EXPR
, gnu_result_type
,
3859 build_binary_op (GE_EXPR
, gnu_result_type
,
3860 gnu_object
, gnu_low
),
3861 build_binary_op (LE_EXPR
, gnu_result_type
,
3862 gnu_object
, gnu_high
));
3865 if (Nkind (gnat_node
) == N_Not_In
)
3866 gnu_result
= invert_truthvalue (gnu_result
);
3871 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3872 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3873 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3874 gnu_result
= build_binary_op (FLOAT_TYPE_P (gnu_result_type
)
3876 : (Rounded_Result (gnat_node
)
3877 ? ROUND_DIV_EXPR
: TRUNC_DIV_EXPR
),
3878 gnu_result_type
, gnu_lhs
, gnu_rhs
);
3881 case N_Op_Or
: case N_Op_And
: case N_Op_Xor
:
3882 /* These can either be operations on booleans or on modular types.
3883 Fall through for boolean types since that's the way GNU_CODES is
3885 if (IN (Ekind (Underlying_Type (Etype (gnat_node
))),
3886 Modular_Integer_Kind
))
3889 = (Nkind (gnat_node
) == N_Op_Or
? BIT_IOR_EXPR
3890 : Nkind (gnat_node
) == N_Op_And
? BIT_AND_EXPR
3893 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3894 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3895 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3896 gnu_result
= build_binary_op (code
, gnu_result_type
,
3901 /* ... fall through ... */
3903 case N_Op_Eq
: case N_Op_Ne
: case N_Op_Lt
:
3904 case N_Op_Le
: case N_Op_Gt
: case N_Op_Ge
:
3905 case N_Op_Add
: case N_Op_Subtract
: case N_Op_Multiply
:
3906 case N_Op_Mod
: case N_Op_Rem
:
3907 case N_Op_Rotate_Left
:
3908 case N_Op_Rotate_Right
:
3909 case N_Op_Shift_Left
:
3910 case N_Op_Shift_Right
:
3911 case N_Op_Shift_Right_Arithmetic
:
3912 case N_And_Then
: case N_Or_Else
:
3914 enum tree_code code
= gnu_codes
[Nkind (gnat_node
)];
3915 bool ignore_lhs_overflow
= false;
3918 gnu_lhs
= gnat_to_gnu (Left_Opnd (gnat_node
));
3919 gnu_rhs
= gnat_to_gnu (Right_Opnd (gnat_node
));
3920 gnu_type
= gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
3922 /* If this is a comparison operator, convert any references to
3923 an unconstrained array value into a reference to the
3925 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3927 gnu_lhs
= maybe_unconstrained_array (gnu_lhs
);
3928 gnu_rhs
= maybe_unconstrained_array (gnu_rhs
);
3931 /* If the result type is a private type, its full view may be a
3932 numeric subtype. The representation we need is that of its base
3933 type, given that it is the result of an arithmetic operation. */
3934 else if (Is_Private_Type (Etype (gnat_node
)))
3935 gnu_type
= gnu_result_type
3936 = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node
))));
3938 /* If this is a shift whose count is not guaranteed to be correct,
3939 we need to adjust the shift count. */
3940 if (IN (Nkind (gnat_node
), N_Op_Shift
)
3941 && !Shift_Count_OK (gnat_node
))
3943 tree gnu_count_type
= get_base_type (TREE_TYPE (gnu_rhs
));
3945 = convert (gnu_count_type
, TYPE_SIZE (gnu_type
));
3947 if (Nkind (gnat_node
) == N_Op_Rotate_Left
3948 || Nkind (gnat_node
) == N_Op_Rotate_Right
)
3949 gnu_rhs
= build_binary_op (TRUNC_MOD_EXPR
, gnu_count_type
,
3950 gnu_rhs
, gnu_max_shift
);
3951 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
)
3954 (MIN_EXPR
, gnu_count_type
,
3955 build_binary_op (MINUS_EXPR
,
3958 convert (gnu_count_type
,
3963 /* For right shifts, the type says what kind of shift to do,
3964 so we may need to choose a different type. In this case,
3965 we have to ignore integer overflow lest it propagates all
3966 the way down and causes a CE to be explicitly raised. */
3967 if (Nkind (gnat_node
) == N_Op_Shift_Right
3968 && !TYPE_UNSIGNED (gnu_type
))
3970 gnu_type
= gnat_unsigned_type (gnu_type
);
3971 ignore_lhs_overflow
= true;
3973 else if (Nkind (gnat_node
) == N_Op_Shift_Right_Arithmetic
3974 && TYPE_UNSIGNED (gnu_type
))
3976 gnu_type
= gnat_signed_type (gnu_type
);
3977 ignore_lhs_overflow
= true;
3980 if (gnu_type
!= gnu_result_type
)
3982 tree gnu_old_lhs
= gnu_lhs
;
3983 gnu_lhs
= convert (gnu_type
, gnu_lhs
);
3984 if (TREE_CODE (gnu_lhs
) == INTEGER_CST
&& ignore_lhs_overflow
)
3985 TREE_OVERFLOW (gnu_lhs
) = TREE_OVERFLOW (gnu_old_lhs
);
3986 gnu_rhs
= convert (gnu_type
, gnu_rhs
);
3989 /* Instead of expanding overflow checks for addition, subtraction
3990 and multiplication itself, the front end will leave this to
3991 the back end when Backend_Overflow_Checks_On_Target is set.
3992 As the GCC back end itself does not know yet how to properly
3993 do overflow checking, do it here. The goal is to push
3994 the expansions further into the back end over time. */
3995 if (Do_Overflow_Check (gnat_node
) && Backend_Overflow_Checks_On_Target
3996 && (Nkind (gnat_node
) == N_Op_Add
3997 || Nkind (gnat_node
) == N_Op_Subtract
3998 || Nkind (gnat_node
) == N_Op_Multiply
)
3999 && !TYPE_UNSIGNED (gnu_type
)
4000 && !FLOAT_TYPE_P (gnu_type
))
4002 = build_binary_op_trapv (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
4004 gnu_result
= build_binary_op (code
, gnu_type
, gnu_lhs
, gnu_rhs
);
4006 /* If this is a logical shift with the shift count not verified,
4007 we must return zero if it is too large. We cannot compensate
4008 above in this case. */
4009 if ((Nkind (gnat_node
) == N_Op_Shift_Left
4010 || Nkind (gnat_node
) == N_Op_Shift_Right
)
4011 && !Shift_Count_OK (gnat_node
))
4015 build_binary_op (GE_EXPR
, integer_type_node
,
4017 convert (TREE_TYPE (gnu_rhs
),
4018 TYPE_SIZE (gnu_type
))),
4019 convert (gnu_type
, integer_zero_node
),
4024 case N_Conditional_Expression
:
4026 tree gnu_cond
= gnat_to_gnu (First (Expressions (gnat_node
)));
4027 tree gnu_true
= gnat_to_gnu (Next (First (Expressions (gnat_node
))));
4029 = gnat_to_gnu (Next (Next (First (Expressions (gnat_node
)))));
4031 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4032 gnu_result
= build_cond_expr (gnu_result_type
,
4033 gnat_truthvalue_conversion (gnu_cond
),
4034 gnu_true
, gnu_false
);
4039 gnu_result
= gnat_to_gnu (Right_Opnd (gnat_node
));
4040 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4044 /* This case can apply to a boolean or a modular type.
4045 Fall through for a boolean operand since GNU_CODES is set
4046 up to handle this. */
4047 if (Is_Modular_Integer_Type (Etype (gnat_node
))
4048 || (Ekind (Etype (gnat_node
)) == E_Private_Type
4049 && Is_Modular_Integer_Type (Full_View (Etype (gnat_node
)))))
4051 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4052 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4053 gnu_result
= build_unary_op (BIT_NOT_EXPR
, gnu_result_type
,
4058 /* ... fall through ... */
4060 case N_Op_Minus
: case N_Op_Abs
:
4061 gnu_expr
= gnat_to_gnu (Right_Opnd (gnat_node
));
4063 if (Ekind (Etype (gnat_node
)) != E_Private_Type
)
4064 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4066 gnu_result_type
= get_unpadded_type (Base_Type
4067 (Full_View (Etype (gnat_node
))));
4069 if (Do_Overflow_Check (gnat_node
)
4070 && !TYPE_UNSIGNED (gnu_result_type
)
4071 && !FLOAT_TYPE_P (gnu_result_type
))
4072 gnu_result
= build_unary_op_trapv (gnu_codes
[Nkind (gnat_node
)],
4073 gnu_result_type
, gnu_expr
);
4075 gnu_result
= build_unary_op (gnu_codes
[Nkind (gnat_node
)],
4076 gnu_result_type
, gnu_expr
);
4083 bool ignore_init_type
= false;
4085 gnat_temp
= Expression (gnat_node
);
4087 /* The Expression operand can either be an N_Identifier or
4088 Expanded_Name, which must represent a type, or a
4089 N_Qualified_Expression, which contains both the object type and an
4090 initial value for the object. */
4091 if (Nkind (gnat_temp
) == N_Identifier
4092 || Nkind (gnat_temp
) == N_Expanded_Name
)
4093 gnu_type
= gnat_to_gnu_type (Entity (gnat_temp
));
4094 else if (Nkind (gnat_temp
) == N_Qualified_Expression
)
4096 Entity_Id gnat_desig_type
4097 = Designated_Type (Underlying_Type (Etype (gnat_node
)));
4099 ignore_init_type
= Has_Constrained_Partial_View (gnat_desig_type
);
4100 gnu_init
= gnat_to_gnu (Expression (gnat_temp
));
4102 gnu_init
= maybe_unconstrained_array (gnu_init
);
4103 if (Do_Range_Check (Expression (gnat_temp
)))
4104 gnu_init
= emit_range_check (gnu_init
, gnat_desig_type
);
4106 if (Is_Elementary_Type (gnat_desig_type
)
4107 || Is_Constrained (gnat_desig_type
))
4109 gnu_type
= gnat_to_gnu_type (gnat_desig_type
);
4110 gnu_init
= convert (gnu_type
, gnu_init
);
4114 gnu_type
= gnat_to_gnu_type (Etype (Expression (gnat_temp
)));
4115 if (TREE_CODE (gnu_type
) == UNCONSTRAINED_ARRAY_TYPE
)
4116 gnu_type
= TREE_TYPE (gnu_init
);
4118 gnu_init
= convert (gnu_type
, gnu_init
);
4124 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4125 return build_allocator (gnu_type
, gnu_init
, gnu_result_type
,
4126 Procedure_To_Call (gnat_node
),
4127 Storage_Pool (gnat_node
), gnat_node
,
4132 /***************************/
4133 /* Chapter 5: Statements: */
4134 /***************************/
4137 gnu_result
= build1 (LABEL_EXPR
, void_type_node
,
4138 gnat_to_gnu (Identifier (gnat_node
)));
4141 case N_Null_Statement
:
4142 gnu_result
= alloc_stmt_list ();
4145 case N_Assignment_Statement
:
4146 /* Get the LHS and RHS of the statement and convert any reference to an
4147 unconstrained array into a reference to the underlying array.
4148 If we are not to do range checking and the RHS is an N_Function_Call,
4149 pass the LHS to the call function. */
4150 gnu_lhs
= maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node
)));
4152 /* If the type has a size that overflows, convert this into raise of
4153 Storage_Error: execution shouldn't have gotten here anyway. */
4154 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))) == INTEGER_CST
4155 && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs
))))
4156 gnu_result
= build_call_raise (SE_Object_Too_Large
, gnat_node
,
4157 N_Raise_Storage_Error
);
4158 else if (Nkind (Expression (gnat_node
)) == N_Function_Call
4159 && !Do_Range_Check (Expression (gnat_node
)))
4160 gnu_result
= call_to_gnu (Expression (gnat_node
),
4161 &gnu_result_type
, gnu_lhs
);
4165 = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node
)));
4167 /* If range check is needed, emit code to generate it. */
4168 if (Do_Range_Check (Expression (gnat_node
)))
4169 gnu_rhs
= emit_range_check (gnu_rhs
, Etype (Name (gnat_node
)));
4172 = build_binary_op (MODIFY_EXPR
, NULL_TREE
, gnu_lhs
, gnu_rhs
);
4174 /* If the type being assigned is an array type and the two sides
4175 are not completely disjoint, play safe and use memmove. */
4176 if (TREE_CODE (gnu_result
) == MODIFY_EXPR
4177 && Is_Array_Type (Etype (Name (gnat_node
)))
4178 && !(Forwards_OK (gnat_node
) && Backwards_OK (gnat_node
)))
4180 tree to
, from
, size
, to_ptr
, from_ptr
, t
;
4182 to
= TREE_OPERAND (gnu_result
, 0);
4183 from
= TREE_OPERAND (gnu_result
, 1);
4185 size
= TYPE_SIZE_UNIT (TREE_TYPE (from
));
4186 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, from
);
4188 to_ptr
= build_fold_addr_expr (to
);
4189 from_ptr
= build_fold_addr_expr (from
);
4191 t
= implicit_built_in_decls
[BUILT_IN_MEMMOVE
];
4192 gnu_result
= build_call_expr (t
, 3, to_ptr
, from_ptr
, size
);
4197 case N_If_Statement
:
4199 tree
*gnu_else_ptr
; /* Point to put next "else if" or "else". */
4201 /* Make the outer COND_EXPR. Avoid non-determinism. */
4202 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4203 gnat_to_gnu (Condition (gnat_node
)),
4204 NULL_TREE
, NULL_TREE
);
4205 COND_EXPR_THEN (gnu_result
)
4206 = build_stmt_group (Then_Statements (gnat_node
), false);
4207 TREE_SIDE_EFFECTS (gnu_result
) = 1;
4208 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_result
);
4210 /* Now make a COND_EXPR for each of the "else if" parts. Put each
4211 into the previous "else" part and point to where to put any
4212 outer "else". Also avoid non-determinism. */
4213 if (Present (Elsif_Parts (gnat_node
)))
4214 for (gnat_temp
= First (Elsif_Parts (gnat_node
));
4215 Present (gnat_temp
); gnat_temp
= Next (gnat_temp
))
4217 gnu_expr
= build3 (COND_EXPR
, void_type_node
,
4218 gnat_to_gnu (Condition (gnat_temp
)),
4219 NULL_TREE
, NULL_TREE
);
4220 COND_EXPR_THEN (gnu_expr
)
4221 = build_stmt_group (Then_Statements (gnat_temp
), false);
4222 TREE_SIDE_EFFECTS (gnu_expr
) = 1;
4223 set_expr_location_from_node (gnu_expr
, gnat_temp
);
4224 *gnu_else_ptr
= gnu_expr
;
4225 gnu_else_ptr
= &COND_EXPR_ELSE (gnu_expr
);
4228 *gnu_else_ptr
= build_stmt_group (Else_Statements (gnat_node
), false);
4232 case N_Case_Statement
:
4233 gnu_result
= Case_Statement_to_gnu (gnat_node
);
4236 case N_Loop_Statement
:
4237 gnu_result
= Loop_Statement_to_gnu (gnat_node
);
4240 case N_Block_Statement
:
4241 start_stmt_group ();
4243 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4244 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4246 gnu_result
= end_stmt_group ();
4248 if (Present (Identifier (gnat_node
)))
4249 mark_out_of_scope (Entity (Identifier (gnat_node
)));
4252 case N_Exit_Statement
:
4254 = build2 (EXIT_STMT
, void_type_node
,
4255 (Present (Condition (gnat_node
))
4256 ? gnat_to_gnu (Condition (gnat_node
)) : NULL_TREE
),
4257 (Present (Name (gnat_node
))
4258 ? get_gnu_tree (Entity (Name (gnat_node
)))
4259 : TREE_VALUE (gnu_loop_label_stack
)));
4262 case N_Return_Statement
:
4264 /* The gnu function type of the subprogram currently processed. */
4265 tree gnu_subprog_type
= TREE_TYPE (current_function_decl
);
4266 /* The return value from the subprogram. */
4267 tree gnu_ret_val
= NULL_TREE
;
4268 /* The place to put the return value. */
4271 /* If we are dealing with a "return;" from an Ada procedure with
4272 parameters passed by copy in copy out, we need to return a record
4273 containing the final values of these parameters. If the list
4274 contains only one entry, return just that entry.
4276 For a full description of the copy in copy out parameter mechanism,
4277 see the part of the gnat_to_gnu_entity routine dealing with the
4278 translation of subprograms.
4280 But if we have a return label defined, convert this into
4281 a branch to that label. */
4283 if (TREE_VALUE (gnu_return_label_stack
))
4285 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4286 TREE_VALUE (gnu_return_label_stack
));
4290 else if (TYPE_CI_CO_LIST (gnu_subprog_type
))
4292 gnu_lhs
= DECL_RESULT (current_function_decl
);
4293 if (list_length (TYPE_CI_CO_LIST (gnu_subprog_type
)) == 1)
4294 gnu_ret_val
= TREE_VALUE (TYPE_CI_CO_LIST (gnu_subprog_type
));
4297 = gnat_build_constructor (TREE_TYPE (gnu_subprog_type
),
4298 TYPE_CI_CO_LIST (gnu_subprog_type
));
4301 /* If the Ada subprogram is a function, we just need to return the
4302 expression. If the subprogram returns an unconstrained
4303 array, we have to allocate a new version of the result and
4304 return it. If we return by reference, return a pointer. */
4306 else if (Present (Expression (gnat_node
)))
4308 /* If the current function returns by target pointer and we
4309 are doing a call, pass that target to the call. */
4310 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
)
4311 && Nkind (Expression (gnat_node
)) == N_Function_Call
)
4314 = build_unary_op (INDIRECT_REF
, NULL_TREE
,
4315 DECL_ARGUMENTS (current_function_decl
));
4316 gnu_result
= call_to_gnu (Expression (gnat_node
),
4317 &gnu_result_type
, gnu_lhs
);
4321 gnu_ret_val
= gnat_to_gnu (Expression (gnat_node
));
4323 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4324 /* The original return type was unconstrained so dereference
4325 the TARGET pointer in the actual return value's type. */
4327 = build_unary_op (INDIRECT_REF
, TREE_TYPE (gnu_ret_val
),
4328 DECL_ARGUMENTS (current_function_decl
));
4330 gnu_lhs
= DECL_RESULT (current_function_decl
);
4332 /* Do not remove the padding from GNU_RET_VAL if the inner
4333 type is self-referential since we want to allocate the fixed
4334 size in that case. */
4335 if (TREE_CODE (gnu_ret_val
) == COMPONENT_REF
4336 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0)))
4338 && (TYPE_IS_PADDING_P
4339 (TREE_TYPE (TREE_OPERAND (gnu_ret_val
, 0))))
4340 && (CONTAINS_PLACEHOLDER_P
4341 (TYPE_SIZE (TREE_TYPE (gnu_ret_val
)))))
4342 gnu_ret_val
= TREE_OPERAND (gnu_ret_val
, 0);
4344 if (TYPE_RETURNS_BY_REF_P (gnu_subprog_type
)
4345 || By_Ref (gnat_node
))
4347 = build_unary_op (ADDR_EXPR
, NULL_TREE
, gnu_ret_val
);
4349 else if (TYPE_RETURNS_UNCONSTRAINED_P (gnu_subprog_type
))
4351 gnu_ret_val
= maybe_unconstrained_array (gnu_ret_val
);
4353 = build_allocator (TREE_TYPE (gnu_ret_val
),
4355 TREE_TYPE (gnu_subprog_type
),
4356 Procedure_To_Call (gnat_node
),
4357 Storage_Pool (gnat_node
),
4363 /* If the Ada subprogram is a regular procedure, just return. */
4364 gnu_lhs
= NULL_TREE
;
4366 if (TYPE_RETURNS_BY_TARGET_PTR_P (gnu_subprog_type
))
4369 gnu_result
= build_binary_op (MODIFY_EXPR
, NULL_TREE
,
4370 gnu_lhs
, gnu_ret_val
);
4371 add_stmt_with_node (gnu_result
, gnat_node
);
4372 gnu_lhs
= NULL_TREE
;
4375 gnu_result
= build_return_expr (gnu_lhs
, gnu_ret_val
);
4379 case N_Goto_Statement
:
4380 gnu_result
= build1 (GOTO_EXPR
, void_type_node
,
4381 gnat_to_gnu (Name (gnat_node
)));
4384 /****************************/
4385 /* Chapter 6: Subprograms: */
4386 /****************************/
4388 case N_Subprogram_Declaration
:
4389 /* Unless there is a freeze node, declare the subprogram. We consider
4390 this a "definition" even though we're not generating code for
4391 the subprogram because we will be making the corresponding GCC
4394 if (No (Freeze_Node (Defining_Entity (Specification (gnat_node
)))))
4395 gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node
)),
4397 gnu_result
= alloc_stmt_list ();
4400 case N_Abstract_Subprogram_Declaration
:
4401 /* This subprogram doesn't exist for code generation purposes, but we
4402 have to elaborate the types of any parameters and result, unless
4403 they are imported types (nothing to generate in this case). */
4405 /* Process the parameter types first. */
4408 = First_Formal_With_Extras
4409 (Defining_Entity (Specification (gnat_node
)));
4410 Present (gnat_temp
);
4411 gnat_temp
= Next_Formal_With_Extras (gnat_temp
))
4412 if (Is_Itype (Etype (gnat_temp
))
4413 && !From_With_Type (Etype (gnat_temp
)))
4414 gnat_to_gnu_entity (Etype (gnat_temp
), NULL_TREE
, 0);
4417 /* Then the result type, set to Standard_Void_Type for procedures. */
4420 Entity_Id gnat_temp_type
4421 = Etype (Defining_Entity (Specification (gnat_node
)));
4423 if (Is_Itype (gnat_temp_type
) && !From_With_Type (gnat_temp_type
))
4424 gnat_to_gnu_entity (Etype (gnat_temp_type
), NULL_TREE
, 0);
4427 gnu_result
= alloc_stmt_list ();
4430 case N_Defining_Program_Unit_Name
:
4431 /* For a child unit identifier go up a level to get the
4432 specification. We get this when we try to find the spec of
4433 a child unit package that is the compilation unit being compiled. */
4434 gnu_result
= gnat_to_gnu (Parent (gnat_node
));
4437 case N_Subprogram_Body
:
4438 Subprogram_Body_to_gnu (gnat_node
);
4439 gnu_result
= alloc_stmt_list ();
4442 case N_Function_Call
:
4443 case N_Procedure_Call_Statement
:
4444 gnu_result
= call_to_gnu (gnat_node
, &gnu_result_type
, NULL_TREE
);
4447 /*************************/
4448 /* Chapter 7: Packages: */
4449 /*************************/
4451 case N_Package_Declaration
:
4452 gnu_result
= gnat_to_gnu (Specification (gnat_node
));
4455 case N_Package_Specification
:
4457 start_stmt_group ();
4458 process_decls (Visible_Declarations (gnat_node
),
4459 Private_Declarations (gnat_node
), Empty
, true, true);
4460 gnu_result
= end_stmt_group ();
4463 case N_Package_Body
:
4465 /* If this is the body of a generic package - do nothing */
4466 if (Ekind (Corresponding_Spec (gnat_node
)) == E_Generic_Package
)
4468 gnu_result
= alloc_stmt_list ();
4472 start_stmt_group ();
4473 process_decls (Declarations (gnat_node
), Empty
, Empty
, true, true);
4475 if (Present (Handled_Statement_Sequence (gnat_node
)))
4476 add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node
)));
4478 gnu_result
= end_stmt_group ();
4481 /*********************************/
4482 /* Chapter 8: Visibility Rules: */
4483 /*********************************/
4485 case N_Use_Package_Clause
:
4486 case N_Use_Type_Clause
:
4487 /* Nothing to do here - but these may appear in list of declarations */
4488 gnu_result
= alloc_stmt_list ();
4491 /***********************/
4492 /* Chapter 9: Tasks: */
4493 /***********************/
4495 case N_Protected_Type_Declaration
:
4496 gnu_result
= alloc_stmt_list ();
4499 case N_Single_Task_Declaration
:
4500 gnat_to_gnu_entity (Defining_Entity (gnat_node
), NULL_TREE
, 1);
4501 gnu_result
= alloc_stmt_list ();
4504 /***********************************************************/
4505 /* Chapter 10: Program Structure and Compilation Issues: */
4506 /***********************************************************/
4508 case N_Compilation_Unit
:
4510 /* This is not called for the main unit, which is handled in function
4512 start_stmt_group ();
4515 Compilation_Unit_to_gnu (gnat_node
);
4516 gnu_result
= alloc_stmt_list ();
4519 case N_Subprogram_Body_Stub
:
4520 case N_Package_Body_Stub
:
4521 case N_Protected_Body_Stub
:
4522 case N_Task_Body_Stub
:
4523 /* Simply process whatever unit is being inserted. */
4524 gnu_result
= gnat_to_gnu (Unit (Library_Unit (gnat_node
)));
4528 gnu_result
= gnat_to_gnu (Proper_Body (gnat_node
));
4531 /***************************/
4532 /* Chapter 11: Exceptions: */
4533 /***************************/
4535 case N_Handled_Sequence_Of_Statements
:
4536 /* If there is an At_End procedure attached to this node, and the EH
4537 mechanism is SJLJ, we must have at least a corresponding At_End
4538 handler, unless the No_Exception_Handlers restriction is set. */
4539 gcc_assert (type_annotate_only
4540 || Exception_Mechanism
!= Setjmp_Longjmp
4541 || No (At_End_Proc (gnat_node
))
4542 || Present (Exception_Handlers (gnat_node
))
4543 || No_Exception_Handlers_Set ());
4545 gnu_result
= Handled_Sequence_Of_Statements_to_gnu (gnat_node
);
4548 case N_Exception_Handler
:
4549 if (Exception_Mechanism
== Setjmp_Longjmp
)
4550 gnu_result
= Exception_Handler_to_gnu_sjlj (gnat_node
);
4551 else if (Exception_Mechanism
== Back_End_Exceptions
)
4552 gnu_result
= Exception_Handler_to_gnu_zcx (gnat_node
);
4558 case N_Push_Constraint_Error_Label
:
4559 push_exception_label_stack (&gnu_constraint_error_label_stack
,
4560 Exception_Label (gnat_node
));
4563 case N_Push_Storage_Error_Label
:
4564 push_exception_label_stack (&gnu_storage_error_label_stack
,
4565 Exception_Label (gnat_node
));
4568 case N_Push_Program_Error_Label
:
4569 push_exception_label_stack (&gnu_program_error_label_stack
,
4570 Exception_Label (gnat_node
));
4573 case N_Pop_Constraint_Error_Label
:
4574 gnu_constraint_error_label_stack
4575 = TREE_CHAIN (gnu_constraint_error_label_stack
);
4578 case N_Pop_Storage_Error_Label
:
4579 gnu_storage_error_label_stack
4580 = TREE_CHAIN (gnu_storage_error_label_stack
);
4583 case N_Pop_Program_Error_Label
:
4584 gnu_program_error_label_stack
4585 = TREE_CHAIN (gnu_program_error_label_stack
);
4588 /*******************************/
4589 /* Chapter 12: Generic Units: */
4590 /*******************************/
4592 case N_Generic_Function_Renaming_Declaration
:
4593 case N_Generic_Package_Renaming_Declaration
:
4594 case N_Generic_Procedure_Renaming_Declaration
:
4595 case N_Generic_Package_Declaration
:
4596 case N_Generic_Subprogram_Declaration
:
4597 case N_Package_Instantiation
:
4598 case N_Procedure_Instantiation
:
4599 case N_Function_Instantiation
:
4600 /* These nodes can appear on a declaration list but there is nothing to
4601 to be done with them. */
4602 gnu_result
= alloc_stmt_list ();
4605 /***************************************************/
4606 /* Chapter 13: Representation Clauses and */
4607 /* Implementation-Dependent Features: */
4608 /***************************************************/
4610 case N_Attribute_Definition_Clause
:
4611 gnu_result
= alloc_stmt_list ();
4613 /* The only one we need to deal with is 'Address since, for the others,
4614 the front-end puts the information elsewhere. */
4615 if (Get_Attribute_Id (Chars (gnat_node
)) != Attr_Address
)
4618 /* And we only deal with 'Address if the object has a Freeze node. */
4619 gnat_temp
= Entity (Name (gnat_node
));
4620 if (No (Freeze_Node (gnat_temp
)))
4623 /* Get the value to use as the address and save it as the equivalent
4624 for the object. When it is frozen, gnat_to_gnu_entity will do the
4626 save_gnu_tree (gnat_temp
, gnat_to_gnu (Expression (gnat_node
)), true);
4629 case N_Enumeration_Representation_Clause
:
4630 case N_Record_Representation_Clause
:
4632 /* We do nothing with these. SEM puts the information elsewhere. */
4633 gnu_result
= alloc_stmt_list ();
4636 case N_Code_Statement
:
4637 if (!type_annotate_only
)
4639 tree gnu_template
= gnat_to_gnu (Asm_Template (gnat_node
));
4640 tree gnu_inputs
= NULL_TREE
, gnu_outputs
= NULL_TREE
;
4641 tree gnu_clobbers
= NULL_TREE
, tail
;
4642 bool allows_mem
, allows_reg
, fake
;
4643 int ninputs
, noutputs
, i
;
4644 const char **oconstraints
;
4645 const char *constraint
;
4648 /* First retrieve the 3 operand lists built by the front-end. */
4649 Setup_Asm_Outputs (gnat_node
);
4650 while (Present (gnat_temp
= Asm_Output_Variable ()))
4652 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4653 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4654 (Asm_Output_Constraint ()));
4656 gnu_outputs
= tree_cons (gnu_constr
, gnu_value
, gnu_outputs
);
4660 Setup_Asm_Inputs (gnat_node
);
4661 while (Present (gnat_temp
= Asm_Input_Value ()))
4663 tree gnu_value
= gnat_to_gnu (gnat_temp
);
4664 tree gnu_constr
= build_tree_list (NULL_TREE
, gnat_to_gnu
4665 (Asm_Input_Constraint ()));
4667 gnu_inputs
= tree_cons (gnu_constr
, gnu_value
, gnu_inputs
);
4671 Clobber_Setup (gnat_node
);
4672 while ((clobber
= Clobber_Get_Next ()))
4674 = tree_cons (NULL_TREE
,
4675 build_string (strlen (clobber
) + 1, clobber
),
4678 /* Then perform some standard checking and processing on the
4679 operands. In particular, mark them addressable if needed. */
4680 gnu_outputs
= nreverse (gnu_outputs
);
4681 noutputs
= list_length (gnu_outputs
);
4682 gnu_inputs
= nreverse (gnu_inputs
);
4683 ninputs
= list_length (gnu_inputs
);
4685 = (const char **) alloca (noutputs
* sizeof (const char *));
4687 for (i
= 0, tail
= gnu_outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4689 tree output
= TREE_VALUE (tail
);
4691 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4692 oconstraints
[i
] = constraint
;
4694 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
4695 &allows_mem
, &allows_reg
, &fake
))
4697 /* If the operand is going to end up in memory,
4698 mark it addressable. Note that we don't test
4699 allows_mem like in the input case below; this
4700 is modelled on the C front-end. */
4702 && !gnat_mark_addressable (output
))
4703 output
= error_mark_node
;
4706 output
= error_mark_node
;
4708 TREE_VALUE (tail
) = output
;
4711 for (i
= 0, tail
= gnu_inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
4713 tree input
= TREE_VALUE (tail
);
4715 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
4717 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
,
4719 &allows_mem
, &allows_reg
))
4721 /* If the operand is going to end up in memory,
4722 mark it addressable. */
4723 if (!allows_reg
&& allows_mem
4724 && !gnat_mark_addressable (input
))
4725 input
= error_mark_node
;
4728 input
= error_mark_node
;
4730 TREE_VALUE (tail
) = input
;
4733 gnu_result
= build4 (ASM_EXPR
, void_type_node
,
4734 gnu_template
, gnu_outputs
,
4735 gnu_inputs
, gnu_clobbers
);
4736 ASM_VOLATILE_P (gnu_result
) = Is_Asm_Volatile (gnat_node
);
4739 gnu_result
= alloc_stmt_list ();
4743 /***************************************************/
4745 /***************************************************/
4747 case N_Freeze_Entity
:
4748 start_stmt_group ();
4749 process_freeze_entity (gnat_node
);
4750 process_decls (Actions (gnat_node
), Empty
, Empty
, true, true);
4751 gnu_result
= end_stmt_group ();
4754 case N_Itype_Reference
:
4755 if (!present_gnu_tree (Itype (gnat_node
)))
4756 process_type (Itype (gnat_node
));
4758 gnu_result
= alloc_stmt_list ();
4761 case N_Free_Statement
:
4762 if (!type_annotate_only
)
4764 tree gnu_ptr
= gnat_to_gnu (Expression (gnat_node
));
4765 tree gnu_ptr_type
= TREE_TYPE (gnu_ptr
);
4767 tree gnu_actual_obj_type
= 0;
4770 unsigned int default_allocator_alignment
4771 = get_target_default_allocator_alignment () * BITS_PER_UNIT
;
4773 /* If this is a thin pointer, we must dereference it to create
4774 a fat pointer, then go back below to a thin pointer. The
4775 reason for this is that we need a fat pointer someplace in
4776 order to properly compute the size. */
4777 if (TYPE_THIN_POINTER_P (TREE_TYPE (gnu_ptr
)))
4778 gnu_ptr
= build_unary_op (ADDR_EXPR
, NULL_TREE
,
4779 build_unary_op (INDIRECT_REF
, NULL_TREE
,
4782 /* If this is an unconstrained array, we know the object must
4783 have been allocated with the template in front of the object.
4784 So pass the template address, but get the total size. Do this
4785 by converting to a thin pointer. */
4786 if (TYPE_FAT_POINTER_P (TREE_TYPE (gnu_ptr
)))
4788 = convert (build_pointer_type
4789 (TYPE_OBJECT_RECORD_TYPE
4790 (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr
)))),
4793 gnu_obj_type
= TREE_TYPE (TREE_TYPE (gnu_ptr
));
4795 if (Present (Actual_Designated_Subtype (gnat_node
)))
4798 = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node
));
4800 if (TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4802 = build_unc_object_type_from_ptr (gnu_ptr_type
,
4803 gnu_actual_obj_type
,
4804 get_identifier ("DEALLOC"));
4807 gnu_actual_obj_type
= gnu_obj_type
;
4809 gnu_obj_size
= TYPE_SIZE_UNIT (gnu_actual_obj_type
);
4810 align
= TYPE_ALIGN (gnu_obj_type
);
4812 if (TREE_CODE (gnu_obj_type
) == RECORD_TYPE
4813 && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type
))
4815 tree gnu_char_ptr_type
= build_pointer_type (char_type_node
);
4816 tree gnu_pos
= byte_position (TYPE_FIELDS (gnu_obj_type
));
4817 tree gnu_byte_offset
4818 = convert (sizetype
,
4819 size_diffop (size_zero_node
, gnu_pos
));
4820 gnu_byte_offset
= fold_build1 (NEGATE_EXPR
, sizetype
, gnu_byte_offset
);
4822 gnu_ptr
= convert (gnu_char_ptr_type
, gnu_ptr
);
4823 gnu_ptr
= build_binary_op (POINTER_PLUS_EXPR
, gnu_char_ptr_type
,
4824 gnu_ptr
, gnu_byte_offset
);
4827 /* If the object was allocated from the default storage pool, the
4828 alignment was greater than what the allocator provides, and this
4829 is not a fat or thin pointer, what we have in gnu_ptr here is an
4830 address dynamically adjusted to match the alignment requirement
4831 (see build_allocator). What we need to pass to free is the
4832 initial allocator's return value, which has been stored just in
4833 front of the block we have. */
4835 if (No (Procedure_To_Call (gnat_node
))
4836 && align
> default_allocator_alignment
4837 && ! TYPE_FAT_OR_THIN_POINTER_P (gnu_ptr_type
))
4840 as * (void **)((void *)GNU_PTR - (void *)sizeof(void *))
4844 = (void *)GNU_PTR - (void *)sizeof (void *)) */
4847 (POINTER_PLUS_EXPR
, ptr_void_type_node
,
4848 convert (ptr_void_type_node
, gnu_ptr
),
4849 size_int (-POINTER_SIZE
/BITS_PER_UNIT
));
4851 /* GNU_PTR (void *) = *(void **)GNU_PTR */
4854 (INDIRECT_REF
, NULL_TREE
,
4855 convert (build_pointer_type (ptr_void_type_node
),
4859 gnu_result
= build_call_alloc_dealloc (gnu_ptr
, gnu_obj_size
, align
,
4860 Procedure_To_Call (gnat_node
),
4861 Storage_Pool (gnat_node
),
4866 case N_Raise_Constraint_Error
:
4867 case N_Raise_Program_Error
:
4868 case N_Raise_Storage_Error
:
4869 if (type_annotate_only
)
4871 gnu_result
= alloc_stmt_list ();
4875 gnu_result_type
= get_unpadded_type (Etype (gnat_node
));
4877 = build_call_raise (UI_To_Int (Reason (gnat_node
)), gnat_node
,
4880 /* If the type is VOID, this is a statement, so we need to
4881 generate the code for the call. Handle a Condition, if there
4883 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
4885 set_expr_location_from_node (gnu_result
, gnat_node
);
4887 if (Present (Condition (gnat_node
)))
4888 gnu_result
= build3 (COND_EXPR
, void_type_node
,
4889 gnat_to_gnu (Condition (gnat_node
)),
4890 gnu_result
, alloc_stmt_list ());
4893 gnu_result
= build1 (NULL_EXPR
, gnu_result_type
, gnu_result
);
4896 case N_Validate_Unchecked_Conversion
:
4898 Entity_Id gnat_target_type
= Target_Type (gnat_node
);
4899 tree gnu_source_type
= gnat_to_gnu_type (Source_Type (gnat_node
));
4900 tree gnu_target_type
= gnat_to_gnu_type (gnat_target_type
);
4902 /* No need for any warning in this case. */
4903 if (!flag_strict_aliasing
)
4906 /* If the result is a pointer type, see if we are either converting
4907 from a non-pointer or from a pointer to a type with a different
4908 alias set and warn if so. If the result is defined in the same
4909 unit as this unchecked conversion, we can allow this because we
4910 can know to make the pointer type behave properly. */
4911 else if (POINTER_TYPE_P (gnu_target_type
)
4912 && !In_Same_Source_Unit (gnat_target_type
, gnat_node
)
4913 && !No_Strict_Aliasing (Underlying_Type (gnat_target_type
)))
4915 tree gnu_source_desig_type
= POINTER_TYPE_P (gnu_source_type
)
4916 ? TREE_TYPE (gnu_source_type
)
4918 tree gnu_target_desig_type
= TREE_TYPE (gnu_target_type
);
4920 if ((TYPE_DUMMY_P (gnu_target_desig_type
)
4921 || get_alias_set (gnu_target_desig_type
) != 0)
4922 && (!POINTER_TYPE_P (gnu_source_type
)
4923 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4924 != TYPE_DUMMY_P (gnu_target_desig_type
))
4925 || (TYPE_DUMMY_P (gnu_source_desig_type
)
4926 && gnu_source_desig_type
!= gnu_target_desig_type
)
4927 || (get_alias_set (gnu_source_desig_type
)
4928 != get_alias_set (gnu_target_desig_type
))))
4931 ("?possible aliasing problem for type&",
4932 gnat_node
, Target_Type (gnat_node
));
4934 ("\\?use -fno-strict-aliasing switch for references",
4937 ("\\?or use `pragma No_Strict_Aliasing (&);`",
4938 gnat_node
, Target_Type (gnat_node
));
4942 /* But if the result is a fat pointer type, we have no mechanism to
4943 do that, so we unconditionally warn in problematic cases. */
4944 else if (TYPE_FAT_POINTER_P (gnu_target_type
))
4946 tree gnu_source_array_type
4947 = TYPE_FAT_POINTER_P (gnu_source_type
)
4948 ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type
)))
4950 tree gnu_target_array_type
4951 = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type
)));
4953 if ((TYPE_DUMMY_P (gnu_target_array_type
)
4954 || get_alias_set (gnu_target_array_type
) != 0)
4955 && (!TYPE_FAT_POINTER_P (gnu_source_type
)
4956 || (TYPE_DUMMY_P (gnu_source_array_type
)
4957 != TYPE_DUMMY_P (gnu_target_array_type
))
4958 || (TYPE_DUMMY_P (gnu_source_array_type
)
4959 && gnu_source_array_type
!= gnu_target_array_type
)
4960 || (get_alias_set (gnu_source_array_type
)
4961 != get_alias_set (gnu_target_array_type
))))
4964 ("?possible aliasing problem for type&",
4965 gnat_node
, Target_Type (gnat_node
));
4967 ("\\?use -fno-strict-aliasing switch for references",
4972 gnu_result
= alloc_stmt_list ();
4975 case N_Raise_Statement
:
4976 case N_Function_Specification
:
4977 case N_Procedure_Specification
:
4979 case N_Component_Association
:
4982 gcc_assert (type_annotate_only
);
4983 gnu_result
= alloc_stmt_list ();
4986 /* If we pushed our level as part of processing the elaboration routine,
4988 if (went_into_elab_proc
)
4990 add_stmt (gnu_result
);
4992 gnu_result
= end_stmt_group ();
4993 current_function_decl
= NULL_TREE
;
4996 /* Set the location information on the result if it is a real expression.
4997 References can be reused for multiple GNAT nodes and they would get
4998 the location information of their last use. Note that we may have
4999 no result if we tried to build a CALL_EXPR node to a procedure with
5000 no side-effects and optimization is enabled. */
5002 && EXPR_P (gnu_result
)
5003 && TREE_CODE (gnu_result
) != NOP_EXPR
5004 && !REFERENCE_CLASS_P (gnu_result
))
5005 set_expr_location_from_node (gnu_result
, gnat_node
);
5007 /* If we're supposed to return something of void_type, it means we have
5008 something we're elaborating for effect, so just return. */
5009 if (TREE_CODE (gnu_result_type
) == VOID_TYPE
)
5012 /* If the result is a constant that overflows, raise constraint error. */
5013 else if (TREE_CODE (gnu_result
) == INTEGER_CST
5014 && TREE_OVERFLOW (gnu_result
))
5016 post_error ("Constraint_Error will be raised at run-time?", gnat_node
);
5019 = build1 (NULL_EXPR
, gnu_result_type
,
5020 build_call_raise (CE_Overflow_Check_Failed
, gnat_node
,
5021 N_Raise_Constraint_Error
));
5024 /* If our result has side-effects and is of an unconstrained type,
5025 make a SAVE_EXPR so that we can be sure it will only be referenced
5026 once. Note we must do this before any conversions. */
5027 if (TREE_SIDE_EFFECTS (gnu_result
)
5028 && (TREE_CODE (gnu_result_type
) == UNCONSTRAINED_ARRAY_TYPE
5029 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))))
5030 gnu_result
= gnat_stabilize_reference (gnu_result
, false);
5032 /* Now convert the result to the result type, unless we are in one of the
5035 1. If this is the Name of an assignment statement or a parameter of
5036 a procedure call, return the result almost unmodified since the
5037 RHS will have to be converted to our type in that case, unless
5038 the result type has a simpler size. Similarly, don't convert
5039 integral types that are the operands of an unchecked conversion
5040 since we need to ignore those conversions (for 'Valid).
5042 2. If we have a label (which doesn't have any well-defined type), a
5043 field or an error, return the result almost unmodified. Also don't
5044 do the conversion if the result type involves a PLACEHOLDER_EXPR in
5045 its size since those are the cases where the front end may have the
5046 type wrong due to "instantiating" the unconstrained record with
5047 discriminant values. Similarly, if the two types are record types
5048 with the same name don't convert. This will be the case when we are
5049 converting from a packable version of a type to its original type and
5050 we need those conversions to be NOPs in order for assignments into
5051 these types to work properly.
5053 3. If the type is void or if we have no result, return error_mark_node
5054 to show we have no result.
5056 4. Finally, if the type of the result is already correct. */
5058 if (Present (Parent (gnat_node
))
5059 && ((Nkind (Parent (gnat_node
)) == N_Assignment_Statement
5060 && Name (Parent (gnat_node
)) == gnat_node
)
5061 || (Nkind (Parent (gnat_node
)) == N_Procedure_Call_Statement
5062 && Name (Parent (gnat_node
)) != gnat_node
)
5063 || Nkind (Parent (gnat_node
)) == N_Parameter_Association
5064 || (Nkind (Parent (gnat_node
)) == N_Unchecked_Type_Conversion
5065 && !AGGREGATE_TYPE_P (gnu_result_type
)
5066 && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
))))
5067 && !(TYPE_SIZE (gnu_result_type
)
5068 && TYPE_SIZE (TREE_TYPE (gnu_result
))
5069 && (AGGREGATE_TYPE_P (gnu_result_type
)
5070 == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result
)))
5071 && ((TREE_CODE (TYPE_SIZE (gnu_result_type
)) == INTEGER_CST
5072 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result
)))
5074 || (TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5075 && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
))
5076 && (CONTAINS_PLACEHOLDER_P
5077 (TYPE_SIZE (TREE_TYPE (gnu_result
))))))
5078 && !(TREE_CODE (gnu_result_type
) == RECORD_TYPE
5079 && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type
))))
5081 /* Remove padding only if the inner object is of self-referential
5082 size: in that case it must be an object of unconstrained type
5083 with a default discriminant and we want to avoid copying too
5085 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5086 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
))
5087 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS
5088 (TREE_TYPE (gnu_result
))))))
5089 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5093 else if (TREE_CODE (gnu_result
) == LABEL_DECL
5094 || TREE_CODE (gnu_result
) == FIELD_DECL
5095 || TREE_CODE (gnu_result
) == ERROR_MARK
5096 || (TYPE_SIZE (gnu_result_type
)
5097 && TREE_CODE (TYPE_SIZE (gnu_result_type
)) != INTEGER_CST
5098 && TREE_CODE (gnu_result
) != INDIRECT_REF
5099 && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type
)))
5100 || ((TYPE_NAME (gnu_result_type
)
5101 == TYPE_NAME (TREE_TYPE (gnu_result
)))
5102 && TREE_CODE (gnu_result_type
) == RECORD_TYPE
5103 && TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
))
5105 /* Remove any padding. */
5106 if (TREE_CODE (TREE_TYPE (gnu_result
)) == RECORD_TYPE
5107 && TYPE_IS_PADDING_P (TREE_TYPE (gnu_result
)))
5108 gnu_result
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result
))),
5112 else if (gnu_result
== error_mark_node
|| gnu_result_type
== void_type_node
)
5113 gnu_result
= error_mark_node
;
5115 else if (gnu_result_type
!= TREE_TYPE (gnu_result
))
5116 gnu_result
= convert (gnu_result_type
, gnu_result
);
5118 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
5119 while ((TREE_CODE (gnu_result
) == NOP_EXPR
5120 || TREE_CODE (gnu_result
) == NON_LVALUE_EXPR
)
5121 && TREE_TYPE (TREE_OPERAND (gnu_result
, 0)) == TREE_TYPE (gnu_result
))
5122 gnu_result
= TREE_OPERAND (gnu_result
, 0);
5127 /* Subroutine of above to push the exception label stack. GNU_STACK is
5128 a pointer to the stack to update and GNAT_LABEL, if present, is the
5129 label to push onto the stack. */
5132 push_exception_label_stack (tree
*gnu_stack
, Entity_Id gnat_label
)
5134 tree gnu_label
= (Present (gnat_label
)
5135 ? gnat_to_gnu_entity (gnat_label
, NULL_TREE
, 0)
5138 *gnu_stack
= tree_cons (NULL_TREE
, gnu_label
, *gnu_stack
);
5141 /* Record the current code position in GNAT_NODE. */
5144 record_code_position (Node_Id gnat_node
)
5146 tree stmt_stmt
= build1 (STMT_STMT
, void_type_node
, NULL_TREE
);
5148 add_stmt_with_node (stmt_stmt
, gnat_node
);
5149 save_gnu_tree (gnat_node
, stmt_stmt
, true);
5152 /* Insert the code for GNAT_NODE at the position saved for that node. */
5155 insert_code_for (Node_Id gnat_node
)
5157 STMT_STMT_STMT (get_gnu_tree (gnat_node
)) = gnat_to_gnu (gnat_node
);
5158 save_gnu_tree (gnat_node
, NULL_TREE
, true);
5161 /* Start a new statement group chained to the previous group. */
5164 start_stmt_group (void)
5166 struct stmt_group
*group
= stmt_group_free_list
;
5168 /* First see if we can get one from the free list. */
5170 stmt_group_free_list
= group
->previous
;
5172 group
= (struct stmt_group
*) ggc_alloc (sizeof (struct stmt_group
));
5174 group
->previous
= current_stmt_group
;
5175 group
->stmt_list
= group
->block
= group
->cleanups
= NULL_TREE
;
5176 current_stmt_group
= group
;
5179 /* Add GNU_STMT to the current statement group. */
5182 add_stmt (tree gnu_stmt
)
5184 append_to_statement_list (gnu_stmt
, ¤t_stmt_group
->stmt_list
);
5187 /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */
5190 add_stmt_with_node (tree gnu_stmt
, Node_Id gnat_node
)
5192 if (Present (gnat_node
))
5193 set_expr_location_from_node (gnu_stmt
, gnat_node
);
5194 add_stmt (gnu_stmt
);
5197 /* Add a declaration statement for GNU_DECL to the current statement group.
5198 Get SLOC from Entity_Id. */
5201 add_decl_expr (tree gnu_decl
, Entity_Id gnat_entity
)
5203 tree type
= TREE_TYPE (gnu_decl
);
5204 tree gnu_stmt
, gnu_init
, t
;
5206 /* If this is a variable that Gigi is to ignore, we may have been given
5207 an ERROR_MARK. So test for it. We also might have been given a
5208 reference for a renaming. So only do something for a decl. Also
5209 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
5210 if (!DECL_P (gnu_decl
)
5211 || (TREE_CODE (gnu_decl
) == TYPE_DECL
5212 && TREE_CODE (type
) == UNCONSTRAINED_ARRAY_TYPE
))
5215 gnu_stmt
= build1 (DECL_EXPR
, void_type_node
, gnu_decl
);
5217 /* If we are global, we don't want to actually output the DECL_EXPR for
5218 this decl since we already have evaluated the expressions in the
5219 sizes and positions as globals and doing it again would be wrong. */
5220 if (global_bindings_p ())
5222 /* Mark everything as used to prevent node sharing with subprograms.
5223 Note that walk_tree knows how to deal with TYPE_DECL, but neither
5224 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
5225 mark_visited (&gnu_stmt
);
5226 if (TREE_CODE (gnu_decl
) == VAR_DECL
5227 || TREE_CODE (gnu_decl
) == CONST_DECL
)
5229 mark_visited (&DECL_SIZE (gnu_decl
));
5230 mark_visited (&DECL_SIZE_UNIT (gnu_decl
));
5231 mark_visited (&DECL_INITIAL (gnu_decl
));
5233 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
5234 if (TREE_CODE (gnu_decl
) == TYPE_DECL
5235 && (TREE_CODE (type
) == RECORD_TYPE
5236 || TREE_CODE (type
) == UNION_TYPE
5237 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5238 && (t
= TYPE_ADA_SIZE (type
)))
5242 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5244 /* If this is a variable and an initializer is attached to it, it must be
5245 valid for the context. Similar to init_const in create_var_decl_1. */
5246 if (TREE_CODE (gnu_decl
) == VAR_DECL
5247 && (gnu_init
= DECL_INITIAL (gnu_decl
)) != NULL_TREE
5248 && (!gnat_types_compatible_p (type
, TREE_TYPE (gnu_init
))
5249 || (TREE_STATIC (gnu_decl
)
5250 && !initializer_constant_valid_p (gnu_init
,
5251 TREE_TYPE (gnu_init
)))))
5253 /* If GNU_DECL has a padded type, convert it to the unpadded
5254 type so the assignment is done properly. */
5255 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_IS_PADDING_P (type
))
5256 t
= convert (TREE_TYPE (TYPE_FIELDS (type
)), gnu_decl
);
5260 gnu_stmt
= build_binary_op (MODIFY_EXPR
, NULL_TREE
, t
, gnu_init
);
5262 DECL_INITIAL (gnu_decl
) = NULL_TREE
;
5263 if (TREE_READONLY (gnu_decl
))
5265 TREE_READONLY (gnu_decl
) = 0;
5266 DECL_READONLY_ONCE_ELAB (gnu_decl
) = 1;
5269 add_stmt_with_node (gnu_stmt
, gnat_entity
);
5273 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
5276 mark_visited_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
5278 if (TREE_VISITED (*tp
))
5281 /* Don't mark a dummy type as visited because we want to mark its sizes
5282 and fields once it's filled in. */
5283 else if (!TYPE_IS_DUMMY_P (*tp
))
5284 TREE_VISITED (*tp
) = 1;
5287 TYPE_SIZES_GIMPLIFIED (*tp
) = 1;
5292 /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */
5295 unshare_save_expr (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
5296 void *data ATTRIBUTE_UNUSED
)
5300 if (TREE_CODE (t
) == SAVE_EXPR
)
5301 TREE_OPERAND (t
, 0) = unshare_expr (TREE_OPERAND (t
, 0));
5306 /* Mark nodes rooted at *TP with TREE_VISITED and types as having their
5307 sized gimplified. We use this to indicate all variable sizes and
5308 positions in global types may not be shared by any subprogram. */
5311 mark_visited (tree
*tp
)
5313 walk_tree (tp
, mark_visited_r
, NULL
, NULL
);
5316 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
5317 set its location to that of GNAT_NODE if present. */
5320 add_cleanup (tree gnu_cleanup
, Node_Id gnat_node
)
5322 if (Present (gnat_node
))
5323 set_expr_location_from_node (gnu_cleanup
, gnat_node
);
5324 append_to_statement_list (gnu_cleanup
, ¤t_stmt_group
->cleanups
);
5327 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
5330 set_block_for_group (tree gnu_block
)
5332 gcc_assert (!current_stmt_group
->block
);
5333 current_stmt_group
->block
= gnu_block
;
5336 /* Return code corresponding to the current code group. It is normally
5337 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
5338 BLOCK or cleanups were set. */
5341 end_stmt_group (void)
5343 struct stmt_group
*group
= current_stmt_group
;
5344 tree gnu_retval
= group
->stmt_list
;
5346 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
5347 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
5348 make a BIND_EXPR. Note that we nest in that because the cleanup may
5349 reference variables in the block. */
5350 if (gnu_retval
== NULL_TREE
)
5351 gnu_retval
= alloc_stmt_list ();
5353 if (group
->cleanups
)
5354 gnu_retval
= build2 (TRY_FINALLY_EXPR
, void_type_node
, gnu_retval
,
5357 if (current_stmt_group
->block
)
5358 gnu_retval
= build3 (BIND_EXPR
, void_type_node
, BLOCK_VARS (group
->block
),
5359 gnu_retval
, group
->block
);
5361 /* Remove this group from the stack and add it to the free list. */
5362 current_stmt_group
= group
->previous
;
5363 group
->previous
= stmt_group_free_list
;
5364 stmt_group_free_list
= group
;
5369 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
5373 add_stmt_list (List_Id gnat_list
)
5377 if (Present (gnat_list
))
5378 for (gnat_node
= First (gnat_list
); Present (gnat_node
);
5379 gnat_node
= Next (gnat_node
))
5380 add_stmt (gnat_to_gnu (gnat_node
));
5383 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
5384 If BINDING_P is true, push and pop a binding level around the list. */
5387 build_stmt_group (List_Id gnat_list
, bool binding_p
)
5389 start_stmt_group ();
5393 add_stmt_list (gnat_list
);
5397 return end_stmt_group ();
5400 /* Push and pop routines for stacks. We keep a free list around so we
5401 don't waste tree nodes. */
5404 push_stack (tree
*gnu_stack_ptr
, tree gnu_purpose
, tree gnu_value
)
5406 tree gnu_node
= gnu_stack_free_list
;
5410 gnu_stack_free_list
= TREE_CHAIN (gnu_node
);
5411 TREE_CHAIN (gnu_node
) = *gnu_stack_ptr
;
5412 TREE_PURPOSE (gnu_node
) = gnu_purpose
;
5413 TREE_VALUE (gnu_node
) = gnu_value
;
5416 gnu_node
= tree_cons (gnu_purpose
, gnu_value
, *gnu_stack_ptr
);
5418 *gnu_stack_ptr
= gnu_node
;
5422 pop_stack (tree
*gnu_stack_ptr
)
5424 tree gnu_node
= *gnu_stack_ptr
;
5426 *gnu_stack_ptr
= TREE_CHAIN (gnu_node
);
5427 TREE_CHAIN (gnu_node
) = gnu_stack_free_list
;
5428 gnu_stack_free_list
= gnu_node
;
5431 /* Generate GIMPLE in place for the expression at *EXPR_P. */
5434 gnat_gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
,
5435 gimple_seq
*post_p ATTRIBUTE_UNUSED
)
5437 tree expr
= *expr_p
;
5440 if (IS_ADA_STMT (expr
))
5441 return gnat_gimplify_stmt (expr_p
);
5443 switch (TREE_CODE (expr
))
5446 /* If this is for a scalar, just make a VAR_DECL for it. If for
5447 an aggregate, get a null pointer of the appropriate type and
5449 if (AGGREGATE_TYPE_P (TREE_TYPE (expr
)))
5450 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (expr
),
5451 convert (build_pointer_type (TREE_TYPE (expr
)),
5452 integer_zero_node
));
5455 *expr_p
= create_tmp_var (TREE_TYPE (expr
), NULL
);
5456 TREE_NO_WARNING (*expr_p
) = 1;
5459 gimplify_and_add (TREE_OPERAND (expr
, 0), pre_p
);
5462 case UNCONSTRAINED_ARRAY_REF
:
5463 /* We should only do this if we are just elaborating for side-effects,
5464 but we can't know that yet. */
5465 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5469 op
= TREE_OPERAND (expr
, 0);
5471 /* If we're taking the address of a constant CONSTRUCTOR, force it to
5472 be put into static memory. We know it's going to be readonly given
5473 the semantics we have and it's required to be static memory in
5474 the case when the reference is in an elaboration procedure. */
5475 if (TREE_CODE (op
) == CONSTRUCTOR
&& TREE_CONSTANT (op
))
5477 tree new_var
= create_tmp_var (TREE_TYPE (op
), "C");
5479 TREE_READONLY (new_var
) = 1;
5480 TREE_STATIC (new_var
) = 1;
5481 TREE_ADDRESSABLE (new_var
) = 1;
5482 DECL_INITIAL (new_var
) = op
;
5484 TREE_OPERAND (expr
, 0) = new_var
;
5485 recompute_tree_invariant_for_addr_expr (expr
);
5489 /* If we are taking the address of a SAVE_EXPR, we are typically
5490 processing a misaligned argument to be passed by reference in a
5491 procedure call. We just mark the operand as addressable + not
5492 readonly here and let the common gimplifier code perform the
5493 temporary creation, initialization, and "instantiation" in place of
5494 the SAVE_EXPR in further operands, in particular in the copy back
5495 code inserted after the call. */
5496 else if (TREE_CODE (op
) == SAVE_EXPR
)
5498 TREE_ADDRESSABLE (op
) = 1;
5499 TREE_READONLY (op
) = 0;
5502 /* We let the gimplifier process &COND_EXPR and expect it to yield the
5503 address of the selected operand when it is addressable. Besides, we
5504 also expect addressable_p to only let COND_EXPRs where both arms are
5505 addressable reach here. */
5506 else if (TREE_CODE (op
) == COND_EXPR
)
5509 /* Otherwise, if we are taking the address of something that is neither
5510 reference, declaration, or constant, make a variable for the operand
5511 here and then take its address. If we don't do it this way, we may
5512 confuse the gimplifier because it needs to know the variable is
5513 addressable at this point. This duplicates code in
5514 internal_get_tmp_var, which is unfortunate. */
5515 else if (TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_reference
5516 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_declaration
5517 && TREE_CODE_CLASS (TREE_CODE (op
)) != tcc_constant
)
5519 tree new_var
= create_tmp_var (TREE_TYPE (op
), "A");
5522 TREE_ADDRESSABLE (new_var
) = 1;
5524 stmt
= gimplify_assign (new_var
, op
, pre_p
);
5525 if (EXPR_HAS_LOCATION (op
))
5526 gimple_set_location (stmt
, *EXPR_LOCUS (op
));
5528 TREE_OPERAND (expr
, 0) = new_var
;
5529 recompute_tree_invariant_for_addr_expr (expr
);
5533 /* ... fall through ... */
5536 return GS_UNHANDLED
;
5540 /* Generate GIMPLE in place for the statement at *STMT_P. */
5542 static enum gimplify_status
5543 gnat_gimplify_stmt (tree
*stmt_p
)
5545 tree stmt
= *stmt_p
;
5547 switch (TREE_CODE (stmt
))
5550 *stmt_p
= STMT_STMT_STMT (stmt
);
5555 tree gnu_start_label
= create_artificial_label ();
5556 tree gnu_end_label
= LOOP_STMT_LABEL (stmt
);
5559 /* Set to emit the statements of the loop. */
5560 *stmt_p
= NULL_TREE
;
5562 /* We first emit the start label and then a conditional jump to
5563 the end label if there's a top condition, then the body of the
5564 loop, then a conditional branch to the end label, then the update,
5565 if any, and finally a jump to the start label and the definition
5566 of the end label. */
5567 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5571 if (LOOP_STMT_TOP_COND (stmt
))
5572 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5573 LOOP_STMT_TOP_COND (stmt
),
5580 append_to_statement_list (LOOP_STMT_BODY (stmt
), stmt_p
);
5582 if (LOOP_STMT_BOT_COND (stmt
))
5583 append_to_statement_list (build3 (COND_EXPR
, void_type_node
,
5584 LOOP_STMT_BOT_COND (stmt
),
5591 if (LOOP_STMT_UPDATE (stmt
))
5592 append_to_statement_list (LOOP_STMT_UPDATE (stmt
), stmt_p
);
5594 t
= build1 (GOTO_EXPR
, void_type_node
, gnu_start_label
);
5595 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (gnu_end_label
));
5596 append_to_statement_list (t
, stmt_p
);
5598 append_to_statement_list (build1 (LABEL_EXPR
, void_type_node
,
5605 /* Build a statement to jump to the corresponding end label, then
5606 see if it needs to be conditional. */
5607 *stmt_p
= build1 (GOTO_EXPR
, void_type_node
, EXIT_STMT_LABEL (stmt
));
5608 if (EXIT_STMT_COND (stmt
))
5609 *stmt_p
= build3 (COND_EXPR
, void_type_node
,
5610 EXIT_STMT_COND (stmt
), *stmt_p
, alloc_stmt_list ());
5618 /* Force references to each of the entities in packages withed by GNAT_NODE.
5619 Operate recursively but check that we aren't elaborating something more
5622 This routine is exclusively called in type_annotate mode, to compute DDA
5623 information for types in withed units, for ASIS use. */
5626 elaborate_all_entities (Node_Id gnat_node
)
5628 Entity_Id gnat_with_clause
, gnat_entity
;
5630 /* Process each unit only once. As we trace the context of all relevant
5631 units transitively, including generic bodies, we may encounter the
5632 same generic unit repeatedly. */
5633 if (!present_gnu_tree (gnat_node
))
5634 save_gnu_tree (gnat_node
, integer_zero_node
, true);
5636 /* Save entities in all context units. A body may have an implicit_with
5637 on its own spec, if the context includes a child unit, so don't save
5639 for (gnat_with_clause
= First (Context_Items (gnat_node
));
5640 Present (gnat_with_clause
);
5641 gnat_with_clause
= Next (gnat_with_clause
))
5642 if (Nkind (gnat_with_clause
) == N_With_Clause
5643 && !present_gnu_tree (Library_Unit (gnat_with_clause
))
5644 && Library_Unit (gnat_with_clause
) != Library_Unit (Cunit (Main_Unit
)))
5646 elaborate_all_entities (Library_Unit (gnat_with_clause
));
5648 if (Ekind (Entity (Name (gnat_with_clause
))) == E_Package
)
5650 for (gnat_entity
= First_Entity (Entity (Name (gnat_with_clause
)));
5651 Present (gnat_entity
);
5652 gnat_entity
= Next_Entity (gnat_entity
))
5653 if (Is_Public (gnat_entity
)
5654 && Convention (gnat_entity
) != Convention_Intrinsic
5655 && Ekind (gnat_entity
) != E_Package
5656 && Ekind (gnat_entity
) != E_Package_Body
5657 && Ekind (gnat_entity
) != E_Operator
5658 && !(IN (Ekind (gnat_entity
), Type_Kind
)
5659 && !Is_Frozen (gnat_entity
))
5660 && !((Ekind (gnat_entity
) == E_Procedure
5661 || Ekind (gnat_entity
) == E_Function
)
5662 && Is_Intrinsic_Subprogram (gnat_entity
))
5663 && !IN (Ekind (gnat_entity
), Named_Kind
)
5664 && !IN (Ekind (gnat_entity
), Generic_Unit_Kind
))
5665 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5667 else if (Ekind (Entity (Name (gnat_with_clause
))) == E_Generic_Package
)
5670 = Corresponding_Body (Unit (Library_Unit (gnat_with_clause
)));
5672 /* Retrieve compilation unit node of generic body. */
5673 while (Present (gnat_body
)
5674 && Nkind (gnat_body
) != N_Compilation_Unit
)
5675 gnat_body
= Parent (gnat_body
);
5677 /* If body is available, elaborate its context. */
5678 if (Present (gnat_body
))
5679 elaborate_all_entities (gnat_body
);
5683 if (Nkind (Unit (gnat_node
)) == N_Package_Body
)
5684 elaborate_all_entities (Library_Unit (gnat_node
));
5687 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
5690 process_freeze_entity (Node_Id gnat_node
)
5692 Entity_Id gnat_entity
= Entity (gnat_node
);
5696 = (Nkind (Declaration_Node (gnat_entity
)) == N_Object_Declaration
5697 && present_gnu_tree (Declaration_Node (gnat_entity
)))
5698 ? get_gnu_tree (Declaration_Node (gnat_entity
)) : NULL_TREE
;
5700 /* If this is a package, need to generate code for the package. */
5701 if (Ekind (gnat_entity
) == E_Package
)
5704 (Parent (Corresponding_Body
5705 (Parent (Declaration_Node (gnat_entity
)))));
5709 /* Check for old definition after the above call. This Freeze_Node
5710 might be for one its Itypes. */
5712 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
5714 /* If this entity has an Address representation clause, GNU_OLD is the
5715 address, so discard it here. */
5716 if (Present (Address_Clause (gnat_entity
)))
5719 /* Don't do anything for class-wide types they are always
5720 transformed into their root type. */
5721 if (Ekind (gnat_entity
) == E_Class_Wide_Type
5722 || (Ekind (gnat_entity
) == E_Class_Wide_Subtype
5723 && Present (Equivalent_Type (gnat_entity
))))
5726 /* Don't do anything for subprograms that may have been elaborated before
5727 their freeze nodes. This can happen, for example because of an inner call
5728 in an instance body, or a previous compilation of a spec for inlining
5731 && ((TREE_CODE (gnu_old
) == FUNCTION_DECL
5732 && (Ekind (gnat_entity
) == E_Function
5733 || Ekind (gnat_entity
) == E_Procedure
))
5735 && TREE_CODE (TREE_TYPE (gnu_old
)) == FUNCTION_TYPE
5736 && Ekind (gnat_entity
) == E_Subprogram_Type
)))
5739 /* If we have a non-dummy type old tree, we have nothing to do, except
5740 aborting if this is the public view of a private type whose full view was
5741 not delayed, as this node was never delayed as it should have been. We
5742 let this happen for concurrent types and their Corresponding_Record_Type,
5743 however, because each might legitimately be elaborated before it's own
5744 freeze node, e.g. while processing the other. */
5746 && !(TREE_CODE (gnu_old
) == TYPE_DECL
5747 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
))))
5749 gcc_assert ((IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5750 && Present (Full_View (gnat_entity
))
5751 && No (Freeze_Node (Full_View (gnat_entity
))))
5752 || Is_Concurrent_Type (gnat_entity
)
5753 || (IN (Ekind (gnat_entity
), Record_Kind
)
5754 && Is_Concurrent_Record_Type (gnat_entity
)));
5758 /* Reset the saved tree, if any, and elaborate the object or type for real.
5759 If there is a full declaration, elaborate it and copy the type to
5760 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
5761 a class wide type or subtype. */
5764 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
5765 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5766 && Present (Full_View (gnat_entity
))
5767 && present_gnu_tree (Full_View (gnat_entity
)))
5768 save_gnu_tree (Full_View (gnat_entity
), NULL_TREE
, false);
5769 if (Present (Class_Wide_Type (gnat_entity
))
5770 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5771 save_gnu_tree (Class_Wide_Type (gnat_entity
), NULL_TREE
, false);
5774 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
5775 && Present (Full_View (gnat_entity
)))
5777 gnu_new
= gnat_to_gnu_entity (Full_View (gnat_entity
), NULL_TREE
, 1);
5779 /* Propagate back-annotations from full view to partial view. */
5780 if (Unknown_Alignment (gnat_entity
))
5781 Set_Alignment (gnat_entity
, Alignment (Full_View (gnat_entity
)));
5783 if (Unknown_Esize (gnat_entity
))
5784 Set_Esize (gnat_entity
, Esize (Full_View (gnat_entity
)));
5786 if (Unknown_RM_Size (gnat_entity
))
5787 Set_RM_Size (gnat_entity
, RM_Size (Full_View (gnat_entity
)));
5789 /* The above call may have defined this entity (the simplest example
5790 of this is when we have a private enumeral type since the bounds
5791 will have the public view. */
5792 if (!present_gnu_tree (gnat_entity
))
5793 save_gnu_tree (gnat_entity
, gnu_new
, false);
5794 if (Present (Class_Wide_Type (gnat_entity
))
5795 && Class_Wide_Type (gnat_entity
) != gnat_entity
)
5796 save_gnu_tree (Class_Wide_Type (gnat_entity
), gnu_new
, false);
5799 gnu_new
= gnat_to_gnu_entity (gnat_entity
, gnu_init
, 1);
5801 /* If we've made any pointers to the old version of this type, we
5802 have to update them. */
5804 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
5805 TREE_TYPE (gnu_new
));
5808 /* Process the list of inlined subprograms of GNAT_NODE, which is an
5809 N_Compilation_Unit. */
5812 process_inlined_subprograms (Node_Id gnat_node
)
5814 Entity_Id gnat_entity
;
5817 /* If we can inline, generate Gimple for all the inlined subprograms.
5818 Define the entity first so we set DECL_EXTERNAL. */
5820 for (gnat_entity
= First_Inlined_Subprogram (gnat_node
);
5821 Present (gnat_entity
);
5822 gnat_entity
= Next_Inlined_Subprogram (gnat_entity
))
5824 gnat_body
= Parent (Declaration_Node (gnat_entity
));
5826 if (Nkind (gnat_body
) != N_Subprogram_Body
)
5828 /* ??? This really should always be Present. */
5829 if (No (Corresponding_Body (gnat_body
)))
5833 = Parent (Declaration_Node (Corresponding_Body (gnat_body
)));
5836 if (Present (gnat_body
))
5838 gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 0);
5839 add_stmt (gnat_to_gnu (gnat_body
));
5844 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
5845 We make two passes, one to elaborate anything other than bodies (but
5846 we declare a function if there was no spec). The second pass
5847 elaborates the bodies.
5849 GNAT_END_LIST gives the element in the list past the end. Normally,
5850 this is Empty, but can be First_Real_Statement for a
5851 Handled_Sequence_Of_Statements.
5853 We make a complete pass through both lists if PASS1P is true, then make
5854 the second pass over both lists if PASS2P is true. The lists usually
5855 correspond to the public and private parts of a package. */
5858 process_decls (List_Id gnat_decls
, List_Id gnat_decls2
,
5859 Node_Id gnat_end_list
, bool pass1p
, bool pass2p
)
5861 List_Id gnat_decl_array
[2];
5865 gnat_decl_array
[0] = gnat_decls
, gnat_decl_array
[1] = gnat_decls2
;
5868 for (i
= 0; i
<= 1; i
++)
5869 if (Present (gnat_decl_array
[i
]))
5870 for (gnat_decl
= First (gnat_decl_array
[i
]);
5871 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5873 /* For package specs, we recurse inside the declarations,
5874 thus taking the two pass approach inside the boundary. */
5875 if (Nkind (gnat_decl
) == N_Package_Declaration
5876 && (Nkind (Specification (gnat_decl
)
5877 == N_Package_Specification
)))
5878 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5879 Private_Declarations (Specification (gnat_decl
)),
5880 Empty
, true, false);
5882 /* Similarly for any declarations in the actions of a
5884 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5886 process_freeze_entity (gnat_decl
);
5887 process_decls (Actions (gnat_decl
), Empty
, Empty
, true, false);
5890 /* Package bodies with freeze nodes get their elaboration deferred
5891 until the freeze node, but the code must be placed in the right
5892 place, so record the code position now. */
5893 else if (Nkind (gnat_decl
) == N_Package_Body
5894 && Present (Freeze_Node (Corresponding_Spec (gnat_decl
))))
5895 record_code_position (gnat_decl
);
5897 else if (Nkind (gnat_decl
) == N_Package_Body_Stub
5898 && Present (Library_Unit (gnat_decl
))
5899 && Present (Freeze_Node
5902 (Library_Unit (gnat_decl
)))))))
5903 record_code_position
5904 (Proper_Body (Unit (Library_Unit (gnat_decl
))));
5906 /* We defer most subprogram bodies to the second pass. */
5907 else if (Nkind (gnat_decl
) == N_Subprogram_Body
)
5909 if (Acts_As_Spec (gnat_decl
))
5911 Node_Id gnat_subprog_id
= Defining_Entity (gnat_decl
);
5913 if (Ekind (gnat_subprog_id
) != E_Generic_Procedure
5914 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5915 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5918 /* For bodies and stubs that act as their own specs, the entity
5919 itself must be elaborated in the first pass, because it may
5920 be used in other declarations. */
5921 else if (Nkind (gnat_decl
) == N_Subprogram_Body_Stub
)
5923 Node_Id gnat_subprog_id
=
5924 Defining_Entity (Specification (gnat_decl
));
5926 if (Ekind (gnat_subprog_id
) != E_Subprogram_Body
5927 && Ekind (gnat_subprog_id
) != E_Generic_Procedure
5928 && Ekind (gnat_subprog_id
) != E_Generic_Function
)
5929 gnat_to_gnu_entity (gnat_subprog_id
, NULL_TREE
, 1);
5932 /* Concurrent stubs stand for the corresponding subprogram bodies,
5933 which are deferred like other bodies. */
5934 else if (Nkind (gnat_decl
) == N_Task_Body_Stub
5935 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5938 add_stmt (gnat_to_gnu (gnat_decl
));
5941 /* Here we elaborate everything we deferred above except for package bodies,
5942 which are elaborated at their freeze nodes. Note that we must also
5943 go inside things (package specs and freeze nodes) the first pass did. */
5945 for (i
= 0; i
<= 1; i
++)
5946 if (Present (gnat_decl_array
[i
]))
5947 for (gnat_decl
= First (gnat_decl_array
[i
]);
5948 gnat_decl
!= gnat_end_list
; gnat_decl
= Next (gnat_decl
))
5950 if (Nkind (gnat_decl
) == N_Subprogram_Body
5951 || Nkind (gnat_decl
) == N_Subprogram_Body_Stub
5952 || Nkind (gnat_decl
) == N_Task_Body_Stub
5953 || Nkind (gnat_decl
) == N_Protected_Body_Stub
)
5954 add_stmt (gnat_to_gnu (gnat_decl
));
5956 else if (Nkind (gnat_decl
) == N_Package_Declaration
5957 && (Nkind (Specification (gnat_decl
)
5958 == N_Package_Specification
)))
5959 process_decls (Visible_Declarations (Specification (gnat_decl
)),
5960 Private_Declarations (Specification (gnat_decl
)),
5961 Empty
, false, true);
5963 else if (Nkind (gnat_decl
) == N_Freeze_Entity
)
5964 process_decls (Actions (gnat_decl
), Empty
, Empty
, false, true);
5968 /* Make a unary operation of kind CODE using build_unary_op, but guard
5969 the operation by an overflow check. CODE can be one of NEGATE_EXPR
5970 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
5971 the operation is to be performed in that type. */
5974 build_unary_op_trapv (enum tree_code code
, tree gnu_type
, tree operand
)
5976 gcc_assert (code
== NEGATE_EXPR
|| code
== ABS_EXPR
);
5978 operand
= protect_multiple_eval (operand
);
5980 return emit_check (build_binary_op (EQ_EXPR
, integer_type_node
,
5981 operand
, TYPE_MIN_VALUE (gnu_type
)),
5982 build_unary_op (code
, gnu_type
, operand
),
5983 CE_Overflow_Check_Failed
);
5986 /* Make a binary operation of kind CODE using build_binary_op, but guard
5987 the operation by an overflow check. CODE can be one of PLUS_EXPR,
5988 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
5989 Usually the operation is to be performed in that type. */
5992 build_binary_op_trapv (enum tree_code code
, tree gnu_type
, tree left
,
5995 tree lhs
= protect_multiple_eval (left
);
5996 tree rhs
= protect_multiple_eval (right
);
5997 tree type_max
= TYPE_MAX_VALUE (gnu_type
);
5998 tree type_min
= TYPE_MIN_VALUE (gnu_type
);
6001 tree zero
= convert (gnu_type
, integer_zero_node
);
6006 int precision
= TYPE_PRECISION (gnu_type
);
6008 gcc_assert (!(precision
& (precision
- 1))); /* ensure power of 2 */
6010 /* Prefer a constant or known-positive rhs to simplify checks. */
6011 if (!TREE_CONSTANT (rhs
)
6012 && commutative_tree_code (code
)
6013 && (TREE_CONSTANT (lhs
) || (!tree_expr_nonnegative_p (rhs
)
6014 && tree_expr_nonnegative_p (lhs
))))
6021 rhs_lt_zero
= tree_expr_nonnegative_p (rhs
)
6023 : build_binary_op (LT_EXPR
, integer_type_node
, rhs
, zero
);
6025 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
6027 /* Try a few strategies that may be cheaper than the general
6028 code at the end of the function, if the rhs is not known.
6030 - Call library function for 64-bit multiplication (complex)
6031 - Widen, if input arguments are sufficiently small
6032 - Determine overflow using wrapped result for addition/subtraction. */
6034 if (!TREE_CONSTANT (rhs
))
6036 /* Even for add/subtract double size to get another base type. */
6037 int needed_precision
= precision
* 2;
6039 if (code
== MULT_EXPR
&& precision
== 64)
6041 tree int_64
= gnat_type_for_size (64, 0);
6043 return convert (gnu_type
, build_call_2_expr (mulv64_decl
,
6044 convert (int_64
, lhs
),
6045 convert (int_64
, rhs
)));
6048 else if (needed_precision
<= BITS_PER_WORD
6049 || (code
== MULT_EXPR
6050 && needed_precision
<= LONG_LONG_TYPE_SIZE
))
6052 tree wide_type
= gnat_type_for_size (needed_precision
, 0);
6054 tree wide_result
= build_binary_op (code
, wide_type
,
6055 convert (wide_type
, lhs
),
6056 convert (wide_type
, rhs
));
6058 tree check
= build_binary_op
6059 (TRUTH_ORIF_EXPR
, integer_type_node
,
6060 build_binary_op (LT_EXPR
, integer_type_node
, wide_result
,
6061 convert (wide_type
, type_min
)),
6062 build_binary_op (GT_EXPR
, integer_type_node
, wide_result
,
6063 convert (wide_type
, type_max
)));
6065 tree result
= convert (gnu_type
, wide_result
);
6067 return emit_check (check
, result
, CE_Overflow_Check_Failed
);
6070 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
6072 tree unsigned_type
= gnat_type_for_size (precision
, 1);
6073 tree wrapped_expr
= convert
6074 (gnu_type
, build_binary_op (code
, unsigned_type
,
6075 convert (unsigned_type
, lhs
),
6076 convert (unsigned_type
, rhs
)));
6078 tree result
= convert
6079 (gnu_type
, build_binary_op (code
, gnu_type
, lhs
, rhs
));
6081 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
6082 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
6083 tree check
= build_binary_op
6084 (TRUTH_XOR_EXPR
, integer_type_node
, rhs_lt_zero
,
6085 build_binary_op (code
== PLUS_EXPR
? LT_EXPR
: GT_EXPR
,
6086 integer_type_node
, wrapped_expr
, lhs
));
6088 return emit_check (check
, result
, CE_Overflow_Check_Failed
);
6095 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
6096 check_pos
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6097 build_binary_op (MINUS_EXPR
, gnu_type
,
6100 /* When rhs < 0, overflow when lhs < type_min - rhs. */
6101 check_neg
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6102 build_binary_op (MINUS_EXPR
, gnu_type
,
6107 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
6108 check_pos
= build_binary_op (LT_EXPR
, integer_type_node
, lhs
,
6109 build_binary_op (PLUS_EXPR
, gnu_type
,
6112 /* When rhs < 0, overflow when lhs > type_max + rhs. */
6113 check_neg
= build_binary_op (GT_EXPR
, integer_type_node
, lhs
,
6114 build_binary_op (PLUS_EXPR
, gnu_type
,
6119 /* The check here is designed to be efficient if the rhs is constant,
6120 but it will work for any rhs by using integer division.
6121 Four different check expressions determine wether X * C overflows,
6124 C > 0 => X > type_max / C || X < type_min / C
6125 C == -1 => X == type_min
6126 C < -1 => X > type_min / C || X < type_max / C */
6128 tmp1
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_max
, rhs
);
6129 tmp2
= build_binary_op (TRUNC_DIV_EXPR
, gnu_type
, type_min
, rhs
);
6131 check_pos
= build_binary_op (TRUTH_ANDIF_EXPR
, integer_type_node
,
6132 build_binary_op (NE_EXPR
, integer_type_node
, zero
, rhs
),
6133 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6134 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp1
),
6135 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp2
)));
6137 check_neg
= fold_build3 (COND_EXPR
, integer_type_node
,
6138 build_binary_op (EQ_EXPR
, integer_type_node
, rhs
,
6139 build_int_cst (gnu_type
, -1)),
6140 build_binary_op (EQ_EXPR
, integer_type_node
, lhs
, type_min
),
6141 build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6142 build_binary_op (GT_EXPR
, integer_type_node
, lhs
, tmp2
),
6143 build_binary_op (LT_EXPR
, integer_type_node
, lhs
, tmp1
)));
6150 gnu_expr
= build_binary_op (code
, gnu_type
, lhs
, rhs
);
6152 /* If we can fold the expression to a constant, just return it.
6153 The caller will deal with overflow, no need to generate a check. */
6154 if (TREE_CONSTANT (gnu_expr
))
6157 check
= fold_build3 (COND_EXPR
, integer_type_node
,
6158 rhs_lt_zero
, check_neg
, check_pos
);
6160 return emit_check (check
, gnu_expr
, CE_Overflow_Check_Failed
);
6163 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
6164 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
6165 which we have to check. */
6168 emit_range_check (tree gnu_expr
, Entity_Id gnat_range_type
)
6170 tree gnu_range_type
= get_unpadded_type (gnat_range_type
);
6171 tree gnu_low
= TYPE_MIN_VALUE (gnu_range_type
);
6172 tree gnu_high
= TYPE_MAX_VALUE (gnu_range_type
);
6173 tree gnu_compare_type
= get_base_type (TREE_TYPE (gnu_expr
));
6175 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
6176 This can for example happen when translating 'Val or 'Value. */
6177 if (gnu_compare_type
== gnu_range_type
)
6180 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
6181 we can't do anything since we might be truncating the bounds. No
6182 check is needed in this case. */
6183 if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr
))
6184 && (TYPE_PRECISION (gnu_compare_type
)
6185 < TYPE_PRECISION (get_base_type (gnu_range_type
))))
6188 /* Checked expressions must be evaluated only once. */
6189 gnu_expr
= protect_multiple_eval (gnu_expr
);
6191 /* There's no good type to use here, so we might as well use
6192 integer_type_node. Note that the form of the check is
6193 (not (expr >= lo)) or (not (expr <= hi))
6194 the reason for this slightly convoluted form is that NaNs
6195 are not considered to be in range in the float case. */
6197 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6199 (build_binary_op (GE_EXPR
, integer_type_node
,
6200 convert (gnu_compare_type
, gnu_expr
),
6201 convert (gnu_compare_type
, gnu_low
))),
6203 (build_binary_op (LE_EXPR
, integer_type_node
,
6204 convert (gnu_compare_type
, gnu_expr
),
6205 convert (gnu_compare_type
,
6207 gnu_expr
, CE_Range_Check_Failed
);
6210 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object
6211 which we are about to index, GNU_EXPR is the index expression to be
6212 checked, GNU_LOW and GNU_HIGH are the lower and upper bounds
6213 against which GNU_EXPR has to be checked. Note that for index
6214 checking we cannot use the emit_range_check function (although very
6215 similar code needs to be generated in both cases) since for index
6216 checking the array type against which we are checking the indices
6217 may be unconstrained and consequently we need to retrieve the
6218 actual index bounds from the array object itself
6219 (GNU_ARRAY_OBJECT). The place where we need to do that is in
6220 subprograms having unconstrained array formal parameters */
6223 emit_index_check (tree gnu_array_object
,
6228 tree gnu_expr_check
;
6230 /* Checked expressions must be evaluated only once. */
6231 gnu_expr
= protect_multiple_eval (gnu_expr
);
6233 /* Must do this computation in the base type in case the expression's
6234 type is an unsigned subtypes. */
6235 gnu_expr_check
= convert (get_base_type (TREE_TYPE (gnu_expr
)), gnu_expr
);
6237 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
6238 the object we are handling. */
6239 gnu_low
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low
, gnu_array_object
);
6240 gnu_high
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high
, gnu_array_object
);
6242 /* There's no good type to use here, so we might as well use
6243 integer_type_node. */
6245 (build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
,
6246 build_binary_op (LT_EXPR
, integer_type_node
,
6248 convert (TREE_TYPE (gnu_expr_check
),
6250 build_binary_op (GT_EXPR
, integer_type_node
,
6252 convert (TREE_TYPE (gnu_expr_check
),
6254 gnu_expr
, CE_Index_Check_Failed
);
6257 /* GNU_COND contains the condition corresponding to an access, discriminant or
6258 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
6259 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
6260 REASON is the code that says why the exception was raised. */
6263 emit_check (tree gnu_cond
, tree gnu_expr
, int reason
)
6265 tree gnu_call
= build_call_raise (reason
, Empty
, N_Raise_Constraint_Error
);
6267 = fold_build3 (COND_EXPR
, TREE_TYPE (gnu_expr
), gnu_cond
,
6268 build2 (COMPOUND_EXPR
, TREE_TYPE (gnu_expr
), gnu_call
,
6269 convert (TREE_TYPE (gnu_expr
), integer_zero_node
)),
6272 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
6273 we don't need to evaluate it just for the check. */
6274 TREE_SIDE_EFFECTS (gnu_result
) = TREE_SIDE_EFFECTS (gnu_expr
);
6279 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing
6280 overflow checks if OVERFLOW_P is nonzero and range checks if
6281 RANGE_P is nonzero. GNAT_TYPE is known to be an integral type.
6282 If TRUNCATE_P is nonzero, do a float to integer conversion with
6283 truncation; otherwise round. */
6286 convert_with_check (Entity_Id gnat_type
, tree gnu_expr
, bool overflowp
,
6287 bool rangep
, bool truncatep
)
6289 tree gnu_type
= get_unpadded_type (gnat_type
);
6290 tree gnu_in_type
= TREE_TYPE (gnu_expr
);
6291 tree gnu_in_basetype
= get_base_type (gnu_in_type
);
6292 tree gnu_base_type
= get_base_type (gnu_type
);
6293 tree gnu_result
= gnu_expr
;
6295 /* If we are not doing any checks, the output is an integral type, and
6296 the input is not a floating type, just do the conversion. This
6297 shortcut is required to avoid problems with packed array types
6298 and simplifies code in all cases anyway. */
6299 if (!rangep
&& !overflowp
&& INTEGRAL_TYPE_P (gnu_base_type
)
6300 && !FLOAT_TYPE_P (gnu_in_type
))
6301 return convert (gnu_type
, gnu_expr
);
6303 /* First convert the expression to its base type. This
6304 will never generate code, but makes the tests below much simpler.
6305 But don't do this if converting from an integer type to an unconstrained
6306 array type since then we need to get the bounds from the original
6308 if (TREE_CODE (gnu_type
) != UNCONSTRAINED_ARRAY_TYPE
)
6309 gnu_result
= convert (gnu_in_basetype
, gnu_result
);
6311 /* If overflow checks are requested, we need to be sure the result will
6312 fit in the output base type. But don't do this if the input
6313 is integer and the output floating-point. */
6315 && !(FLOAT_TYPE_P (gnu_base_type
) && INTEGRAL_TYPE_P (gnu_in_basetype
)))
6317 /* Ensure GNU_EXPR only gets evaluated once. */
6318 tree gnu_input
= protect_multiple_eval (gnu_result
);
6319 tree gnu_cond
= integer_zero_node
;
6320 tree gnu_in_lb
= TYPE_MIN_VALUE (gnu_in_basetype
);
6321 tree gnu_in_ub
= TYPE_MAX_VALUE (gnu_in_basetype
);
6322 tree gnu_out_lb
= TYPE_MIN_VALUE (gnu_base_type
);
6323 tree gnu_out_ub
= TYPE_MAX_VALUE (gnu_base_type
);
6325 /* Convert the lower bounds to signed types, so we're sure we're
6326 comparing them properly. Likewise, convert the upper bounds
6327 to unsigned types. */
6328 if (INTEGRAL_TYPE_P (gnu_in_basetype
) && TYPE_UNSIGNED (gnu_in_basetype
))
6329 gnu_in_lb
= convert (gnat_signed_type (gnu_in_basetype
), gnu_in_lb
);
6331 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6332 && !TYPE_UNSIGNED (gnu_in_basetype
))
6333 gnu_in_ub
= convert (gnat_unsigned_type (gnu_in_basetype
), gnu_in_ub
);
6335 if (INTEGRAL_TYPE_P (gnu_base_type
) && TYPE_UNSIGNED (gnu_base_type
))
6336 gnu_out_lb
= convert (gnat_signed_type (gnu_base_type
), gnu_out_lb
);
6338 if (INTEGRAL_TYPE_P (gnu_base_type
) && !TYPE_UNSIGNED (gnu_base_type
))
6339 gnu_out_ub
= convert (gnat_unsigned_type (gnu_base_type
), gnu_out_ub
);
6341 /* Check each bound separately and only if the result bound
6342 is tighter than the bound on the input type. Note that all the
6343 types are base types, so the bounds must be constant. Also,
6344 the comparison is done in the base type of the input, which
6345 always has the proper signedness. First check for input
6346 integer (which means output integer), output float (which means
6347 both float), or mixed, in which case we always compare.
6348 Note that we have to do the comparison which would *fail* in the
6349 case of an error since if it's an FP comparison and one of the
6350 values is a NaN or Inf, the comparison will fail. */
6351 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6352 ? tree_int_cst_lt (gnu_in_lb
, gnu_out_lb
)
6353 : (FLOAT_TYPE_P (gnu_base_type
)
6354 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb
),
6355 TREE_REAL_CST (gnu_out_lb
))
6359 (build_binary_op (GE_EXPR
, integer_type_node
,
6360 gnu_input
, convert (gnu_in_basetype
,
6363 if (INTEGRAL_TYPE_P (gnu_in_basetype
)
6364 ? tree_int_cst_lt (gnu_out_ub
, gnu_in_ub
)
6365 : (FLOAT_TYPE_P (gnu_base_type
)
6366 ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub
),
6367 TREE_REAL_CST (gnu_in_lb
))
6370 = build_binary_op (TRUTH_ORIF_EXPR
, integer_type_node
, gnu_cond
,
6372 (build_binary_op (LE_EXPR
, integer_type_node
,
6374 convert (gnu_in_basetype
,
6377 if (!integer_zerop (gnu_cond
))
6378 gnu_result
= emit_check (gnu_cond
, gnu_input
,
6379 CE_Overflow_Check_Failed
);
6382 /* Now convert to the result base type. If this is a non-truncating
6383 float-to-integer conversion, round. */
6384 if (INTEGRAL_TYPE_P (gnu_base_type
) && FLOAT_TYPE_P (gnu_in_basetype
)
6387 REAL_VALUE_TYPE half_minus_pred_half
, pred_half
;
6388 tree gnu_conv
, gnu_zero
, gnu_comp
, gnu_saved_result
, calc_type
;
6389 tree gnu_pred_half
, gnu_add_pred_half
, gnu_subtract_pred_half
;
6390 const struct real_format
*fmt
;
6392 /* The following calculations depend on proper rounding to even
6393 of each arithmetic operation. In order to prevent excess
6394 precision from spoiling this property, use the widest hardware
6395 floating-point type if FP_ARITH_MAY_WIDEN is true. */
6397 calc_type
= (FP_ARITH_MAY_WIDEN
? longest_float_type_node
6400 /* FIXME: Should not have padding in the first place */
6401 if (TREE_CODE (calc_type
) == RECORD_TYPE
6402 && TYPE_IS_PADDING_P (calc_type
))
6403 calc_type
= TREE_TYPE (TYPE_FIELDS (calc_type
));
6405 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
6406 fmt
= REAL_MODE_FORMAT (TYPE_MODE (calc_type
));
6407 real_2expN (&half_minus_pred_half
, -(fmt
->p
) - 1, TYPE_MODE (calc_type
));
6408 REAL_ARITHMETIC (pred_half
, MINUS_EXPR
, dconsthalf
,
6409 half_minus_pred_half
);
6410 gnu_pred_half
= build_real (calc_type
, pred_half
);
6412 /* If the input is strictly negative, subtract this value
6413 and otherwise add it from the input. For 0.5, the result
6414 is exactly between 1.0 and the machine number preceding 1.0
6415 (for calc_type). Since the last bit of 1.0 is even, this 0.5
6416 will round to 1.0, while all other number with an absolute
6417 value less than 0.5 round to 0.0. For larger numbers exactly
6418 halfway between integers, rounding will always be correct as
6419 the true mathematical result will be closer to the higher
6420 integer compared to the lower one. So, this constant works
6421 for all floating-point numbers.
6423 The reason to use the same constant with subtract/add instead
6424 of a positive and negative constant is to allow the comparison
6425 to be scheduled in parallel with retrieval of the constant and
6426 conversion of the input to the calc_type (if necessary).
6429 gnu_zero
= convert (gnu_in_basetype
, integer_zero_node
);
6430 gnu_saved_result
= save_expr (gnu_result
);
6431 gnu_conv
= convert (calc_type
, gnu_saved_result
);
6432 gnu_comp
= build2 (GE_EXPR
, integer_type_node
,
6433 gnu_saved_result
, gnu_zero
);
6435 = build2 (PLUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6436 gnu_subtract_pred_half
6437 = build2 (MINUS_EXPR
, calc_type
, gnu_conv
, gnu_pred_half
);
6438 gnu_result
= build3 (COND_EXPR
, calc_type
, gnu_comp
,
6439 gnu_add_pred_half
, gnu_subtract_pred_half
);
6442 if (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6443 && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type
)
6444 && TREE_CODE (gnu_result
) == UNCONSTRAINED_ARRAY_REF
)
6445 gnu_result
= unchecked_convert (gnu_base_type
, gnu_result
, false);
6447 gnu_result
= convert (gnu_base_type
, gnu_result
);
6449 /* Finally, do the range check if requested. Note that if the
6450 result type is a modular type, the range check is actually
6451 an overflow check. */
6454 || (TREE_CODE (gnu_base_type
) == INTEGER_TYPE
6455 && TYPE_MODULAR_P (gnu_base_type
) && overflowp
))
6456 gnu_result
= emit_range_check (gnu_result
, gnat_type
);
6458 return convert (gnu_type
, gnu_result
);
6461 /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */
6464 smaller_packable_type_p (tree type
, tree record_type
)
6468 /* We're not interested in variants here. */
6469 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (record_type
))
6472 /* Like a variant, a packable version keeps the original TYPE_NAME. */
6473 if (TYPE_NAME (type
) != TYPE_NAME (record_type
))
6476 size
= TYPE_SIZE (type
);
6477 rsize
= TYPE_SIZE (record_type
);
6479 if (!(TREE_CODE (size
) == INTEGER_CST
&& TREE_CODE (rsize
) == INTEGER_CST
))
6482 return tree_int_cst_lt (size
, rsize
) != 0;
6485 /* Return true if GNU_EXPR can be directly addressed. This is the case
6486 unless it is an expression involving computation or if it involves a
6487 reference to a bitfield or to an object not sufficiently aligned for
6488 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
6489 be directly addressed as an object of this type.
6491 *** Notes on addressability issues in the Ada compiler ***
6493 This predicate is necessary in order to bridge the gap between Gigi
6494 and the middle-end about addressability of GENERIC trees. A tree
6495 is said to be addressable if it can be directly addressed, i.e. if
6496 its address can be taken, is a multiple of the type's alignment on
6497 strict-alignment architectures and returns the first storage unit
6498 assigned to the object represented by the tree.
6500 In the C family of languages, everything is in practice addressable
6501 at the language level, except for bit-fields. This means that these
6502 compilers will take the address of any tree that doesn't represent
6503 a bit-field reference and expect the result to be the first storage
6504 unit assigned to the object. Even in cases where this will result
6505 in unaligned accesses at run time, nothing is supposed to be done
6506 and the program is considered as erroneous instead (see PR c/18287).
6508 The implicit assumptions made in the middle-end are in keeping with
6509 the C viewpoint described above:
6510 - the address of a bit-field reference is supposed to be never
6511 taken; the compiler (generally) will stop on such a construct,
6512 - any other tree is addressable if it is formally addressable,
6513 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
6515 In Ada, the viewpoint is the opposite one: nothing is addressable
6516 at the language level unless explicitly declared so. This means
6517 that the compiler will both make sure that the trees representing
6518 references to addressable ("aliased" in Ada parlance) objects are
6519 addressable and make no real attempts at ensuring that the trees
6520 representing references to non-addressable objects are addressable.
6522 In the first case, Ada is effectively equivalent to C and handing
6523 down the direct result of applying ADDR_EXPR to these trees to the
6524 middle-end works flawlessly. In the second case, Ada cannot afford
6525 to consider the program as erroneous if the address of trees that
6526 are not addressable is requested for technical reasons, unlike C;
6527 as a consequence, the Ada compiler must arrange for either making
6528 sure that this address is not requested in the middle-end or for
6529 compensating by inserting temporaries if it is requested in Gigi.
6531 The first goal can be achieved because the middle-end should not
6532 request the address of non-addressable trees on its own; the only
6533 exception is for the invocation of low-level block operations like
6534 memcpy, for which the addressability requirements are lower since
6535 the type's alignment can be disregarded. In practice, this means
6536 that Gigi must make sure that such operations cannot be applied to
6537 non-BLKmode bit-fields.
6539 The second goal is achieved by means of the addressable_p predicate
6540 and by inserting SAVE_EXPRs around trees deemed non-addressable.
6541 They will be turned during gimplification into proper temporaries
6542 whose address will be used in lieu of that of the original tree. */
6545 addressable_p (tree gnu_expr
, tree gnu_type
)
6547 /* The size of the real type of the object must not be smaller than
6548 that of the expected type, otherwise an indirect access in the
6549 latter type would be larger than the object. Only records need
6550 to be considered in practice. */
6552 && TREE_CODE (gnu_type
) == RECORD_TYPE
6553 && smaller_packable_type_p (TREE_TYPE (gnu_expr
), gnu_type
))
6556 switch (TREE_CODE (gnu_expr
))
6562 /* All DECLs are addressable: if they are in a register, we can force
6566 case UNCONSTRAINED_ARRAY_REF
:
6577 /* We accept &COND_EXPR as soon as both operands are addressable and
6578 expect the outcome to be the address of the selected operand. */
6579 return (addressable_p (TREE_OPERAND (gnu_expr
, 1), NULL_TREE
)
6580 && addressable_p (TREE_OPERAND (gnu_expr
, 2), NULL_TREE
));
6583 return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr
, 1))
6584 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
6585 the field is sufficiently aligned, in case it is subject
6586 to a pragma Component_Alignment. But we don't need to
6587 check the alignment of the containing record, as it is
6588 guaranteed to be not smaller than that of its most
6589 aligned field that is not a bit-field. */
6590 && (!STRICT_ALIGNMENT
6591 || DECL_ALIGN (TREE_OPERAND (gnu_expr
, 1))
6592 >= TYPE_ALIGN (TREE_TYPE (gnu_expr
))))
6593 /* The field of a padding record is always addressable. */
6594 || TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr
, 0))))
6595 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6597 case ARRAY_REF
: case ARRAY_RANGE_REF
:
6598 case REALPART_EXPR
: case IMAGPART_EXPR
:
6600 return addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
);
6603 return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr
))
6604 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6606 case VIEW_CONVERT_EXPR
:
6608 /* This is addressable if we can avoid a copy. */
6609 tree type
= TREE_TYPE (gnu_expr
);
6610 tree inner_type
= TREE_TYPE (TREE_OPERAND (gnu_expr
, 0));
6611 return (((TYPE_MODE (type
) == TYPE_MODE (inner_type
)
6612 && (!STRICT_ALIGNMENT
6613 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6614 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
))
6615 || ((TYPE_MODE (type
) == BLKmode
6616 || TYPE_MODE (inner_type
) == BLKmode
)
6617 && (!STRICT_ALIGNMENT
6618 || TYPE_ALIGN (type
) <= TYPE_ALIGN (inner_type
)
6619 || TYPE_ALIGN (inner_type
) >= BIGGEST_ALIGNMENT
6620 || TYPE_ALIGN_OK (type
)
6621 || TYPE_ALIGN_OK (inner_type
))))
6622 && addressable_p (TREE_OPERAND (gnu_expr
, 0), NULL_TREE
));
6630 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
6631 a separate Freeze node exists, delay the bulk of the processing. Otherwise
6632 make a GCC type for GNAT_ENTITY and set up the correspondence. */
6635 process_type (Entity_Id gnat_entity
)
6638 = present_gnu_tree (gnat_entity
) ? get_gnu_tree (gnat_entity
) : 0;
6641 /* If we are to delay elaboration of this type, just do any
6642 elaborations needed for expressions within the declaration and
6643 make a dummy type entry for this node and its Full_View (if
6644 any) in case something points to it. Don't do this if it
6645 has already been done (the only way that can happen is if
6646 the private completion is also delayed). */
6647 if (Present (Freeze_Node (gnat_entity
))
6648 || (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6649 && Present (Full_View (gnat_entity
))
6650 && Freeze_Node (Full_View (gnat_entity
))
6651 && !present_gnu_tree (Full_View (gnat_entity
))))
6653 elaborate_entity (gnat_entity
);
6657 tree gnu_decl
= create_type_decl (get_entity_name (gnat_entity
),
6658 make_dummy_type (gnat_entity
),
6659 NULL
, false, false, gnat_entity
);
6661 save_gnu_tree (gnat_entity
, gnu_decl
, false);
6662 if (IN (Ekind (gnat_entity
), Incomplete_Or_Private_Kind
)
6663 && Present (Full_View (gnat_entity
)))
6664 save_gnu_tree (Full_View (gnat_entity
), gnu_decl
, false);
6670 /* If we saved away a dummy type for this node it means that this
6671 made the type that corresponds to the full type of an incomplete
6672 type. Clear that type for now and then update the type in the
6676 gcc_assert (TREE_CODE (gnu_old
) == TYPE_DECL
6677 && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old
)));
6679 save_gnu_tree (gnat_entity
, NULL_TREE
, false);
6682 /* Now fully elaborate the type. */
6683 gnu_new
= gnat_to_gnu_entity (gnat_entity
, NULL_TREE
, 1);
6684 gcc_assert (TREE_CODE (gnu_new
) == TYPE_DECL
);
6686 /* If we have an old type and we've made pointers to this type,
6687 update those pointers. */
6689 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old
)),
6690 TREE_TYPE (gnu_new
));
6692 /* If this is a record type corresponding to a task or protected type
6693 that is a completion of an incomplete type, perform a similar update
6695 /* ??? Including protected types here is a guess. */
6697 if (IN (Ekind (gnat_entity
), Record_Kind
)
6698 && Is_Concurrent_Record_Type (gnat_entity
)
6699 && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
)))
6702 = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
));
6704 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6706 save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity
),
6709 update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old
)),
6710 TREE_TYPE (gnu_new
));
6714 /* GNAT_ENTITY is the type of the resulting constructors,
6715 GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate,
6716 and GNU_TYPE is the GCC type of the corresponding record.
6718 Return a CONSTRUCTOR to build the record. */
6721 assoc_to_constructor (Entity_Id gnat_entity
, Node_Id gnat_assoc
, tree gnu_type
)
6723 tree gnu_list
, gnu_result
;
6725 /* We test for GNU_FIELD being empty in the case where a variant
6726 was the last thing since we don't take things off GNAT_ASSOC in
6727 that case. We check GNAT_ASSOC in case we have a variant, but it
6730 for (gnu_list
= NULL_TREE
; Present (gnat_assoc
);
6731 gnat_assoc
= Next (gnat_assoc
))
6733 Node_Id gnat_field
= First (Choices (gnat_assoc
));
6734 tree gnu_field
= gnat_to_gnu_field_decl (Entity (gnat_field
));
6735 tree gnu_expr
= gnat_to_gnu (Expression (gnat_assoc
));
6737 /* The expander is supposed to put a single component selector name
6738 in every record component association */
6739 gcc_assert (No (Next (gnat_field
)));
6741 /* Ignore fields that have Corresponding_Discriminants since we'll
6742 be setting that field in the parent. */
6743 if (Present (Corresponding_Discriminant (Entity (gnat_field
)))
6744 && Is_Tagged_Type (Scope (Entity (gnat_field
))))
6747 /* Also ignore discriminants of Unchecked_Unions. */
6748 else if (Is_Unchecked_Union (gnat_entity
)
6749 && Ekind (Entity (gnat_field
)) == E_Discriminant
)
6752 /* Before assigning a value in an aggregate make sure range checks
6753 are done if required. Then convert to the type of the field. */
6754 if (Do_Range_Check (Expression (gnat_assoc
)))
6755 gnu_expr
= emit_range_check (gnu_expr
, Etype (gnat_field
));
6757 gnu_expr
= convert (TREE_TYPE (gnu_field
), gnu_expr
);
6759 /* Add the field and expression to the list. */
6760 gnu_list
= tree_cons (gnu_field
, gnu_expr
, gnu_list
);
6763 gnu_result
= extract_values (gnu_list
, gnu_type
);
6765 #ifdef ENABLE_CHECKING
6769 /* Verify every entry in GNU_LIST was used. */
6770 for (gnu_field
= gnu_list
; gnu_field
; gnu_field
= TREE_CHAIN (gnu_field
))
6771 gcc_assert (TREE_ADDRESSABLE (gnu_field
));
6778 /* Builds a possibly nested constructor for array aggregates. GNAT_EXPR
6779 is the first element of an array aggregate. It may itself be an
6780 aggregate (an array or record aggregate). GNU_ARRAY_TYPE is the gnu type
6781 corresponding to the array aggregate. GNAT_COMPONENT_TYPE is the type
6782 of the array component. It is needed for range checking. */
6785 pos_to_constructor (Node_Id gnat_expr
, tree gnu_array_type
,
6786 Entity_Id gnat_component_type
)
6788 tree gnu_expr_list
= NULL_TREE
;
6789 tree gnu_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type
));
6792 for ( ; Present (gnat_expr
); gnat_expr
= Next (gnat_expr
))
6794 /* If the expression is itself an array aggregate then first build the
6795 innermost constructor if it is part of our array (multi-dimensional
6798 if (Nkind (gnat_expr
) == N_Aggregate
6799 && TREE_CODE (TREE_TYPE (gnu_array_type
)) == ARRAY_TYPE
6800 && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type
)))
6801 gnu_expr
= pos_to_constructor (First (Expressions (gnat_expr
)),
6802 TREE_TYPE (gnu_array_type
),
6803 gnat_component_type
);
6806 gnu_expr
= gnat_to_gnu (gnat_expr
);
6808 /* before assigning the element to the array make sure it is
6810 if (Do_Range_Check (gnat_expr
))
6811 gnu_expr
= emit_range_check (gnu_expr
, gnat_component_type
);
6815 = tree_cons (gnu_index
, convert (TREE_TYPE (gnu_array_type
), gnu_expr
),
6818 gnu_index
= int_const_binop (PLUS_EXPR
, gnu_index
, integer_one_node
, 0);
6821 return gnat_build_constructor (gnu_array_type
, nreverse (gnu_expr_list
));
6824 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
6825 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
6826 of the associations that are from RECORD_TYPE. If we see an internal
6827 record, make a recursive call to fill it in as well. */
6830 extract_values (tree values
, tree record_type
)
6832 tree result
= NULL_TREE
;
6835 for (field
= TYPE_FIELDS (record_type
); field
; field
= TREE_CHAIN (field
))
6839 /* _Parent is an internal field, but may have values in the aggregate,
6840 so check for values first. */
6841 if ((tem
= purpose_member (field
, values
)))
6843 value
= TREE_VALUE (tem
);
6844 TREE_ADDRESSABLE (tem
) = 1;
6847 else if (DECL_INTERNAL_P (field
))
6849 value
= extract_values (values
, TREE_TYPE (field
));
6850 if (TREE_CODE (value
) == CONSTRUCTOR
6851 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (value
)))
6855 /* If we have a record subtype, the names will match, but not the
6856 actual FIELD_DECLs. */
6857 for (tem
= values
; tem
; tem
= TREE_CHAIN (tem
))
6858 if (DECL_NAME (TREE_PURPOSE (tem
)) == DECL_NAME (field
))
6860 value
= convert (TREE_TYPE (field
), TREE_VALUE (tem
));
6861 TREE_ADDRESSABLE (tem
) = 1;
6867 result
= tree_cons (field
, value
, result
);
6870 return gnat_build_constructor (record_type
, nreverse (result
));
6873 /* EXP is to be treated as an array or record. Handle the cases when it is
6874 an access object and perform the required dereferences. */
6877 maybe_implicit_deref (tree exp
)
6879 /* If the type is a pointer, dereference it. */
6881 if (POINTER_TYPE_P (TREE_TYPE (exp
)) || TYPE_FAT_POINTER_P (TREE_TYPE (exp
)))
6882 exp
= build_unary_op (INDIRECT_REF
, NULL_TREE
, exp
);
6884 /* If we got a padded type, remove it too. */
6885 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
6886 && TYPE_IS_PADDING_P (TREE_TYPE (exp
)))
6887 exp
= convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp
))), exp
);
6892 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
6895 protect_multiple_eval (tree exp
)
6897 tree type
= TREE_TYPE (exp
);
6899 /* If this has no side effects, we don't need to do anything. */
6900 if (!TREE_SIDE_EFFECTS (exp
))
6903 /* If it is a conversion, protect what's inside the conversion.
6904 Similarly, if we're indirectly referencing something, we only
6905 actually need to protect the address since the data itself can't
6906 change in these situations. */
6907 else if (TREE_CODE (exp
) == NON_LVALUE_EXPR
6908 || CONVERT_EXPR_P (exp
)
6909 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
6910 || TREE_CODE (exp
) == INDIRECT_REF
6911 || TREE_CODE (exp
) == UNCONSTRAINED_ARRAY_REF
)
6912 return build1 (TREE_CODE (exp
), type
,
6913 protect_multiple_eval (TREE_OPERAND (exp
, 0)));
6915 /* If EXP is a fat pointer or something that can be placed into a register,
6916 just make a SAVE_EXPR. */
6917 if (TYPE_FAT_POINTER_P (type
) || TYPE_MODE (type
) != BLKmode
)
6918 return save_expr (exp
);
6920 /* Otherwise, dereference, protect the address, and re-reference. */
6923 build_unary_op (INDIRECT_REF
, type
,
6924 save_expr (build_unary_op (ADDR_EXPR
,
6925 build_reference_type (type
),
6929 /* This is equivalent to stabilize_reference in tree.c, but we know how to
6930 handle our own nodes and we take extra arguments. FORCE says whether to
6931 force evaluation of everything. We set SUCCESS to true unless we walk
6932 through something we don't know how to stabilize. */
6935 maybe_stabilize_reference (tree ref
, bool force
, bool *success
)
6937 tree type
= TREE_TYPE (ref
);
6938 enum tree_code code
= TREE_CODE (ref
);
6941 /* Assume we'll success unless proven otherwise. */
6950 /* No action is needed in this case. */
6956 case FIX_TRUNC_EXPR
:
6957 case VIEW_CONVERT_EXPR
:
6959 = build1 (code
, type
,
6960 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6965 case UNCONSTRAINED_ARRAY_REF
:
6966 result
= build1 (code
, type
,
6967 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 0),
6972 result
= build3 (COMPONENT_REF
, type
,
6973 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6975 TREE_OPERAND (ref
, 1), NULL_TREE
);
6979 result
= build3 (BIT_FIELD_REF
, type
,
6980 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6982 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
6984 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 2),
6989 case ARRAY_RANGE_REF
:
6990 result
= build4 (code
, type
,
6991 maybe_stabilize_reference (TREE_OPERAND (ref
, 0), force
,
6993 gnat_stabilize_reference_1 (TREE_OPERAND (ref
, 1),
6995 NULL_TREE
, NULL_TREE
);
6999 result
= gnat_stabilize_reference_1 (ref
, force
);
7003 /* This generates better code than the scheme in protect_multiple_eval
7004 because large objects will be returned via invisible reference in
7005 most ABIs so the temporary will directly be filled by the callee. */
7006 result
= gnat_stabilize_reference_1 (ref
, force
);
7010 /* Constructors with 1 element are used extensively to formally
7011 convert objects to special wrapping types. */
7012 if (TREE_CODE (type
) == RECORD_TYPE
7013 && VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (ref
)) == 1)
7016 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->index
;
7018 = VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ref
), 0)->value
;
7020 = build_constructor_single (type
, index
,
7021 gnat_stabilize_reference_1 (value
,
7032 ref
= error_mark_node
;
7034 /* ... Fallthru to failure ... */
7036 /* If arg isn't a kind of lvalue we recognize, make no change.
7037 Caller should recognize the error for an invalid lvalue. */
7043 TREE_READONLY (result
) = TREE_READONLY (ref
);
7045 /* TREE_THIS_VOLATILE and TREE_SIDE_EFFECTS attached to the initial
7046 expression may not be sustained across some paths, such as the way via
7047 build1 for INDIRECT_REF. We re-populate those flags here for the general
7048 case, which is consistent with the GCC version of this routine.
7050 Special care should be taken regarding TREE_SIDE_EFFECTS, because some
7051 paths introduce side effects where there was none initially (e.g. calls
7052 to save_expr), and we also want to keep track of that. */
7054 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
7055 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (ref
);
7060 /* Wrapper around maybe_stabilize_reference, for common uses without
7061 lvalue restrictions and without need to examine the success
7065 gnat_stabilize_reference (tree ref
, bool force
)
7068 return maybe_stabilize_reference (ref
, force
, &dummy
);
7071 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
7072 arg to force a SAVE_EXPR for everything. */
7075 gnat_stabilize_reference_1 (tree e
, bool force
)
7077 enum tree_code code
= TREE_CODE (e
);
7078 tree type
= TREE_TYPE (e
);
7081 /* We cannot ignore const expressions because it might be a reference
7082 to a const array but whose index contains side-effects. But we can
7083 ignore things that are actual constant or that already have been
7084 handled by this function. */
7086 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
7089 switch (TREE_CODE_CLASS (code
))
7091 case tcc_exceptional
:
7093 case tcc_declaration
:
7094 case tcc_comparison
:
7096 case tcc_expression
:
7099 /* If this is a COMPONENT_REF of a fat pointer, save the entire
7100 fat pointer. This may be more efficient, but will also allow
7101 us to more easily find the match for the PLACEHOLDER_EXPR. */
7102 if (code
== COMPONENT_REF
7103 && TYPE_FAT_POINTER_P (TREE_TYPE (TREE_OPERAND (e
, 0))))
7104 result
= build3 (COMPONENT_REF
, type
,
7105 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7107 TREE_OPERAND (e
, 1), TREE_OPERAND (e
, 2));
7108 else if (TREE_SIDE_EFFECTS (e
) || force
)
7109 return save_expr (e
);
7115 /* Constants need no processing. In fact, we should never reach
7120 /* Recursively stabilize each operand. */
7121 result
= build2 (code
, type
,
7122 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0), force
),
7123 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 1),
7128 /* Recursively stabilize each operand. */
7129 result
= build1 (code
, type
,
7130 gnat_stabilize_reference_1 (TREE_OPERAND (e
, 0),
7138 TREE_READONLY (result
) = TREE_READONLY (e
);
7140 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
7141 TREE_SIDE_EFFECTS (result
) |= TREE_SIDE_EFFECTS (e
);
7145 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
7146 location and false if it doesn't. In the former case, set the Gigi global
7147 variable REF_FILENAME to the simple debug file name as given by sinput. */
7150 Sloc_to_locus (Source_Ptr Sloc
, location_t
*locus
)
7152 if (Sloc
== No_Location
)
7155 if (Sloc
<= Standard_Location
)
7157 if (*locus
== UNKNOWN_LOCATION
)
7158 *locus
= BUILTINS_LOCATION
;
7163 Source_File_Index file
= Get_Source_File_Index (Sloc
);
7164 Logical_Line_Number line
= Get_Logical_Line_Number (Sloc
);
7165 Column_Number column
= Get_Column_Number (Sloc
);
7166 struct line_map
*map
= &line_table
->maps
[file
- 1];
7168 /* Translate the location according to the line-map.h formula. */
7169 *locus
= map
->start_location
7170 + ((line
- map
->to_line
) << map
->column_bits
)
7171 + (column
& ((1 << map
->column_bits
) - 1));
7175 = IDENTIFIER_POINTER
7177 (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc
)))));;
7182 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
7183 don't do anything if it doesn't correspond to a source location. */
7186 set_expr_location_from_node (tree node
, Node_Id gnat_node
)
7190 if (!Sloc_to_locus (Sloc (gnat_node
), &locus
))
7193 SET_EXPR_LOCATION (node
, locus
);
7196 /* Return a colon-separated list of encodings contained in encoded Ada
7200 extract_encoding (const char *name
)
7202 char *encoding
= GGC_NEWVEC (char, strlen (name
));
7204 get_encoding (name
, encoding
);
7209 /* Extract the Ada name from an encoded name. */
7212 decode_name (const char *name
)
7214 char *decoded
= GGC_NEWVEC (char, strlen (name
) * 2 + 60);
7216 __gnat_decode (name
, decoded
, 0);
7221 /* Post an error message. MSG is the error message, properly annotated.
7222 NODE is the node at which to post the error and the node to use for the
7223 "&" substitution. */
7226 post_error (const char *msg
, Node_Id node
)
7228 String_Template temp
;
7231 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7232 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7234 Error_Msg_N (fp
, node
);
7237 /* Similar, but NODE is the node at which to post the error and ENT
7238 is the node to use for the "&" substitution. */
7241 post_error_ne (const char *msg
, Node_Id node
, Entity_Id ent
)
7243 String_Template temp
;
7246 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7247 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7249 Error_Msg_NE (fp
, node
, ent
);
7252 /* Similar, but NODE is the node at which to post the error, ENT is the node
7253 to use for the "&" substitution, and N is the number to use for the ^. */
7256 post_error_ne_num (const char *msg
, Node_Id node
, Entity_Id ent
, int n
)
7258 String_Template temp
;
7261 temp
.Low_Bound
= 1, temp
.High_Bound
= strlen (msg
);
7262 fp
.Array
= msg
, fp
.Bounds
= &temp
;
7263 Error_Msg_Uint_1
= UI_From_Int (n
);
7266 Error_Msg_NE (fp
, node
, ent
);
7269 /* Similar to post_error_ne_num, but T is a GCC tree representing the
7270 number to write. If the tree represents a constant that fits within
7271 a host integer, the text inside curly brackets in MSG will be output
7272 (presumably including a '^'). Otherwise that text will not be output
7273 and the text inside square brackets will be output instead. */
7276 post_error_ne_tree (const char *msg
, Node_Id node
, Entity_Id ent
, tree t
)
7278 char *newmsg
= XALLOCAVEC (char, strlen (msg
) + 1);
7279 String_Template temp
= {1, 0};
7281 char start_yes
, end_yes
, start_no
, end_no
;
7285 fp
.Array
= newmsg
, fp
.Bounds
= &temp
;
7287 if (host_integerp (t
, 1)
7288 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
7291 (t
, (((unsigned HOST_WIDE_INT
) 1 << (HOST_BITS_PER_INT
- 1)) - 1)) < 0
7295 Error_Msg_Uint_1
= UI_From_Int (tree_low_cst (t
, 1));
7296 start_yes
= '{', end_yes
= '}', start_no
= '[', end_no
= ']';
7299 start_yes
= '[', end_yes
= ']', start_no
= '{', end_no
= '}';
7301 for (p
= msg
, q
= newmsg
; *p
; p
++)
7303 if (*p
== start_yes
)
7304 for (p
++; *p
!= end_yes
; p
++)
7306 else if (*p
== start_no
)
7307 for (p
++; *p
!= end_no
; p
++)
7315 temp
.High_Bound
= strlen (newmsg
);
7317 Error_Msg_NE (fp
, node
, ent
);
7320 /* Similar to post_error_ne_tree, except that NUM is a second
7321 integer to write in the message. */
7324 post_error_ne_tree_2 (const char *msg
,
7330 Error_Msg_Uint_2
= UI_From_Int (num
);
7331 post_error_ne_tree (msg
, node
, ent
, t
);
7334 /* Initialize the table that maps GNAT codes to GCC codes for simple
7335 binary and unary operations. */
7338 init_code_table (void)
7340 gnu_codes
[N_And_Then
] = TRUTH_ANDIF_EXPR
;
7341 gnu_codes
[N_Or_Else
] = TRUTH_ORIF_EXPR
;
7343 gnu_codes
[N_Op_And
] = TRUTH_AND_EXPR
;
7344 gnu_codes
[N_Op_Or
] = TRUTH_OR_EXPR
;
7345 gnu_codes
[N_Op_Xor
] = TRUTH_XOR_EXPR
;
7346 gnu_codes
[N_Op_Eq
] = EQ_EXPR
;
7347 gnu_codes
[N_Op_Ne
] = NE_EXPR
;
7348 gnu_codes
[N_Op_Lt
] = LT_EXPR
;
7349 gnu_codes
[N_Op_Le
] = LE_EXPR
;
7350 gnu_codes
[N_Op_Gt
] = GT_EXPR
;
7351 gnu_codes
[N_Op_Ge
] = GE_EXPR
;
7352 gnu_codes
[N_Op_Add
] = PLUS_EXPR
;
7353 gnu_codes
[N_Op_Subtract
] = MINUS_EXPR
;
7354 gnu_codes
[N_Op_Multiply
] = MULT_EXPR
;
7355 gnu_codes
[N_Op_Mod
] = FLOOR_MOD_EXPR
;
7356 gnu_codes
[N_Op_Rem
] = TRUNC_MOD_EXPR
;
7357 gnu_codes
[N_Op_Minus
] = NEGATE_EXPR
;
7358 gnu_codes
[N_Op_Abs
] = ABS_EXPR
;
7359 gnu_codes
[N_Op_Not
] = TRUTH_NOT_EXPR
;
7360 gnu_codes
[N_Op_Rotate_Left
] = LROTATE_EXPR
;
7361 gnu_codes
[N_Op_Rotate_Right
] = RROTATE_EXPR
;
7362 gnu_codes
[N_Op_Shift_Left
] = LSHIFT_EXPR
;
7363 gnu_codes
[N_Op_Shift_Right
] = RSHIFT_EXPR
;
7364 gnu_codes
[N_Op_Shift_Right_Arithmetic
] = RSHIFT_EXPR
;
7367 /* Return a label to branch to for the exception type in KIND or NULL_TREE
7371 get_exception_label (char kind
)
7373 if (kind
== N_Raise_Constraint_Error
)
7374 return TREE_VALUE (gnu_constraint_error_label_stack
);
7375 else if (kind
== N_Raise_Storage_Error
)
7376 return TREE_VALUE (gnu_storage_error_label_stack
);
7377 else if (kind
== N_Raise_Program_Error
)
7378 return TREE_VALUE (gnu_program_error_label_stack
);
7383 #include "gt-ada-trans.h"