| blob | 258b79cbb52712f653a1b7facab15b801abc7640 |
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * T R A N S *
6 * *
7 * C Implementation File *
8 * *
9 * Copyright (C) 1992-2014, Free Software Foundation, Inc. *
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- *
13 * ware Foundation; either version 3, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING3. If not see *
19 * <http://www.gnu.org/licenses/>. *
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 ****************************************************************************/
77 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
78 for fear of running out of stack space. If we need more, we use xmalloc
79 instead. */
80 #define ALLOCA_THRESHOLD 1000
82 /* In configurations where blocks have no end_locus attached, just
83 sink assignments into a dummy global. */
84 #ifndef BLOCK_SOURCE_END_LOCATION
86 #define BLOCK_SOURCE_END_LOCATION(BLOCK) block_end_locus_sink
87 #endif
89 /* Pointers to front-end tables accessed through macros. */
100 /* Highest number in the front-end node table. */
103 /* Current node being treated, in case abort called. */
104 Node_Id error_gnat_node;
106 /* True when gigi is being called on an analyzed but unexpanded
107 tree, and the only purpose of the call is to properly annotate
108 types with representation information. */
111 /* Current filename without path. */
115 /* List of N_Validate_Unchecked_Conversion nodes in the unit. */
118 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
119 of unconstrained array IN parameters to avoid emitting a great deal of
120 redundant instructions to recompute them each time. */
124 tree first;
125 tree last;
126 tree length;
127 };
134 bitmap named_ret_val;
137 };
139 #define f_parm_attr_cache \
140 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
142 #define f_named_ret_val \
143 DECL_STRUCT_FUNCTION (current_function_decl)->language->named_ret_val
145 #define f_other_ret_val \
146 DECL_STRUCT_FUNCTION (current_function_decl)->language->other_ret_val
148 #define f_gnat_ret \
149 DECL_STRUCT_FUNCTION (current_function_decl)->language->gnat_ret
151 /* A structure used to gather together information about a statement group.
152 We use this to gather related statements, for example the "then" part
153 of a IF. In the case where it represents a lexical scope, we may also
154 have a BLOCK node corresponding to it and/or cleanups. */
161 };
165 /* List of unused struct stmt_group nodes. */
168 /* A structure used to record information on elaboration procedures
169 we've made and need to process.
171 ??? gnat_node should be Node_Id, but gengtype gets confused. */
177 };
181 /* Stack of exception pointer variables. Each entry is the VAR_DECL
182 that stores the address of the raised exception. Nonzero means we
183 are in an exception handler. Not used in the zero-cost case. */
186 /* In ZCX case, current exception pointer. Used to re-raise it. */
189 /* Stack for storing the current elaboration procedure decl. */
192 /* Stack of labels to be used as a goto target instead of a return in
193 some functions. See processing for N_Subprogram_Body. */
196 /* Stack of variable for the return value of a function with copy-in/copy-out
197 parameters. See processing for N_Subprogram_Body. */
200 /* Structure used to record information for a range check. */
202 tree low_bound;
203 tree high_bound;
204 tree type;
205 tree invariant_cond;
206 };
211 /* Structure used to record information for a loop. */
213 tree stmt;
214 tree loop_var;
216 };
221 /* Stack of loop_info structures associated with LOOP_STMT nodes. */
224 /* The stacks for N_{Push,Pop}_*_Label. */
229 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
266 /* Hooks for debug info back-ends, only supported and used in a restricted set
267 of configurations. */
270 \f
271 /* This is the main program of the back-end. It sets up all the table
272 structures and then generates code. */
274 void
287 Nat number_file,
289 Entity_Id standard_boolean,
290 Entity_Id standard_integer,
291 Entity_Id standard_character,
292 Entity_Id standard_long_long_float,
293 Entity_Id standard_exception_type,
294 Int gigi_operating_mode)
295 {
296 Node_Id gnat_iter;
297 Entity_Id gnat_literal;
317 {
318 /* Use the identifier table to make a permanent copy of the filename as
319 the name table gets reallocated after Gigi returns but before all the
320 debugging information is output. The __gnat_to_canonical_file_spec
321 call translates filenames from pragmas Source_Reference that contain
322 host style syntax not understood by gdb. */
324 = IDENTIFIER_POINTER
325 (get_identifier
326 (__gnat_to_canonical_file_spec
329 /* We rely on the order isomorphism between files and line maps. */
332 /* We create the line map for a source file at once, with a fixed number
333 of columns chosen to avoid jumping over the next power of 2. */
338 }
342 /* Declare the name of the compilation unit as the first global
343 name in order to make the middle-end fully deterministic. */
347 /* Initialize ourselves. */
352 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
353 errors. */
355 {
358 }
360 /* Enable GNAT stack checking method if needed */
364 /* Retrieve alignment settings. */
368 /* Record the builtin types. Define `integer' and `character' first so that
369 dbx will output them first. */
375 /* Save the type we made for integer as the type for Standard.Integer. */
380 /* Likewise for character as the type for Standard.Character. */
385 /* Likewise for boolean as the type for Standard.Boolean. */
409 /* Now declare run-time functions. */
412 /* malloc is a function declaration tree for a function to allocate
413 memory. */
414 malloc_decl
420 /* free is a function declaration tree for a function to free memory. */
421 free_decl
424 ptr_void_type_node,
425 NULL_TREE),
427 Empty);
429 /* This is used for 64-bit multiplication with overflow checking. */
431 mulv64_decl
436 Empty);
438 /* Name of the _Parent field in tagged record types. */
441 /* Name of the Exception_Data type defined in System.Standard_Library. */
442 exception_data_name_id
445 /* Make the types and functions used for exception processing. */
446 jmpbuf_type
452 /* Functions to get and set the jumpbuf pointer for the current thread. */
453 get_jmpbuf_decl
454 = create_subprog_decl
460 set_jmpbuf_decl
461 = create_subprog_decl
464 NULL_TREE),
468 /* setjmp returns an integer and has one operand, which is a pointer to
469 a jmpbuf. */
470 setjmp_decl
471 = create_subprog_decl
474 NULL_TREE),
479 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
480 address. */
481 update_setjmp_buf_decl
482 = create_subprog_decl
489 /* Hooks to call when entering/leaving an exception handler. */
490 ftype
493 begin_handler_decl
499 end_handler_decl
505 unhandled_except_decl
507 NULL_TREE,
512 reraise_zcx_decl
516 /* Indicate that these never return. */
523 /* If in no exception handlers mode, all raise statements are redirected to
524 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
525 this procedure will never be called in this mode. */
527 {
528 tree decl
529 = create_subprog_decl
532 build_pointer_type
542 }
543 else
544 {
545 /* Otherwise, make one decl for each exception reason. */
551 i == CE_Index_Check_Failed
555 }
557 /* Set the types that GCC and Gigi use from the front end. */
560 /* Make other functions used for exception processing. */
561 get_excptr_decl
562 = create_subprog_decl
565 NULL_TREE),
569 set_exception_parameter_decl
570 = create_subprog_decl
573 ptr_void_type_node,
574 ptr_void_type_node,
575 NULL_TREE),
578 raise_nodefer_decl
579 = create_subprog_decl
583 NULL_TREE),
586 /* Indicate that it never returns. */
591 TYPE_QUAL_VOLATILE);
593 /* Build the special descriptor type and its null node if needed. */
595 {
607 {
608 tree field
615 elt--;
616 }
621 }
623 longest_float_type_node
626 /* Dummy objects to materialize "others" and "all others" in the exception
627 tables. These are exported by a-exexpr-gcc.adb, so see this unit for
628 the types to use. */
629 others_decl
632 unsigned_char_type_node,
635 all_others_decl
638 unsigned_char_type_node,
641 unhandled_others_decl
644 unsigned_char_type_node,
649 /* Install the builtins we might need, either internally or as
650 user available facilities for Intrinsic imports. */
658 /* Process any Pragma Ident for the main unit. */
663 /* If we are using the GCC exception mechanism, let GCC know. */
667 /* Initialize the GCC support for FP operations. */
670 /* Now translate the compilation unit proper. */
673 /* Then process the N_Validate_Unchecked_Conversion nodes. We do this at
674 the very end to avoid having to second-guess the front-end when we run
675 into dummy nodes during the regular processing. */
680 /* Finally see if we have any elaboration procedures to deal with. */
682 {
685 /* We should have a BIND_EXPR but it may not have any statements in it.
686 If it doesn't have any, we have nothing to do except for setting the
687 flag on the GNAT node. Otherwise, process the function as others. */
693 else
694 {
698 }
699 }
701 /* Destroy ourselves. */
705 /* We cannot track the location of errors past this point. */
707 }
708 \f
709 /* Return a subprogram decl corresponding to __gnat_rcheck_xx for the given
710 CHECK if KIND is EXCEPTION_SIMPLE, or else to __gnat_rcheck_xx_ext. */
712 static tree
714 {
723 {
725 ftype
727 build_pointer_type
730 }
731 else
732 {
737 ftype
739 build_pointer_type
743 }
745 result
750 /* Indicate that it never returns. */
757 }
758 \f
759 /* Return a positive value if an lvalue is required for GNAT_NODE, which is
760 an N_Attribute_Reference. */
762 static int
764 {
766 {
806 }
807 }
809 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
810 is the type that will be used for GNAT_NODE in the translated GNU tree.
811 CONSTANT indicates whether the underlying object represented by GNAT_NODE
812 is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates
813 whether its value is the address of a constant and ALIASED whether it is
814 aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored.
816 The function climbs up the GNAT tree starting from the node and returns 1
817 upon encountering a node that effectively requires an lvalue downstream.
818 It returns int instead of bool to facilitate usage in non-purely binary
819 logic contexts. */
821 static int
824 {
828 {
838 /* If the parameter is by reference, an lvalue is required. */
844 /* Only the array expression can require an lvalue. */
848 /* ??? Consider that referencing an indexed component with a
849 non-constant index forces the whole aggregate to memory.
850 Note that N_Integer_Literal is conservative, any static
851 expression in the RM sense could probably be accepted. */
858 /* ... fall through ... */
861 /* Only the array expression can require an lvalue. */
875 /* We need to preserve addresses through a renaming. */
879 /* We cannot use a constructor if this is an atomic object because
880 the actual assignment might end up being done component-wise. */
884 /* We don't use a constructor if this is a class-wide object
885 because the effective type of the object is the equivalent
886 type of the class-wide subtype and it smashes most of the
887 data into an array of bytes to which we cannot convert. */
892 /* We cannot use a constructor if the LHS is an atomic object because
893 the actual assignment might end up being done component-wise. */
903 /* ... fall through ... */
907 /* We must look through all conversions because we may need to bypass
908 an intermediate conversion that is meant to be purely formal. */
914 /* We should only reach here through the N_Qualified_Expression case.
915 Force an lvalue for composite types since a block-copy to the newly
916 allocated area of memory is made. */
920 /* We look through dereferences for address of constant because we need
921 to handle the special cases listed above. */
927 /* ... fall through ... */
931 }
934 }
936 /* Return true if T is a constant DECL node that can be safely replaced
937 by its initializer. */
939 static bool
941 {
945 /* Return false for aggregate types that contain a placeholder since
946 their initializers cannot be manipulated easily. */
953 }
955 /* Return an expression equivalent to EXP but where constant DECL nodes
956 have been replaced by their initializer. */
958 static tree
960 {
962 tree op0;
965 {
1002 }
1005 }
1007 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
1008 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
1009 to where we should place the result type. */
1011 static tree
1013 {
1017 /* Whether we should require an lvalue for GNAT_NODE. Needed in
1018 specific circumstances only, so evaluated lazily. < 0 means
1019 unknown, > 0 means known true, 0 means known false. */
1022 /* If GNAT_NODE is a constant, whether we should use the initialization
1023 value instead of the constant entity, typically for scalars with an
1024 address clause when the parent doesn't require an lvalue. */
1027 /* If the Etype of this node does not equal the Etype of the Entity,
1028 something is wrong with the entity map, probably in generic
1029 instantiation. However, this does not apply to types. Since we sometime
1030 have strange Ekind's, just do this test for objects. Also, if the Etype of
1031 the Entity is private, the Etype of the N_Identifier is allowed to be the
1032 full type and also we consider a packed array type to be the same as the
1033 original type. Similarly, a class-wide type is equivalent to a subtype of
1034 itself. Finally, if the types are Itypes, one may be a copy of the other,
1035 which is also legal. */
1050 == Packed_Array_Impl_Type
1059 /* If this is a reference to a deferred constant whose partial view is an
1060 unconstrained private type, the proper type is on the full view of the
1061 constant, not on the full view of the type, which may be unconstrained.
1063 This may be a reference to a type, for example in the prefix of the
1064 attribute Position, generated for dispatching code (see Make_DT in
1065 exp_disp,adb). In that case we need the type itself, not is parent,
1066 in particular if it is a derived type */
1073 {
1076 }
1077 else
1078 {
1079 /* We want to use the Actual_Subtype if it has already been elaborated,
1080 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
1081 simplify things. */
1089 else
1091 }
1093 /* Expand the type of this identifier first, in case it is an enumeral
1094 literal, which only get made when the type is expanded. There is no
1095 order-of-elaboration issue here. */
1098 /* If this is a non-imported elementary constant with an address clause,
1099 retrieve the value instead of a pointer to be dereferenced unless
1100 an lvalue is required. This is generally more efficient and actually
1101 required if this is a static expression because it might be used
1102 in a context where a dereference is inappropriate, such as a case
1103 statement alternative or a record discriminant. There is no possible
1104 volatile-ness short-circuit here since Volatile constants must be
1105 imported per C.6. */
1110 {
1114 }
1117 {
1118 /* If this is a deferred constant, the initializer is attached to
1119 the full view. */
1124 }
1125 else
1128 /* Some objects (such as parameters passed by reference, globals of
1129 variable size, and renamed objects) actually represent the address
1130 of the object. In that case, we must do the dereference. Likewise,
1131 deal with parameters to foreign convention subprograms. */
1136 {
1139 /* If it's a PARM_DECL to foreign convention subprogram, convert it. */
1142 gnu_result
1145 /* If it's a CONST_DECL, return the underlying constant like below. */
1152 /* If it's a renaming pointer and, either the renamed object is constant
1153 or we are at the right binding level, we can reference the renamed
1154 object directly, since it is constant or has been protected against
1155 multiple evaluations. */
1164 /* Otherwise, do the final dereference. */
1165 else
1166 {
1176 }
1177 }
1179 /* If we have a constant declaration and its initializer, try to return the
1180 latter to avoid the need to call fold in lots of places and the need for
1181 elaboration code if this identifier is used as an initializer itself. */
1183 {
1189 /* If there is a (corresponding) variable or this is the address of a
1190 constant, we only want to return the initializer if an lvalue isn't
1191 required. Evaluate this now if we have not already done so. */
1193 require_lvalue
1197 /* Finally retrieve the initializer if this is deemed valid. */
1200 }
1202 /* But for a constant renaming we couldn't do that incrementally for its
1203 definition because of the need to return an lvalue so, if the present
1204 context doesn't itself require an lvalue, we try again here. */
1208 {
1210 require_lvalue
1215 }
1217 /* The GNAT tree has the type of a function set to its result type, so we
1218 adjust here. Also use the type of the result if the Etype is a subtype
1219 that is nominally unconstrained. Likewise if this is a deferred constant
1220 of a discriminated type whose full view can be elaborated statically, to
1221 avoid problematic conversions to the nominal subtype. But remove any
1222 padding from the resulting type. */
1229 {
1233 }
1238 }
1239 \f
1240 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1241 any statements we generate. */
1243 static tree
1245 {
1248 Node_Id gnat_temp;
1250 /* Do nothing if we are just annotating types and check for (and ignore)
1251 unrecognized pragmas. */
1258 {
1260 /* Do nothing at top level: all such variables are already viewable. */
1267 {
1271 machine_mode mode;
1273 #ifdef ASM_COMMENT_START
1275 #endif
1280 /* Use the value only if it fits into a normal register,
1281 otherwise use the address. */
1290 #ifdef ASM_COMMENT_START
1296 NULL);
1299 #endif
1301 asm_constraint,
1302 NULL_TREE,
1303 tree_cons
1311 }
1318 {
1322 {
1345 }
1346 }
1352 {
1370 }
1380 {
1381 Node_Id gnat_expr;
1382 /* Preserve the location of the pragma. */
1386 diagnostic_t kind;
1391 /* This is the String form: pragma Warning{s|_As_Error}(String). */
1393 {
1395 {
1408 }
1411 }
1413 /* This is the On/Off form: pragma Warnings (On | Off [,String]). */
1415 {
1417 {
1428 }
1430 /* Deal with optional pattern (but ignore Reason => "..."). */
1432 {
1433 /* pragma Warnings (On | Off, Name) is handled differently. */
1438 }
1439 else
1443 }
1445 else
1448 /* This is the same implementation as in the C family of compilers. */
1450 {
1458 option_index++)
1462 {
1465 }
1466 }
1467 else
1474 }
1479 }
1482 }
1483 \f
1485 /* Check the inlining status of nested function FNDECL in the current context.
1487 If a non-inline nested function is referenced from an inline external
1488 function, we cannot honor both requests at the same time without cloning
1489 the nested function in the current unit since it is private to its unit.
1490 We could inline it as well but it's probably better to err on the side
1491 of too little inlining.
1493 This must be invoked only on nested functions present in the source code
1494 and not on nested functions generated by the compiler, e.g. finalizers,
1495 because they are not marked inline and we don't want them to block the
1496 inlining of the parent function. */
1498 static void
1500 {
1502 && current_function_decl
1505 {
1511 {
1514 }
1515 else
1516 {
1518 fndecl);
1520 }
1524 }
1525 }
1526 \f
1527 /* Return an expression for the length of TYPE, an integral type, computed in
1528 RESULT_TYPE, another integral type.
1530 We used to compute the length as MAX (hb - lb + 1, 0) which could overflow
1531 when lb == TYPE'First. We now compute it as (hb >= lb) ? hb - lb + 1 : 0
1532 which would only overflow in much rarer cases, for extremely large arrays
1533 we expect never to encounter in practice. Besides, the former computation
1534 required the use of potentially constraining signed arithmetics while the
1535 latter does not. Note that the comparison must be done in the original
1536 base index type in order to avoid any overflow during the conversion. */
1538 static tree
1540 {
1545 tree length
1551 length
1557 }
1559 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1560 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1561 where we should place the result type. ATTRIBUTE is the attribute ID. */
1563 static tree
1565 {
1571 /* ??? If this is an access attribute for a public subprogram to be used in
1572 a dispatch table, do not translate its type as it's useless there and the
1573 parameter types might be incomplete types coming from a limited with. */
1581 else
1585 /* If the input is a NULL_EXPR, make a new one. */
1587 {
1591 }
1594 {
1597 /* These are just conversions since representation clauses for
1598 enumeration types are handled in the front-end. */
1599 {
1605 }
1610 /* These just add or subtract the constant 1 since representation
1611 clauses for enumeration types are handled in the front-end. */
1616 {
1618 gnu_expr
1619 = emit_check
1621 gnu_expr,
1622 attribute == Attr_Pred
1626 }
1628 gnu_result
1636 /* Conversions don't change addresses but can cause us to miss the
1637 COMPONENT_REF case below, so strip them off. */
1641 /* If we are taking 'Address of an unconstrained object, this is the
1642 pointer to the underlying array. */
1646 /* If we are building a static dispatch table, we have to honor
1647 TARGET_VTABLE_USES_DESCRIPTORS if we want to be compatible
1648 with the C++ ABI. We do it in the non-static case as well,
1649 see gnat_to_gnu_entity, case E_Access_Subprogram_Type. */
1652 {
1654 /* Descriptors can only be built here for top-level functions. */
1662 /* If we're not going to build the descriptor, we have to retrieve
1663 the one which will be built by the linker (or by the compiler
1664 later if a static chain is requested). */
1666 {
1669 gnu_result);
1671 }
1678 {
1680 {
1684 }
1685 else
1691 elt--;
1692 }
1696 }
1698 /* ... fall through ... */
1704 gnu_result
1711 /* For 'Code_Address, find an inner ADDR_EXPR and mark it so that we
1712 don't try to build a trampoline. */
1714 {
1719 }
1721 /* For 'Access, issue an error message if the prefix is a C++ method
1722 since it can use a special calling convention on some platforms,
1723 which cannot be propagated to the access type. */
1728 gnat_node);
1730 /* For other address attributes applied to a nested function,
1731 find an inner ADDR_EXPR and annotate it so that we can issue
1732 a useful warning with -Wtrampolines. */
1734 {
1739 {
1742 /* Also check the inlining status. */
1745 /* Check that we're not violating the No_Implicit_Dynamic_Code
1746 restriction. Be conservative if we don't know anything
1747 about the trampoline strategy for the target. */
1749 }
1750 }
1754 {
1756 tree gnu_obj_type;
1760 /* If this is fat pointer, the object must have been allocated with the
1761 template in front of the array. So compute the template address; do
1762 it by converting to a thin pointer. */
1764 gnu_ptr
1766 (TYPE_OBJECT_RECORD_TYPE
1768 gnu_ptr);
1772 /* If this is a thin pointer, the object must have been allocated with
1773 the template in front of the array. So compute the template address
1774 and return it. */
1776 gnu_ptr
1778 gnu_ptr,
1780 byte_position
1781 (DECL_CHAIN
1785 }
1794 /* Remove NOPs and conversions between original and packable version
1795 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1796 to see if a COMPONENT_REF was involved. */
1801 == RECORD_TYPE
1810 /* Replace an unconstrained array type with the type of the underlying
1811 array. We can't do this with a call to maybe_unconstrained_array
1812 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1813 use the record type that will be used to allocate the object and its
1814 template. */
1816 {
1820 }
1822 /* If we're looking for the size of a field, return the field size. */
1826 /* Otherwise, if the prefix is an object, or if we are looking for
1827 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1828 GCC size of the type. We make an exception for padded objects,
1829 as we do not take into account alignment promotions for the size.
1830 This is in keeping with the object case of gnat_to_gnu_entity. */
1836 {
1837 /* If this is a dereference and we have a special dynamic constrained
1838 subtype on the prefix, use it to compute the size; otherwise, use
1839 the designated subtype. */
1841 {
1842 Node_Id gnat_actual_subtype
1844 tree gnu_ptr_type
1849 {
1850 tree gnu_actual_obj_type
1852 gnu_type
1854 gnu_actual_obj_type,
1857 }
1858 }
1861 }
1863 /* Otherwise, the result is the RM size of the type. */
1864 else
1867 /* Deal with a self-referential size by returning the maximum size for
1868 a type and by qualifying the size with the object otherwise. */
1870 {
1873 else
1875 }
1877 /* If the type contains a template, subtract its size. */
1883 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1891 {
1904 else
1905 {
1910 /* If the default alignment of "double" or larger scalar types is
1911 specifically capped and there is an alignment clause neither
1912 on the type nor on the prefix itself, return the cap. */
1914 is_capped_double
1917 is_capped_double
1919 else
1929 else
1931 }
1934 }
1943 {
1950 else
1953 }
1955 /* ... fall through ... */
1958 {
1966 /* Make sure any implicit dereference gets done. */
1970 /* We treat unconstrained array In parameters specially. We also note
1971 whether we are dereferencing a pointer to unconstrained array. */
1974 {
1976 /* This is the direct case. */
1982 /* This is the indirect case. Note that we need to be sure that
1983 the access value cannot be null as we'll hoist the load. */
1986 {
1989 }
1990 else
1996 }
1998 /* If the prefix is the view conversion of a constrained array to an
1999 unconstrained form, we retrieve the constrained array because we
2000 might not be able to substitute the PLACEHOLDER_EXPR coming from
2001 the conversion. This can occur with the 'Old attribute applied
2002 to a parameter with an unconstrained type, which gets rewritten
2003 into a constrained local variable very late in the game. */
2006 && !CONTAINS_PLACEHOLDER_P
2009 else
2016 {
2018 tree gnu_type_temp;
2024 ;
2027 }
2034 /* When not optimizing, look up the slot associated with the parameter
2035 and the dimension in the cache and create a new one on failure.
2036 Don't do this when the actual subtype needs debug info (this happens
2037 with -gnatD): in elaborate_expression_1, we create variables that
2038 hold the bounds, so caching attributes isn't very interesting and
2039 causes dependency issues between these variables and cached
2040 expressions. */
2045 {
2051 {
2056 }
2057 }
2059 /* Return the cached expression or build a new one. */
2061 {
2063 {
2066 }
2068 gnu_result
2070 }
2073 {
2075 {
2078 }
2080 gnu_result
2082 }
2085 {
2087 {
2090 }
2092 gnu_result
2094 gnu_result_type);
2095 }
2097 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2098 handling. Note that these attributes could not have been used on
2099 an unconstrained array type. */
2102 /* Cache the expression we have just computed. Since we want to do it
2103 at run time, we force the use of a SAVE_EXPR and let the gimplifier
2104 create the temporary in the outermost binding level. We will make
2105 sure in Subprogram_Body_to_gnu that it is evaluated on all possible
2106 paths by forcing its evaluation on entry of the function. */
2108 {
2109 gnu_result
2112 {
2128 }
2129 }
2131 /* Otherwise, evaluate it each time it is referenced. */
2132 else
2134 {
2137 /* If we are dereferencing a pointer to unconstrained array, we
2138 need to capture the value because the pointed-to bounds may
2139 subsequently be released. */
2141 gnu_result
2147 /* Set the source location onto the predicate of the condition
2148 but not if the expression is cached to avoid messing up the
2149 debug info. */
2153 gnat_node);
2158 }
2161 }
2168 {
2169 HOST_WIDE_INT bitsize;
2170 HOST_WIDE_INT bitpos;
2171 tree gnu_offset;
2172 tree gnu_field_bitpos;
2173 tree gnu_field_offset;
2174 tree gnu_inner;
2175 machine_mode mode;
2182 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
2183 the result is 0. Don't allow 'Bit on a bare component, though. */
2187 {
2190 }
2192 else
2201 {
2209 {
2210 gnu_field_bitpos
2213 gnu_field_offset
2216 }
2217 }
2219 {
2222 }
2223 else
2224 {
2227 }
2230 {
2244 /* ??? Avoid a large unsigned result that will overflow when
2245 converted to the signed universal_integer. */
2248 else
2249 gnu_result
2256 }
2258 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2259 handling. */
2262 }
2266 {
2274 }
2300 /* Note this size cannot be self-referential. */
2310 /* What we want is the offset of the ARRAY field in the record
2311 that the thin pointer designates. */
2319 /* This is just a zero cast to the pointer type for our prefix and
2320 dereferenced. */
2322 gnu_result
2325 integer_zero_node));
2330 {
2337 {
2342 ;
2343 }
2351 && (DECL_BY_COMPONENT_PTR_P
2355 }
2359 /* We treat Model as identical to Machine. This is true for at least
2360 IEEE and some other nice floating-point systems. */
2362 /* ... fall through ... */
2365 /* The trick is to force the compiler to store the result in memory so
2366 that we do not have extra precision used. But do this only when this
2367 is necessary, i.e. if FP_ARITH_MAY_WIDEN is true and the precision of
2368 the type is lower than that of the longest floating-point type. */
2377 {
2379 tree field
2389 asm_expr
2401 gnu_result
2405 }
2409 /* This abort means that we have an unimplemented attribute. */
2411 }
2413 /* If this is an attribute where the prefix was unused, force a use of it if
2414 it has a side-effect. But don't do it if the prefix is just an entity
2415 name. However, if an access check is needed, we must do it. See second
2416 example in AARM 11.6(5.e). */
2420 gnu_result
2425 }
2426 \f
2427 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
2428 to a GCC tree, which is returned. */
2430 static tree
2432 {
2434 Node_Id gnat_when;
2435 location_t end_locus;
2441 /* The range of values in a case statement is determined by the rules in
2442 RM 5.4(7-9). In almost all cases, this range is represented by the Etype
2443 of the expression. One exception arises in the case of a simple name that
2444 is parenthesized. This still has the Etype of the name, but since it is
2445 not a name, para 7 does not apply, and we need to go to the base type.
2446 This is the only case where parenthesization affects the dynamic
2447 semantics (i.e. the range of possible values at run time that is covered
2448 by the others alternative).
2450 Another exception is if the subtype of the expression is non-static. In
2451 that case, we also have to use the base type. */
2457 /* We build a SWITCH_EXPR that contains the code with interspersed
2458 CASE_LABEL_EXPRs for each label. */
2467 {
2469 Node_Id gnat_choice;
2471 /* First compile all the different case choices for the current WHEN
2472 alternative. */
2476 {
2481 {
2496 /* This represents either a subtype range or a static value of
2497 some kind; Ekind says which. */
2499 {
2505 }
2507 /* ... fall through ... */
2519 }
2521 /* Everything should be folded into constants at this point. */
2526 gnat_choice);
2528 }
2530 /* This construct doesn't define a scope so we shouldn't push a binding
2531 level around the statement list. Except that we have always done so
2532 historically and this makes it possible to reduce stack usage. As a
2533 compromise, we keep doing it for case statements, for which this has
2534 never been problematic, but not for case expressions in Ada 2012. */
2536 {
2537 const bool is_case_expression
2539 tree group
2544 {
2549 }
2550 }
2551 }
2553 /* Now emit a definition of the label the cases branch to, if any. */
2560 }
2561 \f
2562 /* Find out whether VAR is an iteration variable of an enclosing loop in the
2563 current function. If so, push a range_check_info structure onto the stack
2564 of this enclosing loop and return it. Otherwise, return NULL. */
2568 {
2585 i--)
2590 {
2594 }
2597 }
2599 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2600 false, or the maximum value if MAX is true, of TYPE. */
2602 static bool
2604 {
2611 val = (max
2620 else
2622 }
2624 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2625 If REVERSE is true, minimum value is taken as maximum value. */
2629 {
2631 }
2633 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2634 If REVERSE is true, maximum value is taken as minimum value. */
2638 {
2640 }
2642 /* Return true if VAL1 can be lower than VAL2. */
2644 static bool
2646 {
2660 }
2662 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2663 to a GCC tree, which is returned. */
2665 static tree
2667 {
2674 tree gnu_result;
2676 /* Push the loop_info structure associated with the LOOP_STMT. */
2679 /* Set location information for statement and end label. */
2685 /* Save the statement for later reuse. */
2688 /* Set the condition under which the loop must keep going.
2689 For the case "LOOP .... END LOOP;" the condition is always true. */
2691 ;
2693 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2698 /* Otherwise we have an iteration scheme and the condition is given by the
2699 bounds of the subtype of the iteration variable. */
2700 else
2701 {
2715 /* We must disable modulo reduction for the iteration variable, if any,
2716 in order for the loop comparison to be effective. */
2718 {
2724 }
2725 else
2726 {
2732 }
2734 /* We use two different strategies to translate the loop, depending on
2735 whether optimization is enabled.
2737 If it is, we generate the canonical loop form expected by the loop
2738 optimizer and the loop vectorizer, which is the do-while form:
2740 ENTRY_COND
2741 loop:
2742 TOP_UPDATE
2743 BODY
2744 BOTTOM_COND
2745 GOTO loop
2747 This avoids an implicit dependency on loop header copying and makes
2748 it possible to turn BOTTOM_COND into an inequality test.
2750 If optimization is disabled, loop header copying doesn't come into
2751 play and we try to generate the loop form with the fewer conditional
2752 branches. First, the default form, which is:
2754 loop:
2755 TOP_COND
2756 BODY
2757 BOTTOM_UPDATE
2758 GOTO loop
2760 It should catch most loops with constant ending point. Then, if we
2761 cannot, we try to generate the shifted form:
2763 loop:
2764 TOP_COND
2765 TOP_UPDATE
2766 BODY
2767 GOTO loop
2769 which should catch loops with constant starting point. Otherwise, if
2770 we cannot, we generate the fallback form:
2772 ENTRY_COND
2773 loop:
2774 BODY
2775 BOTTOM_COND
2776 BOTTOM_UPDATE
2777 GOTO loop
2779 which works in all cases. */
2782 {
2783 /* We can use the do-while form directly if GNU_FIRST-1 doesn't
2784 overflow. */
2786 ;
2788 /* Otherwise, use the do-while form with the help of a special
2789 induction variable in the unsigned version of the base type
2790 or the unsigned version of the size type, whichever is the
2791 largest, in order to have wrap-around arithmetics for it. */
2792 else
2793 {
2796 gnu_base_type
2798 else
2805 }
2807 gnu_first
2809 gnu_one_node);
2812 }
2813 else
2814 {
2815 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
2817 ;
2819 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
2820 GNU_LAST-1 does. */
2823 {
2824 gnu_first
2826 gnu_one_node);
2827 gnu_last
2829 gnu_one_node);
2831 }
2833 /* Otherwise, use the fallback form. */
2834 else
2836 }
2838 /* If we use the BOTTOM_COND, we can turn the test into an inequality
2839 test but we may have to add ENTRY_COND to protect the empty loop. */
2841 {
2844 {
2845 gnu_cond_expr
2851 }
2852 }
2854 /* Open a new nesting level that will surround the loop to declare the
2855 iteration variable. */
2859 /* If we use the special induction variable, create it and set it to
2860 its initial value. Morever, the regular iteration variable cannot
2861 itself be initialized, lest the initial value wrapped around. */
2863 {
2864 gnu_loop_iv
2868 }
2869 else
2872 /* Declare the iteration variable and set it to its initial value. */
2877 {
2880 }
2883 /* Do all the arithmetics in the base type. */
2886 /* Set either the top or bottom exit condition. */
2890 gnu_last);
2891 else
2894 gnu_last);
2896 /* Set either the top or bottom update statement and give it the source
2897 location of the iteration for better coverage info. */
2899 {
2900 gnu_stmt
2907 gnu_stmt
2909 gnu_loop_iv);
2913 }
2914 else
2915 {
2916 gnu_stmt
2922 }
2923 }
2925 /* If the loop was named, have the name point to this loop. In this case,
2926 the association is not a DECL node, but the end label of the loop. */
2930 /* Make the loop body into its own block, so any allocated storage will be
2931 released every iteration. This is needed for stack allocation. */
2936 /* If we have an iteration scheme, then we are in a statement group. Add
2937 the LOOP_STMT to it, finish it and make it the "loop". */
2939 {
2944 /* First, if we have computed a small number of invariant conditions for
2945 range checks applied to the iteration variable, then initialize these
2946 conditions in front of the loop. Otherwise, leave them set to true.
2948 ??? The heuristics need to be improved, by taking into account the
2949 following datapoints:
2950 - loop unswitching is disabled for big loops. The cap is the
2951 parameter PARAM_MAX_UNSWITCH_INSNS (50).
2952 - loop unswitching can only be applied a small number of times
2953 to a given loop. The cap is PARAM_MAX_UNSWITCH_LEVEL (3).
2954 - the front-end quickly generates useless or redundant checks
2955 that can be entirely optimized away in the end. */
2959 i++)
2960 {
2961 tree low_ok
2968 tree high_ok
2975 tree range_ok
2983 }
2988 }
2990 /* If we have an outer COND_EXPR, that's our result and this loop is its
2991 "true" statement. Otherwise, the result is the LOOP_STMT. */
2993 {
2997 }
2998 else
3004 }
3005 \f
3006 /* This page implements a form of Named Return Value optimization modelled
3007 on the C++ optimization of the same name. The main difference is that
3008 we disregard any semantical considerations when applying it here, the
3009 counterpart being that we don't try to apply it to semantically loaded
3010 return types, i.e. types with the TYPE_BY_REFERENCE_P flag set.
3012 We consider a function body of the following GENERIC form:
3014 return_type R1;
3015 [...]
3016 RETURN_EXPR [<retval> = ...]
3017 [...]
3018 RETURN_EXPR [<retval> = R1]
3019 [...]
3020 return_type Ri;
3021 [...]
3022 RETURN_EXPR [<retval> = ...]
3023 [...]
3024 RETURN_EXPR [<retval> = Ri]
3025 [...]
3027 and we try to fulfill a simple criterion that would make it possible to
3028 replace one or several Ri variables with the RESULT_DECL of the function.
3030 The first observation is that RETURN_EXPRs that don't directly reference
3031 any of the Ri variables on the RHS of their assignment are transparent wrt
3032 the optimization. This is because the Ri variables aren't addressable so
3033 any transformation applied to them doesn't affect the RHS; moreover, the
3034 assignment writes the full <retval> object so existing values are entirely
3035 discarded.
3037 This property can be extended to some forms of RETURN_EXPRs that reference
3038 the Ri variables, for example CONSTRUCTORs, but isn't true in the general
3039 case, in particular when function calls are involved.
3041 Therefore the algorithm is as follows:
3043 1. Collect the list of candidates for a Named Return Value (Ri variables
3044 on the RHS of assignments of RETURN_EXPRs) as well as the list of the
3045 other expressions on the RHS of such assignments.
3047 2. Prune the members of the first list (candidates) that are referenced
3048 by a member of the second list (expressions).
3050 3. Extract a set of candidates with non-overlapping live ranges from the
3051 first list. These are the Named Return Values.
3053 4. Adjust the relevant RETURN_EXPRs and replace the occurrences of the
3054 Named Return Values in the function with the RESULT_DECL.
3056 If the function returns an unconstrained type, things are a bit different
3057 because the anonymous return object is allocated on the secondary stack
3058 and RESULT_DECL is only a pointer to it. Each return object can be of a
3059 different size and is allocated separately so we need not care about the
3060 aforementioned overlapping issues. Therefore, we don't collect the other
3061 expressions and skip step #2 in the algorithm. */
3063 struct nrv_data
3064 {
3065 bitmap nrv;
3066 tree result;
3067 Node_Id gnat_ret;
3069 };
3071 /* Return true if T is a Named Return Value. */
3075 {
3077 }
3079 /* Helper function for walk_tree, used by finalize_nrv below. */
3081 static tree
3083 {
3087 /* No need to walk into types or decls. */
3095 }
3097 /* Prune Named Return Values in BLOCK and return true if there is still a
3098 Named Return Value in BLOCK or one of its sub-blocks. */
3100 static bool
3102 {
3104 tree t;
3106 /* First recurse on the sub-blocks. */
3110 /* Then make sure to keep at most one NRV per block. */
3113 {
3116 else
3118 }
3121 }
3123 /* Helper function for walk_tree, used by finalize_nrv below. */
3125 static tree
3127 {
3131 /* No need to walk into types. */
3135 /* Change RETURN_EXPRs of NRVs to just refer to the RESULT_DECL; this is a
3136 nop, but differs from using NULL_TREE in that it indicates that we care
3137 about the value of the RESULT_DECL. */
3140 {
3143 /* If this is the temporary created for a return value with variable
3144 size in Call_to_gnu, we replace the RHS with the init expression. */
3149 {
3152 }
3153 else
3156 /* Strip useless conversions around the return value. */
3161 {
3164 else
3166 }
3167 }
3169 /* Replace the DECL_EXPR of NRVs with an initialization of the RESULT_DECL,
3170 if needed. */
3173 {
3177 {
3182 }
3183 else
3187 /* Identify the NRV to the RESULT_DECL for debugging purposes. */
3190 /* ??? Kludge to avoid an assertion failure during inlining. */
3193 }
3195 /* And replace all uses of NRVs with the RESULT_DECL. */
3199 /* Avoid walking into the same tree more than once. Unfortunately, we
3200 can't just use walk_tree_without_duplicates because it would only
3201 call us for the first occurrence of NRVs in the function body. */
3206 }
3208 /* Likewise, but used when the function returns an unconstrained type. */
3210 static tree
3212 {
3216 /* No need to walk into types. */
3220 /* We need to see the DECL_EXPR of NRVs before any other references so we
3221 walk the body of BIND_EXPR before walking its variables. */
3225 /* Change RETURN_EXPRs of NRVs to assign to the RESULT_DECL only the final
3226 return value built by the allocator instead of the whole construct. */
3229 {
3232 /* This is the construct returned by the allocator. */
3235 {
3237 ret_val
3240 else
3242 }
3244 /* Strip useless conversions around the return value. */
3249 /* Strip unpadding around the return value. */
3254 /* Assign the new return value to the RESULT_DECL. */
3258 }
3260 /* Adjust the DECL_EXPR of NRVs to call the allocator and save the result
3261 into a new variable. */
3264 {
3271 /* Create an artificial context to build the allocation. */
3276 /* This will return a COMPOUND_EXPR with the allocation in the first
3277 arm and the final return value in the second arm. */
3284 /* The new variable is built as a reference to the allocated space. */
3285 new_var
3291 {
3292 /* The new initial value is a COMPOUND_EXPR with the allocation in
3293 the first arm and the value of P_ARRAY in the second arm. */
3299 /* Build a modified CONSTRUCTOR that references NEW_VAR. */
3307 }
3308 else
3309 {
3310 /* The new initial value is just the allocation. */
3313 }
3317 /* Destroy the artificial context and insert the new statements. */
3322 /* Chain NEW_VAR immediately after VAR and ignore the latter. */
3327 /* Save the new return value and the dereference of NEW_VAR. */
3331 /* ??? Kludge to avoid messing up during inlining. */
3333 }
3335 /* And replace all uses of NRVs with the dereference of NEW_VAR. */
3339 /* Avoid walking into the same tree more than once. Unfortunately, we
3340 can't just use walk_tree_without_duplicates because it would only
3341 call us for the first occurrence of NRVs in the function body. */
3346 }
3348 /* Finalize the Named Return Value optimization for FNDECL. The NRV bitmap
3349 contains the candidates for Named Return Value and OTHER is a list of
3350 the other return values. GNAT_RET is a representative return node. */
3352 static void
3354 {
3357 walk_tree_fn func;
3359 tree iter;
3361 /* We shouldn't be applying the optimization to return types that we aren't
3362 allowed to manipulate freely. */
3365 /* Prune the candidates that are referenced by other return values. */
3374 /* Prune also the candidates that are referenced by nested functions. */
3382 /* Extract a set of NRVs with non-overlapping live ranges. */
3386 /* Adjust the relevant RETURN_EXPRs and replace the occurrences of NRVs. */
3393 else
3397 }
3399 /* Return true if RET_VAL can be used as a Named Return Value for the
3400 anonymous return object RET_OBJ. */
3402 static bool
3404 {
3424 }
3426 /* Build a RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR around
3427 the assignment of RET_VAL to RET_OBJ. Otherwise build a bare RETURN_EXPR
3428 around RESULT_OBJ, which may be null in this case. */
3430 static tree
3432 {
3433 tree result_expr;
3436 {
3437 /* The gimplifier explicitly enforces the following invariant:
3439 RETURN_EXPR
3440 |
3441 MODIFY_EXPR
3442 / \
3443 / \
3444 RET_OBJ ...
3446 As a consequence, type consistency dictates that we use the type
3447 of the RET_OBJ as the operation type. */
3450 /* Convert the right operand to the operation type. Note that it's the
3451 same transformation as in the MODIFY_EXPR case of build_binary_op,
3452 with the assumption that the type cannot involve a placeholder. */
3458 /* If the function returns an aggregate type, find out whether this is
3459 a candidate for Named Return Value. If so, record it. Otherwise,
3460 if this is an expression of some kind, record it elsewhere. */
3466 {
3467 /* Recognize the temporary created for a return value with variable
3468 size in Call_to_gnu. We want to eliminate it if possible. */
3475 /* Strip useless conversions around the return value. */
3479 /* Now apply the test to the return value. */
3481 {
3485 }
3487 /* Note that we need not care about CONSTRUCTORs here, as they are
3488 totally transparent given the read-compose-write semantics of
3489 assignments from CONSTRUCTORs. */
3492 }
3493 }
3494 else
3498 }
3499 \f
3500 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
3501 don't return anything. */
3503 static void
3505 {
3506 /* Defining identifier of a parameter to the subprogram. */
3507 Entity_Id gnat_param;
3508 /* The defining identifier for the subprogram body. Note that if a
3509 specification has appeared before for this body, then the identifier
3510 occurring in that specification will also be a defining identifier and all
3511 the calls to this subprogram will point to that specification. */
3512 Entity_Id gnat_subprog_id
3515 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
3516 tree gnu_subprog_decl;
3517 /* Its RESULT_DECL node. */
3518 tree gnu_result_decl;
3519 /* Its FUNCTION_TYPE node. */
3520 tree gnu_subprog_type;
3521 /* The TYPE_CI_CO_LIST of its FUNCTION_TYPE node, if any. */
3522 tree gnu_cico_list;
3523 /* The entry in the CI_CO_LIST that represents a function return, if any. */
3525 tree gnu_result;
3526 location_t locus;
3530 /* If this is a generic object or if it has been eliminated,
3531 ignore it. */
3537 /* If this subprogram acts as its own spec, define it. Otherwise, just get
3538 the already-elaborated tree node. However, if this subprogram had its
3539 elaboration deferred, we will already have made a tree node for it. So
3540 treat it as not being defined in that case. Such a subprogram cannot
3541 have an address clause or a freeze node, so this test is safe, though it
3542 does disable some otherwise-useful error checking. */
3543 gnu_subprog_decl
3553 /* If the function returns by invisible reference, make it explicit in the
3554 function body. See gnat_to_gnu_entity, E_Subprogram_Type case.
3555 Handle the explicit case here and the copy-in/copy-out case below. */
3557 {
3561 }
3563 /* Set the line number in the decl to correspond to that of the body. */
3567 /* Initialize the information structure for the function. */
3576 /* If there are In Out or Out parameters, we need to ensure that the return
3577 statement properly copies them out. We do this by making a new block and
3578 converting any return into a goto to a label at the end of the block. */
3580 {
3589 /* If this is a function with In Out or Out parameters, we also need a
3590 variable for the return value to be placed. */
3592 {
3593 tree gnu_return_type
3596 /* If the function returns by invisible reference, make it
3597 explicit in the function body. See gnat_to_gnu_entity,
3598 E_Subprogram_Type case. */
3602 gnu_return_var
3607 }
3611 /* See whether there are parameters for which we don't have a GCC tree
3612 yet. These must be Out parameters. Make a VAR_DECL for them and
3613 put it into TYPE_CI_CO_LIST, which must contain an empty entry too.
3614 We can match up the entries because TYPE_CI_CO_LIST is in the order
3615 of the parameters. */
3620 {
3622 tree gnu_decl;
3624 /* Skip any entries that have been already filled in; they must
3625 correspond to In Out parameters. */
3629 /* Do any needed dereferences for by-ref objects. */
3635 /* Do any needed references for padded types. */
3638 }
3639 }
3640 else
3643 /* Get a tree corresponding to the code for the subprogram. */
3649 /* Generate the code of the subprogram itself. A return statement will be
3650 present and any Out parameters will be handled there. */
3655 /* If we populated the parameter attributes cache, we need to make sure that
3656 the cached expressions are evaluated on all the possible paths leading to
3657 their uses. So we force their evaluation on entry of the function. */
3660 {
3667 {
3674 }
3680 }
3682 /* If we are dealing with a return from an Ada procedure with parameters
3683 passed by copy-in/copy-out, we need to return a record containing the
3684 final values of these parameters. If the list contains only one entry,
3685 return just that entry though.
3687 For a full description of the copy-in/copy-out parameter mechanism, see
3688 the part of the gnat_to_gnu_entity routine dealing with the translation
3689 of subprograms.
3691 We need to make a block that contains the definition of that label and
3692 the copying of the return value. It first contains the function, then
3693 the label and copy statement. */
3695 {
3696 tree gnu_retval;
3706 else
3708 gnu_cico_list);
3714 }
3718 /* Attempt setting the end_locus of our GCC body tree, typically a
3719 BIND_EXPR or STATEMENT_LIST, then the end_locus of our GCC subprogram
3720 declaration tree. */
3724 /* On SEH targets, install an exception handler around the main entry
3725 point to catch unhandled exceptions. */
3728 {
3729 tree t;
3730 tree etype;
3742 }
3746 /* Finally annotate the parameters and disconnect the trees for parameters
3747 that we have turned into variables since they are now unusable. */
3751 {
3760 }
3762 /* Disconnect the variable created for the return value. */
3766 /* If the function returns an aggregate type and we have candidates for
3767 a Named Return Value, finalize the optimization. */
3769 {
3776 }
3778 /* If this is an inlined external function that has been marked uninlinable,
3779 drop the body and stop there. Otherwise compile the body. */
3782 else
3784 }
3785 \f
3786 /* Return true if GNAT_NODE requires atomic synchronization. */
3788 static bool
3790 {
3792 Node_Kind kind;
3795 /* First, scan the node to find the Atomic_Sync_Required flag. */
3798 {
3801 }
3804 {
3816 }
3818 /* Then, scan the parent to find out cases where the flag is irrelevant. */
3821 {
3824 /* Do not mess up machine code insertions. */
3830 /* Do not generate a function call as a renamed object. */
3835 }
3838 }
3839 \f
3840 /* Create a temporary variable with PREFIX and TYPE, and return it. */
3842 static tree
3844 {
3852 }
3854 /* Create a temporary variable with PREFIX and initialize it with GNU_INIT.
3855 Put the initialization statement into GNU_INIT_STMT and annotate it with
3856 the SLOC of GNAT_NODE. Return the temporary variable. */
3858 static tree
3860 Node_Id gnat_node)
3861 {
3868 }
3870 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
3871 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
3872 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
3873 If GNU_TARGET is non-null, this must be a function call on the RHS of a
3874 N_Assignment_Statement and the result is to be placed into that object.
3875 If, in addition, ATOMIC_SYNC is true, then the assignment to GNU_TARGET
3876 requires atomic synchronization. */
3878 static tree
3881 {
3884 /* The GCC node corresponding to the GNAT subprogram name. This can either
3885 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
3886 or an indirect reference expression (an INDIRECT_REF node) pointing to a
3887 subprogram. */
3889 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
3891 /* The return type of the FUNCTION_TYPE. */
3902 Entity_Id gnat_formal;
3903 Node_Id gnat_actual;
3907 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
3908 all our args first. */
3910 {
3920 {
3923 }
3926 }
3928 /* For a call to a nested function, check the inlining status. */
3933 /* The only way we can be making a call via an access type is if Name is an
3934 explicit dereference. In that case, get the list of formal args from the
3935 type the access type is pointing to. Otherwise, get the formals from the
3936 entity being called. */
3940 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
3942 else
3945 /* The lifetime of the temporaries created for the call ends right after the
3946 return value is copied, so we can give them the scope of the elaboration
3947 routine at top level. */
3949 {
3952 }
3954 /* First, create the temporary for the return value when:
3956 1. There is no target and the function has copy-in/copy-out parameters,
3957 because we need to preserve the return value before copying back the
3958 parameters.
3960 2. There is no target and this is not an object declaration, and the
3961 return type has variable size, because in these cases the gimplifier
3962 cannot create the temporary.
3964 3. There is a target and it is a slice or an array with fixed size,
3965 and the return type has variable size, because the gimplifier
3966 doesn't handle these cases.
3968 This must be done before we push a binding level around the call, since
3969 we will pop it before copying the return value. */
3972 || (!gnu_target
3975 || (gnu_target
3983 /* Create the list of the actual parameters as GCC expects it, namely a
3984 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
3985 is an expression and the TREE_PURPOSE field is null. But skip Out
3986 parameters not passed by reference and that need not be copied in. */
3991 {
3995 const bool is_true_formal_parm
3997 const bool is_by_ref_formal_parm
3998 = is_true_formal_parm
4001 /* In the Out or In Out case, we must suppress conversions that yield
4002 an lvalue but can nevertheless cause the creation of a temporary,
4003 because we need the real object in this case, either to pass its
4004 address if it's passed by reference or as target of the back copy
4005 done after the call if it uses the copy-in/copy-out mechanism.
4006 We do it in the In case too, except for an unchecked conversion
4007 because it alone can cause the actual to be misaligned and the
4008 addressability test is applied to the real object. */
4009 const bool suppress_type_conversion
4014 Node_Id gnat_name = suppress_type_conversion
4017 tree gnu_actual;
4019 /* If it's possible we may need to use this expression twice, make sure
4020 that any side-effects are handled via SAVE_EXPRs; likewise if we need
4021 to force side-effects before the call.
4022 ??? This is more conservative than we need since we don't need to do
4023 this for pass-by-ref with no conversion. */
4027 /* If we are passing a non-addressable parameter by reference, pass the
4028 address of a copy. In the Out or In Out case, set up to copy back
4029 out after the call. */
4033 {
4037 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
4038 but sort of an instantiation for them. */
4040 ;
4042 /* If the type is passed by reference, a copy is not allowed. */
4045 gnat_actual);
4047 /* For users of Starlet we issue a warning because the interface
4048 apparently assumes that by-ref parameters outlive the procedure
4049 invocation. The code still will not work as intended, but we
4050 cannot do much better since low-level parts of the back-end
4051 would allocate temporaries at will because of the misalignment
4052 if we did not do so here. */
4054 {
4055 post_error
4057 post_error_ne
4061 gnat_formal);
4062 }
4064 /* If the actual type of the object is already the nominal type,
4065 we have nothing to do, except if the size is self-referential
4066 in which case we'll remove the unpadding below. */
4069 ;
4071 /* Otherwise remove the unpadding from all the objects. */
4073 && TYPE_IS_PADDING_P
4077 /* Otherwise convert to the nominal type of the object if needed.
4078 There are several cases in which we need to make the temporary
4079 using this type instead of the actual type of the object when
4080 they are distinct, because the expectations of the callee would
4081 otherwise not be met:
4082 - if it's a justified modular type,
4083 - if the actual type is a smaller form of it,
4084 - if it's a smaller form of the actual type. */
4088 gnu_name_type)))
4094 /* If this is an In Out or Out parameter and we're returning a value,
4095 we need to create a temporary for the return value because we must
4096 preserve it before copying back at the very end. */
4100 /* If we haven't pushed a binding level, push a new one. This will
4101 narrow the lifetime of the temporary we are about to make as much
4102 as possible. The drawback is that we'd need to create a temporary
4103 for the return value, if any (see comment before the loop). So do
4104 it only when this temporary was already created just above. */
4106 {
4110 }
4112 /* Create an explicit temporary holding the copy. */
4113 gnu_temp
4116 /* But initialize it on the fly like for an implicit temporary as
4117 we aren't necessarily having a statement list. */
4119 gnu_temp);
4121 /* Set up to move the copy back to the original if needed. */
4123 {
4124 /* If the original is a COND_EXPR whose first arm isn't meant to
4125 be further used, just deal with the second arm. This is very
4126 likely the conditional expression built for a check. */
4129 && integer_zerop
4133 gnu_stmt
4138 }
4139 }
4141 /* Start from the real object and build the actual. */
4144 /* If this is an atomic access of an In or In Out parameter for which
4145 synchronization is required, build the atomic load. */
4147 && !is_by_ref_formal_parm
4152 /* If this was a procedure call, we may not have removed any padding.
4153 So do it here for the part we will use as an input, if any. */
4156 gnu_actual
4159 /* Put back the conversion we suppressed above in the computation of the
4160 real object. And even if we didn't suppress any conversion there, we
4161 may have suppressed a conversion to the Etype of the actual earlier,
4162 since the parent is a procedure call, so put it back here. */
4165 gnu_actual
4168 else
4169 gnu_actual
4172 /* Make sure that the actual is in range of the formal's type. */
4175 gnu_actual
4178 /* Unless this is an In parameter, we must remove any justified modular
4179 building from GNU_NAME to get an lvalue. */
4184 gnu_name
4187 /* First see if the parameter is passed by reference. */
4189 {
4191 {
4192 /* In Out or Out parameters passed by reference don't use the
4193 copy-in/copy-out mechanism so the address of the real object
4194 must be passed to the function. */
4197 /* If we have a padded type, be sure we've removed padding. */
4200 gnu_actual);
4202 /* If we have the constructed subtype of an aliased object
4203 with an unconstrained nominal subtype, the type of the
4204 actual includes the template, although it is formally
4205 constrained. So we need to convert it back to the real
4206 constructed subtype to retrieve the constrained part
4207 and takes its address. */
4213 gnu_actual);
4214 }
4216 /* There is no need to convert the actual to the formal's type before
4217 taking its address. The only exception is for unconstrained array
4218 types because of the way we build fat pointers. */
4220 {
4221 /* Put back a view conversion for In Out or Out parameters. */
4224 gnu_actual);
4226 }
4228 /* The symmetry of the paths to the type of an entity is broken here
4229 since arguments don't know that they will be passed by ref. */
4232 }
4234 /* Then see if the parameter is an array passed to a foreign convention
4235 subprogram. */
4237 {
4243 {
4246 }
4248 /* Take the address of the object and convert to the proper pointer
4249 type. We'd like to actually compute the address of the beginning
4250 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
4251 possibility that the ARRAY_REF might return a constant and we'd be
4252 getting the wrong address. Neither approach is exactly correct,
4253 but this is the most likely to work in all cases. */
4255 }
4257 /* Otherwise the parameter is passed by copy. */
4258 else
4259 {
4260 tree gnu_size;
4265 /* If we didn't create a PARM_DECL for the formal, this means that
4266 it is an Out parameter not passed by reference and that need not
4267 be copied in. In this case, the value of the actual need not be
4268 read. However, we still need to make sure that its side-effects
4269 are evaluated before the call, so we evaluate its address. */
4271 {
4273 {
4276 }
4278 }
4282 /* If this is 'Null_Parameter, pass a zero even though we are
4283 dereferencing it. */
4289 gnu_actual
4293 integer_zero_node),
4295 else
4297 }
4300 }
4302 gnu_call
4306 /* If we have created a temporary for the return value, initialize it. */
4308 {
4309 tree gnu_stmt
4314 }
4316 /* If this is a subprogram with copy-in/copy-out parameters, we need to
4317 unpack the valued returned from the function into the In Out or Out
4318 parameters. We deal with the function return (if this is an Ada
4319 function) below. */
4321 {
4322 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
4323 copy-out parameters. */
4327 /* The call sequence must contain one and only one call, even though the
4328 function is pure. Save the result into a temporary if needed. */
4330 {
4332 {
4333 tree gnu_stmt;
4334 /* If we haven't pushed a binding level, push a new one. This
4335 will narrow the lifetime of the temporary we are about to
4336 make as much as possible. */
4338 {
4342 }
4343 gnu_call
4346 }
4349 }
4351 /* The first entry is for the actual return value if this is a
4352 function, so skip it. */
4358 else
4365 /* If we are dealing with a copy-in/copy-out parameter, we must
4366 retrieve its value from the record returned in the call. */
4372 {
4373 /* Get the value to assign to this Out or In Out parameter. It is
4374 either the result of the function if there is only a single such
4375 parameter or the appropriate field from the record returned. */
4376 tree gnu_result
4378 ? gnu_call
4382 /* If the actual is a conversion, get the inner expression, which
4383 will be the real destination, and convert the result to the
4384 type of the actual parameter. */
4385 tree gnu_actual
4388 /* If the result is a padded type, remove the padding. */
4390 gnu_result
4392 gnu_result);
4394 /* If the actual is a type conversion, the real target object is
4395 denoted by the inner Expression and we need to convert the
4396 result to the associated type.
4397 We also need to convert our gnu assignment target to this type
4398 if the corresponding GNU_NAME was constructed from the GNAT
4399 conversion node and not from the inner Expression. */
4401 {
4402 gnu_result
4403 = convert_with_check
4411 }
4413 /* Unchecked conversions as actuals for Out parameters are not
4414 allowed in user code because they are not variables, but do
4415 occur in front-end expansions. The associated GNU_NAME is
4416 always obtained from the inner expression in such cases. */
4419 gnu_result,
4421 else
4422 {
4424 gnu_result
4426 gnat_actual);
4431 }
4435 else
4442 }
4443 }
4445 /* If this is a function call, the result is the call expression unless a
4446 target is specified, in which case we copy the result into the target
4447 and return the assignment statement. */
4449 {
4450 /* If this is a function with copy-in/copy-out parameters, extract the
4451 return value from it and update the return type. */
4453 {
4458 }
4460 /* If the function returns an unconstrained array or by direct reference,
4461 we have to dereference the pointer. */
4467 {
4471 /* If range check is needed, emit code to generate it. */
4473 gnu_call
4475 gnat_parent);
4477 /* ??? If the return type has variable size, then force the return
4478 slot optimization as we would not be able to create a temporary.
4479 Likewise if it was unconstrained as we would copy too much data.
4480 That's what has been done historically. */
4483 && CONTAINS_PLACEHOLDER_P
4486 else
4491 else
4492 gnu_call
4496 }
4497 else
4499 }
4501 /* Otherwise, if this is a procedure call statement without copy-in/copy-out
4502 parameters, the result is just the call statement. */
4506 /* Finally, add the copy back statements, if any. */
4512 /* If we have pushed a binding level, pop it and finish up the enclosing
4513 statement group. */
4515 {
4519 }
4521 /* Otherwise, retrieve the statement list, if any. */
4525 /* Otherwise, just return the call expression. */
4526 else
4529 /* If we nevertheless need a value, make a COMPOUND_EXPR to return it.
4530 But first simplify if we have only one statement in the list. */
4532 {
4536 gnu_result
4538 }
4541 }
4542 \f
4543 /* Subroutine of gnat_to_gnu to translate gnat_node, an
4544 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
4546 static tree
4548 {
4551 /* If just annotating, ignore all EH and cleanups. */
4555 bool setjmp_longjmp
4561 tree gnu_result;
4562 tree gnu_expr;
4563 Node_Id gnat_temp;
4564 /* Node providing the sloc for the cleanup actions. */
4567 gnat_node);
4569 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
4570 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
4571 add_cleanup, and when we leave the binding, end_stmt_group will create
4572 the TRY_FINALLY_EXPR.
4574 ??? The region level calls down there have been specifically put in place
4575 for a ZCX context and currently the order in which things are emitted
4576 (region/handlers) is different from the SJLJ case. Instead of putting
4577 other calls with different conditions at other places for the SJLJ case,
4578 it seems cleaner to reorder things for the SJLJ case and generalize the
4579 condition to make it not ZCX specific.
4581 If there are any exceptions or cleanup processing involved, we need an
4582 outer statement group (for Setjmp_Longjmp) and binding level. */
4584 {
4587 }
4589 /* If using setjmp_longjmp, make the variables for the setjmp buffer and save
4590 area for address of previous buffer. Do this first since we need to have
4591 the setjmp buf known for any decls in this block. */
4593 {
4594 gnu_jmpsave_decl
4596 jmpbuf_ptr_type,
4601 /* The __builtin_setjmp receivers will immediately reinstall it. Now
4602 because of the unstructured form of EH used by setjmp_longjmp, there
4603 might be forward edges going to __builtin_setjmp receivers on which
4604 it is uninitialized, although they will never be actually taken. */
4606 gnu_jmpbuf_decl
4608 jmpbuf_type,
4609 NULL_TREE,
4615 /* When we exit this block, restore the saved value. */
4617 gnat_cleanup_loc_node);
4618 }
4620 /* If we are to call a function when exiting this block, add a cleanup
4621 to the binding level we made above. Note that add_cleanup is FIFO
4622 so we must register this cleanup after the EH cleanup just above. */
4625 gnat_cleanup_loc_node);
4627 /* Now build the tree for the declarations and statements inside this block.
4628 If this is SJLJ, set our jmp_buf as the current buffer. */
4634 gnu_jmpbuf_decl)));
4640 /* Generate code for each statement in the block. */
4648 /* Now generate code for the two exception models, if either is relevant for
4649 this block. */
4651 {
4653 tree gnu_handler;
4655 /* Make a binding level for the exception handling declarations and code
4656 and set up gnu_except_ptr_stack for the handlers to use. */
4667 /* Generate code for each handler. The N_Exception_Handler case does the
4668 real work and returns a COND_EXPR for each handler, which we chain
4669 together here. */
4672 {
4675 /* If this is the first one, set it as the outer one. Otherwise,
4676 point the "else" part of the previous handler to us. Then point
4677 to our "else" part. */
4680 else
4684 }
4686 /* If none of the exception handlers did anything, re-raise but do not
4687 defer abortion. */
4690 set_expr_location_from_node
4696 else
4699 /* End the binding level dedicated to the exception handlers and get the
4700 whole statement group. */
4705 /* If the setjmp returns 1, we restore our incoming longjmp value and
4706 then check the handlers. */
4709 gnu_jmpsave_decl),
4710 gnat_node);
4714 /* This block is now "if (setjmp) ... <handlers> else <block>". */
4716 (build_call_n_expr
4719 gnu_jmpbuf_decl))),
4721 }
4723 {
4724 tree gnu_handlers;
4725 location_t locus;
4727 /* First make a block containing the handlers. */
4735 /* Now make the TRY_CATCH_EXPR for the block. */
4738 /* Set a location. We need to find a unique location for the dispatching
4739 code, otherwise we can get coverage or debugging issues. Try with
4740 the location of the end label. */
4744 else
4745 /* Clear column information so that the exception handler of an
4746 implicit transient block does not incorrectly inherit the slocs
4747 of a decision, which would otherwise confuse control flow based
4748 coverage analysis tools. */
4750 }
4751 else
4754 /* Now close our outer block, if we had to make one. */
4756 {
4760 }
4763 }
4764 \f
4765 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4766 to a GCC tree, which is returned. This is the variant for Setjmp_Longjmp
4767 exception handling. */
4769 static tree
4771 {
4772 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
4773 an "if" statement to select the proper exceptions. For "Others", exclude
4774 exceptions where Handled_By_Others is nonzero unless the All_Others flag
4775 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
4778 Node_Id gnat_temp;
4782 {
4783 tree this_choice;
4786 {
4789 else
4790 this_choice
4791 = build_binary_op
4793 convert
4795 build_component_ref
4796 (build_unary_op
4801 integer_zero_node);
4802 }
4806 {
4808 tree gnu_expr;
4810 /* Exception may be a renaming. Recover original exception which is
4811 the one elaborated and registered. */
4817 this_choice
4818 = build_binary_op
4823 }
4824 else
4829 }
4832 }
4833 \f
4834 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
4835 to a GCC tree, which is returned. This is the variant for ZCX. */
4837 static tree
4839 {
4842 Node_Id gnat_temp;
4844 /* We build a TREE_LIST of nodes representing what exception types this
4845 handler can catch, with special cases for others and all others cases.
4847 Each exception type is actually identified by a pointer to the exception
4848 id, or to a dummy object for "others" and "all others". */
4851 {
4855 {
4858 }
4861 {
4864 /* Exception may be a renaming. Recover original exception which is
4865 the one elaborated and registered. */
4871 }
4872 else
4875 /* The GCC interface expects NULL to be passed for catch all handlers, so
4876 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
4877 is integer_zero_node. It would not work, however, because GCC's
4878 notion of "catch all" is stronger than our notion of "others". Until
4879 we correctly use the cleanup interface as well, doing that would
4880 prevent the "all others" handlers from being seen, because nothing
4881 can be caught beyond a catch all from GCC's point of view. */
4883 }
4888 /* Expand a call to the begin_handler hook at the beginning of the handler,
4889 and arrange for a call to the end_handler hook to occur on every possible
4890 exit path.
4892 The hooks expect a pointer to the low level occurrence. This is required
4893 for our stack management scheme because a raise inside the handler pushes
4894 a new occurrence on top of the stack, which means that this top does not
4895 necessarily match the occurrence this handler was dealing with.
4897 __builtin_eh_pointer references the exception occurrence being
4898 propagated. Upon handler entry, this is the exception for which the
4899 handler is triggered. This might not be the case upon handler exit,
4900 however, as we might have a new occurrence propagated by the handler's
4901 body, and the end_handler hook called as a cleanup in this context.
4903 We use a local variable to retrieve the incoming value at handler entry
4904 time, and reuse it to feed the end_handler hook's argument at exit. */
4906 gnu_current_exc_ptr
4916 gnu_incoming_exc_ptr),
4917 gnat_node);
4919 /* Declare and initialize the choice parameter, if present. */
4921 {
4922 tree gnu_param
4928 gnu_incoming_exc_ptr));
4929 }
4931 /* We don't have an End_Label at hand to set the location of the cleanup
4932 actions, so we use that of the exception handler itself instead. */
4934 gnat_node);
4940 return
4942 }
4943 \f
4944 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
4946 static void
4948 {
4953 Entity_Id gnat_entity;
4954 Node_Id gnat_pragma;
4955 /* Make the decl for the elaboration procedure. */
4956 tree gnu_elab_proc_decl
4957 = create_subprog_decl
4960 gnat_unit);
4966 /* Initialize the information structure for the function. */
4975 /* For a body, first process the spec if there is one. */
4981 {
4988 }
4990 /* Then process any pragmas and declarations preceding the unit. */
4999 /* Process the unit itself. */
5002 /* Generate code for all the inlined subprograms. */
5006 {
5007 Node_Id gnat_body;
5009 /* Without optimization, process only the required subprograms. */
5015 {
5016 /* ??? This happens when only the spec of a package is provided. */
5020 gnat_body
5022 }
5024 /* Define the entity first so we set DECL_EXTERNAL. */
5027 }
5029 /* Process any pragmas and actions following the unit. */
5034 /* Save away what we've made so far and record this potential elaboration
5035 procedure. */
5048 /* Generate elaboration code for this unit, if necessary, and say whether
5049 we did or not. */
5052 /* Invalidate the global renaming pointers. This is necessary because
5053 stabilization of the renamed entities may create SAVE_EXPRs which
5054 have been tied to a specific elaboration routine just above. */
5057 /* Force the processing for all nodes that remain in the queue. */
5059 }
5060 \f
5061 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Raise_xxx_Error,
5062 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to where
5063 we should place the result type. LABEL_P is true if there is a label to
5064 branch to for the exception. */
5066 static tree
5068 {
5072 const bool with_extra_info
5073 = Exception_Extra_Info
5081 {
5091 {
5097 {
5117 }
5124 && gnu_low_bound
5125 && gnu_high_bound
5128 gnu_result
5132 /* If loop unswitching is enabled, we try to compute invariant
5133 conditions for checks applied to iteration variables, i.e.
5134 conditions that are both independent of the variable and
5135 necessary in order for the check to fail in the course of
5136 some iteration, and prepend them to the original condition
5137 of the checks. This will make it possible later for the
5138 loop unswitching pass to replace the loop with two loops,
5139 one of which has the checks eliminated and the other has
5140 the original checks reinstated, and a run time selection.
5141 The former loop will be suitable for vectorization. */
5143 && (!gnu_low_bound
5145 && (!gnu_high_bound
5148 {
5153 boolean_true_node);
5155 boolean_type_node,
5158 }
5159 }
5164 }
5166 common:
5171 /* If the type is VOID, this is a statement, so we need to generate the code
5172 for the call. Handle a condition, if there is one. */
5174 {
5176 {
5181 }
5182 }
5183 else
5187 }
5188 \f
5189 /* Return true if GNAT_NODE is on the LHS of an assignment or an actual
5190 parameter of a call. */
5192 static bool
5194 {
5209 }
5211 /* Return true if either GNAT_NODE or a view of GNAT_NODE is on the LHS
5212 of an assignment or an actual parameter of a call. */
5214 static bool
5216 {
5217 Node_Kind kind;
5229 }
5231 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
5232 as gigi is concerned. This is used to avoid conversions on the LHS. */
5234 static bool
5236 {
5239 /* The conversion must be on the LHS of an assignment or an actual parameter
5240 of a call. Otherwise, even if the conversion was essentially a no-op, it
5241 could de facto ensure type consistency and this should be preserved. */
5247 /* We're interested in artificial conversions generated by the front-end
5248 to make private types explicit, e.g. in Expand_Assign_Array. */
5255 /* The direct conversion to the underlying type is a no-op. */
5259 /* For an array subtype, the conversion to the PAIT is a no-op. */
5264 /* For a record subtype, the conversion to the type is a no-op. */
5270 }
5272 /* This function is the driver of the GNAT to GCC tree transformation process.
5273 It is the entry point of the tree transformer. GNAT_NODE is the root of
5274 some GNAT tree. Return the root of the corresponding GCC tree. If this
5275 is an expression, return the GCC equivalent of the expression. If this
5276 is a statement, return the statement or add it to the current statement
5277 group, in which case anything returned is to be interpreted as occurring
5278 after anything added. */
5280 tree
5282 {
5288 Node_Id gnat_temp;
5290 /* Save node number for error message and set location information. */
5294 /* If this node is a statement and we are only annotating types, return an
5295 empty statement list. */
5299 /* If this node is a non-static subexpression and we are only annotating
5300 types, make this into a NULL_EXPR. */
5307 N_Raise_Constraint_Error));
5316 {
5319 /* If this is a statement and we are at top level, it must be part of
5320 the elaboration procedure, so mark us as being in that procedure. */
5322 {
5325 }
5327 /* If we are in the elaboration procedure, check if we are violating a
5328 No_Elaboration_Code restriction by having a statement there. Don't
5329 check for a possible No_Elaboration_Code restriction violation on
5330 N_Handled_Sequence_Of_Statements, as we want to signal an error on
5331 every nested real statement instead. This also avoids triggering
5332 spurious errors on dummy (empty) sequences created by the front-end
5333 for package bodies in some cases. */
5337 }
5340 {
5341 /********************************/
5342 /* Chapter 2: Lexical Elements */
5343 /********************************/
5351 /* If this is an atomic access on the RHS for which synchronization is
5352 required, build the atomic load. */
5359 {
5360 tree gnu_type;
5362 /* Get the type of the result, looking inside any padding and
5363 justified modular types. Then get the value in that type. */
5372 /* If the result overflows (meaning it doesn't fit in its base type),
5373 abort. We would like to check that the value is within the range
5374 of the subtype, but that causes problems with subtypes whose usage
5375 will raise Constraint_Error and with biased representation, so
5376 we don't. */
5378 }
5382 /* If a Entity is present, it means that this was one of the
5383 literals in a user-defined character type. In that case,
5384 just return the value in the CONST_DECL. Otherwise, use the
5385 character code. In that case, the base type should be an
5386 INTEGER_TYPE, but we won't bother checking for that. */
5390 else
5391 gnu_result
5392 = build_int_cst_type
5399 /* If this is of a fixed-point type, the value we want is the value of
5400 the corresponding integer. */
5402 {
5404 gnu_result_type);
5406 }
5408 else
5409 {
5412 /* First convert the value to a machine number if it isn't already.
5413 That will force the base to 2 for non-zero values and simplify
5414 the rest of the logic. */
5416 ur_realval
5422 else
5423 {
5424 REAL_VALUE_TYPE tmp;
5428 /* The base must be 2 as Machine guarantees this, so we scale
5429 the value, which we know can fit in the mantissa of the type
5430 (hence the use of that type above). */
5435 }
5437 /* Now see if we need to negate the result. Do it this way to
5438 properly handle -0. */
5440 gnu_result
5442 gnu_result);
5443 }
5450 {
5457 else
5460 /* Build the string with the characters in the literal. Note
5461 that Ada strings are 1-origin. */
5465 /* Put a null at the end of the string in case it's in a context
5466 where GCC will want to treat it as a C string. */
5471 /* Strings in GCC don't normally have types, but we want
5472 this to not be converted to the array type. */
5477 }
5478 else
5479 {
5480 /* Build a list consisting of each character, then make
5481 the aggregate. */
5491 {
5497 }
5500 }
5507 /**************************************/
5508 /* Chapter 3: Declarations and Types */
5509 /**************************************/
5526 /* If we are just annotating types and this object has an unconstrained
5527 or task type, don't elaborate it. */
5537 && (!type_annotate_only
5539 {
5542 gnu_expr
5545 /* If this object has its elaboration delayed, we must force
5546 evaluation of GNU_EXPR right now and save it for when the object
5547 is frozen. */
5549 {
5551 ;
5553 gnu_expr
5558 else
5562 }
5563 }
5564 else
5570 /* If this is a deferred constant with an address clause, we ignore the
5571 full view since the clause is on the partial view and we cannot have
5572 2 different GCC trees for the object. The only bits of the full view
5573 we will use is the initializer, but it will be directly fetched. */
5586 /* Don't do anything if this renaming is handled by the front end or if
5587 we are just annotating types and this object has a composite or task
5588 type, don't elaborate it. We return the result in case it has any
5589 SAVE_EXPRs in it that need to be evaluated here. */
5591 && ! (type_annotate_only
5595 gnu_result
5598 else
5605 gnu_result
5608 else
5620 /* These are fully handled in the front end. */
5621 /* ??? For package renamings, find a way to use GENERIC namespaces so
5622 that we get proper debug information for them. */
5626 /*************************************/
5627 /* Chapter 4: Names and Expressions */
5628 /*************************************/
5635 /* If this is an atomic access on the RHS for which synchronization is
5636 required, build the atomic load. */
5643 {
5645 tree gnu_type;
5652 /* Convert vector inputs to their representative array type, to fit
5653 what the code below expects. */
5655 {
5659 }
5663 /* If we got a padded type, remove it too. */
5665 gnu_array_object
5667 gnu_array_object);
5671 /* The failure of this assertion will very likely come from a missing
5672 expansion for a packed array access. */
5675 /* First compute the number of dimensions of the array, then
5676 fill the expression array, the order depending on whether
5677 this is a Convention_Fortran array or not. */
5682 ;
5691 else
5699 {
5705 gnu_expr
5706 = emit_index_check
5710 gnat_temp);
5712 gnu_result
5715 /* Array accesses are bound-checked so they cannot trap, but this
5716 is valid only if they are not hoisted ahead of the check. We
5717 need to mark them as no-trap to get decent loop optimizations
5718 in the presence of -fnon-call-exceptions, so we do it when we
5719 know that the original expression had no side-effects. */
5724 }
5728 /* If this is an atomic access on the RHS for which synchronization is
5729 required, build the atomic load. */
5733 }
5737 {
5739 tree gnu_type;
5744 /* Do any implicit dereferences of the prefix and do any needed
5745 range check. */
5750 {
5751 /* Get the bounds of the slice. */
5752 tree gnu_index_type
5756 /* Get the permitted bounds. */
5757 tree gnu_base_index_type
5759 tree gnu_base_min_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5761 tree gnu_base_max_expr = SUBSTITUTE_PLACEHOLDER_IN_EXPR
5768 /* Derive a good type to convert everything to. */
5771 /* Test whether the minimum slice value is too small. */
5774 gnu_min_expr),
5776 gnu_base_min_expr));
5778 /* Test whether the maximum slice value is too large. */
5781 gnu_max_expr),
5783 gnu_base_max_expr));
5785 /* Build a slice index check that returns the low bound,
5786 assuming the slice is not empty. */
5787 gnu_expr = emit_check
5792 /* Build a conditional expression that does the index checks and
5793 returns the low bound if the slice is not empty (max >= min),
5794 and returns the naked low bound otherwise (max < min), unless
5795 it is non-constant and the high bound is; this prevents VRP
5796 from inferring bogus ranges on the unlikely path. */
5800 gnu_max_expr),
5802 gnu_min_expr)),
5803 gnu_expr,
5807 }
5808 else
5809 /* Simply return the naked low bound. */
5812 /* If this is a slice with non-constant size of an array with constant
5813 size, set the maximum size for the allocation of temporaries. */
5820 }
5824 {
5828 tree gnu_field;
5832 /* For discriminant references in tagged types always substitute the
5833 corresponding discriminant as the actual selected component. */
5838 /* For discriminant references of untagged types always substitute the
5839 corresponding stored discriminant. */
5843 /* Handle extracting the real or imaginary part of a complex.
5844 The real part is the first field and the imaginary the last. */
5849 else
5850 {
5853 /* If there are discriminants, the prefix might be evaluated more
5854 than once, which is a problem if it has side-effects. */
5861 gnu_result
5865 && lvalue_required_for_attribute_p
5867 }
5871 /* If this is an atomic access on the RHS for which synchronization is
5872 required, build the atomic load. */
5876 }
5880 {
5881 /* The attribute designator. */
5884 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
5885 is a unit, not an object with a GCC equivalent. */
5887 return
5895 }
5899 /* Like 'Access as far as we are concerned. */
5907 {
5908 tree gnu_aggr_type;
5910 /* ??? It is wrong to evaluate the type now, but there doesn't
5911 seem to be any other practical way of doing it. */
5915 gnu_aggr_type = gnu_result_type
5920 gnu_aggr_type
5927 NULL);
5931 gnu_result
5934 gnu_aggr_type);
5937 gnu_aggr_type,
5940 gnu_result
5941 = build_binary_op
5946 (Next
5948 else
5952 }
5960 else
5967 /* Get the operand expression. */
5971 /* If this is a qualified expression for a tagged type, we mark the type
5972 as used. Because of polymorphism, this might be the only reference to
5973 the tagged type in the program while objects have it as dynamic type.
5974 The debugger needs to see it to display these objects properly. */
5978 gnu_result
5982 kind == N_Type_Conversion
5989 /* Skip further processing if the conversion is deemed a no-op. */
5991 {
5994 }
5998 /* If the result is a pointer type, see if we are improperly
5999 converting to a stricter alignment. */
6002 {
6008 post_error_ne_tree_2
6012 }
6014 /* If we are converting a descriptor to a function pointer, first
6015 build the pointer. */
6027 {
6032 /* GNAT_RANGE is either an N_Range node or an identifier denoting a
6033 subtype. */
6035 {
6038 }
6041 {
6045 gnu_low
6047 gnu_high
6049 }
6050 else
6055 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
6056 ensure that GNU_OBJ is evaluated only once and perform a full range
6057 test. */
6059 gnu_result
6061 else
6062 {
6071 gnu_result
6073 }
6076 gnu_result
6078 }
6086 ? RDIV_EXPR
6093 /* These can either be operations on booleans or on modular types.
6094 Fall through for boolean types since that's the way GNU_CODES is
6095 set up. */
6097 {
6098 enum tree_code code
6109 }
6111 /* ... fall through ... */
6123 {
6127 tree gnu_type;
6133 /* Pending generic support for efficient vector logical operations in
6134 GCC, convert vectors to their representative array type view and
6135 fallthrough. */
6139 /* If this is a comparison operator, convert any references to an
6140 unconstrained array value into a reference to the actual array. */
6142 {
6145 }
6147 /* If this is a shift whose count is not guaranteed to be correct,
6148 we need to adjust the shift count. */
6150 {
6152 tree gnu_max_shift
6159 gnu_rhs
6160 = build_binary_op
6163 gnu_count_type,
6164 gnu_max_shift,
6166 integer_one_node)),
6167 gnu_rhs);
6168 }
6170 /* For right shifts, the type says what kind of shift to do,
6171 so we may need to choose a different type. In this case,
6172 we have to ignore integer overflow lest it propagates all
6173 the way down and causes a CE to be explicitly raised. */
6175 {
6178 }
6181 {
6184 }
6187 {
6193 }
6195 /* Instead of expanding overflow checks for addition, subtraction
6196 and multiplication itself, the front end will leave this to
6197 the back end when Backend_Overflow_Checks_On_Target is set.
6198 As the GCC back end itself does not know yet how to properly
6199 do overflow checking, do it here. The goal is to push
6200 the expansions further into the back end over time. */
6209 else
6210 {
6211 /* Some operations, e.g. comparisons of arrays, generate complex
6212 trees that need to be annotated while they are being built. */
6215 }
6217 /* If this is a logical shift with the shift count not verified,
6218 we must return zero if it is too large. We cannot compensate
6219 above in this case. */
6222 gnu_result
6223 = build_cond_expr
6226 gnu_rhs,
6230 gnu_result);
6231 }
6235 {
6238 tree gnu_false
6242 gnu_result
6244 }
6253 /* This case can apply to a boolean or a modular type.
6254 Fall through for a boolean operand since GNU_CODES is set
6255 up to handle this. */
6257 {
6261 gnu_expr);
6263 }
6265 /* ... fall through ... */
6274 gnu_result
6277 else
6283 {
6285 tree gnu_type;
6290 /* The Expression operand can either be an N_Identifier or
6291 Expanded_Name, which must represent a type, or a
6292 N_Qualified_Expression, which contains both the object type and an
6293 initial value for the object. */
6298 {
6299 Entity_Id gnat_desig_type
6307 gnu_init
6313 else
6314 {
6318 }
6320 /* See the N_Qualified_Expression case for the rationale. */
6325 }
6326 else
6333 ignore_init_type);
6334 }
6337 /**************************/
6338 /* Chapter 5: Statements */
6339 /**************************/
6347 /* When not optimizing, turn null statements from source into gotos to
6348 the next statement that the middle-end knows how to preserve. */
6350 {
6361 }
6362 else
6367 /* Get the LHS and RHS of the statement and convert any reference to an
6368 unconstrained array into a reference to the underlying array. */
6371 /* If the type has a size that overflows, convert this into raise of
6372 Storage_Error: execution shouldn't have gotten here anyway. */
6376 N_Raise_Storage_Error);
6378 gnu_result
6381 else
6382 {
6384 const Entity_Id gnat_type
6386 const bool regular_array_type_p
6388 const bool use_memset_p
6389 = (regular_array_type_p
6393 /* If we'll use memset, we need to find the inner expression. */
6395 {
6396 Node_Id gnat_inner
6400 gnat_inner
6403 }
6404 else
6407 /* If range check is needed, emit code to generate it. */
6410 gnat_node);
6412 /* If atomic synchronization is required, build an atomic store. */
6416 /* Or else, use memset when the conditions are met. */
6418 {
6422 tree size
6427 {
6428 tree mask
6432 }
6434 }
6436 /* Otherwise build a regular assignment. */
6437 else
6438 gnu_result
6441 /* If the assignment type is a regular array and the two sides are
6442 not completely disjoint, play safe and use memmove. But don't do
6443 it for a bit-packed array as it might not be byte-aligned. */
6445 && regular_array_type_p
6447 {
6451 tree size
6457 }
6458 }
6462 {
6465 /* Make the outer COND_EXPR. Avoid non-determinism. */
6474 /* Now make a COND_EXPR for each of the "else if" parts. Put each
6475 into the previous "else" part and point to where to put any
6476 outer "else". Also avoid non-determinism. */
6480 {
6490 }
6493 }
6505 /* The only way to enter the block is to fall through to it. */
6507 {
6514 }
6515 else
6520 gnu_result
6530 {
6533 /* If the subprogram is a function, we must return the expression. */
6535 {
6538 /* If this function has copy-in/copy-out parameters, get the real
6539 object for the return. See Subprogram_to_gnu. */
6542 else
6545 /* Get the GCC tree for the expression to be returned. */
6548 /* Do not remove the padding from GNU_RET_VAL if the inner type is
6549 self-referential since we want to allocate the fixed size. */
6551 && TYPE_IS_PADDING_P
6553 && CONTAINS_PLACEHOLDER_P
6557 /* If the function returns by direct reference, return a pointer
6558 to the return value. */
6563 /* Otherwise, if it returns an unconstrained array, we have to
6564 allocate a new version of the result and return it. */
6566 {
6569 /* And find out whether this is a candidate for Named Return
6570 Value. If so, record it. */
6572 {
6575 /* Strip useless conversions around the return value. */
6579 /* Strip unpadding around the return value. */
6581 && TYPE_IS_PADDING_P
6585 /* Now apply the test to the return value. */
6587 {
6593 }
6594 }
6597 gnu_ret_val,
6602 }
6604 /* Otherwise, if it returns by invisible reference, dereference
6605 the pointer it is passed using the type of the return value
6606 and build the copy operation manually. This ensures that we
6607 don't copy too much data, for example if the return type is
6608 unconstrained with a maximum size. */
6610 {
6611 tree gnu_ret_deref
6613 gnu_ret_obj);
6618 }
6619 }
6621 else
6624 /* If we have a return label defined, convert this into a branch to
6625 that label. The return proper will be handled elsewhere. */
6627 {
6630 gnu_ret_val));
6635 /* When not optimizing, make sure the return is preserved. */
6638 }
6640 /* Otherwise, build a regular return. */
6641 else
6643 }
6647 gnu_result
6651 /***************************/
6652 /* Chapter 6: Subprograms */
6653 /***************************/
6656 /* Unless there is a freeze node, declare the subprogram. We consider
6657 this a "definition" even though we're not generating code for
6658 the subprogram because we will be making the corresponding GCC
6659 node here. */
6668 /* This subprogram doesn't exist for code generation purposes, but we
6669 have to elaborate the types of any parameters and result, unless
6670 they are imported types (nothing to generate in this case).
6672 The parameter list may contain types with freeze nodes, e.g. not null
6673 subtypes, so the subprogram itself may carry a freeze node, in which
6674 case its elaboration must be deferred. */
6676 /* Process the parameter types first. */
6679 = First_Formal_With_Extras
6687 /* Then the result type, set to Standard_Void_Type for procedures. */
6688 {
6689 Entity_Id gnat_temp_type
6694 }
6700 /* For a child unit identifier go up a level to get the specification.
6701 We get this when we try to find the spec of a child unit package
6702 that is the compilation unit being compiled. */
6716 /************************/
6717 /* Chapter 7: Packages */
6718 /************************/
6734 /* If this is the body of a generic package - do nothing. */
6736 {
6739 }
6750 /********************************/
6751 /* Chapter 8: Visibility Rules */
6752 /********************************/
6756 /* Nothing to do here - but these may appear in list of declarations. */
6760 /*********************/
6761 /* Chapter 9: Tasks */
6762 /*********************/
6773 /*********************************************************/
6774 /* Chapter 10: Program Structure and Compilation Issues */
6775 /*********************************************************/
6778 /* This is not called for the main unit on which gigi is invoked. */
6787 /* Simply process whatever unit is being inserted. */
6790 else
6791 {
6794 }
6801 /***************************/
6802 /* Chapter 11: Exceptions */
6803 /***************************/
6806 /* If there is an At_End procedure attached to this node, and the EH
6807 mechanism is SJLJ, we must have at least a corresponding At_End
6808 handler, unless the No_Exception_Handlers restriction is set. */
6823 else
6828 /* Only for reraise in back-end exceptions mode. */
6835 /* Clear the current exception pointer so that the occurrence won't be
6836 deallocated. */
6875 /******************************/
6876 /* Chapter 12: Generic Units */
6877 /******************************/
6887 /* These nodes can appear on a declaration list but there is nothing to
6888 to be done with them. */
6892 /**************************************************/
6893 /* Chapter 13: Representation Clauses and */
6894 /* Implementation-Dependent Features */
6895 /**************************************************/
6900 /* The only one we need to deal with is 'Address since, for the others,
6901 the front-end puts the information elsewhere. */
6905 /* And we only deal with 'Address if the object has a Freeze node. */
6910 /* Get the value to use as the address and save it as the equivalent
6911 for the object. When it is frozen, gnat_to_gnu_entity will do the
6912 right thing. */
6919 /* We do nothing with these. SEM puts the information elsewhere. */
6925 {
6935 /* First retrieve the 3 operand lists built by the front-end. */
6938 {
6945 }
6949 {
6956 }
6960 gnu_clobbers
6963 gnu_clobbers);
6965 /* Then perform some standard checking and processing on the
6966 operands. In particular, mark them addressable if needed. */
6974 {
6976 constraint
6982 {
6983 /* If the operand is going to end up in memory,
6984 mark it addressable. Note that we don't test
6985 allows_mem like in the input case below; this
6986 is modelled on the C front-end. */
6988 {
6995 }
6996 }
6997 else
7001 }
7004 {
7006 constraint
7012 {
7013 /* If the operand is going to end up in memory,
7014 mark it addressable. */
7016 {
7023 }
7024 }
7025 else
7029 }
7035 }
7036 else
7041 /****************/
7042 /* Added Nodes */
7043 /****************/
7046 /* This construct doesn't define a scope so we don't push a binding level
7047 around the statement list; but we wrap it in a SAVE_EXPR to protect it
7048 from unsharing. */
7053 gnu_result
7078 {
7083 /* If this is a thin pointer, we must first dereference it to create
7084 a fat pointer, then go back below to a thin pointer. The reason
7085 for this is that we need to have a fat pointer someplace in order
7086 to properly compute the size. */
7090 gnu_ptr));
7092 /* If this is a fat pointer, the object must have been allocated with
7093 the template in front of the array. So pass the template address,
7094 and get the total size; do it by converting to a thin pointer. */
7096 gnu_ptr
7098 (TYPE_OBJECT_RECORD_TYPE
7100 gnu_ptr);
7104 /* If this is a thin pointer, the object must have been allocated with
7105 the template in front of the array. So pass the template address,
7106 and get the total size. */
7108 gnu_ptr
7110 gnu_ptr,
7112 byte_position
7113 (DECL_CHAIN
7116 /* If we have a special dynamic constrained subtype on the node, use
7117 it to compute the size; otherwise, use the designated subtype. */
7119 {
7120 gnu_actual_obj_type
7124 gnu_actual_obj_type
7126 gnu_actual_obj_type,
7129 }
7130 else
7133 gnu_result
7136 gnu_obj_type,
7139 gnat_node);
7140 }
7148 else
7153 /* The only validation we currently do on an unchecked conversion is
7154 that of aliasing assumptions. */
7166 /* These nodes should only be present when annotating types. */
7172 /* Other nodes are not supposed to reach here. */
7174 }
7176 /* If we pushed the processing of the elaboration routine, pop it back. */
7180 /* When not optimizing, turn boolean rvalues B into B != false tests
7181 so that the code just below can put the location information of the
7182 reference to B on the inequality operator for better debug info. */
7196 boolean_false_node));
7198 /* Set the location information on the result. Note that we may have
7199 no result if we tried to build a CALL_EXPR node to a procedure with
7200 no side-effects and optimization is enabled. */
7204 /* If we're supposed to return something of void_type, it means we have
7205 something we're elaborating for effect, so just return. */
7209 /* If the result is a constant that overflowed, raise Constraint_Error. */
7211 {
7213 gnu_result
7216 N_Raise_Constraint_Error));
7217 }
7219 /* If the result has side-effects and is of an unconstrained type, make a
7220 SAVE_EXPR so that we can be sure it will only be referenced once. But
7221 this is useless for a call to a function that returns an unconstrained
7222 type with default discriminant, as we cannot compute the size of the
7223 actual returned object. We must do this before any conversions. */
7231 /* Now convert the result to the result type, unless we are in one of the
7232 following cases:
7234 1. If this is the LHS of an assignment or an actual parameter of a
7235 call, return the result almost unmodified since the RHS will have
7236 to be converted to our type in that case, unless the result type
7237 has a simpler size. Likewise if there is just a no-op unchecked
7238 conversion in-between. Similarly, don't convert integral types
7239 that are the operands of an unchecked conversion since we need
7240 to ignore those conversions (for 'Valid).
7242 2. If we have a label (which doesn't have any well-defined type), a
7243 field or an error, return the result almost unmodified. Similarly,
7244 if the two types are record types with the same name, don't convert.
7245 This will be the case when we are converting from a packable version
7246 of a type to its original type and we need those conversions to be
7247 NOPs in order for assignments into these types to work properly.
7249 3. If the type is void or if we have no result, return error_mark_node
7250 to show we have no result.
7252 4. If this a call to a function that returns an unconstrained type with
7253 default discriminant, return the call expression unmodified since we
7254 cannot compute the size of the actual returned object.
7256 5. Finally, if the type of the result is already correct. */
7274 && (CONTAINS_PLACEHOLDER_P
7278 {
7279 /* Remove padding only if the inner object is of self-referential
7280 size: in that case it must be an object of unconstrained type
7281 with a default discriminant and we want to avoid copying too
7282 much data. */
7287 gnu_result);
7288 }
7297 {
7298 /* Remove any padding. */
7301 gnu_result);
7302 }
7310 == gnu_result_type
7312 ;
7317 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
7324 }
7325 \f
7326 /* Subroutine of above to push the exception label stack. GNU_STACK is
7327 a pointer to the stack to update and GNAT_LABEL, if present, is the
7328 label to push onto the stack. */
7330 static void
7332 {
7338 }
7339 \f
7340 /* Record the current code position in GNAT_NODE. */
7342 static void
7344 {
7349 }
7351 /* Insert the code for GNAT_NODE at the position saved for that node. */
7353 static void
7355 {
7358 }
7359 \f
7360 /* Start a new statement group chained to the previous group. */
7362 void
7364 {
7367 /* First see if we can get one from the free list. */
7370 else
7376 }
7378 /* Add GNU_STMT to the current statement group. If it is an expression with
7379 no effects, it is ignored. */
7381 void
7383 {
7385 }
7387 /* Similar, but the statement is always added, regardless of side-effects. */
7389 void
7391 {
7393 }
7395 /* Like add_stmt, but set the location of GNU_STMT to that of GNAT_NODE. */
7397 void
7399 {
7400 /* Do not emit a location for renamings that come from generic instantiation,
7401 they are likely to disturb debugging. */
7406 }
7408 /* Similar, but the statement is always added, regardless of side-effects. */
7410 void
7412 {
7416 }
7418 /* Add a declaration statement for GNU_DECL to the current statement group.
7419 Get SLOC from Entity_Id. */
7421 void
7423 {
7427 /* If this is a variable that Gigi is to ignore, we may have been given
7428 an ERROR_MARK. So test for it. We also might have been given a
7429 reference for a renaming. So only do something for a decl. Also
7430 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
7438 /* If we are external or global, we don't want to output the DECL_EXPR for
7439 this DECL node since we already have evaluated the expressions in the
7440 sizes and positions as globals and doing it again would be wrong. */
7442 {
7443 /* Mark everything as used to prevent node sharing with subprograms.
7444 Note that walk_tree knows how to deal with TYPE_DECL, but neither
7445 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
7449 {
7453 }
7454 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
7459 }
7460 else
7463 /* If this is a variable and an initializer is attached to it, it must be
7464 valid for the context. Similar to init_const in create_var_decl_1. */
7471 {
7472 /* If GNU_DECL has a padded type, convert it to the unpadded
7473 type so the assignment is done properly. */
7476 else
7483 {
7486 }
7489 }
7490 }
7492 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
7494 static tree
7496 {
7502 /* Don't mark a dummy type as visited because we want to mark its sizes
7503 and fields once it's filled in. */
7511 }
7513 /* Mark nodes rooted at T with TREE_VISITED and types as having their
7514 sized gimplified. We use this to indicate all variable sizes and
7515 positions in global types may not be shared by any subprogram. */
7517 void
7519 {
7521 }
7523 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
7524 set its location to that of GNAT_NODE if present, but with column info
7525 cleared so that conditional branches generated as part of the cleanup
7526 code do not interfere with coverage analysis tools. */
7528 static void
7530 {
7534 }
7536 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
7538 void
7540 {
7543 }
7545 /* Return code corresponding to the current code group. It is normally
7546 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
7547 BLOCK or cleanups were set. */
7549 tree
7551 {
7555 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
7556 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
7557 make a BIND_EXPR. Note that we nest in that because the cleanup may
7558 reference variables in the block. */
7570 /* Remove this group from the stack and add it to the free list. */
7576 }
7578 /* Return whether the current statement group may fall through. */
7582 {
7585 else
7587 }
7589 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
7590 statements.*/
7592 static void
7594 {
7595 Node_Id gnat_node;
7601 }
7603 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
7604 If BINDING_P is true, push and pop a binding level around the list. */
7606 static tree
7608 {
7618 }
7619 \f
7620 /* Generate GIMPLE in place for the expression at *EXPR_P. */
7622 int
7625 {
7627 tree op;
7633 {
7635 /* If this is for a scalar, just make a VAR_DECL for it. If for
7636 an aggregate, get a null pointer of the appropriate type and
7637 dereference it. */
7641 integer_zero_node));
7642 else
7643 {
7646 }
7652 /* We should only do this if we are just elaborating for side-effects,
7653 but we can't know that yet. */
7660 /* If we are taking the address of a constant CONSTRUCTOR, make sure it
7661 is put into static memory. We know that it's going to be read-only
7662 given the semantics we have and it must be in static memory when the
7663 reference is in an elaboration procedure. */
7665 {
7669 }
7676 /* If we are view-converting a CONSTRUCTOR or a call from an aggregate
7677 type to a scalar one, explicitly create the local temporary. That's
7678 required if the type is passed by reference. */
7682 {
7691 }
7698 /* The expressions for the RM bounds must be gimplified to ensure that
7699 they are properly elaborated. See gimplify_decl_expr. */
7703 {
7708 {
7713 {
7717 }
7721 {
7725 }
7727 }
7732 }
7734 /* ... fall through ... */
7738 }
7739 }
7741 /* Generate GIMPLE in place for the statement at *STMT_P. */
7743 static enum gimplify_status
7745 {
7749 {
7755 {
7761 /* Build the condition expression from the test, if any. */
7763 {
7764 /* Deal with the optimization hints. */
7768 annot_expr_ivdep_kind));
7772 annot_expr_no_vector_kind));
7776 annot_expr_vector_kind));
7778 gnu_cond
7781 }
7783 /* Set to emit the statements of the loop. */
7786 /* We first emit the start label and then a conditional jump to the
7787 end label if there's a top condition, then the update if it's at
7788 the top, then the body of the loop, then a conditional jump to
7789 the end label if there's a bottom condition, then the update if
7790 it's at the bottom, and finally a jump to the start label and the
7791 definition of the end label. */
7793 gnu_start_label),
7794 stmt_p);
7815 gnu_end_label),
7816 stmt_p);
7818 }
7821 /* Build a statement to jump to the corresponding end label, then
7822 see if it needs to be conditional. */
7831 }
7832 }
7833 \f
7834 /* Force references to each of the entities in packages withed by GNAT_NODE.
7835 Operate recursively but check that we aren't elaborating something more
7836 than once.
7838 This routine is exclusively called in type_annotate mode, to compute DDA
7839 information for types in withed units, for ASIS use. */
7841 static void
7843 {
7846 /* Process each unit only once. As we trace the context of all relevant
7847 units transitively, including generic bodies, we may encounter the
7848 same generic unit repeatedly. */
7852 /* Save entities in all context units. A body may have an implicit_with
7853 on its own spec, if the context includes a child unit, so don't save
7854 the spec twice. */
7861 {
7865 {
7882 }
7884 {
7885 Node_Id gnat_body
7888 /* Retrieve compilation unit node of generic body. */
7893 /* If body is available, elaborate its context. */
7896 }
7897 }
7901 }
7902 \f
7903 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
7905 static void
7907 {
7912 /* If this is a package, we need to generate code for the package. */
7914 {
7915 insert_code_for
7919 }
7921 /* Don't do anything for class-wide types as they are always transformed
7922 into their root type. */
7926 /* Check for an old definition. This freeze node might be for an Itype. */
7927 gnu_old
7930 /* If this entity has an address representation clause, GNU_OLD is the
7931 address, so discard it here. */
7935 /* Don't do anything for subprograms that may have been elaborated before
7936 their freeze nodes. This can happen, for example, because of an inner
7937 call in an instance body or because of previous compilation of a spec
7938 for inlining purposes. */
7946 /* If we have a non-dummy type old tree, we have nothing to do, except
7947 aborting if this is the public view of a private type whose full view was
7948 not delayed, as this node was never delayed as it should have been. We
7949 let this happen for concurrent types and their Corresponding_Record_Type,
7950 however, because each might legitimately be elaborated before its own
7951 freeze node, e.g. while processing the other. */
7955 {
7963 }
7965 /* Reset the saved tree, if any, and elaborate the object or type for real.
7966 If there is a full view, elaborate it and use the result. And, if this
7967 is the root type of a class-wide type, reuse it for the latter. */
7969 {
7974 {
7981 {
7984 }
7985 }
7991 }
7995 {
8004 /* Propagate back-annotations from full view to partial view. */
8014 /* The above call may have defined this entity (the simplest example
8015 of this is when we have a private enumeral type since the bounds
8016 will have the public view). */
8019 }
8020 else
8021 {
8022 tree gnu_init
8028 }
8035 /* If we have an old type and we've made pointers to this type, update those
8036 pointers. If this is a Taft amendment type in the main unit, we need to
8037 mark the type as used since other units referencing it don't see the full
8038 declaration and, therefore, cannot mark it as used themselves. */
8040 {
8045 }
8046 }
8047 \f
8048 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
8049 We make two passes, one to elaborate anything other than bodies (but
8050 we declare a function if there was no spec). The second pass
8051 elaborates the bodies.
8053 GNAT_END_LIST gives the element in the list past the end. Normally,
8054 this is Empty, but can be First_Real_Statement for a
8055 Handled_Sequence_Of_Statements.
8057 We make a complete pass through both lists if PASS1P is true, then make
8058 the second pass over both lists if PASS2P is true. The lists usually
8059 correspond to the public and private parts of a package. */
8061 static void
8064 {
8066 Node_Id gnat_decl;
8076 {
8077 /* For package specs, we recurse inside the declarations,
8078 thus taking the two pass approach inside the boundary. */
8086 /* Similarly for any declarations in the actions of a
8087 freeze node. */
8089 {
8092 }
8094 /* Package bodies with freeze nodes get their elaboration deferred
8095 until the freeze node, but the code must be placed in the right
8096 place, so record the code position now. */
8104 (Corresponding_Spec
8107 record_code_position
8110 /* We defer most subprogram bodies to the second pass. */
8112 {
8114 {
8120 }
8121 }
8123 /* For bodies and stubs that act as their own specs, the entity
8124 itself must be elaborated in the first pass, because it may
8125 be used in other declarations. */
8127 {
8128 Node_Id gnat_subprog_id
8135 }
8137 /* Concurrent stubs stand for the corresponding subprogram bodies,
8138 which are deferred like other bodies. */
8141 ;
8143 else
8145 }
8147 /* Here we elaborate everything we deferred above except for package bodies,
8148 which are elaborated at their freeze nodes. Note that we must also
8149 go inside things (package specs and freeze nodes) the first pass did. */
8155 {
8171 }
8172 }
8173 \f
8174 /* Make a unary operation of kind CODE using build_unary_op, but guard
8175 the operation by an overflow check. CODE can be one of NEGATE_EXPR
8176 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
8177 the operation is to be performed in that type. GNAT_NODE is the gnat
8178 node conveying the source location for which the error should be
8179 signaled. */
8181 static tree
8183 Node_Id gnat_node)
8184 {
8193 }
8195 /* Make a binary operation of kind CODE using build_binary_op, but guard
8196 the operation by an overflow check. CODE can be one of PLUS_EXPR,
8197 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
8198 Usually the operation is to be performed in that type. GNAT_NODE is
8199 the GNAT node conveying the source location for which the error should
8200 be signaled. */
8202 static tree
8205 {
8215 /* Assert that the precision is a power of 2. */
8218 /* Prefer a constant or known-positive rhs to simplify checks. */
8224 {
8228 }
8232 /* If we can fold the expression to a constant, just return it.
8233 The caller will deal with overflow, no need to generate a check. */
8238 ? boolean_false_node
8241 /* ??? Should use more efficient check for operand_equal_p (lhs, rhs, 0) */
8243 /* Try a few strategies that may be cheaper than the general
8244 code at the end of the function, if the rhs is not known.
8245 The strategies are:
8246 - Call library function for 64-bit multiplication (complex)
8247 - Widen, if input arguments are sufficiently small
8248 - Determine overflow using wrapped result for addition/subtraction. */
8251 {
8252 /* Even for add/subtract double size to get another base type. */
8256 {
8262 }
8266 {
8272 check = build_binary_op
8279 return
8281 }
8284 {
8286 tree wrapped_expr
8292 /* Overflow when (rhs < 0) ^ (wrapped_expr < lhs)), for addition
8293 or when (rhs < 0) ^ (wrapped_expr > lhs) for subtraction. */
8294 check
8298 boolean_type_node,
8301 return
8303 }
8304 }
8307 {
8309 /* When rhs >= 0, overflow when lhs > type_max - rhs. */
8314 /* When rhs < 0, overflow when lhs < type_min - rhs. */
8321 /* When rhs >= 0, overflow when lhs < type_min + rhs. */
8326 /* When rhs < 0, overflow when lhs > type_max + rhs. */
8333 /* The check here is designed to be efficient if the rhs is constant,
8334 but it will work for any rhs by using integer division.
8335 Four different check expressions determine whether X * C overflows,
8336 depending on C.
8337 C == 0 => false
8338 C > 0 => X > type_max / C || X < type_min / C
8339 C == -1 => X == type_min
8340 C < -1 => X > type_min / C || X < type_max / C */
8345 check_pos
8348 rhs),
8351 boolean_type_node,
8354 boolean_type_node,
8357 check_neg
8362 type_min),
8365 boolean_type_node,
8368 boolean_type_node,
8374 }
8377 check_pos);
8380 }
8382 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
8383 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
8384 which we have to check. GNAT_NODE is the GNAT node conveying the source
8385 location for which the error should be signaled. */
8387 static tree
8389 {
8393 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
8394 This can for example happen when translating 'Val or 'Value. */
8398 /* Range checks can only be applied to types with ranges. */
8402 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
8403 we can't do anything since we might be truncating the bounds. No
8404 check is needed in this case. */
8410 /* Checked expressions must be evaluated only once. */
8413 /* Note that the form of the check is
8414 (not (expr >= lo)) or (not (expr <= hi))
8415 the reason for this slightly convoluted form is that NaNs
8416 are not considered to be in range in the float case. */
8417 return emit_check
8419 invert_truthvalue
8423 TYPE_MIN_VALUE
8425 invert_truthvalue
8429 TYPE_MAX_VALUE
8432 }
8433 \f
8434 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object which
8435 we are about to index, GNU_EXPR is the index expression to be checked,
8436 GNU_LOW and GNU_HIGH are the lower and upper bounds against which GNU_EXPR
8437 has to be checked. Note that for index checking we cannot simply use the
8438 emit_range_check function (although very similar code needs to be generated
8439 in both cases) since for index checking the array type against which we are
8440 checking the indices may be unconstrained and consequently we need to get
8441 the actual index bounds from the array object itself (GNU_ARRAY_OBJECT).
8442 The place where we need to do that is in subprograms having unconstrained
8443 array formal parameters. GNAT_NODE is the GNAT node conveying the source
8444 location for which the error should be signaled. */
8446 static tree
8449 {
8450 tree gnu_expr_check;
8452 /* Checked expressions must be evaluated only once. */
8455 /* Must do this computation in the base type in case the expression's
8456 type is an unsigned subtypes. */
8459 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
8460 the object we are handling. */
8464 return emit_check
8467 gnu_expr_check,
8469 gnu_low)),
8471 gnu_expr_check,
8473 gnu_high))),
8475 }
8476 \f
8477 /* GNU_COND contains the condition corresponding to an access, discriminant or
8478 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR if
8479 GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
8480 REASON is the code that says why the exception was raised. GNAT_NODE is
8481 the GNAT node conveying the source location for which the error should be
8482 signaled. */
8484 static tree
8486 {
8487 tree gnu_call
8489 tree gnu_result
8493 gnu_expr);
8495 /* GNU_RESULT has side effects if and only if GNU_EXPR has:
8496 we don't need to evaluate it just for the check. */
8500 }
8501 \f
8502 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
8503 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
8504 GNAT_TYPE is known to be an integral type. If TRUNCATE_P true, do a
8505 float to integer conversion with truncation; otherwise round.
8506 GNAT_NODE is the GNAT node conveying the source location for which the
8507 error should be signaled. */
8509 static tree
8512 {
8519 /* If we are not doing any checks, the output is an integral type and the
8520 input is not a floating-point type, just do the conversion. This is
8521 required for packed array types and is simpler in all cases anyway. */
8523 && !overflowp
8528 /* First convert the expression to its base type. This
8529 will never generate code, but makes the tests below much simpler.
8530 But don't do this if converting from an integer type to an unconstrained
8531 array type since then we need to get the bounds from the original
8532 (unpacked) type. */
8536 /* If overflow checks are requested, we need to be sure the result will
8537 fit in the output base type. But don't do this if the input
8538 is integer and the output floating-point. */
8541 {
8542 /* Ensure GNU_EXPR only gets evaluated once. */
8550 /* Convert the lower bounds to signed types, so we're sure we're
8551 comparing them properly. Likewise, convert the upper bounds
8552 to unsigned types. */
8566 /* Check each bound separately and only if the result bound
8567 is tighter than the bound on the input type. Note that all the
8568 types are base types, so the bounds must be constant. Also,
8569 the comparison is done in the base type of the input, which
8570 always has the proper signedness. First check for input
8571 integer (which means output integer), output float (which means
8572 both float), or mixed, in which case we always compare.
8573 Note that we have to do the comparison which would *fail* in the
8574 case of an error since if it's an FP comparison and one of the
8575 values is a NaN or Inf, the comparison will fail. */
8582 gnu_cond
8583 = invert_truthvalue
8586 gnu_out_lb)));
8594 gnu_cond
8596 invert_truthvalue
8598 gnu_input,
8600 gnu_out_ub))));
8605 }
8607 /* Now convert to the result base type. If this is a non-truncating
8608 float-to-integer conversion, round. */
8612 {
8618 /* The following calculations depend on proper rounding to even
8619 of each arithmetic operation. In order to prevent excess
8620 precision from spoiling this property, use the widest hardware
8621 floating-point type if FP_ARITH_MAY_WIDEN is true. */
8622 calc_type
8625 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
8629 half_minus_pred_half);
8632 /* If the input is strictly negative, subtract this value
8633 and otherwise add it from the input. For 0.5, the result
8634 is exactly between 1.0 and the machine number preceding 1.0
8635 (for calc_type). Since the last bit of 1.0 is even, this 0.5
8636 will round to 1.0, while all other number with an absolute
8637 value less than 0.5 round to 0.0. For larger numbers exactly
8638 halfway between integers, rounding will always be correct as
8639 the true mathematical result will be closer to the higher
8640 integer compared to the lower one. So, this constant works
8641 for all floating-point numbers.
8643 The reason to use the same constant with subtract/add instead
8644 of a positive and negative constant is to allow the comparison
8645 to be scheduled in parallel with retrieval of the constant and
8646 conversion of the input to the calc_type (if necessary). */
8651 gnu_comp
8653 gnu_add_pred_half
8655 gnu_subtract_pred_half
8659 }
8665 else
8668 /* Finally, do the range check if requested. Note that if the result type
8669 is a modular type, the range check is actually an overflow check. */
8676 }
8677 \f
8678 /* Return true if GNU_EXPR can be directly addressed. This is the case
8679 unless it is an expression involving computation or if it involves a
8680 reference to a bitfield or to an object not sufficiently aligned for
8681 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
8682 be directly addressed as an object of this type.
8684 *** Notes on addressability issues in the Ada compiler ***
8686 This predicate is necessary in order to bridge the gap between Gigi
8687 and the middle-end about addressability of GENERIC trees. A tree
8688 is said to be addressable if it can be directly addressed, i.e. if
8689 its address can be taken, is a multiple of the type's alignment on
8690 strict-alignment architectures and returns the first storage unit
8691 assigned to the object represented by the tree.
8693 In the C family of languages, everything is in practice addressable
8694 at the language level, except for bit-fields. This means that these
8695 compilers will take the address of any tree that doesn't represent
8696 a bit-field reference and expect the result to be the first storage
8697 unit assigned to the object. Even in cases where this will result
8698 in unaligned accesses at run time, nothing is supposed to be done
8699 and the program is considered as erroneous instead (see PR c/18287).
8701 The implicit assumptions made in the middle-end are in keeping with
8702 the C viewpoint described above:
8703 - the address of a bit-field reference is supposed to be never
8704 taken; the compiler (generally) will stop on such a construct,
8705 - any other tree is addressable if it is formally addressable,
8706 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
8708 In Ada, the viewpoint is the opposite one: nothing is addressable
8709 at the language level unless explicitly declared so. This means
8710 that the compiler will both make sure that the trees representing
8711 references to addressable ("aliased" in Ada parlance) objects are
8712 addressable and make no real attempts at ensuring that the trees
8713 representing references to non-addressable objects are addressable.
8715 In the first case, Ada is effectively equivalent to C and handing
8716 down the direct result of applying ADDR_EXPR to these trees to the
8717 middle-end works flawlessly. In the second case, Ada cannot afford
8718 to consider the program as erroneous if the address of trees that
8719 are not addressable is requested for technical reasons, unlike C;
8720 as a consequence, the Ada compiler must arrange for either making
8721 sure that this address is not requested in the middle-end or for
8722 compensating by inserting temporaries if it is requested in Gigi.
8724 The first goal can be achieved because the middle-end should not
8725 request the address of non-addressable trees on its own; the only
8726 exception is for the invocation of low-level block operations like
8727 memcpy, for which the addressability requirements are lower since
8728 the type's alignment can be disregarded. In practice, this means
8729 that Gigi must make sure that such operations cannot be applied to
8730 non-BLKmode bit-fields.
8732 The second goal is achieved by means of the addressable_p predicate,
8733 which computes whether a temporary must be inserted by Gigi when the
8734 address of a tree is requested; if so, the address of the temporary
8735 will be used in lieu of that of the original tree and some glue code
8736 generated to connect everything together. */
8738 static bool
8740 {
8741 /* For an integral type, the size of the actual type of the object may not
8742 be greater than that of the expected type, otherwise an indirect access
8743 in the latter type wouldn't correctly set all the bits of the object. */
8749 /* The size of the actual type of the object may not be smaller than that
8750 of the expected type, otherwise an indirect access in the latter type
8751 would be larger than the object. But only record types need to be
8752 considered in practice for this case. */
8759 {
8764 /* All DECLs are addressable: if they are in a register, we can force
8765 them to memory. */
8770 /* Taking the address of a dereference yields the original pointer. */
8775 /* Taking the address yields a pointer to the constant pool. */
8779 /* Taking the address of a static constructor yields a pointer to the
8780 tree constant pool. */
8792 /* All rvalues are deemed addressable since taking their address will
8793 force a temporary to be created by the middle-end. */
8797 /* The address of a compound expression is that of its 2nd operand. */
8801 /* We accept &COND_EXPR as soon as both operands are addressable and
8802 expect the outcome to be the address of the selected operand. */
8808 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
8809 the field is sufficiently aligned, in case it is subject
8810 to a pragma Component_Alignment. But we don't need to
8811 check the alignment of the containing record, as it is
8812 guaranteed to be not smaller than that of its most
8813 aligned field that is not a bit-field. */
8814 && (!STRICT_ALIGNMENT
8817 /* The field of a padding record is always addressable. */
8831 {
8832 /* This is addressable if we can avoid a copy. */
8836 && (!STRICT_ALIGNMENT
8841 && (!STRICT_ALIGNMENT
8847 }
8851 }
8852 }
8853 \f
8854 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
8855 a separate Freeze node exists, delay the bulk of the processing. Otherwise
8856 make a GCC type for GNAT_ENTITY and set up the correspondence. */
8858 void
8860 {
8861 tree gnu_old
8863 tree gnu_new;
8865 /* If we are to delay elaboration of this type, just do any
8866 elaborations needed for expressions within the declaration and
8867 make a dummy type entry for this node and its Full_View (if
8868 any) in case something points to it. Don't do this if it
8869 has already been done (the only way that can happen is if
8870 the private completion is also delayed). */
8876 {
8880 {
8885 {
8889 }
8890 }
8893 }
8895 /* If we saved away a dummy type for this node it means that this
8896 made the type that corresponds to the full type of an incomplete
8897 type. Clear that type for now and then update the type in the
8898 pointers. */
8900 {
8905 }
8907 /* Now fully elaborate the type. */
8911 /* If we have an old type and we've made pointers to this type, update those
8912 pointers. If this is a Taft amendment type in the main unit, we need to
8913 mark the type as used since other units referencing it don't see the full
8914 declaration and, therefore, cannot mark it as used themselves. */
8916 {
8921 }
8923 /* If this is a record type corresponding to a task or protected type
8924 that is a completion of an incomplete type, perform a similar update
8925 on the type. ??? Including protected types here is a guess. */
8929 {
8930 tree gnu_task_old
8940 }
8941 }
8942 \f
8943 /* GNAT_ENTITY is the type of the resulting constructor, GNAT_ASSOC is the
8944 front of the Component_Associations of an N_Aggregate and GNU_TYPE is the
8945 GCC type of the corresponding record type. Return the CONSTRUCTOR. */
8947 static tree
8949 {
8952 /* We test for GNU_FIELD being empty in the case where a variant
8953 was the last thing since we don't take things off GNAT_ASSOC in
8954 that case. We check GNAT_ASSOC in case we have a variant, but it
8955 has no fields. */
8958 {
8963 /* The expander is supposed to put a single component selector name
8964 in every record component association. */
8967 /* Ignore fields that have Corresponding_Discriminants since we'll
8968 be setting that field in the parent. */
8973 /* Also ignore discriminants of Unchecked_Unions. */
8978 /* Before assigning a value in an aggregate make sure range checks
8979 are done if required. Then convert to the type of the field. */
8985 /* Add the field and expression to the list. */
8987 }
8991 #ifdef ENABLE_CHECKING
8992 /* Verify that every entry in GNU_LIST was used. */
8995 #endif
8998 }
9000 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
9001 the first element of an array aggregate. It may itself be an aggregate.
9002 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
9003 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
9004 for range checking. */
9006 static tree
9008 Entity_Id gnat_component_type)
9009 {
9011 tree gnu_expr;
9015 {
9016 /* If the expression is itself an array aggregate then first build the
9017 innermost constructor if it is part of our array (multi-dimensional
9018 case). */
9024 gnat_component_type);
9025 else
9026 {
9029 /* Before assigning the element to the array, make sure it is
9030 in range. */
9033 }
9040 integer_one_node));
9041 }
9044 }
9045 \f
9046 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
9047 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
9048 of the associations that are from RECORD_TYPE. If we see an internal
9049 record, make a recursive call to fill it in as well. */
9051 static tree
9053 {
9058 {
9061 /* _Parent is an internal field, but may have values in the aggregate,
9062 so check for values first. */
9064 {
9067 }
9070 {
9075 }
9076 else
9077 /* If we have a record subtype, the names will match, but not the
9078 actual FIELD_DECLs. */
9081 {
9084 }
9090 }
9093 }
9094 \f
9095 /* Process a N_Validate_Unchecked_Conversion node. */
9097 static void
9099 {
9103 /* If the target is a pointer type, see if we are either converting from a
9104 non-pointer or from a pointer to a type with a different alias set and
9105 warn if so, unless the pointer has been marked to alias everything. */
9108 {
9118 target_alias_set)))
9119 {
9123 gnat_node);
9126 }
9127 }
9129 /* Likewise if the target is a fat pointer type, but we have no mechanism to
9130 mitigate the problem in this case, so we unconditionally warn. */
9132 {
9133 tree gnu_source_desig_type
9137 tree gnu_target_desig_type
9144 target_alias_set)))
9145 {
9149 gnat_node);
9150 }
9151 }
9152 }
9153 \f
9154 /* EXP is to be treated as an array or record. Handle the cases when it is
9155 an access object and perform the required dereferences. */
9157 static tree
9159 {
9160 /* If the type is a pointer, dereference it. */
9165 /* If we got a padded type, remove it too. */
9170 }
9171 \f
9172 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
9173 location and false if it doesn't. In the former case, set the Gigi global
9174 variable REF_FILENAME to the simple debug file name as given by sinput.
9175 If clear_column is true, set column information to 0. */
9177 static bool
9179 {
9184 {
9187 }
9188 else
9189 {
9195 /* We can have zero if pragma Source_Reference is in effect. */
9199 /* Translate the location. */
9201 }
9203 ref_filename
9204 = IDENTIFIER_POINTER
9205 (get_identifier
9209 }
9211 /* Similar to the above, not clearing the column information. */
9213 bool
9215 {
9217 }
9219 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
9220 don't do anything if it doesn't correspond to a source location. */
9222 static void
9224 {
9225 location_t locus;
9231 }
9233 /* Similar to the above, not clearing the column information. */
9235 static void
9237 {
9239 }
9241 /* More elaborate version of set_expr_location_from_node to be used in more
9242 general contexts, for example the result of the translation of a generic
9243 GNAT node. */
9245 static void
9247 {
9248 /* Set the location information on the node if it is a real expression.
9249 References can be reused for multiple GNAT nodes and they would get
9250 the location information of their last use. Also make sure not to
9251 overwrite an existing location as it is probably more precise. */
9254 {
9255 CASE_CONVERT:
9264 /* ... fall through ... */
9268 {
9271 }
9273 }
9274 }
9275 \f
9276 /* Return a colon-separated list of encodings contained in encoded Ada
9277 name. */
9281 {
9285 }
9287 /* Extract the Ada name from an encoded name. */
9291 {
9295 }
9296 \f
9297 /* Post an error message. MSG is the error message, properly annotated.
9298 NODE is the node at which to post the error and the node to use for the
9299 '&' substitution. */
9301 void
9303 {
9304 String_Template temp;
9305 String_Pointer sp;
9315 }
9317 /* Similar to post_error, but NODE is the node at which to post the error and
9318 ENT is the node to use for the '&' substitution. */
9320 void
9322 {
9323 String_Template temp;
9324 String_Pointer sp;
9334 }
9336 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
9338 void
9340 {
9343 }
9345 /* Set the end_locus information for GNU_NODE, if any, from an explicit end
9346 location associated with GNAT_NODE or GNAT_NODE itself, whichever makes
9347 most sense. Return true if a sensible assignment was performed. */
9349 static bool
9351 {
9353 location_t end_locus;
9355 /* Pick the GNAT node of which we'll take the sloc to assign to the GCC node
9356 end_locus when there is one. We consider only GNAT nodes with a possible
9357 End_Label attached. If the End_Label actually was unassigned, fallback
9358 on the original node. We'd better assign an explicit sloc associated with
9359 the outer construct in any case. */
9362 {
9375 }
9379 /* Some expanded subprograms have neither an End_Label nor a Sloc
9380 attached. Notify that to callers. For a block statement with no
9381 End_Label, clear column information, so that the tree for a
9382 transient block does not receive the sloc of a source condition. */
9390 {
9401 }
9402 }
9403 \f
9404 /* Similar to post_error_ne, but T is a GCC tree representing the number to
9405 write. If T represents a constant, the text inside curly brackets in
9406 MSG will be output (presumably including a '^'). Otherwise it will not
9407 be output and the text inside square brackets will be output instead. */
9409 void
9411 {
9418 {
9421 }
9422 else
9426 {
9432 ;
9433 else
9435 }
9440 }
9442 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
9444 void
9447 {
9450 }
9451 \f
9452 /* Initialize the table that maps GNAT codes to GCC codes for simple
9453 binary and unary operations. */
9455 static void
9457 {
9483 }
9485 /* Return a label to branch to for the exception type in KIND or NULL_TREE
9486 if none. */
9488 tree
9490 {
9497 else
9499 }
9501 /* Return the decl for the current elaboration procedure. */
9503 tree
9505 {
9507 }