| blob | fbdced57a0affe6b9f643f7b246974c16426e20d |
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * T R A N S *
6 * *
7 * C Implementation File *
8 * *
9 * Copyright (C) 1992-2018, 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 ****************************************************************************/
69 /* We should avoid allocating more than ALLOCA_THRESHOLD bytes via alloca,
70 for fear of running out of stack space. If we need more, we use xmalloc
71 instead. */
72 #define ALLOCA_THRESHOLD 1000
74 /* Pointers to front-end tables accessed through macros. */
85 /* Highest number in the front-end node table. */
88 /* Current node being treated, in case abort called. */
89 Node_Id error_gnat_node;
91 /* True when gigi is being called on an analyzed but unexpanded
92 tree, and the only purpose of the call is to properly annotate
93 types with representation information. */
96 /* List of N_Validate_Unchecked_Conversion nodes in the unit. */
99 /* When not optimizing, we cache the 'First, 'Last and 'Length attributes
100 of unconstrained array IN parameters to avoid emitting a great deal of
101 redundant instructions to recompute them each time. */
105 tree first;
106 tree last;
107 tree length;
108 };
115 bitmap named_ret_val;
118 };
120 #define f_parm_attr_cache \
121 DECL_STRUCT_FUNCTION (current_function_decl)->language->parm_attr_cache
123 #define f_named_ret_val \
124 DECL_STRUCT_FUNCTION (current_function_decl)->language->named_ret_val
126 #define f_other_ret_val \
127 DECL_STRUCT_FUNCTION (current_function_decl)->language->other_ret_val
129 #define f_gnat_ret \
130 DECL_STRUCT_FUNCTION (current_function_decl)->language->gnat_ret
132 /* A structure used to gather together information about a statement group.
133 We use this to gather related statements, for example the "then" part
134 of a IF. In the case where it represents a lexical scope, we may also
135 have a BLOCK node corresponding to it and/or cleanups. */
142 };
146 /* List of unused struct stmt_group nodes. */
149 /* A structure used to record information on elaboration procedures
150 we've made and need to process.
152 ??? gnat_node should be Node_Id, but gengtype gets confused. */
158 };
162 /* Stack of exception pointer variables. Each entry is the VAR_DECL
163 that stores the address of the raised exception. Nonzero means we
164 are in an exception handler. Not used in the zero-cost case. */
167 /* In ZCX case, current exception pointer. Used to re-raise it. */
170 /* Stack for storing the current elaboration procedure decl. */
173 /* Stack of labels to be used as a goto target instead of a return in
174 some functions. See processing for N_Subprogram_Body. */
177 /* Stack of variable for the return value of a function with copy-in/copy-out
178 parameters. See processing for N_Subprogram_Body. */
181 /* Structure used to record information for a range check. */
183 tree low_bound;
184 tree high_bound;
185 tree disp;
187 tree type;
188 tree invariant_cond;
189 tree inserted_cond;
190 };
195 /* Structure used to record information for a loop. */
197 tree stmt;
198 tree loop_var;
199 tree low_bound;
200 tree high_bound;
205 };
210 /* Stack of loop_info structures associated with LOOP_STMT nodes. */
213 /* The stacks for N_{Push,Pop}_*_Label. */
218 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
253 /* Hooks for debug info back-ends, only supported and used in a restricted set
254 of configurations. */
257 \f
258 /* This is the main program of the back-end. It sets up all the table
259 structures and then generates code. */
261 void
274 Nat number_file,
276 Entity_Id standard_boolean,
277 Entity_Id standard_integer,
278 Entity_Id standard_character,
279 Entity_Id standard_long_long_float,
280 Entity_Id standard_exception_type,
281 Int gigi_operating_mode)
282 {
283 Node_Id gnat_iter;
284 Entity_Id gnat_literal;
304 {
305 /* Use the identifier table to make a permanent copy of the filename as
306 the name table gets reallocated after Gigi returns but before all the
307 debugging information is output. The __gnat_to_canonical_file_spec
308 call translates filenames from pragmas Source_Reference that contain
309 host style syntax not understood by gdb. */
311 = IDENTIFIER_POINTER
312 (get_identifier
313 (__gnat_to_canonical_file_spec
316 /* We rely on the order isomorphism between files and line maps. */
319 /* We create the line map for a source file at once, with a fixed number
320 of columns chosen to avoid jumping over the next power of 2. */
325 }
329 /* Declare the name of the compilation unit as the first global
330 name in order to make the middle-end fully deterministic. */
334 /* Initialize ourselves. */
339 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
340 errors. */
342 {
345 }
347 /* Enable GNAT stack checking method if needed */
351 /* Retrieve alignment settings. */
355 /* Record the builtin types. Define `integer' and `character' first so that
356 dbx will output them first. */
362 /* Save the type we made for integer as the type for Standard.Integer. */
367 /* Likewise for character as the type for Standard.Character. */
373 /* Likewise for boolean as the type for Standard.Boolean. */
392 /* Declare the building blocks of function nodes. */
397 /* Now declare run-time functions. */
398 malloc_decl
401 NULL_TREE),
406 free_decl
413 realloc_decl
417 NULL_TREE),
421 /* This is used for 64-bit multiplication with overflow checking. */
423 mulv64_decl
430 /* Name of the _Parent field in tagged record types. */
433 /* Name of the Exception_Data type defined in System.Standard_Library. */
434 exception_data_name_id
437 /* Make the types and functions used for exception processing. */
440 jmpbuf_type
446 /* Functions to get and set the jumpbuf pointer for the current thread. */
447 get_jmpbuf_decl
448 = create_subprog_decl
453 set_jmpbuf_decl
454 = create_subprog_decl
457 NULL_TREE),
460 get_excptr_decl
461 = create_subprog_decl
464 NULL_TREE),
470 {
473 }
476 /* setjmp returns an integer and has one operand, which is a pointer to
477 a jmpbuf. */
478 setjmp_decl
479 = create_subprog_decl
482 NULL_TREE),
487 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
488 address. */
489 update_setjmp_buf_decl
490 = create_subprog_decl
497 /* Indicate that it never returns. */
500 NULL_TREE);
502 raise_nodefer_decl
503 = create_subprog_decl
507 set_exception_parameter_decl
508 = create_subprog_decl
511 NULL_TREE),
514 /* Hooks to call when entering/leaving an exception handler. */
517 begin_handler_decl
521 Empty);
522 /* __gnat_begin_handler is a dummy procedure. */
525 end_handler_decl
529 Empty);
531 unhandled_except_decl
535 Empty);
537 /* Indicate that it never returns. */
539 reraise_zcx_decl
543 Empty);
545 /* Dummy objects to materialize "others" and "all others" in the exception
546 tables. These are exported by a-exexpr-gcc.adb, so see this unit for
547 the types to use. */
548 others_decl
555 all_others_decl
562 unhandled_others_decl
569 /* If in no exception handlers mode, all raise statements are redirected to
570 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
571 this procedure will never be called in this mode. */
573 {
574 /* Indicate that it never returns. */
579 tree decl
580 = create_subprog_decl
583 Empty);
586 }
587 else
588 {
589 /* Otherwise, make one decl for each exception reason. */
595 i == CE_Index_Check_Failed
599 }
601 /* Build the special descriptor type and its null node if needed. */
603 {
615 {
616 tree field
623 elt--;
624 }
629 }
631 longest_float_type_node
636 /* If we are using the GCC exception mechanism, let GCC know. */
640 /* Initialize the GCC support for FP operations. */
643 /* Install the builtins we might need, either internally or as user-available
644 facilities for Intrinsic imports. Note that this must be done after the
645 GCC exception mechanism is initialized. */
654 /* Process any Pragma Ident for the main unit. */
659 /* Force -fno-strict-aliasing if the configuration pragma was seen. */
663 /* Save the current optimization options again after the above possible
664 global_options changes. */
668 /* Now translate the compilation unit proper. */
671 /* Disable -Waggressive-loop-optimizations since we implement our own
672 version of the warning. */
675 /* Then process the N_Validate_Unchecked_Conversion nodes. We do this at
676 the very end to avoid having to second-guess the front-end when we run
677 into dummy nodes during the regular processing. */
682 /* Finally see if we have any elaboration procedures to deal with. */
684 {
687 /* We should have a BIND_EXPR but it may not have any statements in it.
688 If it doesn't have any, we have nothing to do except for setting the
689 flag on the GNAT node. Otherwise, process the function as others. */
695 else
696 {
700 }
701 }
703 /* Destroy ourselves. */
707 /* We cannot track the location of errors past this point. */
709 }
710 \f
711 /* Return a subprogram decl corresponding to __gnat_rcheck_xx for the given
712 CHECK if KIND is EXCEPTION_SIMPLE, or else to __gnat_rcheck_xx_ext. */
714 static tree
716 {
725 {
727 ftype
731 }
732 else
733 {
738 ftype
743 }
745 /* Indicate that it never returns. */
747 result
753 }
754 \f
755 /* Return a positive value if an lvalue is required for GNAT_NODE, which is
756 an N_Attribute_Reference. */
758 static int
760 {
762 {
802 }
803 }
805 /* Return a positive value if an lvalue is required for GNAT_NODE. GNU_TYPE
806 is the type that will be used for GNAT_NODE in the translated GNU tree.
807 CONSTANT indicates whether the underlying object represented by GNAT_NODE
808 is constant in the Ada sense. If it is, ADDRESS_OF_CONSTANT indicates
809 whether its value is the address of a constant and ALIASED whether it is
810 aliased. If it isn't, ADDRESS_OF_CONSTANT and ALIASED are ignored.
812 The function climbs up the GNAT tree starting from the node and returns 1
813 upon encountering a node that effectively requires an lvalue downstream.
814 It returns int instead of bool to facilitate usage in non-purely binary
815 logic contexts. */
817 static int
820 {
824 {
834 /* If the parameter is by reference, an lvalue is required. */
840 /* Only the array expression can require an lvalue. */
844 /* ??? Consider that referencing an indexed component with a variable
845 index forces the whole aggregate to memory. Note that testing only
846 for literals is conservative, any static expression in the RM sense
847 could probably be accepted with some additional work. */
857 /* ... fall through ... */
860 /* Only the array expression can require an lvalue. */
874 /* We need to preserve addresses through a renaming. */
878 /* We cannot use a constructor if this is an atomic object because
879 the actual assignment might end up being done component-wise. */
883 /* We don't use a constructor if this is a class-wide object
884 because the effective type of the object is the equivalent
885 type of the class-wide subtype and it smashes most of the
886 data into an array of bytes to which we cannot convert. */
891 /* We cannot use a constructor if the LHS is an atomic object because
892 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 {
991 /* If the index is not itself constant, then nothing can be folded. */
1012 }
1015 }
1017 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Identifier,
1018 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer
1019 to where we should place the result type. */
1021 static tree
1023 {
1027 /* Whether we should require an lvalue for GNAT_NODE. Needed in
1028 specific circumstances only, so evaluated lazily. < 0 means
1029 unknown, > 0 means known true, 0 means known false. */
1032 /* If GNAT_NODE is a constant, whether we should use the initialization
1033 value instead of the constant entity, typically for scalars with an
1034 address clause when the parent doesn't require an lvalue. */
1037 /* If the Etype of this node is not the same as that of the Entity, then
1038 something went wrong, probably in generic instantiation. However, this
1039 does not apply to types. Since we sometime have strange Ekind's, just
1040 do this test for objects. Moreover, if the Etype of the Entity is private
1041 or incomplete coming from a limited context, the Etype of the N_Identifier
1042 is allowed to be the full/non-limited view and we also consider a packed
1043 array type to be the same as the original type. Similarly, a CW type is
1044 equivalent to a subtype of itself. Finally, if the types are Itypes, one
1045 may be a copy of the other, which is also legal. */
1061 == Packed_Array_Impl_Type
1074 /* If this is a reference to a deferred constant whose partial view is an
1075 unconstrained private type, the proper type is on the full view of the
1076 constant, not on the full view of the type, which may be unconstrained.
1078 This may be a reference to a type, for example in the prefix of the
1079 attribute Position, generated for dispatching code (see Make_DT in
1080 exp_disp,adb). In that case we need the type itself, not is parent,
1081 in particular if it is a derived type */
1088 {
1091 }
1092 else
1093 {
1094 /* We want to use the Actual_Subtype if it has already been elaborated,
1095 otherwise the Etype. Avoid using Actual_Subtype for packed arrays to
1096 simplify things. */
1104 else
1106 }
1108 /* Expand the type of this identifier first, in case it is an enumeral
1109 literal, which only get made when the type is expanded. There is no
1110 order-of-elaboration issue here. */
1113 /* If this is a non-imported elementary constant with an address clause,
1114 retrieve the value instead of a pointer to be dereferenced unless
1115 an lvalue is required. This is generally more efficient and actually
1116 required if this is a static expression because it might be used
1117 in a context where a dereference is inappropriate, such as a case
1118 statement alternative or a record discriminant. There is no possible
1119 volatile-ness short-circuit here since Volatile constants must be
1120 imported per C.6. */
1125 {
1129 }
1132 {
1133 /* If this is a deferred constant, the initializer is attached to
1134 the full view. */
1139 }
1140 else
1143 /* Some objects (such as parameters passed by reference, globals of
1144 variable size, and renamed objects) actually represent the address
1145 of the object. In that case, we must do the dereference. Likewise,
1146 deal with parameters to foreign convention subprograms. */
1151 {
1154 /* If it's a PARM_DECL to foreign convention subprogram, convert it. */
1157 gnu_result
1160 /* If it's a CONST_DECL, return the underlying constant like below. */
1167 /* If it's a renaming pointer, get to the renamed object. */
1173 /* Otherwise, do the final dereference. */
1174 else
1175 {
1185 }
1186 }
1188 /* If we have a constant declaration and its initializer, try to return the
1189 latter to avoid the need to call fold in lots of places and the need for
1190 elaboration code if this identifier is used as an initializer itself. */
1192 {
1198 /* If there is a (corresponding) variable or this is the address of a
1199 constant, we only want to return the initializer if an lvalue isn't
1200 required. Evaluate this now if we have not already done so. */
1202 require_lvalue
1206 /* Finally retrieve the initializer if this is deemed valid. */
1209 }
1211 /* But for a constant renaming we couldn't do that incrementally for its
1212 definition because of the need to return an lvalue so, if the present
1213 context doesn't itself require an lvalue, we try again here. */
1217 {
1219 require_lvalue
1224 }
1226 /* The GNAT tree has the type of a function set to its result type, so we
1227 adjust here. Also use the type of the result if the Etype is a subtype
1228 that is nominally unconstrained. Likewise if this is a deferred constant
1229 of a discriminated type whose full view can be elaborated statically, to
1230 avoid problematic conversions to the nominal subtype. But remove any
1231 padding from the resulting type. */
1238 {
1242 }
1247 }
1248 \f
1249 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Pragma. Return
1250 any statements we generate. */
1252 static tree
1254 {
1257 Node_Id gnat_temp;
1259 /* Do nothing if we are just annotating types and check for (and ignore)
1260 unrecognized pragmas. */
1267 {
1269 /* Do nothing at top level: all such variables are already viewable. */
1276 {
1280 machine_mode mode;
1281 scalar_int_mode int_mode;
1283 #ifdef ASM_COMMENT_START
1285 #endif
1290 /* Use the value only if it fits into a normal register,
1291 otherwise use the address. */
1299 #ifdef ASM_COMMENT_START
1305 NULL);
1308 #endif
1310 asm_constraint,
1311 NULL_TREE,
1312 tree_cons
1320 }
1327 {
1331 {
1354 }
1355 }
1361 {
1379 }
1389 {
1390 Node_Id gnat_expr;
1391 /* Preserve the location of the pragma. */
1395 diagnostic_t kind;
1400 /* This is the String form: pragma Warning{s|_As_Error}(String). */
1402 {
1404 {
1417 }
1420 }
1422 /* This is the On/Off form: pragma Warnings (On | Off [,String]). */
1424 {
1426 {
1437 }
1439 /* Deal with optional pattern (but ignore Reason => "..."). */
1442 {
1443 /* pragma Warnings (On | Off, Name) is handled differently. */
1448 }
1449 else
1453 }
1455 else
1458 /* This is the same implementation as in the C family of compilers. */
1462 {
1470 {
1473 }
1475 {
1478 }
1480 {
1483 }
1486 }
1487 else
1494 }
1499 }
1502 }
1503 \f
1505 /* Check the inline status of nested function FNDECL wrt its parent function.
1507 If a non-inline nested function is referenced from an inline external
1508 function, we cannot honor both requests at the same time without cloning
1509 the nested function in the current unit since it is private to its unit.
1510 We could inline it as well but it's probably better to err on the side
1511 of too little inlining.
1513 This must be done only on nested functions present in the source code
1514 and not on nested functions generated by the compiler, e.g. finalizers,
1515 because they may be not marked inline and we don't want them to block
1516 the inlining of the parent function. */
1518 static void
1520 {
1529 {
1534 {
1537 }
1538 else
1539 {
1541 fndecl);
1543 }
1547 }
1548 }
1549 \f
1550 /* Return an expression for the length of TYPE, an integral type, computed in
1551 RESULT_TYPE, another integral type.
1553 We used to compute the length as MAX (hb - lb + 1, 0) which could overflow
1554 when lb == TYPE'First. We now compute it as (hb >= lb) ? hb - lb + 1 : 0
1555 which would only overflow in much rarer cases, for extremely large arrays
1556 we expect never to encounter in practice. Besides, the former computation
1557 required the use of potentially constraining signed arithmetics while the
1558 latter does not. Note that the comparison must be done in the original
1559 base index type in order to avoid any overflow during the conversion. */
1561 static tree
1563 {
1568 tree length
1574 length
1580 }
1582 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Attribute node,
1583 to a GCC tree, which is returned. GNU_RESULT_TYPE_P is a pointer to
1584 where we should place the result type. ATTRIBUTE is the attribute ID. */
1586 static tree
1588 {
1595 /* If the input is a NULL_EXPR, make a new one. */
1597 {
1601 }
1604 {
1607 /* These are just conversions since representation clauses for
1608 enumeration types are handled in the front-end. */
1618 /* These just add or subtract the constant 1 since representation
1619 clauses for enumeration types are handled in the front-end. */
1625 gnu_result
1632 /* Conversions don't change the address of references but can cause
1633 build_unary_op to miss the references below, so strip them off.
1634 On the contrary, if the address-of operation causes a temporary
1635 to be created, then it must be created with the proper type. */
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 {
1720 /* On targets for which function symbols denote a descriptor, the
1721 code address is stored within the first slot of the descriptor
1722 so we do an additional dereference:
1723 result = *((result_type *) result)
1724 where we expect result to be of some pointer type already. */
1726 gnu_result
1729 gnu_result));
1730 }
1732 /* For 'Access, issue an error message if the prefix is a C++ method
1733 since it can use a special calling convention on some platforms,
1734 which cannot be propagated to the access type. */
1739 gnat_node);
1741 /* For other address attributes applied to a nested function,
1742 find an inner ADDR_EXPR and annotate it so that we can issue
1743 a useful warning with -Wtrampolines. */
1745 {
1750 {
1753 /* Also check the inlining status. */
1756 /* Moreover, for 'Access or 'Unrestricted_Access with non-
1757 foreign-compatible representation, mark the ADDR_EXPR so
1758 that we can build a descriptor instead of a trampoline. */
1765 /* Otherwise, we need to check that we are not violating the
1766 No_Implicit_Dynamic_Code restriction. */
1769 }
1770 }
1774 {
1776 tree gnu_obj_type;
1780 /* If this is fat pointer, the object must have been allocated with the
1781 template in front of the array. So compute the template address; do
1782 it by converting to a thin pointer. */
1784 gnu_ptr
1786 (TYPE_OBJECT_RECORD_TYPE
1788 gnu_ptr);
1792 /* If this is a thin pointer, the object must have been allocated with
1793 the template in front of the array. So compute the template address
1794 and return it. */
1796 gnu_ptr
1798 gnu_ptr,
1800 byte_position
1801 (DECL_CHAIN
1805 }
1814 /* Remove NOPs and conversions between original and packable version
1815 from GNU_EXPR, and conversions from GNU_PREFIX. We use GNU_EXPR
1816 to see if a COMPONENT_REF was involved. */
1821 == RECORD_TYPE
1830 /* Replace an unconstrained array type with the type of the underlying
1831 array. We can't do this with a call to maybe_unconstrained_array
1832 since we may have a TYPE_DECL. For 'Max_Size_In_Storage_Elements,
1833 use the record type that will be used to allocate the object and its
1834 template. */
1836 {
1840 }
1842 /* If we're looking for the size of a field, return the field size. */
1846 /* Otherwise, if the prefix is an object, or if we are looking for
1847 'Object_Size or 'Max_Size_In_Storage_Elements, the result is the
1848 GCC size of the type. We make an exception for padded objects,
1849 as we do not take into account alignment promotions for the size.
1850 This is in keeping with the object case of gnat_to_gnu_entity. */
1857 {
1858 /* If this is a dereference and we have a special dynamic constrained
1859 subtype on the prefix, use it to compute the size; otherwise, use
1860 the designated subtype. */
1862 {
1863 Node_Id gnat_actual_subtype
1865 tree gnu_ptr_type
1870 {
1871 tree gnu_actual_obj_type
1873 gnu_type
1875 gnu_actual_obj_type,
1878 }
1879 }
1882 }
1884 /* Otherwise, the result is the RM size of the type. */
1885 else
1888 /* Deal with a self-referential size by returning the maximum size for
1889 a type and by qualifying the size with the object otherwise. */
1891 {
1894 else
1896 }
1898 /* If the type contains a template, subtract its size. */
1904 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1912 {
1925 else
1926 {
1931 /* If the default alignment of "double" or larger scalar types is
1932 specifically capped and there is an alignment clause neither
1933 on the type nor on the prefix itself, return the cap. */
1935 is_capped_double
1938 is_capped_double
1940 else
1950 else
1952 }
1955 }
1964 {
1971 else
1974 }
1976 /* ... fall through ... */
1979 {
1987 /* Make sure any implicit dereference gets done. */
1991 /* We treat unconstrained array In parameters specially. We also note
1992 whether we are dereferencing a pointer to unconstrained array. */
1995 {
1997 /* This is the direct case. */
2003 /* This is the indirect case. Note that we need to be sure that
2004 the access value cannot be null as we'll hoist the load. */
2007 {
2010 }
2011 else
2017 }
2019 /* If the prefix is the view conversion of a constrained array to an
2020 unconstrained form, we retrieve the constrained array because we
2021 might not be able to substitute the PLACEHOLDER_EXPR coming from
2022 the conversion. This can occur with the 'Old attribute applied
2023 to a parameter with an unconstrained type, which gets rewritten
2024 into a constrained local variable very late in the game. */
2027 && !CONTAINS_PLACEHOLDER_P
2030 else
2037 {
2039 tree gnu_type_temp;
2045 ;
2048 }
2055 /* When not optimizing, look up the slot associated with the parameter
2056 and the dimension in the cache and create a new one on failure.
2057 Don't do this when the actual subtype needs debug info (this happens
2058 with -gnatD): in elaborate_expression_1, we create variables that
2059 hold the bounds, so caching attributes isn't very interesting and
2060 causes dependency issues between these variables and cached
2061 expressions. */
2066 {
2072 {
2077 }
2078 }
2080 /* Return the cached expression or build a new one. */
2082 {
2084 {
2087 }
2089 gnu_result
2091 }
2094 {
2096 {
2099 }
2101 gnu_result
2103 }
2106 {
2108 {
2111 }
2113 gnu_result
2115 gnu_result_type);
2116 }
2118 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2119 handling. Note that these attributes could not have been used on
2120 an unconstrained array type. */
2123 /* Cache the expression we have just computed. Since we want to do it
2124 at run time, we force the use of a SAVE_EXPR and let the gimplifier
2125 create the temporary in the outermost binding level. We will make
2126 sure in Subprogram_Body_to_gnu that it is evaluated on all possible
2127 paths by forcing its evaluation on entry of the function. */
2129 {
2130 gnu_result
2133 {
2149 }
2150 }
2152 /* Otherwise, evaluate it each time it is referenced. */
2153 else
2155 {
2158 /* If we are dereferencing a pointer to unconstrained array, we
2159 need to capture the value because the pointed-to bounds may
2160 subsequently be released. */
2162 gnu_result
2168 /* Set the source location onto the predicate of the condition
2169 but not if the expression is cached to avoid messing up the
2170 debug info. */
2174 gnat_node);
2179 }
2182 }
2189 {
2190 poly_int64 bitsize;
2191 poly_int64 bitpos;
2192 tree gnu_offset;
2193 tree gnu_field_bitpos;
2194 tree gnu_field_offset;
2195 tree gnu_inner;
2196 machine_mode mode;
2203 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
2204 the result is 0. Don't allow 'Bit on a bare component, though. */
2208 {
2211 }
2213 else
2222 {
2230 {
2231 gnu_field_bitpos
2234 gnu_field_offset
2237 }
2238 }
2240 {
2243 }
2244 else
2245 {
2248 }
2251 {
2265 /* ??? Avoid a large unsigned result that will overflow when
2266 converted to the signed universal_integer. */
2269 else
2270 gnu_result
2277 }
2279 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2280 handling. */
2283 }
2287 {
2293 /* The result of {MIN,MAX}_EXPR is unspecified if either operand is
2294 a NaN so we implement the semantics of C99 f{min,max} to make it
2295 predictable in this case: if either operand is a NaN, the other
2296 is returned; if both operands are NaN's, a NaN is returned. */
2299 {
2305 /* If the operands have side-effects, they need to be evaluated
2306 only once in spite of the multiple references in the result. */
2314 integer_zero_node);
2318 integer_zero_node);
2328 /* If the operands have side-effects, they need to be evaluated
2329 before doing the tests above since the place they otherwise
2330 would end up being evaluated at run time could be wrong. */
2332 gnu_result
2336 gnu_result
2338 }
2339 else
2343 }
2369 /* Note this size cannot be self-referential. */
2379 /* What we want is the offset of the ARRAY field in the record
2380 that the thin pointer designates. */
2388 /* This is just a zero cast to the pointer type for our prefix and
2389 dereferenced. */
2391 gnu_result
2394 integer_zero_node));
2399 {
2406 {
2411 ;
2412 }
2420 && (DECL_BY_COMPONENT_PTR_P
2424 }
2428 /* We treat Model as identical to Machine. This is true for at least
2429 IEEE and some other nice floating-point systems. */
2431 /* ... fall through ... */
2434 /* The trick is to force the compiler to store the result in memory so
2435 that we do not have extra precision used. But do this only when this
2436 is necessary, i.e. if FP_ARITH_MAY_WIDEN is true and the precision of
2437 the type is lower than that of the longest floating-point type. */
2444 && fp_arith_may_widen
2447 {
2449 tree field
2459 asm_expr
2471 gnu_result
2475 }
2482 /* This can be a random address so build an alias-all pointer type. */
2483 gnu_expr
2486 gnu_expr);
2491 /* This abort means that we have an unimplemented attribute. */
2493 }
2495 /* If this is an attribute where the prefix was unused, force a use of it if
2496 it has a side-effect. But don't do it if the prefix is just an entity
2497 name. However, if an access check is needed, we must do it. See second
2498 example in AARM 11.6(5.e). */
2502 gnu_result
2507 }
2508 \f
2509 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
2510 to a GCC tree, which is returned. */
2512 static tree
2514 {
2516 Node_Id gnat_when;
2517 location_t end_locus;
2525 /* We build a SWITCH_EXPR that contains the code with interspersed
2526 CASE_LABEL_EXPRs for each label. */
2535 {
2537 Node_Id gnat_choice;
2539 /* First compile all the different case choices for the current WHEN
2540 alternative. */
2544 {
2549 {
2564 /* This represents either a subtype range or a static value of
2565 some kind; Ekind says which. */
2567 {
2573 }
2575 /* ... fall through ... */
2587 }
2589 /* Everything should be folded into constants at this point. */
2599 gnat_choice);
2601 }
2603 /* This construct doesn't define a scope so we shouldn't push a binding
2604 level around the statement list. Except that we have always done so
2605 historically and this makes it possible to reduce stack usage. As a
2606 compromise, we keep doing it for case statements, for which this has
2607 never been problematic, but not for case expressions in Ada 2012. */
2609 {
2610 const bool is_case_expression
2612 tree group
2617 {
2622 }
2623 }
2624 }
2626 /* Now emit a definition of the label the cases branch to, if any. */
2632 }
2633 \f
2634 /* Return true if we are in the body of a loop. */
2638 {
2640 }
2642 /* Find out whether EXPR is a simple additive expression based on the iteration
2643 variable of some enclosing loop in the current function. If so, return the
2644 loop and set *DISP to the displacement and *NEG_P to true if this is for a
2645 subtraction; otherwise, return NULL. */
2649 {
2656 {
2662 }
2663 else
2664 {
2670 }
2687 }
2689 /* Return true if VAL (of type TYPE) can equal the minimum value if MAX is
2690 false, or the maximum value if MAX is true, of TYPE. */
2692 static bool
2694 {
2701 val = (max
2710 else
2712 }
2714 /* Return true if VAL (of type TYPE) can equal the minimum value of TYPE.
2715 If REVERSE is true, minimum value is taken as maximum value. */
2719 {
2721 }
2723 /* Return true if VAL (of type TYPE) can equal the maximum value of TYPE.
2724 If REVERSE is true, maximum value is taken as minimum value. */
2728 {
2730 }
2732 /* Return true if VAL1 can be lower than VAL2. */
2734 static bool
2736 {
2750 }
2752 /* Replace EXPR1 and EXPR2 by invariant expressions if possible. Return
2753 true if both expressions have been replaced and false otherwise. */
2755 static bool
2757 {
2768 }
2770 /* Helper function for walk_tree, used by independent_iterations_p below. */
2772 static tree
2774 {
2778 /* No need to walk into types or decls. */
2786 }
2788 /* Return true if STMT_LIST generates independent iterations in a loop. */
2790 static bool
2792 {
2793 tree_stmt_iterator tsi;
2796 tree iter;
2802 /* Scan the list and return false on anything that is not either a check
2803 or an assignment to a parameter with restricted aliasing. */
2805 {
2809 {
2811 {
2820 }
2823 {
2836 }
2840 }
2841 }
2843 /* At this point we know that the list contains only statements that will
2844 modify parameters with restricted aliasing. Check that the statements
2845 don't at the time read from these parameters. */
2851 }
2853 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Loop_Statement,
2854 to a GCC tree, which is returned. */
2856 static tree
2858 {
2865 tree gnu_result;
2867 /* Push the loop_info structure associated with the LOOP_STMT. */
2870 /* Set location information for statement and end label. */
2876 /* Save the statement for later reuse. */
2880 /* Set the condition under which the loop must keep going.
2881 For the case "LOOP .... END LOOP;" the condition is always true. */
2883 ;
2885 /* For the case "WHILE condition LOOP ..... END LOOP;" it's immediate. */
2890 /* Otherwise we have an iteration scheme and the condition is given by the
2891 bounds of the subtype of the iteration variable. */
2892 else
2893 {
2907 /* We must disable modulo reduction for the iteration variable, if any,
2908 in order for the loop comparison to be effective. */
2910 {
2916 }
2917 else
2918 {
2924 }
2926 /* We use two different strategies to translate the loop, depending on
2927 whether optimization is enabled.
2929 If it is, we generate the canonical loop form expected by the loop
2930 optimizer and the loop vectorizer, which is the do-while form:
2932 ENTRY_COND
2933 loop:
2934 TOP_UPDATE
2935 BODY
2936 BOTTOM_COND
2937 GOTO loop
2939 This avoids an implicit dependency on loop header copying and makes
2940 it possible to turn BOTTOM_COND into an inequality test.
2942 If optimization is disabled, loop header copying doesn't come into
2943 play and we try to generate the loop form with the fewer conditional
2944 branches. First, the default form, which is:
2946 loop:
2947 TOP_COND
2948 BODY
2949 BOTTOM_UPDATE
2950 GOTO loop
2952 It should catch most loops with constant ending point. Then, if we
2953 cannot, we try to generate the shifted form:
2955 loop:
2956 TOP_COND
2957 TOP_UPDATE
2958 BODY
2959 GOTO loop
2961 which should catch loops with constant starting point. Otherwise, if
2962 we cannot, we generate the fallback form:
2964 ENTRY_COND
2965 loop:
2966 BODY
2967 BOTTOM_COND
2968 BOTTOM_UPDATE
2969 GOTO loop
2971 which works in all cases. */
2974 {
2975 /* We can use the do-while form directly if GNU_FIRST-1 doesn't
2976 overflow. */
2978 ;
2980 /* Otherwise, use the do-while form with the help of a special
2981 induction variable in the unsigned version of the base type
2982 or the unsigned version of the size type, whichever is the
2983 largest, in order to have wrap-around arithmetics for it. */
2984 else
2985 {
2988 gnu_base_type
2990 else
2997 }
2999 gnu_first
3001 gnu_one_node);
3004 }
3005 else
3006 {
3007 /* We can use the default form if GNU_LAST+1 doesn't overflow. */
3009 ;
3011 /* Otherwise, we can use the shifted form if neither GNU_FIRST-1 nor
3012 GNU_LAST-1 does. */
3015 {
3016 gnu_first
3018 gnu_one_node);
3019 gnu_last
3021 gnu_one_node);
3023 }
3025 /* Otherwise, use the fallback form. */
3026 else
3028 }
3030 /* If we use the BOTTOM_COND, we can turn the test into an inequality
3031 test but we may have to add ENTRY_COND to protect the empty loop. */
3033 {
3036 {
3037 gnu_cond_expr
3043 }
3044 }
3046 /* Open a new nesting level that will surround the loop to declare the
3047 iteration variable. */
3051 /* If we use the special induction variable, create it and set it to
3052 its initial value. Morever, the regular iteration variable cannot
3053 itself be initialized, lest the initial value wrapped around. */
3055 {
3056 gnu_loop_iv
3060 }
3061 else
3064 /* Declare the iteration variable and set it to its initial value. */
3069 {
3072 }
3077 /* Do all the arithmetics in the base type. */
3080 /* Set either the top or bottom exit condition. */
3084 gnu_last);
3085 else
3088 gnu_last);
3090 /* Set either the top or bottom update statement and give it the source
3091 location of the iteration for better coverage info. */
3093 {
3094 gnu_stmt
3101 gnu_stmt
3103 gnu_loop_iv);
3107 }
3108 else
3109 {
3110 gnu_stmt
3116 }
3117 }
3119 /* If the loop was named, have the name point to this loop. In this case,
3120 the association is not a DECL node, but the end label of the loop. */
3124 /* Make the loop body into its own block, so any allocated storage will be
3125 released every iteration. This is needed for stack allocation. */
3130 /* If we have an iteration scheme, then we are in a statement group. Add
3131 the LOOP_STMT to it, finish it and make it the "loop". */
3133 {
3134 /* First, if we have computed invariant conditions for range (or index)
3135 checks applied to the iteration variable, find out whether they can
3136 be evaluated to false at compile time; otherwise, if there are not
3137 too many of them, combine them with the original checks. If loop
3138 unswitching is enabled, do not require the loop bounds to be also
3139 invariant, as their evaluation will still be ahead of the loop. */
3142 {
3147 {
3151 {
3154 gnu_adjusted_low
3157 low_ok
3160 }
3161 else
3165 {
3168 gnu_adjusted_high
3171 high_ok
3174 }
3175 else
3178 tree range_ok
3182 rci->invariant_cond
3187 else
3188 n_remaining_checks++;
3189 }
3191 /* Note that loop unswitching can only be applied a small number of
3192 times to a given loop (PARAM_MAX_UNSWITCH_LEVEL default to 3). */
3198 {
3203 }
3204 }
3206 /* Second, if loop vectorization is enabled and the iterations of the
3207 loop can easily be proved as independent, mark the loop. */
3209 && flag_tree_loop_vectorize
3216 }
3218 /* If we have an outer COND_EXPR, that's our result and this loop is its
3219 "true" statement. Otherwise, the result is the LOOP_STMT. */
3221 {
3225 }
3226 else
3232 }
3233 \f
3234 /* This page implements a form of Named Return Value optimization modelled
3235 on the C++ optimization of the same name. The main difference is that
3236 we disregard any semantical considerations when applying it here, the
3237 counterpart being that we don't try to apply it to semantically loaded
3238 return types, i.e. types with the TYPE_BY_REFERENCE_P flag set.
3240 We consider a function body of the following GENERIC form:
3242 return_type R1;
3243 [...]
3244 RETURN_EXPR [<retval> = ...]
3245 [...]
3246 RETURN_EXPR [<retval> = R1]
3247 [...]
3248 return_type Ri;
3249 [...]
3250 RETURN_EXPR [<retval> = ...]
3251 [...]
3252 RETURN_EXPR [<retval> = Ri]
3253 [...]
3255 where the Ri are not addressable and we try to fulfill a simple criterion
3256 that would make it possible to replace one or several Ri variables by the
3257 single RESULT_DECL of the function.
3259 The first observation is that RETURN_EXPRs that don't directly reference
3260 any of the Ri variables on the RHS of their assignment are transparent wrt
3261 the optimization. This is because the Ri variables aren't addressable so
3262 any transformation applied to them doesn't affect the RHS; moreover, the
3263 assignment writes the full <retval> object so existing values are entirely
3264 discarded.
3266 This property can be extended to some forms of RETURN_EXPRs that reference
3267 the Ri variables, for example CONSTRUCTORs, but isn't true in the general
3268 case, in particular when function calls are involved.
3270 Therefore the algorithm is as follows:
3272 1. Collect the list of candidates for a Named Return Value (Ri variables
3273 on the RHS of assignments of RETURN_EXPRs) as well as the list of the
3274 other expressions on the RHS of such assignments.
3276 2. Prune the members of the first list (candidates) that are referenced
3277 by a member of the second list (expressions).
3279 3. Extract a set of candidates with non-overlapping live ranges from the
3280 first list. These are the Named Return Values.
3282 4. Adjust the relevant RETURN_EXPRs and replace the occurrences of the
3283 Named Return Values in the function with the RESULT_DECL.
3285 If the function returns an unconstrained type, things are a bit different
3286 because the anonymous return object is allocated on the secondary stack
3287 and RESULT_DECL is only a pointer to it. Each return object can be of a
3288 different size and is allocated separately so we need not care about the
3289 addressability and the aforementioned overlapping issues. Therefore, we
3290 don't collect the other expressions and skip step #2 in the algorithm. */
3292 struct nrv_data
3293 {
3294 bitmap nrv;
3295 tree result;
3296 Node_Id gnat_ret;
3298 };
3300 /* Return true if T is a Named Return Value. */
3304 {
3306 }
3308 /* Helper function for walk_tree, used by finalize_nrv below. */
3310 static tree
3312 {
3316 /* No need to walk into types or decls. */
3324 }
3326 /* Prune Named Return Values in BLOCK and return true if there is still a
3327 Named Return Value in BLOCK or one of its sub-blocks. */
3329 static bool
3331 {
3333 tree t;
3335 /* First recurse on the sub-blocks. */
3339 /* Then make sure to keep at most one NRV per block. */
3342 {
3345 else
3347 }
3350 }
3352 /* Helper function for walk_tree, used by finalize_nrv below. */
3354 static tree
3356 {
3360 /* No need to walk into types. */
3364 /* Change RETURN_EXPRs of NRVs to just refer to the RESULT_DECL; this is a
3365 nop, but differs from using NULL_TREE in that it indicates that we care
3366 about the value of the RESULT_DECL. */
3369 {
3372 /* Strip useless conversions around the return value. */
3378 }
3380 /* Replace the DECL_EXPR of NRVs with an initialization of the RESULT_DECL,
3381 if needed. */
3384 {
3388 {
3393 }
3394 else
3398 /* Identify the NRV to the RESULT_DECL for debugging purposes. */
3401 /* ??? Kludge to avoid an assertion failure during inlining. */
3404 }
3406 /* And replace all uses of NRVs with the RESULT_DECL. */
3410 /* Avoid walking into the same tree more than once. Unfortunately, we
3411 can't just use walk_tree_without_duplicates because it would only
3412 call us for the first occurrence of NRVs in the function body. */
3417 }
3419 /* Likewise, but used when the function returns an unconstrained type. */
3421 static tree
3423 {
3427 /* No need to walk into types. */
3431 /* We need to see the DECL_EXPR of NRVs before any other references so we
3432 walk the body of BIND_EXPR before walking its variables. */
3436 /* Change RETURN_EXPRs of NRVs to assign to the RESULT_DECL only the final
3437 return value built by the allocator instead of the whole construct. */
3440 {
3443 /* This is the construct returned by the allocator. */
3446 {
3451 else
3453 }
3455 /* Strip useless conversions around the return value. */
3460 /* Strip unpadding around the return value. */
3465 /* Assign the new return value to the RESULT_DECL. */
3469 }
3471 /* Adjust the DECL_EXPR of NRVs to call the allocator and save the result
3472 into a new variable. */
3475 {
3482 /* Create an artificial context to build the allocation. */
3487 /* This will return a COMPOUND_EXPR with the allocation in the first
3488 arm and the final return value in the second arm. */
3495 /* The new variable is built as a reference to the allocated space. */
3496 new_var
3502 {
3505 /* The new initial value is a COMPOUND_EXPR with the allocation in
3506 the first arm and the value of P_ARRAY in the second arm. */
3512 /* Build a modified CONSTRUCTOR that references NEW_VAR. */
3519 }
3520 else
3521 {
3522 /* The new initial value is just the allocation. */
3525 }
3529 /* Destroy the artificial context and insert the new statements. */
3534 /* Chain NEW_VAR immediately after VAR and ignore the latter. */
3539 /* Save the new return value and the dereference of NEW_VAR. */
3543 /* ??? Kludge to avoid messing up during inlining. */
3545 }
3547 /* And replace all uses of NRVs with the dereference of NEW_VAR. */
3551 /* Avoid walking into the same tree more than once. Unfortunately, we
3552 can't just use walk_tree_without_duplicates because it would only
3553 call us for the first occurrence of NRVs in the function body. */
3558 }
3560 /* Finalize the Named Return Value optimization for FNDECL. The NRV bitmap
3561 contains the candidates for Named Return Value and OTHER is a list of
3562 the other return values. GNAT_RET is a representative return node. */
3564 static void
3566 {
3569 walk_tree_fn func;
3571 tree iter;
3573 /* We shouldn't be applying the optimization to return types that we aren't
3574 allowed to manipulate freely. */
3577 /* Prune the candidates that are referenced by other return values. */
3587 /* Prune also the candidates that are referenced by nested functions. */
3595 /* Extract a set of NRVs with non-overlapping live ranges. */
3599 /* Adjust the relevant RETURN_EXPRs and replace the occurrences of NRVs. */
3606 else
3610 }
3612 /* Return true if RET_VAL can be used as a Named Return Value for the
3613 anonymous return object RET_OBJ. */
3615 static bool
3617 {
3630 /* For the constrained case, test for addressability. */
3634 /* For the constrained case, test for overalignment. */
3638 /* For the unconstrained case, test for bogus initialization. */
3645 }
3647 /* Build a RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR around
3648 the assignment of RET_VAL to RET_OBJ. Otherwise build a bare RETURN_EXPR
3649 around RESULT_OBJ, which may be null in this case. */
3651 static tree
3653 {
3654 tree result_expr;
3657 {
3658 /* The gimplifier explicitly enforces the following invariant:
3660 RETURN_EXPR
3661 |
3662 INIT_EXPR
3663 / \
3664 / \
3665 RET_OBJ ...
3667 As a consequence, type consistency dictates that we use the type
3668 of the RET_OBJ as the operation type. */
3671 /* Convert the right operand to the operation type. Note that this is
3672 the transformation applied in the INIT_EXPR case of build_binary_op,
3673 with the assumption that the type cannot involve a placeholder. */
3677 /* We always can use an INIT_EXPR for the return object. */
3680 /* If the function returns an aggregate type, find out whether this is
3681 a candidate for Named Return Value. If so, record it. Otherwise,
3682 if this is an expression of some kind, record it elsewhere. */
3688 {
3689 /* Strip useless conversions around the return value. */
3693 /* Now apply the test to the return value. */
3695 {
3699 }
3701 /* Note that we need not care about CONSTRUCTORs here, as they are
3702 totally transparent given the read-compose-write semantics of
3703 assignments from CONSTRUCTORs. */
3706 }
3707 }
3708 else
3712 }
3713 \f
3714 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
3715 don't return anything. */
3717 static void
3719 {
3720 /* Defining identifier of a parameter to the subprogram. */
3721 Entity_Id gnat_param;
3722 /* The defining identifier for the subprogram body. Note that if a
3723 specification has appeared before for this body, then the identifier
3724 occurring in that specification will also be a defining identifier and all
3725 the calls to this subprogram will point to that specification. */
3726 Entity_Id gnat_subprog_id
3729 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
3730 tree gnu_subprog_decl;
3731 /* Its RESULT_DECL node. */
3732 tree gnu_result_decl;
3733 /* Its FUNCTION_TYPE node. */
3734 tree gnu_subprog_type;
3735 /* The TYPE_CI_CO_LIST of its FUNCTION_TYPE node, if any. */
3736 tree gnu_cico_list;
3737 /* The entry in the CI_CO_LIST that represents a function return, if any. */
3739 tree gnu_result;
3740 location_t locus;
3744 /* If this is a generic object or if it has been eliminated,
3745 ignore it. */
3751 /* If this subprogram acts as its own spec, define it. Otherwise, just get
3752 the already-elaborated tree node. However, if this subprogram had its
3753 elaboration deferred, we will already have made a tree node for it. So
3754 treat it as not being defined in that case. Such a subprogram cannot
3755 have an address clause or a freeze node, so this test is safe, though it
3756 does disable some otherwise-useful error checking. */
3757 gnu_subprog_decl
3768 /* If the function returns by invisible reference, make it explicit in the
3769 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
3771 {
3775 }
3777 /* Set the line number in the decl to correspond to that of the body. */
3782 /* If the body comes from an expression function, arrange it to be inlined
3783 in almost all cases. */
3787 /* Initialize the information structure for the function. */
3796 /* If there are copy-in/copy-out parameters, we need to ensure that they are
3797 properly copied out by the return statement. We do this by making a new
3798 block and converting any return into a goto to a label at the end of the
3799 block. */
3801 {
3810 /* If this is a function with copy-in/copy-out parameters and which does
3811 not return by invisible reference, we also need a variable for the
3812 return value to be placed. */
3814 {
3815 tree gnu_return_type
3818 gnu_return_var
3824 }
3828 /* See whether there are parameters for which we don't have a GCC tree
3829 yet. These must be Out parameters. Make a VAR_DECL for them and
3830 put it into TYPE_CI_CO_LIST, which must contain an empty entry too.
3831 We can match up the entries because TYPE_CI_CO_LIST is in the order
3832 of the parameters. */
3837 {
3839 tree gnu_decl;
3841 /* Skip any entries that have been already filled in; they must
3842 correspond to In Out parameters. */
3846 /* Do any needed dereferences for by-ref objects. */
3852 /* Do any needed references for padded types. */
3855 }
3856 }
3857 else
3860 /* Get a tree corresponding to the code for the subprogram. */
3866 /* Generate the code of the subprogram itself. A return statement will be
3867 present and any Out parameters will be handled there. */
3872 /* If we populated the parameter attributes cache, we need to make sure that
3873 the cached expressions are evaluated on all the possible paths leading to
3874 their uses. So we force their evaluation on entry of the function. */
3877 {
3884 {
3891 }
3897 }
3899 /* If we are dealing with a return from an Ada procedure with parameters
3900 passed by copy-in/copy-out, we need to return a record containing the
3901 final values of these parameters. If the list contains only one entry,
3902 return just that entry though.
3904 For a full description of the copy-in/copy-out parameter mechanism, see
3905 the part of the gnat_to_gnu_entity routine dealing with the translation
3906 of subprograms.
3908 We need to make a block that contains the definition of that label and
3909 the copying of the return value. It first contains the function, then
3910 the label and copy statement. */
3912 {
3913 const Node_Id gnat_end_label
3922 /* If this is a function which returns by invisible reference, the
3923 return value has already been dealt with at the return statements,
3924 so we only need to indirectly copy out the parameters. */
3926 {
3927 tree gnu_ret_deref
3929 tree t;
3934 {
3935 tree gnu_field_deref
3940 }
3941 }
3943 /* Otherwise, if this is a procedure or a function which does not return
3944 by invisible reference, we can do a direct block-copy out. */
3945 else
3946 {
3947 tree gnu_retval;
3951 else
3952 gnu_retval
3954 gnu_cico_list);
3958 }
3962 }
3966 /* Attempt setting the end_locus of our GCC body tree, typically a
3967 BIND_EXPR or STATEMENT_LIST, then the end_locus of our GCC subprogram
3968 declaration tree. */
3972 /* On SEH targets, install an exception handler around the main entry
3973 point to catch unhandled exceptions. */
3976 {
3977 tree t;
3978 tree etype;
3990 }
3994 /* Finally annotate the parameters and disconnect the trees for parameters
3995 that we have turned into variables since they are now unusable. */
3999 {
4008 }
4010 /* Disconnect the variable created for the return value. */
4014 /* If the function returns an aggregate type and we have candidates for
4015 a Named Return Value, finalize the optimization. */
4017 {
4024 }
4026 /* If this is an inlined external function that has been marked uninlinable,
4027 drop the body and stop there. Otherwise compile the body. */
4030 else
4032 }
4033 \f
4034 /* Return true if GNAT_NODE references an Atomic entity. */
4036 static bool
4038 {
4039 Entity_Id gnat_entity;
4042 {
4061 /* ... fall through ... */
4068 }
4071 }
4073 /* Return true if GNAT_NODE references a Volatile_Full_Access entity. */
4075 static bool
4077 {
4078 Entity_Id gnat_entity;
4081 {
4101 }
4104 }
4106 /* Strip any type conversion on GNAT_NODE and return the result. */
4108 static Node_Id
4110 {
4117 }
4119 /* Return true if GNAT_NODE requires outer atomic access, i.e. atomic access
4120 of an object of which GNAT_NODE is a component. */
4122 static bool
4124 {
4128 {
4130 {
4135 gnat_node
4149 }
4150 }
4153 }
4155 /* Return true if GNAT_NODE requires atomic access and set SYNC according to
4156 the associated synchronization setting. */
4158 static bool
4160 {
4165 /* First, scan the parent to find out cases where the flag is irrelevant. */
4167 {
4170 /* Do not mess up machine code insertions. */
4174 /* Nothing to do if we are the prefix of an attribute, since we do not
4175 want an atomic access for things like 'Size. */
4177 /* ... fall through ... */
4180 /* The N_Reference node is like an attribute. */
4188 /* If we are the prefix, then the access is only partial. */
4194 /* Nothing to do for the identifier in an object renaming declaration,
4195 the renaming itself does not need atomic access. */
4200 }
4202 /* Then, scan the node to find the atomic object. */
4205 /* For Atomic itself, only reads and updates of the object as a whole require
4206 atomic access (RM C.6 (15)). But for Volatile_Full_Access, all reads and
4207 updates require atomic access. */
4212 /* If an outer atomic access will also be required, it cancels this one. */
4219 }
4220 \f
4221 /* Create a temporary variable with PREFIX and TYPE, and return it. */
4223 static tree
4225 {
4226 tree gnu_temp
4232 }
4234 /* Create a temporary variable with PREFIX and initialize it with GNU_INIT.
4235 Put the initialization statement into GNU_INIT_STMT and annotate it with
4236 the SLOC of GNAT_NODE. Return the temporary variable. */
4238 static tree
4240 Node_Id gnat_node)
4241 {
4248 }
4250 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
4251 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
4252 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
4253 If GNU_TARGET is non-null, this must be a function call on the RHS of a
4254 N_Assignment_Statement and the result is to be placed into that object.
4255 If OUTER_ATOMIC_ACCESS is true, then the assignment to GNU_TARGET must be a
4256 load-modify-store sequence. Otherwise, if ATOMIC_ACCESS is true, then the
4257 assignment to GNU_TARGET must be atomic. If, in addition, ATOMIC_SYNC is
4258 true, then the assignment to GNU_TARGET requires atomic synchronization. */
4260 static tree
4263 {
4266 /* The GCC node corresponding to the GNAT subprogram name. This can either
4267 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
4268 or an indirect reference expression (an INDIRECT_REF node) pointing to a
4269 subprogram. */
4271 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
4273 /* The return type of the FUNCTION_TYPE. */
4285 Entity_Id gnat_formal;
4286 Node_Id gnat_actual;
4291 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
4292 all our args first. */
4294 {
4304 {
4307 }
4310 }
4313 {
4314 /* For a call to a nested function, check the inlining status. */
4318 /* For a recursive call, avoid explosion due to recursive inlining. */
4321 }
4323 /* The only way we can be making a call via an access type is if Name is an
4324 explicit dereference. In that case, get the list of formal args from the
4325 type the access type is pointing to. Otherwise, get the formals from the
4326 entity being called. */
4328 {
4331 /* If the access type doesn't require foreign-compatible representation,
4332 be prepared for descriptors. */
4336 }
4338 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
4340 else
4343 /* The lifetime of the temporaries created for the call ends right after the
4344 return value is copied, so we can give them the scope of the elaboration
4345 routine at top level. */
4347 {
4350 }
4352 /* First, create the temporary for the return value when:
4354 1. There is no target and the function has copy-in/copy-out parameters,
4355 because we need to preserve the return value before copying back the
4356 parameters.
4358 2. There is no target and the call is made for neither an object nor a
4359 renaming declaration, nor a return statement, nor an allocator, and
4360 the return type has variable size because in this case the gimplifier
4361 cannot create the temporary, or more generally is simply an aggregate
4362 type, because the gimplifier would then create the temporary in the
4363 outermost scope instead of locally.
4365 3. There is a target and it is a slice or an array with fixed size,
4366 and the return type has variable size, because the gimplifier
4367 doesn't handle these cases.
4369 4. There is no target and we have misaligned In Out or Out parameters
4370 passed by reference, because we need to preserve the return value
4371 before copying back the parameters. However, in this case, we'll
4372 defer creating the temporary, see below.
4374 This must be done before we push a binding level around the call, since
4375 we will pop it before copying the return value. */
4378 || (!gnu_target
4386 || (gnu_target
4392 {
4395 }
4397 /* If we don't need a value or have already created it, push a binding level
4398 around the call. This will narrow the lifetime of the temporaries we may
4399 need to make when translating the parameters as much as possible. */
4401 {
4405 }
4407 /* Create the list of the actual parameters as GCC expects it, namely a
4408 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
4409 is an expression and the TREE_PURPOSE field is null. But skip Out
4410 parameters not passed by reference and that need not be copied in. */
4415 {
4420 const bool is_true_formal_parm
4422 const bool is_by_ref_formal_parm
4423 = is_true_formal_parm
4426 /* In the Out or In Out case, we must suppress conversions that yield
4427 an lvalue but can nevertheless cause the creation of a temporary,
4428 because we need the real object in this case, either to pass its
4429 address if it's passed by reference or as target of the back copy
4430 done after the call if it uses the copy-in/copy-out mechanism.
4431 We do it in the In case too, except for an unchecked conversion
4432 to an elementary type or a constrained composite type because it
4433 alone can cause the actual to be misaligned and the addressability
4434 test is applied to the real object. */
4435 const bool suppress_type_conversion
4442 Node_Id gnat_name = suppress_type_conversion
4446 /* If it's possible we may need to use this expression twice, make sure
4447 that any side-effects are handled via SAVE_EXPRs; likewise if we need
4448 to force side-effects before the call. */
4450 {
4454 gnu_name
4456 }
4458 /* If we are passing a non-addressable parameter by reference, pass the
4459 address of a copy. In the Out or In Out case, set up to copy back
4460 out after the call. */
4464 {
4468 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
4469 but sort of an instantiation for them. */
4471 ;
4473 /* If the type is passed by reference, a copy is not allowed. */
4476 gnat_actual);
4478 /* For users of Starlet we issue a warning because the interface
4479 apparently assumes that by-ref parameters outlive the procedure
4480 invocation. The code still will not work as intended, but we
4481 cannot do much better since low-level parts of the back-end
4482 would allocate temporaries at will because of the misalignment
4483 if we did not do so here. */
4485 {
4486 post_error
4488 post_error_ne
4492 gnat_formal);
4493 }
4495 /* If the actual type of the object is already the nominal type,
4496 we have nothing to do, except if the size is self-referential
4497 in which case we'll remove the unpadding below. */
4500 ;
4502 /* Otherwise remove the unpadding from all the objects. */
4504 && TYPE_IS_PADDING_P
4508 /* Otherwise convert to the nominal type of the object if needed.
4509 There are several cases in which we need to make the temporary
4510 using this type instead of the actual type of the object when
4511 they are distinct, because the expectations of the callee would
4512 otherwise not be met:
4513 - if it's a justified modular type,
4514 - if the actual type is a smaller form of it,
4515 - if it's a smaller form of the actual type. */
4519 gnu_name_type)))
4525 /* If this is an In Out or Out parameter and we're returning a value,
4526 we need to create a temporary for the return value because we must
4527 preserve it before copying back at the very end. */
4529 {
4532 }
4534 /* If we haven't pushed a binding level, push it now. This will
4535 narrow the lifetime of the temporary we are about to make as
4536 much as possible. */
4538 {
4542 }
4544 /* Create an explicit temporary holding the copy. */
4545 gnu_temp
4548 /* But initialize it on the fly like for an implicit temporary as
4549 we aren't necessarily having a statement list. */
4551 gnu_temp);
4553 /* Set up to move the copy back to the original if needed. */
4555 {
4556 /* If the original is a COND_EXPR whose first arm isn't meant to
4557 be further used, just deal with the second arm. This is very
4558 likely the conditional expression built for a check. */
4561 && integer_zerop
4565 gnu_stmt
4570 }
4571 }
4573 /* Start from the real object and build the actual. */
4576 /* If atomic access is required for an In or In Out actual parameter,
4577 build the atomic load. */
4579 && !is_by_ref_formal_parm
4584 /* If this was a procedure call, we may not have removed any padding.
4585 So do it here for the part we will use as an input, if any. */
4588 gnu_actual
4591 /* Put back the conversion we suppressed above in the computation of the
4592 real object. And even if we didn't suppress any conversion there, we
4593 may have suppressed a conversion to the Etype of the actual earlier,
4594 since the parent is a procedure call, so put it back here. Note that
4595 we might have a dummy type here if the actual is the dereference of a
4596 pointer to it, but that's OK if the formal is passed by reference. */
4604 else
4607 /* Make sure that the actual is in range of the formal's type. */
4610 gnu_actual
4613 /* Unless this is an In parameter, we must remove any justified modular
4614 building from GNU_NAME to get an lvalue. */
4619 gnu_name
4622 /* First see if the parameter is passed by reference. */
4624 {
4626 {
4627 /* In Out or Out parameters passed by reference don't use the
4628 copy-in/copy-out mechanism so the address of the real object
4629 must be passed to the function. */
4632 /* If we have a padded type, be sure we've removed padding. */
4635 gnu_actual);
4637 /* If we have the constructed subtype of an aliased object
4638 with an unconstrained nominal subtype, the type of the
4639 actual includes the template, although it is formally
4640 constrained. So we need to convert it back to the real
4641 constructed subtype to retrieve the constrained part
4642 and takes its address. */
4648 gnu_actual);
4649 }
4651 /* There is no need to convert the actual to the formal's type before
4652 taking its address. The only exception is for unconstrained array
4653 types because of the way we build fat pointers. */
4655 {
4656 /* Put back a view conversion for In Out or Out parameters. */
4659 gnu_actual);
4661 }
4663 /* The symmetry of the paths to the type of an entity is broken here
4664 since arguments don't know that they will be passed by ref. */
4667 }
4669 /* Then see if the parameter is an array passed to a foreign convention
4670 subprogram. */
4672 {
4678 {
4681 }
4683 /* Take the address of the object and convert to the proper pointer
4684 type. We'd like to actually compute the address of the beginning
4685 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
4686 possibility that the ARRAY_REF might return a constant and we'd be
4687 getting the wrong address. Neither approach is exactly correct,
4688 but this is the most likely to work in all cases. */
4690 }
4692 /* Otherwise the parameter is passed by copy. */
4693 else
4694 {
4695 tree gnu_size;
4700 /* If we didn't create a PARM_DECL for the formal, this means that
4701 it is an Out parameter not passed by reference and that need not
4702 be copied in. In this case, the value of the actual need not be
4703 read. However, we still need to make sure that its side-effects
4704 are evaluated before the call, so we evaluate its address. */
4706 {
4708 {
4711 }
4713 }
4717 /* If this is 'Null_Parameter, pass a zero even though we are
4718 dereferencing it. */
4724 {
4725 tree type_for_size
4727 gnu_actual
4731 }
4732 else
4734 }
4737 }
4739 gnu_call
4744 /* If we have created a temporary for the return value, initialize it. */
4746 {
4747 tree gnu_stmt
4752 }
4754 /* If this is a subprogram with copy-in/copy-out parameters, we need to
4755 unpack the valued returned from the function into the In Out or Out
4756 parameters. We deal with the function return (if this is an Ada
4757 function) below. */
4759 {
4760 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
4761 copy-out parameters. */
4765 /* The call sequence must contain one and only one call, even though the
4766 function is pure. Save the result into a temporary if needed. */
4768 {
4770 {
4771 tree gnu_stmt;
4772 gnu_call
4775 }
4778 }
4780 /* The first entry is for the actual return value if this is a
4781 function, so skip it. */
4787 else
4794 /* If we are dealing with a copy-in/copy-out parameter, we must
4795 retrieve its value from the record returned in the call. */
4801 {
4802 /* Get the value to assign to this Out or In Out parameter. It is
4803 either the result of the function if there is only a single such
4804 parameter or the appropriate field from the record returned. */
4805 tree gnu_result
4807 ? gnu_call
4811 /* If the actual is a conversion, get the inner expression, which
4812 will be the real destination, and convert the result to the
4813 type of the actual parameter. */
4814 tree gnu_actual
4817 /* If the result is a padded type, remove the padding. */
4819 gnu_result
4821 gnu_result);
4823 /* If the actual is a type conversion, the real target object is
4824 denoted by the inner Expression and we need to convert the
4825 result to the associated type.
4826 We also need to convert our gnu assignment target to this type
4827 if the corresponding GNU_NAME was constructed from the GNAT
4828 conversion node and not from the inner Expression. */
4830 {
4831 gnu_result
4832 = convert_with_check
4840 }
4842 /* Unchecked conversions as actuals for Out parameters are not
4843 allowed in user code because they are not variables, but do
4844 occur in front-end expansions. The associated GNU_NAME is
4845 always obtained from the inner expression in such cases. */
4848 gnu_result,
4850 else
4851 {
4853 gnu_result
4855 gnat_actual);
4860 }
4862 /* If an outer atomic access is required for an actual parameter,
4863 build the load-modify-store sequence. */
4865 gnu_result
4868 /* Or else, if simple atomic access is required, build the atomic
4869 store. */
4873 /* Otherwise build a regular assignment. */
4874 else
4883 }
4884 }
4886 /* If this is a function call, the result is the call expression unless a
4887 target is specified, in which case we copy the result into the target
4888 and return the assignment statement. */
4890 {
4891 /* If this is a function with copy-in/copy-out parameters, extract the
4892 return value from it and update the return type. */
4894 {
4896 gnu_call
4899 }
4901 /* If the function returns an unconstrained array or by direct reference,
4902 we have to dereference the pointer. */
4908 {
4912 /* If range check is needed, emit code to generate it. */
4914 gnu_call
4916 gnat_parent);
4918 /* ??? If the return type has variable size, then force the return
4919 slot optimization as we would not be able to create a temporary.
4920 That's what has been done historically. */
4923 else
4926 /* Use the required method to move the result to the target. */
4928 gnu_call
4932 else
4933 gnu_call
4939 }
4940 else
4942 }
4944 /* Otherwise, if this is a procedure call statement without copy-in/copy-out
4945 parameters, the result is just the call statement. */
4949 /* Finally, add the copy back statements, if any. */
4955 /* If we have pushed a binding level, pop it and finish up the enclosing
4956 statement group. */
4958 {
4962 }
4964 /* Otherwise, retrieve the statement list, if any. */
4968 /* Otherwise, just return the call expression. */
4969 else
4972 /* If we nevertheless need a value, make a COMPOUND_EXPR to return it.
4973 But first simplify if we have only one statement in the list. */
4975 {
4979 gnu_result
4981 }
4984 }
4985 \f
4986 /* Subroutine of gnat_to_gnu to translate gnat_node, an
4987 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
4989 static tree
4991 {
4994 /* If just annotating, ignore all EH and cleanups. */
4998 bool fe_sjlj
5004 tree gnu_result;
5005 tree gnu_expr;
5006 Node_Id gnat_temp;
5008 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
5009 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
5010 add_cleanup, and when we leave the binding, end_stmt_group will create
5011 the TRY_FINALLY_EXPR.
5013 ??? The region level calls down there have been specifically put in place
5014 for a ZCX context and currently the order in which things are emitted
5015 (region/handlers) is different from the SJLJ case. Instead of putting
5016 other calls with different conditions at other places for the SJLJ case,
5017 it seems cleaner to reorder things for the SJLJ case and generalize the
5018 condition to make it not ZCX specific.
5020 If there are any exceptions or cleanup processing involved, we need an
5021 outer statement group (for Fe_Sjlj) and binding level. */
5023 {
5026 }
5028 /* If using fe_sjlj, make the variables for the setjmp buffer and save
5029 area for address of previous buffer. Do this first since we need to have
5030 the setjmp buf known for any decls in this block. */
5032 {
5033 gnu_jmpsave_decl
5035 jmpbuf_ptr_type,
5040 /* The __builtin_setjmp receivers will immediately reinstall it. Now
5041 because of the unstructured form of EH used by fe_sjlj, there
5042 might be forward edges going to __builtin_setjmp receivers on which
5043 it is uninitialized, although they will never be actually taken. */
5045 gnu_jmpbuf_decl
5047 jmpbuf_type,
5048 NULL_TREE,
5054 /* When we exit this block, restore the saved value. */
5058 }
5060 /* If we are to call a function when exiting this block, add a cleanup
5061 to the binding level we made above. Note that add_cleanup is FIFO
5062 so we must register this cleanup after the EH cleanup just above. */
5064 {
5067 /* When not optimizing, disable inlining of finalizers as this can
5068 create a more complex CFG in the parent function. */
5072 /* If there is no end label attached, we use the location of the At_End
5073 procedure because Expand_Cleanup_Actions might reset the location of
5074 the enclosing construct to that of an inner statement. */
5078 }
5080 /* Now build the tree for the declarations and statements inside this block.
5081 If this is SJLJ, set our jmp_buf as the current buffer. */
5085 {
5088 gnu_jmpbuf_decl));
5091 }
5097 /* Generate code for each statement in the block. */
5105 /* Now generate code for the two exception models, if either is relevant for
5106 this block. */
5108 {
5110 tree gnu_handler;
5112 /* Make a binding level for the exception handling declarations and code
5113 and set up gnu_except_ptr_stack for the handlers to use. */
5124 /* Generate code for each handler. The N_Exception_Handler case does the
5125 real work and returns a COND_EXPR for each handler, which we chain
5126 together here. */
5129 {
5132 /* If this is the first one, set it as the outer one. Otherwise,
5133 point the "else" part of the previous handler to us. Then point
5134 to our "else" part. */
5137 else
5141 }
5143 /* If none of the exception handlers did anything, re-raise but do not
5144 defer abortion. */
5147 set_expr_location_from_node
5153 else
5156 /* End the binding level dedicated to the exception handlers and get the
5157 whole statement group. */
5162 /* If the setjmp returns 1, we restore our incoming longjmp value and
5163 then check the handlers. */
5166 gnu_jmpsave_decl),
5167 gnat_node);
5171 /* This block is now "if (setjmp) ... <handlers> else <block>". */
5173 (build_call_n_expr
5176 gnu_jmpbuf_decl))),
5178 }
5180 {
5181 tree gnu_handlers;
5182 location_t locus;
5184 /* First make a block containing the handlers. */
5192 /* Now make the TRY_CATCH_EXPR for the block. */
5195 /* Set a location. We need to find a unique location for the dispatching
5196 code, otherwise we can get coverage or debugging issues. Try with
5197 the location of the end label. */
5201 else
5202 /* Clear column information so that the exception handler of an
5203 implicit transient block does not incorrectly inherit the slocs
5204 of a decision, which would otherwise confuse control flow based
5205 coverage analysis tools. */
5207 }
5208 else
5211 /* Now close our outer block, if we had to make one. */
5213 {
5217 }
5220 }
5221 \f
5222 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
5223 to a GCC tree, which is returned. This is the variant for front-end sjlj
5224 exception handling. */
5226 static tree
5228 {
5229 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
5230 an "if" statement to select the proper exceptions. For "Others", exclude
5231 exceptions where Handled_By_Others is nonzero unless the All_Others flag
5232 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
5235 Node_Id gnat_temp;
5239 {
5240 tree this_choice;
5243 {
5246 else
5247 this_choice
5248 = build_binary_op
5250 convert
5252 build_component_ref
5253 (build_unary_op
5256 not_handled_by_others_decl,
5258 integer_zero_node);
5259 }
5263 {
5265 tree gnu_expr;
5267 /* Exception may be a renaming. Recover original exception which is
5268 the one elaborated and registered. */
5274 this_choice
5275 = build_binary_op
5280 }
5281 else
5286 }
5289 }
5290 \f
5291 /* Return true if no statement in GNAT_LIST can alter the control flow. */
5293 static bool
5295 {
5299 /* This is very conservative, we reject everything except for simple
5300 assignments between identifiers or literals. */
5304 {
5316 }
5319 }
5321 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
5322 to a GCC tree, which is returned. This is the variant for GCC exception
5323 schemes. */
5325 static tree
5327 {
5330 /* We build a TREE_LIST of nodes representing what exception types this
5331 handler can catch, with special cases for others and all others cases.
5333 Each exception type is actually identified by a pointer to the exception
5334 id, or to a dummy object for "others" and "all others". */
5336 gnat_temp;
5338 {
5342 {
5345 }
5348 {
5351 /* Exception may be a renaming. Recover original exception which is
5352 the one elaborated and registered. */
5358 }
5359 else
5362 /* The GCC interface expects NULL to be passed for catch all handlers, so
5363 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
5364 is integer_zero_node. It would not work, however, because GCC's
5365 notion of "catch all" is stronger than our notion of "others". Until
5366 we correctly use the cleanup interface as well, doing that would
5367 prevent the "all others" handlers from being seen, because nothing
5368 can be caught beyond a catch all from GCC's point of view. */
5370 }
5375 /* Expand a call to the begin_handler hook at the beginning of the handler,
5376 and arrange for a call to the end_handler hook to occur on every possible
5377 exit path.
5379 The hooks expect a pointer to the low level occurrence. This is required
5380 for our stack management scheme because a raise inside the handler pushes
5381 a new occurrence on top of the stack, which means that this top does not
5382 necessarily match the occurrence this handler was dealing with.
5384 __builtin_eh_pointer references the exception occurrence being
5385 propagated. Upon handler entry, this is the exception for which the
5386 handler is triggered. This might not be the case upon handler exit,
5387 however, as we might have a new occurrence propagated by the handler's
5388 body, and the end_handler hook called as a cleanup in this context.
5390 We use a local variable to retrieve the incoming value at handler entry
5391 time, and reuse it to feed the end_handler hook's argument at exit. */
5393 tree gnu_current_exc_ptr
5397 gnu_incoming_exc_ptr
5404 gnu_incoming_exc_ptr),
5405 gnat_node);
5407 /* Declare and initialize the choice parameter, if present. */
5409 {
5410 tree gnu_param
5416 gnu_incoming_exc_ptr));
5417 }
5421 /* We don't have an End_Label at hand to set the location of the cleanup
5422 actions, so we use that of the exception handler itself instead. */
5426 else
5433 return
5435 }
5436 \f
5437 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
5439 static void
5441 {
5446 Entity_Id gnat_entity;
5447 Node_Id gnat_pragma;
5448 /* Make the decl for the elaboration procedure. Emit debug info for it, so
5449 that users can break into their elaboration code in debuggers. Kludge:
5450 don't consider it as a definition so that we have a line map for its body,
5451 but no subprogram description in debug info. */
5452 tree gnu_elab_proc_decl
5453 = create_subprog_decl
5462 /* Initialize the information structure for the function. */
5471 /* For a body, first process the spec if there is one. */
5477 {
5484 }
5486 /* Then process any pragmas and declarations preceding the unit. */
5495 /* Process the unit itself. */
5498 /* Generate code for all the inlined subprograms. */
5502 {
5503 Node_Id gnat_body;
5505 /* Without optimization, process only the required subprograms. */
5509 /* The set of inlined subprograms is computed from data recorded early
5510 during expansion and it can be a strict superset of the final set
5511 computed after semantic analysis, for example if a call to such a
5512 subprogram occurs in a pragma Assert and assertions are disabled.
5513 In that case, semantic analysis resets Is_Public to false but the
5514 entry for the subprogram in the inlining tables is stalled. */
5520 {
5521 /* ??? This happens when only the spec of a package is provided. */
5525 gnat_body
5527 }
5529 /* Define the entity first so we set DECL_EXTERNAL. */
5532 }
5534 /* Process any pragmas and actions following the unit. */
5539 /* Save away what we've made so far and finish it up. */
5546 /* Record this potential elaboration procedure for later processing. */
5553 /* Force the processing for all nodes that remain in the queue. */
5555 }
5556 \f
5557 /* Mark COND, a boolean expression, as predicating a call to a noreturn
5558 function, i.e. predict that it is very likely false, and return it.
5560 The compiler will automatically predict the last edge leading to a call
5561 to a noreturn function as very unlikely taken. This function makes it
5562 possible to expand the prediction to predecessors in case the condition
5563 is made up of several short-circuit operators. */
5565 static tree
5567 {
5577 PRED_NORETURN));
5580 }
5582 /* Subroutine of gnat_to_gnu to translate GNAT_RANGE, a node representing a
5583 range of values, into GNU_LOW and GNU_HIGH bounds. */
5585 static void
5587 {
5588 /* GNAT_RANGE is either an N_Range or an identifier denoting a subtype. */
5590 {
5598 {
5602 *gnu_low
5604 *gnu_high
5606 }
5611 }
5612 }
5614 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Raise_xxx_Error,
5615 to a GCC tree and return it. GNU_RESULT_TYPE_P is a pointer to where
5616 we should place the result type. */
5618 static tree
5620 {
5624 const bool with_extra_info
5625 = Exception_Extra_Info
5630 /* The following processing is not required for correctness. Its purpose is
5631 to give more precise error messages and to record some information. */
5633 {
5643 {
5650 {
5668 }
5676 {
5682 }
5685 && gnu_low_bound
5686 && gnu_high_bound
5689 gnu_result
5693 /* If optimization is enabled and we are inside a loop, we try to
5694 compute invariant conditions for checks applied to the iteration
5695 variable, i.e. conditions that are independent of the variable
5696 and necessary in order for the checks to fail in the course of
5697 some iteration. If we succeed, we consider an alternative:
5699 1. If loop unswitching is enabled, we prepend these conditions
5700 to the original conditions of the checks. This will make it
5701 possible for the loop unswitching pass to replace the loop
5702 with two loops, one of which has the checks eliminated and
5703 the other has the original checks reinstated, and a prologue
5704 implementing a run-time selection. The former loop will be
5705 for example suitable for vectorization.
5707 2. Otherwise, we instead append the conditions to the original
5708 conditions of the checks. At worse, if the conditions cannot
5709 be evaluated at compile time, they will be evaluated as true
5710 at run time only when the checks have already failed, thus
5711 contributing negatively only to the size of the executable.
5712 But the hope is that these invariant conditions be evaluated
5713 at compile time to false, thus taking away the entire checks
5714 with them. */
5717 && (!gnu_low_bound
5719 && (!gnu_high_bound
5722 {
5729 rci->inserted_cond
5736 boolean_type_node,
5738 gnu_cond);
5739 else
5741 boolean_type_node,
5742 gnu_cond,
5744 }
5746 /* Or else, if aggressive loop optimizations are enabled, we just
5747 record that there are checks applied to iteration variables. */
5749 && flag_aggressive_loop_optimizations
5753 }
5758 }
5760 /* The following processing does the common work. */
5761 common:
5768 /* If the type is VOID, this is a statement, so we need to generate the code
5769 for the call. Handle a condition, if there is one. */
5771 {
5773 {
5778 }
5779 }
5780 else
5784 }
5785 \f
5786 /* Return true if GNAT_NODE is on the LHS of an assignment or an actual
5787 parameter of a call. */
5789 static bool
5791 {
5806 }
5808 /* Return true if either GNAT_NODE or a view of GNAT_NODE is on the LHS
5809 of an assignment or an actual parameter of a call. */
5811 static bool
5813 {
5814 Node_Kind kind;
5826 }
5828 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
5829 as gigi is concerned. This is used to avoid conversions on the LHS. */
5831 static bool
5833 {
5836 /* The conversion must be on the LHS of an assignment or an actual parameter
5837 of a call. Otherwise, even if the conversion was essentially a no-op, it
5838 could de facto ensure type consistency and this should be preserved. */
5844 /* We're interested in artificial conversions generated by the front-end
5845 to make private types explicit, e.g. in Expand_Assign_Array. */
5852 /* The direct conversion to the underlying type is a no-op. */
5856 /* For an array subtype, the conversion to the PAIT is a no-op. */
5861 /* For a record subtype, the conversion to the type is a no-op. */
5867 }
5869 /* Return true if GNAT_NODE represents a statement. */
5871 static bool
5873 {
5889 }
5891 /* This function is the driver of the GNAT to GCC tree transformation process.
5892 It is the entry point of the tree transformer. GNAT_NODE is the root of
5893 some GNAT tree. Return the root of the corresponding GCC tree. If this
5894 is an expression, return the GCC equivalent of the expression. If this
5895 is a statement, return the statement or add it to the current statement
5896 group, in which case anything returned is to be interpreted as occurring
5897 after anything added. */
5899 tree
5901 {
5907 Node_Id gnat_temp;
5910 /* Save node number for error message and set location information. */
5914 /* If we are only annotating types and this node is a statement, return
5915 an empty statement list. */
5919 /* If we are only annotating types and this node is a subexpression, return
5920 a NULL_EXPR, but filter out nodes appearing in the expressions attached
5921 to packed array implementation types. */
5936 N_Raise_Constraint_Error));
5941 {
5944 /* If this is a statement and we are at top level, it must be part of
5945 the elaboration procedure, so mark us as being in that procedure. */
5947 {
5950 }
5952 /* If we are in the elaboration procedure, check if we are violating a
5953 No_Elaboration_Code restriction by having a statement there. Don't
5954 check for a possible No_Elaboration_Code restriction violation on
5955 N_Handled_Sequence_Of_Statements, as we want to signal an error on
5956 every nested real statement instead. This also avoids triggering
5957 spurious errors on dummy (empty) sequences created by the front-end
5958 for package bodies in some cases. */
5963 }
5966 {
5967 /********************************/
5968 /* Chapter 2: Lexical Elements */
5969 /********************************/
5978 /* If atomic access is required on the RHS, build the atomic load. */
5985 {
5986 tree gnu_type;
5988 /* Get the type of the result, looking inside any padding and
5989 justified modular types. Then get the value in that type. */
5998 /* If the result overflows (meaning it doesn't fit in its base type),
5999 abort. We would like to check that the value is within the range
6000 of the subtype, but that causes problems with subtypes whose usage
6001 will raise Constraint_Error and with biased representation, so
6002 we don't. */
6004 }
6008 /* If a Entity is present, it means that this was one of the
6009 literals in a user-defined character type. In that case,
6010 just return the value in the CONST_DECL. Otherwise, use the
6011 character code. In that case, the base type should be an
6012 INTEGER_TYPE, but we won't bother checking for that. */
6016 else
6017 gnu_result
6025 /* If this is of a fixed-point type, the value we want is the value of
6026 the corresponding integer. */
6028 {
6030 gnu_result_type);
6032 }
6034 else
6035 {
6038 /* First convert the value to a machine number if it isn't already.
6039 That will force the base to 2 for non-zero values and simplify
6040 the rest of the logic. */
6042 ur_realval
6048 else
6049 {
6050 REAL_VALUE_TYPE tmp;
6054 /* The base must be 2 as Machine guarantees this, so we scale
6055 the value, which we know can fit in the mantissa of the type
6056 (hence the use of that type above). */
6061 }
6063 /* Now see if we need to negate the result. Do it this way to
6064 properly handle -0. */
6066 gnu_result
6068 gnu_result);
6069 }
6076 {
6083 else
6086 /* Build the string with the characters in the literal. Note
6087 that Ada strings are 1-origin. */
6091 /* Put a null at the end of the string in case it's in a context
6092 where GCC will want to treat it as a C string. */
6097 /* Strings in GCC don't normally have types, but we want
6098 this to not be converted to the array type. */
6103 }
6104 else
6105 {
6106 /* Build a list consisting of each character, then make
6107 the aggregate. */
6117 {
6123 }
6126 }
6133 /**************************************/
6134 /* Chapter 3: Declarations and Types */
6135 /**************************************/
6152 /* If we are just annotating types and this object has an unconstrained
6153 or task type, don't elaborate it. */
6163 && (!type_annotate_only
6165 {
6168 gnu_expr
6173 }
6174 else
6177 /* If this is a deferred constant with an address clause, we ignore the
6178 full view since the clause is on the partial view and we cannot have
6179 2 different GCC trees for the object. The only bits of the full view
6180 we will use is the initializer, but it will be directly fetched. */
6186 /* If this object has its elaboration delayed, we must force evaluation
6187 of GNU_EXPR now and save it for the freeze point. Note that we need
6188 not do anything special at the global level since the lifetime of the
6189 temporary is fully contained within the elaboration routine. */
6191 {
6193 {
6196 }
6197 }
6198 else
6206 /* Don't do anything if this renaming is handled by the front end and it
6207 does not need debug info. Note that we consider renamings don't need
6208 debug info when optimizing: our way to describe them has a
6209 memory/elaboration footprint.
6211 Don't do anything neither if we are just annotating types and this
6212 object has a composite or task type, don't elaborate it. */
6215 && !optimize
6216 && can_materialize_object_renaming_p
6218 && ! (type_annotate_only
6222 {
6223 tree gnu_temp
6227 /* See case 2 of renaming in gnat_to_gnu_entity. */
6230 }
6237 /* See the above case for the rationale. */
6239 {
6240 tree gnu_temp
6246 }
6250 {
6256 /* Materializing renamed subprograms will only benefit the debugging
6257 information as they aren't referenced in the generated code. So
6258 skip them when they aren't needed. Avoid doing this if:
6260 - there is a freeze node: in this case the renamed entity is not
6261 elaborated yet,
6262 - the renamed subprogram is intrinsic: it will not be available in
6263 the debugging information (note that both or only one of the
6264 renaming and the renamed subprograms can be intrinsic). */
6275 }
6284 /* These are fully handled in the front end. */
6285 /* ??? For package renamings, find a way to use GENERIC namespaces so
6286 that we get proper debug information for them. */
6290 /*************************************/
6291 /* Chapter 4: Names and Expressions */
6292 /*************************************/
6295 /* Make sure the designated type is complete before dereferencing. */
6300 /* If atomic access is required on the RHS, build the atomic load. */
6307 {
6308 tree gnu_array_object
6310 tree gnu_type;
6317 /* Convert vector inputs to their representative array type, to fit
6318 what the code below expects. */
6320 {
6324 }
6328 /* If we got a padded type, remove it too. */
6330 gnu_array_object
6332 gnu_array_object);
6334 /* The failure of this assertion will very likely come from a missing
6335 expansion for a packed array access. */
6338 /* First compute the number of dimensions of the array, then
6339 fill the expression array, the order depending on whether
6340 this is a Convention_Fortran array or not. */
6345 ;
6354 else
6360 /* Start with the prefix and build the successive references. */
6366 {
6372 gnu_result
6375 /* Array accesses are bound-checked so they cannot trap, but this
6376 is valid only if they are not hoisted ahead of the check. We
6377 need to mark them as no-trap to get decent loop optimizations
6378 in the presence of -fnon-call-exceptions, so we do it when we
6379 know that the original expression had no side-effects. */
6385 /* If aggressive loop optimizations are enabled, we warn for loops
6386 overrunning a simple array of size 1 not at the end of a record.
6387 This is aimed to catch misuses of the trailing array idiom. */
6389 && flag_aggressive_loop_optimizations
6405 {
6408 }
6409 }
6413 /* If atomic access is required on the RHS, build the atomic load. */
6417 }
6421 {
6422 tree gnu_array_object
6433 /* If this is a slice with non-constant size of an array with constant
6434 size, set the maximum size for the allocation of temporaries. */
6442 }
6446 {
6447 Entity_Id gnat_prefix
6454 /* gnat_to_gnu_entity does not save the GNU tree made for renamed
6455 discriminants so avoid making recursive calls on each reference
6456 to them by following the appropriate link directly here. */
6458 {
6459 /* For discriminant references in tagged types always substitute
6460 the corresponding discriminant as the actual component. */
6465 /* For discriminant references in untagged types always substitute
6466 the corresponding stored discriminant. */
6469 }
6471 /* Handle extracting the real or imaginary part of a complex.
6472 The real part is the first field and the imaginary the last. */
6477 else
6478 {
6481 gnu_result
6485 && lvalue_required_for_attribute_p
6487 }
6491 /* If atomic access is required on the RHS, build the atomic load. */
6495 }
6499 {
6500 /* The attribute designator. */
6503 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
6504 is a unit, not an object with a GCC equivalent. */
6506 return
6512 gnat_node);
6515 }
6519 /* Like 'Access as far as we are concerned. */
6527 {
6528 tree gnu_aggr_type;
6530 /* ??? It is wrong to evaluate the type now, but there doesn't
6531 seem to be any other practical way of doing it. */
6535 gnu_aggr_type = gnu_result_type
6540 gnu_aggr_type
6550 gnu_result
6553 gnu_aggr_type);
6556 gnu_aggr_type,
6559 gnu_result
6560 = build_binary_op
6565 (Next
6567 else
6571 }
6579 else
6589 /* If this is a qualified expression for a tagged type, we mark the type
6590 as used. Because of polymorphism, this might be the only reference to
6591 the tagged type in the program while objects have it as dynamic type.
6592 The debugger needs to see it to display these objects properly. */
6596 gnu_result
6600 kind == N_Type_Conversion
6608 /* Skip further processing if the conversion is deemed a no-op. */
6610 {
6614 }
6616 /* If the result is a pointer type, see if we are improperly
6617 converting to a stricter alignment. */
6620 {
6626 post_error_ne_tree_2
6630 }
6632 /* If we are converting a descriptor to a function pointer, first
6633 build the pointer. */
6645 {
6654 {
6658 }
6660 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
6661 ensure that GNU_OBJ is evaluated only once and perform a full range
6662 test. */
6664 gnu_result
6666 else
6667 {
6676 gnu_result
6678 }
6681 gnu_result
6683 }
6691 ? RDIV_EXPR
6700 /* These can either be operations on booleans or on modular types.
6701 Fall through for boolean types since that's the way GNU_CODES is
6702 set up. */
6704 {
6705 enum tree_code code
6716 }
6718 /* ... fall through ... */
6738 {
6742 tree gnu_type;
6748 /* Pending generic support for efficient vector logical operations in
6749 GCC, convert vectors to their representative array type view and
6750 fallthrough. */
6754 /* If this is a comparison operator, convert any references to an
6755 unconstrained array value into a reference to the actual array. */
6757 {
6763 {
6766 }
6767 }
6769 /* If this is a shift whose count is not guaranteed to be correct,
6770 we need to adjust the shift count. */
6772 {
6774 tree gnu_max_shift
6781 gnu_rhs
6782 = build_binary_op
6785 gnu_count_type,
6786 gnu_max_shift,
6788 gnu_rhs);
6789 }
6791 /* For right shifts, the type says what kind of shift to do,
6792 so we may need to choose a different type. In this case,
6793 we have to ignore integer overflow lest it propagates all
6794 the way down and causes a CE to be explicitly raised. */
6796 {
6799 }
6802 {
6805 }
6808 {
6814 }
6816 /* Instead of expanding overflow checks for addition, subtraction
6817 and multiplication itself, the front end will leave this to
6818 the back end when Backend_Overflow_Checks_On_Target is set. */
6820 && Backend_Overflow_Checks_On_Target
6826 else
6827 {
6828 /* Some operations, e.g. comparisons of arrays, generate complex
6829 trees that need to be annotated while they are being built. */
6832 }
6834 /* If this is a logical shift with the shift count not verified,
6835 we must return zero if it is too large. We cannot compensate
6836 above in this case. */
6839 gnu_result
6840 = build_cond_expr
6843 gnu_rhs,
6847 gnu_result);
6848 }
6852 {
6855 tree gnu_false
6859 gnu_result
6861 }
6870 /* This case can apply to a boolean or a modular type.
6871 Fall through for a boolean operand since GNU_CODES is set
6872 up to handle this. */
6874 {
6878 gnu_expr);
6880 }
6882 /* ... fall through ... */
6889 /* Instead of expanding overflow checks for negation and absolute
6890 value itself, the front end will leave this to the back end
6891 when Backend_Overflow_Checks_On_Target is set. */
6893 && Backend_Overflow_Checks_On_Target
6896 gnu_result
6899 else
6905 {
6907 tree gnu_type;
6912 /* The Expression operand can either be an N_Identifier or
6913 Expanded_Name, which must represent a type, or a
6914 N_Qualified_Expression, which contains both the object type and an
6915 initial value for the object. */
6920 {
6921 Entity_Id gnat_desig_type
6929 gnu_init
6935 else
6936 {
6940 }
6942 /* See the N_Qualified_Expression case for the rationale. */
6947 }
6948 else
6955 ignore_init_type);
6956 }
6959 /**************************/
6960 /* Chapter 5: Statements */
6961 /**************************/
6969 /* When not optimizing, turn null statements from source into gotos to
6970 the next statement that the middle-end knows how to preserve. */
6972 {
6983 }
6984 else
6989 /* Get the LHS and RHS of the statement and convert any reference to an
6990 unconstrained array into a reference to the underlying array. */
6993 /* If the type has a size that overflows, convert this into raise of
6994 Storage_Error: execution shouldn't have gotten here anyway. */
6998 N_Raise_Storage_Error);
7000 {
7001 bool outer_atomic_access
7003 bool atomic_access
7004 = !outer_atomic_access
7006 gnu_result
7009 }
7010 else
7011 {
7013 const Entity_Id gnat_type
7015 const bool regular_array_type_p
7017 const bool use_memset_p
7018 = (regular_array_type_p
7022 /* If we'll use memset, we need to find the inner expression. */
7024 {
7025 Node_Id gnat_inner
7029 gnat_inner
7032 }
7033 else
7036 /* If range check is needed, emit code to generate it. */
7039 gnat_node);
7041 /* If an outer atomic access is required on the LHS, build the load-
7042 modify-store sequence. */
7046 /* Or else, if atomic access is required, build the atomic store. */
7050 /* Or else, use memset when the conditions are met. */
7052 {
7053 tree value
7055 ? integer_zero_node
7059 tree size
7064 {
7065 tree mask
7069 }
7071 }
7073 /* Otherwise build a regular assignment. */
7074 else
7075 gnu_result
7078 /* If the assignment type is a regular array and the two sides are
7079 not completely disjoint, play safe and use memmove. But don't do
7080 it for a bit-packed array as it might not be byte-aligned. */
7082 && regular_array_type_p
7084 {
7088 tree size
7094 }
7095 }
7099 {
7102 /* Make the outer COND_EXPR. Avoid non-determinism. */
7111 /* Now make a COND_EXPR for each of the "else if" parts. Put each
7112 into the previous "else" part and point to where to put any
7113 outer "else". Also avoid non-determinism. */
7117 {
7127 }
7130 }
7142 /* The only way to enter the block is to fall through to it. */
7144 {
7151 }
7152 else
7157 gnu_result
7167 {
7170 /* If the subprogram is a function, we must return the expression. */
7172 {
7175 /* If this function has copy-in/copy-out parameters parameters and
7176 doesn't return by invisible reference, get the real object for
7177 the return. See Subprogram_Body_to_gnu. */
7181 else
7184 /* Get the GCC tree for the expression to be returned. */
7187 /* Do not remove the padding from GNU_RET_VAL if the inner type is
7188 self-referential since we want to allocate the fixed size. */
7190 && type_is_padding_self_referential
7194 /* If the function returns by direct reference, return a pointer
7195 to the return value. */
7200 /* Otherwise, if it returns an unconstrained array, we have to
7201 allocate a new version of the result and return it. */
7203 {
7206 /* And find out whether this is a candidate for Named Return
7207 Value. If so, record it. */
7209 {
7212 /* Strip useless conversions around the return value. */
7216 /* Strip unpadding around the return value. */
7218 && TYPE_IS_PADDING_P
7222 /* Now apply the test to the return value. */
7224 {
7230 }
7231 }
7234 gnu_ret_val,
7239 }
7241 /* Otherwise, if it returns by invisible reference, dereference
7242 the pointer it is passed using the type of the return value
7243 and build the copy operation manually. This ensures that we
7244 don't copy too much data, for example if the return type is
7245 unconstrained with a maximum size. */
7247 {
7248 tree gnu_ret_deref
7250 gnu_ret_obj);
7255 }
7256 }
7258 else
7261 /* If we have a return label defined, convert this into a branch to
7262 that label. The return proper will be handled elsewhere. */
7264 {
7267 gnu_ret_val));
7272 /* When not optimizing, make sure the return is preserved. */
7275 }
7277 /* Otherwise, build a regular return. */
7278 else
7280 }
7289 /***************************/
7290 /* Chapter 6: Subprograms */
7291 /***************************/
7294 /* Unless there is a freeze node, declare the entity. We consider
7295 this a definition even though we're not generating code for the
7296 subprogram because we will be making the corresponding GCC node.
7297 When there is a freeze node, it is considered the definition of
7298 the subprogram and we do nothing until after it is encountered.
7299 That's an efficiency issue: the types involved in the profile
7300 are far more likely to be frozen between the declaration and
7301 the freeze node than before the declaration, so we save some
7302 updates of the GCC node by waiting until the freeze node.
7303 The counterpart is that we assume that there is no reference
7304 to the subprogram between the declaration and the freeze node
7305 in the expanded code; otherwise, it will be interpreted as an
7306 external reference and very likely give rise to a link failure. */
7314 /* This subprogram doesn't exist for code generation purposes, but we
7315 have to elaborate the types of any parameters and result, unless
7316 they are imported types (nothing to generate in this case).
7318 The parameter list may contain types with freeze nodes, e.g. not null
7319 subtypes, so the subprogram itself may carry a freeze node, in which
7320 case its elaboration must be deferred. */
7322 /* Process the parameter types first. */
7325 = First_Formal_With_Extras
7333 /* Then the result type, set to Standard_Void_Type for procedures. */
7334 {
7335 Entity_Id gnat_temp_type
7340 }
7346 /* For a child unit identifier go up a level to get the specification.
7347 We get this when we try to find the spec of a child unit package
7348 that is the compilation unit being compiled. */
7363 /************************/
7364 /* Chapter 7: Packages */
7365 /************************/
7381 /* If this is the body of a generic package - do nothing. */
7383 {
7386 }
7397 /********************************/
7398 /* Chapter 8: Visibility Rules */
7399 /********************************/
7403 /* Nothing to do here - but these may appear in list of declarations. */
7407 /*********************/
7408 /* Chapter 9: Tasks */
7409 /*********************/
7420 /*********************************************************/
7421 /* Chapter 10: Program Structure and Compilation Issues */
7422 /*********************************************************/
7425 /* This is not called for the main unit on which gigi is invoked. */
7437 /* These nodes should only be present when annotating types. */
7447 /* Simply process whatever unit is being inserted. */
7450 else
7451 {
7454 }
7457 /***************************/
7458 /* Chapter 11: Exceptions */
7459 /***************************/
7462 /* If there is an At_End procedure attached to this node, and the EH
7463 mechanism is front-end, we must have at least a corresponding At_End
7464 handler, unless the No_Exception_Handlers restriction is set. */
7479 else
7484 /* Only for reraise in back-end exceptions mode. */
7491 /* Clear the current exception pointer so that the occurrence won't be
7492 deallocated. */
7538 /******************************/
7539 /* Chapter 12: Generic Units */
7540 /******************************/
7550 /* These nodes can appear on a declaration list but there is nothing to
7551 to be done with them. */
7555 /**************************************************/
7556 /* Chapter 13: Representation Clauses and */
7557 /* Implementation-Dependent Features */
7558 /**************************************************/
7563 /* The only one we need to deal with is 'Address since, for the others,
7564 the front-end puts the information elsewhere. */
7568 /* And we only deal with 'Address if the object has a Freeze node. */
7573 /* Get the value to use as the address and save it as the equivalent
7574 for the object. When it is frozen, gnat_to_gnu_entity will do the
7575 right thing. */
7582 /* We do nothing with these. SEM puts the information elsewhere. */
7588 {
7598 /* First retrieve the 3 operand lists built by the front-end. */
7601 {
7608 }
7612 {
7619 }
7623 gnu_clobbers
7626 gnu_clobbers);
7628 /* Then perform some standard checking and processing on the
7629 operands. In particular, mark them addressable if needed. */
7637 {
7639 constraint
7645 {
7646 /* If the operand is going to end up in memory,
7647 mark it addressable. Note that we don't test
7648 allows_mem like in the input case below; this
7649 is modelled on the C front-end. */
7651 {
7658 }
7659 }
7660 else
7664 }
7667 {
7669 constraint
7675 {
7676 /* If the operand is going to end up in memory,
7677 mark it addressable. */
7679 {
7686 }
7687 }
7688 else
7692 }
7698 }
7699 else
7704 /****************/
7705 /* Added Nodes */
7706 /****************/
7708 /* Markers are created by the ABE mechanism to capture information which
7709 is either unavailable of expensive to recompute. Markers do not have
7710 and runtime semantics, and should be ignored. */
7718 /* This construct doesn't define a scope so we don't push a binding
7719 level around the statement list, but we wrap it in a SAVE_EXPR to
7720 protect it from unsharing. Elaborate the expression as part of the
7721 same statement group as the actions so that the type declaration
7722 gets inserted there as well. This ensures that the type elaboration
7723 code is issued past the actions computing values on which it might
7724 depend. */
7733 gnu_result
7757 {
7758 tree gnu_ptr
7763 /* If this is a thin pointer, we must first dereference it to create
7764 a fat pointer, then go back below to a thin pointer. The reason
7765 for this is that we need to have a fat pointer someplace in order
7766 to properly compute the size. */
7770 gnu_ptr));
7772 /* If this is a fat pointer, the object must have been allocated with
7773 the template in front of the array. So pass the template address,
7774 and get the total size; do it by converting to a thin pointer. */
7776 gnu_ptr
7778 (TYPE_OBJECT_RECORD_TYPE
7780 gnu_ptr);
7784 /* If this is a thin pointer, the object must have been allocated with
7785 the template in front of the array. So pass the template address,
7786 and get the total size. */
7788 gnu_ptr
7790 gnu_ptr,
7792 byte_position
7793 (DECL_CHAIN
7796 /* If we have a special dynamic constrained subtype on the node, use
7797 it to compute the size; otherwise, use the designated subtype. */
7799 {
7800 gnu_actual_obj_type
7804 gnu_actual_obj_type
7806 gnu_actual_obj_type,
7809 }
7810 else
7816 gnu_result
7820 gnat_node);
7821 }
7829 else
7834 /* The only validation we currently do on an unchecked conversion is
7835 that of aliasing assumptions. */
7845 /* These nodes should only be present when annotating types. */
7851 /* Other nodes are not supposed to reach here. */
7853 }
7855 /* If we pushed the processing of the elaboration routine, pop it back. */
7859 /* When not optimizing, turn boolean rvalues B into B != false tests
7860 so that we can put the location information of the reference to B on
7861 the inequality operator for better debug info. */
7872 {
7873 gnu_result
7879 }
7881 /* Set the location information on the result if it's not a simple name.
7882 Note that we may have no result if we tried to build a CALL_EXPR node
7883 to a procedure with no side-effects and optimization is enabled. */
7887 /* If we're supposed to return something of void_type, it means we have
7888 something we're elaborating for effect, so just return. */
7892 /* If the result is a constant that overflowed, raise Constraint_Error. */
7894 {
7896 gnu_result
7899 N_Raise_Constraint_Error));
7900 }
7902 /* If the result has side-effects and is of an unconstrained type, protect
7903 the expression in case it will be referenced multiple times, i.e. for
7904 its value and to compute the size of an object. But do it neither for
7905 an object nor a renaming declaration, nor a return statement of a call
7906 to a function that returns an unconstrained record type with default
7907 discriminant, because there is no size to be computed in these cases
7908 and this will create a useless temporary. We must do this before any
7909 conversions. */
7920 /* Now convert the result to the result type, unless we are in one of the
7921 following cases:
7923 1. If this is the LHS of an assignment or an actual parameter of a
7924 call, return the result almost unmodified since the RHS will have
7925 to be converted to our type in that case, unless the result type
7926 has a simpler size. Likewise if there is just a no-op unchecked
7927 conversion in-between. Similarly, don't convert integral types
7928 that are the operands of an unchecked conversion since we need
7929 to ignore those conversions (for 'Valid).
7931 2. If we have a label (which doesn't have any well-defined type), a
7932 field or an error, return the result almost unmodified. Similarly,
7933 if the two types are record types with the same name, don't convert.
7934 This will be the case when we are converting from a packable version
7935 of a type to its original type and we need those conversions to be
7936 NOPs in order for assignments into these types to work properly.
7938 3. If the type is void or if we have no result, return error_mark_node
7939 to show we have no result.
7941 4. If this is a call to a function that returns with variable size and
7942 the call is used as the expression in either an object or a renaming
7943 declaration, return the result unmodified because we want to use the
7944 return slot optimization in this case.
7946 5. Finally, if the type of the result is already correct. */
7964 && (CONTAINS_PLACEHOLDER_P
7968 {
7969 /* Remove padding only if the inner object is of self-referential
7970 size: in that case it must be an object of unconstrained type
7971 with a default discriminant and we want to avoid copying too
7972 much data. */
7975 gnu_result);
7976 }
7985 {
7986 /* Remove any padding. */
7989 gnu_result);
7990 }
8000 ;
8005 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
8012 }
8014 /* Similar to gnat_to_gnu, but discard any object that might be created in
8015 the course of the translation of GNAT_NODE, which must be an "external"
8016 expression in the sense that it will be elaborated elsewhere. */
8018 tree
8020 {
8024 /* Force the local context and create a fake scope that we zap
8025 at the end so declarations will not be stuck either in the
8026 global varpool or in the current scope. */
8028 {
8031 }
8042 /* Do not import locations from external units. */
8047 }
8048 \f
8049 /* Return true if the statement list STMT_LIST is empty. */
8051 static bool
8053 {
8054 tree_stmt_iterator tsi;
8057 {
8060 /* Anything else than an empty STMT_STMT counts as something. */
8063 }
8066 }
8068 /* Record the current code position in GNAT_NODE. */
8070 static void
8072 {
8077 }
8079 /* Insert the code for GNAT_NODE at the position saved for that node. */
8081 static void
8083 {
8086 /* It's too late to remove the STMT_STMT itself at this point. */
8091 }
8092 \f
8093 /* Start a new statement group chained to the previous group. */
8095 void
8097 {
8100 /* First see if we can get one from the free list. */
8103 else
8109 }
8111 /* Add GNU_STMT to the current statement group. If it is an expression with
8112 no effects, it is ignored. */
8114 void
8116 {
8118 }
8120 /* Similar, but the statement is always added, regardless of side-effects. */
8122 void
8124 {
8126 }
8128 /* Like add_stmt, but set the location of GNU_STMT to that of GNAT_NODE. */
8130 void
8132 {
8133 /* Do not emit a location for renamings that come from generic instantiation,
8134 they are likely to disturb debugging. */
8138 }
8140 /* Similar, but the statement is always added, regardless of side-effects. */
8142 void
8144 {
8148 }
8150 /* Add a declaration statement for GNU_DECL to the current statement group.
8151 Get SLOC from Entity_Id. */
8153 void
8155 {
8159 /* If this is a variable that Gigi is to ignore, we may have been given
8160 an ERROR_MARK. So test for it. We also might have been given a
8161 reference for a renaming. So only do something for a decl. Also
8162 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
8170 /* If we are external or global, we don't want to output the DECL_EXPR for
8171 this DECL node since we already have evaluated the expressions in the
8172 sizes and positions as globals and doing it again would be wrong. */
8174 {
8175 /* Mark everything as used to prevent node sharing with subprograms.
8176 Note that walk_tree knows how to deal with TYPE_DECL, but neither
8177 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
8181 {
8185 }
8186 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
8191 }
8192 else
8195 /* If this is a variable and an initializer is attached to it, it must be
8196 valid for the context. Similar to init_const in create_var_decl. */
8203 {
8206 {
8209 }
8211 /* If GNU_DECL has a padded type, convert it to the unpadded
8212 type so the assignment is done properly. */
8218 }
8219 }
8221 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
8223 static tree
8225 {
8231 /* Don't mark a dummy type as visited because we want to mark its sizes
8232 and fields once it's filled in. */
8240 }
8242 /* Mark nodes rooted at T with TREE_VISITED and types as having their
8243 sized gimplified. We use this to indicate all variable sizes and
8244 positions in global types may not be shared by any subprogram. */
8246 void
8248 {
8250 }
8252 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
8253 set its location to that of GNAT_NODE if present, but with column info
8254 cleared so that conditional branches generated as part of the cleanup
8255 code do not interfere with coverage analysis tools. */
8257 static void
8259 {
8263 }
8265 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
8267 void
8269 {
8272 }
8274 /* Return code corresponding to the current code group. It is normally
8275 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
8276 BLOCK or cleanups were set. */
8278 tree
8280 {
8284 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
8285 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
8286 make a BIND_EXPR. Note that we nest in that because the cleanup may
8287 reference variables in the block. */
8299 /* Remove this group from the stack and add it to the free list. */
8305 }
8307 /* Return whether the current statement group may fall through. */
8311 {
8314 else
8316 }
8318 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
8319 statements.*/
8321 static void
8323 {
8324 Node_Id gnat_node;
8330 }
8332 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
8333 If BINDING_P is true, push and pop a binding level around the list. */
8335 static tree
8337 {
8349 }
8350 \f
8351 /* Generate GIMPLE in place for the expression at *EXPR_P. */
8353 int
8356 {
8359 tree op;
8365 {
8367 /* If this is an aggregate type, build a null pointer of the appropriate
8368 type and dereference it. */
8373 integer_zero_node));
8374 /* Otherwise, just make a VAR_DECL. */
8375 else
8376 {
8379 }
8385 /* We should only do this if we are just elaborating for side-effects,
8386 but we can't know that yet. */
8393 /* If we are taking the address of a constant CONSTRUCTOR, make sure it
8394 is put into static memory. We know that it's going to be read-only
8395 given the semantics we have and it must be in static memory when the
8396 reference is in an elaboration procedure. */
8398 {
8402 }
8404 /* Replace atomic loads with their first argument. That's necessary
8405 because the gimplifier would create a temporary otherwise. */
8408 {
8411 {
8417 else
8419 }
8420 else
8422 }
8429 /* If we are view-converting a CONSTRUCTOR or a call from an aggregate
8430 type to a scalar one, explicitly create the local temporary. That's
8431 required if the type is passed by reference. */
8435 {
8444 }
8451 /* The expressions for the RM bounds must be gimplified to ensure that
8452 they are properly elaborated. See gimplify_decl_expr. */
8456 {
8461 {
8466 {
8470 }
8474 {
8478 }
8480 }
8485 }
8487 /* ... fall through ... */
8491 }
8492 }
8494 /* Generate GIMPLE in place for the statement at *STMT_P. */
8496 static enum gimplify_status
8498 {
8502 {
8508 {
8514 /* Build the condition expression from the test, if any. */
8516 {
8517 /* Deal with the optimization hints. */
8521 annot_expr_ivdep_kind),
8522 integer_zero_node);
8526 annot_expr_unroll_kind),
8527 integer_one_node);
8531 annot_expr_unroll_kind),
8536 annot_expr_no_vector_kind),
8537 integer_zero_node);
8541 annot_expr_vector_kind),
8542 integer_zero_node);
8544 gnu_cond
8547 }
8549 /* Set to emit the statements of the loop. */
8552 /* We first emit the start label and then a conditional jump to the
8553 end label if there's a top condition, then the update if it's at
8554 the top, then the body of the loop, then a conditional jump to
8555 the end label if there's a bottom condition, then the update if
8556 it's at the bottom, and finally a jump to the start label and the
8557 definition of the end label. */
8559 gnu_start_label),
8560 stmt_p);
8581 gnu_end_label),
8582 stmt_p);
8584 }
8587 /* Build a statement to jump to the corresponding end label, then
8588 see if it needs to be conditional. */
8597 }
8598 }
8599 \f
8600 /* Force a reference to each of the entities in GNAT_PACKAGE recursively.
8602 This routine is exclusively called in type_annotate mode, to compute DDA
8603 information for types in withed units, for ASIS use. */
8605 static void
8607 {
8608 Entity_Id gnat_entity;
8613 {
8616 /* We are interested only in entities visible from the main unit. */
8620 /* Skip stuff internal to the compiler. */
8630 /* Skip named numbers. */
8634 /* Skip generic declarations. */
8638 /* Skip formal objects. */
8642 /* Skip package bodies. */
8646 /* Skip limited views that point back to the main unit. */
8652 /* Skip types that aren't frozen. */
8656 /* Recurse on real packages that aren't in the main unit. */
8658 {
8662 }
8663 else
8665 }
8666 }
8668 /* Force a reference to each of the entities in packages withed by GNAT_NODE.
8669 Operate recursively but check that we aren't elaborating something more
8670 than once.
8672 This routine is exclusively called in type_annotate mode, to compute DDA
8673 information for types in withed units, for ASIS use. */
8675 static void
8677 {
8678 Entity_Id gnat_with_clause;
8680 /* Process each unit only once. As we trace the context of all relevant
8681 units transitively, including generic bodies, we may encounter the
8682 same generic unit repeatedly. */
8686 /* Save entities in all context units. A body may have an implicit_with
8687 on its own spec, if the context includes a child unit, so don't save
8688 the spec twice. */
8695 {
8705 {
8708 /* Retrieve compilation unit node of generic body. */
8713 /* If body is available, elaborate its context. */
8716 }
8717 }
8721 }
8722 \f
8723 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
8725 static void
8727 {
8732 /* If this is a package, generate code for the package body, if any. */
8734 {
8739 }
8741 /* Don't do anything for class-wide types as they are always transformed
8742 into their root type. */
8746 /* Check for an old definition if this isn't an object with address clause,
8747 since the saved GCC tree is the address expression in that case. */
8748 gnu_old
8752 /* Don't do anything for subprograms that may have been elaborated before
8753 their freeze nodes. This can happen, for example, because of an inner
8754 call in an instance body or because of previous compilation of a spec
8755 for inlining purposes. */
8763 /* If we have a non-dummy type old tree, we have nothing to do, except for
8764 aborting, since this node was never delayed as it should have been. We
8765 let this happen for concurrent types and their Corresponding_Record_Type,
8766 however, because each might legitimately be elaborated before its own
8767 freeze node, e.g. while processing the other. */
8771 {
8776 }
8778 /* Reset the saved tree, if any, and elaborate the object or type for real.
8779 If there is a full view, elaborate it and use the result. And, if this
8780 is the root type of a class-wide type, reuse it for the latter. */
8782 {
8787 {
8794 {
8797 }
8798 }
8804 }
8808 {
8817 /* Propagate back-annotations from full view to partial view. */
8827 /* The above call may have defined this entity (the simplest example
8828 of this is when we have a private enumeral type since the bounds
8829 will have the public view). */
8832 }
8833 else
8834 {
8835 tree gnu_init
8841 }
8848 /* If we have an old type and we've made pointers to this type, update those
8849 pointers. If this is a Taft amendment type in the main unit, we need to
8850 mark the type as used since other units referencing it don't see the full
8851 declaration and, therefore, cannot mark it as used themselves. */
8853 {
8860 }
8861 }
8862 \f
8863 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
8864 We make two passes, one to elaborate anything other than bodies (but
8865 we declare a function if there was no spec). The second pass
8866 elaborates the bodies.
8868 GNAT_END_LIST gives the element in the list past the end. Normally,
8869 this is Empty, but can be First_Real_Statement for a
8870 Handled_Sequence_Of_Statements.
8872 We make a complete pass through both lists if PASS1P is true, then make
8873 the second pass over both lists if PASS2P is true. The lists usually
8874 correspond to the public and private parts of a package. */
8876 static void
8879 {
8881 Node_Id gnat_decl;
8891 {
8892 /* For package specs, we recurse inside the declarations,
8893 thus taking the two pass approach inside the boundary. */
8901 /* Similarly for any declarations in the actions of a
8902 freeze node. */
8904 {
8907 }
8909 /* Package bodies with freeze nodes get their elaboration deferred
8910 until the freeze node, but the code must be placed in the right
8911 place, so record the code position now. */
8919 (Corresponding_Spec
8922 record_code_position
8925 /* We defer most subprogram bodies to the second pass. */
8927 {
8929 {
8935 }
8936 }
8938 /* For bodies and stubs that act as their own specs, the entity
8939 itself must be elaborated in the first pass, because it may
8940 be used in other declarations. */
8942 {
8943 Node_Id gnat_subprog_id
8950 }
8952 /* Concurrent stubs stand for the corresponding subprogram bodies,
8953 which are deferred like other bodies. */
8956 ;
8958 /* Renamed subprograms may not be elaborated yet at this point
8959 since renamings do not trigger freezing. Wait for the second
8960 pass to take care of them. */
8962 ;
8964 else
8966 }
8968 /* Here we elaborate everything we deferred above except for package bodies,
8969 which are elaborated at their freeze nodes. Note that we must also
8970 go inside things (package specs and freeze nodes) the first pass did. */
8976 {
8995 }
8996 }
8997 \f
8998 /* Make a unary operation of kind CODE using build_unary_op, but guard
8999 the operation by an overflow check. CODE can be one of NEGATE_EXPR
9000 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
9001 the operation is to be performed in that type. GNAT_NODE is the gnat
9002 node conveying the source location for which the error should be
9003 signaled. */
9005 static tree
9007 Node_Id gnat_node)
9008 {
9017 }
9019 /* Make a binary operation of kind CODE using build_binary_op, but guard
9020 the operation by an overflow check. CODE can be one of PLUS_EXPR,
9021 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
9022 Usually the operation is to be performed in that type. GNAT_NODE is
9023 the GNAT node conveying the source location for which the error should
9024 be signaled. */
9026 static tree
9029 {
9038 /* Assert that the precision is a power of 2. */
9041 /* Prefer a constant on the RHS to simplify checks. */
9045 {
9049 }
9053 /* If we can fold the expression to a constant, just return it.
9054 The caller will deal with overflow, no need to generate a check. */
9058 /* If no operand is a constant, we use the generic implementation. */
9060 {
9061 /* Never inline a 64-bit mult for a 32-bit target, it's way too long. */
9063 {
9068 }
9073 {
9085 }
9088 tree call
9096 return
9098 }
9100 /* If one operand is a constant, we expose the overflow condition to enable
9101 a subsequent simplication or even elimination. */
9103 {
9107 /* When rhs > 0, overflow when lhs > type_max - rhs. */
9112 /* When rhs < 0, overflow when lhs < type_min - rhs. */
9116 else
9122 {
9125 /* When lhs > 0, overflow when rhs < lhs - type_max. */
9130 /* When lhs < 0, overflow when rhs > lhs - type_min. */
9134 else
9136 }
9137 else
9138 {
9141 /* When rhs > 0, overflow when lhs < type_min + rhs. */
9146 /* When rhs < 0, overflow when lhs > type_max + rhs. */
9150 else
9152 }
9158 {
9165 /* When rhs > 1, overflow outside [type_min/rhs; type_max/rhs]. */
9166 check
9172 }
9174 {
9179 /* When rhs == -1, overflow if lhs == type_min. */
9180 check
9182 else
9183 /* When rhs < -1, overflow outside [type_max/rhs; type_min/rhs]. */
9184 check
9190 }
9191 else
9197 }
9200 }
9202 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
9203 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
9204 which we have to check. GNAT_NODE is the GNAT node conveying the source
9205 location for which the error should be signaled. */
9207 static tree
9209 {
9213 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
9214 This can for example happen when translating 'Val or 'Value. */
9218 /* Range checks can only be applied to types with ranges. */
9222 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
9223 we can't do anything since we might be truncating the bounds. No
9224 check is needed in this case. */
9230 /* Checked expressions must be evaluated only once. */
9233 /* Note that the form of the check is
9234 (not (expr >= lo)) or (not (expr <= hi))
9235 the reason for this slightly convoluted form is that NaNs
9236 are not considered to be in range in the float case. */
9237 return emit_check
9239 invert_truthvalue
9243 TYPE_MIN_VALUE
9245 invert_truthvalue
9249 TYPE_MAX_VALUE
9252 }
9253 \f
9254 /* GNU_COND contains the condition corresponding to an index, overflow or
9255 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR
9256 if GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
9257 REASON is the code that says why the exception is raised. GNAT_NODE is
9258 the node conveying the source location for which the error should be
9259 signaled.
9261 We used to propagate TREE_SIDE_EFFECTS from GNU_EXPR to the COND_EXPR,
9262 overwriting the setting inherited from the call statement, on the ground
9263 that the expression need not be evaluated just for the check. However
9264 that's incorrect because, in the GCC type system, its value is presumed
9265 to be valid so its comparison against the type bounds always yields true
9266 and, therefore, could be done without evaluating it; given that it can
9267 be a computation that overflows the bounds, the language may require the
9268 check to fail and thus the expression to be evaluated in this case. */
9270 static tree
9272 {
9273 tree gnu_call
9275 return
9281 gnu_expr);
9282 }
9283 \f
9284 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
9285 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
9286 If TRUNCATE_P true, do a float-to-integer conversion with truncation,
9287 otherwise round. GNAT_NODE is the GNAT node conveying the source location
9288 for which the error should be signaled. */
9290 static tree
9293 {
9300 /* If we are not doing any checks, the output is an integral type and the
9301 input is not a floating-point type, just do the conversion. This is
9302 required for packed array types and is simpler in all cases anyway. */
9304 && !overflow_p
9309 /* If the mode of the input base type is larger, then converting to it below
9310 may pessimize the final conversion step, for example generate a libcall
9311 instead of a simple instruction, so use a narrower type in this case. */
9318 /* First convert the expression to the base type. This will never generate
9319 code, but makes the tests below simpler. But don't do this if converting
9320 from an integer type to an unconstrained array type since then we need to
9321 get the bounds from the original (unpacked) type. */
9325 /* If overflow checks are requested, we need to be sure the result will fit
9326 in the output base type. But don't do this if the input is integer and
9327 the output floating-point. */
9330 {
9331 /* Ensure GNU_EXPR only gets evaluated once. */
9339 /* Convert the lower bounds to signed types, so we're sure we're
9340 comparing them properly. Likewise, convert the upper bounds
9341 to unsigned types. */
9344 gnu_in_lb
9349 gnu_in_ub
9353 gnu_out_lb
9357 gnu_out_ub
9360 /* Check each bound separately and only if the result bound
9361 is tighter than the bound on the input type. Note that all the
9362 types are base types, so the bounds must be constant. Also,
9363 the comparison is done in the base type of the input, which
9364 always has the proper signedness. First check for input
9365 integer (which means output integer), output float (which means
9366 both float), or mixed, in which case we always compare.
9367 Note that we have to do the comparison which would *fail* in the
9368 case of an error since if it's an FP comparison and one of the
9369 values is a NaN or Inf, the comparison will fail. */
9376 gnu_cond
9377 = invert_truthvalue
9380 gnu_out_lb)));
9388 gnu_cond
9390 invert_truthvalue
9392 gnu_input,
9394 gnu_out_ub))));
9399 }
9401 /* Now convert to the result base type. If this is a non-truncating
9402 float-to-integer conversion, round. */
9406 {
9412 /* The following calculations depend on proper rounding to even
9413 of each arithmetic operation. In order to prevent excess
9414 precision from spoiling this property, use the widest hardware
9415 floating-point type if FP_ARITH_MAY_WIDEN is true. */
9416 calc_type
9419 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
9426 /* If the input is strictly negative, subtract this value
9427 and otherwise add it from the input. For 0.5, the result
9428 is exactly between 1.0 and the machine number preceding 1.0
9429 (for calc_type). Since the last bit of 1.0 is even, this 0.5
9430 will round to 1.0, while all other number with an absolute
9431 value less than 0.5 round to 0.0. For larger numbers exactly
9432 halfway between integers, rounding will always be correct as
9433 the true mathematical result will be closer to the higher
9434 integer compared to the lower one. So, this constant works
9435 for all floating-point numbers.
9437 The reason to use the same constant with subtract/add instead
9438 of a positive and negative constant is to allow the comparison
9439 to be scheduled in parallel with retrieval of the constant and
9440 conversion of the input to the calc_type (if necessary). */
9445 gnu_comp
9447 gnu_add_pred_half
9449 gnu_subtract_pred_half
9453 }
9459 else
9462 /* Finally, do the range check if requested. Note that if the result type
9463 is a modular type, the range check is actually an overflow check. */
9465 || (overflow_p
9471 }
9472 \f
9473 /* Return true if GNU_EXPR can be directly addressed. This is the case
9474 unless it is an expression involving computation or if it involves a
9475 reference to a bitfield or to an object not sufficiently aligned for
9476 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
9477 be directly addressed as an object of this type.
9479 *** Notes on addressability issues in the Ada compiler ***
9481 This predicate is necessary in order to bridge the gap between Gigi
9482 and the middle-end about addressability of GENERIC trees. A tree
9483 is said to be addressable if it can be directly addressed, i.e. if
9484 its address can be taken, is a multiple of the type's alignment on
9485 strict-alignment architectures and returns the first storage unit
9486 assigned to the object represented by the tree.
9488 In the C family of languages, everything is in practice addressable
9489 at the language level, except for bit-fields. This means that these
9490 compilers will take the address of any tree that doesn't represent
9491 a bit-field reference and expect the result to be the first storage
9492 unit assigned to the object. Even in cases where this will result
9493 in unaligned accesses at run time, nothing is supposed to be done
9494 and the program is considered as erroneous instead (see PR c/18287).
9496 The implicit assumptions made in the middle-end are in keeping with
9497 the C viewpoint described above:
9498 - the address of a bit-field reference is supposed to be never
9499 taken; the compiler (generally) will stop on such a construct,
9500 - any other tree is addressable if it is formally addressable,
9501 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
9503 In Ada, the viewpoint is the opposite one: nothing is addressable
9504 at the language level unless explicitly declared so. This means
9505 that the compiler will both make sure that the trees representing
9506 references to addressable ("aliased" in Ada parlance) objects are
9507 addressable and make no real attempts at ensuring that the trees
9508 representing references to non-addressable objects are addressable.
9510 In the first case, Ada is effectively equivalent to C and handing
9511 down the direct result of applying ADDR_EXPR to these trees to the
9512 middle-end works flawlessly. In the second case, Ada cannot afford
9513 to consider the program as erroneous if the address of trees that
9514 are not addressable is requested for technical reasons, unlike C;
9515 as a consequence, the Ada compiler must arrange for either making
9516 sure that this address is not requested in the middle-end or for
9517 compensating by inserting temporaries if it is requested in Gigi.
9519 The first goal can be achieved because the middle-end should not
9520 request the address of non-addressable trees on its own; the only
9521 exception is for the invocation of low-level block operations like
9522 memcpy, for which the addressability requirements are lower since
9523 the type's alignment can be disregarded. In practice, this means
9524 that Gigi must make sure that such operations cannot be applied to
9525 non-BLKmode bit-fields.
9527 The second goal is achieved by means of the addressable_p predicate,
9528 which computes whether a temporary must be inserted by Gigi when the
9529 address of a tree is requested; if so, the address of the temporary
9530 will be used in lieu of that of the original tree and some glue code
9531 generated to connect everything together. */
9533 static bool
9535 {
9536 /* For an integral type, the size of the actual type of the object may not
9537 be greater than that of the expected type, otherwise an indirect access
9538 in the latter type wouldn't correctly set all the bits of the object. */
9544 /* The size of the actual type of the object may not be smaller than that
9545 of the expected type, otherwise an indirect access in the latter type
9546 would be larger than the object. But only record types need to be
9547 considered in practice for this case. */
9554 {
9559 /* All DECLs are addressable: if they are in a register, we can force
9560 them to memory. */
9565 /* Taking the address of a dereference yields the original pointer. */
9570 /* Taking the address yields a pointer to the constant pool. */
9574 /* Taking the address of a static constructor yields a pointer to the
9575 tree constant pool. */
9587 /* All rvalues are deemed addressable since taking their address will
9588 force a temporary to be created by the middle-end. */
9592 /* The address of a compound expression is that of its 2nd operand. */
9596 /* We accept &COND_EXPR as soon as both operands are addressable and
9597 expect the outcome to be the address of the selected operand. */
9603 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
9604 the field is sufficiently aligned, in case it is subject
9605 to a pragma Component_Alignment. But we don't need to
9606 check the alignment of the containing record, as it is
9607 guaranteed to be not smaller than that of its most
9608 aligned field that is not a bit-field. */
9609 && (!STRICT_ALIGNMENT
9612 /* The field of a padding record is always addressable. */
9626 {
9627 /* This is addressable if we can avoid a copy. */
9631 && (!STRICT_ALIGNMENT
9636 && (!STRICT_ALIGNMENT
9642 }
9646 }
9647 }
9648 \f
9649 /* Do the processing for the declaration of a GNAT_ENTITY, a type or subtype.
9650 If a Freeze node exists for the entity, delay the bulk of the processing.
9651 Otherwise make a GCC type for GNAT_ENTITY and set up the correspondence. */
9653 void
9655 {
9656 tree gnu_old
9659 /* If we are to delay elaboration of this type, just do any elaboration
9660 needed for expressions within the declaration and make a dummy node
9661 for it and its Full_View (if any), in case something points to it.
9662 Do not do this if it has already been done (the only way that can
9663 happen is if the private completion is also delayed). */
9665 {
9669 {
9674 {
9678 }
9679 }
9682 }
9684 /* If we saved away a dummy type for this node, it means that this made the
9685 type that corresponds to the full type of an incomplete type. Clear that
9686 type for now and then update the type in the pointers below. But, if the
9687 saved type is not dummy, it very likely means that we have a use before
9688 declaration for the type in the tree, what we really cannot handle. */
9690 {
9695 }
9697 /* Now fully elaborate the type. */
9701 /* If we have an old type and we've made pointers to this type, update those
9702 pointers. If this is a Taft amendment type in the main unit, we need to
9703 mark the type as used since other units referencing it don't see the full
9704 declaration and, therefore, cannot mark it as used themselves. */
9706 {
9711 }
9713 /* If this is a record type corresponding to a task or protected type
9714 that is a completion of an incomplete type, perform a similar update
9715 on the type. ??? Including protected types here is a guess. */
9719 {
9720 tree gnu_task_old
9730 }
9731 }
9732 \f
9733 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
9734 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting of the
9735 associations that are from RECORD_TYPE. If we see an internal record, make
9736 a recursive call to fill it in as well. */
9738 static tree
9740 {
9742 tree field;
9745 {
9748 /* _Parent is an internal field, but may have values in the aggregate,
9749 so check for values first. */
9751 {
9754 }
9757 {
9762 }
9763 else
9764 /* If we have a record subtype, the names will match, but not the
9765 actual FIELD_DECLs. */
9768 {
9771 }
9777 }
9780 }
9782 /* GNAT_ENTITY is the type of the resulting constructor, GNAT_ASSOC is the
9783 front of the Component_Associations of an N_Aggregate and GNU_TYPE is the
9784 GCC type of the corresponding record type. Return the CONSTRUCTOR. */
9786 static tree
9788 {
9791 /* We test for GNU_FIELD being empty in the case where a variant
9792 was the last thing since we don't take things off GNAT_ASSOC in
9793 that case. We check GNAT_ASSOC in case we have a variant, but it
9794 has no fields. */
9797 {
9802 /* The expander is supposed to put a single component selector name
9803 in every record component association. */
9806 /* Ignore discriminants that have Corresponding_Discriminants in tagged
9807 types since we'll be setting those fields in the parent subtype. */
9813 /* Also ignore discriminants of Unchecked_Unions. */
9818 /* Before assigning a value in an aggregate make sure range checks
9819 are done if required. Then convert to the type of the field. */
9825 /* Add the field and expression to the list. */
9827 }
9832 {
9833 /* Verify that every entry in GNU_LIST was used. */
9836 }
9839 }
9841 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
9842 the first element of an array aggregate. It may itself be an aggregate.
9843 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
9844 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
9845 for range checking. */
9847 static tree
9849 Entity_Id gnat_component_type)
9850 {
9855 {
9856 tree gnu_expr;
9858 /* If the expression is itself an array aggregate then first build the
9859 innermost constructor if it is part of our array (multi-dimensional
9860 case). */
9866 gnat_component_type);
9867 else
9868 {
9869 /* If the expression is a conversion to an unconstrained array type,
9870 skip it to avoid spilling to memory. */
9875 else
9878 /* Before assigning the element to the array, make sure it is
9879 in range. */
9882 }
9889 integer_one_node));
9890 }
9893 }
9894 \f
9895 /* Process a N_Validate_Unchecked_Conversion node. */
9897 static void
9899 {
9903 /* If the target is a pointer type, see if we are either converting from a
9904 non-pointer or from a pointer to a type with a different alias set and
9905 warn if so, unless the pointer has been marked to alias everything. */
9908 {
9918 target_alias_set)))
9919 {
9923 gnat_node);
9926 }
9927 }
9929 /* Likewise if the target is a fat pointer type, but we have no mechanism to
9930 mitigate the problem in this case, so we unconditionally warn. */
9932 {
9933 tree gnu_source_desig_type
9937 tree gnu_target_desig_type
9944 target_alias_set)))
9945 {
9949 gnat_node);
9950 }
9951 }
9952 }
9953 \f
9954 /* EXP is to be used in a context where access objects are implicitly
9955 dereferenced. Handle the cases when it is an access object. */
9957 static Node_Id
9959 {
9962 /* Make sure the designated type is complete before dereferencing. */
9967 }
9969 /* EXP is to be treated as an array or record. Handle the cases when it is
9970 an access object and perform the required dereferences. */
9972 static tree
9974 {
9975 /* If the type is a pointer, dereference it. */
9980 /* If we got a padded type, remove it too. */
9985 }
9986 \f
9987 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
9988 location and false if it doesn't. If CLEAR_COLUMN is true, set the column
9989 information to 0. */
9991 bool
9993 {
9998 {
10001 }
10008 /* We can have zero if pragma Source_Reference is in effect. */
10012 /* Translate the location. */
10013 *locus
10017 }
10019 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
10020 don't do anything if it doesn't correspond to a source location. And,
10021 if CLEAR_COLUMN is true, set the column information to 0. */
10023 static void
10025 {
10026 location_t locus;
10032 }
10034 /* More elaborate version of set_expr_location_from_node to be used in more
10035 general contexts, for example the result of the translation of a generic
10036 GNAT node. */
10038 static void
10040 {
10041 /* Set the location information on the node if it is a real expression.
10042 References can be reused for multiple GNAT nodes and they would get
10043 the location information of their last use. Also make sure not to
10044 overwrite an existing location as it is probably more precise. */
10047 {
10048 CASE_CONVERT:
10057 /* ... fall through ... */
10061 {
10064 }
10066 }
10067 }
10069 /* Set the end_locus information for GNU_NODE, if any, from an explicit end
10070 location associated with GNAT_NODE or GNAT_NODE itself, whichever makes
10071 most sense. Return true if a sensible assignment was performed. */
10073 static bool
10075 {
10076 Node_Id gnat_end_label;
10077 location_t end_locus;
10079 /* Pick the GNAT node of which we'll take the sloc to assign to the GCC node
10080 end_locus when there is one. We consider only GNAT nodes with a possible
10081 End_Label attached. If the End_Label actually was unassigned, fallback
10082 on the original node. We'd better assign an explicit sloc associated with
10083 the outer construct in any case. */
10086 {
10099 }
10104 /* Some expanded subprograms have neither an End_Label nor a Sloc
10105 attached. Notify that to callers. For a block statement with no
10106 End_Label, clear column information, so that the tree for a
10107 transient block does not receive the sloc of a source condition. */
10114 {
10125 }
10126 }
10127 \f
10128 /* Return a colon-separated list of encodings contained in encoded Ada
10129 name. */
10133 {
10137 }
10139 /* Extract the Ada name from an encoded name. */
10143 {
10147 }
10148 \f
10149 /* Post an error message. MSG is the error message, properly annotated.
10150 NODE is the node at which to post the error and the node to use for the
10151 '&' substitution. */
10153 void
10155 {
10156 String_Template temp;
10157 String_Pointer sp;
10167 }
10169 /* Similar to post_error, but NODE is the node at which to post the error and
10170 ENT is the node to use for the '&' substitution. */
10172 void
10174 {
10175 String_Template temp;
10176 String_Pointer sp;
10186 }
10188 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
10190 void
10192 {
10195 }
10197 /* Similar to post_error_ne, but T is a GCC tree representing the number to
10198 write. If T represents a constant, the text inside curly brackets in
10199 MSG will be output (presumably including a '^'). Otherwise it will not
10200 be output and the text inside square brackets will be output instead. */
10202 void
10204 {
10211 {
10214 }
10215 else
10219 {
10225 ;
10226 else
10228 }
10233 }
10235 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
10237 void
10240 {
10243 }
10245 /* Return a label to branch to for the exception type in KIND or Empty
10246 if none. */
10248 Entity_Id
10250 {
10252 {
10264 }
10267 }
10269 /* Return the decl for the current elaboration procedure. */
10271 static tree
10273 {
10275 }
10277 /* Initialize the table that maps GNAT codes to GCC codes for simple
10278 binary and unary operations. */
10280 static void
10282 {
10307 }