]>
Commit | Line | Data |
---|---|---|
a1ab4c31 AC |
1 | /**************************************************************************** |
2 | * * | |
3 | * GNAT COMPILER COMPONENTS * | |
4 | * * | |
5 | * T R A N S * | |
6 | * * | |
7 | * C Implementation File * | |
8 | * * | |
d47d0a8d | 9 | * Copyright (C) 1992-2010, Free Software Foundation, Inc. * |
a1ab4c31 AC |
10 | * * |
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- * | |
748086b7 | 13 | * ware Foundation; either version 3, or (at your option) any later ver- * |
a1ab4c31 AC |
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 * | |
748086b7 JJ |
18 | * Public License distributed with GNAT; see file COPYING3. If not see * |
19 | * <http://www.gnu.org/licenses/>. * | |
a1ab4c31 AC |
20 | * * |
21 | * GNAT was originally developed by the GNAT team at New York University. * | |
22 | * Extensive contributions were provided by Ada Core Technologies Inc. * | |
23 | * * | |
24 | ****************************************************************************/ | |
25 | ||
26 | #include "config.h" | |
27 | #include "system.h" | |
28 | #include "coretypes.h" | |
29 | #include "tm.h" | |
30 | #include "tree.h" | |
a1ab4c31 | 31 | #include "flags.h" |
a1ab4c31 AC |
32 | #include "expr.h" |
33 | #include "ggc.h" | |
a1ab4c31 AC |
34 | #include "output.h" |
35 | #include "tree-iterator.h" | |
36 | #include "gimple.h" | |
8713b7e4 | 37 | |
a1ab4c31 | 38 | #include "ada.h" |
8713b7e4 | 39 | #include "adadecode.h" |
a1ab4c31 AC |
40 | #include "types.h" |
41 | #include "atree.h" | |
42 | #include "elists.h" | |
43 | #include "namet.h" | |
44 | #include "nlists.h" | |
45 | #include "snames.h" | |
46 | #include "stringt.h" | |
47 | #include "uintp.h" | |
48 | #include "urealp.h" | |
49 | #include "fe.h" | |
50 | #include "sinfo.h" | |
51 | #include "einfo.h" | |
831f44c6 | 52 | #include "gadaint.h" |
a1ab4c31 AC |
53 | #include "ada-tree.h" |
54 | #include "gigi.h" | |
a1ab4c31 AC |
55 | |
56 | /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca, | |
57 | for fear of running out of stack space. If we need more, we use xmalloc | |
58 | instead. */ | |
59 | #define ALLOCA_THRESHOLD 1000 | |
60 | ||
61 | /* Let code below know whether we are targetting VMS without need of | |
62 | intrusive preprocessor directives. */ | |
63 | #ifndef TARGET_ABI_OPEN_VMS | |
64 | #define TARGET_ABI_OPEN_VMS 0 | |
65 | #endif | |
66 | ||
6eca32ba | 67 | /* For efficient float-to-int rounding, it is necessary to know whether |
1e17ef87 EB |
68 | floating-point arithmetic may use wider intermediate results. When |
69 | FP_ARITH_MAY_WIDEN is not defined, be conservative and only assume | |
70 | that arithmetic does not widen if double precision is emulated. */ | |
6eca32ba GB |
71 | #ifndef FP_ARITH_MAY_WIDEN |
72 | #if defined(HAVE_extendsfdf2) | |
73 | #define FP_ARITH_MAY_WIDEN HAVE_extendsfdf2 | |
74 | #else | |
75 | #define FP_ARITH_MAY_WIDEN 0 | |
76 | #endif | |
77 | #endif | |
78 | ||
831f44c6 | 79 | /* Pointers to front-end tables accessed through macros. */ |
a1ab4c31 AC |
80 | struct Node *Nodes_Ptr; |
81 | Node_Id *Next_Node_Ptr; | |
82 | Node_Id *Prev_Node_Ptr; | |
83 | struct Elist_Header *Elists_Ptr; | |
84 | struct Elmt_Item *Elmts_Ptr; | |
85 | struct String_Entry *Strings_Ptr; | |
86 | Char_Code *String_Chars_Ptr; | |
87 | struct List_Header *List_Headers_Ptr; | |
88 | ||
831f44c6 EB |
89 | /* Highest number in the front-end node table. */ |
90 | int max_gnat_nodes; | |
91 | ||
92 | /* Current node being treated, in case abort called. */ | |
93 | Node_Id error_gnat_node; | |
a1ab4c31 | 94 | |
1e17ef87 | 95 | /* True when gigi is being called on an analyzed but unexpanded |
a1ab4c31 | 96 | tree, and the only purpose of the call is to properly annotate |
1e17ef87 | 97 | types with representation information. */ |
a1ab4c31 AC |
98 | bool type_annotate_only; |
99 | ||
831f44c6 EB |
100 | /* Current filename without path. */ |
101 | const char *ref_filename; | |
102 | ||
a1ab4c31 AC |
103 | /* When not optimizing, we cache the 'First, 'Last and 'Length attributes |
104 | of unconstrained array IN parameters to avoid emitting a great deal of | |
105 | redundant instructions to recompute them each time. */ | |
6bf68a93 | 106 | struct GTY (()) parm_attr_d { |
a1ab4c31 AC |
107 | int id; /* GTY doesn't like Entity_Id. */ |
108 | int dim; | |
109 | tree first; | |
110 | tree last; | |
111 | tree length; | |
112 | }; | |
113 | ||
6bf68a93 | 114 | typedef struct parm_attr_d *parm_attr; |
a1ab4c31 AC |
115 | |
116 | DEF_VEC_P(parm_attr); | |
117 | DEF_VEC_ALLOC_P(parm_attr,gc); | |
118 | ||
d1b38208 | 119 | struct GTY(()) language_function { |
a1ab4c31 AC |
120 | VEC(parm_attr,gc) *parm_attr_cache; |
121 | }; | |
122 | ||
123 | #define f_parm_attr_cache \ | |
124 | DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache | |
125 | ||
126 | /* A structure used to gather together information about a statement group. | |
127 | We use this to gather related statements, for example the "then" part | |
128 | of a IF. In the case where it represents a lexical scope, we may also | |
129 | have a BLOCK node corresponding to it and/or cleanups. */ | |
130 | ||
d1b38208 | 131 | struct GTY((chain_next ("%h.previous"))) stmt_group { |
a1ab4c31 | 132 | struct stmt_group *previous; /* Previous code group. */ |
1e17ef87 EB |
133 | tree stmt_list; /* List of statements for this code group. */ |
134 | tree block; /* BLOCK for this code group, if any. */ | |
a1ab4c31 AC |
135 | tree cleanups; /* Cleanups for this code group, if any. */ |
136 | }; | |
137 | ||
138 | static GTY(()) struct stmt_group *current_stmt_group; | |
139 | ||
140 | /* List of unused struct stmt_group nodes. */ | |
141 | static GTY((deletable)) struct stmt_group *stmt_group_free_list; | |
142 | ||
143 | /* A structure used to record information on elaboration procedures | |
144 | we've made and need to process. | |
145 | ||
146 | ??? gnat_node should be Node_Id, but gengtype gets confused. */ | |
147 | ||
d1b38208 | 148 | struct GTY((chain_next ("%h.next"))) elab_info { |
1e17ef87 | 149 | struct elab_info *next; /* Pointer to next in chain. */ |
a1ab4c31 AC |
150 | tree elab_proc; /* Elaboration procedure. */ |
151 | int gnat_node; /* The N_Compilation_Unit. */ | |
152 | }; | |
153 | ||
154 | static GTY(()) struct elab_info *elab_info_list; | |
155 | ||
156 | /* Free list of TREE_LIST nodes used for stacks. */ | |
157 | static GTY((deletable)) tree gnu_stack_free_list; | |
158 | ||
159 | /* List of TREE_LIST nodes representing a stack of exception pointer | |
160 | variables. TREE_VALUE is the VAR_DECL that stores the address of | |
161 | the raised exception. Nonzero means we are in an exception | |
162 | handler. Not used in the zero-cost case. */ | |
163 | static GTY(()) tree gnu_except_ptr_stack; | |
164 | ||
165 | /* List of TREE_LIST nodes used to store the current elaboration procedure | |
166 | decl. TREE_VALUE is the decl. */ | |
167 | static GTY(()) tree gnu_elab_proc_stack; | |
168 | ||
169 | /* Variable that stores a list of labels to be used as a goto target instead of | |
170 | a return in some functions. See processing for N_Subprogram_Body. */ | |
171 | static GTY(()) tree gnu_return_label_stack; | |
172 | ||
173 | /* List of TREE_LIST nodes representing a stack of LOOP_STMT nodes. | |
174 | TREE_VALUE of each entry is the label of the corresponding LOOP_STMT. */ | |
175 | static GTY(()) tree gnu_loop_label_stack; | |
176 | ||
177 | /* List of TREE_LIST nodes representing labels for switch statements. | |
178 | TREE_VALUE of each entry is the label at the end of the switch. */ | |
179 | static GTY(()) tree gnu_switch_label_stack; | |
180 | ||
181 | /* List of TREE_LIST nodes containing the stacks for N_{Push,Pop}_*_Label. */ | |
182 | static GTY(()) tree gnu_constraint_error_label_stack; | |
183 | static GTY(()) tree gnu_storage_error_label_stack; | |
184 | static GTY(()) tree gnu_program_error_label_stack; | |
185 | ||
186 | /* Map GNAT tree codes to GCC tree codes for simple expressions. */ | |
187 | static enum tree_code gnu_codes[Number_Node_Kinds]; | |
188 | ||
a1ab4c31 AC |
189 | static void init_code_table (void); |
190 | static void Compilation_Unit_to_gnu (Node_Id); | |
191 | static void record_code_position (Node_Id); | |
192 | static void insert_code_for (Node_Id); | |
193 | static void add_cleanup (tree, Node_Id); | |
194 | static tree unshare_save_expr (tree *, int *, void *); | |
195 | static void add_stmt_list (List_Id); | |
196 | static void push_exception_label_stack (tree *, Entity_Id); | |
197 | static tree build_stmt_group (List_Id, bool); | |
198 | static void push_stack (tree *, tree, tree); | |
199 | static void pop_stack (tree *); | |
200 | static enum gimplify_status gnat_gimplify_stmt (tree *); | |
201 | static void elaborate_all_entities (Node_Id); | |
202 | static void process_freeze_entity (Node_Id); | |
203 | static void process_inlined_subprograms (Node_Id); | |
204 | static void process_decls (List_Id, List_Id, Node_Id, bool, bool); | |
10069d53 EB |
205 | static tree emit_range_check (tree, Node_Id, Node_Id); |
206 | static tree emit_index_check (tree, tree, tree, tree, Node_Id); | |
207 | static tree emit_check (tree, tree, int, Node_Id); | |
208 | static tree build_unary_op_trapv (enum tree_code, tree, tree, Node_Id); | |
209 | static tree build_binary_op_trapv (enum tree_code, tree, tree, tree, Node_Id); | |
210 | static tree convert_with_check (Entity_Id, tree, bool, bool, bool, Node_Id); | |
a1ab4c31 AC |
211 | static bool smaller_packable_type_p (tree, tree); |
212 | static bool addressable_p (tree, tree); | |
213 | static tree assoc_to_constructor (Entity_Id, Node_Id, tree); | |
214 | static tree extract_values (tree, tree); | |
215 | static tree pos_to_constructor (Node_Id, tree, Entity_Id); | |
216 | static tree maybe_implicit_deref (tree); | |
a1ab4c31 | 217 | static void set_expr_location_from_node (tree, Node_Id); |
cb3d597d | 218 | static int lvalue_required_p (Node_Id, tree, bool, bool, bool); |
a1ab4c31 AC |
219 | |
220 | /* Hooks for debug info back-ends, only supported and used in a restricted set | |
221 | of configurations. */ | |
222 | static const char *extract_encoding (const char *) ATTRIBUTE_UNUSED; | |
223 | static const char *decode_name (const char *) ATTRIBUTE_UNUSED; | |
224 | \f | |
225 | /* This is the main program of the back-end. It sets up all the table | |
226 | structures and then generates code. */ | |
227 | ||
228 | void | |
831f44c6 | 229 | gigi (Node_Id gnat_root, int max_gnat_node, int number_name ATTRIBUTE_UNUSED, |
a1ab4c31 AC |
230 | struct Node *nodes_ptr, Node_Id *next_node_ptr, Node_Id *prev_node_ptr, |
231 | struct Elist_Header *elists_ptr, struct Elmt_Item *elmts_ptr, | |
232 | struct String_Entry *strings_ptr, Char_Code *string_chars_ptr, | |
233 | struct List_Header *list_headers_ptr, Nat number_file, | |
01ddebf2 | 234 | struct File_Info_Type *file_info_ptr, Entity_Id standard_boolean, |
a1ab4c31 AC |
235 | Entity_Id standard_integer, Entity_Id standard_long_long_float, |
236 | Entity_Id standard_exception_type, Int gigi_operating_mode) | |
237 | { | |
01ddebf2 | 238 | Entity_Id gnat_literal; |
10069d53 EB |
239 | tree long_long_float_type, exception_type, t; |
240 | tree int64_type = gnat_type_for_size (64, 0); | |
a1ab4c31 AC |
241 | struct elab_info *info; |
242 | int i; | |
243 | ||
244 | max_gnat_nodes = max_gnat_node; | |
831f44c6 | 245 | |
a1ab4c31 AC |
246 | Nodes_Ptr = nodes_ptr; |
247 | Next_Node_Ptr = next_node_ptr; | |
248 | Prev_Node_Ptr = prev_node_ptr; | |
249 | Elists_Ptr = elists_ptr; | |
250 | Elmts_Ptr = elmts_ptr; | |
251 | Strings_Ptr = strings_ptr; | |
252 | String_Chars_Ptr = string_chars_ptr; | |
253 | List_Headers_Ptr = list_headers_ptr; | |
254 | ||
255 | type_annotate_only = (gigi_operating_mode == 1); | |
256 | ||
ecc3905a EB |
257 | gcc_assert (Nkind (gnat_root) == N_Compilation_Unit); |
258 | ||
259 | /* Declare the name of the compilation unit as the first global | |
260 | name in order to make the middle-end fully deterministic. */ | |
261 | t = create_concat_name (Defining_Entity (Unit (gnat_root)), NULL); | |
262 | first_global_object_name = ggc_strdup (IDENTIFIER_POINTER (t)); | |
263 | ||
831f44c6 | 264 | for (i = 0; i < number_file; i++) |
a1ab4c31 AC |
265 | { |
266 | /* Use the identifier table to make a permanent copy of the filename as | |
267 | the name table gets reallocated after Gigi returns but before all the | |
268 | debugging information is output. The __gnat_to_canonical_file_spec | |
269 | call translates filenames from pragmas Source_Reference that contain | |
1e17ef87 | 270 | host style syntax not understood by gdb. */ |
a1ab4c31 AC |
271 | const char *filename |
272 | = IDENTIFIER_POINTER | |
273 | (get_identifier | |
274 | (__gnat_to_canonical_file_spec | |
275 | (Get_Name_String (file_info_ptr[i].File_Name)))); | |
276 | ||
277 | /* We rely on the order isomorphism between files and line maps. */ | |
278 | gcc_assert ((int) line_table->used == i); | |
279 | ||
280 | /* We create the line map for a source file at once, with a fixed number | |
281 | of columns chosen to avoid jumping over the next power of 2. */ | |
282 | linemap_add (line_table, LC_ENTER, 0, filename, 1); | |
283 | linemap_line_start (line_table, file_info_ptr[i].Num_Source_Lines, 252); | |
284 | linemap_position_for_column (line_table, 252 - 1); | |
285 | linemap_add (line_table, LC_LEAVE, 0, NULL, 0); | |
286 | } | |
287 | ||
288 | /* Initialize ourselves. */ | |
289 | init_code_table (); | |
290 | init_gnat_to_gnu (); | |
a1ab4c31 AC |
291 | init_dummy_type (); |
292 | ||
293 | /* If we are just annotating types, give VOID_TYPE zero sizes to avoid | |
294 | errors. */ | |
295 | if (type_annotate_only) | |
296 | { | |
297 | TYPE_SIZE (void_type_node) = bitsize_zero_node; | |
298 | TYPE_SIZE_UNIT (void_type_node) = size_zero_node; | |
299 | } | |
300 | ||
301 | /* If the GNU type extensions to DWARF are available, setup the hooks. */ | |
302 | #if defined (DWARF2_DEBUGGING_INFO) && defined (DWARF2_GNU_TYPE_EXTENSIONS) | |
303 | /* We condition the name demangling and the generation of type encoding | |
304 | strings on -gdwarf+ and always set descriptive types on. */ | |
305 | if (use_gnu_debug_info_extensions) | |
306 | { | |
307 | dwarf2out_set_type_encoding_func (extract_encoding); | |
308 | dwarf2out_set_demangle_name_func (decode_name); | |
309 | } | |
310 | dwarf2out_set_descriptive_type_func (get_parallel_type); | |
311 | #endif | |
312 | ||
313 | /* Enable GNAT stack checking method if needed */ | |
314 | if (!Stack_Check_Probes_On_Target) | |
315 | set_stack_check_libfunc (gen_rtx_SYMBOL_REF (Pmode, "_gnat_stack_check")); | |
316 | ||
caa9d12a EB |
317 | /* Retrieve alignment settings. */ |
318 | double_float_alignment = get_target_double_float_alignment (); | |
319 | double_scalar_alignment = get_target_double_scalar_alignment (); | |
320 | ||
10069d53 EB |
321 | /* Record the builtin types. Define `integer' and `unsigned char' first so |
322 | that dbx will output them first. */ | |
323 | record_builtin_type ("integer", integer_type_node); | |
324 | record_builtin_type ("unsigned char", char_type_node); | |
325 | record_builtin_type ("long integer", long_integer_type_node); | |
326 | unsigned_type_node = gnat_type_for_size (INT_TYPE_SIZE, 1); | |
327 | record_builtin_type ("unsigned int", unsigned_type_node); | |
328 | record_builtin_type (SIZE_TYPE, sizetype); | |
329 | record_builtin_type ("boolean", boolean_type_node); | |
330 | record_builtin_type ("void", void_type_node); | |
331 | ||
332 | /* Save the type we made for integer as the type for Standard.Integer. */ | |
333 | save_gnu_tree (Base_Type (standard_integer), TYPE_NAME (integer_type_node), | |
334 | false); | |
a1ab4c31 | 335 | |
01ddebf2 EB |
336 | /* Save the type we made for boolean as the type for Standard.Boolean. */ |
337 | save_gnu_tree (Base_Type (standard_boolean), TYPE_NAME (boolean_type_node), | |
338 | false); | |
339 | gnat_literal = First_Literal (Base_Type (standard_boolean)); | |
340 | t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node); | |
341 | gcc_assert (t == boolean_false_node); | |
342 | t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE, | |
343 | boolean_type_node, t, true, false, false, false, | |
344 | NULL, gnat_literal); | |
345 | DECL_IGNORED_P (t) = 1; | |
346 | save_gnu_tree (gnat_literal, t, false); | |
347 | gnat_literal = Next_Literal (gnat_literal); | |
348 | t = UI_To_gnu (Enumeration_Rep (gnat_literal), boolean_type_node); | |
349 | gcc_assert (t == boolean_true_node); | |
350 | t = create_var_decl (get_entity_name (gnat_literal), NULL_TREE, | |
351 | boolean_type_node, t, true, false, false, false, | |
352 | NULL, gnat_literal); | |
353 | DECL_IGNORED_P (t) = 1; | |
354 | save_gnu_tree (gnat_literal, t, false); | |
355 | ||
10069d53 EB |
356 | void_ftype = build_function_type (void_type_node, NULL_TREE); |
357 | ptr_void_ftype = build_pointer_type (void_ftype); | |
358 | ||
359 | /* Now declare runtime functions. */ | |
360 | t = tree_cons (NULL_TREE, void_type_node, NULL_TREE); | |
361 | ||
362 | /* malloc is a function declaration tree for a function to allocate | |
363 | memory. */ | |
364 | malloc_decl | |
365 | = create_subprog_decl (get_identifier ("__gnat_malloc"), NULL_TREE, | |
366 | build_function_type (ptr_void_type_node, | |
367 | tree_cons (NULL_TREE, | |
368 | sizetype, t)), | |
369 | NULL_TREE, false, true, true, NULL, Empty); | |
370 | DECL_IS_MALLOC (malloc_decl) = 1; | |
371 | ||
372 | /* malloc32 is a function declaration tree for a function to allocate | |
373 | 32-bit memory on a 64-bit system. Needed only on 64-bit VMS. */ | |
374 | malloc32_decl | |
375 | = create_subprog_decl (get_identifier ("__gnat_malloc32"), NULL_TREE, | |
376 | build_function_type (ptr_void_type_node, | |
377 | tree_cons (NULL_TREE, | |
378 | sizetype, t)), | |
379 | NULL_TREE, false, true, true, NULL, Empty); | |
380 | DECL_IS_MALLOC (malloc32_decl) = 1; | |
381 | ||
382 | /* free is a function declaration tree for a function to free memory. */ | |
383 | free_decl | |
384 | = create_subprog_decl (get_identifier ("__gnat_free"), NULL_TREE, | |
385 | build_function_type (void_type_node, | |
386 | tree_cons (NULL_TREE, | |
387 | ptr_void_type_node, | |
388 | t)), | |
389 | NULL_TREE, false, true, true, NULL, Empty); | |
390 | ||
391 | /* This is used for 64-bit multiplication with overflow checking. */ | |
392 | mulv64_decl | |
393 | = create_subprog_decl (get_identifier ("__gnat_mulv64"), NULL_TREE, | |
394 | build_function_type_list (int64_type, int64_type, | |
395 | int64_type, NULL_TREE), | |
396 | NULL_TREE, false, true, true, NULL, Empty); | |
397 | ||
76af763d EB |
398 | /* Name of the _Parent field in tagged record types. */ |
399 | parent_name_id = get_identifier (Get_Name_String (Name_uParent)); | |
400 | ||
10069d53 EB |
401 | /* Make the types and functions used for exception processing. */ |
402 | jmpbuf_type | |
403 | = build_array_type (gnat_type_for_mode (Pmode, 0), | |
26383c64 | 404 | build_index_type (size_int (5))); |
10069d53 EB |
405 | record_builtin_type ("JMPBUF_T", jmpbuf_type); |
406 | jmpbuf_ptr_type = build_pointer_type (jmpbuf_type); | |
407 | ||
408 | /* Functions to get and set the jumpbuf pointer for the current thread. */ | |
409 | get_jmpbuf_decl | |
410 | = create_subprog_decl | |
411 | (get_identifier ("system__soft_links__get_jmpbuf_address_soft"), | |
412 | NULL_TREE, build_function_type (jmpbuf_ptr_type, NULL_TREE), | |
413 | NULL_TREE, false, true, true, NULL, Empty); | |
414 | /* Avoid creating superfluous edges to __builtin_setjmp receivers. */ | |
415 | DECL_PURE_P (get_jmpbuf_decl) = 1; | |
416 | ||
417 | set_jmpbuf_decl | |
418 | = create_subprog_decl | |
419 | (get_identifier ("system__soft_links__set_jmpbuf_address_soft"), | |
420 | NULL_TREE, | |
421 | build_function_type (void_type_node, | |
422 | tree_cons (NULL_TREE, jmpbuf_ptr_type, t)), | |
423 | NULL_TREE, false, true, true, NULL, Empty); | |
424 | ||
425 | /* setjmp returns an integer and has one operand, which is a pointer to | |
426 | a jmpbuf. */ | |
427 | setjmp_decl | |
428 | = create_subprog_decl | |
429 | (get_identifier ("__builtin_setjmp"), NULL_TREE, | |
430 | build_function_type (integer_type_node, | |
431 | tree_cons (NULL_TREE, jmpbuf_ptr_type, t)), | |
432 | NULL_TREE, false, true, true, NULL, Empty); | |
433 | ||
434 | DECL_BUILT_IN_CLASS (setjmp_decl) = BUILT_IN_NORMAL; | |
435 | DECL_FUNCTION_CODE (setjmp_decl) = BUILT_IN_SETJMP; | |
436 | ||
437 | /* update_setjmp_buf updates a setjmp buffer from the current stack pointer | |
438 | address. */ | |
439 | update_setjmp_buf_decl | |
440 | = create_subprog_decl | |
441 | (get_identifier ("__builtin_update_setjmp_buf"), NULL_TREE, | |
442 | build_function_type (void_type_node, | |
443 | tree_cons (NULL_TREE, jmpbuf_ptr_type, t)), | |
444 | NULL_TREE, false, true, true, NULL, Empty); | |
445 | ||
446 | DECL_BUILT_IN_CLASS (update_setjmp_buf_decl) = BUILT_IN_NORMAL; | |
447 | DECL_FUNCTION_CODE (update_setjmp_buf_decl) = BUILT_IN_UPDATE_SETJMP_BUF; | |
448 | ||
449 | /* Hooks to call when entering/leaving an exception handler. */ | |
450 | begin_handler_decl | |
451 | = create_subprog_decl (get_identifier ("__gnat_begin_handler"), NULL_TREE, | |
452 | build_function_type (void_type_node, | |
453 | tree_cons (NULL_TREE, | |
454 | ptr_void_type_node, | |
455 | t)), | |
456 | NULL_TREE, false, true, true, NULL, Empty); | |
457 | ||
458 | end_handler_decl | |
459 | = create_subprog_decl (get_identifier ("__gnat_end_handler"), NULL_TREE, | |
460 | build_function_type (void_type_node, | |
461 | tree_cons (NULL_TREE, | |
462 | ptr_void_type_node, | |
463 | t)), | |
464 | NULL_TREE, false, true, true, NULL, Empty); | |
465 | ||
466 | /* If in no exception handlers mode, all raise statements are redirected to | |
467 | __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since | |
468 | this procedure will never be called in this mode. */ | |
469 | if (No_Exception_Handlers_Set ()) | |
470 | { | |
471 | tree decl | |
472 | = create_subprog_decl | |
473 | (get_identifier ("__gnat_last_chance_handler"), NULL_TREE, | |
474 | build_function_type (void_type_node, | |
475 | tree_cons (NULL_TREE, | |
476 | build_pointer_type (char_type_node), | |
477 | tree_cons (NULL_TREE, | |
478 | integer_type_node, | |
479 | t))), | |
480 | NULL_TREE, false, true, true, NULL, Empty); | |
481 | ||
482 | for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++) | |
483 | gnat_raise_decls[i] = decl; | |
484 | } | |
485 | else | |
486 | /* Otherwise, make one decl for each exception reason. */ | |
487 | for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++) | |
488 | { | |
489 | char name[17]; | |
490 | ||
491 | sprintf (name, "__gnat_rcheck_%.2d", i); | |
492 | gnat_raise_decls[i] | |
493 | = create_subprog_decl | |
494 | (get_identifier (name), NULL_TREE, | |
495 | build_function_type (void_type_node, | |
496 | tree_cons (NULL_TREE, | |
497 | build_pointer_type | |
498 | (char_type_node), | |
499 | tree_cons (NULL_TREE, | |
500 | integer_type_node, | |
501 | t))), | |
502 | NULL_TREE, false, true, true, NULL, Empty); | |
503 | } | |
504 | ||
505 | for (i = 0; i < (int) ARRAY_SIZE (gnat_raise_decls); i++) | |
506 | { | |
507 | TREE_THIS_VOLATILE (gnat_raise_decls[i]) = 1; | |
508 | TREE_SIDE_EFFECTS (gnat_raise_decls[i]) = 1; | |
509 | TREE_TYPE (gnat_raise_decls[i]) | |
510 | = build_qualified_type (TREE_TYPE (gnat_raise_decls[i]), | |
511 | TYPE_QUAL_VOLATILE); | |
512 | } | |
513 | ||
514 | /* Set the types that GCC and Gigi use from the front end. We would | |
515 | like to do this for char_type_node, but it needs to correspond to | |
516 | the C char type. */ | |
517 | exception_type | |
518 | = gnat_to_gnu_entity (Base_Type (standard_exception_type), NULL_TREE, 0); | |
519 | except_type_node = TREE_TYPE (exception_type); | |
520 | ||
521 | /* Make other functions used for exception processing. */ | |
522 | get_excptr_decl | |
523 | = create_subprog_decl | |
524 | (get_identifier ("system__soft_links__get_gnat_exception"), | |
525 | NULL_TREE, | |
526 | build_function_type (build_pointer_type (except_type_node), NULL_TREE), | |
527 | NULL_TREE, false, true, true, NULL, Empty); | |
528 | /* Avoid creating superfluous edges to __builtin_setjmp receivers. */ | |
529 | DECL_PURE_P (get_excptr_decl) = 1; | |
530 | ||
531 | raise_nodefer_decl | |
532 | = create_subprog_decl | |
533 | (get_identifier ("__gnat_raise_nodefer_with_msg"), NULL_TREE, | |
534 | build_function_type (void_type_node, | |
535 | tree_cons (NULL_TREE, | |
536 | build_pointer_type (except_type_node), | |
537 | t)), | |
538 | NULL_TREE, false, true, true, NULL, Empty); | |
539 | ||
540 | /* Indicate that these never return. */ | |
541 | TREE_THIS_VOLATILE (raise_nodefer_decl) = 1; | |
542 | TREE_SIDE_EFFECTS (raise_nodefer_decl) = 1; | |
543 | TREE_TYPE (raise_nodefer_decl) | |
544 | = build_qualified_type (TREE_TYPE (raise_nodefer_decl), | |
545 | TYPE_QUAL_VOLATILE); | |
546 | ||
10069d53 EB |
547 | /* Build the special descriptor type and its null node if needed. */ |
548 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
549 | { | |
550 | tree null_node = fold_convert (ptr_void_ftype, null_pointer_node); | |
551 | tree field_list = NULL_TREE, null_list = NULL_TREE; | |
552 | int j; | |
553 | ||
554 | fdesc_type_node = make_node (RECORD_TYPE); | |
555 | ||
556 | for (j = 0; j < TARGET_VTABLE_USES_DESCRIPTORS; j++) | |
557 | { | |
558 | tree field = create_field_decl (NULL_TREE, ptr_void_ftype, | |
559 | fdesc_type_node, 0, 0, 0, 1); | |
560 | TREE_CHAIN (field) = field_list; | |
561 | field_list = field; | |
562 | null_list = tree_cons (field, null_node, null_list); | |
563 | } | |
564 | ||
032d1b71 | 565 | finish_record_type (fdesc_type_node, nreverse (field_list), 0, false); |
f7ebc6a8 | 566 | record_builtin_type ("descriptor", fdesc_type_node); |
10069d53 EB |
567 | null_fdesc_node = gnat_build_constructor (fdesc_type_node, null_list); |
568 | } | |
569 | ||
f7ebc6a8 EB |
570 | long_long_float_type |
571 | = gnat_to_gnu_entity (Base_Type (standard_long_long_float), NULL_TREE, 0); | |
572 | ||
573 | if (TREE_CODE (TREE_TYPE (long_long_float_type)) == INTEGER_TYPE) | |
574 | { | |
575 | /* In this case, the builtin floating point types are VAX float, | |
576 | so make up a type for use. */ | |
577 | longest_float_type_node = make_node (REAL_TYPE); | |
578 | TYPE_PRECISION (longest_float_type_node) = LONG_DOUBLE_TYPE_SIZE; | |
579 | layout_type (longest_float_type_node); | |
580 | record_builtin_type ("longest float type", longest_float_type_node); | |
581 | } | |
582 | else | |
583 | longest_float_type_node = TREE_TYPE (long_long_float_type); | |
584 | ||
10069d53 EB |
585 | /* Dummy objects to materialize "others" and "all others" in the exception |
586 | tables. These are exported by a-exexpr.adb, so see this unit for the | |
587 | types to use. */ | |
588 | others_decl | |
589 | = create_var_decl (get_identifier ("OTHERS"), | |
590 | get_identifier ("__gnat_others_value"), | |
591 | integer_type_node, 0, 1, 0, 1, 1, 0, Empty); | |
592 | ||
593 | all_others_decl | |
594 | = create_var_decl (get_identifier ("ALL_OTHERS"), | |
595 | get_identifier ("__gnat_all_others_value"), | |
596 | integer_type_node, 0, 1, 0, 1, 1, 0, Empty); | |
597 | ||
598 | main_identifier_node = get_identifier ("main"); | |
599 | ||
600 | /* Install the builtins we might need, either internally or as | |
601 | user available facilities for Intrinsic imports. */ | |
602 | gnat_install_builtins (); | |
a1ab4c31 AC |
603 | |
604 | gnu_except_ptr_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); | |
605 | gnu_constraint_error_label_stack | |
606 | = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); | |
607 | gnu_storage_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); | |
608 | gnu_program_error_label_stack = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); | |
609 | ||
a1ab4c31 AC |
610 | /* Process any Pragma Ident for the main unit. */ |
611 | #ifdef ASM_OUTPUT_IDENT | |
612 | if (Present (Ident_String (Main_Unit))) | |
613 | ASM_OUTPUT_IDENT | |
614 | (asm_out_file, | |
615 | TREE_STRING_POINTER (gnat_to_gnu (Ident_String (Main_Unit)))); | |
616 | #endif | |
617 | ||
618 | /* If we are using the GCC exception mechanism, let GCC know. */ | |
619 | if (Exception_Mechanism == Back_End_Exceptions) | |
620 | gnat_init_gcc_eh (); | |
621 | ||
6a7a3f31 | 622 | /* Now translate the compilation unit proper. */ |
a1ab4c31 AC |
623 | Compilation_Unit_to_gnu (gnat_root); |
624 | ||
6a7a3f31 | 625 | /* Finally see if we have any elaboration procedures to deal with. */ |
a1ab4c31 AC |
626 | for (info = elab_info_list; info; info = info->next) |
627 | { | |
2fa03086 | 628 | tree gnu_body = DECL_SAVED_TREE (info->elab_proc), gnu_stmts; |
a1ab4c31 AC |
629 | |
630 | /* Unshare SAVE_EXPRs between subprograms. These are not unshared by | |
631 | the gimplifier for obvious reasons, but it turns out that we need to | |
632 | unshare them for the global level because of SAVE_EXPRs made around | |
633 | checks for global objects and around allocators for global objects | |
634 | of variable size, in order to prevent node sharing in the underlying | |
635 | expression. Note that this implicitly assumes that the SAVE_EXPR | |
636 | nodes themselves are not shared between subprograms, which would be | |
637 | an upstream bug for which we would not change the outcome. */ | |
638 | walk_tree_without_duplicates (&gnu_body, unshare_save_expr, NULL); | |
639 | ||
2fa03086 EB |
640 | /* We should have a BIND_EXPR but it may not have any statements in it. |
641 | If it doesn't have any, we have nothing to do except for setting the | |
642 | flag on the GNAT node. Otherwise, process the function as others. */ | |
a406865a RG |
643 | gnu_stmts = gnu_body; |
644 | if (TREE_CODE (gnu_stmts) == BIND_EXPR) | |
645 | gnu_stmts = BIND_EXPR_BODY (gnu_stmts); | |
a406865a | 646 | if (!gnu_stmts || !STATEMENT_LIST_HEAD (gnu_stmts)) |
2fa03086 | 647 | Set_Has_No_Elaboration_Code (info->gnat_node, 1); |
a406865a RG |
648 | else |
649 | { | |
a406865a RG |
650 | begin_subprog_body (info->elab_proc); |
651 | end_subprog_body (gnu_body); | |
652 | } | |
a1ab4c31 AC |
653 | } |
654 | ||
655 | /* We cannot track the location of errors past this point. */ | |
656 | error_gnat_node = Empty; | |
657 | } | |
658 | \f | |
3cd64bab EB |
659 | /* Return a positive value if an lvalue is required for GNAT_NODE, which is |
660 | an N_Attribute_Reference. */ | |
661 | ||
662 | static int | |
663 | lvalue_required_for_attribute_p (Node_Id gnat_node) | |
664 | { | |
665 | switch (Get_Attribute_Id (Attribute_Name (gnat_node))) | |
666 | { | |
667 | case Attr_Pos: | |
668 | case Attr_Val: | |
669 | case Attr_Pred: | |
670 | case Attr_Succ: | |
671 | case Attr_First: | |
672 | case Attr_Last: | |
673 | case Attr_Range_Length: | |
674 | case Attr_Length: | |
675 | case Attr_Object_Size: | |
676 | case Attr_Value_Size: | |
677 | case Attr_Component_Size: | |
678 | case Attr_Max_Size_In_Storage_Elements: | |
679 | case Attr_Min: | |
680 | case Attr_Max: | |
681 | case Attr_Null_Parameter: | |
682 | case Attr_Passed_By_Reference: | |
683 | case Attr_Mechanism_Code: | |
684 | return 0; | |
685 | ||
686 | case Attr_Address: | |
687 | case Attr_Access: | |
688 | case Attr_Unchecked_Access: | |
689 | case Attr_Unrestricted_Access: | |
690 | case Attr_Code_Address: | |
691 | case Attr_Pool_Address: | |
692 | case Attr_Size: | |
693 | case Attr_Alignment: | |
694 | case Attr_Bit_Position: | |
695 | case Attr_Position: | |
696 | case Attr_First_Bit: | |
697 | case Attr_Last_Bit: | |
698 | case Attr_Bit: | |
699 | default: | |
700 | return 1; | |
701 | } | |
702 | } | |
703 | ||
22d12fc2 EB |
704 | /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE |
705 | is the type that will be used for GNAT_NODE in the translated GNU tree. | |
706 | CONSTANT indicates whether the underlying object represented by GNAT_NODE | |
cb3d597d EB |
707 | is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates |
708 | whether its value is the address of a constant and ALIASED whether it is | |
709 | aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored. | |
22d12fc2 EB |
710 | |
711 | The function climbs up the GNAT tree starting from the node and returns 1 | |
712 | upon encountering a node that effectively requires an lvalue downstream. | |
713 | It returns int instead of bool to facilitate usage in non-purely binary | |
714 | logic contexts. */ | |
a1ab4c31 AC |
715 | |
716 | static int | |
03b6f8a2 | 717 | lvalue_required_p (Node_Id gnat_node, tree gnu_type, bool constant, |
cb3d597d | 718 | bool address_of_constant, bool aliased) |
a1ab4c31 AC |
719 | { |
720 | Node_Id gnat_parent = Parent (gnat_node), gnat_temp; | |
721 | ||
722 | switch (Nkind (gnat_parent)) | |
723 | { | |
724 | case N_Reference: | |
725 | return 1; | |
726 | ||
727 | case N_Attribute_Reference: | |
3cd64bab | 728 | return lvalue_required_for_attribute_p (gnat_parent); |
a1ab4c31 AC |
729 | |
730 | case N_Parameter_Association: | |
731 | case N_Function_Call: | |
732 | case N_Procedure_Call_Statement: | |
733 | return (must_pass_by_ref (gnu_type) || default_pass_by_ref (gnu_type)); | |
734 | ||
735 | case N_Indexed_Component: | |
736 | /* Only the array expression can require an lvalue. */ | |
737 | if (Prefix (gnat_parent) != gnat_node) | |
738 | return 0; | |
739 | ||
740 | /* ??? Consider that referencing an indexed component with a | |
741 | non-constant index forces the whole aggregate to memory. | |
742 | Note that N_Integer_Literal is conservative, any static | |
743 | expression in the RM sense could probably be accepted. */ | |
744 | for (gnat_temp = First (Expressions (gnat_parent)); | |
745 | Present (gnat_temp); | |
746 | gnat_temp = Next (gnat_temp)) | |
747 | if (Nkind (gnat_temp) != N_Integer_Literal) | |
748 | return 1; | |
749 | ||
750 | /* ... fall through ... */ | |
751 | ||
752 | case N_Slice: | |
753 | /* Only the array expression can require an lvalue. */ | |
754 | if (Prefix (gnat_parent) != gnat_node) | |
755 | return 0; | |
756 | ||
757 | aliased |= Has_Aliased_Components (Etype (gnat_node)); | |
cb3d597d EB |
758 | return lvalue_required_p (gnat_parent, gnu_type, constant, |
759 | address_of_constant, aliased); | |
a1ab4c31 AC |
760 | |
761 | case N_Selected_Component: | |
762 | aliased |= Is_Aliased (Entity (Selector_Name (gnat_parent))); | |
cb3d597d EB |
763 | return lvalue_required_p (gnat_parent, gnu_type, constant, |
764 | address_of_constant, aliased); | |
a1ab4c31 AC |
765 | |
766 | case N_Object_Renaming_Declaration: | |
767 | /* We need to make a real renaming only if the constant object is | |
768 | aliased or if we may use a renaming pointer; otherwise we can | |
769 | optimize and return the rvalue. We make an exception if the object | |
770 | is an identifier since in this case the rvalue can be propagated | |
771 | attached to the CONST_DECL. */ | |
03b6f8a2 EB |
772 | return (!constant |
773 | || aliased | |
a1ab4c31 | 774 | /* This should match the constant case of the renaming code. */ |
d5859bf4 EB |
775 | || Is_Composite_Type |
776 | (Underlying_Type (Etype (Name (gnat_parent)))) | |
a1ab4c31 AC |
777 | || Nkind (Name (gnat_parent)) == N_Identifier); |
778 | ||
bbaba73f EB |
779 | case N_Object_Declaration: |
780 | /* We cannot use a constructor if this is an atomic object because | |
781 | the actual assignment might end up being done component-wise. */ | |
cb3d597d EB |
782 | return ((Is_Composite_Type (Underlying_Type (Etype (gnat_node))) |
783 | && Is_Atomic (Defining_Entity (gnat_parent))) | |
784 | /* We don't use a constructor if this is a class-wide object | |
785 | because the effective type of the object is the equivalent | |
786 | type of the class-wide subtype and it smashes most of the | |
787 | data into an array of bytes to which we cannot convert. */ | |
788 | || Ekind ((Etype (Defining_Entity (gnat_parent)))) | |
789 | == E_Class_Wide_Subtype); | |
bbaba73f EB |
790 | |
791 | case N_Assignment_Statement: | |
792 | /* We cannot use a constructor if the LHS is an atomic object because | |
793 | the actual assignment might end up being done component-wise. */ | |
03b6f8a2 EB |
794 | return (Name (gnat_parent) == gnat_node |
795 | || (Is_Composite_Type (Underlying_Type (Etype (gnat_node))) | |
796 | && Is_Atomic (Entity (Name (gnat_parent))))); | |
bbaba73f | 797 | |
76af763d EB |
798 | case N_Type_Conversion: |
799 | case N_Qualified_Expression: | |
800 | /* We must look through all conversions for composite types because we | |
801 | may need to bypass an intermediate conversion to a narrower record | |
802 | type that is generated for a formal conversion, e.g. the conversion | |
803 | to the root type of a hierarchy of tagged types generated for the | |
804 | formal conversion to the class-wide type. */ | |
805 | if (!Is_Composite_Type (Underlying_Type (Etype (gnat_node)))) | |
806 | return 0; | |
807 | ||
808 | /* ... fall through ... */ | |
809 | ||
22d12fc2 | 810 | case N_Unchecked_Type_Conversion: |
22d12fc2 EB |
811 | return lvalue_required_p (gnat_parent, |
812 | get_unpadded_type (Etype (gnat_parent)), | |
cb3d597d EB |
813 | constant, address_of_constant, aliased); |
814 | ||
76af763d EB |
815 | case N_Allocator: |
816 | /* We should only reach here through the N_Qualified_Expression case | |
817 | and, therefore, only for composite types. Force an lvalue since | |
818 | a block-copy to the newly allocated area of memory is made. */ | |
819 | return 1; | |
820 | ||
cb3d597d EB |
821 | case N_Explicit_Dereference: |
822 | /* We look through dereferences for address of constant because we need | |
823 | to handle the special cases listed above. */ | |
824 | if (constant && address_of_constant) | |
825 | return lvalue_required_p (gnat_parent, | |
826 | get_unpadded_type (Etype (gnat_parent)), | |
827 | true, false, true); | |
828 | ||
829 | /* ... fall through ... */ | |
22d12fc2 | 830 | |
a1ab4c31 AC |
831 | default: |
832 | return 0; | |
833 | } | |
834 | ||
835 | gcc_unreachable (); | |
836 | } | |
837 | ||
838 | /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier, | |
839 | to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer | |
840 | to where we should place the result type. */ | |
841 | ||
842 | static tree | |
843 | Identifier_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p) | |
844 | { | |
845 | Node_Id gnat_temp, gnat_temp_type; | |
846 | tree gnu_result, gnu_result_type; | |
847 | ||
848 | /* Whether we should require an lvalue for GNAT_NODE. Needed in | |
849 | specific circumstances only, so evaluated lazily. < 0 means | |
850 | unknown, > 0 means known true, 0 means known false. */ | |
851 | int require_lvalue = -1; | |
852 | ||
853 | /* If GNAT_NODE is a constant, whether we should use the initialization | |
854 | value instead of the constant entity, typically for scalars with an | |
855 | address clause when the parent doesn't require an lvalue. */ | |
856 | bool use_constant_initializer = false; | |
857 | ||
858 | /* If the Etype of this node does not equal the Etype of the Entity, | |
859 | something is wrong with the entity map, probably in generic | |
860 | instantiation. However, this does not apply to types. Since we sometime | |
861 | have strange Ekind's, just do this test for objects. Also, if the Etype of | |
862 | the Entity is private, the Etype of the N_Identifier is allowed to be the | |
863 | full type and also we consider a packed array type to be the same as the | |
864 | original type. Similarly, a class-wide type is equivalent to a subtype of | |
865 | itself. Finally, if the types are Itypes, one may be a copy of the other, | |
866 | which is also legal. */ | |
867 | gnat_temp = (Nkind (gnat_node) == N_Defining_Identifier | |
868 | ? gnat_node : Entity (gnat_node)); | |
869 | gnat_temp_type = Etype (gnat_temp); | |
870 | ||
871 | gcc_assert (Etype (gnat_node) == gnat_temp_type | |
872 | || (Is_Packed (gnat_temp_type) | |
873 | && Etype (gnat_node) == Packed_Array_Type (gnat_temp_type)) | |
874 | || (Is_Class_Wide_Type (Etype (gnat_node))) | |
875 | || (IN (Ekind (gnat_temp_type), Private_Kind) | |
876 | && Present (Full_View (gnat_temp_type)) | |
877 | && ((Etype (gnat_node) == Full_View (gnat_temp_type)) | |
878 | || (Is_Packed (Full_View (gnat_temp_type)) | |
879 | && (Etype (gnat_node) | |
880 | == Packed_Array_Type (Full_View | |
881 | (gnat_temp_type)))))) | |
882 | || (Is_Itype (Etype (gnat_node)) && Is_Itype (gnat_temp_type)) | |
883 | || !(Ekind (gnat_temp) == E_Variable | |
884 | || Ekind (gnat_temp) == E_Component | |
885 | || Ekind (gnat_temp) == E_Constant | |
886 | || Ekind (gnat_temp) == E_Loop_Parameter | |
887 | || IN (Ekind (gnat_temp), Formal_Kind))); | |
888 | ||
889 | /* If this is a reference to a deferred constant whose partial view is an | |
890 | unconstrained private type, the proper type is on the full view of the | |
891 | constant, not on the full view of the type, which may be unconstrained. | |
892 | ||
893 | This may be a reference to a type, for example in the prefix of the | |
894 | attribute Position, generated for dispatching code (see Make_DT in | |
895 | exp_disp,adb). In that case we need the type itself, not is parent, | |
896 | in particular if it is a derived type */ | |
897 | if (Is_Private_Type (gnat_temp_type) | |
898 | && Has_Unknown_Discriminants (gnat_temp_type) | |
899 | && Ekind (gnat_temp) == E_Constant | |
900 | && Present (Full_View (gnat_temp))) | |
901 | { | |
902 | gnat_temp = Full_View (gnat_temp); | |
903 | gnat_temp_type = Etype (gnat_temp); | |
904 | } | |
905 | else | |
906 | { | |
907 | /* We want to use the Actual_Subtype if it has already been elaborated, | |
908 | otherwise the Etype. Avoid using Actual_Subtype for packed arrays to | |
909 | simplify things. */ | |
910 | if ((Ekind (gnat_temp) == E_Constant | |
911 | || Ekind (gnat_temp) == E_Variable || Is_Formal (gnat_temp)) | |
912 | && !(Is_Array_Type (Etype (gnat_temp)) | |
913 | && Present (Packed_Array_Type (Etype (gnat_temp)))) | |
914 | && Present (Actual_Subtype (gnat_temp)) | |
915 | && present_gnu_tree (Actual_Subtype (gnat_temp))) | |
916 | gnat_temp_type = Actual_Subtype (gnat_temp); | |
917 | else | |
918 | gnat_temp_type = Etype (gnat_node); | |
919 | } | |
920 | ||
921 | /* Expand the type of this identifier first, in case it is an enumeral | |
922 | literal, which only get made when the type is expanded. There is no | |
923 | order-of-elaboration issue here. */ | |
924 | gnu_result_type = get_unpadded_type (gnat_temp_type); | |
925 | ||
926 | /* If this is a non-imported scalar constant with an address clause, | |
927 | retrieve the value instead of a pointer to be dereferenced unless | |
928 | an lvalue is required. This is generally more efficient and actually | |
929 | required if this is a static expression because it might be used | |
930 | in a context where a dereference is inappropriate, such as a case | |
931 | statement alternative or a record discriminant. There is no possible | |
1e17ef87 EB |
932 | volatile-ness short-circuit here since Volatile constants must bei |
933 | imported per C.6. */ | |
cb3d597d EB |
934 | if (Ekind (gnat_temp) == E_Constant |
935 | && Is_Scalar_Type (gnat_temp_type) | |
a1ab4c31 AC |
936 | && !Is_Imported (gnat_temp) |
937 | && Present (Address_Clause (gnat_temp))) | |
938 | { | |
03b6f8a2 | 939 | require_lvalue = lvalue_required_p (gnat_node, gnu_result_type, true, |
cb3d597d | 940 | false, Is_Aliased (gnat_temp)); |
a1ab4c31 AC |
941 | use_constant_initializer = !require_lvalue; |
942 | } | |
943 | ||
944 | if (use_constant_initializer) | |
945 | { | |
946 | /* If this is a deferred constant, the initializer is attached to | |
947 | the full view. */ | |
948 | if (Present (Full_View (gnat_temp))) | |
949 | gnat_temp = Full_View (gnat_temp); | |
950 | ||
951 | gnu_result = gnat_to_gnu (Expression (Declaration_Node (gnat_temp))); | |
952 | } | |
953 | else | |
954 | gnu_result = gnat_to_gnu_entity (gnat_temp, NULL_TREE, 0); | |
955 | ||
956 | /* If we are in an exception handler, force this variable into memory to | |
957 | ensure optimization does not remove stores that appear redundant but are | |
958 | actually needed in case an exception occurs. | |
959 | ||
960 | ??? Note that we need not do this if the variable is declared within the | |
961 | handler, only if it is referenced in the handler and declared in an | |
962 | enclosing block, but we have no way of testing that right now. | |
963 | ||
964 | ??? We used to essentially set the TREE_ADDRESSABLE flag on the variable | |
965 | here, but it can now be removed by the Tree aliasing machinery if the | |
966 | address of the variable is never taken. All we can do is to make the | |
967 | variable volatile, which might incur the generation of temporaries just | |
968 | to access the memory in some circumstances. This can be avoided for | |
969 | variables of non-constant size because they are automatically allocated | |
970 | to memory. There might be no way of allocating a proper temporary for | |
971 | them in any case. We only do this for SJLJ though. */ | |
972 | if (TREE_VALUE (gnu_except_ptr_stack) | |
973 | && TREE_CODE (gnu_result) == VAR_DECL | |
974 | && TREE_CODE (DECL_SIZE_UNIT (gnu_result)) == INTEGER_CST) | |
975 | TREE_THIS_VOLATILE (gnu_result) = TREE_SIDE_EFFECTS (gnu_result) = 1; | |
976 | ||
977 | /* Some objects (such as parameters passed by reference, globals of | |
978 | variable size, and renamed objects) actually represent the address | |
979 | of the object. In that case, we must do the dereference. Likewise, | |
980 | deal with parameters to foreign convention subprograms. */ | |
981 | if (DECL_P (gnu_result) | |
982 | && (DECL_BY_REF_P (gnu_result) | |
983 | || (TREE_CODE (gnu_result) == PARM_DECL | |
984 | && DECL_BY_COMPONENT_PTR_P (gnu_result)))) | |
985 | { | |
ced57283 | 986 | const bool read_only = DECL_POINTS_TO_READONLY_P (gnu_result); |
a1ab4c31 AC |
987 | tree renamed_obj; |
988 | ||
989 | if (TREE_CODE (gnu_result) == PARM_DECL | |
990 | && DECL_BY_COMPONENT_PTR_P (gnu_result)) | |
991 | gnu_result | |
992 | = build_unary_op (INDIRECT_REF, NULL_TREE, | |
993 | convert (build_pointer_type (gnu_result_type), | |
994 | gnu_result)); | |
995 | ||
996 | /* If it's a renaming pointer and we are at the right binding level, | |
997 | we can reference the renamed object directly, since the renamed | |
998 | expression has been protected against multiple evaluations. */ | |
999 | else if (TREE_CODE (gnu_result) == VAR_DECL | |
ced57283 EB |
1000 | && (renamed_obj = DECL_RENAMED_OBJECT (gnu_result)) |
1001 | && (!DECL_RENAMING_GLOBAL_P (gnu_result) | |
a1ab4c31 AC |
1002 | || global_bindings_p ())) |
1003 | gnu_result = renamed_obj; | |
1004 | ||
1005 | /* Return the underlying CST for a CONST_DECL like a few lines below, | |
1006 | after dereferencing in this case. */ | |
1007 | else if (TREE_CODE (gnu_result) == CONST_DECL) | |
1008 | gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, | |
1009 | DECL_INITIAL (gnu_result)); | |
1010 | ||
1011 | else | |
1012 | gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result); | |
1013 | ||
ced57283 EB |
1014 | if (read_only) |
1015 | TREE_READONLY (gnu_result) = 1; | |
a1ab4c31 AC |
1016 | } |
1017 | ||
1018 | /* The GNAT tree has the type of a function as the type of its result. Also | |
1019 | use the type of the result if the Etype is a subtype which is nominally | |
1020 | unconstrained. But remove any padding from the resulting type. */ | |
1021 | if (TREE_CODE (TREE_TYPE (gnu_result)) == FUNCTION_TYPE | |
1022 | || Is_Constr_Subt_For_UN_Aliased (gnat_temp_type)) | |
1023 | { | |
1024 | gnu_result_type = TREE_TYPE (gnu_result); | |
315cff15 | 1025 | if (TYPE_IS_PADDING_P (gnu_result_type)) |
a1ab4c31 AC |
1026 | gnu_result_type = TREE_TYPE (TYPE_FIELDS (gnu_result_type)); |
1027 | } | |
1028 | ||
1029 | /* If we have a constant declaration and its initializer at hand, | |
1030 | try to return the latter to avoid the need to call fold in lots | |
1031 | of places and the need of elaboration code if this Id is used as | |
1032 | an initializer itself. */ | |
1033 | if (TREE_CONSTANT (gnu_result) | |
1034 | && DECL_P (gnu_result) | |
1035 | && DECL_INITIAL (gnu_result)) | |
1036 | { | |
c34f3839 EB |
1037 | bool constant_only = (TREE_CODE (gnu_result) == CONST_DECL |
1038 | && !DECL_CONST_CORRESPONDING_VAR (gnu_result)); | |
cb3d597d EB |
1039 | bool address_of_constant = (TREE_CODE (gnu_result) == CONST_DECL |
1040 | && DECL_CONST_ADDRESS_P (gnu_result)); | |
1041 | ||
1042 | /* If there is a (corresponding) variable or this is the address of a | |
1043 | constant, we only want to return the initializer if an lvalue isn't | |
1044 | required. Evaluate this now if we have not already done so. */ | |
1045 | if ((!constant_only || address_of_constant) && require_lvalue < 0) | |
1046 | require_lvalue | |
1047 | = lvalue_required_p (gnat_node, gnu_result_type, true, | |
1048 | address_of_constant, Is_Aliased (gnat_temp)); | |
1049 | ||
1050 | if ((constant_only && !address_of_constant) || !require_lvalue) | |
a1ab4c31 AC |
1051 | gnu_result = unshare_expr (DECL_INITIAL (gnu_result)); |
1052 | } | |
1053 | ||
1054 | *gnu_result_type_p = gnu_result_type; | |
1055 | return gnu_result; | |
1056 | } | |
1057 | \f | |
1058 | /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return | |
1059 | any statements we generate. */ | |
1060 | ||
1061 | static tree | |
1062 | Pragma_to_gnu (Node_Id gnat_node) | |
1063 | { | |
1064 | Node_Id gnat_temp; | |
1065 | tree gnu_result = alloc_stmt_list (); | |
1066 | ||
1067 | /* Check for (and ignore) unrecognized pragma and do nothing if we are just | |
1068 | annotating types. */ | |
1069 | if (type_annotate_only | |
1070 | || !Is_Pragma_Name (Chars (Pragma_Identifier (gnat_node)))) | |
1071 | return gnu_result; | |
1072 | ||
1073 | switch (Get_Pragma_Id (Chars (Pragma_Identifier (gnat_node)))) | |
1074 | { | |
1075 | case Pragma_Inspection_Point: | |
1076 | /* Do nothing at top level: all such variables are already viewable. */ | |
1077 | if (global_bindings_p ()) | |
1078 | break; | |
1079 | ||
1080 | for (gnat_temp = First (Pragma_Argument_Associations (gnat_node)); | |
1081 | Present (gnat_temp); | |
1082 | gnat_temp = Next (gnat_temp)) | |
1083 | { | |
1084 | Node_Id gnat_expr = Expression (gnat_temp); | |
1085 | tree gnu_expr = gnat_to_gnu (gnat_expr); | |
1086 | int use_address; | |
1087 | enum machine_mode mode; | |
1088 | tree asm_constraint = NULL_TREE; | |
1089 | #ifdef ASM_COMMENT_START | |
1090 | char *comment; | |
1091 | #endif | |
1092 | ||
1093 | if (TREE_CODE (gnu_expr) == UNCONSTRAINED_ARRAY_REF) | |
1094 | gnu_expr = TREE_OPERAND (gnu_expr, 0); | |
1095 | ||
1096 | /* Use the value only if it fits into a normal register, | |
1097 | otherwise use the address. */ | |
1098 | mode = TYPE_MODE (TREE_TYPE (gnu_expr)); | |
1099 | use_address = ((GET_MODE_CLASS (mode) != MODE_INT | |
1100 | && GET_MODE_CLASS (mode) != MODE_PARTIAL_INT) | |
1101 | || GET_MODE_SIZE (mode) > UNITS_PER_WORD); | |
1102 | ||
1103 | if (use_address) | |
1104 | gnu_expr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr); | |
1105 | ||
1106 | #ifdef ASM_COMMENT_START | |
1107 | comment = concat (ASM_COMMENT_START, | |
1108 | " inspection point: ", | |
1109 | Get_Name_String (Chars (gnat_expr)), | |
1110 | use_address ? " address" : "", | |
1111 | " is in %0", | |
1112 | NULL); | |
1113 | asm_constraint = build_string (strlen (comment), comment); | |
1114 | free (comment); | |
1115 | #endif | |
1c384bf1 | 1116 | gnu_expr = build5 (ASM_EXPR, void_type_node, |
a1ab4c31 AC |
1117 | asm_constraint, |
1118 | NULL_TREE, | |
1119 | tree_cons | |
1120 | (build_tree_list (NULL_TREE, | |
1121 | build_string (1, "g")), | |
1122 | gnu_expr, NULL_TREE), | |
1c384bf1 | 1123 | NULL_TREE, NULL_TREE); |
a1ab4c31 AC |
1124 | ASM_VOLATILE_P (gnu_expr) = 1; |
1125 | set_expr_location_from_node (gnu_expr, gnat_node); | |
1126 | append_to_statement_list (gnu_expr, &gnu_result); | |
1127 | } | |
1128 | break; | |
1129 | ||
1130 | case Pragma_Optimize: | |
1131 | switch (Chars (Expression | |
1132 | (First (Pragma_Argument_Associations (gnat_node))))) | |
1133 | { | |
1134 | case Name_Time: case Name_Space: | |
e84319a3 | 1135 | if (!optimize) |
a1ab4c31 AC |
1136 | post_error ("insufficient -O value?", gnat_node); |
1137 | break; | |
1138 | ||
1139 | case Name_Off: | |
e84319a3 | 1140 | if (optimize) |
a1ab4c31 AC |
1141 | post_error ("must specify -O0?", gnat_node); |
1142 | break; | |
1143 | ||
1144 | default: | |
1145 | gcc_unreachable (); | |
1146 | } | |
1147 | break; | |
1148 | ||
1149 | case Pragma_Reviewable: | |
1150 | if (write_symbols == NO_DEBUG) | |
1151 | post_error ("must specify -g?", gnat_node); | |
1152 | break; | |
1153 | } | |
1154 | ||
1155 | return gnu_result; | |
1156 | } | |
aa1aa786 | 1157 | \f |
feec4372 | 1158 | /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node, |
a1ab4c31 AC |
1159 | to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to |
1160 | where we should place the result type. ATTRIBUTE is the attribute ID. */ | |
1161 | ||
1162 | static tree | |
1163 | Attribute_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, int attribute) | |
1164 | { | |
a1ab4c31 AC |
1165 | tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node)); |
1166 | tree gnu_type = TREE_TYPE (gnu_prefix); | |
caa9d12a EB |
1167 | tree gnu_expr, gnu_result_type, gnu_result = error_mark_node; |
1168 | bool prefix_unused = false; | |
a1ab4c31 AC |
1169 | |
1170 | /* If the input is a NULL_EXPR, make a new one. */ | |
1171 | if (TREE_CODE (gnu_prefix) == NULL_EXPR) | |
1172 | { | |
feec4372 EB |
1173 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); |
1174 | *gnu_result_type_p = gnu_result_type; | |
1175 | return build1 (NULL_EXPR, gnu_result_type, TREE_OPERAND (gnu_prefix, 0)); | |
a1ab4c31 AC |
1176 | } |
1177 | ||
1178 | switch (attribute) | |
1179 | { | |
1180 | case Attr_Pos: | |
1181 | case Attr_Val: | |
feec4372 EB |
1182 | /* These are just conversions since representation clauses for |
1183 | enumeration types are handled in the front-end. */ | |
a1ab4c31 AC |
1184 | { |
1185 | bool checkp = Do_Range_Check (First (Expressions (gnat_node))); | |
a1ab4c31 AC |
1186 | gnu_result = gnat_to_gnu (First (Expressions (gnat_node))); |
1187 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1188 | gnu_result = convert_with_check (Etype (gnat_node), gnu_result, | |
10069d53 | 1189 | checkp, checkp, true, gnat_node); |
a1ab4c31 AC |
1190 | } |
1191 | break; | |
1192 | ||
1193 | case Attr_Pred: | |
1194 | case Attr_Succ: | |
feec4372 EB |
1195 | /* These just add or subtract the constant 1 since representation |
1196 | clauses for enumeration types are handled in the front-end. */ | |
a1ab4c31 AC |
1197 | gnu_expr = gnat_to_gnu (First (Expressions (gnat_node))); |
1198 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1199 | ||
1200 | if (Do_Range_Check (First (Expressions (gnat_node)))) | |
1201 | { | |
7d7a1fe8 | 1202 | gnu_expr = gnat_protect_expr (gnu_expr); |
a1ab4c31 AC |
1203 | gnu_expr |
1204 | = emit_check | |
1205 | (build_binary_op (EQ_EXPR, integer_type_node, | |
1206 | gnu_expr, | |
1207 | attribute == Attr_Pred | |
1208 | ? TYPE_MIN_VALUE (gnu_result_type) | |
1209 | : TYPE_MAX_VALUE (gnu_result_type)), | |
10069d53 | 1210 | gnu_expr, CE_Range_Check_Failed, gnat_node); |
a1ab4c31 AC |
1211 | } |
1212 | ||
1213 | gnu_result | |
feec4372 | 1214 | = build_binary_op (attribute == Attr_Pred ? MINUS_EXPR : PLUS_EXPR, |
a1ab4c31 AC |
1215 | gnu_result_type, gnu_expr, |
1216 | convert (gnu_result_type, integer_one_node)); | |
1217 | break; | |
1218 | ||
1219 | case Attr_Address: | |
1220 | case Attr_Unrestricted_Access: | |
feec4372 EB |
1221 | /* Conversions don't change addresses but can cause us to miss the |
1222 | COMPONENT_REF case below, so strip them off. */ | |
a1ab4c31 AC |
1223 | gnu_prefix = remove_conversions (gnu_prefix, |
1224 | !Must_Be_Byte_Aligned (gnat_node)); | |
1225 | ||
1226 | /* If we are taking 'Address of an unconstrained object, this is the | |
1227 | pointer to the underlying array. */ | |
1228 | if (attribute == Attr_Address) | |
1229 | gnu_prefix = maybe_unconstrained_array (gnu_prefix); | |
1230 | ||
1231 | /* If we are building a static dispatch table, we have to honor | |
1232 | TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible | |
1233 | with the C++ ABI. We do it in the non-static case as well, | |
1234 | see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */ | |
1235 | else if (TARGET_VTABLE_USES_DESCRIPTORS | |
1236 | && Is_Dispatch_Table_Entity (Etype (gnat_node))) | |
1237 | { | |
1238 | tree gnu_field, gnu_list = NULL_TREE, t; | |
1239 | /* Descriptors can only be built here for top-level functions. */ | |
1240 | bool build_descriptor = (global_bindings_p () != 0); | |
1241 | int i; | |
1242 | ||
1243 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1244 | ||
1245 | /* If we're not going to build the descriptor, we have to retrieve | |
1246 | the one which will be built by the linker (or by the compiler | |
1247 | later if a static chain is requested). */ | |
1248 | if (!build_descriptor) | |
1249 | { | |
1250 | gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_prefix); | |
1251 | gnu_result = fold_convert (build_pointer_type (gnu_result_type), | |
1252 | gnu_result); | |
1253 | gnu_result = build1 (INDIRECT_REF, gnu_result_type, gnu_result); | |
1254 | } | |
1255 | ||
1256 | for (gnu_field = TYPE_FIELDS (gnu_result_type), i = 0; | |
1257 | i < TARGET_VTABLE_USES_DESCRIPTORS; | |
1258 | gnu_field = TREE_CHAIN (gnu_field), i++) | |
1259 | { | |
1260 | if (build_descriptor) | |
1261 | { | |
1262 | t = build2 (FDESC_EXPR, TREE_TYPE (gnu_field), gnu_prefix, | |
1263 | build_int_cst (NULL_TREE, i)); | |
1264 | TREE_CONSTANT (t) = 1; | |
1265 | } | |
1266 | else | |
1267 | t = build3 (COMPONENT_REF, ptr_void_ftype, gnu_result, | |
1268 | gnu_field, NULL_TREE); | |
1269 | ||
1270 | gnu_list = tree_cons (gnu_field, t, gnu_list); | |
1271 | } | |
1272 | ||
1273 | gnu_result = gnat_build_constructor (gnu_result_type, gnu_list); | |
1274 | break; | |
1275 | } | |
1276 | ||
1277 | /* ... fall through ... */ | |
1278 | ||
1279 | case Attr_Access: | |
1280 | case Attr_Unchecked_Access: | |
1281 | case Attr_Code_Address: | |
1282 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1283 | gnu_result | |
1284 | = build_unary_op (((attribute == Attr_Address | |
1285 | || attribute == Attr_Unrestricted_Access) | |
1286 | && !Must_Be_Byte_Aligned (gnat_node)) | |
1287 | ? ATTR_ADDR_EXPR : ADDR_EXPR, | |
1288 | gnu_result_type, gnu_prefix); | |
1289 | ||
1290 | /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we | |
1291 | don't try to build a trampoline. */ | |
1292 | if (attribute == Attr_Code_Address) | |
1293 | { | |
1294 | for (gnu_expr = gnu_result; | |
1295 | CONVERT_EXPR_P (gnu_expr); | |
1296 | gnu_expr = TREE_OPERAND (gnu_expr, 0)) | |
1297 | TREE_CONSTANT (gnu_expr) = 1; | |
1298 | ||
1299 | if (TREE_CODE (gnu_expr) == ADDR_EXPR) | |
1300 | TREE_NO_TRAMPOLINE (gnu_expr) = TREE_CONSTANT (gnu_expr) = 1; | |
1301 | } | |
1302 | ||
1303 | /* For other address attributes applied to a nested function, | |
1304 | find an inner ADDR_EXPR and annotate it so that we can issue | |
1305 | a useful warning with -Wtrampolines. */ | |
1306 | else if (TREE_CODE (TREE_TYPE (gnu_prefix)) == FUNCTION_TYPE) | |
1307 | { | |
1308 | for (gnu_expr = gnu_result; | |
1309 | CONVERT_EXPR_P (gnu_expr); | |
1310 | gnu_expr = TREE_OPERAND (gnu_expr, 0)) | |
1311 | ; | |
1312 | ||
1313 | if (TREE_CODE (gnu_expr) == ADDR_EXPR | |
1314 | && decl_function_context (TREE_OPERAND (gnu_expr, 0))) | |
1315 | { | |
1316 | set_expr_location_from_node (gnu_expr, gnat_node); | |
1317 | ||
1318 | /* Check that we're not violating the No_Implicit_Dynamic_Code | |
1319 | restriction. Be conservative if we don't know anything | |
1320 | about the trampoline strategy for the target. */ | |
1321 | Check_Implicit_Dynamic_Code_Allowed (gnat_node); | |
1322 | } | |
1323 | } | |
1324 | break; | |
1325 | ||
1326 | case Attr_Pool_Address: | |
1327 | { | |
1328 | tree gnu_obj_type; | |
1329 | tree gnu_ptr = gnu_prefix; | |
1330 | ||
1331 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1332 | ||
feec4372 EB |
1333 | /* If this is an unconstrained array, we know the object has been |
1334 | allocated with the template in front of the object. So compute | |
1335 | the template address. */ | |
315cff15 | 1336 | if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr))) |
a1ab4c31 AC |
1337 | gnu_ptr |
1338 | = convert (build_pointer_type | |
1339 | (TYPE_OBJECT_RECORD_TYPE | |
1340 | (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))), | |
1341 | gnu_ptr); | |
1342 | ||
1343 | gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr)); | |
1344 | if (TREE_CODE (gnu_obj_type) == RECORD_TYPE | |
1345 | && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type)) | |
1346 | { | |
1347 | tree gnu_char_ptr_type = build_pointer_type (char_type_node); | |
1348 | tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type)); | |
1349 | tree gnu_byte_offset | |
1350 | = convert (sizetype, | |
1351 | size_diffop (size_zero_node, gnu_pos)); | |
1352 | gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset); | |
1353 | ||
1354 | gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr); | |
1355 | gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type, | |
1356 | gnu_ptr, gnu_byte_offset); | |
1357 | } | |
1358 | ||
1359 | gnu_result = convert (gnu_result_type, gnu_ptr); | |
1360 | } | |
1361 | break; | |
1362 | ||
1363 | case Attr_Size: | |
1364 | case Attr_Object_Size: | |
1365 | case Attr_Value_Size: | |
1366 | case Attr_Max_Size_In_Storage_Elements: | |
1367 | gnu_expr = gnu_prefix; | |
1368 | ||
20faffe7 EB |
1369 | /* Remove NOPs and conversions between original and packable version |
1370 | from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR | |
1371 | to see if a COMPONENT_REF was involved. */ | |
1372 | while (TREE_CODE (gnu_expr) == NOP_EXPR | |
1373 | || (TREE_CODE (gnu_expr) == VIEW_CONVERT_EXPR | |
1374 | && TREE_CODE (TREE_TYPE (gnu_expr)) == RECORD_TYPE | |
1375 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))) | |
1376 | == RECORD_TYPE | |
1377 | && TYPE_NAME (TREE_TYPE (gnu_expr)) | |
1378 | == TYPE_NAME (TREE_TYPE (TREE_OPERAND (gnu_expr, 0))))) | |
a1ab4c31 AC |
1379 | gnu_expr = TREE_OPERAND (gnu_expr, 0); |
1380 | ||
1381 | gnu_prefix = remove_conversions (gnu_prefix, true); | |
1382 | prefix_unused = true; | |
1383 | gnu_type = TREE_TYPE (gnu_prefix); | |
1384 | ||
1385 | /* Replace an unconstrained array type with the type of the underlying | |
1386 | array. We can't do this with a call to maybe_unconstrained_array | |
1387 | since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements, | |
1388 | use the record type that will be used to allocate the object and its | |
1389 | template. */ | |
1390 | if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE) | |
1391 | { | |
1392 | gnu_type = TYPE_OBJECT_RECORD_TYPE (gnu_type); | |
1393 | if (attribute != Attr_Max_Size_In_Storage_Elements) | |
1394 | gnu_type = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_type))); | |
1395 | } | |
1396 | ||
1397 | /* If we're looking for the size of a field, return the field size. | |
6b1cce3a EB |
1398 | Otherwise, if the prefix is an object, or if we're looking for |
1399 | 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the | |
1400 | GCC size of the type. Otherwise, it is the RM size of the type. */ | |
a1ab4c31 AC |
1401 | if (TREE_CODE (gnu_prefix) == COMPONENT_REF) |
1402 | gnu_result = DECL_SIZE (TREE_OPERAND (gnu_prefix, 1)); | |
1403 | else if (TREE_CODE (gnu_prefix) != TYPE_DECL | |
1404 | || attribute == Attr_Object_Size | |
1405 | || attribute == Attr_Max_Size_In_Storage_Elements) | |
1406 | { | |
6b1cce3a EB |
1407 | /* If the prefix is an object of a padded type, the GCC size isn't |
1408 | relevant to the programmer. Normally what we want is the RM size, | |
1409 | which was set from the specified size, but if it was not set, we | |
1410 | want the size of the field. Using the MAX of those two produces | |
1411 | the right result in all cases. Don't use the size of the field | |
1412 | if it's self-referential, since that's never what's wanted. */ | |
1413 | if (TREE_CODE (gnu_prefix) != TYPE_DECL | |
1414 | && TYPE_IS_PADDING_P (gnu_type) | |
a1ab4c31 AC |
1415 | && TREE_CODE (gnu_expr) == COMPONENT_REF) |
1416 | { | |
1417 | gnu_result = rm_size (gnu_type); | |
6b1cce3a EB |
1418 | if (!CONTAINS_PLACEHOLDER_P |
1419 | (DECL_SIZE (TREE_OPERAND (gnu_expr, 1)))) | |
a1ab4c31 AC |
1420 | gnu_result |
1421 | = size_binop (MAX_EXPR, gnu_result, | |
1422 | DECL_SIZE (TREE_OPERAND (gnu_expr, 1))); | |
1423 | } | |
1424 | else if (Nkind (Prefix (gnat_node)) == N_Explicit_Dereference) | |
1425 | { | |
1426 | Node_Id gnat_deref = Prefix (gnat_node); | |
1e17ef87 EB |
1427 | Node_Id gnat_actual_subtype |
1428 | = Actual_Designated_Subtype (gnat_deref); | |
1429 | tree gnu_ptr_type | |
1430 | = TREE_TYPE (gnat_to_gnu (Prefix (gnat_deref))); | |
1431 | ||
315cff15 | 1432 | if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type) |
1e17ef87 EB |
1433 | && Present (gnat_actual_subtype)) |
1434 | { | |
1435 | tree gnu_actual_obj_type | |
1436 | = gnat_to_gnu_type (gnat_actual_subtype); | |
1437 | gnu_type | |
1438 | = build_unc_object_type_from_ptr (gnu_ptr_type, | |
1439 | gnu_actual_obj_type, | |
1440 | get_identifier ("SIZE")); | |
1441 | } | |
a1ab4c31 AC |
1442 | |
1443 | gnu_result = TYPE_SIZE (gnu_type); | |
1444 | } | |
1445 | else | |
1446 | gnu_result = TYPE_SIZE (gnu_type); | |
1447 | } | |
1448 | else | |
1449 | gnu_result = rm_size (gnu_type); | |
1450 | ||
1451 | gcc_assert (gnu_result); | |
1452 | ||
feec4372 EB |
1453 | /* Deal with a self-referential size by returning the maximum size for |
1454 | a type and by qualifying the size with the object for 'Size of an | |
a1ab4c31 AC |
1455 | object. */ |
1456 | if (CONTAINS_PLACEHOLDER_P (gnu_result)) | |
1457 | { | |
1458 | if (TREE_CODE (gnu_prefix) != TYPE_DECL) | |
1459 | gnu_result = substitute_placeholder_in_expr (gnu_result, gnu_expr); | |
1460 | else | |
1461 | gnu_result = max_size (gnu_result, true); | |
1462 | } | |
1463 | ||
1464 | /* If the type contains a template, subtract its size. */ | |
1465 | if (TREE_CODE (gnu_type) == RECORD_TYPE | |
1466 | && TYPE_CONTAINS_TEMPLATE_P (gnu_type)) | |
1467 | gnu_result = size_binop (MINUS_EXPR, gnu_result, | |
1468 | DECL_SIZE (TYPE_FIELDS (gnu_type))); | |
1469 | ||
1470 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1471 | ||
a1ab4c31 | 1472 | if (attribute == Attr_Max_Size_In_Storage_Elements) |
c86f07f6 EB |
1473 | gnu_result = fold_build2 (CEIL_DIV_EXPR, bitsizetype, |
1474 | gnu_result, bitsize_unit_node); | |
a1ab4c31 AC |
1475 | break; |
1476 | ||
1477 | case Attr_Alignment: | |
caa9d12a EB |
1478 | { |
1479 | unsigned int align; | |
a1ab4c31 | 1480 | |
caa9d12a | 1481 | if (TREE_CODE (gnu_prefix) == COMPONENT_REF |
315cff15 | 1482 | && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))) |
caa9d12a | 1483 | gnu_prefix = TREE_OPERAND (gnu_prefix, 0); |
a1ab4c31 | 1484 | |
caa9d12a EB |
1485 | gnu_type = TREE_TYPE (gnu_prefix); |
1486 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1487 | prefix_unused = true; | |
1488 | ||
1489 | if (TREE_CODE (gnu_prefix) == COMPONENT_REF) | |
1490 | align = DECL_ALIGN (TREE_OPERAND (gnu_prefix, 1)) / BITS_PER_UNIT; | |
1491 | else | |
1492 | { | |
1493 | Node_Id gnat_prefix = Prefix (gnat_node); | |
1494 | Entity_Id gnat_type = Etype (gnat_prefix); | |
1495 | unsigned int double_align; | |
1496 | bool is_capped_double, align_clause; | |
1497 | ||
1498 | /* If the default alignment of "double" or larger scalar types is | |
1499 | specifically capped and there is an alignment clause neither | |
1500 | on the type nor on the prefix itself, return the cap. */ | |
1501 | if ((double_align = double_float_alignment) > 0) | |
1502 | is_capped_double | |
1503 | = is_double_float_or_array (gnat_type, &align_clause); | |
1504 | else if ((double_align = double_scalar_alignment) > 0) | |
1505 | is_capped_double | |
1506 | = is_double_scalar_or_array (gnat_type, &align_clause); | |
1507 | else | |
1508 | is_capped_double = align_clause = false; | |
1509 | ||
1510 | if (is_capped_double | |
1511 | && Nkind (gnat_prefix) == N_Identifier | |
1512 | && Present (Alignment_Clause (Entity (gnat_prefix)))) | |
1513 | align_clause = true; | |
1514 | ||
1515 | if (is_capped_double && !align_clause) | |
1516 | align = double_align; | |
1517 | else | |
1518 | align = TYPE_ALIGN (gnu_type) / BITS_PER_UNIT; | |
1519 | } | |
1520 | ||
1521 | gnu_result = size_int (align); | |
1522 | } | |
a1ab4c31 AC |
1523 | break; |
1524 | ||
1525 | case Attr_First: | |
1526 | case Attr_Last: | |
1527 | case Attr_Range_Length: | |
1528 | prefix_unused = true; | |
1529 | ||
1530 | if (INTEGRAL_TYPE_P (gnu_type) || TREE_CODE (gnu_type) == REAL_TYPE) | |
1531 | { | |
1532 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1533 | ||
1534 | if (attribute == Attr_First) | |
1535 | gnu_result = TYPE_MIN_VALUE (gnu_type); | |
1536 | else if (attribute == Attr_Last) | |
1537 | gnu_result = TYPE_MAX_VALUE (gnu_type); | |
1538 | else | |
1539 | gnu_result | |
1540 | = build_binary_op | |
1541 | (MAX_EXPR, get_base_type (gnu_result_type), | |
1542 | build_binary_op | |
1543 | (PLUS_EXPR, get_base_type (gnu_result_type), | |
1544 | build_binary_op (MINUS_EXPR, | |
1545 | get_base_type (gnu_result_type), | |
1546 | convert (gnu_result_type, | |
1547 | TYPE_MAX_VALUE (gnu_type)), | |
1548 | convert (gnu_result_type, | |
1549 | TYPE_MIN_VALUE (gnu_type))), | |
1550 | convert (gnu_result_type, integer_one_node)), | |
1551 | convert (gnu_result_type, integer_zero_node)); | |
1552 | ||
1553 | break; | |
1554 | } | |
1555 | ||
1556 | /* ... fall through ... */ | |
1557 | ||
1558 | case Attr_Length: | |
1559 | { | |
1560 | int Dimension = (Present (Expressions (gnat_node)) | |
1561 | ? UI_To_Int (Intval (First (Expressions (gnat_node)))) | |
1562 | : 1), i; | |
6bf68a93 | 1563 | struct parm_attr_d *pa = NULL; |
a1ab4c31 AC |
1564 | Entity_Id gnat_param = Empty; |
1565 | ||
1566 | /* Make sure any implicit dereference gets done. */ | |
1567 | gnu_prefix = maybe_implicit_deref (gnu_prefix); | |
1568 | gnu_prefix = maybe_unconstrained_array (gnu_prefix); | |
1569 | /* We treat unconstrained array In parameters specially. */ | |
1570 | if (Nkind (Prefix (gnat_node)) == N_Identifier | |
1571 | && !Is_Constrained (Etype (Prefix (gnat_node))) | |
1572 | && Ekind (Entity (Prefix (gnat_node))) == E_In_Parameter) | |
1573 | gnat_param = Entity (Prefix (gnat_node)); | |
1574 | gnu_type = TREE_TYPE (gnu_prefix); | |
1575 | prefix_unused = true; | |
1576 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1577 | ||
1578 | if (TYPE_CONVENTION_FORTRAN_P (gnu_type)) | |
1579 | { | |
1580 | int ndim; | |
1581 | tree gnu_type_temp; | |
1582 | ||
1583 | for (ndim = 1, gnu_type_temp = gnu_type; | |
1584 | TREE_CODE (TREE_TYPE (gnu_type_temp)) == ARRAY_TYPE | |
1585 | && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type_temp)); | |
1586 | ndim++, gnu_type_temp = TREE_TYPE (gnu_type_temp)) | |
1587 | ; | |
1588 | ||
1589 | Dimension = ndim + 1 - Dimension; | |
1590 | } | |
1591 | ||
1592 | for (i = 1; i < Dimension; i++) | |
1593 | gnu_type = TREE_TYPE (gnu_type); | |
1594 | ||
1595 | gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE); | |
1596 | ||
1597 | /* When not optimizing, look up the slot associated with the parameter | |
1598 | and the dimension in the cache and create a new one on failure. */ | |
1599 | if (!optimize && Present (gnat_param)) | |
1600 | { | |
1601 | for (i = 0; VEC_iterate (parm_attr, f_parm_attr_cache, i, pa); i++) | |
1602 | if (pa->id == gnat_param && pa->dim == Dimension) | |
1603 | break; | |
1604 | ||
1605 | if (!pa) | |
1606 | { | |
6bf68a93 | 1607 | pa = GGC_CNEW (struct parm_attr_d); |
a1ab4c31 AC |
1608 | pa->id = gnat_param; |
1609 | pa->dim = Dimension; | |
1610 | VEC_safe_push (parm_attr, gc, f_parm_attr_cache, pa); | |
1611 | } | |
1612 | } | |
1613 | ||
1614 | /* Return the cached expression or build a new one. */ | |
1615 | if (attribute == Attr_First) | |
1616 | { | |
1617 | if (pa && pa->first) | |
1618 | { | |
1619 | gnu_result = pa->first; | |
1620 | break; | |
1621 | } | |
1622 | ||
1623 | gnu_result | |
1624 | = TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))); | |
1625 | } | |
1626 | ||
1627 | else if (attribute == Attr_Last) | |
1628 | { | |
1629 | if (pa && pa->last) | |
1630 | { | |
1631 | gnu_result = pa->last; | |
1632 | break; | |
1633 | } | |
1634 | ||
1635 | gnu_result | |
1636 | = TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))); | |
1637 | } | |
1638 | ||
1639 | else /* attribute == Attr_Range_Length || attribute == Attr_Length */ | |
1640 | { | |
1641 | if (pa && pa->length) | |
1642 | { | |
1643 | gnu_result = pa->length; | |
1644 | break; | |
1645 | } | |
1646 | else | |
1647 | { | |
1648 | /* We used to compute the length as max (hb - lb + 1, 0), | |
1649 | which could overflow for some cases of empty arrays, e.g. | |
1650 | when lb == index_type'first. We now compute the length as | |
4e6602a8 | 1651 | (hb >= lb) ? hb - lb + 1 : 0, which would only overflow in |
a1ab4c31 AC |
1652 | much rarer cases, for extremely large arrays we expect |
1653 | never to encounter in practice. In addition, the former | |
1654 | computation required the use of potentially constraining | |
4e6602a8 EB |
1655 | signed arithmetic while the latter doesn't. Note that |
1656 | the comparison must be done in the original index type, | |
1657 | to avoid any overflow during the conversion. */ | |
1658 | tree comp_type = get_base_type (gnu_result_type); | |
1659 | tree index_type = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)); | |
1660 | tree lb = TYPE_MIN_VALUE (index_type); | |
1661 | tree hb = TYPE_MAX_VALUE (index_type); | |
a1ab4c31 | 1662 | gnu_result |
4e6602a8 EB |
1663 | = build_binary_op (PLUS_EXPR, comp_type, |
1664 | build_binary_op (MINUS_EXPR, | |
1665 | comp_type, | |
1666 | convert (comp_type, hb), | |
1667 | convert (comp_type, lb)), | |
1668 | convert (comp_type, integer_one_node)); | |
1669 | gnu_result | |
1670 | = build_cond_expr (comp_type, | |
1671 | build_binary_op (GE_EXPR, | |
1672 | integer_type_node, | |
1673 | hb, lb), | |
1674 | gnu_result, | |
1675 | convert (comp_type, integer_zero_node)); | |
a1ab4c31 AC |
1676 | } |
1677 | } | |
1678 | ||
1679 | /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are | |
1680 | handling. Note that these attributes could not have been used on | |
1681 | an unconstrained array type. */ | |
4e6602a8 | 1682 | gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix); |
a1ab4c31 AC |
1683 | |
1684 | /* Cache the expression we have just computed. Since we want to do it | |
1685 | at runtime, we force the use of a SAVE_EXPR and let the gimplifier | |
1686 | create the temporary. */ | |
1687 | if (pa) | |
1688 | { | |
1689 | gnu_result | |
1690 | = build1 (SAVE_EXPR, TREE_TYPE (gnu_result), gnu_result); | |
1691 | TREE_SIDE_EFFECTS (gnu_result) = 1; | |
1692 | if (attribute == Attr_First) | |
1693 | pa->first = gnu_result; | |
1694 | else if (attribute == Attr_Last) | |
1695 | pa->last = gnu_result; | |
1696 | else | |
1697 | pa->length = gnu_result; | |
1698 | } | |
321e10dd EB |
1699 | |
1700 | /* Set the source location onto the predicate of the condition in the | |
1701 | 'Length case but do not do it if the expression is cached to avoid | |
1702 | messing up the debug info. */ | |
1703 | else if ((attribute == Attr_Range_Length || attribute == Attr_Length) | |
1704 | && TREE_CODE (gnu_result) == COND_EXPR | |
1705 | && EXPR_P (TREE_OPERAND (gnu_result, 0))) | |
1706 | set_expr_location_from_node (TREE_OPERAND (gnu_result, 0), | |
1707 | gnat_node); | |
1708 | ||
a1ab4c31 AC |
1709 | break; |
1710 | } | |
1711 | ||
1712 | case Attr_Bit_Position: | |
1713 | case Attr_Position: | |
1714 | case Attr_First_Bit: | |
1715 | case Attr_Last_Bit: | |
1716 | case Attr_Bit: | |
1717 | { | |
1718 | HOST_WIDE_INT bitsize; | |
1719 | HOST_WIDE_INT bitpos; | |
1720 | tree gnu_offset; | |
1721 | tree gnu_field_bitpos; | |
1722 | tree gnu_field_offset; | |
1723 | tree gnu_inner; | |
1724 | enum machine_mode mode; | |
1725 | int unsignedp, volatilep; | |
1726 | ||
1727 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1728 | gnu_prefix = remove_conversions (gnu_prefix, true); | |
1729 | prefix_unused = true; | |
1730 | ||
1731 | /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF, | |
1e17ef87 | 1732 | the result is 0. Don't allow 'Bit on a bare component, though. */ |
a1ab4c31 AC |
1733 | if (attribute == Attr_Bit |
1734 | && TREE_CODE (gnu_prefix) != COMPONENT_REF | |
1735 | && TREE_CODE (gnu_prefix) != FIELD_DECL) | |
1736 | { | |
1737 | gnu_result = integer_zero_node; | |
1738 | break; | |
1739 | } | |
1740 | ||
1741 | else | |
1742 | gcc_assert (TREE_CODE (gnu_prefix) == COMPONENT_REF | |
1743 | || (attribute == Attr_Bit_Position | |
1744 | && TREE_CODE (gnu_prefix) == FIELD_DECL)); | |
1745 | ||
1746 | get_inner_reference (gnu_prefix, &bitsize, &bitpos, &gnu_offset, | |
1747 | &mode, &unsignedp, &volatilep, false); | |
1748 | ||
1749 | if (TREE_CODE (gnu_prefix) == COMPONENT_REF) | |
1750 | { | |
1751 | gnu_field_bitpos = bit_position (TREE_OPERAND (gnu_prefix, 1)); | |
1752 | gnu_field_offset = byte_position (TREE_OPERAND (gnu_prefix, 1)); | |
1753 | ||
1754 | for (gnu_inner = TREE_OPERAND (gnu_prefix, 0); | |
1755 | TREE_CODE (gnu_inner) == COMPONENT_REF | |
1756 | && DECL_INTERNAL_P (TREE_OPERAND (gnu_inner, 1)); | |
1757 | gnu_inner = TREE_OPERAND (gnu_inner, 0)) | |
1758 | { | |
1759 | gnu_field_bitpos | |
1760 | = size_binop (PLUS_EXPR, gnu_field_bitpos, | |
1761 | bit_position (TREE_OPERAND (gnu_inner, 1))); | |
1762 | gnu_field_offset | |
1763 | = size_binop (PLUS_EXPR, gnu_field_offset, | |
1764 | byte_position (TREE_OPERAND (gnu_inner, 1))); | |
1765 | } | |
1766 | } | |
1767 | else if (TREE_CODE (gnu_prefix) == FIELD_DECL) | |
1768 | { | |
1769 | gnu_field_bitpos = bit_position (gnu_prefix); | |
1770 | gnu_field_offset = byte_position (gnu_prefix); | |
1771 | } | |
1772 | else | |
1773 | { | |
1774 | gnu_field_bitpos = bitsize_zero_node; | |
1775 | gnu_field_offset = size_zero_node; | |
1776 | } | |
1777 | ||
1778 | switch (attribute) | |
1779 | { | |
1780 | case Attr_Position: | |
1781 | gnu_result = gnu_field_offset; | |
1782 | break; | |
1783 | ||
1784 | case Attr_First_Bit: | |
1785 | case Attr_Bit: | |
1786 | gnu_result = size_int (bitpos % BITS_PER_UNIT); | |
1787 | break; | |
1788 | ||
1789 | case Attr_Last_Bit: | |
1790 | gnu_result = bitsize_int (bitpos % BITS_PER_UNIT); | |
1791 | gnu_result = size_binop (PLUS_EXPR, gnu_result, | |
1792 | TYPE_SIZE (TREE_TYPE (gnu_prefix))); | |
1793 | gnu_result = size_binop (MINUS_EXPR, gnu_result, | |
1794 | bitsize_one_node); | |
1795 | break; | |
1796 | ||
1797 | case Attr_Bit_Position: | |
1798 | gnu_result = gnu_field_bitpos; | |
1799 | break; | |
1800 | } | |
1801 | ||
feec4372 EB |
1802 | /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are |
1803 | handling. */ | |
a1ab4c31 AC |
1804 | gnu_result = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_result, gnu_prefix); |
1805 | break; | |
1806 | } | |
1807 | ||
1808 | case Attr_Min: | |
1809 | case Attr_Max: | |
1810 | { | |
1811 | tree gnu_lhs = gnat_to_gnu (First (Expressions (gnat_node))); | |
1812 | tree gnu_rhs = gnat_to_gnu (Next (First (Expressions (gnat_node)))); | |
1813 | ||
1814 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1815 | gnu_result = build_binary_op (attribute == Attr_Min | |
1816 | ? MIN_EXPR : MAX_EXPR, | |
1817 | gnu_result_type, gnu_lhs, gnu_rhs); | |
1818 | } | |
1819 | break; | |
1820 | ||
1821 | case Attr_Passed_By_Reference: | |
1822 | gnu_result = size_int (default_pass_by_ref (gnu_type) | |
1823 | || must_pass_by_ref (gnu_type)); | |
1824 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1825 | break; | |
1826 | ||
1827 | case Attr_Component_Size: | |
1828 | if (TREE_CODE (gnu_prefix) == COMPONENT_REF | |
315cff15 | 1829 | && TYPE_IS_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_prefix, 0)))) |
a1ab4c31 AC |
1830 | gnu_prefix = TREE_OPERAND (gnu_prefix, 0); |
1831 | ||
1832 | gnu_prefix = maybe_implicit_deref (gnu_prefix); | |
1833 | gnu_type = TREE_TYPE (gnu_prefix); | |
1834 | ||
1835 | if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE) | |
1836 | gnu_type = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_type)))); | |
1837 | ||
1838 | while (TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE | |
1839 | && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type))) | |
1840 | gnu_type = TREE_TYPE (gnu_type); | |
1841 | ||
1842 | gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE); | |
1843 | ||
1844 | /* Note this size cannot be self-referential. */ | |
1845 | gnu_result = TYPE_SIZE (TREE_TYPE (gnu_type)); | |
1846 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1847 | prefix_unused = true; | |
1848 | break; | |
1849 | ||
1850 | case Attr_Null_Parameter: | |
feec4372 EB |
1851 | /* This is just a zero cast to the pointer type for our prefix and |
1852 | dereferenced. */ | |
a1ab4c31 AC |
1853 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); |
1854 | gnu_result | |
1855 | = build_unary_op (INDIRECT_REF, NULL_TREE, | |
1856 | convert (build_pointer_type (gnu_result_type), | |
1857 | integer_zero_node)); | |
1858 | TREE_PRIVATE (gnu_result) = 1; | |
1859 | break; | |
1860 | ||
1861 | case Attr_Mechanism_Code: | |
1862 | { | |
1863 | int code; | |
1864 | Entity_Id gnat_obj = Entity (Prefix (gnat_node)); | |
1865 | ||
1866 | prefix_unused = true; | |
1867 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1868 | if (Present (Expressions (gnat_node))) | |
1869 | { | |
1870 | int i = UI_To_Int (Intval (First (Expressions (gnat_node)))); | |
1871 | ||
1872 | for (gnat_obj = First_Formal (gnat_obj); i > 1; | |
1873 | i--, gnat_obj = Next_Formal (gnat_obj)) | |
1874 | ; | |
1875 | } | |
1876 | ||
1877 | code = Mechanism (gnat_obj); | |
1878 | if (code == Default) | |
1879 | code = ((present_gnu_tree (gnat_obj) | |
1880 | && (DECL_BY_REF_P (get_gnu_tree (gnat_obj)) | |
1881 | || ((TREE_CODE (get_gnu_tree (gnat_obj)) | |
1882 | == PARM_DECL) | |
1883 | && (DECL_BY_COMPONENT_PTR_P | |
1884 | (get_gnu_tree (gnat_obj)))))) | |
1885 | ? By_Reference : By_Copy); | |
1886 | gnu_result = convert (gnu_result_type, size_int (- code)); | |
1887 | } | |
1888 | break; | |
1889 | ||
1890 | default: | |
1891 | /* Say we have an unimplemented attribute. Then set the value to be | |
feec4372 EB |
1892 | returned to be a zero and hope that's something we can convert to |
1893 | the type of this attribute. */ | |
a1ab4c31 AC |
1894 | post_error ("unimplemented attribute", gnat_node); |
1895 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
1896 | gnu_result = integer_zero_node; | |
1897 | break; | |
1898 | } | |
1899 | ||
1900 | /* If this is an attribute where the prefix was unused, force a use of it if | |
1901 | it has a side-effect. But don't do it if the prefix is just an entity | |
1902 | name. However, if an access check is needed, we must do it. See second | |
1e17ef87 | 1903 | example in AARM 11.6(5.e). */ |
a1ab4c31 AC |
1904 | if (prefix_unused && TREE_SIDE_EFFECTS (gnu_prefix) |
1905 | && !Is_Entity_Name (Prefix (gnat_node))) | |
1906 | gnu_result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (gnu_result), | |
1907 | gnu_prefix, gnu_result); | |
1908 | ||
1909 | *gnu_result_type_p = gnu_result_type; | |
1910 | return gnu_result; | |
1911 | } | |
1912 | \f | |
1913 | /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement, | |
1914 | to a GCC tree, which is returned. */ | |
1915 | ||
1916 | static tree | |
1917 | Case_Statement_to_gnu (Node_Id gnat_node) | |
1918 | { | |
1919 | tree gnu_result; | |
1920 | tree gnu_expr; | |
1921 | Node_Id gnat_when; | |
1922 | ||
1923 | gnu_expr = gnat_to_gnu (Expression (gnat_node)); | |
1924 | gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr); | |
1925 | ||
1926 | /* The range of values in a case statement is determined by the rules in | |
1927 | RM 5.4(7-9). In almost all cases, this range is represented by the Etype | |
1928 | of the expression. One exception arises in the case of a simple name that | |
1929 | is parenthesized. This still has the Etype of the name, but since it is | |
1930 | not a name, para 7 does not apply, and we need to go to the base type. | |
1931 | This is the only case where parenthesization affects the dynamic | |
1932 | semantics (i.e. the range of possible values at runtime that is covered | |
1933 | by the others alternative. | |
1934 | ||
1935 | Another exception is if the subtype of the expression is non-static. In | |
1936 | that case, we also have to use the base type. */ | |
1937 | if (Paren_Count (Expression (gnat_node)) != 0 | |
1938 | || !Is_OK_Static_Subtype (Underlying_Type | |
1939 | (Etype (Expression (gnat_node))))) | |
1940 | gnu_expr = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr); | |
1941 | ||
1942 | /* We build a SWITCH_EXPR that contains the code with interspersed | |
1943 | CASE_LABEL_EXPRs for each label. */ | |
1944 | ||
c172df28 AH |
1945 | push_stack (&gnu_switch_label_stack, NULL_TREE, |
1946 | create_artificial_label (input_location)); | |
a1ab4c31 AC |
1947 | start_stmt_group (); |
1948 | for (gnat_when = First_Non_Pragma (Alternatives (gnat_node)); | |
1949 | Present (gnat_when); | |
1950 | gnat_when = Next_Non_Pragma (gnat_when)) | |
1951 | { | |
9c69c3af | 1952 | bool choices_added_p = false; |
a1ab4c31 | 1953 | Node_Id gnat_choice; |
a1ab4c31 AC |
1954 | |
1955 | /* First compile all the different case choices for the current WHEN | |
1956 | alternative. */ | |
1957 | for (gnat_choice = First (Discrete_Choices (gnat_when)); | |
1958 | Present (gnat_choice); gnat_choice = Next (gnat_choice)) | |
1959 | { | |
1960 | tree gnu_low = NULL_TREE, gnu_high = NULL_TREE; | |
1961 | ||
1962 | switch (Nkind (gnat_choice)) | |
1963 | { | |
1964 | case N_Range: | |
1965 | gnu_low = gnat_to_gnu (Low_Bound (gnat_choice)); | |
1966 | gnu_high = gnat_to_gnu (High_Bound (gnat_choice)); | |
1967 | break; | |
1968 | ||
1969 | case N_Subtype_Indication: | |
1970 | gnu_low = gnat_to_gnu (Low_Bound (Range_Expression | |
1971 | (Constraint (gnat_choice)))); | |
1972 | gnu_high = gnat_to_gnu (High_Bound (Range_Expression | |
1973 | (Constraint (gnat_choice)))); | |
1974 | break; | |
1975 | ||
1976 | case N_Identifier: | |
1977 | case N_Expanded_Name: | |
1978 | /* This represents either a subtype range or a static value of | |
1979 | some kind; Ekind says which. */ | |
1980 | if (IN (Ekind (Entity (gnat_choice)), Type_Kind)) | |
1981 | { | |
1982 | tree gnu_type = get_unpadded_type (Entity (gnat_choice)); | |
1983 | ||
1984 | gnu_low = fold (TYPE_MIN_VALUE (gnu_type)); | |
1985 | gnu_high = fold (TYPE_MAX_VALUE (gnu_type)); | |
1986 | break; | |
1987 | } | |
1988 | ||
1989 | /* ... fall through ... */ | |
1990 | ||
1991 | case N_Character_Literal: | |
1992 | case N_Integer_Literal: | |
1993 | gnu_low = gnat_to_gnu (gnat_choice); | |
1994 | break; | |
1995 | ||
1996 | case N_Others_Choice: | |
1997 | break; | |
1998 | ||
1999 | default: | |
2000 | gcc_unreachable (); | |
2001 | } | |
2002 | ||
2003 | /* If the case value is a subtype that raises Constraint_Error at | |
2004 | run-time because of a wrong bound, then gnu_low or gnu_high is | |
16b05213 | 2005 | not translated into an INTEGER_CST. In such a case, we need |
a1ab4c31 AC |
2006 | to ensure that the when statement is not added in the tree, |
2007 | otherwise it will crash the gimplifier. */ | |
2008 | if ((!gnu_low || TREE_CODE (gnu_low) == INTEGER_CST) | |
2009 | && (!gnu_high || TREE_CODE (gnu_high) == INTEGER_CST)) | |
2010 | { | |
c172df28 AH |
2011 | add_stmt_with_node (build3 |
2012 | (CASE_LABEL_EXPR, void_type_node, | |
2013 | gnu_low, gnu_high, | |
2014 | create_artificial_label (input_location)), | |
a1ab4c31 | 2015 | gnat_choice); |
9c69c3af | 2016 | choices_added_p = true; |
a1ab4c31 AC |
2017 | } |
2018 | } | |
2019 | ||
2020 | /* Push a binding level here in case variables are declared as we want | |
2021 | them to be local to this set of statements instead of to the block | |
2022 | containing the Case statement. */ | |
9c69c3af | 2023 | if (choices_added_p) |
a1ab4c31 AC |
2024 | { |
2025 | add_stmt (build_stmt_group (Statements (gnat_when), true)); | |
2026 | add_stmt (build1 (GOTO_EXPR, void_type_node, | |
2027 | TREE_VALUE (gnu_switch_label_stack))); | |
2028 | } | |
2029 | } | |
2030 | ||
1e17ef87 | 2031 | /* Now emit a definition of the label all the cases branched to. */ |
a1ab4c31 AC |
2032 | add_stmt (build1 (LABEL_EXPR, void_type_node, |
2033 | TREE_VALUE (gnu_switch_label_stack))); | |
2034 | gnu_result = build3 (SWITCH_EXPR, TREE_TYPE (gnu_expr), gnu_expr, | |
2035 | end_stmt_group (), NULL_TREE); | |
2036 | pop_stack (&gnu_switch_label_stack); | |
2037 | ||
2038 | return gnu_result; | |
2039 | } | |
2040 | \f | |
2041 | /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement, | |
2042 | to a GCC tree, which is returned. */ | |
2043 | ||
2044 | static tree | |
2045 | Loop_Statement_to_gnu (Node_Id gnat_node) | |
2046 | { | |
2047 | /* ??? It would be nice to use "build" here, but there's no build5. */ | |
2048 | tree gnu_loop_stmt = build_nt (LOOP_STMT, NULL_TREE, NULL_TREE, | |
2049 | NULL_TREE, NULL_TREE, NULL_TREE); | |
2050 | tree gnu_loop_var = NULL_TREE; | |
2051 | Node_Id gnat_iter_scheme = Iteration_Scheme (gnat_node); | |
2052 | tree gnu_cond_expr = NULL_TREE; | |
2053 | tree gnu_result; | |
2054 | ||
2055 | TREE_TYPE (gnu_loop_stmt) = void_type_node; | |
2056 | TREE_SIDE_EFFECTS (gnu_loop_stmt) = 1; | |
c172df28 | 2057 | LOOP_STMT_LABEL (gnu_loop_stmt) = create_artificial_label (input_location); |
a1ab4c31 AC |
2058 | set_expr_location_from_node (gnu_loop_stmt, gnat_node); |
2059 | Sloc_to_locus (Sloc (End_Label (gnat_node)), | |
2060 | &DECL_SOURCE_LOCATION (LOOP_STMT_LABEL (gnu_loop_stmt))); | |
2061 | ||
2062 | /* Save the end label of this LOOP_STMT in a stack so that the corresponding | |
2063 | N_Exit_Statement can find it. */ | |
2064 | push_stack (&gnu_loop_label_stack, NULL_TREE, | |
2065 | LOOP_STMT_LABEL (gnu_loop_stmt)); | |
2066 | ||
7fda1596 EB |
2067 | /* Set the condition under which the loop must keep going. |
2068 | For the case "LOOP .... END LOOP;" the condition is always true. */ | |
a1ab4c31 AC |
2069 | if (No (gnat_iter_scheme)) |
2070 | ; | |
7fda1596 EB |
2071 | |
2072 | /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */ | |
a1ab4c31 AC |
2073 | else if (Present (Condition (gnat_iter_scheme))) |
2074 | LOOP_STMT_TOP_COND (gnu_loop_stmt) | |
2075 | = gnat_to_gnu (Condition (gnat_iter_scheme)); | |
7fda1596 EB |
2076 | |
2077 | /* Otherwise we have an iteration scheme and the condition is given by | |
2078 | the bounds of the subtype of the iteration variable. */ | |
a1ab4c31 AC |
2079 | else |
2080 | { | |
a1ab4c31 AC |
2081 | Node_Id gnat_loop_spec = Loop_Parameter_Specification (gnat_iter_scheme); |
2082 | Entity_Id gnat_loop_var = Defining_Entity (gnat_loop_spec); | |
2083 | Entity_Id gnat_type = Etype (gnat_loop_var); | |
2084 | tree gnu_type = get_unpadded_type (gnat_type); | |
2085 | tree gnu_low = TYPE_MIN_VALUE (gnu_type); | |
2086 | tree gnu_high = TYPE_MAX_VALUE (gnu_type); | |
82d3b03a EB |
2087 | tree gnu_first, gnu_last, gnu_limit; |
2088 | enum tree_code update_code, end_code; | |
a1ab4c31 | 2089 | tree gnu_base_type = get_base_type (gnu_type); |
82d3b03a EB |
2090 | |
2091 | /* We must disable modulo reduction for the loop variable, if any, | |
2092 | in order for the loop comparison to be effective. */ | |
2093 | if (Reverse_Present (gnat_loop_spec)) | |
2094 | { | |
2095 | gnu_first = gnu_high; | |
2096 | gnu_last = gnu_low; | |
2097 | update_code = MINUS_NOMOD_EXPR; | |
2098 | end_code = GE_EXPR; | |
2099 | gnu_limit = TYPE_MIN_VALUE (gnu_base_type); | |
2100 | } | |
2101 | else | |
2102 | { | |
2103 | gnu_first = gnu_low; | |
2104 | gnu_last = gnu_high; | |
2105 | update_code = PLUS_NOMOD_EXPR; | |
2106 | end_code = LE_EXPR; | |
2107 | gnu_limit = TYPE_MAX_VALUE (gnu_base_type); | |
2108 | } | |
a1ab4c31 AC |
2109 | |
2110 | /* We know the loop variable will not overflow if GNU_LAST is a constant | |
2111 | and is not equal to GNU_LIMIT. If it might overflow, we have to move | |
2112 | the limit test to the end of the loop. In that case, we have to test | |
2113 | for an empty loop outside the loop. */ | |
2114 | if (TREE_CODE (gnu_last) != INTEGER_CST | |
2115 | || TREE_CODE (gnu_limit) != INTEGER_CST | |
2116 | || tree_int_cst_equal (gnu_last, gnu_limit)) | |
2117 | { | |
2118 | gnu_cond_expr | |
2119 | = build3 (COND_EXPR, void_type_node, | |
2120 | build_binary_op (LE_EXPR, integer_type_node, | |
2121 | gnu_low, gnu_high), | |
2122 | NULL_TREE, alloc_stmt_list ()); | |
2123 | set_expr_location_from_node (gnu_cond_expr, gnat_loop_spec); | |
2124 | } | |
2125 | ||
2126 | /* Open a new nesting level that will surround the loop to declare the | |
2127 | loop index variable. */ | |
2128 | start_stmt_group (); | |
2129 | gnat_pushlevel (); | |
2130 | ||
2131 | /* Declare the loop index and set it to its initial value. */ | |
2132 | gnu_loop_var = gnat_to_gnu_entity (gnat_loop_var, gnu_first, 1); | |
2133 | if (DECL_BY_REF_P (gnu_loop_var)) | |
2134 | gnu_loop_var = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_loop_var); | |
2135 | ||
2136 | /* The loop variable might be a padded type, so use `convert' to get a | |
2137 | reference to the inner variable if so. */ | |
2138 | gnu_loop_var = convert (get_base_type (gnu_type), gnu_loop_var); | |
2139 | ||
2140 | /* Set either the top or bottom exit condition as appropriate depending | |
7fda1596 | 2141 | on whether or not we know an overflow cannot occur. */ |
a1ab4c31 AC |
2142 | if (gnu_cond_expr) |
2143 | LOOP_STMT_BOT_COND (gnu_loop_stmt) | |
2144 | = build_binary_op (NE_EXPR, integer_type_node, | |
2145 | gnu_loop_var, gnu_last); | |
2146 | else | |
2147 | LOOP_STMT_TOP_COND (gnu_loop_stmt) | |
2148 | = build_binary_op (end_code, integer_type_node, | |
2149 | gnu_loop_var, gnu_last); | |
2150 | ||
2151 | LOOP_STMT_UPDATE (gnu_loop_stmt) | |
82d3b03a | 2152 | = build_binary_op (MODIFY_EXPR, NULL_TREE, |
a1ab4c31 | 2153 | gnu_loop_var, |
82d3b03a EB |
2154 | build_binary_op (update_code, |
2155 | TREE_TYPE (gnu_loop_var), | |
2156 | gnu_loop_var, | |
2157 | convert (TREE_TYPE (gnu_loop_var), | |
2158 | integer_one_node))); | |
a1ab4c31 | 2159 | set_expr_location_from_node (LOOP_STMT_UPDATE (gnu_loop_stmt), |
7fda1596 | 2160 | gnat_iter_scheme); |
a1ab4c31 AC |
2161 | } |
2162 | ||
2163 | /* If the loop was named, have the name point to this loop. In this case, | |
2164 | the association is not a ..._DECL node, but the end label from this | |
7fda1596 | 2165 | LOOP_STMT. */ |
a1ab4c31 AC |
2166 | if (Present (Identifier (gnat_node))) |
2167 | save_gnu_tree (Entity (Identifier (gnat_node)), | |
2168 | LOOP_STMT_LABEL (gnu_loop_stmt), true); | |
2169 | ||
2170 | /* Make the loop body into its own block, so any allocated storage will be | |
2171 | released every iteration. This is needed for stack allocation. */ | |
2172 | LOOP_STMT_BODY (gnu_loop_stmt) | |
2173 | = build_stmt_group (Statements (gnat_node), true); | |
2174 | ||
2175 | /* If we declared a variable, then we are in a statement group for that | |
2176 | declaration. Add the LOOP_STMT to it and make that the "loop". */ | |
2177 | if (gnu_loop_var) | |
2178 | { | |
2179 | add_stmt (gnu_loop_stmt); | |
2180 | gnat_poplevel (); | |
2181 | gnu_loop_stmt = end_stmt_group (); | |
2182 | } | |
2183 | ||
2184 | /* If we have an outer COND_EXPR, that's our result and this loop is its | |
7fda1596 | 2185 | "true" statement. Otherwise, the result is the LOOP_STMT. */ |
a1ab4c31 AC |
2186 | if (gnu_cond_expr) |
2187 | { | |
2188 | COND_EXPR_THEN (gnu_cond_expr) = gnu_loop_stmt; | |
2189 | gnu_result = gnu_cond_expr; | |
2190 | recalculate_side_effects (gnu_cond_expr); | |
2191 | } | |
2192 | else | |
2193 | gnu_result = gnu_loop_stmt; | |
2194 | ||
2195 | pop_stack (&gnu_loop_label_stack); | |
2196 | ||
2197 | return gnu_result; | |
2198 | } | |
2199 | \f | |
2200 | /* Emit statements to establish __gnat_handle_vms_condition as a VMS condition | |
2201 | handler for the current function. */ | |
2202 | ||
2203 | /* This is implemented by issuing a call to the appropriate VMS specific | |
2204 | builtin. To avoid having VMS specific sections in the global gigi decls | |
2205 | array, we maintain the decls of interest here. We can't declare them | |
2206 | inside the function because we must mark them never to be GC'd, which we | |
2207 | can only do at the global level. */ | |
2208 | ||
2209 | static GTY(()) tree vms_builtin_establish_handler_decl = NULL_TREE; | |
2210 | static GTY(()) tree gnat_vms_condition_handler_decl = NULL_TREE; | |
2211 | ||
2212 | static void | |
2213 | establish_gnat_vms_condition_handler (void) | |
2214 | { | |
2215 | tree establish_stmt; | |
2216 | ||
2217 | /* Elaborate the required decls on the first call. Check on the decl for | |
2218 | the gnat condition handler to decide, as this is one we create so we are | |
2219 | sure that it will be non null on subsequent calls. The builtin decl is | |
2220 | looked up so remains null on targets where it is not implemented yet. */ | |
2221 | if (gnat_vms_condition_handler_decl == NULL_TREE) | |
2222 | { | |
2223 | vms_builtin_establish_handler_decl | |
2224 | = builtin_decl_for | |
2225 | (get_identifier ("__builtin_establish_vms_condition_handler")); | |
2226 | ||
2227 | gnat_vms_condition_handler_decl | |
2228 | = create_subprog_decl (get_identifier ("__gnat_handle_vms_condition"), | |
2229 | NULL_TREE, | |
2230 | build_function_type_list (integer_type_node, | |
2231 | ptr_void_type_node, | |
2232 | ptr_void_type_node, | |
2233 | NULL_TREE), | |
2234 | NULL_TREE, 0, 1, 1, 0, Empty); | |
2d5be6c1 EB |
2235 | |
2236 | /* ??? DECL_CONTEXT shouldn't have been set because of DECL_EXTERNAL. */ | |
2237 | DECL_CONTEXT (gnat_vms_condition_handler_decl) = NULL_TREE; | |
a1ab4c31 AC |
2238 | } |
2239 | ||
2240 | /* Do nothing if the establish builtin is not available, which might happen | |
2241 | on targets where the facility is not implemented. */ | |
2242 | if (vms_builtin_establish_handler_decl == NULL_TREE) | |
2243 | return; | |
2244 | ||
2245 | establish_stmt | |
2246 | = build_call_1_expr (vms_builtin_establish_handler_decl, | |
2247 | build_unary_op | |
2248 | (ADDR_EXPR, NULL_TREE, | |
2249 | gnat_vms_condition_handler_decl)); | |
2250 | ||
2251 | add_stmt (establish_stmt); | |
2252 | } | |
2253 | \f | |
2254 | /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We | |
2255 | don't return anything. */ | |
2256 | ||
2257 | static void | |
2258 | Subprogram_Body_to_gnu (Node_Id gnat_node) | |
2259 | { | |
2260 | /* Defining identifier of a parameter to the subprogram. */ | |
2261 | Entity_Id gnat_param; | |
2262 | /* The defining identifier for the subprogram body. Note that if a | |
2263 | specification has appeared before for this body, then the identifier | |
2264 | occurring in that specification will also be a defining identifier and all | |
2265 | the calls to this subprogram will point to that specification. */ | |
2266 | Entity_Id gnat_subprog_id | |
2267 | = (Present (Corresponding_Spec (gnat_node)) | |
2268 | ? Corresponding_Spec (gnat_node) : Defining_Entity (gnat_node)); | |
2269 | /* The FUNCTION_DECL node corresponding to the subprogram spec. */ | |
2270 | tree gnu_subprog_decl; | |
d47d0a8d EB |
2271 | /* Its RESULT_DECL node. */ |
2272 | tree gnu_result_decl; | |
a1ab4c31 AC |
2273 | /* The FUNCTION_TYPE node corresponding to the subprogram spec. */ |
2274 | tree gnu_subprog_type; | |
2275 | tree gnu_cico_list; | |
2276 | tree gnu_result; | |
2277 | VEC(parm_attr,gc) *cache; | |
2278 | ||
2279 | /* If this is a generic object or if it has been eliminated, | |
2280 | ignore it. */ | |
2281 | if (Ekind (gnat_subprog_id) == E_Generic_Procedure | |
2282 | || Ekind (gnat_subprog_id) == E_Generic_Function | |
2283 | || Is_Eliminated (gnat_subprog_id)) | |
2284 | return; | |
2285 | ||
2286 | /* If this subprogram acts as its own spec, define it. Otherwise, just get | |
2287 | the already-elaborated tree node. However, if this subprogram had its | |
2288 | elaboration deferred, we will already have made a tree node for it. So | |
2289 | treat it as not being defined in that case. Such a subprogram cannot | |
2290 | have an address clause or a freeze node, so this test is safe, though it | |
2291 | does disable some otherwise-useful error checking. */ | |
2292 | gnu_subprog_decl | |
2293 | = gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, | |
2294 | Acts_As_Spec (gnat_node) | |
2295 | && !present_gnu_tree (gnat_subprog_id)); | |
d47d0a8d | 2296 | gnu_result_decl = DECL_RESULT (gnu_subprog_decl); |
a1ab4c31 AC |
2297 | gnu_subprog_type = TREE_TYPE (gnu_subprog_decl); |
2298 | ||
d47d0a8d EB |
2299 | /* If the function returns by invisible reference, make it explicit in the |
2300 | function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */ | |
2301 | if (TREE_ADDRESSABLE (gnu_subprog_type)) | |
2302 | { | |
2303 | TREE_TYPE (gnu_result_decl) | |
2304 | = build_reference_type (TREE_TYPE (gnu_result_decl)); | |
2305 | relayout_decl (gnu_result_decl); | |
2306 | } | |
2307 | ||
a1ab4c31 AC |
2308 | /* Propagate the debug mode. */ |
2309 | if (!Needs_Debug_Info (gnat_subprog_id)) | |
2310 | DECL_IGNORED_P (gnu_subprog_decl) = 1; | |
2311 | ||
2312 | /* Set the line number in the decl to correspond to that of the body so that | |
2313 | the line number notes are written correctly. */ | |
2314 | Sloc_to_locus (Sloc (gnat_node), &DECL_SOURCE_LOCATION (gnu_subprog_decl)); | |
2315 | ||
2316 | /* Initialize the information structure for the function. */ | |
2317 | allocate_struct_function (gnu_subprog_decl, false); | |
2318 | DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language | |
2319 | = GGC_CNEW (struct language_function); | |
2320 | ||
2321 | begin_subprog_body (gnu_subprog_decl); | |
2322 | gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type); | |
2323 | ||
2324 | /* If there are Out parameters, we need to ensure that the return statement | |
2325 | properly copies them out. We do this by making a new block and converting | |
2326 | any inner return into a goto to a label at the end of the block. */ | |
2327 | push_stack (&gnu_return_label_stack, NULL_TREE, | |
c172df28 AH |
2328 | gnu_cico_list ? create_artificial_label (input_location) |
2329 | : NULL_TREE); | |
a1ab4c31 AC |
2330 | |
2331 | /* Get a tree corresponding to the code for the subprogram. */ | |
2332 | start_stmt_group (); | |
2333 | gnat_pushlevel (); | |
2334 | ||
2335 | /* See if there are any parameters for which we don't yet have GCC entities. | |
2336 | These must be for Out parameters for which we will be making VAR_DECL | |
2337 | nodes here. Fill them in to TYPE_CI_CO_LIST, which must contain the empty | |
2338 | entry as well. We can match up the entries because TYPE_CI_CO_LIST is in | |
2339 | the order of the parameters. */ | |
2340 | for (gnat_param = First_Formal_With_Extras (gnat_subprog_id); | |
2341 | Present (gnat_param); | |
2342 | gnat_param = Next_Formal_With_Extras (gnat_param)) | |
2343 | if (!present_gnu_tree (gnat_param)) | |
2344 | { | |
2345 | /* Skip any entries that have been already filled in; they must | |
2346 | correspond to In Out parameters. */ | |
2347 | for (; gnu_cico_list && TREE_VALUE (gnu_cico_list); | |
2348 | gnu_cico_list = TREE_CHAIN (gnu_cico_list)) | |
2349 | ; | |
2350 | ||
2351 | /* Do any needed references for padded types. */ | |
2352 | TREE_VALUE (gnu_cico_list) | |
2353 | = convert (TREE_TYPE (TREE_PURPOSE (gnu_cico_list)), | |
2354 | gnat_to_gnu_entity (gnat_param, NULL_TREE, 1)); | |
2355 | } | |
2356 | ||
2357 | /* On VMS, establish our condition handler to possibly turn a condition into | |
2358 | the corresponding exception if the subprogram has a foreign convention or | |
2359 | is exported. | |
2360 | ||
2361 | To ensure proper execution of local finalizations on condition instances, | |
2362 | we must turn a condition into the corresponding exception even if there | |
2363 | is no applicable Ada handler, and need at least one condition handler per | |
2364 | possible call chain involving GNAT code. OTOH, establishing the handler | |
2365 | has a cost so we want to minimize the number of subprograms into which | |
2366 | this happens. The foreign or exported condition is expected to satisfy | |
2367 | all the constraints. */ | |
2368 | if (TARGET_ABI_OPEN_VMS | |
2d5be6c1 EB |
2369 | && (Has_Foreign_Convention (gnat_subprog_id) |
2370 | || Is_Exported (gnat_subprog_id))) | |
a1ab4c31 AC |
2371 | establish_gnat_vms_condition_handler (); |
2372 | ||
2373 | process_decls (Declarations (gnat_node), Empty, Empty, true, true); | |
2374 | ||
2375 | /* Generate the code of the subprogram itself. A return statement will be | |
2376 | present and any Out parameters will be handled there. */ | |
2377 | add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node))); | |
2378 | gnat_poplevel (); | |
2379 | gnu_result = end_stmt_group (); | |
2380 | ||
2381 | /* If we populated the parameter attributes cache, we need to make sure | |
2382 | that the cached expressions are evaluated on all possible paths. */ | |
2383 | cache = DECL_STRUCT_FUNCTION (gnu_subprog_decl)->language->parm_attr_cache; | |
2384 | if (cache) | |
2385 | { | |
6bf68a93 | 2386 | struct parm_attr_d *pa; |
a1ab4c31 AC |
2387 | int i; |
2388 | ||
2389 | start_stmt_group (); | |
2390 | ||
2391 | for (i = 0; VEC_iterate (parm_attr, cache, i, pa); i++) | |
2392 | { | |
2393 | if (pa->first) | |
7fda1596 | 2394 | add_stmt_with_node (pa->first, gnat_node); |
a1ab4c31 | 2395 | if (pa->last) |
7fda1596 | 2396 | add_stmt_with_node (pa->last, gnat_node); |
a1ab4c31 | 2397 | if (pa->length) |
7fda1596 | 2398 | add_stmt_with_node (pa->length, gnat_node); |
a1ab4c31 AC |
2399 | } |
2400 | ||
2401 | add_stmt (gnu_result); | |
2402 | gnu_result = end_stmt_group (); | |
2403 | } | |
2404 | ||
d47d0a8d EB |
2405 | /* If we are dealing with a return from an Ada procedure with parameters |
2406 | passed by copy-in/copy-out, we need to return a record containing the | |
2407 | final values of these parameters. If the list contains only one entry, | |
2408 | return just that entry though. | |
2409 | ||
2410 | For a full description of the copy-in/copy-out parameter mechanism, see | |
2411 | the part of the gnat_to_gnu_entity routine dealing with the translation | |
2412 | of subprograms. | |
2413 | ||
2414 | We need to make a block that contains the definition of that label and | |
2415 | the copying of the return value. It first contains the function, then | |
2416 | the label and copy statement. */ | |
a1ab4c31 AC |
2417 | if (TREE_VALUE (gnu_return_label_stack)) |
2418 | { | |
2419 | tree gnu_retval; | |
2420 | ||
2421 | start_stmt_group (); | |
2422 | gnat_pushlevel (); | |
2423 | add_stmt (gnu_result); | |
2424 | add_stmt (build1 (LABEL_EXPR, void_type_node, | |
2425 | TREE_VALUE (gnu_return_label_stack))); | |
2426 | ||
2427 | gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type); | |
2428 | if (list_length (gnu_cico_list) == 1) | |
2429 | gnu_retval = TREE_VALUE (gnu_cico_list); | |
2430 | else | |
2431 | gnu_retval = gnat_build_constructor (TREE_TYPE (gnu_subprog_type), | |
2432 | gnu_cico_list); | |
2433 | ||
d47d0a8d EB |
2434 | add_stmt_with_node (build_return_expr (gnu_result_decl, gnu_retval), |
2435 | End_Label (Handled_Statement_Sequence (gnat_node))); | |
a1ab4c31 AC |
2436 | gnat_poplevel (); |
2437 | gnu_result = end_stmt_group (); | |
2438 | } | |
2439 | ||
2440 | pop_stack (&gnu_return_label_stack); | |
2441 | ||
2442 | /* Set the end location. */ | |
2443 | Sloc_to_locus | |
2444 | ((Present (End_Label (Handled_Statement_Sequence (gnat_node))) | |
2445 | ? Sloc (End_Label (Handled_Statement_Sequence (gnat_node))) | |
2446 | : Sloc (gnat_node)), | |
2447 | &DECL_STRUCT_FUNCTION (gnu_subprog_decl)->function_end_locus); | |
2448 | ||
a406865a | 2449 | end_subprog_body (gnu_result); |
a1ab4c31 | 2450 | |
f4cd2542 EB |
2451 | /* Finally annotate the parameters and disconnect the trees for parameters |
2452 | that we have turned into variables since they are now unusable. */ | |
a1ab4c31 AC |
2453 | for (gnat_param = First_Formal_With_Extras (gnat_subprog_id); |
2454 | Present (gnat_param); | |
2455 | gnat_param = Next_Formal_With_Extras (gnat_param)) | |
f4cd2542 EB |
2456 | { |
2457 | tree gnu_param = get_gnu_tree (gnat_param); | |
2458 | annotate_object (gnat_param, TREE_TYPE (gnu_param), NULL_TREE, | |
2459 | DECL_BY_REF_P (gnu_param)); | |
2460 | if (TREE_CODE (gnu_param) == VAR_DECL) | |
2461 | save_gnu_tree (gnat_param, NULL_TREE, false); | |
2462 | } | |
a1ab4c31 AC |
2463 | |
2464 | if (DECL_FUNCTION_STUB (gnu_subprog_decl)) | |
2465 | build_function_stub (gnu_subprog_decl, gnat_subprog_id); | |
2466 | ||
2467 | mark_out_of_scope (Defining_Unit_Name (Specification (gnat_node))); | |
2468 | } | |
2469 | \f | |
2470 | /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call | |
2471 | or an N_Procedure_Call_Statement, to a GCC tree, which is returned. | |
2472 | GNU_RESULT_TYPE_P is a pointer to where we should place the result type. | |
0b3467c4 EB |
2473 | If GNU_TARGET is non-null, this must be a function call on the RHS of a |
2474 | N_Assignment_Statement and the result is to be placed into that object. */ | |
a1ab4c31 AC |
2475 | |
2476 | static tree | |
2477 | call_to_gnu (Node_Id gnat_node, tree *gnu_result_type_p, tree gnu_target) | |
2478 | { | |
a1ab4c31 AC |
2479 | /* The GCC node corresponding to the GNAT subprogram name. This can either |
2480 | be a FUNCTION_DECL node if we are dealing with a standard subprogram call, | |
2481 | or an indirect reference expression (an INDIRECT_REF node) pointing to a | |
2482 | subprogram. */ | |
ced57283 | 2483 | tree gnu_subprog = gnat_to_gnu (Name (gnat_node)); |
a1ab4c31 | 2484 | /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */ |
ced57283 EB |
2485 | tree gnu_subprog_type = TREE_TYPE (gnu_subprog); |
2486 | tree gnu_subprog_addr = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_subprog); | |
a1ab4c31 AC |
2487 | Entity_Id gnat_formal; |
2488 | Node_Id gnat_actual; | |
2489 | tree gnu_actual_list = NULL_TREE; | |
2490 | tree gnu_name_list = NULL_TREE; | |
2491 | tree gnu_before_list = NULL_TREE; | |
2492 | tree gnu_after_list = NULL_TREE; | |
ced57283 | 2493 | tree gnu_call; |
0b3467c4 | 2494 | bool went_into_elab_proc = false; |
a1ab4c31 | 2495 | |
a1ab4c31 AC |
2496 | gcc_assert (TREE_CODE (gnu_subprog_type) == FUNCTION_TYPE); |
2497 | ||
ced57283 EB |
2498 | /* If we are calling a stubbed function, raise Program_Error, but Elaborate |
2499 | all our args first. */ | |
2500 | if (TREE_CODE (gnu_subprog) == FUNCTION_DECL && DECL_STUBBED_P (gnu_subprog)) | |
a1ab4c31 | 2501 | { |
ced57283 EB |
2502 | tree call_expr = build_call_raise (PE_Stubbed_Subprogram_Called, |
2503 | gnat_node, N_Raise_Program_Error); | |
2504 | ||
a1ab4c31 AC |
2505 | for (gnat_actual = First_Actual (gnat_node); |
2506 | Present (gnat_actual); | |
2507 | gnat_actual = Next_Actual (gnat_actual)) | |
2508 | add_stmt (gnat_to_gnu (gnat_actual)); | |
2509 | ||
ced57283 EB |
2510 | if (Nkind (gnat_node) == N_Function_Call && !gnu_target) |
2511 | { | |
2512 | *gnu_result_type_p = TREE_TYPE (gnu_subprog_type); | |
2513 | return build1 (NULL_EXPR, TREE_TYPE (gnu_subprog_type), call_expr); | |
2514 | } | |
a1ab4c31 | 2515 | |
ced57283 | 2516 | return call_expr; |
a1ab4c31 AC |
2517 | } |
2518 | ||
a1ab4c31 AC |
2519 | /* The only way we can be making a call via an access type is if Name is an |
2520 | explicit dereference. In that case, get the list of formal args from the | |
ced57283 | 2521 | type the access type is pointing to. Otherwise, get the formals from the |
a1ab4c31 AC |
2522 | entity being called. */ |
2523 | if (Nkind (Name (gnat_node)) == N_Explicit_Dereference) | |
2524 | gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node))); | |
2525 | else if (Nkind (Name (gnat_node)) == N_Attribute_Reference) | |
2526 | /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */ | |
ced57283 | 2527 | gnat_formal = Empty; |
a1ab4c31 AC |
2528 | else |
2529 | gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node))); | |
2530 | ||
0b3467c4 EB |
2531 | /* If we are translating a statement, open a new nesting level that will |
2532 | surround it to declare the temporaries created for the call. */ | |
2533 | if (Nkind (gnat_node) == N_Procedure_Call_Statement || gnu_target) | |
2534 | { | |
2535 | start_stmt_group (); | |
2536 | gnat_pushlevel (); | |
2537 | } | |
2538 | ||
2539 | /* The lifetime of the temporaries created for the call ends with the call | |
2540 | so we can give them the scope of the elaboration routine at top level. */ | |
2541 | else if (!current_function_decl) | |
2542 | { | |
2543 | current_function_decl = TREE_VALUE (gnu_elab_proc_stack); | |
2544 | went_into_elab_proc = true; | |
2545 | } | |
2546 | ||
ced57283 EB |
2547 | /* Create the list of the actual parameters as GCC expects it, namely a |
2548 | chain of TREE_LIST nodes in which the TREE_VALUE field of each node | |
2549 | is an expression and the TREE_PURPOSE field is null. But skip Out | |
2550 | parameters not passed by reference and that need not be copied in. */ | |
a1ab4c31 AC |
2551 | for (gnat_actual = First_Actual (gnat_node); |
2552 | Present (gnat_actual); | |
2553 | gnat_formal = Next_Formal_With_Extras (gnat_formal), | |
2554 | gnat_actual = Next_Actual (gnat_actual)) | |
2555 | { | |
ced57283 EB |
2556 | tree gnu_formal = present_gnu_tree (gnat_formal) |
2557 | ? get_gnu_tree (gnat_formal) : NULL_TREE; | |
a1ab4c31 | 2558 | tree gnu_formal_type = gnat_to_gnu_type (Etype (gnat_formal)); |
c34f3839 EB |
2559 | /* In the Out or In Out case, we must suppress conversions that yield |
2560 | an lvalue but can nevertheless cause the creation of a temporary, | |
2561 | because we need the real object in this case, either to pass its | |
2562 | address if it's passed by reference or as target of the back copy | |
2563 | done after the call if it uses the copy-in copy-out mechanism. | |
2564 | We do it in the In case too, except for an unchecked conversion | |
2565 | because it alone can cause the actual to be misaligned and the | |
2566 | addressability test is applied to the real object. */ | |
a1ab4c31 AC |
2567 | bool suppress_type_conversion |
2568 | = ((Nkind (gnat_actual) == N_Unchecked_Type_Conversion | |
2569 | && Ekind (gnat_formal) != E_In_Parameter) | |
2570 | || (Nkind (gnat_actual) == N_Type_Conversion | |
2571 | && Is_Composite_Type (Underlying_Type (Etype (gnat_formal))))); | |
ced57283 EB |
2572 | Node_Id gnat_name = suppress_type_conversion |
2573 | ? Expression (gnat_actual) : gnat_actual; | |
a1ab4c31 AC |
2574 | tree gnu_name = gnat_to_gnu (gnat_name), gnu_name_type; |
2575 | tree gnu_actual; | |
2576 | ||
2577 | /* If it's possible we may need to use this expression twice, make sure | |
ced57283 | 2578 | that any side-effects are handled via SAVE_EXPRs; likewise if we need |
a1ab4c31 AC |
2579 | to force side-effects before the call. |
2580 | ??? This is more conservative than we need since we don't need to do | |
2581 | this for pass-by-ref with no conversion. */ | |
2582 | if (Ekind (gnat_formal) != E_In_Parameter) | |
7d7a1fe8 | 2583 | gnu_name = gnat_stabilize_reference (gnu_name, true, NULL); |
a1ab4c31 AC |
2584 | |
2585 | /* If we are passing a non-addressable parameter by reference, pass the | |
2586 | address of a copy. In the Out or In Out case, set up to copy back | |
2587 | out after the call. */ | |
2588 | if (gnu_formal | |
2589 | && (DECL_BY_REF_P (gnu_formal) | |
2590 | || (TREE_CODE (gnu_formal) == PARM_DECL | |
2591 | && (DECL_BY_COMPONENT_PTR_P (gnu_formal) | |
2592 | || (DECL_BY_DESCRIPTOR_P (gnu_formal))))) | |
2593 | && (gnu_name_type = gnat_to_gnu_type (Etype (gnat_name))) | |
2594 | && !addressable_p (gnu_name, gnu_name_type)) | |
2595 | { | |
0b3467c4 EB |
2596 | tree gnu_orig = gnu_name, gnu_temp, gnu_stmt; |
2597 | ||
2598 | /* Do not issue warnings for CONSTRUCTORs since this is not a copy | |
2599 | but sort of an instantiation for them. */ | |
2600 | if (TREE_CODE (gnu_name) == CONSTRUCTOR) | |
2601 | ; | |
2602 | ||
2603 | /* If the type is passed by reference, a copy is not allowed. */ | |
2604 | else if (TREE_ADDRESSABLE (gnu_formal_type)) | |
2605 | post_error ("misaligned actual cannot be passed by reference", | |
2606 | gnat_actual); | |
2607 | ||
2608 | /* For users of Starlet we issue a warning because the interface | |
2609 | apparently assumes that by-ref parameters outlive the procedure | |
2610 | invocation. The code still will not work as intended, but we | |
2611 | cannot do much better since low-level parts of the back-end | |
2612 | would allocate temporaries at will because of the misalignment | |
2613 | if we did not do so here. */ | |
2614 | else if (Is_Valued_Procedure (Entity (Name (gnat_node)))) | |
2615 | { | |
2616 | post_error | |
2617 | ("?possible violation of implicit assumption", gnat_actual); | |
2618 | post_error_ne | |
2619 | ("?made by pragma Import_Valued_Procedure on &", gnat_actual, | |
2620 | Entity (Name (gnat_node))); | |
2621 | post_error_ne ("?because of misalignment of &", gnat_actual, | |
2622 | gnat_formal); | |
2623 | } | |
a1ab4c31 | 2624 | |
56fe7b05 EB |
2625 | /* If the actual type of the object is already the nominal type, |
2626 | we have nothing to do, except if the size is self-referential | |
2627 | in which case we'll remove the unpadding below. */ | |
2628 | if (TREE_TYPE (gnu_name) == gnu_name_type | |
2629 | && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_name_type))) | |
2630 | ; | |
2631 | ||
0b3467c4 | 2632 | /* Otherwise remove the unpadding from all the objects. */ |
56fe7b05 | 2633 | else if (TREE_CODE (gnu_name) == COMPONENT_REF |
315cff15 EB |
2634 | && TYPE_IS_PADDING_P |
2635 | (TREE_TYPE (TREE_OPERAND (gnu_name, 0)))) | |
0b3467c4 | 2636 | gnu_orig = gnu_name = TREE_OPERAND (gnu_name, 0); |
a1ab4c31 AC |
2637 | |
2638 | /* Otherwise convert to the nominal type of the object if it's | |
2639 | a record type. There are several cases in which we need to | |
2640 | make the temporary using this type instead of the actual type | |
2641 | of the object if they are distinct, because the expectations | |
2642 | of the callee would otherwise not be met: | |
2643 | - if it's a justified modular type, | |
2644 | - if the actual type is a smaller packable version of it. */ | |
2645 | else if (TREE_CODE (gnu_name_type) == RECORD_TYPE | |
2646 | && (TYPE_JUSTIFIED_MODULAR_P (gnu_name_type) | |
2647 | || smaller_packable_type_p (TREE_TYPE (gnu_name), | |
56fe7b05 | 2648 | gnu_name_type))) |
a1ab4c31 AC |
2649 | gnu_name = convert (gnu_name_type, gnu_name); |
2650 | ||
0b3467c4 EB |
2651 | /* Create an explicit temporary holding the copy. This ensures that |
2652 | its lifetime is as narrow as possible around a statement. */ | |
2653 | gnu_temp = create_var_decl (create_tmp_var_name ("A"), NULL_TREE, | |
2654 | TREE_TYPE (gnu_name), NULL_TREE, false, | |
2655 | false, false, false, NULL, Empty); | |
2656 | DECL_ARTIFICIAL (gnu_temp) = 1; | |
2657 | DECL_IGNORED_P (gnu_temp) = 1; | |
cb3d597d | 2658 | |
0b3467c4 EB |
2659 | /* But initialize it on the fly like for an implicit temporary as |
2660 | we aren't necessarily dealing with a statement. */ | |
2661 | gnu_stmt | |
2662 | = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_name); | |
2663 | set_expr_location_from_node (gnu_stmt, gnat_actual); | |
cb3d597d | 2664 | |
0b3467c4 EB |
2665 | /* From now on, the real object is the temporary. */ |
2666 | gnu_name = build2 (COMPOUND_EXPR, TREE_TYPE (gnu_name), gnu_stmt, | |
2667 | gnu_temp); | |
cb3d597d | 2668 | |
ced57283 | 2669 | /* Set up to move the copy back to the original if needed. */ |
a1ab4c31 AC |
2670 | if (Ekind (gnat_formal) != E_In_Parameter) |
2671 | { | |
0b3467c4 EB |
2672 | gnu_stmt = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_orig, |
2673 | gnu_temp); | |
2674 | set_expr_location_from_node (gnu_stmt, gnat_node); | |
2675 | append_to_statement_list (gnu_stmt, &gnu_after_list); | |
a1ab4c31 AC |
2676 | } |
2677 | } | |
2678 | ||
2679 | /* Start from the real object and build the actual. */ | |
2680 | gnu_actual = gnu_name; | |
2681 | ||
2682 | /* If this was a procedure call, we may not have removed any padding. | |
2683 | So do it here for the part we will use as an input, if any. */ | |
2684 | if (Ekind (gnat_formal) != E_Out_Parameter | |
a1ab4c31 | 2685 | && TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))) |
c34f3839 EB |
2686 | gnu_actual |
2687 | = convert (get_unpadded_type (Etype (gnat_actual)), gnu_actual); | |
2688 | ||
2689 | /* Put back the conversion we suppressed above in the computation of the | |
2690 | real object. And even if we didn't suppress any conversion there, we | |
2691 | may have suppressed a conversion to the Etype of the actual earlier, | |
2692 | since the parent is a procedure call, so put it back here. */ | |
2693 | if (suppress_type_conversion | |
2694 | && Nkind (gnat_actual) == N_Unchecked_Type_Conversion) | |
2695 | gnu_actual | |
2696 | = unchecked_convert (gnat_to_gnu_type (Etype (gnat_actual)), | |
2697 | gnu_actual, No_Truncation (gnat_actual)); | |
a1ab4c31 | 2698 | else |
c34f3839 EB |
2699 | gnu_actual |
2700 | = convert (gnat_to_gnu_type (Etype (gnat_actual)), gnu_actual); | |
2701 | ||
2702 | /* Make sure that the actual is in range of the formal's type. */ | |
2703 | if (Ekind (gnat_formal) != E_Out_Parameter | |
2704 | && Do_Range_Check (gnat_actual)) | |
2705 | gnu_actual | |
2706 | = emit_range_check (gnu_actual, Etype (gnat_formal), gnat_actual); | |
a1ab4c31 | 2707 | |
a1ab4c31 AC |
2708 | /* Unless this is an In parameter, we must remove any justified modular |
2709 | building from GNU_NAME to get an lvalue. */ | |
2710 | if (Ekind (gnat_formal) != E_In_Parameter | |
2711 | && TREE_CODE (gnu_name) == CONSTRUCTOR | |
2712 | && TREE_CODE (TREE_TYPE (gnu_name)) == RECORD_TYPE | |
2713 | && TYPE_JUSTIFIED_MODULAR_P (TREE_TYPE (gnu_name))) | |
c34f3839 EB |
2714 | gnu_name |
2715 | = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_name))), gnu_name); | |
a1ab4c31 AC |
2716 | |
2717 | /* If we have not saved a GCC object for the formal, it means it is an | |
ced57283 | 2718 | Out parameter not passed by reference and that need not be copied in. |
0b3467c4 | 2719 | Otherwise, first see if the parameter is passed by reference. */ |
a1ab4c31 AC |
2720 | if (gnu_formal |
2721 | && TREE_CODE (gnu_formal) == PARM_DECL | |
2722 | && DECL_BY_REF_P (gnu_formal)) | |
2723 | { | |
2724 | if (Ekind (gnat_formal) != E_In_Parameter) | |
2725 | { | |
2726 | /* In Out or Out parameters passed by reference don't use the | |
2727 | copy-in copy-out mechanism so the address of the real object | |
2728 | must be passed to the function. */ | |
2729 | gnu_actual = gnu_name; | |
2730 | ||
2731 | /* If we have a padded type, be sure we've removed padding. */ | |
0b3467c4 | 2732 | if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_actual))) |
a1ab4c31 AC |
2733 | gnu_actual = convert (get_unpadded_type (Etype (gnat_actual)), |
2734 | gnu_actual); | |
2735 | ||
2736 | /* If we have the constructed subtype of an aliased object | |
2737 | with an unconstrained nominal subtype, the type of the | |
2738 | actual includes the template, although it is formally | |
2739 | constrained. So we need to convert it back to the real | |
2740 | constructed subtype to retrieve the constrained part | |
2741 | and takes its address. */ | |
2742 | if (TREE_CODE (TREE_TYPE (gnu_actual)) == RECORD_TYPE | |
2743 | && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (gnu_actual)) | |
a1ab4c31 AC |
2744 | && Is_Constr_Subt_For_UN_Aliased (Etype (gnat_actual)) |
2745 | && Is_Array_Type (Etype (gnat_actual))) | |
2746 | gnu_actual = convert (gnat_to_gnu_type (Etype (gnat_actual)), | |
2747 | gnu_actual); | |
2748 | } | |
2749 | ||
0b3467c4 EB |
2750 | /* There is no need to convert the actual to the formal's type before |
2751 | taking its address. The only exception is for unconstrained array | |
2752 | types because of the way we build fat pointers. */ | |
2753 | else if (TREE_CODE (gnu_formal_type) == UNCONSTRAINED_ARRAY_TYPE) | |
2754 | gnu_actual = convert (gnu_formal_type, gnu_actual); | |
2755 | ||
a1ab4c31 | 2756 | /* The symmetry of the paths to the type of an entity is broken here |
1e17ef87 | 2757 | since arguments don't know that they will be passed by ref. */ |
a1ab4c31 AC |
2758 | gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal)); |
2759 | gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual); | |
2760 | } | |
2761 | else if (gnu_formal | |
2762 | && TREE_CODE (gnu_formal) == PARM_DECL | |
2763 | && DECL_BY_COMPONENT_PTR_P (gnu_formal)) | |
2764 | { | |
2765 | gnu_formal_type = TREE_TYPE (get_gnu_tree (gnat_formal)); | |
2766 | gnu_actual = maybe_implicit_deref (gnu_actual); | |
2767 | gnu_actual = maybe_unconstrained_array (gnu_actual); | |
2768 | ||
315cff15 | 2769 | if (TYPE_IS_PADDING_P (gnu_formal_type)) |
a1ab4c31 AC |
2770 | { |
2771 | gnu_formal_type = TREE_TYPE (TYPE_FIELDS (gnu_formal_type)); | |
2772 | gnu_actual = convert (gnu_formal_type, gnu_actual); | |
2773 | } | |
2774 | ||
2775 | /* Take the address of the object and convert to the proper pointer | |
2776 | type. We'd like to actually compute the address of the beginning | |
2777 | of the array using an ADDR_EXPR of an ARRAY_REF, but there's a | |
2778 | possibility that the ARRAY_REF might return a constant and we'd be | |
2779 | getting the wrong address. Neither approach is exactly correct, | |
2780 | but this is the most likely to work in all cases. */ | |
0b3467c4 | 2781 | gnu_actual = build_unary_op (ADDR_EXPR, gnu_formal_type, gnu_actual); |
a1ab4c31 AC |
2782 | } |
2783 | else if (gnu_formal | |
2784 | && TREE_CODE (gnu_formal) == PARM_DECL | |
2785 | && DECL_BY_DESCRIPTOR_P (gnu_formal)) | |
2786 | { | |
0b3467c4 EB |
2787 | gnu_actual = convert (gnu_formal_type, gnu_actual); |
2788 | ||
ced57283 | 2789 | /* If this is 'Null_Parameter, pass a zero descriptor. */ |
a1ab4c31 AC |
2790 | if ((TREE_CODE (gnu_actual) == INDIRECT_REF |
2791 | || TREE_CODE (gnu_actual) == UNCONSTRAINED_ARRAY_REF) | |
2792 | && TREE_PRIVATE (gnu_actual)) | |
ced57283 EB |
2793 | gnu_actual |
2794 | = convert (DECL_ARG_TYPE (gnu_formal), integer_zero_node); | |
a1ab4c31 AC |
2795 | else |
2796 | gnu_actual = build_unary_op (ADDR_EXPR, NULL_TREE, | |
2797 | fill_vms_descriptor (gnu_actual, | |
819fad69 AC |
2798 | gnat_formal, |
2799 | gnat_actual)); | |
a1ab4c31 AC |
2800 | } |
2801 | else | |
2802 | { | |
ced57283 | 2803 | tree gnu_size; |
a1ab4c31 AC |
2804 | |
2805 | if (Ekind (gnat_formal) != E_In_Parameter) | |
2806 | gnu_name_list = tree_cons (NULL_TREE, gnu_name, gnu_name_list); | |
2807 | ||
ced57283 | 2808 | if (!(gnu_formal && TREE_CODE (gnu_formal) == PARM_DECL)) |
932c8650 EB |
2809 | { |
2810 | /* Make sure side-effects are evaluated before the call. */ | |
2811 | if (TREE_SIDE_EFFECTS (gnu_name)) | |
2812 | append_to_statement_list (gnu_name, &gnu_before_list); | |
2813 | continue; | |
2814 | } | |
a1ab4c31 | 2815 | |
0b3467c4 EB |
2816 | gnu_actual = convert (gnu_formal_type, gnu_actual); |
2817 | ||
a1ab4c31 AC |
2818 | /* If this is 'Null_Parameter, pass a zero even though we are |
2819 | dereferencing it. */ | |
ced57283 EB |
2820 | if (TREE_CODE (gnu_actual) == INDIRECT_REF |
2821 | && TREE_PRIVATE (gnu_actual) | |
2822 | && (gnu_size = TYPE_SIZE (TREE_TYPE (gnu_actual))) | |
2823 | && TREE_CODE (gnu_size) == INTEGER_CST | |
2824 | && compare_tree_int (gnu_size, BITS_PER_WORD) <= 0) | |
a1ab4c31 AC |
2825 | gnu_actual |
2826 | = unchecked_convert (DECL_ARG_TYPE (gnu_formal), | |
2827 | convert (gnat_type_for_size | |
ced57283 | 2828 | (TREE_INT_CST_LOW (gnu_size), 1), |
a1ab4c31 AC |
2829 | integer_zero_node), |
2830 | false); | |
2831 | else | |
2832 | gnu_actual = convert (DECL_ARG_TYPE (gnu_formal), gnu_actual); | |
2833 | } | |
2834 | ||
2835 | gnu_actual_list = tree_cons (NULL_TREE, gnu_actual, gnu_actual_list); | |
2836 | } | |
2837 | ||
ced57283 EB |
2838 | gnu_call = build_call_list (TREE_TYPE (gnu_subprog_type), gnu_subprog_addr, |
2839 | nreverse (gnu_actual_list)); | |
2840 | set_expr_location_from_node (gnu_call, gnat_node); | |
a1ab4c31 | 2841 | |
d47d0a8d EB |
2842 | /* If it's a function call, the result is the call expression unless a target |
2843 | is specified, in which case we copy the result into the target and return | |
2844 | the assignment statement. */ | |
2845 | if (Nkind (gnat_node) == N_Function_Call) | |
a1ab4c31 | 2846 | { |
ced57283 | 2847 | tree gnu_result = gnu_call; |
a1ab4c31 | 2848 | |
d47d0a8d EB |
2849 | /* If the function returns an unconstrained array or by direct reference, |
2850 | we have to dereference the pointer. */ | |
2851 | if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type) | |
2852 | || TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type)) | |
a1ab4c31 AC |
2853 | gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result); |
2854 | ||
2855 | if (gnu_target) | |
d47d0a8d | 2856 | { |
0b3467c4 EB |
2857 | Node_Id gnat_parent = Parent (gnat_node); |
2858 | enum tree_code op_code; | |
2859 | ||
2860 | /* If range check is needed, emit code to generate it. */ | |
2861 | if (Do_Range_Check (gnat_node)) | |
2862 | gnu_result | |
2863 | = emit_range_check (gnu_result, Etype (Name (gnat_parent)), | |
2864 | gnat_parent); | |
2865 | ||
d47d0a8d EB |
2866 | /* ??? If the return type has non-constant size, then force the |
2867 | return slot optimization as we would not be able to generate | |
2868 | a temporary. That's what has been done historically. */ | |
2869 | if (TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_subprog_type)))) | |
2870 | op_code = MODIFY_EXPR; | |
2871 | else | |
2872 | op_code = INIT_EXPR; | |
2873 | ||
2874 | gnu_result | |
2875 | = build_binary_op (op_code, NULL_TREE, gnu_target, gnu_result); | |
0b3467c4 EB |
2876 | add_stmt_with_node (gnu_result, gnat_parent); |
2877 | gnat_poplevel (); | |
2878 | gnu_result = end_stmt_group (); | |
d47d0a8d | 2879 | } |
a1ab4c31 | 2880 | else |
0b3467c4 EB |
2881 | { |
2882 | if (went_into_elab_proc) | |
2883 | current_function_decl = NULL_TREE; | |
2884 | *gnu_result_type_p = get_unpadded_type (Etype (gnat_node)); | |
2885 | } | |
a1ab4c31 AC |
2886 | |
2887 | return gnu_result; | |
2888 | } | |
2889 | ||
d47d0a8d EB |
2890 | /* If this is the case where the GNAT tree contains a procedure call but the |
2891 | Ada procedure has copy-in/copy-out parameters, then the special parameter | |
2892 | passing mechanism must be used. */ | |
2893 | if (TYPE_CI_CO_LIST (gnu_subprog_type)) | |
a1ab4c31 | 2894 | { |
0b3467c4 EB |
2895 | /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/ |
2896 | copy-out parameters. */ | |
a09d56d8 EB |
2897 | tree gnu_cico_list = TYPE_CI_CO_LIST (gnu_subprog_type); |
2898 | const int length = list_length (gnu_cico_list); | |
a1ab4c31 AC |
2899 | |
2900 | if (length > 1) | |
2901 | { | |
0b3467c4 EB |
2902 | tree gnu_temp, gnu_stmt; |
2903 | ||
ced57283 | 2904 | /* The call sequence must contain one and only one call, even though |
0b3467c4 EB |
2905 | the function is pure. Save the result into a temporary. */ |
2906 | gnu_temp = create_var_decl (create_tmp_var_name ("R"), NULL_TREE, | |
2907 | TREE_TYPE (gnu_call), NULL_TREE, false, | |
2908 | false, false, false, NULL, Empty); | |
2909 | DECL_ARTIFICIAL (gnu_temp) = 1; | |
2910 | DECL_IGNORED_P (gnu_temp) = 1; | |
2911 | ||
2912 | gnu_stmt | |
2913 | = build_binary_op (INIT_EXPR, NULL_TREE, gnu_temp, gnu_call); | |
2914 | set_expr_location_from_node (gnu_stmt, gnat_node); | |
2915 | ||
2916 | /* Add the call statement to the list and start from its result. */ | |
2917 | append_to_statement_list (gnu_stmt, &gnu_before_list); | |
2918 | gnu_call = gnu_temp; | |
2919 | ||
a1ab4c31 | 2920 | gnu_name_list = nreverse (gnu_name_list); |
a1ab4c31 AC |
2921 | } |
2922 | ||
2923 | if (Nkind (Name (gnat_node)) == N_Explicit_Dereference) | |
2924 | gnat_formal = First_Formal_With_Extras (Etype (Name (gnat_node))); | |
2925 | else | |
2926 | gnat_formal = First_Formal_With_Extras (Entity (Name (gnat_node))); | |
2927 | ||
2928 | for (gnat_actual = First_Actual (gnat_node); | |
2929 | Present (gnat_actual); | |
2930 | gnat_formal = Next_Formal_With_Extras (gnat_formal), | |
2931 | gnat_actual = Next_Actual (gnat_actual)) | |
2932 | /* If we are dealing with a copy in copy out parameter, we must | |
2933 | retrieve its value from the record returned in the call. */ | |
2934 | if (!(present_gnu_tree (gnat_formal) | |
2935 | && TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL | |
2936 | && (DECL_BY_REF_P (get_gnu_tree (gnat_formal)) | |
2937 | || (TREE_CODE (get_gnu_tree (gnat_formal)) == PARM_DECL | |
2938 | && ((DECL_BY_COMPONENT_PTR_P (get_gnu_tree (gnat_formal)) | |
2939 | || (DECL_BY_DESCRIPTOR_P | |
2940 | (get_gnu_tree (gnat_formal)))))))) | |
2941 | && Ekind (gnat_formal) != E_In_Parameter) | |
2942 | { | |
2943 | /* Get the value to assign to this Out or In Out parameter. It is | |
2944 | either the result of the function if there is only a single such | |
2945 | parameter or the appropriate field from the record returned. */ | |
2946 | tree gnu_result | |
ced57283 EB |
2947 | = length == 1 |
2948 | ? gnu_call | |
2949 | : build_component_ref (gnu_call, NULL_TREE, | |
a09d56d8 | 2950 | TREE_PURPOSE (gnu_cico_list), false); |
a1ab4c31 AC |
2951 | |
2952 | /* If the actual is a conversion, get the inner expression, which | |
2953 | will be the real destination, and convert the result to the | |
2954 | type of the actual parameter. */ | |
2955 | tree gnu_actual | |
2956 | = maybe_unconstrained_array (TREE_VALUE (gnu_name_list)); | |
2957 | ||
2958 | /* If the result is a padded type, remove the padding. */ | |
315cff15 | 2959 | if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))) |
ced57283 EB |
2960 | gnu_result |
2961 | = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))), | |
2962 | gnu_result); | |
a1ab4c31 AC |
2963 | |
2964 | /* If the actual is a type conversion, the real target object is | |
2965 | denoted by the inner Expression and we need to convert the | |
2966 | result to the associated type. | |
2967 | We also need to convert our gnu assignment target to this type | |
2968 | if the corresponding GNU_NAME was constructed from the GNAT | |
2969 | conversion node and not from the inner Expression. */ | |
2970 | if (Nkind (gnat_actual) == N_Type_Conversion) | |
2971 | { | |
2972 | gnu_result | |
2973 | = convert_with_check | |
2974 | (Etype (Expression (gnat_actual)), gnu_result, | |
2975 | Do_Overflow_Check (gnat_actual), | |
2976 | Do_Range_Check (Expression (gnat_actual)), | |
10069d53 | 2977 | Float_Truncate (gnat_actual), gnat_actual); |
a1ab4c31 AC |
2978 | |
2979 | if (!Is_Composite_Type (Underlying_Type (Etype (gnat_formal)))) | |
2980 | gnu_actual = convert (TREE_TYPE (gnu_result), gnu_actual); | |
2981 | } | |
2982 | ||
2983 | /* Unchecked conversions as actuals for Out parameters are not | |
2984 | allowed in user code because they are not variables, but do | |
2985 | occur in front-end expansions. The associated GNU_NAME is | |
2986 | always obtained from the inner expression in such cases. */ | |
2987 | else if (Nkind (gnat_actual) == N_Unchecked_Type_Conversion) | |
2988 | gnu_result = unchecked_convert (TREE_TYPE (gnu_actual), | |
2989 | gnu_result, | |
2990 | No_Truncation (gnat_actual)); | |
2991 | else | |
2992 | { | |
2993 | if (Do_Range_Check (gnat_actual)) | |
10069d53 EB |
2994 | gnu_result |
2995 | = emit_range_check (gnu_result, Etype (gnat_actual), | |
2996 | gnat_actual); | |
a1ab4c31 AC |
2997 | |
2998 | if (!(!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_actual))) | |
2999 | && TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (gnu_result))))) | |
3000 | gnu_result = convert (TREE_TYPE (gnu_actual), gnu_result); | |
3001 | } | |
3002 | ||
03b6f8a2 EB |
3003 | /* Undo wrapping of boolean rvalues. */ |
3004 | if (TREE_CODE (gnu_actual) == NE_EXPR | |
3005 | && TREE_CODE (get_base_type (TREE_TYPE (gnu_actual))) | |
3006 | == BOOLEAN_TYPE | |
3007 | && integer_zerop (TREE_OPERAND (gnu_actual, 1))) | |
3008 | gnu_actual = TREE_OPERAND (gnu_actual, 0); | |
a1ab4c31 AC |
3009 | gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE, |
3010 | gnu_actual, gnu_result); | |
e650b83a | 3011 | set_expr_location_from_node (gnu_result, gnat_node); |
a1ab4c31 | 3012 | append_to_statement_list (gnu_result, &gnu_before_list); |
a09d56d8 | 3013 | gnu_cico_list = TREE_CHAIN (gnu_cico_list); |
a1ab4c31 AC |
3014 | gnu_name_list = TREE_CHAIN (gnu_name_list); |
3015 | } | |
ced57283 | 3016 | } |
a1ab4c31 | 3017 | else |
ced57283 | 3018 | append_to_statement_list (gnu_call, &gnu_before_list); |
a1ab4c31 AC |
3019 | |
3020 | append_to_statement_list (gnu_after_list, &gnu_before_list); | |
ced57283 | 3021 | |
0b3467c4 EB |
3022 | add_stmt (gnu_before_list); |
3023 | gnat_poplevel (); | |
3024 | return end_stmt_group (); | |
a1ab4c31 AC |
3025 | } |
3026 | \f | |
3027 | /* Subroutine of gnat_to_gnu to translate gnat_node, an | |
3028 | N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */ | |
3029 | ||
3030 | static tree | |
3031 | Handled_Sequence_Of_Statements_to_gnu (Node_Id gnat_node) | |
3032 | { | |
3033 | tree gnu_jmpsave_decl = NULL_TREE; | |
3034 | tree gnu_jmpbuf_decl = NULL_TREE; | |
3035 | /* If just annotating, ignore all EH and cleanups. */ | |
3036 | bool gcc_zcx = (!type_annotate_only | |
3037 | && Present (Exception_Handlers (gnat_node)) | |
3038 | && Exception_Mechanism == Back_End_Exceptions); | |
3039 | bool setjmp_longjmp | |
3040 | = (!type_annotate_only && Present (Exception_Handlers (gnat_node)) | |
3041 | && Exception_Mechanism == Setjmp_Longjmp); | |
3042 | bool at_end = !type_annotate_only && Present (At_End_Proc (gnat_node)); | |
3043 | bool binding_for_block = (at_end || gcc_zcx || setjmp_longjmp); | |
3044 | tree gnu_inner_block; /* The statement(s) for the block itself. */ | |
3045 | tree gnu_result; | |
3046 | tree gnu_expr; | |
3047 | Node_Id gnat_temp; | |
3048 | ||
3049 | /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes | |
3050 | and we have our own SJLJ mechanism. To call the GCC mechanism, we call | |
3051 | add_cleanup, and when we leave the binding, end_stmt_group will create | |
3052 | the TRY_FINALLY_EXPR. | |
3053 | ||
3054 | ??? The region level calls down there have been specifically put in place | |
3055 | for a ZCX context and currently the order in which things are emitted | |
3056 | (region/handlers) is different from the SJLJ case. Instead of putting | |
3057 | other calls with different conditions at other places for the SJLJ case, | |
3058 | it seems cleaner to reorder things for the SJLJ case and generalize the | |
3059 | condition to make it not ZCX specific. | |
3060 | ||
3061 | If there are any exceptions or cleanup processing involved, we need an | |
3062 | outer statement group (for Setjmp_Longjmp) and binding level. */ | |
3063 | if (binding_for_block) | |
3064 | { | |
3065 | start_stmt_group (); | |
3066 | gnat_pushlevel (); | |
3067 | } | |
3068 | ||
3069 | /* If using setjmp_longjmp, make the variables for the setjmp buffer and save | |
3070 | area for address of previous buffer. Do this first since we need to have | |
3071 | the setjmp buf known for any decls in this block. */ | |
3072 | if (setjmp_longjmp) | |
3073 | { | |
3074 | gnu_jmpsave_decl = create_var_decl (get_identifier ("JMPBUF_SAVE"), | |
3075 | NULL_TREE, jmpbuf_ptr_type, | |
3076 | build_call_0_expr (get_jmpbuf_decl), | |
3077 | false, false, false, false, NULL, | |
3078 | gnat_node); | |
3079 | DECL_ARTIFICIAL (gnu_jmpsave_decl) = 1; | |
3080 | ||
3081 | /* The __builtin_setjmp receivers will immediately reinstall it. Now | |
3082 | because of the unstructured form of EH used by setjmp_longjmp, there | |
3083 | might be forward edges going to __builtin_setjmp receivers on which | |
3084 | it is uninitialized, although they will never be actually taken. */ | |
3085 | TREE_NO_WARNING (gnu_jmpsave_decl) = 1; | |
3086 | gnu_jmpbuf_decl = create_var_decl (get_identifier ("JMP_BUF"), | |
3087 | NULL_TREE, jmpbuf_type, | |
3088 | NULL_TREE, false, false, false, false, | |
3089 | NULL, gnat_node); | |
3090 | DECL_ARTIFICIAL (gnu_jmpbuf_decl) = 1; | |
3091 | ||
3092 | set_block_jmpbuf_decl (gnu_jmpbuf_decl); | |
3093 | ||
3094 | /* When we exit this block, restore the saved value. */ | |
3095 | add_cleanup (build_call_1_expr (set_jmpbuf_decl, gnu_jmpsave_decl), | |
3096 | End_Label (gnat_node)); | |
3097 | } | |
3098 | ||
3099 | /* If we are to call a function when exiting this block, add a cleanup | |
3100 | to the binding level we made above. Note that add_cleanup is FIFO | |
3101 | so we must register this cleanup after the EH cleanup just above. */ | |
3102 | if (at_end) | |
3103 | add_cleanup (build_call_0_expr (gnat_to_gnu (At_End_Proc (gnat_node))), | |
3104 | End_Label (gnat_node)); | |
3105 | ||
3106 | /* Now build the tree for the declarations and statements inside this block. | |
3107 | If this is SJLJ, set our jmp_buf as the current buffer. */ | |
3108 | start_stmt_group (); | |
3109 | ||
3110 | if (setjmp_longjmp) | |
3111 | add_stmt (build_call_1_expr (set_jmpbuf_decl, | |
3112 | build_unary_op (ADDR_EXPR, NULL_TREE, | |
3113 | gnu_jmpbuf_decl))); | |
3114 | ||
3115 | if (Present (First_Real_Statement (gnat_node))) | |
3116 | process_decls (Statements (gnat_node), Empty, | |
3117 | First_Real_Statement (gnat_node), true, true); | |
3118 | ||
3119 | /* Generate code for each statement in the block. */ | |
3120 | for (gnat_temp = (Present (First_Real_Statement (gnat_node)) | |
3121 | ? First_Real_Statement (gnat_node) | |
3122 | : First (Statements (gnat_node))); | |
3123 | Present (gnat_temp); gnat_temp = Next (gnat_temp)) | |
3124 | add_stmt (gnat_to_gnu (gnat_temp)); | |
3125 | gnu_inner_block = end_stmt_group (); | |
3126 | ||
3127 | /* Now generate code for the two exception models, if either is relevant for | |
3128 | this block. */ | |
3129 | if (setjmp_longjmp) | |
3130 | { | |
3131 | tree *gnu_else_ptr = 0; | |
3132 | tree gnu_handler; | |
3133 | ||
3134 | /* Make a binding level for the exception handling declarations and code | |
3135 | and set up gnu_except_ptr_stack for the handlers to use. */ | |
3136 | start_stmt_group (); | |
3137 | gnat_pushlevel (); | |
3138 | ||
3139 | push_stack (&gnu_except_ptr_stack, NULL_TREE, | |
3140 | create_var_decl (get_identifier ("EXCEPT_PTR"), | |
3141 | NULL_TREE, | |
3142 | build_pointer_type (except_type_node), | |
3143 | build_call_0_expr (get_excptr_decl), false, | |
3144 | false, false, false, NULL, gnat_node)); | |
3145 | ||
3146 | /* Generate code for each handler. The N_Exception_Handler case does the | |
3147 | real work and returns a COND_EXPR for each handler, which we chain | |
3148 | together here. */ | |
3149 | for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node)); | |
3150 | Present (gnat_temp); gnat_temp = Next_Non_Pragma (gnat_temp)) | |
3151 | { | |
3152 | gnu_expr = gnat_to_gnu (gnat_temp); | |
3153 | ||
3154 | /* If this is the first one, set it as the outer one. Otherwise, | |
3155 | point the "else" part of the previous handler to us. Then point | |
3156 | to our "else" part. */ | |
3157 | if (!gnu_else_ptr) | |
3158 | add_stmt (gnu_expr); | |
3159 | else | |
3160 | *gnu_else_ptr = gnu_expr; | |
3161 | ||
3162 | gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr); | |
3163 | } | |
3164 | ||
3165 | /* If none of the exception handlers did anything, re-raise but do not | |
3166 | defer abortion. */ | |
3167 | gnu_expr = build_call_1_expr (raise_nodefer_decl, | |
3168 | TREE_VALUE (gnu_except_ptr_stack)); | |
4fd263a6 OH |
3169 | set_expr_location_from_node |
3170 | (gnu_expr, | |
3171 | Present (End_Label (gnat_node)) ? End_Label (gnat_node) : gnat_node); | |
a1ab4c31 AC |
3172 | |
3173 | if (gnu_else_ptr) | |
3174 | *gnu_else_ptr = gnu_expr; | |
3175 | else | |
3176 | add_stmt (gnu_expr); | |
3177 | ||
3178 | /* End the binding level dedicated to the exception handlers and get the | |
3179 | whole statement group. */ | |
3180 | pop_stack (&gnu_except_ptr_stack); | |
3181 | gnat_poplevel (); | |
3182 | gnu_handler = end_stmt_group (); | |
3183 | ||
3184 | /* If the setjmp returns 1, we restore our incoming longjmp value and | |
3185 | then check the handlers. */ | |
3186 | start_stmt_group (); | |
3187 | add_stmt_with_node (build_call_1_expr (set_jmpbuf_decl, | |
3188 | gnu_jmpsave_decl), | |
3189 | gnat_node); | |
3190 | add_stmt (gnu_handler); | |
3191 | gnu_handler = end_stmt_group (); | |
3192 | ||
3193 | /* This block is now "if (setjmp) ... <handlers> else <block>". */ | |
3194 | gnu_result = build3 (COND_EXPR, void_type_node, | |
3195 | (build_call_1_expr | |
3196 | (setjmp_decl, | |
3197 | build_unary_op (ADDR_EXPR, NULL_TREE, | |
3198 | gnu_jmpbuf_decl))), | |
3199 | gnu_handler, gnu_inner_block); | |
3200 | } | |
3201 | else if (gcc_zcx) | |
3202 | { | |
3203 | tree gnu_handlers; | |
3204 | ||
3205 | /* First make a block containing the handlers. */ | |
3206 | start_stmt_group (); | |
3207 | for (gnat_temp = First_Non_Pragma (Exception_Handlers (gnat_node)); | |
3208 | Present (gnat_temp); | |
3209 | gnat_temp = Next_Non_Pragma (gnat_temp)) | |
3210 | add_stmt (gnat_to_gnu (gnat_temp)); | |
3211 | gnu_handlers = end_stmt_group (); | |
3212 | ||
3213 | /* Now make the TRY_CATCH_EXPR for the block. */ | |
3214 | gnu_result = build2 (TRY_CATCH_EXPR, void_type_node, | |
3215 | gnu_inner_block, gnu_handlers); | |
3216 | } | |
3217 | else | |
3218 | gnu_result = gnu_inner_block; | |
3219 | ||
3220 | /* Now close our outer block, if we had to make one. */ | |
3221 | if (binding_for_block) | |
3222 | { | |
3223 | add_stmt (gnu_result); | |
3224 | gnat_poplevel (); | |
3225 | gnu_result = end_stmt_group (); | |
3226 | } | |
3227 | ||
3228 | return gnu_result; | |
3229 | } | |
3230 | \f | |
3231 | /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler, | |
3232 | to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp | |
3233 | exception handling. */ | |
3234 | ||
3235 | static tree | |
3236 | Exception_Handler_to_gnu_sjlj (Node_Id gnat_node) | |
3237 | { | |
3238 | /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make | |
3239 | an "if" statement to select the proper exceptions. For "Others", exclude | |
3240 | exceptions where Handled_By_Others is nonzero unless the All_Others flag | |
3241 | is set. For "Non-ada", accept an exception if "Lang" is 'V'. */ | |
3242 | tree gnu_choice = integer_zero_node; | |
3243 | tree gnu_body = build_stmt_group (Statements (gnat_node), false); | |
3244 | Node_Id gnat_temp; | |
3245 | ||
3246 | for (gnat_temp = First (Exception_Choices (gnat_node)); | |
3247 | gnat_temp; gnat_temp = Next (gnat_temp)) | |
3248 | { | |
3249 | tree this_choice; | |
3250 | ||
3251 | if (Nkind (gnat_temp) == N_Others_Choice) | |
3252 | { | |
3253 | if (All_Others (gnat_temp)) | |
3254 | this_choice = integer_one_node; | |
3255 | else | |
3256 | this_choice | |
3257 | = build_binary_op | |
3258 | (EQ_EXPR, integer_type_node, | |
3259 | convert | |
3260 | (integer_type_node, | |
3261 | build_component_ref | |
3262 | (build_unary_op | |
3263 | (INDIRECT_REF, NULL_TREE, | |
3264 | TREE_VALUE (gnu_except_ptr_stack)), | |
3265 | get_identifier ("not_handled_by_others"), NULL_TREE, | |
3266 | false)), | |
3267 | integer_zero_node); | |
3268 | } | |
3269 | ||
3270 | else if (Nkind (gnat_temp) == N_Identifier | |
3271 | || Nkind (gnat_temp) == N_Expanded_Name) | |
3272 | { | |
3273 | Entity_Id gnat_ex_id = Entity (gnat_temp); | |
3274 | tree gnu_expr; | |
3275 | ||
3276 | /* Exception may be a renaming. Recover original exception which is | |
3277 | the one elaborated and registered. */ | |
3278 | if (Present (Renamed_Object (gnat_ex_id))) | |
3279 | gnat_ex_id = Renamed_Object (gnat_ex_id); | |
3280 | ||
3281 | gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0); | |
3282 | ||
3283 | this_choice | |
3284 | = build_binary_op | |
3285 | (EQ_EXPR, integer_type_node, TREE_VALUE (gnu_except_ptr_stack), | |
3286 | convert (TREE_TYPE (TREE_VALUE (gnu_except_ptr_stack)), | |
3287 | build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr))); | |
3288 | ||
3289 | /* If this is the distinguished exception "Non_Ada_Error" (and we are | |
3290 | in VMS mode), also allow a non-Ada exception (a VMS condition) t | |
3291 | match. */ | |
3292 | if (Is_Non_Ada_Error (Entity (gnat_temp))) | |
3293 | { | |
3294 | tree gnu_comp | |
3295 | = build_component_ref | |
3296 | (build_unary_op (INDIRECT_REF, NULL_TREE, | |
3297 | TREE_VALUE (gnu_except_ptr_stack)), | |
3298 | get_identifier ("lang"), NULL_TREE, false); | |
3299 | ||
3300 | this_choice | |
3301 | = build_binary_op | |
3302 | (TRUTH_ORIF_EXPR, integer_type_node, | |
3303 | build_binary_op (EQ_EXPR, integer_type_node, gnu_comp, | |
3304 | build_int_cst (TREE_TYPE (gnu_comp), 'V')), | |
3305 | this_choice); | |
3306 | } | |
3307 | } | |
3308 | else | |
3309 | gcc_unreachable (); | |
3310 | ||
3311 | gnu_choice = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
3312 | gnu_choice, this_choice); | |
3313 | } | |
3314 | ||
3315 | return build3 (COND_EXPR, void_type_node, gnu_choice, gnu_body, NULL_TREE); | |
3316 | } | |
3317 | \f | |
3318 | /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler, | |
3319 | to a GCC tree, which is returned. This is the variant for ZCX. */ | |
3320 | ||
3321 | static tree | |
3322 | Exception_Handler_to_gnu_zcx (Node_Id gnat_node) | |
3323 | { | |
3324 | tree gnu_etypes_list = NULL_TREE; | |
3325 | tree gnu_expr; | |
3326 | tree gnu_etype; | |
3327 | tree gnu_current_exc_ptr; | |
3328 | tree gnu_incoming_exc_ptr; | |
3329 | Node_Id gnat_temp; | |
3330 | ||
3331 | /* We build a TREE_LIST of nodes representing what exception types this | |
3332 | handler can catch, with special cases for others and all others cases. | |
3333 | ||
3334 | Each exception type is actually identified by a pointer to the exception | |
1a710808 | 3335 | id, or to a dummy object for "others" and "all others". */ |
a1ab4c31 AC |
3336 | for (gnat_temp = First (Exception_Choices (gnat_node)); |
3337 | gnat_temp; gnat_temp = Next (gnat_temp)) | |
3338 | { | |
3339 | if (Nkind (gnat_temp) == N_Others_Choice) | |
3340 | { | |
3341 | tree gnu_expr | |
3342 | = All_Others (gnat_temp) ? all_others_decl : others_decl; | |
3343 | ||
3344 | gnu_etype | |
3345 | = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr); | |
3346 | } | |
3347 | else if (Nkind (gnat_temp) == N_Identifier | |
3348 | || Nkind (gnat_temp) == N_Expanded_Name) | |
3349 | { | |
3350 | Entity_Id gnat_ex_id = Entity (gnat_temp); | |
3351 | ||
3352 | /* Exception may be a renaming. Recover original exception which is | |
3353 | the one elaborated and registered. */ | |
3354 | if (Present (Renamed_Object (gnat_ex_id))) | |
3355 | gnat_ex_id = Renamed_Object (gnat_ex_id); | |
3356 | ||
3357 | gnu_expr = gnat_to_gnu_entity (gnat_ex_id, NULL_TREE, 0); | |
3358 | gnu_etype = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_expr); | |
3359 | ||
3360 | /* The Non_Ada_Error case for VMS exceptions is handled | |
3361 | by the personality routine. */ | |
3362 | } | |
3363 | else | |
3364 | gcc_unreachable (); | |
3365 | ||
3366 | /* The GCC interface expects NULL to be passed for catch all handlers, so | |
3367 | it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype | |
3368 | is integer_zero_node. It would not work, however, because GCC's | |
3369 | notion of "catch all" is stronger than our notion of "others". Until | |
3370 | we correctly use the cleanup interface as well, doing that would | |
3371 | prevent the "all others" handlers from being seen, because nothing | |
3372 | can be caught beyond a catch all from GCC's point of view. */ | |
3373 | gnu_etypes_list = tree_cons (NULL_TREE, gnu_etype, gnu_etypes_list); | |
3374 | } | |
3375 | ||
3376 | start_stmt_group (); | |
3377 | gnat_pushlevel (); | |
3378 | ||
3379 | /* Expand a call to the begin_handler hook at the beginning of the handler, | |
3380 | and arrange for a call to the end_handler hook to occur on every possible | |
3381 | exit path. | |
3382 | ||
3383 | The hooks expect a pointer to the low level occurrence. This is required | |
3384 | for our stack management scheme because a raise inside the handler pushes | |
3385 | a new occurrence on top of the stack, which means that this top does not | |
3386 | necessarily match the occurrence this handler was dealing with. | |
3387 | ||
1d65f45c | 3388 | __builtin_eh_pointer references the exception occurrence being |
a1ab4c31 AC |
3389 | propagated. Upon handler entry, this is the exception for which the |
3390 | handler is triggered. This might not be the case upon handler exit, | |
3391 | however, as we might have a new occurrence propagated by the handler's | |
3392 | body, and the end_handler hook called as a cleanup in this context. | |
3393 | ||
3394 | We use a local variable to retrieve the incoming value at handler entry | |
3395 | time, and reuse it to feed the end_handler hook's argument at exit. */ | |
1d65f45c RH |
3396 | |
3397 | gnu_current_exc_ptr | |
3398 | = build_call_expr (built_in_decls [BUILT_IN_EH_POINTER], | |
3399 | 1, integer_zero_node); | |
a1ab4c31 AC |
3400 | gnu_incoming_exc_ptr = create_var_decl (get_identifier ("EXPTR"), NULL_TREE, |
3401 | ptr_type_node, gnu_current_exc_ptr, | |
3402 | false, false, false, false, NULL, | |
3403 | gnat_node); | |
3404 | ||
3405 | add_stmt_with_node (build_call_1_expr (begin_handler_decl, | |
3406 | gnu_incoming_exc_ptr), | |
3407 | gnat_node); | |
3408 | /* ??? We don't seem to have an End_Label at hand to set the location. */ | |
3409 | add_cleanup (build_call_1_expr (end_handler_decl, gnu_incoming_exc_ptr), | |
3410 | Empty); | |
3411 | add_stmt_list (Statements (gnat_node)); | |
3412 | gnat_poplevel (); | |
3413 | ||
3414 | return build2 (CATCH_EXPR, void_type_node, gnu_etypes_list, | |
3415 | end_stmt_group ()); | |
3416 | } | |
3417 | \f | |
3418 | /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */ | |
3419 | ||
3420 | static void | |
3421 | Compilation_Unit_to_gnu (Node_Id gnat_node) | |
3422 | { | |
3423 | /* Make the decl for the elaboration procedure. */ | |
3424 | bool body_p = (Defining_Entity (Unit (gnat_node)), | |
3425 | Nkind (Unit (gnat_node)) == N_Package_Body | |
3426 | || Nkind (Unit (gnat_node)) == N_Subprogram_Body); | |
3427 | Entity_Id gnat_unit_entity = Defining_Entity (Unit (gnat_node)); | |
3428 | tree gnu_elab_proc_decl | |
3429 | = create_subprog_decl | |
3430 | (create_concat_name (gnat_unit_entity, | |
3431 | body_p ? "elabb" : "elabs"), | |
3432 | NULL_TREE, void_ftype, NULL_TREE, false, true, false, NULL, | |
3433 | gnat_unit_entity); | |
3434 | struct elab_info *info; | |
3435 | ||
3436 | push_stack (&gnu_elab_proc_stack, NULL_TREE, gnu_elab_proc_decl); | |
3437 | ||
3438 | DECL_ELABORATION_PROC_P (gnu_elab_proc_decl) = 1; | |
3439 | allocate_struct_function (gnu_elab_proc_decl, false); | |
3440 | Sloc_to_locus (Sloc (gnat_unit_entity), &cfun->function_end_locus); | |
a09d56d8 | 3441 | current_function_decl = NULL_TREE; |
a1ab4c31 | 3442 | set_cfun (NULL); |
a09d56d8 EB |
3443 | start_stmt_group (); |
3444 | gnat_pushlevel (); | |
a1ab4c31 | 3445 | |
1e17ef87 | 3446 | /* For a body, first process the spec if there is one. */ |
a1ab4c31 AC |
3447 | if (Nkind (Unit (gnat_node)) == N_Package_Body |
3448 | || (Nkind (Unit (gnat_node)) == N_Subprogram_Body | |
3449 | && !Acts_As_Spec (gnat_node))) | |
3450 | { | |
3451 | add_stmt (gnat_to_gnu (Library_Unit (gnat_node))); | |
3452 | finalize_from_with_types (); | |
3453 | } | |
3454 | ||
3455 | process_inlined_subprograms (gnat_node); | |
3456 | ||
3457 | if (type_annotate_only && gnat_node == Cunit (Main_Unit)) | |
3458 | { | |
3459 | elaborate_all_entities (gnat_node); | |
3460 | ||
3461 | if (Nkind (Unit (gnat_node)) == N_Subprogram_Declaration | |
3462 | || Nkind (Unit (gnat_node)) == N_Generic_Package_Declaration | |
3463 | || Nkind (Unit (gnat_node)) == N_Generic_Subprogram_Declaration) | |
3464 | return; | |
3465 | } | |
3466 | ||
3467 | process_decls (Declarations (Aux_Decls_Node (gnat_node)), Empty, Empty, | |
3468 | true, true); | |
3469 | add_stmt (gnat_to_gnu (Unit (gnat_node))); | |
3470 | ||
3471 | /* Process any pragmas and actions following the unit. */ | |
3472 | add_stmt_list (Pragmas_After (Aux_Decls_Node (gnat_node))); | |
3473 | add_stmt_list (Actions (Aux_Decls_Node (gnat_node))); | |
3474 | finalize_from_with_types (); | |
3475 | ||
3476 | /* Save away what we've made so far and record this potential elaboration | |
3477 | procedure. */ | |
3478 | info = (struct elab_info *) ggc_alloc (sizeof (struct elab_info)); | |
3479 | set_current_block_context (gnu_elab_proc_decl); | |
3480 | gnat_poplevel (); | |
3481 | DECL_SAVED_TREE (gnu_elab_proc_decl) = end_stmt_group (); | |
3482 | info->next = elab_info_list; | |
3483 | info->elab_proc = gnu_elab_proc_decl; | |
3484 | info->gnat_node = gnat_node; | |
3485 | elab_info_list = info; | |
3486 | ||
3487 | /* Generate elaboration code for this unit, if necessary, and say whether | |
3488 | we did or not. */ | |
3489 | pop_stack (&gnu_elab_proc_stack); | |
3490 | ||
3491 | /* Invalidate the global renaming pointers. This is necessary because | |
3492 | stabilization of the renamed entities may create SAVE_EXPRs which | |
3493 | have been tied to a specific elaboration routine just above. */ | |
3494 | invalidate_global_renaming_pointers (); | |
3495 | } | |
3496 | \f | |
4f8a6678 EB |
3497 | /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far |
3498 | as gigi is concerned. This is used to avoid conversions on the LHS. */ | |
c2efda0d EB |
3499 | |
3500 | static bool | |
4f8a6678 | 3501 | unchecked_conversion_nop (Node_Id gnat_node) |
c2efda0d EB |
3502 | { |
3503 | Entity_Id from_type, to_type; | |
3504 | ||
4f8a6678 EB |
3505 | /* The conversion must be on the LHS of an assignment or an actual parameter |
3506 | of a call. Otherwise, even if the conversion was essentially a no-op, it | |
3507 | could de facto ensure type consistency and this should be preserved. */ | |
c2efda0d | 3508 | if (!(Nkind (Parent (gnat_node)) == N_Assignment_Statement |
4f8a6678 EB |
3509 | && Name (Parent (gnat_node)) == gnat_node) |
3510 | && !(Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement | |
3511 | && Name (Parent (gnat_node)) != gnat_node)) | |
c2efda0d EB |
3512 | return false; |
3513 | ||
3514 | from_type = Etype (Expression (gnat_node)); | |
3515 | ||
3516 | /* We're interested in artificial conversions generated by the front-end | |
3517 | to make private types explicit, e.g. in Expand_Assign_Array. */ | |
3518 | if (!Is_Private_Type (from_type)) | |
3519 | return false; | |
3520 | ||
3521 | from_type = Underlying_Type (from_type); | |
3522 | to_type = Etype (gnat_node); | |
3523 | ||
3524 | /* The direct conversion to the underlying type is a no-op. */ | |
3525 | if (to_type == from_type) | |
3526 | return true; | |
3527 | ||
3528 | /* For an array type, the conversion to the PAT is a no-op. */ | |
3529 | if (Ekind (from_type) == E_Array_Subtype | |
3530 | && to_type == Packed_Array_Type (from_type)) | |
3531 | return true; | |
3532 | ||
3533 | return false; | |
3534 | } | |
3535 | ||
3f13dd77 EB |
3536 | /* This function is the driver of the GNAT to GCC tree transformation process. |
3537 | It is the entry point of the tree transformer. GNAT_NODE is the root of | |
3538 | some GNAT tree. Return the root of the corresponding GCC tree. If this | |
3539 | is an expression, return the GCC equivalent of the expression. If this | |
3540 | is a statement, return the statement or add it to the current statement | |
3541 | group, in which case anything returned is to be interpreted as occurring | |
3542 | after anything added. */ | |
a1ab4c31 AC |
3543 | |
3544 | tree | |
3545 | gnat_to_gnu (Node_Id gnat_node) | |
3546 | { | |
3f13dd77 | 3547 | const Node_Kind kind = Nkind (gnat_node); |
a1ab4c31 | 3548 | bool went_into_elab_proc = false; |
1e17ef87 | 3549 | tree gnu_result = error_mark_node; /* Default to no value. */ |
a1ab4c31 | 3550 | tree gnu_result_type = void_type_node; |
3f13dd77 | 3551 | tree gnu_expr, gnu_lhs, gnu_rhs; |
a1ab4c31 AC |
3552 | Node_Id gnat_temp; |
3553 | ||
3554 | /* Save node number for error message and set location information. */ | |
3555 | error_gnat_node = gnat_node; | |
3556 | Sloc_to_locus (Sloc (gnat_node), &input_location); | |
3557 | ||
3f13dd77 EB |
3558 | /* If this node is a statement and we are only annotating types, return an |
3559 | empty statement list. */ | |
3560 | if (type_annotate_only && IN (kind, N_Statement_Other_Than_Procedure_Call)) | |
a1ab4c31 AC |
3561 | return alloc_stmt_list (); |
3562 | ||
3f13dd77 EB |
3563 | /* If this node is a non-static subexpression and we are only annotating |
3564 | types, make this into a NULL_EXPR. */ | |
a1ab4c31 | 3565 | if (type_annotate_only |
3f13dd77 EB |
3566 | && IN (kind, N_Subexpr) |
3567 | && kind != N_Identifier | |
a1ab4c31 AC |
3568 | && !Compile_Time_Known_Value (gnat_node)) |
3569 | return build1 (NULL_EXPR, get_unpadded_type (Etype (gnat_node)), | |
3570 | build_call_raise (CE_Range_Check_Failed, gnat_node, | |
3571 | N_Raise_Constraint_Error)); | |
3572 | ||
3f13dd77 | 3573 | if ((IN (kind, N_Statement_Other_Than_Procedure_Call) |
3f13dd77 EB |
3574 | && kind != N_Null_Statement) |
3575 | || kind == N_Procedure_Call_Statement | |
3576 | || kind == N_Label | |
3577 | || kind == N_Implicit_Label_Declaration | |
3578 | || kind == N_Handled_Sequence_Of_Statements | |
3579 | || (IN (kind, N_Raise_xxx_Error) && Ekind (Etype (gnat_node)) == E_Void)) | |
a1ab4c31 | 3580 | { |
3f13dd77 | 3581 | /* If this is a statement and we are at top level, it must be part of |
a09d56d8 | 3582 | the elaboration procedure, so mark us as being in that procedure. */ |
a1ab4c31 AC |
3583 | if (!current_function_decl) |
3584 | { | |
3585 | current_function_decl = TREE_VALUE (gnu_elab_proc_stack); | |
a1ab4c31 AC |
3586 | went_into_elab_proc = true; |
3587 | } | |
3588 | ||
3f13dd77 EB |
3589 | /* If we are in the elaboration procedure, check if we are violating a |
3590 | No_Elaboration_Code restriction by having a statement there. Don't | |
3591 | check for a possible No_Elaboration_Code restriction violation on | |
3592 | N_Handled_Sequence_Of_Statements, as we want to signal an error on | |
a1ab4c31 AC |
3593 | every nested real statement instead. This also avoids triggering |
3594 | spurious errors on dummy (empty) sequences created by the front-end | |
3595 | for package bodies in some cases. */ | |
a1ab4c31 | 3596 | if (current_function_decl == TREE_VALUE (gnu_elab_proc_stack) |
3f13dd77 | 3597 | && kind != N_Handled_Sequence_Of_Statements) |
a1ab4c31 AC |
3598 | Check_Elaboration_Code_Allowed (gnat_node); |
3599 | } | |
3600 | ||
3f13dd77 | 3601 | switch (kind) |
a1ab4c31 AC |
3602 | { |
3603 | /********************************/ | |
1e17ef87 | 3604 | /* Chapter 2: Lexical Elements */ |
a1ab4c31 AC |
3605 | /********************************/ |
3606 | ||
3607 | case N_Identifier: | |
3608 | case N_Expanded_Name: | |
3609 | case N_Operator_Symbol: | |
3610 | case N_Defining_Identifier: | |
3611 | gnu_result = Identifier_to_gnu (gnat_node, &gnu_result_type); | |
3612 | break; | |
3613 | ||
3614 | case N_Integer_Literal: | |
3615 | { | |
3616 | tree gnu_type; | |
3617 | ||
3618 | /* Get the type of the result, looking inside any padding and | |
3619 | justified modular types. Then get the value in that type. */ | |
3620 | gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3621 | ||
3622 | if (TREE_CODE (gnu_type) == RECORD_TYPE | |
3623 | && TYPE_JUSTIFIED_MODULAR_P (gnu_type)) | |
3624 | gnu_type = TREE_TYPE (TYPE_FIELDS (gnu_type)); | |
3625 | ||
3626 | gnu_result = UI_To_gnu (Intval (gnat_node), gnu_type); | |
3627 | ||
3628 | /* If the result overflows (meaning it doesn't fit in its base type), | |
3629 | abort. We would like to check that the value is within the range | |
3630 | of the subtype, but that causes problems with subtypes whose usage | |
3631 | will raise Constraint_Error and with biased representation, so | |
3632 | we don't. */ | |
3633 | gcc_assert (!TREE_OVERFLOW (gnu_result)); | |
3634 | } | |
3635 | break; | |
3636 | ||
3637 | case N_Character_Literal: | |
3638 | /* If a Entity is present, it means that this was one of the | |
3639 | literals in a user-defined character type. In that case, | |
3640 | just return the value in the CONST_DECL. Otherwise, use the | |
3641 | character code. In that case, the base type should be an | |
3642 | INTEGER_TYPE, but we won't bother checking for that. */ | |
3643 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3644 | if (Present (Entity (gnat_node))) | |
3645 | gnu_result = DECL_INITIAL (get_gnu_tree (Entity (gnat_node))); | |
3646 | else | |
3647 | gnu_result | |
3648 | = build_int_cst_type | |
3649 | (gnu_result_type, UI_To_CC (Char_Literal_Value (gnat_node))); | |
3650 | break; | |
3651 | ||
3652 | case N_Real_Literal: | |
3653 | /* If this is of a fixed-point type, the value we want is the | |
3654 | value of the corresponding integer. */ | |
3655 | if (IN (Ekind (Underlying_Type (Etype (gnat_node))), Fixed_Point_Kind)) | |
3656 | { | |
3657 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3658 | gnu_result = UI_To_gnu (Corresponding_Integer_Value (gnat_node), | |
3659 | gnu_result_type); | |
3660 | gcc_assert (!TREE_OVERFLOW (gnu_result)); | |
3661 | } | |
3662 | ||
3663 | /* We should never see a Vax_Float type literal, since the front end | |
1e17ef87 | 3664 | is supposed to transform these using appropriate conversions. */ |
a1ab4c31 AC |
3665 | else if (Vax_Float (Underlying_Type (Etype (gnat_node)))) |
3666 | gcc_unreachable (); | |
3667 | ||
3668 | else | |
1e17ef87 | 3669 | { |
a1ab4c31 AC |
3670 | Ureal ur_realval = Realval (gnat_node); |
3671 | ||
3672 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3673 | ||
3674 | /* If the real value is zero, so is the result. Otherwise, | |
3675 | convert it to a machine number if it isn't already. That | |
3676 | forces BASE to 0 or 2 and simplifies the rest of our logic. */ | |
3677 | if (UR_Is_Zero (ur_realval)) | |
3678 | gnu_result = convert (gnu_result_type, integer_zero_node); | |
3679 | else | |
3680 | { | |
3681 | if (!Is_Machine_Number (gnat_node)) | |
3682 | ur_realval | |
3683 | = Machine (Base_Type (Underlying_Type (Etype (gnat_node))), | |
3684 | ur_realval, Round_Even, gnat_node); | |
3685 | ||
3686 | gnu_result | |
3687 | = UI_To_gnu (Numerator (ur_realval), gnu_result_type); | |
3688 | ||
3689 | /* If we have a base of zero, divide by the denominator. | |
3690 | Otherwise, the base must be 2 and we scale the value, which | |
3691 | we know can fit in the mantissa of the type (hence the use | |
3692 | of that type above). */ | |
3693 | if (No (Rbase (ur_realval))) | |
3694 | gnu_result | |
3695 | = build_binary_op (RDIV_EXPR, | |
3696 | get_base_type (gnu_result_type), | |
3697 | gnu_result, | |
3698 | UI_To_gnu (Denominator (ur_realval), | |
3699 | gnu_result_type)); | |
3700 | else | |
3701 | { | |
3702 | REAL_VALUE_TYPE tmp; | |
3703 | ||
3704 | gcc_assert (Rbase (ur_realval) == 2); | |
3705 | real_ldexp (&tmp, &TREE_REAL_CST (gnu_result), | |
3706 | - UI_To_Int (Denominator (ur_realval))); | |
3707 | gnu_result = build_real (gnu_result_type, tmp); | |
3708 | } | |
3709 | } | |
3710 | ||
3711 | /* Now see if we need to negate the result. Do it this way to | |
3712 | properly handle -0. */ | |
3713 | if (UR_Is_Negative (Realval (gnat_node))) | |
3714 | gnu_result | |
3715 | = build_unary_op (NEGATE_EXPR, get_base_type (gnu_result_type), | |
3716 | gnu_result); | |
3717 | } | |
3718 | ||
3719 | break; | |
3720 | ||
3721 | case N_String_Literal: | |
3722 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3723 | if (TYPE_PRECISION (TREE_TYPE (gnu_result_type)) == HOST_BITS_PER_CHAR) | |
3724 | { | |
3725 | String_Id gnat_string = Strval (gnat_node); | |
3726 | int length = String_Length (gnat_string); | |
3727 | int i; | |
3728 | char *string; | |
3729 | if (length >= ALLOCA_THRESHOLD) | |
1e17ef87 EB |
3730 | string = XNEWVEC (char, length + 1); |
3731 | else | |
3732 | string = (char *) alloca (length + 1); | |
a1ab4c31 AC |
3733 | |
3734 | /* Build the string with the characters in the literal. Note | |
3735 | that Ada strings are 1-origin. */ | |
3736 | for (i = 0; i < length; i++) | |
3737 | string[i] = Get_String_Char (gnat_string, i + 1); | |
3738 | ||
3739 | /* Put a null at the end of the string in case it's in a context | |
3740 | where GCC will want to treat it as a C string. */ | |
3741 | string[i] = 0; | |
3742 | ||
3743 | gnu_result = build_string (length, string); | |
3744 | ||
3745 | /* Strings in GCC don't normally have types, but we want | |
3746 | this to not be converted to the array type. */ | |
3747 | TREE_TYPE (gnu_result) = gnu_result_type; | |
3748 | ||
1e17ef87 EB |
3749 | if (length >= ALLOCA_THRESHOLD) |
3750 | free (string); | |
a1ab4c31 AC |
3751 | } |
3752 | else | |
3753 | { | |
3754 | /* Build a list consisting of each character, then make | |
3755 | the aggregate. */ | |
3756 | String_Id gnat_string = Strval (gnat_node); | |
3757 | int length = String_Length (gnat_string); | |
3758 | int i; | |
3759 | tree gnu_list = NULL_TREE; | |
3760 | tree gnu_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type)); | |
3761 | ||
3762 | for (i = 0; i < length; i++) | |
3763 | { | |
3764 | gnu_list | |
3765 | = tree_cons (gnu_idx, | |
3766 | build_int_cst (TREE_TYPE (gnu_result_type), | |
3767 | Get_String_Char (gnat_string, | |
3768 | i + 1)), | |
3769 | gnu_list); | |
3770 | ||
3771 | gnu_idx = int_const_binop (PLUS_EXPR, gnu_idx, integer_one_node, | |
3772 | 0); | |
3773 | } | |
3774 | ||
3775 | gnu_result | |
3776 | = gnat_build_constructor (gnu_result_type, nreverse (gnu_list)); | |
3777 | } | |
3778 | break; | |
3779 | ||
3780 | case N_Pragma: | |
3781 | gnu_result = Pragma_to_gnu (gnat_node); | |
3782 | break; | |
3783 | ||
3784 | /**************************************/ | |
1e17ef87 | 3785 | /* Chapter 3: Declarations and Types */ |
a1ab4c31 AC |
3786 | /**************************************/ |
3787 | ||
3788 | case N_Subtype_Declaration: | |
3789 | case N_Full_Type_Declaration: | |
3790 | case N_Incomplete_Type_Declaration: | |
3791 | case N_Private_Type_Declaration: | |
3792 | case N_Private_Extension_Declaration: | |
3793 | case N_Task_Type_Declaration: | |
3794 | process_type (Defining_Entity (gnat_node)); | |
3795 | gnu_result = alloc_stmt_list (); | |
3796 | break; | |
3797 | ||
3798 | case N_Object_Declaration: | |
3799 | case N_Exception_Declaration: | |
3800 | gnat_temp = Defining_Entity (gnat_node); | |
3801 | gnu_result = alloc_stmt_list (); | |
3802 | ||
3803 | /* If we are just annotating types and this object has an unconstrained | |
3804 | or task type, don't elaborate it. */ | |
3805 | if (type_annotate_only | |
3806 | && (((Is_Array_Type (Etype (gnat_temp)) | |
3807 | || Is_Record_Type (Etype (gnat_temp))) | |
3808 | && !Is_Constrained (Etype (gnat_temp))) | |
3809 | || Is_Concurrent_Type (Etype (gnat_temp)))) | |
3810 | break; | |
3811 | ||
3812 | if (Present (Expression (gnat_node)) | |
3f13dd77 | 3813 | && !(kind == N_Object_Declaration && No_Initialization (gnat_node)) |
a1ab4c31 AC |
3814 | && (!type_annotate_only |
3815 | || Compile_Time_Known_Value (Expression (gnat_node)))) | |
3816 | { | |
3817 | gnu_expr = gnat_to_gnu (Expression (gnat_node)); | |
3818 | if (Do_Range_Check (Expression (gnat_node))) | |
10069d53 EB |
3819 | gnu_expr |
3820 | = emit_range_check (gnu_expr, Etype (gnat_temp), gnat_node); | |
a1ab4c31 AC |
3821 | |
3822 | /* If this object has its elaboration delayed, we must force | |
3823 | evaluation of GNU_EXPR right now and save it for when the object | |
3824 | is frozen. */ | |
3825 | if (Present (Freeze_Node (gnat_temp))) | |
3826 | { | |
3827 | if ((Is_Public (gnat_temp) || global_bindings_p ()) | |
3828 | && !TREE_CONSTANT (gnu_expr)) | |
3829 | gnu_expr | |
3830 | = create_var_decl (create_concat_name (gnat_temp, "init"), | |
3831 | NULL_TREE, TREE_TYPE (gnu_expr), | |
3832 | gnu_expr, false, Is_Public (gnat_temp), | |
3833 | false, false, NULL, gnat_temp); | |
3834 | else | |
7d7a1fe8 | 3835 | gnu_expr = gnat_save_expr (gnu_expr); |
a1ab4c31 AC |
3836 | |
3837 | save_gnu_tree (gnat_node, gnu_expr, true); | |
3838 | } | |
3839 | } | |
3840 | else | |
3841 | gnu_expr = NULL_TREE; | |
3842 | ||
3843 | if (type_annotate_only && gnu_expr && TREE_CODE (gnu_expr) == ERROR_MARK) | |
3844 | gnu_expr = NULL_TREE; | |
3845 | ||
8df2e902 EB |
3846 | /* If this is a deferred constant with an address clause, we ignore the |
3847 | full view since the clause is on the partial view and we cannot have | |
3848 | 2 different GCC trees for the object. The only bits of the full view | |
3849 | we will use is the initializer, but it will be directly fetched. */ | |
3850 | if (Ekind(gnat_temp) == E_Constant | |
3851 | && Present (Address_Clause (gnat_temp)) | |
3852 | && Present (Full_View (gnat_temp))) | |
3853 | save_gnu_tree (Full_View (gnat_temp), error_mark_node, true); | |
3854 | ||
a1ab4c31 AC |
3855 | if (No (Freeze_Node (gnat_temp))) |
3856 | gnat_to_gnu_entity (gnat_temp, gnu_expr, 1); | |
3857 | break; | |
3858 | ||
3859 | case N_Object_Renaming_Declaration: | |
3860 | gnat_temp = Defining_Entity (gnat_node); | |
3861 | ||
3862 | /* Don't do anything if this renaming is handled by the front end or if | |
3863 | we are just annotating types and this object has a composite or task | |
3864 | type, don't elaborate it. We return the result in case it has any | |
3865 | SAVE_EXPRs in it that need to be evaluated here. */ | |
3866 | if (!Is_Renaming_Of_Object (gnat_temp) | |
3867 | && ! (type_annotate_only | |
3868 | && (Is_Array_Type (Etype (gnat_temp)) | |
3869 | || Is_Record_Type (Etype (gnat_temp)) | |
3870 | || Is_Concurrent_Type (Etype (gnat_temp))))) | |
3871 | gnu_result | |
3872 | = gnat_to_gnu_entity (gnat_temp, | |
3873 | gnat_to_gnu (Renamed_Object (gnat_temp)), 1); | |
3874 | else | |
3875 | gnu_result = alloc_stmt_list (); | |
3876 | break; | |
3877 | ||
3878 | case N_Implicit_Label_Declaration: | |
3879 | gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1); | |
3880 | gnu_result = alloc_stmt_list (); | |
3881 | break; | |
3882 | ||
3883 | case N_Exception_Renaming_Declaration: | |
3884 | case N_Number_Declaration: | |
3885 | case N_Package_Renaming_Declaration: | |
3886 | case N_Subprogram_Renaming_Declaration: | |
3887 | /* These are fully handled in the front end. */ | |
3888 | gnu_result = alloc_stmt_list (); | |
3889 | break; | |
3890 | ||
3891 | /*************************************/ | |
1e17ef87 | 3892 | /* Chapter 4: Names and Expressions */ |
a1ab4c31 AC |
3893 | /*************************************/ |
3894 | ||
3895 | case N_Explicit_Dereference: | |
3896 | gnu_result = gnat_to_gnu (Prefix (gnat_node)); | |
3897 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3898 | gnu_result = build_unary_op (INDIRECT_REF, NULL_TREE, gnu_result); | |
3899 | break; | |
3900 | ||
3901 | case N_Indexed_Component: | |
3902 | { | |
3903 | tree gnu_array_object = gnat_to_gnu (Prefix (gnat_node)); | |
3904 | tree gnu_type; | |
3905 | int ndim; | |
3906 | int i; | |
3907 | Node_Id *gnat_expr_array; | |
3908 | ||
3909 | gnu_array_object = maybe_implicit_deref (gnu_array_object); | |
7948ae37 OH |
3910 | |
3911 | /* Convert vector inputs to their representative array type, to fit | |
3912 | what the code below expects. */ | |
3913 | gnu_array_object = maybe_vector_array (gnu_array_object); | |
3914 | ||
a1ab4c31 AC |
3915 | gnu_array_object = maybe_unconstrained_array (gnu_array_object); |
3916 | ||
3917 | /* If we got a padded type, remove it too. */ | |
315cff15 | 3918 | if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_array_object))) |
a1ab4c31 AC |
3919 | gnu_array_object |
3920 | = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_array_object))), | |
3921 | gnu_array_object); | |
3922 | ||
3923 | gnu_result = gnu_array_object; | |
3924 | ||
3925 | /* First compute the number of dimensions of the array, then | |
3926 | fill the expression array, the order depending on whether | |
3927 | this is a Convention_Fortran array or not. */ | |
3928 | for (ndim = 1, gnu_type = TREE_TYPE (gnu_array_object); | |
3929 | TREE_CODE (TREE_TYPE (gnu_type)) == ARRAY_TYPE | |
3930 | && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_type)); | |
3931 | ndim++, gnu_type = TREE_TYPE (gnu_type)) | |
3932 | ; | |
3933 | ||
3934 | gnat_expr_array = (Node_Id *) alloca (ndim * sizeof (Node_Id)); | |
3935 | ||
3936 | if (TYPE_CONVENTION_FORTRAN_P (TREE_TYPE (gnu_array_object))) | |
3937 | for (i = ndim - 1, gnat_temp = First (Expressions (gnat_node)); | |
3938 | i >= 0; | |
3939 | i--, gnat_temp = Next (gnat_temp)) | |
3940 | gnat_expr_array[i] = gnat_temp; | |
3941 | else | |
3942 | for (i = 0, gnat_temp = First (Expressions (gnat_node)); | |
3943 | i < ndim; | |
3944 | i++, gnat_temp = Next (gnat_temp)) | |
3945 | gnat_expr_array[i] = gnat_temp; | |
3946 | ||
3947 | for (i = 0, gnu_type = TREE_TYPE (gnu_array_object); | |
3948 | i < ndim; i++, gnu_type = TREE_TYPE (gnu_type)) | |
3949 | { | |
3950 | gcc_assert (TREE_CODE (gnu_type) == ARRAY_TYPE); | |
3951 | gnat_temp = gnat_expr_array[i]; | |
3952 | gnu_expr = gnat_to_gnu (gnat_temp); | |
3953 | ||
3954 | if (Do_Range_Check (gnat_temp)) | |
3955 | gnu_expr | |
3956 | = emit_index_check | |
3957 | (gnu_array_object, gnu_expr, | |
3958 | TYPE_MIN_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))), | |
10069d53 EB |
3959 | TYPE_MAX_VALUE (TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type))), |
3960 | gnat_temp); | |
a1ab4c31 AC |
3961 | |
3962 | gnu_result = build_binary_op (ARRAY_REF, NULL_TREE, | |
3963 | gnu_result, gnu_expr); | |
3964 | } | |
3965 | } | |
3966 | ||
3967 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3968 | break; | |
3969 | ||
3970 | case N_Slice: | |
3971 | { | |
a1ab4c31 | 3972 | Node_Id gnat_range_node = Discrete_Range (gnat_node); |
f76d6e6f | 3973 | tree gnu_type; |
a1ab4c31 AC |
3974 | |
3975 | gnu_result = gnat_to_gnu (Prefix (gnat_node)); | |
3976 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3977 | ||
3978 | /* Do any implicit dereferences of the prefix and do any needed | |
3979 | range check. */ | |
3980 | gnu_result = maybe_implicit_deref (gnu_result); | |
3981 | gnu_result = maybe_unconstrained_array (gnu_result); | |
3982 | gnu_type = TREE_TYPE (gnu_result); | |
3983 | if (Do_Range_Check (gnat_range_node)) | |
3984 | { | |
3985 | /* Get the bounds of the slice. */ | |
3986 | tree gnu_index_type | |
3987 | = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_result_type)); | |
3988 | tree gnu_min_expr = TYPE_MIN_VALUE (gnu_index_type); | |
3989 | tree gnu_max_expr = TYPE_MAX_VALUE (gnu_index_type); | |
3990 | /* Get the permitted bounds. */ | |
3991 | tree gnu_base_index_type | |
3992 | = TYPE_INDEX_TYPE (TYPE_DOMAIN (gnu_type)); | |
82f7c45f GB |
3993 | tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR |
3994 | (TYPE_MIN_VALUE (gnu_base_index_type), gnu_result); | |
3995 | tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR | |
3996 | (TYPE_MAX_VALUE (gnu_base_index_type), gnu_result); | |
a1ab4c31 AC |
3997 | tree gnu_expr_l, gnu_expr_h, gnu_expr_type; |
3998 | ||
7d7a1fe8 EB |
3999 | gnu_min_expr = gnat_protect_expr (gnu_min_expr); |
4000 | gnu_max_expr = gnat_protect_expr (gnu_max_expr); | |
a1ab4c31 AC |
4001 | |
4002 | /* Derive a good type to convert everything to. */ | |
9ee309d4 | 4003 | gnu_expr_type = get_base_type (gnu_index_type); |
82f7c45f GB |
4004 | |
4005 | /* Test whether the minimum slice value is too small. */ | |
4006 | gnu_expr_l = build_binary_op (LT_EXPR, integer_type_node, | |
4007 | convert (gnu_expr_type, | |
4008 | gnu_min_expr), | |
4009 | convert (gnu_expr_type, | |
4010 | gnu_base_min_expr)); | |
4011 | ||
4012 | /* Test whether the maximum slice value is too large. */ | |
4013 | gnu_expr_h = build_binary_op (GT_EXPR, integer_type_node, | |
4014 | convert (gnu_expr_type, | |
4015 | gnu_max_expr), | |
4016 | convert (gnu_expr_type, | |
4017 | gnu_base_max_expr)); | |
4018 | ||
4019 | /* Build a slice index check that returns the low bound, | |
1e17ef87 | 4020 | assuming the slice is not empty. */ |
82f7c45f GB |
4021 | gnu_expr = emit_check |
4022 | (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
4023 | gnu_expr_l, gnu_expr_h), | |
10069d53 | 4024 | gnu_min_expr, CE_Index_Check_Failed, gnat_node); |
82f7c45f GB |
4025 | |
4026 | /* Build a conditional expression that does the index checks and | |
a1ab4c31 AC |
4027 | returns the low bound if the slice is not empty (max >= min), |
4028 | and returns the naked low bound otherwise (max < min), unless | |
4029 | it is non-constant and the high bound is; this prevents VRP | |
4030 | from inferring bogus ranges on the unlikely path. */ | |
4031 | gnu_expr = fold_build3 (COND_EXPR, gnu_expr_type, | |
4032 | build_binary_op (GE_EXPR, gnu_expr_type, | |
4033 | convert (gnu_expr_type, | |
4034 | gnu_max_expr), | |
4035 | convert (gnu_expr_type, | |
4036 | gnu_min_expr)), | |
4037 | gnu_expr, | |
4038 | TREE_CODE (gnu_min_expr) != INTEGER_CST | |
4039 | && TREE_CODE (gnu_max_expr) == INTEGER_CST | |
4040 | ? gnu_max_expr : gnu_min_expr); | |
4041 | } | |
4042 | else | |
4043 | /* Simply return the naked low bound. */ | |
4044 | gnu_expr = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_result_type)); | |
4045 | ||
f76d6e6f EB |
4046 | /* If this is a slice with non-constant size of an array with constant |
4047 | size, set the maximum size for the allocation of temporaries. */ | |
4048 | if (!TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_result_type)) | |
4049 | && TREE_CONSTANT (TYPE_SIZE_UNIT (gnu_type))) | |
4050 | TYPE_ARRAY_MAX_SIZE (gnu_result_type) = TYPE_SIZE_UNIT (gnu_type); | |
4051 | ||
a1ab4c31 AC |
4052 | gnu_result = build_binary_op (ARRAY_RANGE_REF, gnu_result_type, |
4053 | gnu_result, gnu_expr); | |
4054 | } | |
4055 | break; | |
4056 | ||
4057 | case N_Selected_Component: | |
4058 | { | |
4059 | tree gnu_prefix = gnat_to_gnu (Prefix (gnat_node)); | |
4060 | Entity_Id gnat_field = Entity (Selector_Name (gnat_node)); | |
4061 | Entity_Id gnat_pref_type = Etype (Prefix (gnat_node)); | |
4062 | tree gnu_field; | |
4063 | ||
4064 | while (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind) | |
4065 | || IN (Ekind (gnat_pref_type), Access_Kind)) | |
4066 | { | |
4067 | if (IN (Ekind (gnat_pref_type), Incomplete_Or_Private_Kind)) | |
4068 | gnat_pref_type = Underlying_Type (gnat_pref_type); | |
4069 | else if (IN (Ekind (gnat_pref_type), Access_Kind)) | |
4070 | gnat_pref_type = Designated_Type (gnat_pref_type); | |
4071 | } | |
4072 | ||
4073 | gnu_prefix = maybe_implicit_deref (gnu_prefix); | |
4074 | ||
4075 | /* For discriminant references in tagged types always substitute the | |
1e17ef87 | 4076 | corresponding discriminant as the actual selected component. */ |
a1ab4c31 AC |
4077 | if (Is_Tagged_Type (gnat_pref_type)) |
4078 | while (Present (Corresponding_Discriminant (gnat_field))) | |
4079 | gnat_field = Corresponding_Discriminant (gnat_field); | |
4080 | ||
4081 | /* For discriminant references of untagged types always substitute the | |
1e17ef87 | 4082 | corresponding stored discriminant. */ |
a1ab4c31 AC |
4083 | else if (Present (Corresponding_Discriminant (gnat_field))) |
4084 | gnat_field = Original_Record_Component (gnat_field); | |
4085 | ||
4086 | /* Handle extracting the real or imaginary part of a complex. | |
4087 | The real part is the first field and the imaginary the last. */ | |
a1ab4c31 AC |
4088 | if (TREE_CODE (TREE_TYPE (gnu_prefix)) == COMPLEX_TYPE) |
4089 | gnu_result = build_unary_op (Present (Next_Entity (gnat_field)) | |
4090 | ? REALPART_EXPR : IMAGPART_EXPR, | |
4091 | NULL_TREE, gnu_prefix); | |
4092 | else | |
4093 | { | |
4094 | gnu_field = gnat_to_gnu_field_decl (gnat_field); | |
4095 | ||
1e17ef87 EB |
4096 | /* If there are discriminants, the prefix might be evaluated more |
4097 | than once, which is a problem if it has side-effects. */ | |
a1ab4c31 AC |
4098 | if (Has_Discriminants (Is_Access_Type (Etype (Prefix (gnat_node))) |
4099 | ? Designated_Type (Etype | |
4100 | (Prefix (gnat_node))) | |
4101 | : Etype (Prefix (gnat_node)))) | |
7d7a1fe8 | 4102 | gnu_prefix = gnat_stabilize_reference (gnu_prefix, false, NULL); |
a1ab4c31 AC |
4103 | |
4104 | gnu_result | |
4105 | = build_component_ref (gnu_prefix, NULL_TREE, gnu_field, | |
4106 | (Nkind (Parent (gnat_node)) | |
3cd64bab EB |
4107 | == N_Attribute_Reference) |
4108 | && lvalue_required_for_attribute_p | |
4109 | (Parent (gnat_node))); | |
a1ab4c31 AC |
4110 | } |
4111 | ||
4112 | gcc_assert (gnu_result); | |
4113 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4114 | } | |
4115 | break; | |
4116 | ||
4117 | case N_Attribute_Reference: | |
4118 | { | |
1e17ef87 EB |
4119 | /* The attribute designator (like an enumeration value). */ |
4120 | int attribute = Get_Attribute_Id (Attribute_Name (gnat_node)); | |
a1ab4c31 AC |
4121 | |
4122 | /* The Elab_Spec and Elab_Body attributes are special in that | |
4123 | Prefix is a unit, not an object with a GCC equivalent. Similarly | |
4124 | for Elaborated, since that variable isn't otherwise known. */ | |
4125 | if (attribute == Attr_Elab_Body || attribute == Attr_Elab_Spec) | |
4126 | return (create_subprog_decl | |
4127 | (create_concat_name (Entity (Prefix (gnat_node)), | |
4128 | attribute == Attr_Elab_Body | |
4129 | ? "elabb" : "elabs"), | |
4130 | NULL_TREE, void_ftype, NULL_TREE, false, true, true, NULL, | |
4131 | gnat_node)); | |
4132 | ||
4133 | gnu_result = Attribute_to_gnu (gnat_node, &gnu_result_type, attribute); | |
4134 | } | |
4135 | break; | |
4136 | ||
4137 | case N_Reference: | |
4138 | /* Like 'Access as far as we are concerned. */ | |
4139 | gnu_result = gnat_to_gnu (Prefix (gnat_node)); | |
4140 | gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result); | |
4141 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4142 | break; | |
4143 | ||
4144 | case N_Aggregate: | |
4145 | case N_Extension_Aggregate: | |
4146 | { | |
4147 | tree gnu_aggr_type; | |
4148 | ||
4149 | /* ??? It is wrong to evaluate the type now, but there doesn't | |
4150 | seem to be any other practical way of doing it. */ | |
4151 | ||
4152 | gcc_assert (!Expansion_Delayed (gnat_node)); | |
4153 | ||
4154 | gnu_aggr_type = gnu_result_type | |
4155 | = get_unpadded_type (Etype (gnat_node)); | |
4156 | ||
4157 | if (TREE_CODE (gnu_result_type) == RECORD_TYPE | |
4158 | && TYPE_CONTAINS_TEMPLATE_P (gnu_result_type)) | |
4159 | gnu_aggr_type | |
4160 | = TREE_TYPE (TREE_CHAIN (TYPE_FIELDS (gnu_result_type))); | |
7948ae37 OH |
4161 | else if (TREE_CODE (gnu_result_type) == VECTOR_TYPE) |
4162 | gnu_aggr_type = TYPE_REPRESENTATIVE_ARRAY (gnu_result_type); | |
a1ab4c31 AC |
4163 | |
4164 | if (Null_Record_Present (gnat_node)) | |
4165 | gnu_result = gnat_build_constructor (gnu_aggr_type, NULL_TREE); | |
4166 | ||
4167 | else if (TREE_CODE (gnu_aggr_type) == RECORD_TYPE | |
4168 | || TREE_CODE (gnu_aggr_type) == UNION_TYPE) | |
4169 | gnu_result | |
4170 | = assoc_to_constructor (Etype (gnat_node), | |
4171 | First (Component_Associations (gnat_node)), | |
4172 | gnu_aggr_type); | |
4173 | else if (TREE_CODE (gnu_aggr_type) == ARRAY_TYPE) | |
4174 | gnu_result = pos_to_constructor (First (Expressions (gnat_node)), | |
4175 | gnu_aggr_type, | |
4176 | Component_Type (Etype (gnat_node))); | |
4177 | else if (TREE_CODE (gnu_aggr_type) == COMPLEX_TYPE) | |
4178 | gnu_result | |
4179 | = build_binary_op | |
4180 | (COMPLEX_EXPR, gnu_aggr_type, | |
4181 | gnat_to_gnu (Expression (First | |
4182 | (Component_Associations (gnat_node)))), | |
4183 | gnat_to_gnu (Expression | |
4184 | (Next | |
4185 | (First (Component_Associations (gnat_node)))))); | |
4186 | else | |
4187 | gcc_unreachable (); | |
4188 | ||
4189 | gnu_result = convert (gnu_result_type, gnu_result); | |
4190 | } | |
4191 | break; | |
4192 | ||
4193 | case N_Null: | |
4194 | if (TARGET_VTABLE_USES_DESCRIPTORS | |
4195 | && Ekind (Etype (gnat_node)) == E_Access_Subprogram_Type | |
4196 | && Is_Dispatch_Table_Entity (Etype (gnat_node))) | |
4197 | gnu_result = null_fdesc_node; | |
4198 | else | |
4199 | gnu_result = null_pointer_node; | |
4200 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4201 | break; | |
4202 | ||
4203 | case N_Type_Conversion: | |
4204 | case N_Qualified_Expression: | |
4205 | /* Get the operand expression. */ | |
4206 | gnu_result = gnat_to_gnu (Expression (gnat_node)); | |
4207 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4208 | ||
4209 | gnu_result | |
4210 | = convert_with_check (Etype (gnat_node), gnu_result, | |
4211 | Do_Overflow_Check (gnat_node), | |
4212 | Do_Range_Check (Expression (gnat_node)), | |
3f13dd77 | 4213 | kind == N_Type_Conversion |
10069d53 | 4214 | && Float_Truncate (gnat_node), gnat_node); |
a1ab4c31 AC |
4215 | break; |
4216 | ||
4217 | case N_Unchecked_Type_Conversion: | |
4218 | gnu_result = gnat_to_gnu (Expression (gnat_node)); | |
c2efda0d EB |
4219 | |
4220 | /* Skip further processing if the conversion is deemed a no-op. */ | |
4f8a6678 | 4221 | if (unchecked_conversion_nop (gnat_node)) |
c2efda0d EB |
4222 | { |
4223 | gnu_result_type = TREE_TYPE (gnu_result); | |
4224 | break; | |
4225 | } | |
4226 | ||
a1ab4c31 AC |
4227 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); |
4228 | ||
4229 | /* If the result is a pointer type, see if we are improperly | |
4230 | converting to a stricter alignment. */ | |
4231 | if (STRICT_ALIGNMENT && POINTER_TYPE_P (gnu_result_type) | |
4232 | && IN (Ekind (Etype (gnat_node)), Access_Kind)) | |
4233 | { | |
4234 | unsigned int align = known_alignment (gnu_result); | |
4235 | tree gnu_obj_type = TREE_TYPE (gnu_result_type); | |
4236 | unsigned int oalign = TYPE_ALIGN (gnu_obj_type); | |
4237 | ||
4238 | if (align != 0 && align < oalign && !TYPE_ALIGN_OK (gnu_obj_type)) | |
4239 | post_error_ne_tree_2 | |
4240 | ("?source alignment (^) '< alignment of & (^)", | |
4241 | gnat_node, Designated_Type (Etype (gnat_node)), | |
4242 | size_int (align / BITS_PER_UNIT), oalign / BITS_PER_UNIT); | |
4243 | } | |
4244 | ||
4245 | /* If we are converting a descriptor to a function pointer, first | |
4246 | build the pointer. */ | |
4247 | if (TARGET_VTABLE_USES_DESCRIPTORS | |
4248 | && TREE_TYPE (gnu_result) == fdesc_type_node | |
4249 | && POINTER_TYPE_P (gnu_result_type)) | |
4250 | gnu_result = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_result); | |
4251 | ||
4252 | gnu_result = unchecked_convert (gnu_result_type, gnu_result, | |
4253 | No_Truncation (gnat_node)); | |
4254 | break; | |
4255 | ||
4256 | case N_In: | |
4257 | case N_Not_In: | |
4258 | { | |
da49a783 | 4259 | tree gnu_obj = gnat_to_gnu (Left_Opnd (gnat_node)); |
a1ab4c31 | 4260 | Node_Id gnat_range = Right_Opnd (gnat_node); |
da49a783 | 4261 | tree gnu_low, gnu_high; |
a1ab4c31 | 4262 | |
da49a783 EB |
4263 | /* GNAT_RANGE is either an N_Range node or an identifier denoting a |
4264 | subtype. */ | |
a1ab4c31 AC |
4265 | if (Nkind (gnat_range) == N_Range) |
4266 | { | |
4267 | gnu_low = gnat_to_gnu (Low_Bound (gnat_range)); | |
4268 | gnu_high = gnat_to_gnu (High_Bound (gnat_range)); | |
4269 | } | |
4270 | else if (Nkind (gnat_range) == N_Identifier | |
1e17ef87 | 4271 | || Nkind (gnat_range) == N_Expanded_Name) |
a1ab4c31 AC |
4272 | { |
4273 | tree gnu_range_type = get_unpadded_type (Entity (gnat_range)); | |
4274 | ||
4275 | gnu_low = TYPE_MIN_VALUE (gnu_range_type); | |
4276 | gnu_high = TYPE_MAX_VALUE (gnu_range_type); | |
4277 | } | |
4278 | else | |
4279 | gcc_unreachable (); | |
4280 | ||
4281 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4282 | ||
da49a783 EB |
4283 | /* If LOW and HIGH are identical, perform an equality test. Otherwise, |
4284 | ensure that GNU_OBJ is evaluated only once and perform a full range | |
4285 | test. */ | |
a1ab4c31 | 4286 | if (operand_equal_p (gnu_low, gnu_high, 0)) |
da49a783 EB |
4287 | gnu_result |
4288 | = build_binary_op (EQ_EXPR, gnu_result_type, gnu_obj, gnu_low); | |
a1ab4c31 AC |
4289 | else |
4290 | { | |
da49a783 | 4291 | tree t1, t2; |
7d7a1fe8 | 4292 | gnu_obj = gnat_protect_expr (gnu_obj); |
da49a783 EB |
4293 | t1 = build_binary_op (GE_EXPR, gnu_result_type, gnu_obj, gnu_low); |
4294 | if (EXPR_P (t1)) | |
4295 | set_expr_location_from_node (t1, gnat_node); | |
4296 | t2 = build_binary_op (LE_EXPR, gnu_result_type, gnu_obj, gnu_high); | |
4297 | if (EXPR_P (t2)) | |
4298 | set_expr_location_from_node (t2, gnat_node); | |
a1ab4c31 | 4299 | gnu_result |
da49a783 | 4300 | = build_binary_op (TRUTH_ANDIF_EXPR, gnu_result_type, t1, t2); |
a1ab4c31 AC |
4301 | } |
4302 | ||
3f13dd77 | 4303 | if (kind == N_Not_In) |
a1ab4c31 AC |
4304 | gnu_result = invert_truthvalue (gnu_result); |
4305 | } | |
4306 | break; | |
4307 | ||
4308 | case N_Op_Divide: | |
4309 | gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node)); | |
4310 | gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4311 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4312 | gnu_result = build_binary_op (FLOAT_TYPE_P (gnu_result_type) | |
4313 | ? RDIV_EXPR | |
4314 | : (Rounded_Result (gnat_node) | |
4315 | ? ROUND_DIV_EXPR : TRUNC_DIV_EXPR), | |
4316 | gnu_result_type, gnu_lhs, gnu_rhs); | |
4317 | break; | |
4318 | ||
4319 | case N_Op_Or: case N_Op_And: case N_Op_Xor: | |
4320 | /* These can either be operations on booleans or on modular types. | |
4321 | Fall through for boolean types since that's the way GNU_CODES is | |
4322 | set up. */ | |
4323 | if (IN (Ekind (Underlying_Type (Etype (gnat_node))), | |
4324 | Modular_Integer_Kind)) | |
4325 | { | |
4326 | enum tree_code code | |
3f13dd77 EB |
4327 | = (kind == N_Op_Or ? BIT_IOR_EXPR |
4328 | : kind == N_Op_And ? BIT_AND_EXPR | |
a1ab4c31 AC |
4329 | : BIT_XOR_EXPR); |
4330 | ||
4331 | gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node)); | |
4332 | gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4333 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4334 | gnu_result = build_binary_op (code, gnu_result_type, | |
4335 | gnu_lhs, gnu_rhs); | |
4336 | break; | |
4337 | } | |
4338 | ||
4339 | /* ... fall through ... */ | |
4340 | ||
4341 | case N_Op_Eq: case N_Op_Ne: case N_Op_Lt: | |
4342 | case N_Op_Le: case N_Op_Gt: case N_Op_Ge: | |
4343 | case N_Op_Add: case N_Op_Subtract: case N_Op_Multiply: | |
4344 | case N_Op_Mod: case N_Op_Rem: | |
4345 | case N_Op_Rotate_Left: | |
4346 | case N_Op_Rotate_Right: | |
4347 | case N_Op_Shift_Left: | |
4348 | case N_Op_Shift_Right: | |
4349 | case N_Op_Shift_Right_Arithmetic: | |
4350 | case N_And_Then: case N_Or_Else: | |
4351 | { | |
3f13dd77 | 4352 | enum tree_code code = gnu_codes[kind]; |
a1ab4c31 AC |
4353 | bool ignore_lhs_overflow = false; |
4354 | tree gnu_type; | |
4355 | ||
4356 | gnu_lhs = gnat_to_gnu (Left_Opnd (gnat_node)); | |
4357 | gnu_rhs = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4358 | gnu_type = gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4359 | ||
7948ae37 OH |
4360 | /* Pending generic support for efficient vector logical operations in |
4361 | GCC, convert vectors to their representative array type view and | |
4362 | fallthrough. */ | |
4363 | gnu_lhs = maybe_vector_array (gnu_lhs); | |
4364 | gnu_rhs = maybe_vector_array (gnu_rhs); | |
4365 | ||
a1ab4c31 AC |
4366 | /* If this is a comparison operator, convert any references to |
4367 | an unconstrained array value into a reference to the | |
4368 | actual array. */ | |
4369 | if (TREE_CODE_CLASS (code) == tcc_comparison) | |
4370 | { | |
4371 | gnu_lhs = maybe_unconstrained_array (gnu_lhs); | |
4372 | gnu_rhs = maybe_unconstrained_array (gnu_rhs); | |
4373 | } | |
4374 | ||
4375 | /* If the result type is a private type, its full view may be a | |
4376 | numeric subtype. The representation we need is that of its base | |
4377 | type, given that it is the result of an arithmetic operation. */ | |
1e17ef87 | 4378 | else if (Is_Private_Type (Etype (gnat_node))) |
a1ab4c31 AC |
4379 | gnu_type = gnu_result_type |
4380 | = get_unpadded_type (Base_Type (Full_View (Etype (gnat_node)))); | |
4381 | ||
4382 | /* If this is a shift whose count is not guaranteed to be correct, | |
4383 | we need to adjust the shift count. */ | |
3f13dd77 | 4384 | if (IN (kind, N_Op_Shift) && !Shift_Count_OK (gnat_node)) |
a1ab4c31 AC |
4385 | { |
4386 | tree gnu_count_type = get_base_type (TREE_TYPE (gnu_rhs)); | |
4387 | tree gnu_max_shift | |
4388 | = convert (gnu_count_type, TYPE_SIZE (gnu_type)); | |
4389 | ||
3f13dd77 | 4390 | if (kind == N_Op_Rotate_Left || kind == N_Op_Rotate_Right) |
a1ab4c31 AC |
4391 | gnu_rhs = build_binary_op (TRUNC_MOD_EXPR, gnu_count_type, |
4392 | gnu_rhs, gnu_max_shift); | |
3f13dd77 | 4393 | else if (kind == N_Op_Shift_Right_Arithmetic) |
a1ab4c31 AC |
4394 | gnu_rhs |
4395 | = build_binary_op | |
4396 | (MIN_EXPR, gnu_count_type, | |
4397 | build_binary_op (MINUS_EXPR, | |
4398 | gnu_count_type, | |
4399 | gnu_max_shift, | |
4400 | convert (gnu_count_type, | |
4401 | integer_one_node)), | |
4402 | gnu_rhs); | |
4403 | } | |
4404 | ||
4405 | /* For right shifts, the type says what kind of shift to do, | |
4406 | so we may need to choose a different type. In this case, | |
4407 | we have to ignore integer overflow lest it propagates all | |
4408 | the way down and causes a CE to be explicitly raised. */ | |
3f13dd77 | 4409 | if (kind == N_Op_Shift_Right && !TYPE_UNSIGNED (gnu_type)) |
a1ab4c31 AC |
4410 | { |
4411 | gnu_type = gnat_unsigned_type (gnu_type); | |
4412 | ignore_lhs_overflow = true; | |
4413 | } | |
3f13dd77 | 4414 | else if (kind == N_Op_Shift_Right_Arithmetic |
a1ab4c31 AC |
4415 | && TYPE_UNSIGNED (gnu_type)) |
4416 | { | |
4417 | gnu_type = gnat_signed_type (gnu_type); | |
4418 | ignore_lhs_overflow = true; | |
4419 | } | |
4420 | ||
4421 | if (gnu_type != gnu_result_type) | |
4422 | { | |
4423 | tree gnu_old_lhs = gnu_lhs; | |
4424 | gnu_lhs = convert (gnu_type, gnu_lhs); | |
4425 | if (TREE_CODE (gnu_lhs) == INTEGER_CST && ignore_lhs_overflow) | |
4426 | TREE_OVERFLOW (gnu_lhs) = TREE_OVERFLOW (gnu_old_lhs); | |
4427 | gnu_rhs = convert (gnu_type, gnu_rhs); | |
4428 | } | |
4429 | ||
b666e568 GB |
4430 | /* Instead of expanding overflow checks for addition, subtraction |
4431 | and multiplication itself, the front end will leave this to | |
4432 | the back end when Backend_Overflow_Checks_On_Target is set. | |
4433 | As the GCC back end itself does not know yet how to properly | |
4434 | do overflow checking, do it here. The goal is to push | |
4435 | the expansions further into the back end over time. */ | |
4436 | if (Do_Overflow_Check (gnat_node) && Backend_Overflow_Checks_On_Target | |
3f13dd77 EB |
4437 | && (kind == N_Op_Add |
4438 | || kind == N_Op_Subtract | |
4439 | || kind == N_Op_Multiply) | |
b666e568 GB |
4440 | && !TYPE_UNSIGNED (gnu_type) |
4441 | && !FLOAT_TYPE_P (gnu_type)) | |
10069d53 EB |
4442 | gnu_result = build_binary_op_trapv (code, gnu_type, |
4443 | gnu_lhs, gnu_rhs, gnat_node); | |
b666e568 GB |
4444 | else |
4445 | gnu_result = build_binary_op (code, gnu_type, gnu_lhs, gnu_rhs); | |
a1ab4c31 AC |
4446 | |
4447 | /* If this is a logical shift with the shift count not verified, | |
4448 | we must return zero if it is too large. We cannot compensate | |
4449 | above in this case. */ | |
3f13dd77 | 4450 | if ((kind == N_Op_Shift_Left || kind == N_Op_Shift_Right) |
a1ab4c31 AC |
4451 | && !Shift_Count_OK (gnat_node)) |
4452 | gnu_result | |
4453 | = build_cond_expr | |
4454 | (gnu_type, | |
4455 | build_binary_op (GE_EXPR, integer_type_node, | |
4456 | gnu_rhs, | |
4457 | convert (TREE_TYPE (gnu_rhs), | |
4458 | TYPE_SIZE (gnu_type))), | |
4459 | convert (gnu_type, integer_zero_node), | |
4460 | gnu_result); | |
4461 | } | |
4462 | break; | |
4463 | ||
4464 | case N_Conditional_Expression: | |
4465 | { | |
1e17ef87 EB |
4466 | tree gnu_cond = gnat_to_gnu (First (Expressions (gnat_node))); |
4467 | tree gnu_true = gnat_to_gnu (Next (First (Expressions (gnat_node)))); | |
4468 | tree gnu_false | |
4469 | = gnat_to_gnu (Next (Next (First (Expressions (gnat_node))))); | |
a1ab4c31 AC |
4470 | |
4471 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
3f13dd77 EB |
4472 | gnu_result |
4473 | = build_cond_expr (gnu_result_type, gnu_cond, gnu_true, gnu_false); | |
a1ab4c31 AC |
4474 | } |
4475 | break; | |
4476 | ||
4477 | case N_Op_Plus: | |
4478 | gnu_result = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4479 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4480 | break; | |
4481 | ||
4482 | case N_Op_Not: | |
4483 | /* This case can apply to a boolean or a modular type. | |
4484 | Fall through for a boolean operand since GNU_CODES is set | |
4485 | up to handle this. */ | |
4486 | if (Is_Modular_Integer_Type (Etype (gnat_node)) | |
4487 | || (Ekind (Etype (gnat_node)) == E_Private_Type | |
4488 | && Is_Modular_Integer_Type (Full_View (Etype (gnat_node))))) | |
4489 | { | |
4490 | gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4491 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4492 | gnu_result = build_unary_op (BIT_NOT_EXPR, gnu_result_type, | |
4493 | gnu_expr); | |
4494 | break; | |
4495 | } | |
4496 | ||
4497 | /* ... fall through ... */ | |
4498 | ||
4499 | case N_Op_Minus: case N_Op_Abs: | |
4500 | gnu_expr = gnat_to_gnu (Right_Opnd (gnat_node)); | |
4501 | ||
4502 | if (Ekind (Etype (gnat_node)) != E_Private_Type) | |
1e17ef87 | 4503 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); |
a1ab4c31 | 4504 | else |
1e17ef87 EB |
4505 | gnu_result_type = get_unpadded_type (Base_Type |
4506 | (Full_View (Etype (gnat_node)))); | |
a1ab4c31 | 4507 | |
b666e568 GB |
4508 | if (Do_Overflow_Check (gnat_node) |
4509 | && !TYPE_UNSIGNED (gnu_result_type) | |
4510 | && !FLOAT_TYPE_P (gnu_result_type)) | |
10069d53 | 4511 | gnu_result |
3f13dd77 | 4512 | = build_unary_op_trapv (gnu_codes[kind], |
10069d53 | 4513 | gnu_result_type, gnu_expr, gnat_node); |
b666e568 | 4514 | else |
3f13dd77 | 4515 | gnu_result = build_unary_op (gnu_codes[kind], |
b666e568 | 4516 | gnu_result_type, gnu_expr); |
a1ab4c31 AC |
4517 | break; |
4518 | ||
4519 | case N_Allocator: | |
4520 | { | |
4521 | tree gnu_init = 0; | |
4522 | tree gnu_type; | |
4523 | bool ignore_init_type = false; | |
4524 | ||
4525 | gnat_temp = Expression (gnat_node); | |
4526 | ||
4527 | /* The Expression operand can either be an N_Identifier or | |
4528 | Expanded_Name, which must represent a type, or a | |
4529 | N_Qualified_Expression, which contains both the object type and an | |
4530 | initial value for the object. */ | |
4531 | if (Nkind (gnat_temp) == N_Identifier | |
4532 | || Nkind (gnat_temp) == N_Expanded_Name) | |
4533 | gnu_type = gnat_to_gnu_type (Entity (gnat_temp)); | |
4534 | else if (Nkind (gnat_temp) == N_Qualified_Expression) | |
4535 | { | |
4536 | Entity_Id gnat_desig_type | |
4537 | = Designated_Type (Underlying_Type (Etype (gnat_node))); | |
4538 | ||
4539 | ignore_init_type = Has_Constrained_Partial_View (gnat_desig_type); | |
4540 | gnu_init = gnat_to_gnu (Expression (gnat_temp)); | |
4541 | ||
4542 | gnu_init = maybe_unconstrained_array (gnu_init); | |
1e17ef87 | 4543 | if (Do_Range_Check (Expression (gnat_temp))) |
10069d53 EB |
4544 | gnu_init |
4545 | = emit_range_check (gnu_init, gnat_desig_type, gnat_temp); | |
a1ab4c31 AC |
4546 | |
4547 | if (Is_Elementary_Type (gnat_desig_type) | |
4548 | || Is_Constrained (gnat_desig_type)) | |
4549 | { | |
4550 | gnu_type = gnat_to_gnu_type (gnat_desig_type); | |
4551 | gnu_init = convert (gnu_type, gnu_init); | |
4552 | } | |
4553 | else | |
4554 | { | |
4555 | gnu_type = gnat_to_gnu_type (Etype (Expression (gnat_temp))); | |
4556 | if (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE) | |
4557 | gnu_type = TREE_TYPE (gnu_init); | |
4558 | ||
4559 | gnu_init = convert (gnu_type, gnu_init); | |
4560 | } | |
4561 | } | |
4562 | else | |
4563 | gcc_unreachable (); | |
4564 | ||
4565 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
4566 | return build_allocator (gnu_type, gnu_init, gnu_result_type, | |
4567 | Procedure_To_Call (gnat_node), | |
4568 | Storage_Pool (gnat_node), gnat_node, | |
4569 | ignore_init_type); | |
4570 | } | |
4571 | break; | |
4572 | ||
1e17ef87 EB |
4573 | /**************************/ |
4574 | /* Chapter 5: Statements */ | |
4575 | /**************************/ | |
a1ab4c31 AC |
4576 | |
4577 | case N_Label: | |
4578 | gnu_result = build1 (LABEL_EXPR, void_type_node, | |
4579 | gnat_to_gnu (Identifier (gnat_node))); | |
4580 | break; | |
4581 | ||
4582 | case N_Null_Statement: | |
9c69c3af EB |
4583 | /* When not optimizing, turn null statements from source into gotos to |
4584 | the next statement that the middle-end knows how to preserve. */ | |
4585 | if (!optimize && Comes_From_Source (gnat_node)) | |
4586 | { | |
4587 | tree stmt, label = create_label_decl (NULL_TREE); | |
4588 | start_stmt_group (); | |
4589 | stmt = build1 (GOTO_EXPR, void_type_node, label); | |
4590 | set_expr_location_from_node (stmt, gnat_node); | |
4591 | add_stmt (stmt); | |
4592 | stmt = build1 (LABEL_EXPR, void_type_node, label); | |
4593 | set_expr_location_from_node (stmt, gnat_node); | |
4594 | add_stmt (stmt); | |
4595 | gnu_result = end_stmt_group (); | |
4596 | } | |
4597 | else | |
4598 | gnu_result = alloc_stmt_list (); | |
a1ab4c31 AC |
4599 | break; |
4600 | ||
4601 | case N_Assignment_Statement: | |
4602 | /* Get the LHS and RHS of the statement and convert any reference to an | |
0b3467c4 | 4603 | unconstrained array into a reference to the underlying array. */ |
a1ab4c31 AC |
4604 | gnu_lhs = maybe_unconstrained_array (gnat_to_gnu (Name (gnat_node))); |
4605 | ||
4606 | /* If the type has a size that overflows, convert this into raise of | |
4607 | Storage_Error: execution shouldn't have gotten here anyway. */ | |
4608 | if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs))) == INTEGER_CST | |
4609 | && TREE_OVERFLOW (TYPE_SIZE_UNIT (TREE_TYPE (gnu_lhs)))) | |
4610 | gnu_result = build_call_raise (SE_Object_Too_Large, gnat_node, | |
4611 | N_Raise_Storage_Error); | |
0b3467c4 EB |
4612 | else if (Nkind (Expression (gnat_node)) == N_Function_Call) |
4613 | gnu_result | |
4614 | = call_to_gnu (Expression (gnat_node), &gnu_result_type, gnu_lhs); | |
a1ab4c31 AC |
4615 | else |
4616 | { | |
4617 | gnu_rhs | |
4618 | = maybe_unconstrained_array (gnat_to_gnu (Expression (gnat_node))); | |
4619 | ||
8b659f79 | 4620 | /* If range check is needed, emit code to generate it. */ |
a1ab4c31 | 4621 | if (Do_Range_Check (Expression (gnat_node))) |
10069d53 EB |
4622 | gnu_rhs = emit_range_check (gnu_rhs, Etype (Name (gnat_node)), |
4623 | gnat_node); | |
a1ab4c31 AC |
4624 | |
4625 | gnu_result | |
4626 | = build_binary_op (MODIFY_EXPR, NULL_TREE, gnu_lhs, gnu_rhs); | |
8b659f79 EB |
4627 | |
4628 | /* If the type being assigned is an array type and the two sides | |
4629 | are not completely disjoint, play safe and use memmove. */ | |
4630 | if (TREE_CODE (gnu_result) == MODIFY_EXPR | |
4631 | && Is_Array_Type (Etype (Name (gnat_node))) | |
4632 | && !(Forwards_OK (gnat_node) && Backwards_OK (gnat_node))) | |
4633 | { | |
4634 | tree to, from, size, to_ptr, from_ptr, t; | |
4635 | ||
4636 | to = TREE_OPERAND (gnu_result, 0); | |
4637 | from = TREE_OPERAND (gnu_result, 1); | |
4638 | ||
4639 | size = TYPE_SIZE_UNIT (TREE_TYPE (from)); | |
4640 | size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, from); | |
4641 | ||
4642 | to_ptr = build_fold_addr_expr (to); | |
4643 | from_ptr = build_fold_addr_expr (from); | |
4644 | ||
4645 | t = implicit_built_in_decls[BUILT_IN_MEMMOVE]; | |
4646 | gnu_result = build_call_expr (t, 3, to_ptr, from_ptr, size); | |
4647 | } | |
a1ab4c31 AC |
4648 | } |
4649 | break; | |
4650 | ||
4651 | case N_If_Statement: | |
4652 | { | |
1e17ef87 | 4653 | tree *gnu_else_ptr; /* Point to put next "else if" or "else". */ |
a1ab4c31 AC |
4654 | |
4655 | /* Make the outer COND_EXPR. Avoid non-determinism. */ | |
4656 | gnu_result = build3 (COND_EXPR, void_type_node, | |
4657 | gnat_to_gnu (Condition (gnat_node)), | |
4658 | NULL_TREE, NULL_TREE); | |
4659 | COND_EXPR_THEN (gnu_result) | |
4660 | = build_stmt_group (Then_Statements (gnat_node), false); | |
4661 | TREE_SIDE_EFFECTS (gnu_result) = 1; | |
4662 | gnu_else_ptr = &COND_EXPR_ELSE (gnu_result); | |
4663 | ||
4664 | /* Now make a COND_EXPR for each of the "else if" parts. Put each | |
4665 | into the previous "else" part and point to where to put any | |
4666 | outer "else". Also avoid non-determinism. */ | |
4667 | if (Present (Elsif_Parts (gnat_node))) | |
4668 | for (gnat_temp = First (Elsif_Parts (gnat_node)); | |
4669 | Present (gnat_temp); gnat_temp = Next (gnat_temp)) | |
4670 | { | |
4671 | gnu_expr = build3 (COND_EXPR, void_type_node, | |
4672 | gnat_to_gnu (Condition (gnat_temp)), | |
4673 | NULL_TREE, NULL_TREE); | |
4674 | COND_EXPR_THEN (gnu_expr) | |
4675 | = build_stmt_group (Then_Statements (gnat_temp), false); | |
4676 | TREE_SIDE_EFFECTS (gnu_expr) = 1; | |
4677 | set_expr_location_from_node (gnu_expr, gnat_temp); | |
4678 | *gnu_else_ptr = gnu_expr; | |
4679 | gnu_else_ptr = &COND_EXPR_ELSE (gnu_expr); | |
4680 | } | |
4681 | ||
4682 | *gnu_else_ptr = build_stmt_group (Else_Statements (gnat_node), false); | |
4683 | } | |
4684 | break; | |
4685 | ||
4686 | case N_Case_Statement: | |
4687 | gnu_result = Case_Statement_to_gnu (gnat_node); | |
4688 | break; | |
4689 | ||
4690 | case N_Loop_Statement: | |
4691 | gnu_result = Loop_Statement_to_gnu (gnat_node); | |
4692 | break; | |
4693 | ||
4694 | case N_Block_Statement: | |
4695 | start_stmt_group (); | |
4696 | gnat_pushlevel (); | |
4697 | process_decls (Declarations (gnat_node), Empty, Empty, true, true); | |
4698 | add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node))); | |
4699 | gnat_poplevel (); | |
4700 | gnu_result = end_stmt_group (); | |
4701 | ||
4702 | if (Present (Identifier (gnat_node))) | |
4703 | mark_out_of_scope (Entity (Identifier (gnat_node))); | |
4704 | break; | |
4705 | ||
4706 | case N_Exit_Statement: | |
4707 | gnu_result | |
4708 | = build2 (EXIT_STMT, void_type_node, | |
4709 | (Present (Condition (gnat_node)) | |
4710 | ? gnat_to_gnu (Condition (gnat_node)) : NULL_TREE), | |
4711 | (Present (Name (gnat_node)) | |
4712 | ? get_gnu_tree (Entity (Name (gnat_node))) | |
4713 | : TREE_VALUE (gnu_loop_label_stack))); | |
4714 | break; | |
4715 | ||
4716 | case N_Return_Statement: | |
4717 | { | |
d47d0a8d | 4718 | tree gnu_ret_val, gnu_ret_obj; |
a1ab4c31 | 4719 | |
d47d0a8d EB |
4720 | /* If we have a return label defined, convert this into a branch to |
4721 | that label. The return proper will be handled elsewhere. */ | |
a1ab4c31 AC |
4722 | if (TREE_VALUE (gnu_return_label_stack)) |
4723 | { | |
4724 | gnu_result = build1 (GOTO_EXPR, void_type_node, | |
4725 | TREE_VALUE (gnu_return_label_stack)); | |
4726 | break; | |
4727 | } | |
4728 | ||
d47d0a8d EB |
4729 | /* If the subprogram is a function, we must return the expression. */ |
4730 | if (Present (Expression (gnat_node))) | |
a1ab4c31 | 4731 | { |
d47d0a8d EB |
4732 | tree gnu_subprog_type = TREE_TYPE (current_function_decl); |
4733 | tree gnu_result_decl = DECL_RESULT (current_function_decl); | |
4734 | gnu_ret_val = gnat_to_gnu (Expression (gnat_node)); | |
4735 | ||
4736 | /* Do not remove the padding from GNU_RET_VAL if the inner type is | |
4737 | self-referential since we want to allocate the fixed size. */ | |
4738 | if (TREE_CODE (gnu_ret_val) == COMPONENT_REF | |
4739 | && TYPE_IS_PADDING_P | |
4740 | (TREE_TYPE (TREE_OPERAND (gnu_ret_val, 0))) | |
4741 | && CONTAINS_PLACEHOLDER_P | |
4742 | (TYPE_SIZE (TREE_TYPE (gnu_ret_val)))) | |
4743 | gnu_ret_val = TREE_OPERAND (gnu_ret_val, 0); | |
4744 | ||
4745 | /* If the subprogram returns by direct reference, return a pointer | |
4746 | to the return value. */ | |
4747 | if (TYPE_RETURN_BY_DIRECT_REF_P (gnu_subprog_type) | |
4748 | || By_Ref (gnat_node)) | |
4749 | gnu_ret_val = build_unary_op (ADDR_EXPR, NULL_TREE, gnu_ret_val); | |
4750 | ||
4751 | /* Otherwise, if it returns an unconstrained array, we have to | |
4752 | allocate a new version of the result and return it. */ | |
4753 | else if (TYPE_RETURN_UNCONSTRAINED_P (gnu_subprog_type)) | |
a1ab4c31 | 4754 | { |
d47d0a8d EB |
4755 | gnu_ret_val = maybe_unconstrained_array (gnu_ret_val); |
4756 | gnu_ret_val = build_allocator (TREE_TYPE (gnu_ret_val), | |
4757 | gnu_ret_val, | |
4758 | TREE_TYPE (gnu_subprog_type), | |
4759 | Procedure_To_Call (gnat_node), | |
4760 | Storage_Pool (gnat_node), | |
4761 | gnat_node, false); | |
a1ab4c31 | 4762 | } |
d47d0a8d EB |
4763 | |
4764 | /* If the subprogram returns by invisible reference, dereference | |
4765 | the pointer it is passed using the type of the return value | |
4766 | and build the copy operation manually. This ensures that we | |
4767 | don't copy too much data, for example if the return type is | |
4768 | unconstrained with a maximum size. */ | |
4769 | if (TREE_ADDRESSABLE (gnu_subprog_type)) | |
a1ab4c31 | 4770 | { |
d47d0a8d EB |
4771 | gnu_ret_obj |
4772 | = build_unary_op (INDIRECT_REF, TREE_TYPE (gnu_ret_val), | |
4773 | gnu_result_decl); | |
4774 | gnu_result = build_binary_op (MODIFY_EXPR, NULL_TREE, | |
4775 | gnu_ret_obj, gnu_ret_val); | |
4776 | add_stmt_with_node (gnu_result, gnat_node); | |
4777 | gnu_ret_val = NULL_TREE; | |
4778 | gnu_ret_obj = gnu_result_decl; | |
a1ab4c31 | 4779 | } |
d47d0a8d EB |
4780 | |
4781 | /* Otherwise, build a regular return. */ | |
4782 | else | |
4783 | gnu_ret_obj = gnu_result_decl; | |
a1ab4c31 AC |
4784 | } |
4785 | else | |
a1ab4c31 | 4786 | { |
d47d0a8d EB |
4787 | gnu_ret_val = NULL_TREE; |
4788 | gnu_ret_obj = NULL_TREE; | |
a1ab4c31 AC |
4789 | } |
4790 | ||
d47d0a8d | 4791 | gnu_result = build_return_expr (gnu_ret_obj, gnu_ret_val); |
a1ab4c31 AC |
4792 | } |
4793 | break; | |
4794 | ||
4795 | case N_Goto_Statement: | |
4796 | gnu_result = build1 (GOTO_EXPR, void_type_node, | |
4797 | gnat_to_gnu (Name (gnat_node))); | |
4798 | break; | |
4799 | ||
1e17ef87 EB |
4800 | /***************************/ |
4801 | /* Chapter 6: Subprograms */ | |
4802 | /***************************/ | |
a1ab4c31 AC |
4803 | |
4804 | case N_Subprogram_Declaration: | |
4805 | /* Unless there is a freeze node, declare the subprogram. We consider | |
4806 | this a "definition" even though we're not generating code for | |
4807 | the subprogram because we will be making the corresponding GCC | |
1e17ef87 | 4808 | node here. */ |
a1ab4c31 AC |
4809 | |
4810 | if (No (Freeze_Node (Defining_Entity (Specification (gnat_node))))) | |
4811 | gnat_to_gnu_entity (Defining_Entity (Specification (gnat_node)), | |
4812 | NULL_TREE, 1); | |
4813 | gnu_result = alloc_stmt_list (); | |
4814 | break; | |
4815 | ||
4816 | case N_Abstract_Subprogram_Declaration: | |
4817 | /* This subprogram doesn't exist for code generation purposes, but we | |
4818 | have to elaborate the types of any parameters and result, unless | |
4819 | they are imported types (nothing to generate in this case). */ | |
4820 | ||
4821 | /* Process the parameter types first. */ | |
4822 | ||
4823 | for (gnat_temp | |
4824 | = First_Formal_With_Extras | |
4825 | (Defining_Entity (Specification (gnat_node))); | |
4826 | Present (gnat_temp); | |
4827 | gnat_temp = Next_Formal_With_Extras (gnat_temp)) | |
4828 | if (Is_Itype (Etype (gnat_temp)) | |
4829 | && !From_With_Type (Etype (gnat_temp))) | |
4830 | gnat_to_gnu_entity (Etype (gnat_temp), NULL_TREE, 0); | |
4831 | ||
4832 | ||
4833 | /* Then the result type, set to Standard_Void_Type for procedures. */ | |
4834 | ||
4835 | { | |
4836 | Entity_Id gnat_temp_type | |
4837 | = Etype (Defining_Entity (Specification (gnat_node))); | |
4838 | ||
4839 | if (Is_Itype (gnat_temp_type) && !From_With_Type (gnat_temp_type)) | |
4840 | gnat_to_gnu_entity (Etype (gnat_temp_type), NULL_TREE, 0); | |
4841 | } | |
4842 | ||
4843 | gnu_result = alloc_stmt_list (); | |
4844 | break; | |
4845 | ||
4846 | case N_Defining_Program_Unit_Name: | |
1e17ef87 EB |
4847 | /* For a child unit identifier go up a level to get the specification. |
4848 | We get this when we try to find the spec of a child unit package | |
4849 | that is the compilation unit being compiled. */ | |
a1ab4c31 AC |
4850 | gnu_result = gnat_to_gnu (Parent (gnat_node)); |
4851 | break; | |
4852 | ||
4853 | case N_Subprogram_Body: | |
4854 | Subprogram_Body_to_gnu (gnat_node); | |
4855 | gnu_result = alloc_stmt_list (); | |
4856 | break; | |
4857 | ||
4858 | case N_Function_Call: | |
4859 | case N_Procedure_Call_Statement: | |
4860 | gnu_result = call_to_gnu (gnat_node, &gnu_result_type, NULL_TREE); | |
4861 | break; | |
4862 | ||
1e17ef87 EB |
4863 | /************************/ |
4864 | /* Chapter 7: Packages */ | |
4865 | /************************/ | |
a1ab4c31 AC |
4866 | |
4867 | case N_Package_Declaration: | |
4868 | gnu_result = gnat_to_gnu (Specification (gnat_node)); | |
4869 | break; | |
4870 | ||
4871 | case N_Package_Specification: | |
4872 | ||
4873 | start_stmt_group (); | |
4874 | process_decls (Visible_Declarations (gnat_node), | |
4875 | Private_Declarations (gnat_node), Empty, true, true); | |
4876 | gnu_result = end_stmt_group (); | |
4877 | break; | |
4878 | ||
4879 | case N_Package_Body: | |
4880 | ||
1e17ef87 | 4881 | /* If this is the body of a generic package - do nothing. */ |
a1ab4c31 AC |
4882 | if (Ekind (Corresponding_Spec (gnat_node)) == E_Generic_Package) |
4883 | { | |
4884 | gnu_result = alloc_stmt_list (); | |
4885 | break; | |
4886 | } | |
4887 | ||
4888 | start_stmt_group (); | |
4889 | process_decls (Declarations (gnat_node), Empty, Empty, true, true); | |
4890 | ||
4891 | if (Present (Handled_Statement_Sequence (gnat_node))) | |
4892 | add_stmt (gnat_to_gnu (Handled_Statement_Sequence (gnat_node))); | |
4893 | ||
4894 | gnu_result = end_stmt_group (); | |
4895 | break; | |
4896 | ||
1e17ef87 EB |
4897 | /********************************/ |
4898 | /* Chapter 8: Visibility Rules */ | |
4899 | /********************************/ | |
a1ab4c31 AC |
4900 | |
4901 | case N_Use_Package_Clause: | |
4902 | case N_Use_Type_Clause: | |
1e17ef87 | 4903 | /* Nothing to do here - but these may appear in list of declarations. */ |
a1ab4c31 AC |
4904 | gnu_result = alloc_stmt_list (); |
4905 | break; | |
4906 | ||
1e17ef87 EB |
4907 | /*********************/ |
4908 | /* Chapter 9: Tasks */ | |
4909 | /*********************/ | |
a1ab4c31 AC |
4910 | |
4911 | case N_Protected_Type_Declaration: | |
4912 | gnu_result = alloc_stmt_list (); | |
4913 | break; | |
4914 | ||
4915 | case N_Single_Task_Declaration: | |
4916 | gnat_to_gnu_entity (Defining_Entity (gnat_node), NULL_TREE, 1); | |
4917 | gnu_result = alloc_stmt_list (); | |
4918 | break; | |
4919 | ||
1e17ef87 EB |
4920 | /*********************************************************/ |
4921 | /* Chapter 10: Program Structure and Compilation Issues */ | |
4922 | /*********************************************************/ | |
a1ab4c31 AC |
4923 | |
4924 | case N_Compilation_Unit: | |
a09d56d8 | 4925 | /* This is not called for the main unit on which gigi is invoked. */ |
a1ab4c31 AC |
4926 | Compilation_Unit_to_gnu (gnat_node); |
4927 | gnu_result = alloc_stmt_list (); | |
4928 | break; | |
4929 | ||
4930 | case N_Subprogram_Body_Stub: | |
4931 | case N_Package_Body_Stub: | |
4932 | case N_Protected_Body_Stub: | |
4933 | case N_Task_Body_Stub: | |
4934 | /* Simply process whatever unit is being inserted. */ | |
4935 | gnu_result = gnat_to_gnu (Unit (Library_Unit (gnat_node))); | |
4936 | break; | |
4937 | ||
4938 | case N_Subunit: | |
4939 | gnu_result = gnat_to_gnu (Proper_Body (gnat_node)); | |
4940 | break; | |
4941 | ||
4942 | /***************************/ | |
1e17ef87 | 4943 | /* Chapter 11: Exceptions */ |
a1ab4c31 AC |
4944 | /***************************/ |
4945 | ||
4946 | case N_Handled_Sequence_Of_Statements: | |
4947 | /* If there is an At_End procedure attached to this node, and the EH | |
4948 | mechanism is SJLJ, we must have at least a corresponding At_End | |
4949 | handler, unless the No_Exception_Handlers restriction is set. */ | |
4950 | gcc_assert (type_annotate_only | |
4951 | || Exception_Mechanism != Setjmp_Longjmp | |
4952 | || No (At_End_Proc (gnat_node)) | |
4953 | || Present (Exception_Handlers (gnat_node)) | |
4954 | || No_Exception_Handlers_Set ()); | |
4955 | ||
4956 | gnu_result = Handled_Sequence_Of_Statements_to_gnu (gnat_node); | |
4957 | break; | |
4958 | ||
4959 | case N_Exception_Handler: | |
4960 | if (Exception_Mechanism == Setjmp_Longjmp) | |
4961 | gnu_result = Exception_Handler_to_gnu_sjlj (gnat_node); | |
4962 | else if (Exception_Mechanism == Back_End_Exceptions) | |
4963 | gnu_result = Exception_Handler_to_gnu_zcx (gnat_node); | |
4964 | else | |
4965 | gcc_unreachable (); | |
4966 | ||
4967 | break; | |
4968 | ||
4969 | case N_Push_Constraint_Error_Label: | |
4970 | push_exception_label_stack (&gnu_constraint_error_label_stack, | |
4971 | Exception_Label (gnat_node)); | |
4972 | break; | |
4973 | ||
4974 | case N_Push_Storage_Error_Label: | |
4975 | push_exception_label_stack (&gnu_storage_error_label_stack, | |
4976 | Exception_Label (gnat_node)); | |
4977 | break; | |
4978 | ||
4979 | case N_Push_Program_Error_Label: | |
4980 | push_exception_label_stack (&gnu_program_error_label_stack, | |
4981 | Exception_Label (gnat_node)); | |
4982 | break; | |
4983 | ||
4984 | case N_Pop_Constraint_Error_Label: | |
4985 | gnu_constraint_error_label_stack | |
4986 | = TREE_CHAIN (gnu_constraint_error_label_stack); | |
4987 | break; | |
4988 | ||
4989 | case N_Pop_Storage_Error_Label: | |
4990 | gnu_storage_error_label_stack | |
4991 | = TREE_CHAIN (gnu_storage_error_label_stack); | |
4992 | break; | |
4993 | ||
4994 | case N_Pop_Program_Error_Label: | |
4995 | gnu_program_error_label_stack | |
4996 | = TREE_CHAIN (gnu_program_error_label_stack); | |
4997 | break; | |
4998 | ||
1e17ef87 EB |
4999 | /******************************/ |
5000 | /* Chapter 12: Generic Units */ | |
5001 | /******************************/ | |
a1ab4c31 AC |
5002 | |
5003 | case N_Generic_Function_Renaming_Declaration: | |
5004 | case N_Generic_Package_Renaming_Declaration: | |
5005 | case N_Generic_Procedure_Renaming_Declaration: | |
5006 | case N_Generic_Package_Declaration: | |
5007 | case N_Generic_Subprogram_Declaration: | |
5008 | case N_Package_Instantiation: | |
5009 | case N_Procedure_Instantiation: | |
5010 | case N_Function_Instantiation: | |
5011 | /* These nodes can appear on a declaration list but there is nothing to | |
5012 | to be done with them. */ | |
5013 | gnu_result = alloc_stmt_list (); | |
5014 | break; | |
5015 | ||
1e17ef87 EB |
5016 | /**************************************************/ |
5017 | /* Chapter 13: Representation Clauses and */ | |
5018 | /* Implementation-Dependent Features */ | |
5019 | /**************************************************/ | |
a1ab4c31 AC |
5020 | |
5021 | case N_Attribute_Definition_Clause: | |
a1ab4c31 AC |
5022 | gnu_result = alloc_stmt_list (); |
5023 | ||
8df2e902 EB |
5024 | /* The only one we need to deal with is 'Address since, for the others, |
5025 | the front-end puts the information elsewhere. */ | |
5026 | if (Get_Attribute_Id (Chars (gnat_node)) != Attr_Address) | |
5027 | break; | |
5028 | ||
5029 | /* And we only deal with 'Address if the object has a Freeze node. */ | |
5030 | gnat_temp = Entity (Name (gnat_node)); | |
5031 | if (No (Freeze_Node (gnat_temp))) | |
a1ab4c31 AC |
5032 | break; |
5033 | ||
8df2e902 EB |
5034 | /* Get the value to use as the address and save it as the equivalent |
5035 | for the object. When it is frozen, gnat_to_gnu_entity will do the | |
5036 | right thing. */ | |
5037 | save_gnu_tree (gnat_temp, gnat_to_gnu (Expression (gnat_node)), true); | |
a1ab4c31 AC |
5038 | break; |
5039 | ||
5040 | case N_Enumeration_Representation_Clause: | |
5041 | case N_Record_Representation_Clause: | |
5042 | case N_At_Clause: | |
5043 | /* We do nothing with these. SEM puts the information elsewhere. */ | |
5044 | gnu_result = alloc_stmt_list (); | |
5045 | break; | |
5046 | ||
5047 | case N_Code_Statement: | |
5048 | if (!type_annotate_only) | |
5049 | { | |
5050 | tree gnu_template = gnat_to_gnu (Asm_Template (gnat_node)); | |
5051 | tree gnu_inputs = NULL_TREE, gnu_outputs = NULL_TREE; | |
5052 | tree gnu_clobbers = NULL_TREE, tail; | |
5053 | bool allows_mem, allows_reg, fake; | |
5054 | int ninputs, noutputs, i; | |
5055 | const char **oconstraints; | |
5056 | const char *constraint; | |
5057 | char *clobber; | |
5058 | ||
5059 | /* First retrieve the 3 operand lists built by the front-end. */ | |
5060 | Setup_Asm_Outputs (gnat_node); | |
5061 | while (Present (gnat_temp = Asm_Output_Variable ())) | |
5062 | { | |
5063 | tree gnu_value = gnat_to_gnu (gnat_temp); | |
5064 | tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu | |
5065 | (Asm_Output_Constraint ())); | |
5066 | ||
5067 | gnu_outputs = tree_cons (gnu_constr, gnu_value, gnu_outputs); | |
5068 | Next_Asm_Output (); | |
5069 | } | |
5070 | ||
5071 | Setup_Asm_Inputs (gnat_node); | |
5072 | while (Present (gnat_temp = Asm_Input_Value ())) | |
5073 | { | |
5074 | tree gnu_value = gnat_to_gnu (gnat_temp); | |
5075 | tree gnu_constr = build_tree_list (NULL_TREE, gnat_to_gnu | |
5076 | (Asm_Input_Constraint ())); | |
5077 | ||
5078 | gnu_inputs = tree_cons (gnu_constr, gnu_value, gnu_inputs); | |
5079 | Next_Asm_Input (); | |
5080 | } | |
5081 | ||
5082 | Clobber_Setup (gnat_node); | |
5083 | while ((clobber = Clobber_Get_Next ())) | |
5084 | gnu_clobbers | |
5085 | = tree_cons (NULL_TREE, | |
5086 | build_string (strlen (clobber) + 1, clobber), | |
5087 | gnu_clobbers); | |
5088 | ||
1e17ef87 | 5089 | /* Then perform some standard checking and processing on the |
a1ab4c31 AC |
5090 | operands. In particular, mark them addressable if needed. */ |
5091 | gnu_outputs = nreverse (gnu_outputs); | |
5092 | noutputs = list_length (gnu_outputs); | |
5093 | gnu_inputs = nreverse (gnu_inputs); | |
5094 | ninputs = list_length (gnu_inputs); | |
5095 | oconstraints | |
5096 | = (const char **) alloca (noutputs * sizeof (const char *)); | |
5097 | ||
5098 | for (i = 0, tail = gnu_outputs; tail; ++i, tail = TREE_CHAIN (tail)) | |
5099 | { | |
5100 | tree output = TREE_VALUE (tail); | |
5101 | constraint | |
5102 | = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail))); | |
5103 | oconstraints[i] = constraint; | |
5104 | ||
5105 | if (parse_output_constraint (&constraint, i, ninputs, noutputs, | |
5106 | &allows_mem, &allows_reg, &fake)) | |
5107 | { | |
5108 | /* If the operand is going to end up in memory, | |
5109 | mark it addressable. Note that we don't test | |
5110 | allows_mem like in the input case below; this | |
5111 | is modelled on the C front-end. */ | |
5112 | if (!allows_reg | |
5113 | && !gnat_mark_addressable (output)) | |
5114 | output = error_mark_node; | |
5115 | } | |
5116 | else | |
5117 | output = error_mark_node; | |
5118 | ||
5119 | TREE_VALUE (tail) = output; | |
5120 | } | |
5121 | ||
5122 | for (i = 0, tail = gnu_inputs; tail; ++i, tail = TREE_CHAIN (tail)) | |
5123 | { | |
5124 | tree input = TREE_VALUE (tail); | |
5125 | constraint | |
5126 | = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail))); | |
5127 | ||
5128 | if (parse_input_constraint (&constraint, i, ninputs, noutputs, | |
5129 | 0, oconstraints, | |
5130 | &allows_mem, &allows_reg)) | |
5131 | { | |
5132 | /* If the operand is going to end up in memory, | |
5133 | mark it addressable. */ | |
5134 | if (!allows_reg && allows_mem | |
5135 | && !gnat_mark_addressable (input)) | |
5136 | input = error_mark_node; | |
5137 | } | |
5138 | else | |
5139 | input = error_mark_node; | |
5140 | ||
5141 | TREE_VALUE (tail) = input; | |
5142 | } | |
5143 | ||
1c384bf1 | 5144 | gnu_result = build5 (ASM_EXPR, void_type_node, |
a1ab4c31 | 5145 | gnu_template, gnu_outputs, |
1c384bf1 | 5146 | gnu_inputs, gnu_clobbers, NULL_TREE); |
a1ab4c31 AC |
5147 | ASM_VOLATILE_P (gnu_result) = Is_Asm_Volatile (gnat_node); |
5148 | } | |
5149 | else | |
5150 | gnu_result = alloc_stmt_list (); | |
5151 | ||
5152 | break; | |
5153 | ||
1e17ef87 EB |
5154 | /****************/ |
5155 | /* Added Nodes */ | |
5156 | /****************/ | |
a1ab4c31 AC |
5157 | |
5158 | case N_Freeze_Entity: | |
5159 | start_stmt_group (); | |
5160 | process_freeze_entity (gnat_node); | |
5161 | process_decls (Actions (gnat_node), Empty, Empty, true, true); | |
5162 | gnu_result = end_stmt_group (); | |
5163 | break; | |
5164 | ||
5165 | case N_Itype_Reference: | |
5166 | if (!present_gnu_tree (Itype (gnat_node))) | |
5167 | process_type (Itype (gnat_node)); | |
5168 | ||
5169 | gnu_result = alloc_stmt_list (); | |
5170 | break; | |
5171 | ||
5172 | case N_Free_Statement: | |
5173 | if (!type_annotate_only) | |
5174 | { | |
5175 | tree gnu_ptr = gnat_to_gnu (Expression (gnat_node)); | |
5176 | tree gnu_ptr_type = TREE_TYPE (gnu_ptr); | |
5177 | tree gnu_obj_type; | |
5178 | tree gnu_actual_obj_type = 0; | |
5179 | tree gnu_obj_size; | |
a1ab4c31 AC |
5180 | |
5181 | /* If this is a thin pointer, we must dereference it to create | |
5182 | a fat pointer, then go back below to a thin pointer. The | |
5183 | reason for this is that we need a fat pointer someplace in | |
5184 | order to properly compute the size. */ | |
315cff15 | 5185 | if (TYPE_IS_THIN_POINTER_P (TREE_TYPE (gnu_ptr))) |
a1ab4c31 AC |
5186 | gnu_ptr = build_unary_op (ADDR_EXPR, NULL_TREE, |
5187 | build_unary_op (INDIRECT_REF, NULL_TREE, | |
5188 | gnu_ptr)); | |
5189 | ||
5190 | /* If this is an unconstrained array, we know the object must | |
5191 | have been allocated with the template in front of the object. | |
5192 | So pass the template address, but get the total size. Do this | |
5193 | by converting to a thin pointer. */ | |
315cff15 | 5194 | if (TYPE_IS_FAT_POINTER_P (TREE_TYPE (gnu_ptr))) |
a1ab4c31 AC |
5195 | gnu_ptr |
5196 | = convert (build_pointer_type | |
5197 | (TYPE_OBJECT_RECORD_TYPE | |
5198 | (TYPE_UNCONSTRAINED_ARRAY (TREE_TYPE (gnu_ptr)))), | |
5199 | gnu_ptr); | |
5200 | ||
5201 | gnu_obj_type = TREE_TYPE (TREE_TYPE (gnu_ptr)); | |
5202 | ||
5203 | if (Present (Actual_Designated_Subtype (gnat_node))) | |
5204 | { | |
5205 | gnu_actual_obj_type | |
1e17ef87 | 5206 | = gnat_to_gnu_type (Actual_Designated_Subtype (gnat_node)); |
a1ab4c31 | 5207 | |
315cff15 | 5208 | if (TYPE_IS_FAT_OR_THIN_POINTER_P (gnu_ptr_type)) |
1e17ef87 EB |
5209 | gnu_actual_obj_type |
5210 | = build_unc_object_type_from_ptr (gnu_ptr_type, | |
5211 | gnu_actual_obj_type, | |
5212 | get_identifier ("DEALLOC")); | |
a1ab4c31 AC |
5213 | } |
5214 | else | |
5215 | gnu_actual_obj_type = gnu_obj_type; | |
5216 | ||
5217 | gnu_obj_size = TYPE_SIZE_UNIT (gnu_actual_obj_type); | |
a1ab4c31 AC |
5218 | |
5219 | if (TREE_CODE (gnu_obj_type) == RECORD_TYPE | |
5220 | && TYPE_CONTAINS_TEMPLATE_P (gnu_obj_type)) | |
5221 | { | |
5222 | tree gnu_char_ptr_type = build_pointer_type (char_type_node); | |
5223 | tree gnu_pos = byte_position (TYPE_FIELDS (gnu_obj_type)); | |
5224 | tree gnu_byte_offset | |
5225 | = convert (sizetype, | |
5226 | size_diffop (size_zero_node, gnu_pos)); | |
5227 | gnu_byte_offset = fold_build1 (NEGATE_EXPR, sizetype, gnu_byte_offset); | |
5228 | ||
5229 | gnu_ptr = convert (gnu_char_ptr_type, gnu_ptr); | |
5230 | gnu_ptr = build_binary_op (POINTER_PLUS_EXPR, gnu_char_ptr_type, | |
5231 | gnu_ptr, gnu_byte_offset); | |
5232 | } | |
5233 | ||
ff346f70 OH |
5234 | gnu_result |
5235 | = build_call_alloc_dealloc (gnu_ptr, gnu_obj_size, gnu_obj_type, | |
5236 | Procedure_To_Call (gnat_node), | |
5237 | Storage_Pool (gnat_node), | |
5238 | gnat_node); | |
a1ab4c31 AC |
5239 | } |
5240 | break; | |
5241 | ||
5242 | case N_Raise_Constraint_Error: | |
5243 | case N_Raise_Program_Error: | |
5244 | case N_Raise_Storage_Error: | |
5245 | if (type_annotate_only) | |
5246 | { | |
5247 | gnu_result = alloc_stmt_list (); | |
5248 | break; | |
5249 | } | |
5250 | ||
5251 | gnu_result_type = get_unpadded_type (Etype (gnat_node)); | |
5252 | gnu_result | |
3f13dd77 | 5253 | = build_call_raise (UI_To_Int (Reason (gnat_node)), gnat_node, kind); |
a1ab4c31 AC |
5254 | |
5255 | /* If the type is VOID, this is a statement, so we need to | |
5256 | generate the code for the call. Handle a Condition, if there | |
5257 | is one. */ | |
5258 | if (TREE_CODE (gnu_result_type) == VOID_TYPE) | |
5259 | { | |
5260 | set_expr_location_from_node (gnu_result, gnat_node); | |
5261 | ||
5262 | if (Present (Condition (gnat_node))) | |
5263 | gnu_result = build3 (COND_EXPR, void_type_node, | |
5264 | gnat_to_gnu (Condition (gnat_node)), | |
5265 | gnu_result, alloc_stmt_list ()); | |
5266 | } | |
5267 | else | |
5268 | gnu_result = build1 (NULL_EXPR, gnu_result_type, gnu_result); | |
5269 | break; | |
5270 | ||
5271 | case N_Validate_Unchecked_Conversion: | |
5272 | { | |
5273 | Entity_Id gnat_target_type = Target_Type (gnat_node); | |
5274 | tree gnu_source_type = gnat_to_gnu_type (Source_Type (gnat_node)); | |
5275 | tree gnu_target_type = gnat_to_gnu_type (gnat_target_type); | |
5276 | ||
5277 | /* No need for any warning in this case. */ | |
5278 | if (!flag_strict_aliasing) | |
5279 | ; | |
5280 | ||
5281 | /* If the result is a pointer type, see if we are either converting | |
5282 | from a non-pointer or from a pointer to a type with a different | |
5283 | alias set and warn if so. If the result is defined in the same | |
5284 | unit as this unchecked conversion, we can allow this because we | |
5285 | can know to make the pointer type behave properly. */ | |
5286 | else if (POINTER_TYPE_P (gnu_target_type) | |
5287 | && !In_Same_Source_Unit (gnat_target_type, gnat_node) | |
5288 | && !No_Strict_Aliasing (Underlying_Type (gnat_target_type))) | |
5289 | { | |
5290 | tree gnu_source_desig_type = POINTER_TYPE_P (gnu_source_type) | |
5291 | ? TREE_TYPE (gnu_source_type) | |
5292 | : NULL_TREE; | |
5293 | tree gnu_target_desig_type = TREE_TYPE (gnu_target_type); | |
5294 | ||
5295 | if ((TYPE_DUMMY_P (gnu_target_desig_type) | |
5296 | || get_alias_set (gnu_target_desig_type) != 0) | |
1e17ef87 | 5297 | && (!POINTER_TYPE_P (gnu_source_type) |
a1ab4c31 AC |
5298 | || (TYPE_DUMMY_P (gnu_source_desig_type) |
5299 | != TYPE_DUMMY_P (gnu_target_desig_type)) | |
5300 | || (TYPE_DUMMY_P (gnu_source_desig_type) | |
5301 | && gnu_source_desig_type != gnu_target_desig_type) | |
794511d2 EB |
5302 | || !alias_sets_conflict_p |
5303 | (get_alias_set (gnu_source_desig_type), | |
5304 | get_alias_set (gnu_target_desig_type)))) | |
a1ab4c31 AC |
5305 | { |
5306 | post_error_ne | |
5307 | ("?possible aliasing problem for type&", | |
5308 | gnat_node, Target_Type (gnat_node)); | |
5309 | post_error | |
5310 | ("\\?use -fno-strict-aliasing switch for references", | |
5311 | gnat_node); | |
5312 | post_error_ne | |
5313 | ("\\?or use `pragma No_Strict_Aliasing (&);`", | |
5314 | gnat_node, Target_Type (gnat_node)); | |
5315 | } | |
5316 | } | |
5317 | ||
5318 | /* But if the result is a fat pointer type, we have no mechanism to | |
5319 | do that, so we unconditionally warn in problematic cases. */ | |
315cff15 | 5320 | else if (TYPE_IS_FAT_POINTER_P (gnu_target_type)) |
a1ab4c31 AC |
5321 | { |
5322 | tree gnu_source_array_type | |
315cff15 | 5323 | = TYPE_IS_FAT_POINTER_P (gnu_source_type) |
a1ab4c31 AC |
5324 | ? TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_source_type))) |
5325 | : NULL_TREE; | |
5326 | tree gnu_target_array_type | |
5327 | = TREE_TYPE (TREE_TYPE (TYPE_FIELDS (gnu_target_type))); | |
5328 | ||
5329 | if ((TYPE_DUMMY_P (gnu_target_array_type) | |
5330 | || get_alias_set (gnu_target_array_type) != 0) | |
315cff15 | 5331 | && (!TYPE_IS_FAT_POINTER_P (gnu_source_type) |
a1ab4c31 AC |
5332 | || (TYPE_DUMMY_P (gnu_source_array_type) |
5333 | != TYPE_DUMMY_P (gnu_target_array_type)) | |
5334 | || (TYPE_DUMMY_P (gnu_source_array_type) | |
5335 | && gnu_source_array_type != gnu_target_array_type) | |
794511d2 EB |
5336 | || !alias_sets_conflict_p |
5337 | (get_alias_set (gnu_source_array_type), | |
5338 | get_alias_set (gnu_target_array_type)))) | |
a1ab4c31 AC |
5339 | { |
5340 | post_error_ne | |
5341 | ("?possible aliasing problem for type&", | |
5342 | gnat_node, Target_Type (gnat_node)); | |
5343 | post_error | |
5344 | ("\\?use -fno-strict-aliasing switch for references", | |
5345 | gnat_node); | |
5346 | } | |
5347 | } | |
5348 | } | |
5349 | gnu_result = alloc_stmt_list (); | |
5350 | break; | |
5351 | ||
a1ab4c31 | 5352 | default: |
a09d56d8 EB |
5353 | /* SCIL nodes require no processing for GCC. Other nodes should only |
5354 | be present when annotating types. */ | |
5355 | gcc_assert (IN (kind, N_SCIL_Node) || type_annotate_only); | |
a1ab4c31 AC |
5356 | gnu_result = alloc_stmt_list (); |
5357 | } | |
5358 | ||
a09d56d8 | 5359 | /* If we pushed the processing of the elaboration routine, pop it back. */ |
a1ab4c31 | 5360 | if (went_into_elab_proc) |
a09d56d8 | 5361 | current_function_decl = NULL_TREE; |
a1ab4c31 AC |
5362 | |
5363 | /* Set the location information on the result if it is a real expression. | |
5364 | References can be reused for multiple GNAT nodes and they would get | |
5365 | the location information of their last use. Note that we may have | |
5366 | no result if we tried to build a CALL_EXPR node to a procedure with | |
5367 | no side-effects and optimization is enabled. */ | |
5368 | if (gnu_result | |
5369 | && EXPR_P (gnu_result) | |
5370 | && TREE_CODE (gnu_result) != NOP_EXPR | |
ca80e52b EB |
5371 | && !REFERENCE_CLASS_P (gnu_result) |
5372 | && !EXPR_HAS_LOCATION (gnu_result)) | |
a1ab4c31 AC |
5373 | set_expr_location_from_node (gnu_result, gnat_node); |
5374 | ||
5375 | /* If we're supposed to return something of void_type, it means we have | |
5376 | something we're elaborating for effect, so just return. */ | |
5377 | if (TREE_CODE (gnu_result_type) == VOID_TYPE) | |
5378 | return gnu_result; | |
5379 | ||
c1abd261 EB |
5380 | /* If the result is a constant that overflowed, raise Constraint_Error. */ |
5381 | if (TREE_CODE (gnu_result) == INTEGER_CST && TREE_OVERFLOW (gnu_result)) | |
a1ab4c31 AC |
5382 | { |
5383 | post_error ("Constraint_Error will be raised at run-time?", gnat_node); | |
a1ab4c31 AC |
5384 | gnu_result |
5385 | = build1 (NULL_EXPR, gnu_result_type, | |
5386 | build_call_raise (CE_Overflow_Check_Failed, gnat_node, | |
5387 | N_Raise_Constraint_Error)); | |
5388 | } | |
5389 | ||
5390 | /* If our result has side-effects and is of an unconstrained type, | |
5391 | make a SAVE_EXPR so that we can be sure it will only be referenced | |
5392 | once. Note we must do this before any conversions. */ | |
5393 | if (TREE_SIDE_EFFECTS (gnu_result) | |
5394 | && (TREE_CODE (gnu_result_type) == UNCONSTRAINED_ARRAY_TYPE | |
5395 | || CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)))) | |
7d7a1fe8 | 5396 | gnu_result = gnat_stabilize_reference (gnu_result, false, NULL); |
a1ab4c31 AC |
5397 | |
5398 | /* Now convert the result to the result type, unless we are in one of the | |
5399 | following cases: | |
5400 | ||
5401 | 1. If this is the Name of an assignment statement or a parameter of | |
5402 | a procedure call, return the result almost unmodified since the | |
5403 | RHS will have to be converted to our type in that case, unless | |
c2efda0d EB |
5404 | the result type has a simpler size. Likewise if there is just |
5405 | a no-op unchecked conversion in-between. Similarly, don't convert | |
a1ab4c31 AC |
5406 | integral types that are the operands of an unchecked conversion |
5407 | since we need to ignore those conversions (for 'Valid). | |
5408 | ||
5409 | 2. If we have a label (which doesn't have any well-defined type), a | |
5410 | field or an error, return the result almost unmodified. Also don't | |
5411 | do the conversion if the result type involves a PLACEHOLDER_EXPR in | |
5412 | its size since those are the cases where the front end may have the | |
5413 | type wrong due to "instantiating" the unconstrained record with | |
5414 | discriminant values. Similarly, if the two types are record types | |
5415 | with the same name don't convert. This will be the case when we are | |
5416 | converting from a packable version of a type to its original type and | |
5417 | we need those conversions to be NOPs in order for assignments into | |
5418 | these types to work properly. | |
5419 | ||
5420 | 3. If the type is void or if we have no result, return error_mark_node | |
5421 | to show we have no result. | |
5422 | ||
5423 | 4. Finally, if the type of the result is already correct. */ | |
5424 | ||
5425 | if (Present (Parent (gnat_node)) | |
5426 | && ((Nkind (Parent (gnat_node)) == N_Assignment_Statement | |
5427 | && Name (Parent (gnat_node)) == gnat_node) | |
c2efda0d | 5428 | || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion |
4f8a6678 | 5429 | && unchecked_conversion_nop (Parent (gnat_node))) |
a1ab4c31 AC |
5430 | || (Nkind (Parent (gnat_node)) == N_Procedure_Call_Statement |
5431 | && Name (Parent (gnat_node)) != gnat_node) | |
5432 | || Nkind (Parent (gnat_node)) == N_Parameter_Association | |
5433 | || (Nkind (Parent (gnat_node)) == N_Unchecked_Type_Conversion | |
5434 | && !AGGREGATE_TYPE_P (gnu_result_type) | |
5435 | && !AGGREGATE_TYPE_P (TREE_TYPE (gnu_result)))) | |
5436 | && !(TYPE_SIZE (gnu_result_type) | |
5437 | && TYPE_SIZE (TREE_TYPE (gnu_result)) | |
5438 | && (AGGREGATE_TYPE_P (gnu_result_type) | |
5439 | == AGGREGATE_TYPE_P (TREE_TYPE (gnu_result))) | |
5440 | && ((TREE_CODE (TYPE_SIZE (gnu_result_type)) == INTEGER_CST | |
5441 | && (TREE_CODE (TYPE_SIZE (TREE_TYPE (gnu_result))) | |
5442 | != INTEGER_CST)) | |
5443 | || (TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST | |
5444 | && !CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type)) | |
5445 | && (CONTAINS_PLACEHOLDER_P | |
5446 | (TYPE_SIZE (TREE_TYPE (gnu_result)))))) | |
5447 | && !(TREE_CODE (gnu_result_type) == RECORD_TYPE | |
5448 | && TYPE_JUSTIFIED_MODULAR_P (gnu_result_type)))) | |
5449 | { | |
5450 | /* Remove padding only if the inner object is of self-referential | |
5451 | size: in that case it must be an object of unconstrained type | |
5452 | with a default discriminant and we want to avoid copying too | |
5453 | much data. */ | |
315cff15 | 5454 | if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result)) |
a1ab4c31 AC |
5455 | && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (TREE_TYPE (TYPE_FIELDS |
5456 | (TREE_TYPE (gnu_result)))))) | |
5457 | gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))), | |
5458 | gnu_result); | |
5459 | } | |
5460 | ||
5461 | else if (TREE_CODE (gnu_result) == LABEL_DECL | |
5462 | || TREE_CODE (gnu_result) == FIELD_DECL | |
5463 | || TREE_CODE (gnu_result) == ERROR_MARK | |
5464 | || (TYPE_SIZE (gnu_result_type) | |
5465 | && TREE_CODE (TYPE_SIZE (gnu_result_type)) != INTEGER_CST | |
5466 | && TREE_CODE (gnu_result) != INDIRECT_REF | |
5467 | && CONTAINS_PLACEHOLDER_P (TYPE_SIZE (gnu_result_type))) | |
5468 | || ((TYPE_NAME (gnu_result_type) | |
5469 | == TYPE_NAME (TREE_TYPE (gnu_result))) | |
5470 | && TREE_CODE (gnu_result_type) == RECORD_TYPE | |
5471 | && TREE_CODE (TREE_TYPE (gnu_result)) == RECORD_TYPE)) | |
5472 | { | |
5473 | /* Remove any padding. */ | |
315cff15 | 5474 | if (TYPE_IS_PADDING_P (TREE_TYPE (gnu_result))) |
a1ab4c31 AC |
5475 | gnu_result = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (gnu_result))), |
5476 | gnu_result); | |
5477 | } | |
5478 | ||
5479 | else if (gnu_result == error_mark_node || gnu_result_type == void_type_node) | |
5480 | gnu_result = error_mark_node; | |
5481 | ||
5482 | else if (gnu_result_type != TREE_TYPE (gnu_result)) | |
5483 | gnu_result = convert (gnu_result_type, gnu_result); | |
5484 | ||
5485 | /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */ | |
5486 | while ((TREE_CODE (gnu_result) == NOP_EXPR | |
5487 | || TREE_CODE (gnu_result) == NON_LVALUE_EXPR) | |
5488 | && TREE_TYPE (TREE_OPERAND (gnu_result, 0)) == TREE_TYPE (gnu_result)) | |
5489 | gnu_result = TREE_OPERAND (gnu_result, 0); | |
5490 | ||
5491 | return gnu_result; | |
5492 | } | |
5493 | \f | |
5494 | /* Subroutine of above to push the exception label stack. GNU_STACK is | |
5495 | a pointer to the stack to update and GNAT_LABEL, if present, is the | |
5496 | label to push onto the stack. */ | |
5497 | ||
5498 | static void | |
5499 | push_exception_label_stack (tree *gnu_stack, Entity_Id gnat_label) | |
5500 | { | |
5501 | tree gnu_label = (Present (gnat_label) | |
5502 | ? gnat_to_gnu_entity (gnat_label, NULL_TREE, 0) | |
5503 | : NULL_TREE); | |
5504 | ||
5505 | *gnu_stack = tree_cons (NULL_TREE, gnu_label, *gnu_stack); | |
5506 | } | |
5507 | \f | |
5508 | /* Record the current code position in GNAT_NODE. */ | |
5509 | ||
5510 | static void | |
5511 | record_code_position (Node_Id gnat_node) | |
5512 | { | |
5513 | tree stmt_stmt = build1 (STMT_STMT, void_type_node, NULL_TREE); | |
5514 | ||
5515 | add_stmt_with_node (stmt_stmt, gnat_node); | |
5516 | save_gnu_tree (gnat_node, stmt_stmt, true); | |
5517 | } | |
5518 | ||
5519 | /* Insert the code for GNAT_NODE at the position saved for that node. */ | |
5520 | ||
5521 | static void | |
5522 | insert_code_for (Node_Id gnat_node) | |
5523 | { | |
5524 | STMT_STMT_STMT (get_gnu_tree (gnat_node)) = gnat_to_gnu (gnat_node); | |
5525 | save_gnu_tree (gnat_node, NULL_TREE, true); | |
5526 | } | |
5527 | \f | |
5528 | /* Start a new statement group chained to the previous group. */ | |
5529 | ||
5530 | void | |
5531 | start_stmt_group (void) | |
5532 | { | |
5533 | struct stmt_group *group = stmt_group_free_list; | |
5534 | ||
5535 | /* First see if we can get one from the free list. */ | |
5536 | if (group) | |
5537 | stmt_group_free_list = group->previous; | |
5538 | else | |
5539 | group = (struct stmt_group *) ggc_alloc (sizeof (struct stmt_group)); | |
5540 | ||
5541 | group->previous = current_stmt_group; | |
5542 | group->stmt_list = group->block = group->cleanups = NULL_TREE; | |
5543 | current_stmt_group = group; | |
5544 | } | |
5545 | ||
5546 | /* Add GNU_STMT to the current statement group. */ | |
5547 | ||
5548 | void | |
5549 | add_stmt (tree gnu_stmt) | |
5550 | { | |
5551 | append_to_statement_list (gnu_stmt, ¤t_stmt_group->stmt_list); | |
5552 | } | |
5553 | ||
5554 | /* Similar, but set the location of GNU_STMT to that of GNAT_NODE. */ | |
5555 | ||
5556 | void | |
5557 | add_stmt_with_node (tree gnu_stmt, Node_Id gnat_node) | |
5558 | { | |
5559 | if (Present (gnat_node)) | |
5560 | set_expr_location_from_node (gnu_stmt, gnat_node); | |
5561 | add_stmt (gnu_stmt); | |
5562 | } | |
5563 | ||
5564 | /* Add a declaration statement for GNU_DECL to the current statement group. | |
5565 | Get SLOC from Entity_Id. */ | |
5566 | ||
5567 | void | |
5568 | add_decl_expr (tree gnu_decl, Entity_Id gnat_entity) | |
5569 | { | |
5570 | tree type = TREE_TYPE (gnu_decl); | |
5571 | tree gnu_stmt, gnu_init, t; | |
5572 | ||
5573 | /* If this is a variable that Gigi is to ignore, we may have been given | |
5574 | an ERROR_MARK. So test for it. We also might have been given a | |
5575 | reference for a renaming. So only do something for a decl. Also | |
5576 | ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */ | |
5577 | if (!DECL_P (gnu_decl) | |
5578 | || (TREE_CODE (gnu_decl) == TYPE_DECL | |
5579 | && TREE_CODE (type) == UNCONSTRAINED_ARRAY_TYPE)) | |
5580 | return; | |
5581 | ||
5582 | gnu_stmt = build1 (DECL_EXPR, void_type_node, gnu_decl); | |
5583 | ||
5584 | /* If we are global, we don't want to actually output the DECL_EXPR for | |
5585 | this decl since we already have evaluated the expressions in the | |
5586 | sizes and positions as globals and doing it again would be wrong. */ | |
5587 | if (global_bindings_p ()) | |
5588 | { | |
5589 | /* Mark everything as used to prevent node sharing with subprograms. | |
5590 | Note that walk_tree knows how to deal with TYPE_DECL, but neither | |
5591 | VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */ | |
3f13dd77 | 5592 | MARK_VISITED (gnu_stmt); |
a1ab4c31 AC |
5593 | if (TREE_CODE (gnu_decl) == VAR_DECL |
5594 | || TREE_CODE (gnu_decl) == CONST_DECL) | |
5595 | { | |
3f13dd77 EB |
5596 | MARK_VISITED (DECL_SIZE (gnu_decl)); |
5597 | MARK_VISITED (DECL_SIZE_UNIT (gnu_decl)); | |
5598 | MARK_VISITED (DECL_INITIAL (gnu_decl)); | |
a1ab4c31 | 5599 | } |
321e10dd EB |
5600 | /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */ |
5601 | else if (TREE_CODE (gnu_decl) == TYPE_DECL | |
5602 | && ((TREE_CODE (type) == RECORD_TYPE | |
5603 | && !TYPE_FAT_POINTER_P (type)) | |
5604 | || TREE_CODE (type) == UNION_TYPE | |
5605 | || TREE_CODE (type) == QUAL_UNION_TYPE)) | |
5606 | MARK_VISITED (TYPE_ADA_SIZE (type)); | |
a1ab4c31 AC |
5607 | } |
5608 | else | |
5609 | add_stmt_with_node (gnu_stmt, gnat_entity); | |
5610 | ||
5611 | /* If this is a variable and an initializer is attached to it, it must be | |
5612 | valid for the context. Similar to init_const in create_var_decl_1. */ | |
5613 | if (TREE_CODE (gnu_decl) == VAR_DECL | |
5614 | && (gnu_init = DECL_INITIAL (gnu_decl)) != NULL_TREE | |
5615 | && (!gnat_types_compatible_p (type, TREE_TYPE (gnu_init)) | |
5616 | || (TREE_STATIC (gnu_decl) | |
5617 | && !initializer_constant_valid_p (gnu_init, | |
5618 | TREE_TYPE (gnu_init))))) | |
5619 | { | |
5620 | /* If GNU_DECL has a padded type, convert it to the unpadded | |
5621 | type so the assignment is done properly. */ | |
315cff15 | 5622 | if (TYPE_IS_PADDING_P (type)) |
a1ab4c31 AC |
5623 | t = convert (TREE_TYPE (TYPE_FIELDS (type)), gnu_decl); |
5624 | else | |
5625 | t = gnu_decl; | |
5626 | ||
d47d0a8d | 5627 | gnu_stmt = build_binary_op (INIT_EXPR, NULL_TREE, t, gnu_init); |
a1ab4c31 AC |
5628 | |
5629 | DECL_INITIAL (gnu_decl) = NULL_TREE; | |
5630 | if (TREE_READONLY (gnu_decl)) | |
5631 | { | |
5632 | TREE_READONLY (gnu_decl) = 0; | |
5633 | DECL_READONLY_ONCE_ELAB (gnu_decl) = 1; | |
5634 | } | |
5635 | ||
5636 | add_stmt_with_node (gnu_stmt, gnat_entity); | |
5637 | } | |
5638 | } | |
5639 | ||
5640 | /* Callback for walk_tree to mark the visited trees rooted at *TP. */ | |
5641 | ||
5642 | static tree | |
5643 | mark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) | |
5644 | { | |
3f13dd77 EB |
5645 | tree t = *tp; |
5646 | ||
5647 | if (TREE_VISITED (t)) | |
a1ab4c31 AC |
5648 | *walk_subtrees = 0; |
5649 | ||
5650 | /* Don't mark a dummy type as visited because we want to mark its sizes | |
5651 | and fields once it's filled in. */ | |
3f13dd77 EB |
5652 | else if (!TYPE_IS_DUMMY_P (t)) |
5653 | TREE_VISITED (t) = 1; | |
a1ab4c31 | 5654 | |
3f13dd77 EB |
5655 | if (TYPE_P (t)) |
5656 | TYPE_SIZES_GIMPLIFIED (t) = 1; | |
a1ab4c31 AC |
5657 | |
5658 | return NULL_TREE; | |
5659 | } | |
5660 | ||
3f13dd77 EB |
5661 | /* Mark nodes rooted at T with TREE_VISITED and types as having their |
5662 | sized gimplified. We use this to indicate all variable sizes and | |
5663 | positions in global types may not be shared by any subprogram. */ | |
5664 | ||
5665 | void | |
5666 | mark_visited (tree t) | |
5667 | { | |
5668 | walk_tree (&t, mark_visited_r, NULL, NULL); | |
5669 | } | |
5670 | ||
a1ab4c31 AC |
5671 | /* Utility function to unshare expressions wrapped up in a SAVE_EXPR. */ |
5672 | ||
5673 | static tree | |
5674 | unshare_save_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, | |
5675 | void *data ATTRIBUTE_UNUSED) | |
5676 | { | |
5677 | tree t = *tp; | |
5678 | ||
5679 | if (TREE_CODE (t) == SAVE_EXPR) | |
5680 | TREE_OPERAND (t, 0) = unshare_expr (TREE_OPERAND (t, 0)); | |
5681 | ||
5682 | return NULL_TREE; | |
5683 | } | |
5684 | ||
a1ab4c31 AC |
5685 | /* Add GNU_CLEANUP, a cleanup action, to the current code group and |
5686 | set its location to that of GNAT_NODE if present. */ | |
5687 | ||
5688 | static void | |
5689 | add_cleanup (tree gnu_cleanup, Node_Id gnat_node) | |
5690 | { | |
5691 | if (Present (gnat_node)) | |
5692 | set_expr_location_from_node (gnu_cleanup, gnat_node); | |
5693 | append_to_statement_list (gnu_cleanup, ¤t_stmt_group->cleanups); | |
5694 | } | |
5695 | ||
5696 | /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */ | |
5697 | ||
5698 | void | |
5699 | set_block_for_group (tree gnu_block) | |
5700 | { | |
5701 | gcc_assert (!current_stmt_group->block); | |
5702 | current_stmt_group->block = gnu_block; | |
5703 | } | |
5704 | ||
5705 | /* Return code corresponding to the current code group. It is normally | |
5706 | a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if | |
5707 | BLOCK or cleanups were set. */ | |
5708 | ||
5709 | tree | |
5710 | end_stmt_group (void) | |
5711 | { | |
5712 | struct stmt_group *group = current_stmt_group; | |
5713 | tree gnu_retval = group->stmt_list; | |
5714 | ||
5715 | /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there | |
5716 | are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK, | |
5717 | make a BIND_EXPR. Note that we nest in that because the cleanup may | |
5718 | reference variables in the block. */ | |
5719 | if (gnu_retval == NULL_TREE) | |
5720 | gnu_retval = alloc_stmt_list (); | |
5721 | ||
5722 | if (group->cleanups) | |
5723 | gnu_retval = build2 (TRY_FINALLY_EXPR, void_type_node, gnu_retval, | |
5724 | group->cleanups); | |
5725 | ||
5726 | if (current_stmt_group->block) | |
5727 | gnu_retval = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (group->block), | |
5728 | gnu_retval, group->block); | |
5729 | ||
5730 | /* Remove this group from the stack and add it to the free list. */ | |
5731 | current_stmt_group = group->previous; | |
5732 | group->previous = stmt_group_free_list; | |
5733 | stmt_group_free_list = group; | |
5734 | ||
5735 | return gnu_retval; | |
5736 | } | |
5737 | ||
5738 | /* Add a list of statements from GNAT_LIST, a possibly-empty list of | |
5739 | statements.*/ | |
5740 | ||
5741 | static void | |
5742 | add_stmt_list (List_Id gnat_list) | |
5743 | { | |
5744 | Node_Id gnat_node; | |
5745 | ||
5746 | if (Present (gnat_list)) | |
5747 | for (gnat_node = First (gnat_list); Present (gnat_node); | |
5748 | gnat_node = Next (gnat_node)) | |
5749 | add_stmt (gnat_to_gnu (gnat_node)); | |
5750 | } | |
5751 | ||
5752 | /* Build a tree from GNAT_LIST, a possibly-empty list of statements. | |
5753 | If BINDING_P is true, push and pop a binding level around the list. */ | |
5754 | ||
5755 | static tree | |
5756 | build_stmt_group (List_Id gnat_list, bool binding_p) | |
5757 | { | |
5758 | start_stmt_group (); | |
5759 | if (binding_p) | |
5760 | gnat_pushlevel (); | |
5761 | ||
5762 | add_stmt_list (gnat_list); | |
5763 | if (binding_p) | |
5764 | gnat_poplevel (); | |
5765 | ||
5766 | return end_stmt_group (); | |
5767 | } | |
5768 | \f | |
5769 | /* Push and pop routines for stacks. We keep a free list around so we | |
5770 | don't waste tree nodes. */ | |
5771 | ||
5772 | static void | |
5773 | push_stack (tree *gnu_stack_ptr, tree gnu_purpose, tree gnu_value) | |
5774 | { | |
5775 | tree gnu_node = gnu_stack_free_list; | |
5776 | ||
5777 | if (gnu_node) | |
5778 | { | |
5779 | gnu_stack_free_list = TREE_CHAIN (gnu_node); | |
5780 | TREE_CHAIN (gnu_node) = *gnu_stack_ptr; | |
5781 | TREE_PURPOSE (gnu_node) = gnu_purpose; | |
5782 | TREE_VALUE (gnu_node) = gnu_value; | |
5783 | } | |
5784 | else | |
5785 | gnu_node = tree_cons (gnu_purpose, gnu_value, *gnu_stack_ptr); | |
5786 | ||
5787 | *gnu_stack_ptr = gnu_node; | |
5788 | } | |
5789 | ||
5790 | static void | |
5791 | pop_stack (tree *gnu_stack_ptr) | |
5792 | { | |
5793 | tree gnu_node = *gnu_stack_ptr; | |
5794 | ||
5795 | *gnu_stack_ptr = TREE_CHAIN (gnu_node); | |
5796 | TREE_CHAIN (gnu_node) = gnu_stack_free_list; | |
5797 | gnu_stack_free_list = gnu_node; | |
5798 | } | |
5799 | \f | |
5800 | /* Generate GIMPLE in place for the expression at *EXPR_P. */ | |
5801 | ||
5802 | int | |
5803 | gnat_gimplify_expr (tree *expr_p, gimple_seq *pre_p, | |
5804 | gimple_seq *post_p ATTRIBUTE_UNUSED) | |
5805 | { | |
5806 | tree expr = *expr_p; | |
5807 | tree op; | |
5808 | ||
5809 | if (IS_ADA_STMT (expr)) | |
5810 | return gnat_gimplify_stmt (expr_p); | |
5811 | ||
5812 | switch (TREE_CODE (expr)) | |
5813 | { | |
5814 | case NULL_EXPR: | |
5815 | /* If this is for a scalar, just make a VAR_DECL for it. If for | |
5816 | an aggregate, get a null pointer of the appropriate type and | |
5817 | dereference it. */ | |
5818 | if (AGGREGATE_TYPE_P (TREE_TYPE (expr))) | |
5819 | *expr_p = build1 (INDIRECT_REF, TREE_TYPE (expr), | |
5820 | convert (build_pointer_type (TREE_TYPE (expr)), | |
5821 | integer_zero_node)); | |
5822 | else | |
5823 | { | |
5824 | *expr_p = create_tmp_var (TREE_TYPE (expr), NULL); | |
5825 | TREE_NO_WARNING (*expr_p) = 1; | |
5826 | } | |
5827 | ||
5828 | gimplify_and_add (TREE_OPERAND (expr, 0), pre_p); | |
5829 | return GS_OK; | |
5830 | ||
5831 | case UNCONSTRAINED_ARRAY_REF: | |
5832 | /* We should only do this if we are just elaborating for side-effects, | |
5833 | but we can't know that yet. */ | |
5834 | *expr_p = TREE_OPERAND (*expr_p, 0); | |
5835 | return GS_OK; | |
5836 | ||
5837 | case ADDR_EXPR: | |
5838 | op = TREE_OPERAND (expr, 0); | |
5839 | ||
cb3d597d | 5840 | if (TREE_CODE (op) == CONSTRUCTOR) |
a1ab4c31 | 5841 | { |
cb3d597d EB |
5842 | /* If we are taking the address of a constant CONSTRUCTOR, make sure |
5843 | it is put into static memory. We know it's going to be read-only | |
5844 | given the semantics we have and it must be in static memory when | |
5845 | the reference is in an elaboration procedure. */ | |
5846 | if (TREE_CONSTANT (op)) | |
5847 | { | |
5848 | tree new_var = create_tmp_var_raw (TREE_TYPE (op), "C"); | |
5849 | TREE_ADDRESSABLE (new_var) = 1; | |
5850 | gimple_add_tmp_var (new_var); | |
5851 | ||
5852 | TREE_READONLY (new_var) = 1; | |
5853 | TREE_STATIC (new_var) = 1; | |
5854 | DECL_INITIAL (new_var) = op; | |
a1ab4c31 | 5855 | |
cb3d597d EB |
5856 | TREE_OPERAND (expr, 0) = new_var; |
5857 | recompute_tree_invariant_for_addr_expr (expr); | |
5858 | } | |
5859 | ||
5860 | /* Otherwise explicitly create the local temporary. That's required | |
5861 | if the type is passed by reference. */ | |
5862 | else | |
5863 | { | |
5864 | tree mod, new_var = create_tmp_var_raw (TREE_TYPE (op), "C"); | |
5865 | TREE_ADDRESSABLE (new_var) = 1; | |
5866 | gimple_add_tmp_var (new_var); | |
5867 | ||
5868 | mod = build2 (INIT_EXPR, TREE_TYPE (new_var), new_var, op); | |
5869 | gimplify_and_add (mod, pre_p); | |
5870 | ||
5871 | TREE_OPERAND (expr, 0) = new_var; | |
5872 | recompute_tree_invariant_for_addr_expr (expr); | |
5873 | } | |
a1ab4c31 | 5874 | |
a1ab4c31 AC |
5875 | return GS_ALL_DONE; |
5876 | } | |
5877 | ||
456976d8 EB |
5878 | return GS_UNHANDLED; |
5879 | ||
5880 | case DECL_EXPR: | |
5881 | op = DECL_EXPR_DECL (expr); | |
5882 | ||
5883 | /* The expressions for the RM bounds must be gimplified to ensure that | |
5884 | they are properly elaborated. See gimplify_decl_expr. */ | |
5885 | if ((TREE_CODE (op) == TYPE_DECL || TREE_CODE (op) == VAR_DECL) | |
5886 | && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (op))) | |
5887 | switch (TREE_CODE (TREE_TYPE (op))) | |
42c08997 | 5888 | { |
456976d8 EB |
5889 | case INTEGER_TYPE: |
5890 | case ENUMERAL_TYPE: | |
5891 | case BOOLEAN_TYPE: | |
5892 | case REAL_TYPE: | |
5893 | { | |
5894 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (op)), t, val; | |
5895 | ||
5896 | val = TYPE_RM_MIN_VALUE (type); | |
5897 | if (val) | |
5898 | { | |
5899 | gimplify_one_sizepos (&val, pre_p); | |
5900 | for (t = type; t; t = TYPE_NEXT_VARIANT (t)) | |
5901 | SET_TYPE_RM_MIN_VALUE (t, val); | |
5902 | } | |
5903 | ||
5904 | val = TYPE_RM_MAX_VALUE (type); | |
5905 | if (val) | |
5906 | { | |
5907 | gimplify_one_sizepos (&val, pre_p); | |
5908 | for (t = type; t; t = TYPE_NEXT_VARIANT (t)) | |
5909 | SET_TYPE_RM_MAX_VALUE (t, val); | |
5910 | } | |
5911 | ||
5912 | } | |
5913 | break; | |
5914 | ||
5915 | default: | |
5916 | break; | |
42c08997 | 5917 | } |
456976d8 | 5918 | |
a1ab4c31 AC |
5919 | /* ... fall through ... */ |
5920 | ||
5921 | default: | |
5922 | return GS_UNHANDLED; | |
5923 | } | |
5924 | } | |
5925 | ||
5926 | /* Generate GIMPLE in place for the statement at *STMT_P. */ | |
5927 | ||
5928 | static enum gimplify_status | |
5929 | gnat_gimplify_stmt (tree *stmt_p) | |
5930 | { | |
5931 | tree stmt = *stmt_p; | |
5932 | ||
5933 | switch (TREE_CODE (stmt)) | |
5934 | { | |
5935 | case STMT_STMT: | |
5936 | *stmt_p = STMT_STMT_STMT (stmt); | |
5937 | return GS_OK; | |
5938 | ||
5939 | case LOOP_STMT: | |
5940 | { | |
c172df28 | 5941 | tree gnu_start_label = create_artificial_label (input_location); |
a1ab4c31 AC |
5942 | tree gnu_end_label = LOOP_STMT_LABEL (stmt); |
5943 | tree t; | |
5944 | ||
5945 | /* Set to emit the statements of the loop. */ | |
5946 | *stmt_p = NULL_TREE; | |
5947 | ||
5948 | /* We first emit the start label and then a conditional jump to | |
5949 | the end label if there's a top condition, then the body of the | |
5950 | loop, then a conditional branch to the end label, then the update, | |
5951 | if any, and finally a jump to the start label and the definition | |
5952 | of the end label. */ | |
5953 | append_to_statement_list (build1 (LABEL_EXPR, void_type_node, | |
5954 | gnu_start_label), | |
5955 | stmt_p); | |
5956 | ||
5957 | if (LOOP_STMT_TOP_COND (stmt)) | |
5958 | append_to_statement_list (build3 (COND_EXPR, void_type_node, | |
5959 | LOOP_STMT_TOP_COND (stmt), | |
5960 | alloc_stmt_list (), | |
5961 | build1 (GOTO_EXPR, | |
5962 | void_type_node, | |
5963 | gnu_end_label)), | |
5964 | stmt_p); | |
5965 | ||
5966 | append_to_statement_list (LOOP_STMT_BODY (stmt), stmt_p); | |
5967 | ||
5968 | if (LOOP_STMT_BOT_COND (stmt)) | |
5969 | append_to_statement_list (build3 (COND_EXPR, void_type_node, | |
5970 | LOOP_STMT_BOT_COND (stmt), | |
5971 | alloc_stmt_list (), | |
5972 | build1 (GOTO_EXPR, | |
5973 | void_type_node, | |
5974 | gnu_end_label)), | |
5975 | stmt_p); | |
5976 | ||
5977 | if (LOOP_STMT_UPDATE (stmt)) | |
5978 | append_to_statement_list (LOOP_STMT_UPDATE (stmt), stmt_p); | |
5979 | ||
5980 | t = build1 (GOTO_EXPR, void_type_node, gnu_start_label); | |
5981 | SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (gnu_end_label)); | |
5982 | append_to_statement_list (t, stmt_p); | |
5983 | ||
5984 | append_to_statement_list (build1 (LABEL_EXPR, void_type_node, | |
5985 | gnu_end_label), | |
5986 | stmt_p); | |
5987 | return GS_OK; | |
5988 | } | |
5989 | ||
5990 | case EXIT_STMT: | |
5991 | /* Build a statement to jump to the corresponding end label, then | |
5992 | see if it needs to be conditional. */ | |
5993 | *stmt_p = build1 (GOTO_EXPR, void_type_node, EXIT_STMT_LABEL (stmt)); | |
5994 | if (EXIT_STMT_COND (stmt)) | |
5995 | *stmt_p = build3 (COND_EXPR, void_type_node, | |
5996 | EXIT_STMT_COND (stmt), *stmt_p, alloc_stmt_list ()); | |
5997 | return GS_OK; | |
5998 | ||
5999 | default: | |
6000 | gcc_unreachable (); | |
6001 | } | |
6002 | } | |
6003 | \f | |
6004 | /* Force references to each of the entities in packages withed by GNAT_NODE. | |
6005 | Operate recursively but check that we aren't elaborating something more | |
6006 | than once. | |
6007 | ||
6008 | This routine is exclusively called in type_annotate mode, to compute DDA | |
6009 | information for types in withed units, for ASIS use. */ | |
6010 | ||
6011 | static void | |
6012 | elaborate_all_entities (Node_Id gnat_node) | |
6013 | { | |
6014 | Entity_Id gnat_with_clause, gnat_entity; | |
6015 | ||
6016 | /* Process each unit only once. As we trace the context of all relevant | |
6017 | units transitively, including generic bodies, we may encounter the | |
6018 | same generic unit repeatedly. */ | |
6019 | if (!present_gnu_tree (gnat_node)) | |
6020 | save_gnu_tree (gnat_node, integer_zero_node, true); | |
6021 | ||
6022 | /* Save entities in all context units. A body may have an implicit_with | |
6023 | on its own spec, if the context includes a child unit, so don't save | |
6024 | the spec twice. */ | |
6025 | for (gnat_with_clause = First (Context_Items (gnat_node)); | |
6026 | Present (gnat_with_clause); | |
6027 | gnat_with_clause = Next (gnat_with_clause)) | |
6028 | if (Nkind (gnat_with_clause) == N_With_Clause | |
6029 | && !present_gnu_tree (Library_Unit (gnat_with_clause)) | |
6030 | && Library_Unit (gnat_with_clause) != Library_Unit (Cunit (Main_Unit))) | |
6031 | { | |
6032 | elaborate_all_entities (Library_Unit (gnat_with_clause)); | |
6033 | ||
6034 | if (Ekind (Entity (Name (gnat_with_clause))) == E_Package) | |
6035 | { | |
6036 | for (gnat_entity = First_Entity (Entity (Name (gnat_with_clause))); | |
6037 | Present (gnat_entity); | |
6038 | gnat_entity = Next_Entity (gnat_entity)) | |
6039 | if (Is_Public (gnat_entity) | |
6040 | && Convention (gnat_entity) != Convention_Intrinsic | |
6041 | && Ekind (gnat_entity) != E_Package | |
6042 | && Ekind (gnat_entity) != E_Package_Body | |
6043 | && Ekind (gnat_entity) != E_Operator | |
6044 | && !(IN (Ekind (gnat_entity), Type_Kind) | |
6045 | && !Is_Frozen (gnat_entity)) | |
6046 | && !((Ekind (gnat_entity) == E_Procedure | |
6047 | || Ekind (gnat_entity) == E_Function) | |
6048 | && Is_Intrinsic_Subprogram (gnat_entity)) | |
6049 | && !IN (Ekind (gnat_entity), Named_Kind) | |
6050 | && !IN (Ekind (gnat_entity), Generic_Unit_Kind)) | |
6051 | gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0); | |
1e17ef87 | 6052 | } |
a1ab4c31 AC |
6053 | else if (Ekind (Entity (Name (gnat_with_clause))) == E_Generic_Package) |
6054 | { | |
6055 | Node_Id gnat_body | |
6056 | = Corresponding_Body (Unit (Library_Unit (gnat_with_clause))); | |
6057 | ||
6058 | /* Retrieve compilation unit node of generic body. */ | |
6059 | while (Present (gnat_body) | |
6060 | && Nkind (gnat_body) != N_Compilation_Unit) | |
6061 | gnat_body = Parent (gnat_body); | |
6062 | ||
6063 | /* If body is available, elaborate its context. */ | |
6064 | if (Present (gnat_body)) | |
6065 | elaborate_all_entities (gnat_body); | |
6066 | } | |
6067 | } | |
6068 | ||
6069 | if (Nkind (Unit (gnat_node)) == N_Package_Body) | |
6070 | elaborate_all_entities (Library_Unit (gnat_node)); | |
6071 | } | |
6072 | \f | |
f08863f9 | 6073 | /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */ |
a1ab4c31 AC |
6074 | |
6075 | static void | |
6076 | process_freeze_entity (Node_Id gnat_node) | |
6077 | { | |
f08863f9 EB |
6078 | const Entity_Id gnat_entity = Entity (gnat_node); |
6079 | const Entity_Kind kind = Ekind (gnat_entity); | |
6080 | tree gnu_old, gnu_new; | |
6081 | ||
6082 | /* If this is a package, we need to generate code for the package. */ | |
6083 | if (kind == E_Package) | |
a1ab4c31 AC |
6084 | { |
6085 | insert_code_for | |
f08863f9 EB |
6086 | (Parent (Corresponding_Body |
6087 | (Parent (Declaration_Node (gnat_entity))))); | |
a1ab4c31 AC |
6088 | return; |
6089 | } | |
6090 | ||
f08863f9 EB |
6091 | /* Don't do anything for class-wide types as they are always transformed |
6092 | into their root type. */ | |
6093 | if (kind == E_Class_Wide_Type) | |
6094 | return; | |
6095 | ||
6096 | /* Check for an old definition. This freeze node might be for an Itype. */ | |
a1ab4c31 | 6097 | gnu_old |
f08863f9 | 6098 | = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : NULL_TREE; |
a1ab4c31 | 6099 | |
f08863f9 | 6100 | /* If this entity has an address representation clause, GNU_OLD is the |
1e17ef87 | 6101 | address, so discard it here. */ |
a1ab4c31 | 6102 | if (Present (Address_Clause (gnat_entity))) |
f08863f9 | 6103 | gnu_old = NULL_TREE; |
a1ab4c31 AC |
6104 | |
6105 | /* Don't do anything for subprograms that may have been elaborated before | |
f08863f9 EB |
6106 | their freeze nodes. This can happen, for example, because of an inner |
6107 | call in an instance body or because of previous compilation of a spec | |
6108 | for inlining purposes. */ | |
a1ab4c31 AC |
6109 | if (gnu_old |
6110 | && ((TREE_CODE (gnu_old) == FUNCTION_DECL | |
f08863f9 EB |
6111 | && (kind == E_Function || kind == E_Procedure)) |
6112 | || (TREE_CODE (TREE_TYPE (gnu_old)) == FUNCTION_TYPE | |
6113 | && kind == E_Subprogram_Type))) | |
a1ab4c31 AC |
6114 | return; |
6115 | ||
6116 | /* If we have a non-dummy type old tree, we have nothing to do, except | |
6117 | aborting if this is the public view of a private type whose full view was | |
6118 | not delayed, as this node was never delayed as it should have been. We | |
6119 | let this happen for concurrent types and their Corresponding_Record_Type, | |
f08863f9 | 6120 | however, because each might legitimately be elaborated before its own |
a1ab4c31 AC |
6121 | freeze node, e.g. while processing the other. */ |
6122 | if (gnu_old | |
6123 | && !(TREE_CODE (gnu_old) == TYPE_DECL | |
6124 | && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old)))) | |
6125 | { | |
f08863f9 | 6126 | gcc_assert ((IN (kind, Incomplete_Or_Private_Kind) |
a1ab4c31 AC |
6127 | && Present (Full_View (gnat_entity)) |
6128 | && No (Freeze_Node (Full_View (gnat_entity)))) | |
6129 | || Is_Concurrent_Type (gnat_entity) | |
f08863f9 | 6130 | || (IN (kind, Record_Kind) |
a1ab4c31 AC |
6131 | && Is_Concurrent_Record_Type (gnat_entity))); |
6132 | return; | |
6133 | } | |
6134 | ||
6135 | /* Reset the saved tree, if any, and elaborate the object or type for real. | |
f08863f9 EB |
6136 | If there is a full view, elaborate it and use the result. And, if this |
6137 | is the root type of a class-wide type, reuse it for the latter. */ | |
a1ab4c31 AC |
6138 | if (gnu_old) |
6139 | { | |
6140 | save_gnu_tree (gnat_entity, NULL_TREE, false); | |
f08863f9 EB |
6141 | if (IN (kind, Incomplete_Or_Private_Kind) |
6142 | && Present (Full_View (gnat_entity)) | |
6143 | && present_gnu_tree (Full_View (gnat_entity))) | |
6144 | save_gnu_tree (Full_View (gnat_entity), NULL_TREE, false); | |
6145 | if (IN (kind, Type_Kind) | |
6146 | && Present (Class_Wide_Type (gnat_entity)) | |
6147 | && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity) | |
a1ab4c31 AC |
6148 | save_gnu_tree (Class_Wide_Type (gnat_entity), NULL_TREE, false); |
6149 | } | |
6150 | ||
f08863f9 | 6151 | if (IN (kind, Incomplete_Or_Private_Kind) |
a1ab4c31 AC |
6152 | && Present (Full_View (gnat_entity))) |
6153 | { | |
6154 | gnu_new = gnat_to_gnu_entity (Full_View (gnat_entity), NULL_TREE, 1); | |
6155 | ||
6156 | /* Propagate back-annotations from full view to partial view. */ | |
6157 | if (Unknown_Alignment (gnat_entity)) | |
6158 | Set_Alignment (gnat_entity, Alignment (Full_View (gnat_entity))); | |
6159 | ||
6160 | if (Unknown_Esize (gnat_entity)) | |
6161 | Set_Esize (gnat_entity, Esize (Full_View (gnat_entity))); | |
6162 | ||
6163 | if (Unknown_RM_Size (gnat_entity)) | |
6164 | Set_RM_Size (gnat_entity, RM_Size (Full_View (gnat_entity))); | |
6165 | ||
6166 | /* The above call may have defined this entity (the simplest example | |
f08863f9 EB |
6167 | of this is when we have a private enumeral type since the bounds |
6168 | will have the public view). */ | |
a1ab4c31 | 6169 | if (!present_gnu_tree (gnat_entity)) |
f08863f9 | 6170 | save_gnu_tree (gnat_entity, gnu_new, false); |
a1ab4c31 AC |
6171 | } |
6172 | else | |
f08863f9 EB |
6173 | { |
6174 | tree gnu_init | |
6175 | = (Nkind (Declaration_Node (gnat_entity)) == N_Object_Declaration | |
6176 | && present_gnu_tree (Declaration_Node (gnat_entity))) | |
6177 | ? get_gnu_tree (Declaration_Node (gnat_entity)) : NULL_TREE; | |
6178 | ||
6179 | gnu_new = gnat_to_gnu_entity (gnat_entity, gnu_init, 1); | |
6180 | } | |
6181 | ||
6182 | if (IN (kind, Type_Kind) | |
6183 | && Present (Class_Wide_Type (gnat_entity)) | |
6184 | && Root_Type (Class_Wide_Type (gnat_entity)) == gnat_entity) | |
6185 | save_gnu_tree (Class_Wide_Type (gnat_entity), gnu_new, false); | |
a1ab4c31 AC |
6186 | |
6187 | /* If we've made any pointers to the old version of this type, we | |
6188 | have to update them. */ | |
6189 | if (gnu_old) | |
6190 | update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)), | |
6191 | TREE_TYPE (gnu_new)); | |
6192 | } | |
6193 | \f | |
6194 | /* Process the list of inlined subprograms of GNAT_NODE, which is an | |
6195 | N_Compilation_Unit. */ | |
6196 | ||
6197 | static void | |
6198 | process_inlined_subprograms (Node_Id gnat_node) | |
6199 | { | |
6200 | Entity_Id gnat_entity; | |
6201 | Node_Id gnat_body; | |
6202 | ||
13669c36 | 6203 | /* If we can inline, generate Gimple for all the inlined subprograms. |
a1ab4c31 | 6204 | Define the entity first so we set DECL_EXTERNAL. */ |
13669c36 | 6205 | if (optimize > 0) |
a1ab4c31 AC |
6206 | for (gnat_entity = First_Inlined_Subprogram (gnat_node); |
6207 | Present (gnat_entity); | |
6208 | gnat_entity = Next_Inlined_Subprogram (gnat_entity)) | |
6209 | { | |
6210 | gnat_body = Parent (Declaration_Node (gnat_entity)); | |
6211 | ||
6212 | if (Nkind (gnat_body) != N_Subprogram_Body) | |
6213 | { | |
6214 | /* ??? This really should always be Present. */ | |
6215 | if (No (Corresponding_Body (gnat_body))) | |
6216 | continue; | |
6217 | ||
6218 | gnat_body | |
6219 | = Parent (Declaration_Node (Corresponding_Body (gnat_body))); | |
6220 | } | |
6221 | ||
6222 | if (Present (gnat_body)) | |
6223 | { | |
6224 | gnat_to_gnu_entity (gnat_entity, NULL_TREE, 0); | |
6225 | add_stmt (gnat_to_gnu (gnat_body)); | |
6226 | } | |
6227 | } | |
6228 | } | |
6229 | \f | |
6230 | /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present. | |
6231 | We make two passes, one to elaborate anything other than bodies (but | |
6232 | we declare a function if there was no spec). The second pass | |
6233 | elaborates the bodies. | |
6234 | ||
6235 | GNAT_END_LIST gives the element in the list past the end. Normally, | |
6236 | this is Empty, but can be First_Real_Statement for a | |
6237 | Handled_Sequence_Of_Statements. | |
6238 | ||
6239 | We make a complete pass through both lists if PASS1P is true, then make | |
6240 | the second pass over both lists if PASS2P is true. The lists usually | |
6241 | correspond to the public and private parts of a package. */ | |
6242 | ||
6243 | static void | |
6244 | process_decls (List_Id gnat_decls, List_Id gnat_decls2, | |
1e17ef87 | 6245 | Node_Id gnat_end_list, bool pass1p, bool pass2p) |
a1ab4c31 AC |
6246 | { |
6247 | List_Id gnat_decl_array[2]; | |
6248 | Node_Id gnat_decl; | |
6249 | int i; | |
6250 | ||
6251 | gnat_decl_array[0] = gnat_decls, gnat_decl_array[1] = gnat_decls2; | |
6252 | ||
6253 | if (pass1p) | |
6254 | for (i = 0; i <= 1; i++) | |
6255 | if (Present (gnat_decl_array[i])) | |
6256 | for (gnat_decl = First (gnat_decl_array[i]); | |
6257 | gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl)) | |
6258 | { | |
6259 | /* For package specs, we recurse inside the declarations, | |
6260 | thus taking the two pass approach inside the boundary. */ | |
6261 | if (Nkind (gnat_decl) == N_Package_Declaration | |
6262 | && (Nkind (Specification (gnat_decl) | |
6263 | == N_Package_Specification))) | |
6264 | process_decls (Visible_Declarations (Specification (gnat_decl)), | |
6265 | Private_Declarations (Specification (gnat_decl)), | |
6266 | Empty, true, false); | |
6267 | ||
6268 | /* Similarly for any declarations in the actions of a | |
6269 | freeze node. */ | |
6270 | else if (Nkind (gnat_decl) == N_Freeze_Entity) | |
6271 | { | |
6272 | process_freeze_entity (gnat_decl); | |
6273 | process_decls (Actions (gnat_decl), Empty, Empty, true, false); | |
6274 | } | |
6275 | ||
6276 | /* Package bodies with freeze nodes get their elaboration deferred | |
6277 | until the freeze node, but the code must be placed in the right | |
6278 | place, so record the code position now. */ | |
6279 | else if (Nkind (gnat_decl) == N_Package_Body | |
6280 | && Present (Freeze_Node (Corresponding_Spec (gnat_decl)))) | |
6281 | record_code_position (gnat_decl); | |
6282 | ||
1e17ef87 | 6283 | else if (Nkind (gnat_decl) == N_Package_Body_Stub |
a1ab4c31 AC |
6284 | && Present (Library_Unit (gnat_decl)) |
6285 | && Present (Freeze_Node | |
6286 | (Corresponding_Spec | |
6287 | (Proper_Body (Unit | |
6288 | (Library_Unit (gnat_decl))))))) | |
6289 | record_code_position | |
6290 | (Proper_Body (Unit (Library_Unit (gnat_decl)))); | |
6291 | ||
6292 | /* We defer most subprogram bodies to the second pass. */ | |
6293 | else if (Nkind (gnat_decl) == N_Subprogram_Body) | |
6294 | { | |
6295 | if (Acts_As_Spec (gnat_decl)) | |
6296 | { | |
6297 | Node_Id gnat_subprog_id = Defining_Entity (gnat_decl); | |
6298 | ||
6299 | if (Ekind (gnat_subprog_id) != E_Generic_Procedure | |
6300 | && Ekind (gnat_subprog_id) != E_Generic_Function) | |
6301 | gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1); | |
6302 | } | |
6303 | } | |
1e17ef87 EB |
6304 | |
6305 | /* For bodies and stubs that act as their own specs, the entity | |
6306 | itself must be elaborated in the first pass, because it may | |
6307 | be used in other declarations. */ | |
a1ab4c31 AC |
6308 | else if (Nkind (gnat_decl) == N_Subprogram_Body_Stub) |
6309 | { | |
1e17ef87 EB |
6310 | Node_Id gnat_subprog_id |
6311 | = Defining_Entity (Specification (gnat_decl)); | |
a1ab4c31 AC |
6312 | |
6313 | if (Ekind (gnat_subprog_id) != E_Subprogram_Body | |
1e17ef87 | 6314 | && Ekind (gnat_subprog_id) != E_Generic_Procedure |
a1ab4c31 AC |
6315 | && Ekind (gnat_subprog_id) != E_Generic_Function) |
6316 | gnat_to_gnu_entity (gnat_subprog_id, NULL_TREE, 1); | |
1e17ef87 | 6317 | } |
a1ab4c31 AC |
6318 | |
6319 | /* Concurrent stubs stand for the corresponding subprogram bodies, | |
6320 | which are deferred like other bodies. */ | |
6321 | else if (Nkind (gnat_decl) == N_Task_Body_Stub | |
6322 | || Nkind (gnat_decl) == N_Protected_Body_Stub) | |
6323 | ; | |
1e17ef87 | 6324 | |
a1ab4c31 AC |
6325 | else |
6326 | add_stmt (gnat_to_gnu (gnat_decl)); | |
6327 | } | |
6328 | ||
6329 | /* Here we elaborate everything we deferred above except for package bodies, | |
6330 | which are elaborated at their freeze nodes. Note that we must also | |
6331 | go inside things (package specs and freeze nodes) the first pass did. */ | |
6332 | if (pass2p) | |
6333 | for (i = 0; i <= 1; i++) | |
6334 | if (Present (gnat_decl_array[i])) | |
6335 | for (gnat_decl = First (gnat_decl_array[i]); | |
6336 | gnat_decl != gnat_end_list; gnat_decl = Next (gnat_decl)) | |
6337 | { | |
6338 | if (Nkind (gnat_decl) == N_Subprogram_Body | |
6339 | || Nkind (gnat_decl) == N_Subprogram_Body_Stub | |
6340 | || Nkind (gnat_decl) == N_Task_Body_Stub | |
6341 | || Nkind (gnat_decl) == N_Protected_Body_Stub) | |
6342 | add_stmt (gnat_to_gnu (gnat_decl)); | |
6343 | ||
6344 | else if (Nkind (gnat_decl) == N_Package_Declaration | |
6345 | && (Nkind (Specification (gnat_decl) | |
6346 | == N_Package_Specification))) | |
6347 | process_decls (Visible_Declarations (Specification (gnat_decl)), | |
6348 | Private_Declarations (Specification (gnat_decl)), | |
6349 | Empty, false, true); | |
6350 | ||
6351 | else if (Nkind (gnat_decl) == N_Freeze_Entity) | |
6352 | process_decls (Actions (gnat_decl), Empty, Empty, false, true); | |
6353 | } | |
6354 | } | |
6355 | \f | |
b666e568 | 6356 | /* Make a unary operation of kind CODE using build_unary_op, but guard |
a7c43bbc EB |
6357 | the operation by an overflow check. CODE can be one of NEGATE_EXPR |
6358 | or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually | |
10069d53 EB |
6359 | the operation is to be performed in that type. GNAT_NODE is the gnat |
6360 | node conveying the source location for which the error should be | |
6361 | signaled. */ | |
b666e568 GB |
6362 | |
6363 | static tree | |
10069d53 EB |
6364 | build_unary_op_trapv (enum tree_code code, tree gnu_type, tree operand, |
6365 | Node_Id gnat_node) | |
b666e568 | 6366 | { |
a7c43bbc | 6367 | gcc_assert (code == NEGATE_EXPR || code == ABS_EXPR); |
b666e568 | 6368 | |
7d7a1fe8 | 6369 | operand = gnat_protect_expr (operand); |
b666e568 GB |
6370 | |
6371 | return emit_check (build_binary_op (EQ_EXPR, integer_type_node, | |
6372 | operand, TYPE_MIN_VALUE (gnu_type)), | |
6373 | build_unary_op (code, gnu_type, operand), | |
10069d53 | 6374 | CE_Overflow_Check_Failed, gnat_node); |
b666e568 GB |
6375 | } |
6376 | ||
a7c43bbc EB |
6377 | /* Make a binary operation of kind CODE using build_binary_op, but guard |
6378 | the operation by an overflow check. CODE can be one of PLUS_EXPR, | |
6379 | MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result. | |
10069d53 EB |
6380 | Usually the operation is to be performed in that type. GNAT_NODE is |
6381 | the GNAT node conveying the source location for which the error should | |
6382 | be signaled. */ | |
b666e568 GB |
6383 | |
6384 | static tree | |
a7c43bbc | 6385 | build_binary_op_trapv (enum tree_code code, tree gnu_type, tree left, |
10069d53 | 6386 | tree right, Node_Id gnat_node) |
b666e568 | 6387 | { |
7d7a1fe8 EB |
6388 | tree lhs = gnat_protect_expr (left); |
6389 | tree rhs = gnat_protect_expr (right); | |
b666e568 GB |
6390 | tree type_max = TYPE_MAX_VALUE (gnu_type); |
6391 | tree type_min = TYPE_MIN_VALUE (gnu_type); | |
6392 | tree gnu_expr; | |
6393 | tree tmp1, tmp2; | |
6394 | tree zero = convert (gnu_type, integer_zero_node); | |
4ae39383 | 6395 | tree rhs_lt_zero; |
b666e568 GB |
6396 | tree check_pos; |
6397 | tree check_neg; | |
4ae39383 | 6398 | tree check; |
b666e568 GB |
6399 | int precision = TYPE_PRECISION (gnu_type); |
6400 | ||
4ae39383 | 6401 | gcc_assert (!(precision & (precision - 1))); /* ensure power of 2 */ |
b666e568 | 6402 | |
a7c43bbc | 6403 | /* Prefer a constant or known-positive rhs to simplify checks. */ |
4ae39383 GB |
6404 | if (!TREE_CONSTANT (rhs) |
6405 | && commutative_tree_code (code) | |
6406 | && (TREE_CONSTANT (lhs) || (!tree_expr_nonnegative_p (rhs) | |
6407 | && tree_expr_nonnegative_p (lhs)))) | |
b666e568 | 6408 | { |
a7c43bbc EB |
6409 | tree tmp = lhs; |
6410 | lhs = rhs; | |
6411 | rhs = tmp; | |
4ae39383 GB |
6412 | } |
6413 | ||
6414 | rhs_lt_zero = tree_expr_nonnegative_p (rhs) | |
a7c43bbc EB |
6415 | ? integer_zero_node |
6416 | : build_binary_op (LT_EXPR, integer_type_node, rhs, zero); | |
4ae39383 | 6417 | |
a7c43bbc | 6418 | /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */ |
b666e568 | 6419 | |
4ae39383 | 6420 | /* Try a few strategies that may be cheaper than the general |
a7c43bbc | 6421 | code at the end of the function, if the rhs is not known. |
4ae39383 GB |
6422 | The strategies are: |
6423 | - Call library function for 64-bit multiplication (complex) | |
6424 | - Widen, if input arguments are sufficiently small | |
a7c43bbc | 6425 | - Determine overflow using wrapped result for addition/subtraction. */ |
b666e568 GB |
6426 | |
6427 | if (!TREE_CONSTANT (rhs)) | |
6428 | { | |
a7c43bbc | 6429 | /* Even for add/subtract double size to get another base type. */ |
4ae39383 | 6430 | int needed_precision = precision * 2; |
b666e568 GB |
6431 | |
6432 | if (code == MULT_EXPR && precision == 64) | |
f7ebc6a8 | 6433 | { |
58e94443 GB |
6434 | tree int_64 = gnat_type_for_size (64, 0); |
6435 | ||
6436 | return convert (gnu_type, build_call_2_expr (mulv64_decl, | |
6437 | convert (int_64, lhs), | |
6438 | convert (int_64, rhs))); | |
6439 | } | |
a7c43bbc | 6440 | |
4ae39383 | 6441 | else if (needed_precision <= BITS_PER_WORD |
f7ebc6a8 | 6442 | || (code == MULT_EXPR |
4ae39383 | 6443 | && needed_precision <= LONG_LONG_TYPE_SIZE)) |
b666e568 | 6444 | { |
4ae39383 | 6445 | tree wide_type = gnat_type_for_size (needed_precision, 0); |
b666e568 | 6446 | |
4ae39383 GB |
6447 | tree wide_result = build_binary_op (code, wide_type, |
6448 | convert (wide_type, lhs), | |
6449 | convert (wide_type, rhs)); | |
b666e568 | 6450 | |
4ae39383 | 6451 | tree check = build_binary_op |
b666e568 | 6452 | (TRUTH_ORIF_EXPR, integer_type_node, |
4ae39383 GB |
6453 | build_binary_op (LT_EXPR, integer_type_node, wide_result, |
6454 | convert (wide_type, type_min)), | |
6455 | build_binary_op (GT_EXPR, integer_type_node, wide_result, | |
6456 | convert (wide_type, type_max))); | |
6457 | ||
6458 | tree result = convert (gnu_type, wide_result); | |
b666e568 | 6459 | |
10069d53 EB |
6460 | return |
6461 | emit_check (check, result, CE_Overflow_Check_Failed, gnat_node); | |
b666e568 | 6462 | } |
a7c43bbc | 6463 | |
4ae39383 GB |
6464 | else if (code == PLUS_EXPR || code == MINUS_EXPR) |
6465 | { | |
6466 | tree unsigned_type = gnat_type_for_size (precision, 1); | |
6467 | tree wrapped_expr = convert | |
6468 | (gnu_type, build_binary_op (code, unsigned_type, | |
6469 | convert (unsigned_type, lhs), | |
6470 | convert (unsigned_type, rhs))); | |
b666e568 | 6471 | |
4ae39383 GB |
6472 | tree result = convert |
6473 | (gnu_type, build_binary_op (code, gnu_type, lhs, rhs)); | |
6474 | ||
6475 | /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition | |
a7c43bbc | 6476 | or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */ |
4ae39383 GB |
6477 | tree check = build_binary_op |
6478 | (TRUTH_XOR_EXPR, integer_type_node, rhs_lt_zero, | |
6479 | build_binary_op (code == PLUS_EXPR ? LT_EXPR : GT_EXPR, | |
6480 | integer_type_node, wrapped_expr, lhs)); | |
6481 | ||
10069d53 EB |
6482 | return |
6483 | emit_check (check, result, CE_Overflow_Check_Failed, gnat_node); | |
4ae39383 GB |
6484 | } |
6485 | } | |
b666e568 GB |
6486 | |
6487 | switch (code) | |
6488 | { | |
6489 | case PLUS_EXPR: | |
a7c43bbc | 6490 | /* When rhs >= 0, overflow when lhs > type_max - rhs. */ |
b666e568 GB |
6491 | check_pos = build_binary_op (GT_EXPR, integer_type_node, lhs, |
6492 | build_binary_op (MINUS_EXPR, gnu_type, | |
6493 | type_max, rhs)), | |
6494 | ||
a7c43bbc | 6495 | /* When rhs < 0, overflow when lhs < type_min - rhs. */ |
b666e568 GB |
6496 | check_neg = build_binary_op (LT_EXPR, integer_type_node, lhs, |
6497 | build_binary_op (MINUS_EXPR, gnu_type, | |
6498 | type_min, rhs)); | |
6499 | break; | |
6500 | ||
6501 | case MINUS_EXPR: | |
a7c43bbc | 6502 | /* When rhs >= 0, overflow when lhs < type_min + rhs. */ |
b666e568 GB |
6503 | check_pos = build_binary_op (LT_EXPR, integer_type_node, lhs, |
6504 | build_binary_op (PLUS_EXPR, gnu_type, | |
6505 | type_min, rhs)), | |
6506 | ||
a7c43bbc | 6507 | /* When rhs < 0, overflow when lhs > type_max + rhs. */ |
b666e568 GB |
6508 | check_neg = build_binary_op (GT_EXPR, integer_type_node, lhs, |
6509 | build_binary_op (PLUS_EXPR, gnu_type, | |
6510 | type_max, rhs)); | |
6511 | break; | |
6512 | ||
6513 | case MULT_EXPR: | |
6514 | /* The check here is designed to be efficient if the rhs is constant, | |
1e17ef87 EB |
6515 | but it will work for any rhs by using integer division. |
6516 | Four different check expressions determine wether X * C overflows, | |
b666e568 GB |
6517 | depending on C. |
6518 | C == 0 => false | |
6519 | C > 0 => X > type_max / C || X < type_min / C | |
6520 | C == -1 => X == type_min | |
6521 | C < -1 => X > type_min / C || X < type_max / C */ | |
6522 | ||
6523 | tmp1 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_max, rhs); | |
6524 | tmp2 = build_binary_op (TRUNC_DIV_EXPR, gnu_type, type_min, rhs); | |
6525 | ||
6526 | check_pos = build_binary_op (TRUTH_ANDIF_EXPR, integer_type_node, | |
6527 | build_binary_op (NE_EXPR, integer_type_node, zero, rhs), | |
6528 | build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
6529 | build_binary_op (GT_EXPR, integer_type_node, lhs, tmp1), | |
6530 | build_binary_op (LT_EXPR, integer_type_node, lhs, tmp2))); | |
6531 | ||
6532 | check_neg = fold_build3 (COND_EXPR, integer_type_node, | |
6533 | build_binary_op (EQ_EXPR, integer_type_node, rhs, | |
6534 | build_int_cst (gnu_type, -1)), | |
6535 | build_binary_op (EQ_EXPR, integer_type_node, lhs, type_min), | |
6536 | build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
6537 | build_binary_op (GT_EXPR, integer_type_node, lhs, tmp2), | |
6538 | build_binary_op (LT_EXPR, integer_type_node, lhs, tmp1))); | |
6539 | break; | |
6540 | ||
6541 | default: | |
6542 | gcc_unreachable(); | |
6543 | } | |
6544 | ||
4ae39383 GB |
6545 | gnu_expr = build_binary_op (code, gnu_type, lhs, rhs); |
6546 | ||
2575024c | 6547 | /* If we can fold the expression to a constant, just return it. |
a7c43bbc EB |
6548 | The caller will deal with overflow, no need to generate a check. */ |
6549 | if (TREE_CONSTANT (gnu_expr)) | |
6550 | return gnu_expr; | |
2575024c | 6551 | |
4ae39383 GB |
6552 | check = fold_build3 (COND_EXPR, integer_type_node, |
6553 | rhs_lt_zero, check_neg, check_pos); | |
6554 | ||
10069d53 | 6555 | return emit_check (check, gnu_expr, CE_Overflow_Check_Failed, gnat_node); |
b666e568 GB |
6556 | } |
6557 | ||
a7c43bbc | 6558 | /* Emit code for a range check. GNU_EXPR is the expression to be checked, |
a1ab4c31 | 6559 | GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against |
10069d53 EB |
6560 | which we have to check. GNAT_NODE is the GNAT node conveying the source |
6561 | location for which the error should be signaled. */ | |
a1ab4c31 AC |
6562 | |
6563 | static tree | |
10069d53 | 6564 | emit_range_check (tree gnu_expr, Entity_Id gnat_range_type, Node_Id gnat_node) |
a1ab4c31 AC |
6565 | { |
6566 | tree gnu_range_type = get_unpadded_type (gnat_range_type); | |
6567 | tree gnu_low = TYPE_MIN_VALUE (gnu_range_type); | |
6568 | tree gnu_high = TYPE_MAX_VALUE (gnu_range_type); | |
6569 | tree gnu_compare_type = get_base_type (TREE_TYPE (gnu_expr)); | |
6570 | ||
6571 | /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed. | |
6572 | This can for example happen when translating 'Val or 'Value. */ | |
6573 | if (gnu_compare_type == gnu_range_type) | |
6574 | return gnu_expr; | |
6575 | ||
6576 | /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE, | |
6577 | we can't do anything since we might be truncating the bounds. No | |
6578 | check is needed in this case. */ | |
6579 | if (INTEGRAL_TYPE_P (TREE_TYPE (gnu_expr)) | |
6580 | && (TYPE_PRECISION (gnu_compare_type) | |
6581 | < TYPE_PRECISION (get_base_type (gnu_range_type)))) | |
6582 | return gnu_expr; | |
6583 | ||
1e17ef87 | 6584 | /* Checked expressions must be evaluated only once. */ |
7d7a1fe8 | 6585 | gnu_expr = gnat_protect_expr (gnu_expr); |
a1ab4c31 AC |
6586 | |
6587 | /* There's no good type to use here, so we might as well use | |
6588 | integer_type_node. Note that the form of the check is | |
1e17ef87 EB |
6589 | (not (expr >= lo)) or (not (expr <= hi)) |
6590 | the reason for this slightly convoluted form is that NaNs | |
6591 | are not considered to be in range in the float case. */ | |
a1ab4c31 AC |
6592 | return emit_check |
6593 | (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
6594 | invert_truthvalue | |
6595 | (build_binary_op (GE_EXPR, integer_type_node, | |
6596 | convert (gnu_compare_type, gnu_expr), | |
6597 | convert (gnu_compare_type, gnu_low))), | |
6598 | invert_truthvalue | |
6599 | (build_binary_op (LE_EXPR, integer_type_node, | |
6600 | convert (gnu_compare_type, gnu_expr), | |
6601 | convert (gnu_compare_type, | |
6602 | gnu_high)))), | |
10069d53 | 6603 | gnu_expr, CE_Range_Check_Failed, gnat_node); |
a1ab4c31 AC |
6604 | } |
6605 | \f | |
1e17ef87 EB |
6606 | /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which |
6607 | we are about to index, GNU_EXPR is the index expression to be checked, | |
6608 | GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR | |
6609 | has to be checked. Note that for index checking we cannot simply use the | |
6610 | emit_range_check function (although very similar code needs to be generated | |
6611 | in both cases) since for index checking the array type against which we are | |
6612 | checking the indices may be unconstrained and consequently we need to get | |
6613 | the actual index bounds from the array object itself (GNU_ARRAY_OBJECT). | |
6614 | The place where we need to do that is in subprograms having unconstrained | |
10069d53 EB |
6615 | array formal parameters. GNAT_NODE is the GNAT node conveying the source |
6616 | location for which the error should be signaled. */ | |
a1ab4c31 AC |
6617 | |
6618 | static tree | |
1e17ef87 | 6619 | emit_index_check (tree gnu_array_object, tree gnu_expr, tree gnu_low, |
10069d53 | 6620 | tree gnu_high, Node_Id gnat_node) |
a1ab4c31 AC |
6621 | { |
6622 | tree gnu_expr_check; | |
6623 | ||
1e17ef87 | 6624 | /* Checked expressions must be evaluated only once. */ |
7d7a1fe8 | 6625 | gnu_expr = gnat_protect_expr (gnu_expr); |
a1ab4c31 AC |
6626 | |
6627 | /* Must do this computation in the base type in case the expression's | |
6628 | type is an unsigned subtypes. */ | |
6629 | gnu_expr_check = convert (get_base_type (TREE_TYPE (gnu_expr)), gnu_expr); | |
6630 | ||
6631 | /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by | |
1e17ef87 | 6632 | the object we are handling. */ |
a1ab4c31 AC |
6633 | gnu_low = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_low, gnu_array_object); |
6634 | gnu_high = SUBSTITUTE_PLACEHOLDER_IN_EXPR (gnu_high, gnu_array_object); | |
6635 | ||
6636 | /* There's no good type to use here, so we might as well use | |
6637 | integer_type_node. */ | |
6638 | return emit_check | |
6639 | (build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, | |
6640 | build_binary_op (LT_EXPR, integer_type_node, | |
6641 | gnu_expr_check, | |
6642 | convert (TREE_TYPE (gnu_expr_check), | |
6643 | gnu_low)), | |
6644 | build_binary_op (GT_EXPR, integer_type_node, | |
6645 | gnu_expr_check, | |
6646 | convert (TREE_TYPE (gnu_expr_check), | |
6647 | gnu_high))), | |
10069d53 | 6648 | gnu_expr, CE_Index_Check_Failed, gnat_node); |
a1ab4c31 AC |
6649 | } |
6650 | \f | |
6651 | /* GNU_COND contains the condition corresponding to an access, discriminant or | |
6652 | range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if | |
6653 | GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true. | |
10069d53 EB |
6654 | REASON is the code that says why the exception was raised. GNAT_NODE is |
6655 | the GNAT node conveying the source location for which the error should be | |
6656 | signaled. */ | |
a1ab4c31 AC |
6657 | |
6658 | static tree | |
10069d53 | 6659 | emit_check (tree gnu_cond, tree gnu_expr, int reason, Node_Id gnat_node) |
a1ab4c31 | 6660 | { |
10069d53 EB |
6661 | tree gnu_call |
6662 | = build_call_raise (reason, gnat_node, N_Raise_Constraint_Error); | |
82f7c45f GB |
6663 | tree gnu_result |
6664 | = fold_build3 (COND_EXPR, TREE_TYPE (gnu_expr), gnu_cond, | |
6665 | build2 (COMPOUND_EXPR, TREE_TYPE (gnu_expr), gnu_call, | |
6666 | convert (TREE_TYPE (gnu_expr), integer_zero_node)), | |
6667 | gnu_expr); | |
a1ab4c31 | 6668 | |
82f7c45f GB |
6669 | /* GNU_RESULT has side effects if and only if GNU_EXPR has: |
6670 | we don't need to evaluate it just for the check. */ | |
6671 | TREE_SIDE_EFFECTS (gnu_result) = TREE_SIDE_EFFECTS (gnu_expr); | |
a1ab4c31 | 6672 | |
502c4bb9 | 6673 | return gnu_result; |
a1ab4c31 AC |
6674 | } |
6675 | \f | |
1e17ef87 EB |
6676 | /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow |
6677 | checks if OVERFLOW_P is true and range checks if RANGE_P is true. | |
6678 | GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a | |
10069d53 EB |
6679 | float to integer conversion with truncation; otherwise round. |
6680 | GNAT_NODE is the GNAT node conveying the source location for which the | |
6681 | error should be signaled. */ | |
a1ab4c31 AC |
6682 | |
6683 | static tree | |
6684 | convert_with_check (Entity_Id gnat_type, tree gnu_expr, bool overflowp, | |
10069d53 | 6685 | bool rangep, bool truncatep, Node_Id gnat_node) |
a1ab4c31 AC |
6686 | { |
6687 | tree gnu_type = get_unpadded_type (gnat_type); | |
6688 | tree gnu_in_type = TREE_TYPE (gnu_expr); | |
6689 | tree gnu_in_basetype = get_base_type (gnu_in_type); | |
6690 | tree gnu_base_type = get_base_type (gnu_type); | |
6691 | tree gnu_result = gnu_expr; | |
6692 | ||
6693 | /* If we are not doing any checks, the output is an integral type, and | |
6694 | the input is not a floating type, just do the conversion. This | |
6695 | shortcut is required to avoid problems with packed array types | |
6696 | and simplifies code in all cases anyway. */ | |
6697 | if (!rangep && !overflowp && INTEGRAL_TYPE_P (gnu_base_type) | |
6698 | && !FLOAT_TYPE_P (gnu_in_type)) | |
6699 | return convert (gnu_type, gnu_expr); | |
6700 | ||
6701 | /* First convert the expression to its base type. This | |
6702 | will never generate code, but makes the tests below much simpler. | |
6703 | But don't do this if converting from an integer type to an unconstrained | |
6704 | array type since then we need to get the bounds from the original | |
6705 | (unpacked) type. */ | |
6706 | if (TREE_CODE (gnu_type) != UNCONSTRAINED_ARRAY_TYPE) | |
6707 | gnu_result = convert (gnu_in_basetype, gnu_result); | |
6708 | ||
6709 | /* If overflow checks are requested, we need to be sure the result will | |
6710 | fit in the output base type. But don't do this if the input | |
6711 | is integer and the output floating-point. */ | |
6712 | if (overflowp | |
6713 | && !(FLOAT_TYPE_P (gnu_base_type) && INTEGRAL_TYPE_P (gnu_in_basetype))) | |
6714 | { | |
6715 | /* Ensure GNU_EXPR only gets evaluated once. */ | |
7d7a1fe8 | 6716 | tree gnu_input = gnat_protect_expr (gnu_result); |
a1ab4c31 AC |
6717 | tree gnu_cond = integer_zero_node; |
6718 | tree gnu_in_lb = TYPE_MIN_VALUE (gnu_in_basetype); | |
6719 | tree gnu_in_ub = TYPE_MAX_VALUE (gnu_in_basetype); | |
6720 | tree gnu_out_lb = TYPE_MIN_VALUE (gnu_base_type); | |
6721 | tree gnu_out_ub = TYPE_MAX_VALUE (gnu_base_type); | |
6722 | ||
6723 | /* Convert the lower bounds to signed types, so we're sure we're | |
6724 | comparing them properly. Likewise, convert the upper bounds | |
6725 | to unsigned types. */ | |
6726 | if (INTEGRAL_TYPE_P (gnu_in_basetype) && TYPE_UNSIGNED (gnu_in_basetype)) | |
6727 | gnu_in_lb = convert (gnat_signed_type (gnu_in_basetype), gnu_in_lb); | |
6728 | ||
6729 | if (INTEGRAL_TYPE_P (gnu_in_basetype) | |
6730 | && !TYPE_UNSIGNED (gnu_in_basetype)) | |
6731 | gnu_in_ub = convert (gnat_unsigned_type (gnu_in_basetype), gnu_in_ub); | |
6732 | ||
6733 | if (INTEGRAL_TYPE_P (gnu_base_type) && TYPE_UNSIGNED (gnu_base_type)) | |
6734 | gnu_out_lb = convert (gnat_signed_type (gnu_base_type), gnu_out_lb); | |
6735 | ||
6736 | if (INTEGRAL_TYPE_P (gnu_base_type) && !TYPE_UNSIGNED (gnu_base_type)) | |
6737 | gnu_out_ub = convert (gnat_unsigned_type (gnu_base_type), gnu_out_ub); | |
6738 | ||
6739 | /* Check each bound separately and only if the result bound | |
6740 | is tighter than the bound on the input type. Note that all the | |
6741 | types are base types, so the bounds must be constant. Also, | |
6742 | the comparison is done in the base type of the input, which | |
6743 | always has the proper signedness. First check for input | |
6744 | integer (which means output integer), output float (which means | |
6745 | both float), or mixed, in which case we always compare. | |
6746 | Note that we have to do the comparison which would *fail* in the | |
6747 | case of an error since if it's an FP comparison and one of the | |
6748 | values is a NaN or Inf, the comparison will fail. */ | |
6749 | if (INTEGRAL_TYPE_P (gnu_in_basetype) | |
6750 | ? tree_int_cst_lt (gnu_in_lb, gnu_out_lb) | |
6751 | : (FLOAT_TYPE_P (gnu_base_type) | |
6752 | ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_in_lb), | |
6753 | TREE_REAL_CST (gnu_out_lb)) | |
6754 | : 1)) | |
6755 | gnu_cond | |
6756 | = invert_truthvalue | |
6757 | (build_binary_op (GE_EXPR, integer_type_node, | |
6758 | gnu_input, convert (gnu_in_basetype, | |
6759 | gnu_out_lb))); | |
6760 | ||
6761 | if (INTEGRAL_TYPE_P (gnu_in_basetype) | |
6762 | ? tree_int_cst_lt (gnu_out_ub, gnu_in_ub) | |
6763 | : (FLOAT_TYPE_P (gnu_base_type) | |
6764 | ? REAL_VALUES_LESS (TREE_REAL_CST (gnu_out_ub), | |
6765 | TREE_REAL_CST (gnu_in_lb)) | |
6766 | : 1)) | |
6767 | gnu_cond | |
6768 | = build_binary_op (TRUTH_ORIF_EXPR, integer_type_node, gnu_cond, | |
6769 | invert_truthvalue | |
6770 | (build_binary_op (LE_EXPR, integer_type_node, | |
6771 | gnu_input, | |
6772 | convert (gnu_in_basetype, | |
6773 | gnu_out_ub)))); | |
6774 | ||
6775 | if (!integer_zerop (gnu_cond)) | |
10069d53 EB |
6776 | gnu_result = emit_check (gnu_cond, gnu_input, |
6777 | CE_Overflow_Check_Failed, gnat_node); | |
a1ab4c31 AC |
6778 | } |
6779 | ||
6780 | /* Now convert to the result base type. If this is a non-truncating | |
6781 | float-to-integer conversion, round. */ | |
6782 | if (INTEGRAL_TYPE_P (gnu_base_type) && FLOAT_TYPE_P (gnu_in_basetype) | |
6783 | && !truncatep) | |
6784 | { | |
6785 | REAL_VALUE_TYPE half_minus_pred_half, pred_half; | |
ced57283 | 6786 | tree gnu_conv, gnu_zero, gnu_comp, calc_type; |
a1ab4c31 AC |
6787 | tree gnu_pred_half, gnu_add_pred_half, gnu_subtract_pred_half; |
6788 | const struct real_format *fmt; | |
6789 | ||
6790 | /* The following calculations depend on proper rounding to even | |
1e17ef87 EB |
6791 | of each arithmetic operation. In order to prevent excess |
6792 | precision from spoiling this property, use the widest hardware | |
6793 | floating-point type if FP_ARITH_MAY_WIDEN is true. */ | |
6794 | calc_type | |
6795 | = FP_ARITH_MAY_WIDEN ? longest_float_type_node : gnu_in_basetype; | |
a1ab4c31 | 6796 | |
1e17ef87 | 6797 | /* FIXME: Should not have padding in the first place. */ |
315cff15 | 6798 | if (TYPE_IS_PADDING_P (calc_type)) |
1e17ef87 | 6799 | calc_type = TREE_TYPE (TYPE_FIELDS (calc_type)); |
a1ab4c31 | 6800 | |
1e17ef87 | 6801 | /* Compute the exact value calc_type'Pred (0.5) at compile time. */ |
a1ab4c31 AC |
6802 | fmt = REAL_MODE_FORMAT (TYPE_MODE (calc_type)); |
6803 | real_2expN (&half_minus_pred_half, -(fmt->p) - 1, TYPE_MODE (calc_type)); | |
6804 | REAL_ARITHMETIC (pred_half, MINUS_EXPR, dconsthalf, | |
1e17ef87 | 6805 | half_minus_pred_half); |
a1ab4c31 AC |
6806 | gnu_pred_half = build_real (calc_type, pred_half); |
6807 | ||
6808 | /* If the input is strictly negative, subtract this value | |
ced57283 | 6809 | and otherwise add it from the input. For 0.5, the result |
1e17ef87 | 6810 | is exactly between 1.0 and the machine number preceding 1.0 |
ced57283 | 6811 | (for calc_type). Since the last bit of 1.0 is even, this 0.5 |
1e17ef87 | 6812 | will round to 1.0, while all other number with an absolute |
ced57283 | 6813 | value less than 0.5 round to 0.0. For larger numbers exactly |
1e17ef87 EB |
6814 | halfway between integers, rounding will always be correct as |
6815 | the true mathematical result will be closer to the higher | |
ced57283 | 6816 | integer compared to the lower one. So, this constant works |
1e17ef87 EB |
6817 | for all floating-point numbers. |
6818 | ||
6819 | The reason to use the same constant with subtract/add instead | |
6820 | of a positive and negative constant is to allow the comparison | |
6821 | to be scheduled in parallel with retrieval of the constant and | |
6822 | conversion of the input to the calc_type (if necessary). */ | |
a1ab4c31 AC |
6823 | |
6824 | gnu_zero = convert (gnu_in_basetype, integer_zero_node); | |
7d7a1fe8 | 6825 | gnu_result = gnat_protect_expr (gnu_result); |
ced57283 EB |
6826 | gnu_conv = convert (calc_type, gnu_result); |
6827 | gnu_comp | |
6828 | = fold_build2 (GE_EXPR, integer_type_node, gnu_result, gnu_zero); | |
a1ab4c31 | 6829 | gnu_add_pred_half |
ced57283 | 6830 | = fold_build2 (PLUS_EXPR, calc_type, gnu_conv, gnu_pred_half); |
a1ab4c31 | 6831 | gnu_subtract_pred_half |
ced57283 EB |
6832 | = fold_build2 (MINUS_EXPR, calc_type, gnu_conv, gnu_pred_half); |
6833 | gnu_result = fold_build3 (COND_EXPR, calc_type, gnu_comp, | |
6834 | gnu_add_pred_half, gnu_subtract_pred_half); | |
a1ab4c31 AC |
6835 | } |
6836 | ||
6837 | if (TREE_CODE (gnu_base_type) == INTEGER_TYPE | |
6838 | && TYPE_HAS_ACTUAL_BOUNDS_P (gnu_base_type) | |
6839 | && TREE_CODE (gnu_result) == UNCONSTRAINED_ARRAY_REF) | |
6840 | gnu_result = unchecked_convert (gnu_base_type, gnu_result, false); | |
6841 | else | |
6842 | gnu_result = convert (gnu_base_type, gnu_result); | |
6843 | ||
ced57283 EB |
6844 | /* Finally, do the range check if requested. Note that if the result type |
6845 | is a modular type, the range check is actually an overflow check. */ | |
a1ab4c31 AC |
6846 | if (rangep |
6847 | || (TREE_CODE (gnu_base_type) == INTEGER_TYPE | |
6848 | && TYPE_MODULAR_P (gnu_base_type) && overflowp)) | |
10069d53 | 6849 | gnu_result = emit_range_check (gnu_result, gnat_type, gnat_node); |
a1ab4c31 AC |
6850 | |
6851 | return convert (gnu_type, gnu_result); | |
6852 | } | |
6853 | \f | |
6854 | /* Return true if TYPE is a smaller packable version of RECORD_TYPE. */ | |
6855 | ||
6856 | static bool | |
6857 | smaller_packable_type_p (tree type, tree record_type) | |
6858 | { | |
6859 | tree size, rsize; | |
6860 | ||
6861 | /* We're not interested in variants here. */ | |
6862 | if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (record_type)) | |
6863 | return false; | |
6864 | ||
6865 | /* Like a variant, a packable version keeps the original TYPE_NAME. */ | |
6866 | if (TYPE_NAME (type) != TYPE_NAME (record_type)) | |
6867 | return false; | |
6868 | ||
6869 | size = TYPE_SIZE (type); | |
6870 | rsize = TYPE_SIZE (record_type); | |
6871 | ||
6872 | if (!(TREE_CODE (size) == INTEGER_CST && TREE_CODE (rsize) == INTEGER_CST)) | |
6873 | return false; | |
6874 | ||
6875 | return tree_int_cst_lt (size, rsize) != 0; | |
6876 | } | |
6877 | ||
6878 | /* Return true if GNU_EXPR can be directly addressed. This is the case | |
6879 | unless it is an expression involving computation or if it involves a | |
6880 | reference to a bitfield or to an object not sufficiently aligned for | |
6881 | its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can | |
6882 | be directly addressed as an object of this type. | |
6883 | ||
6884 | *** Notes on addressability issues in the Ada compiler *** | |
6885 | ||
6886 | This predicate is necessary in order to bridge the gap between Gigi | |
6887 | and the middle-end about addressability of GENERIC trees. A tree | |
6888 | is said to be addressable if it can be directly addressed, i.e. if | |
6889 | its address can be taken, is a multiple of the type's alignment on | |
6890 | strict-alignment architectures and returns the first storage unit | |
6891 | assigned to the object represented by the tree. | |
6892 | ||
6893 | In the C family of languages, everything is in practice addressable | |
6894 | at the language level, except for bit-fields. This means that these | |
6895 | compilers will take the address of any tree that doesn't represent | |
6896 | a bit-field reference and expect the result to be the first storage | |
6897 | unit assigned to the object. Even in cases where this will result | |
6898 | in unaligned accesses at run time, nothing is supposed to be done | |
6899 | and the program is considered as erroneous instead (see PR c/18287). | |
6900 | ||
6901 | The implicit assumptions made in the middle-end are in keeping with | |
6902 | the C viewpoint described above: | |
6903 | - the address of a bit-field reference is supposed to be never | |
6904 | taken; the compiler (generally) will stop on such a construct, | |
6905 | - any other tree is addressable if it is formally addressable, | |
6906 | i.e. if it is formally allowed to be the operand of ADDR_EXPR. | |
6907 | ||
6908 | In Ada, the viewpoint is the opposite one: nothing is addressable | |
6909 | at the language level unless explicitly declared so. This means | |
6910 | that the compiler will both make sure that the trees representing | |
6911 | references to addressable ("aliased" in Ada parlance) objects are | |
6912 | addressable and make no real attempts at ensuring that the trees | |
6913 | representing references to non-addressable objects are addressable. | |
6914 | ||
6915 | In the first case, Ada is effectively equivalent to C and handing | |
6916 | down the direct result of applying ADDR_EXPR to these trees to the | |
6917 | middle-end works flawlessly. In the second case, Ada cannot afford | |
6918 | to consider the program as erroneous if the address of trees that | |
6919 | are not addressable is requested for technical reasons, unlike C; | |
6920 | as a consequence, the Ada compiler must arrange for either making | |
6921 | sure that this address is not requested in the middle-end or for | |
6922 | compensating by inserting temporaries if it is requested in Gigi. | |
6923 | ||
6924 | The first goal can be achieved because the middle-end should not | |
6925 | request the address of non-addressable trees on its own; the only | |
6926 | exception is for the invocation of low-level block operations like | |
6927 | memcpy, for which the addressability requirements are lower since | |
6928 | the type's alignment can be disregarded. In practice, this means | |
6929 | that Gigi must make sure that such operations cannot be applied to | |
6930 | non-BLKmode bit-fields. | |
6931 | ||
6932 | The second goal is achieved by means of the addressable_p predicate | |
6933 | and by inserting SAVE_EXPRs around trees deemed non-addressable. | |
6934 | They will be turned during gimplification into proper temporaries | |
6935 | whose address will be used in lieu of that of the original tree. */ | |
6936 | ||
6937 | static bool | |
6938 | addressable_p (tree gnu_expr, tree gnu_type) | |
6939 | { | |
6940 | /* The size of the real type of the object must not be smaller than | |
6941 | that of the expected type, otherwise an indirect access in the | |
6942 | latter type would be larger than the object. Only records need | |
6943 | to be considered in practice. */ | |
6944 | if (gnu_type | |
6945 | && TREE_CODE (gnu_type) == RECORD_TYPE | |
6946 | && smaller_packable_type_p (TREE_TYPE (gnu_expr), gnu_type)) | |
6947 | return false; | |
6948 | ||
6949 | switch (TREE_CODE (gnu_expr)) | |
6950 | { | |
6951 | case VAR_DECL: | |
6952 | case PARM_DECL: | |
6953 | case FUNCTION_DECL: | |
6954 | case RESULT_DECL: | |
6955 | /* All DECLs are addressable: if they are in a register, we can force | |
6956 | them to memory. */ | |
6957 | return true; | |
6958 | ||
6959 | case UNCONSTRAINED_ARRAY_REF: | |
6960 | case INDIRECT_REF: | |
0b3467c4 | 6961 | /* Taking the address of a dereference yields the original pointer. */ |
42c08997 EB |
6962 | return true; |
6963 | ||
a1ab4c31 AC |
6964 | case STRING_CST: |
6965 | case INTEGER_CST: | |
0b3467c4 EB |
6966 | /* Taking the address yields a pointer to the constant pool. */ |
6967 | return true; | |
6968 | ||
6969 | case CONSTRUCTOR: | |
6970 | /* Taking the address of a static constructor yields a pointer to the | |
6971 | tree constant pool. */ | |
6972 | return TREE_STATIC (gnu_expr) ? true : false; | |
6973 | ||
a1ab4c31 AC |
6974 | case NULL_EXPR: |
6975 | case SAVE_EXPR: | |
6976 | case CALL_EXPR: | |
42c08997 EB |
6977 | case PLUS_EXPR: |
6978 | case MINUS_EXPR: | |
9f4afcd4 EB |
6979 | case BIT_IOR_EXPR: |
6980 | case BIT_XOR_EXPR: | |
6981 | case BIT_AND_EXPR: | |
6982 | case BIT_NOT_EXPR: | |
42c08997 EB |
6983 | /* All rvalues are deemed addressable since taking their address will |
6984 | force a temporary to be created by the middle-end. */ | |
a1ab4c31 AC |
6985 | return true; |
6986 | ||
0b3467c4 EB |
6987 | case COMPOUND_EXPR: |
6988 | /* The address of a compound expression is that of its 2nd operand. */ | |
6989 | return addressable_p (TREE_OPERAND (gnu_expr, 1), gnu_type); | |
6990 | ||
a1ab4c31 AC |
6991 | case COND_EXPR: |
6992 | /* We accept &COND_EXPR as soon as both operands are addressable and | |
6993 | expect the outcome to be the address of the selected operand. */ | |
6994 | return (addressable_p (TREE_OPERAND (gnu_expr, 1), NULL_TREE) | |
6995 | && addressable_p (TREE_OPERAND (gnu_expr, 2), NULL_TREE)); | |
6996 | ||
6997 | case COMPONENT_REF: | |
6998 | return (((!DECL_BIT_FIELD (TREE_OPERAND (gnu_expr, 1)) | |
6999 | /* Even with DECL_BIT_FIELD cleared, we have to ensure that | |
7000 | the field is sufficiently aligned, in case it is subject | |
7001 | to a pragma Component_Alignment. But we don't need to | |
7002 | check the alignment of the containing record, as it is | |
7003 | guaranteed to be not smaller than that of its most | |
7004 | aligned field that is not a bit-field. */ | |
1e17ef87 | 7005 | && (!STRICT_ALIGNMENT |
a1ab4c31 AC |
7006 | || DECL_ALIGN (TREE_OPERAND (gnu_expr, 1)) |
7007 | >= TYPE_ALIGN (TREE_TYPE (gnu_expr)))) | |
7008 | /* The field of a padding record is always addressable. */ | |
315cff15 | 7009 | || TYPE_PADDING_P (TREE_TYPE (TREE_OPERAND (gnu_expr, 0)))) |
a1ab4c31 AC |
7010 | && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE)); |
7011 | ||
7012 | case ARRAY_REF: case ARRAY_RANGE_REF: | |
7013 | case REALPART_EXPR: case IMAGPART_EXPR: | |
7014 | case NOP_EXPR: | |
7015 | return addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE); | |
7016 | ||
7017 | case CONVERT_EXPR: | |
7018 | return (AGGREGATE_TYPE_P (TREE_TYPE (gnu_expr)) | |
7019 | && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE)); | |
7020 | ||
7021 | case VIEW_CONVERT_EXPR: | |
7022 | { | |
7023 | /* This is addressable if we can avoid a copy. */ | |
7024 | tree type = TREE_TYPE (gnu_expr); | |
7025 | tree inner_type = TREE_TYPE (TREE_OPERAND (gnu_expr, 0)); | |
7026 | return (((TYPE_MODE (type) == TYPE_MODE (inner_type) | |
7027 | && (!STRICT_ALIGNMENT | |
7028 | || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type) | |
7029 | || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT)) | |
7030 | || ((TYPE_MODE (type) == BLKmode | |
7031 | || TYPE_MODE (inner_type) == BLKmode) | |
7032 | && (!STRICT_ALIGNMENT | |
7033 | || TYPE_ALIGN (type) <= TYPE_ALIGN (inner_type) | |
7034 | || TYPE_ALIGN (inner_type) >= BIGGEST_ALIGNMENT | |
7035 | || TYPE_ALIGN_OK (type) | |
7036 | || TYPE_ALIGN_OK (inner_type)))) | |
7037 | && addressable_p (TREE_OPERAND (gnu_expr, 0), NULL_TREE)); | |
7038 | } | |
7039 | ||
7040 | default: | |
7041 | return false; | |
7042 | } | |
7043 | } | |
7044 | \f | |
7045 | /* Do the processing for the declaration of a GNAT_ENTITY, a type. If | |
7046 | a separate Freeze node exists, delay the bulk of the processing. Otherwise | |
7047 | make a GCC type for GNAT_ENTITY and set up the correspondence. */ | |
7048 | ||
7049 | void | |
7050 | process_type (Entity_Id gnat_entity) | |
7051 | { | |
7052 | tree gnu_old | |
7053 | = present_gnu_tree (gnat_entity) ? get_gnu_tree (gnat_entity) : 0; | |
7054 | tree gnu_new; | |
7055 | ||
7056 | /* If we are to delay elaboration of this type, just do any | |
7057 | elaborations needed for expressions within the declaration and | |
7058 | make a dummy type entry for this node and its Full_View (if | |
7059 | any) in case something points to it. Don't do this if it | |
7060 | has already been done (the only way that can happen is if | |
7061 | the private completion is also delayed). */ | |
7062 | if (Present (Freeze_Node (gnat_entity)) | |
7063 | || (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind) | |
7064 | && Present (Full_View (gnat_entity)) | |
7065 | && Freeze_Node (Full_View (gnat_entity)) | |
7066 | && !present_gnu_tree (Full_View (gnat_entity)))) | |
7067 | { | |
7068 | elaborate_entity (gnat_entity); | |
7069 | ||
7070 | if (!gnu_old) | |
1e17ef87 | 7071 | { |
10069d53 | 7072 | tree gnu_decl = TYPE_STUB_DECL (make_dummy_type (gnat_entity)); |
a1ab4c31 AC |
7073 | save_gnu_tree (gnat_entity, gnu_decl, false); |
7074 | if (IN (Ekind (gnat_entity), Incomplete_Or_Private_Kind) | |
7075 | && Present (Full_View (gnat_entity))) | |
7076 | save_gnu_tree (Full_View (gnat_entity), gnu_decl, false); | |
7077 | } | |
7078 | ||
7079 | return; | |
7080 | } | |
7081 | ||
7082 | /* If we saved away a dummy type for this node it means that this | |
7083 | made the type that corresponds to the full type of an incomplete | |
7084 | type. Clear that type for now and then update the type in the | |
7085 | pointers. */ | |
7086 | if (gnu_old) | |
7087 | { | |
7088 | gcc_assert (TREE_CODE (gnu_old) == TYPE_DECL | |
7089 | && TYPE_IS_DUMMY_P (TREE_TYPE (gnu_old))); | |
7090 | ||
7091 | save_gnu_tree (gnat_entity, NULL_TREE, false); | |
7092 | } | |
7093 | ||
7094 | /* Now fully elaborate the type. */ | |
7095 | gnu_new = gnat_to_gnu_entity (gnat_entity, NULL_TREE, 1); | |
7096 | gcc_assert (TREE_CODE (gnu_new) == TYPE_DECL); | |
7097 | ||
7098 | /* If we have an old type and we've made pointers to this type, | |
7099 | update those pointers. */ | |
7100 | if (gnu_old) | |
7101 | update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_old)), | |
7102 | TREE_TYPE (gnu_new)); | |
7103 | ||
7104 | /* If this is a record type corresponding to a task or protected type | |
7105 | that is a completion of an incomplete type, perform a similar update | |
1e17ef87 | 7106 | on the type. ??? Including protected types here is a guess. */ |
a1ab4c31 AC |
7107 | if (IN (Ekind (gnat_entity), Record_Kind) |
7108 | && Is_Concurrent_Record_Type (gnat_entity) | |
7109 | && present_gnu_tree (Corresponding_Concurrent_Type (gnat_entity))) | |
7110 | { | |
7111 | tree gnu_task_old | |
7112 | = get_gnu_tree (Corresponding_Concurrent_Type (gnat_entity)); | |
7113 | ||
7114 | save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity), | |
7115 | NULL_TREE, false); | |
7116 | save_gnu_tree (Corresponding_Concurrent_Type (gnat_entity), | |
7117 | gnu_new, false); | |
7118 | ||
7119 | update_pointer_to (TYPE_MAIN_VARIANT (TREE_TYPE (gnu_task_old)), | |
7120 | TREE_TYPE (gnu_new)); | |
7121 | } | |
7122 | } | |
7123 | \f | |
7124 | /* GNAT_ENTITY is the type of the resulting constructors, | |
7125 | GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate, | |
7126 | and GNU_TYPE is the GCC type of the corresponding record. | |
7127 | ||
7128 | Return a CONSTRUCTOR to build the record. */ | |
7129 | ||
7130 | static tree | |
7131 | assoc_to_constructor (Entity_Id gnat_entity, Node_Id gnat_assoc, tree gnu_type) | |
7132 | { | |
7133 | tree gnu_list, gnu_result; | |
7134 | ||
7135 | /* We test for GNU_FIELD being empty in the case where a variant | |
7136 | was the last thing since we don't take things off GNAT_ASSOC in | |
7137 | that case. We check GNAT_ASSOC in case we have a variant, but it | |
7138 | has no fields. */ | |
7139 | ||
7140 | for (gnu_list = NULL_TREE; Present (gnat_assoc); | |
7141 | gnat_assoc = Next (gnat_assoc)) | |
7142 | { | |
7143 | Node_Id gnat_field = First (Choices (gnat_assoc)); | |
7144 | tree gnu_field = gnat_to_gnu_field_decl (Entity (gnat_field)); | |
7145 | tree gnu_expr = gnat_to_gnu (Expression (gnat_assoc)); | |
7146 | ||
7147 | /* The expander is supposed to put a single component selector name | |
1e17ef87 | 7148 | in every record component association. */ |
a1ab4c31 AC |
7149 | gcc_assert (No (Next (gnat_field))); |
7150 | ||
7151 | /* Ignore fields that have Corresponding_Discriminants since we'll | |
7152 | be setting that field in the parent. */ | |
7153 | if (Present (Corresponding_Discriminant (Entity (gnat_field))) | |
7154 | && Is_Tagged_Type (Scope (Entity (gnat_field)))) | |
7155 | continue; | |
7156 | ||
7157 | /* Also ignore discriminants of Unchecked_Unions. */ | |
7158 | else if (Is_Unchecked_Union (gnat_entity) | |
7159 | && Ekind (Entity (gnat_field)) == E_Discriminant) | |
7160 | continue; | |
7161 | ||
7162 | /* Before assigning a value in an aggregate make sure range checks | |
7163 | are done if required. Then convert to the type of the field. */ | |
7164 | if (Do_Range_Check (Expression (gnat_assoc))) | |
10069d53 | 7165 | gnu_expr = emit_range_check (gnu_expr, Etype (gnat_field), Empty); |
a1ab4c31 AC |
7166 | |
7167 | gnu_expr = convert (TREE_TYPE (gnu_field), gnu_expr); | |
7168 | ||
7169 | /* Add the field and expression to the list. */ | |
7170 | gnu_list = tree_cons (gnu_field, gnu_expr, gnu_list); | |
7171 | } | |
7172 | ||
7173 | gnu_result = extract_values (gnu_list, gnu_type); | |
7174 | ||
7175 | #ifdef ENABLE_CHECKING | |
7176 | { | |
7177 | tree gnu_field; | |
7178 | ||
7179 | /* Verify every entry in GNU_LIST was used. */ | |
7180 | for (gnu_field = gnu_list; gnu_field; gnu_field = TREE_CHAIN (gnu_field)) | |
7181 | gcc_assert (TREE_ADDRESSABLE (gnu_field)); | |
7182 | } | |
7183 | #endif | |
7184 | ||
7185 | return gnu_result; | |
7186 | } | |
7187 | ||
1e17ef87 EB |
7188 | /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is |
7189 | the first element of an array aggregate. It may itself be an aggregate. | |
7190 | GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate. | |
7191 | GNAT_COMPONENT_TYPE is the type of the array component; it is needed | |
7192 | for range checking. */ | |
a1ab4c31 AC |
7193 | |
7194 | static tree | |
7195 | pos_to_constructor (Node_Id gnat_expr, tree gnu_array_type, | |
1e17ef87 | 7196 | Entity_Id gnat_component_type) |
a1ab4c31 AC |
7197 | { |
7198 | tree gnu_expr_list = NULL_TREE; | |
7199 | tree gnu_index = TYPE_MIN_VALUE (TYPE_DOMAIN (gnu_array_type)); | |
7200 | tree gnu_expr; | |
7201 | ||
7202 | for ( ; Present (gnat_expr); gnat_expr = Next (gnat_expr)) | |
7203 | { | |
7204 | /* If the expression is itself an array aggregate then first build the | |
7205 | innermost constructor if it is part of our array (multi-dimensional | |
7206 | case). */ | |
a1ab4c31 AC |
7207 | if (Nkind (gnat_expr) == N_Aggregate |
7208 | && TREE_CODE (TREE_TYPE (gnu_array_type)) == ARRAY_TYPE | |
7209 | && TYPE_MULTI_ARRAY_P (TREE_TYPE (gnu_array_type))) | |
7210 | gnu_expr = pos_to_constructor (First (Expressions (gnat_expr)), | |
7211 | TREE_TYPE (gnu_array_type), | |
7212 | gnat_component_type); | |
7213 | else | |
7214 | { | |
7215 | gnu_expr = gnat_to_gnu (gnat_expr); | |
7216 | ||
10069d53 | 7217 | /* Before assigning the element to the array, make sure it is |
1e17ef87 | 7218 | in range. */ |
a1ab4c31 | 7219 | if (Do_Range_Check (gnat_expr)) |
10069d53 | 7220 | gnu_expr = emit_range_check (gnu_expr, gnat_component_type, Empty); |
a1ab4c31 AC |
7221 | } |
7222 | ||
7223 | gnu_expr_list | |
7224 | = tree_cons (gnu_index, convert (TREE_TYPE (gnu_array_type), gnu_expr), | |
7225 | gnu_expr_list); | |
7226 | ||
7227 | gnu_index = int_const_binop (PLUS_EXPR, gnu_index, integer_one_node, 0); | |
7228 | } | |
7229 | ||
7230 | return gnat_build_constructor (gnu_array_type, nreverse (gnu_expr_list)); | |
7231 | } | |
7232 | \f | |
7233 | /* Subroutine of assoc_to_constructor: VALUES is a list of field associations, | |
7234 | some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting | |
7235 | of the associations that are from RECORD_TYPE. If we see an internal | |
7236 | record, make a recursive call to fill it in as well. */ | |
7237 | ||
7238 | static tree | |
7239 | extract_values (tree values, tree record_type) | |
7240 | { | |
7241 | tree result = NULL_TREE; | |
7242 | tree field, tem; | |
7243 | ||
7244 | for (field = TYPE_FIELDS (record_type); field; field = TREE_CHAIN (field)) | |
7245 | { | |
7246 | tree value = 0; | |
7247 | ||
7248 | /* _Parent is an internal field, but may have values in the aggregate, | |
7249 | so check for values first. */ | |
7250 | if ((tem = purpose_member (field, values))) | |
7251 | { | |
7252 | value = TREE_VALUE (tem); | |
7253 | TREE_ADDRESSABLE (tem) = 1; | |
7254 | } | |
7255 | ||
7256 | else if (DECL_INTERNAL_P (field)) | |
7257 | { | |
7258 | value = extract_values (values, TREE_TYPE (field)); | |
7259 | if (TREE_CODE (value) == CONSTRUCTOR | |
7260 | && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (value))) | |
7261 | value = 0; | |
7262 | } | |
7263 | else | |
7264 | /* If we have a record subtype, the names will match, but not the | |
7265 | actual FIELD_DECLs. */ | |
7266 | for (tem = values; tem; tem = TREE_CHAIN (tem)) | |
7267 | if (DECL_NAME (TREE_PURPOSE (tem)) == DECL_NAME (field)) | |
7268 | { | |
7269 | value = convert (TREE_TYPE (field), TREE_VALUE (tem)); | |
7270 | TREE_ADDRESSABLE (tem) = 1; | |
7271 | } | |
7272 | ||
7273 | if (!value) | |
7274 | continue; | |
7275 | ||
7276 | result = tree_cons (field, value, result); | |
7277 | } | |
7278 | ||
7279 | return gnat_build_constructor (record_type, nreverse (result)); | |
7280 | } | |
7281 | \f | |
7282 | /* EXP is to be treated as an array or record. Handle the cases when it is | |
7283 | an access object and perform the required dereferences. */ | |
7284 | ||
7285 | static tree | |
7286 | maybe_implicit_deref (tree exp) | |
7287 | { | |
7288 | /* If the type is a pointer, dereference it. */ | |
315cff15 EB |
7289 | if (POINTER_TYPE_P (TREE_TYPE (exp)) |
7290 | || TYPE_IS_FAT_POINTER_P (TREE_TYPE (exp))) | |
a1ab4c31 AC |
7291 | exp = build_unary_op (INDIRECT_REF, NULL_TREE, exp); |
7292 | ||
7293 | /* If we got a padded type, remove it too. */ | |
315cff15 | 7294 | if (TYPE_IS_PADDING_P (TREE_TYPE (exp))) |
a1ab4c31 AC |
7295 | exp = convert (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (exp))), exp); |
7296 | ||
7297 | return exp; | |
7298 | } | |
7299 | \f | |
a1ab4c31 AC |
7300 | /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code |
7301 | location and false if it doesn't. In the former case, set the Gigi global | |
7302 | variable REF_FILENAME to the simple debug file name as given by sinput. */ | |
7303 | ||
7304 | bool | |
7305 | Sloc_to_locus (Source_Ptr Sloc, location_t *locus) | |
7306 | { | |
7307 | if (Sloc == No_Location) | |
7308 | return false; | |
7309 | ||
7310 | if (Sloc <= Standard_Location) | |
7311 | { | |
10069d53 | 7312 | *locus = BUILTINS_LOCATION; |
a1ab4c31 AC |
7313 | return false; |
7314 | } | |
7315 | else | |
7316 | { | |
7317 | Source_File_Index file = Get_Source_File_Index (Sloc); | |
7318 | Logical_Line_Number line = Get_Logical_Line_Number (Sloc); | |
7319 | Column_Number column = Get_Column_Number (Sloc); | |
7320 | struct line_map *map = &line_table->maps[file - 1]; | |
7321 | ||
7322 | /* Translate the location according to the line-map.h formula. */ | |
7323 | *locus = map->start_location | |
7324 | + ((line - map->to_line) << map->column_bits) | |
7325 | + (column & ((1 << map->column_bits) - 1)); | |
7326 | } | |
7327 | ||
7328 | ref_filename | |
7329 | = IDENTIFIER_POINTER | |
7330 | (get_identifier | |
7331 | (Get_Name_String (Debug_Source_Name (Get_Source_File_Index (Sloc)))));; | |
7332 | ||
7333 | return true; | |
7334 | } | |
7335 | ||
7336 | /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and | |
7337 | don't do anything if it doesn't correspond to a source location. */ | |
7338 | ||
7339 | static void | |
7340 | set_expr_location_from_node (tree node, Node_Id gnat_node) | |
7341 | { | |
7342 | location_t locus; | |
7343 | ||
7344 | if (!Sloc_to_locus (Sloc (gnat_node), &locus)) | |
7345 | return; | |
7346 | ||
7347 | SET_EXPR_LOCATION (node, locus); | |
7348 | } | |
7349 | \f | |
7350 | /* Return a colon-separated list of encodings contained in encoded Ada | |
7351 | name. */ | |
7352 | ||
7353 | static const char * | |
7354 | extract_encoding (const char *name) | |
7355 | { | |
7356 | char *encoding = GGC_NEWVEC (char, strlen (name)); | |
a1ab4c31 | 7357 | get_encoding (name, encoding); |
a1ab4c31 AC |
7358 | return encoding; |
7359 | } | |
7360 | ||
7361 | /* Extract the Ada name from an encoded name. */ | |
7362 | ||
7363 | static const char * | |
7364 | decode_name (const char *name) | |
7365 | { | |
7366 | char *decoded = GGC_NEWVEC (char, strlen (name) * 2 + 60); | |
a1ab4c31 | 7367 | __gnat_decode (name, decoded, 0); |
a1ab4c31 AC |
7368 | return decoded; |
7369 | } | |
7370 | \f | |
7371 | /* Post an error message. MSG is the error message, properly annotated. | |
7372 | NODE is the node at which to post the error and the node to use for the | |
7373 | "&" substitution. */ | |
7374 | ||
7375 | void | |
7376 | post_error (const char *msg, Node_Id node) | |
7377 | { | |
7378 | String_Template temp; | |
7379 | Fat_Pointer fp; | |
7380 | ||
7381 | temp.Low_Bound = 1, temp.High_Bound = strlen (msg); | |
7382 | fp.Array = msg, fp.Bounds = &temp; | |
7383 | if (Present (node)) | |
7384 | Error_Msg_N (fp, node); | |
7385 | } | |
7386 | ||
7387 | /* Similar, but NODE is the node at which to post the error and ENT | |
7388 | is the node to use for the "&" substitution. */ | |
7389 | ||
7390 | void | |
7391 | post_error_ne (const char *msg, Node_Id node, Entity_Id ent) | |
7392 | { | |
7393 | String_Template temp; | |
7394 | Fat_Pointer fp; | |
7395 | ||
7396 | temp.Low_Bound = 1, temp.High_Bound = strlen (msg); | |
7397 | fp.Array = msg, fp.Bounds = &temp; | |
7398 | if (Present (node)) | |
7399 | Error_Msg_NE (fp, node, ent); | |
7400 | } | |
7401 | ||
7402 | /* Similar, but NODE is the node at which to post the error, ENT is the node | |
7403 | to use for the "&" substitution, and N is the number to use for the ^. */ | |
7404 | ||
7405 | void | |
7406 | post_error_ne_num (const char *msg, Node_Id node, Entity_Id ent, int n) | |
7407 | { | |
7408 | String_Template temp; | |
7409 | Fat_Pointer fp; | |
7410 | ||
7411 | temp.Low_Bound = 1, temp.High_Bound = strlen (msg); | |
7412 | fp.Array = msg, fp.Bounds = &temp; | |
7413 | Error_Msg_Uint_1 = UI_From_Int (n); | |
7414 | ||
7415 | if (Present (node)) | |
7416 | Error_Msg_NE (fp, node, ent); | |
7417 | } | |
7418 | \f | |
7419 | /* Similar to post_error_ne_num, but T is a GCC tree representing the | |
7420 | number to write. If the tree represents a constant that fits within | |
7421 | a host integer, the text inside curly brackets in MSG will be output | |
7422 | (presumably including a '^'). Otherwise that text will not be output | |
7423 | and the text inside square brackets will be output instead. */ | |
7424 | ||
7425 | void | |
7426 | post_error_ne_tree (const char *msg, Node_Id node, Entity_Id ent, tree t) | |
7427 | { | |
7428 | char *newmsg = XALLOCAVEC (char, strlen (msg) + 1); | |
7429 | String_Template temp = {1, 0}; | |
7430 | Fat_Pointer fp; | |
7431 | char start_yes, end_yes, start_no, end_no; | |
7432 | const char *p; | |
7433 | char *q; | |
7434 | ||
7435 | fp.Array = newmsg, fp.Bounds = &temp; | |
7436 | ||
7437 | if (host_integerp (t, 1) | |
7438 | #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT | |
7439 | && | |
7440 | compare_tree_int | |
7441 | (t, (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_INT - 1)) - 1)) < 0 | |
7442 | #endif | |
7443 | ) | |
7444 | { | |
7445 | Error_Msg_Uint_1 = UI_From_Int (tree_low_cst (t, 1)); | |
7446 | start_yes = '{', end_yes = '}', start_no = '[', end_no = ']'; | |
7447 | } | |
7448 | else | |
7449 | start_yes = '[', end_yes = ']', start_no = '{', end_no = '}'; | |
7450 | ||
7451 | for (p = msg, q = newmsg; *p; p++) | |
7452 | { | |
7453 | if (*p == start_yes) | |
7454 | for (p++; *p != end_yes; p++) | |
7455 | *q++ = *p; | |
7456 | else if (*p == start_no) | |
7457 | for (p++; *p != end_no; p++) | |
7458 | ; | |
7459 | else | |
7460 | *q++ = *p; | |
7461 | } | |
7462 | ||
7463 | *q = 0; | |
7464 | ||
7465 | temp.High_Bound = strlen (newmsg); | |
7466 | if (Present (node)) | |
7467 | Error_Msg_NE (fp, node, ent); | |
7468 | } | |
7469 | ||
7470 | /* Similar to post_error_ne_tree, except that NUM is a second | |
7471 | integer to write in the message. */ | |
7472 | ||
7473 | void | |
1e17ef87 EB |
7474 | post_error_ne_tree_2 (const char *msg, Node_Id node, Entity_Id ent, tree t, |
7475 | int num) | |
a1ab4c31 AC |
7476 | { |
7477 | Error_Msg_Uint_2 = UI_From_Int (num); | |
7478 | post_error_ne_tree (msg, node, ent, t); | |
7479 | } | |
7480 | \f | |
7481 | /* Initialize the table that maps GNAT codes to GCC codes for simple | |
7482 | binary and unary operations. */ | |
7483 | ||
7484 | static void | |
7485 | init_code_table (void) | |
7486 | { | |
7487 | gnu_codes[N_And_Then] = TRUTH_ANDIF_EXPR; | |
7488 | gnu_codes[N_Or_Else] = TRUTH_ORIF_EXPR; | |
7489 | ||
7490 | gnu_codes[N_Op_And] = TRUTH_AND_EXPR; | |
7491 | gnu_codes[N_Op_Or] = TRUTH_OR_EXPR; | |
7492 | gnu_codes[N_Op_Xor] = TRUTH_XOR_EXPR; | |
7493 | gnu_codes[N_Op_Eq] = EQ_EXPR; | |
7494 | gnu_codes[N_Op_Ne] = NE_EXPR; | |
7495 | gnu_codes[N_Op_Lt] = LT_EXPR; | |
7496 | gnu_codes[N_Op_Le] = LE_EXPR; | |
7497 | gnu_codes[N_Op_Gt] = GT_EXPR; | |
7498 | gnu_codes[N_Op_Ge] = GE_EXPR; | |
7499 | gnu_codes[N_Op_Add] = PLUS_EXPR; | |
7500 | gnu_codes[N_Op_Subtract] = MINUS_EXPR; | |
7501 | gnu_codes[N_Op_Multiply] = MULT_EXPR; | |
7502 | gnu_codes[N_Op_Mod] = FLOOR_MOD_EXPR; | |
7503 | gnu_codes[N_Op_Rem] = TRUNC_MOD_EXPR; | |
7504 | gnu_codes[N_Op_Minus] = NEGATE_EXPR; | |
7505 | gnu_codes[N_Op_Abs] = ABS_EXPR; | |
7506 | gnu_codes[N_Op_Not] = TRUTH_NOT_EXPR; | |
7507 | gnu_codes[N_Op_Rotate_Left] = LROTATE_EXPR; | |
7508 | gnu_codes[N_Op_Rotate_Right] = RROTATE_EXPR; | |
7509 | gnu_codes[N_Op_Shift_Left] = LSHIFT_EXPR; | |
7510 | gnu_codes[N_Op_Shift_Right] = RSHIFT_EXPR; | |
7511 | gnu_codes[N_Op_Shift_Right_Arithmetic] = RSHIFT_EXPR; | |
7512 | } | |
7513 | ||
7514 | /* Return a label to branch to for the exception type in KIND or NULL_TREE | |
7515 | if none. */ | |
7516 | ||
7517 | tree | |
7518 | get_exception_label (char kind) | |
7519 | { | |
7520 | if (kind == N_Raise_Constraint_Error) | |
7521 | return TREE_VALUE (gnu_constraint_error_label_stack); | |
7522 | else if (kind == N_Raise_Storage_Error) | |
7523 | return TREE_VALUE (gnu_storage_error_label_stack); | |
7524 | else if (kind == N_Raise_Program_Error) | |
7525 | return TREE_VALUE (gnu_program_error_label_stack); | |
7526 | else | |
7527 | return NULL_TREE; | |
7528 | } | |
7529 | ||
7530 | #include "gt-ada-trans.h" |