| blob | 2f7d497b11be1b87124ebed3d9e275df9ff2decf |
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * T R A N S *
6 * *
7 * C Implementation File *
8 * *
9 * Copyright (C) 1992-2017, 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. */
254 /* Hooks for debug info back-ends, only supported and used in a restricted set
255 of configurations. */
258 \f
259 /* This is the main program of the back-end. It sets up all the table
260 structures and then generates code. */
262 void
275 Nat number_file,
277 Entity_Id standard_boolean,
278 Entity_Id standard_integer,
279 Entity_Id standard_character,
280 Entity_Id standard_long_long_float,
281 Entity_Id standard_exception_type,
282 Int gigi_operating_mode)
283 {
284 Node_Id gnat_iter;
285 Entity_Id gnat_literal;
305 {
306 /* Use the identifier table to make a permanent copy of the filename as
307 the name table gets reallocated after Gigi returns but before all the
308 debugging information is output. The __gnat_to_canonical_file_spec
309 call translates filenames from pragmas Source_Reference that contain
310 host style syntax not understood by gdb. */
312 = IDENTIFIER_POINTER
313 (get_identifier
314 (__gnat_to_canonical_file_spec
317 /* We rely on the order isomorphism between files and line maps. */
320 /* We create the line map for a source file at once, with a fixed number
321 of columns chosen to avoid jumping over the next power of 2. */
326 }
330 /* Declare the name of the compilation unit as the first global
331 name in order to make the middle-end fully deterministic. */
335 /* Initialize ourselves. */
340 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
341 errors. */
343 {
346 }
348 /* Enable GNAT stack checking method if needed */
352 /* Retrieve alignment settings. */
356 /* Record the builtin types. Define `integer' and `character' first so that
357 dbx will output them first. */
363 /* Save the type we made for integer as the type for Standard.Integer. */
368 /* Likewise for character as the type for Standard.Character. */
374 /* Likewise for boolean as the type for Standard.Boolean. */
393 /* Declare the building blocks of function nodes. */
398 /* Now declare run-time functions. */
400 malloc_decl
402 ftype,
408 free_decl
410 ftype,
415 NULL_TREE);
416 realloc_decl
418 ftype,
422 /* This is used for 64-bit multiplication with overflow checking. */
424 mulv64_decl
431 /* Name of the _Parent field in tagged record types. */
434 /* Name of the Exception_Data type defined in System.Standard_Library. */
435 exception_data_name_id
438 /* Make the types and functions used for exception processing. */
441 jmpbuf_type
447 /* Functions to get and set the jumpbuf pointer for the current thread. */
448 get_jmpbuf_decl
449 = create_subprog_decl
454 set_jmpbuf_decl
455 = create_subprog_decl
458 NULL_TREE),
461 get_excptr_decl
462 = create_subprog_decl
465 NULL_TREE),
471 {
474 }
477 /* setjmp returns an integer and has one operand, which is a pointer to
478 a jmpbuf. */
479 setjmp_decl
480 = create_subprog_decl
483 NULL_TREE),
488 /* update_setjmp_buf updates a setjmp buffer from the current stack pointer
489 address. */
490 update_setjmp_buf_decl
491 = create_subprog_decl
498 /* Indicate that it never returns. */
501 NULL_TREE);
503 raise_nodefer_decl
504 = create_subprog_decl
508 set_exception_parameter_decl
509 = create_subprog_decl
512 NULL_TREE),
515 /* Hooks to call when entering/leaving an exception handler. */
518 begin_handler_decl
522 Empty);
523 /* __gnat_begin_handler is a dummy procedure. */
526 end_handler_decl
530 Empty);
532 unhandled_except_decl
536 Empty);
538 /* Indicate that it never returns. */
540 reraise_zcx_decl
544 Empty);
546 /* Dummy objects to materialize "others" and "all others" in the exception
547 tables. These are exported by a-exexpr-gcc.adb, so see this unit for
548 the types to use. */
549 others_decl
556 all_others_decl
563 unhandled_others_decl
570 /* If in no exception handlers mode, all raise statements are redirected to
571 __gnat_last_chance_handler. No need to redefine raise_nodefer_decl since
572 this procedure will never be called in this mode. */
574 {
575 /* Indicate that it never returns. */
580 tree decl
581 = create_subprog_decl
584 Empty);
587 }
588 else
589 {
590 /* Otherwise, make one decl for each exception reason. */
596 i == CE_Index_Check_Failed
600 }
602 /* Build the special descriptor type and its null node if needed. */
604 {
616 {
617 tree field
624 elt--;
625 }
630 }
632 longest_float_type_node
637 /* If we are using the GCC exception mechanism, let GCC know. */
641 /* Initialize the GCC support for FP operations. */
644 /* Install the builtins we might need, either internally or as user-available
645 facilities for Intrinsic imports. Note that this must be done after the
646 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. */
1856 {
1857 /* If this is a dereference and we have a special dynamic constrained
1858 subtype on the prefix, use it to compute the size; otherwise, use
1859 the designated subtype. */
1861 {
1862 Node_Id gnat_actual_subtype
1864 tree gnu_ptr_type
1869 {
1870 tree gnu_actual_obj_type
1872 gnu_type
1874 gnu_actual_obj_type,
1877 }
1878 }
1881 }
1883 /* Otherwise, the result is the RM size of the type. */
1884 else
1887 /* Deal with a self-referential size by returning the maximum size for
1888 a type and by qualifying the size with the object otherwise. */
1890 {
1893 else
1895 }
1897 /* If the type contains a template, subtract its size. */
1903 /* For 'Max_Size_In_Storage_Elements, adjust the unit. */
1911 {
1924 else
1925 {
1930 /* If the default alignment of "double" or larger scalar types is
1931 specifically capped and there is an alignment clause neither
1932 on the type nor on the prefix itself, return the cap. */
1934 is_capped_double
1937 is_capped_double
1939 else
1949 else
1951 }
1954 }
1963 {
1970 else
1973 }
1975 /* ... fall through ... */
1978 {
1986 /* Make sure any implicit dereference gets done. */
1990 /* We treat unconstrained array In parameters specially. We also note
1991 whether we are dereferencing a pointer to unconstrained array. */
1994 {
1996 /* This is the direct case. */
2002 /* This is the indirect case. Note that we need to be sure that
2003 the access value cannot be null as we'll hoist the load. */
2006 {
2009 }
2010 else
2016 }
2018 /* If the prefix is the view conversion of a constrained array to an
2019 unconstrained form, we retrieve the constrained array because we
2020 might not be able to substitute the PLACEHOLDER_EXPR coming from
2021 the conversion. This can occur with the 'Old attribute applied
2022 to a parameter with an unconstrained type, which gets rewritten
2023 into a constrained local variable very late in the game. */
2026 && !CONTAINS_PLACEHOLDER_P
2029 else
2036 {
2038 tree gnu_type_temp;
2044 ;
2047 }
2054 /* When not optimizing, look up the slot associated with the parameter
2055 and the dimension in the cache and create a new one on failure.
2056 Don't do this when the actual subtype needs debug info (this happens
2057 with -gnatD): in elaborate_expression_1, we create variables that
2058 hold the bounds, so caching attributes isn't very interesting and
2059 causes dependency issues between these variables and cached
2060 expressions. */
2065 {
2071 {
2076 }
2077 }
2079 /* Return the cached expression or build a new one. */
2081 {
2083 {
2086 }
2088 gnu_result
2090 }
2093 {
2095 {
2098 }
2100 gnu_result
2102 }
2105 {
2107 {
2110 }
2112 gnu_result
2114 gnu_result_type);
2115 }
2117 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2118 handling. Note that these attributes could not have been used on
2119 an unconstrained array type. */
2122 /* Cache the expression we have just computed. Since we want to do it
2123 at run time, we force the use of a SAVE_EXPR and let the gimplifier
2124 create the temporary in the outermost binding level. We will make
2125 sure in Subprogram_Body_to_gnu that it is evaluated on all possible
2126 paths by forcing its evaluation on entry of the function. */
2128 {
2129 gnu_result
2132 {
2148 }
2149 }
2151 /* Otherwise, evaluate it each time it is referenced. */
2152 else
2154 {
2157 /* If we are dereferencing a pointer to unconstrained array, we
2158 need to capture the value because the pointed-to bounds may
2159 subsequently be released. */
2161 gnu_result
2167 /* Set the source location onto the predicate of the condition
2168 but not if the expression is cached to avoid messing up the
2169 debug info. */
2173 gnat_node);
2178 }
2181 }
2188 {
2189 HOST_WIDE_INT bitsize;
2190 HOST_WIDE_INT bitpos;
2191 tree gnu_offset;
2192 tree gnu_field_bitpos;
2193 tree gnu_field_offset;
2194 tree gnu_inner;
2195 machine_mode mode;
2202 /* We can have 'Bit on any object, but if it isn't a COMPONENT_REF,
2203 the result is 0. Don't allow 'Bit on a bare component, though. */
2207 {
2210 }
2212 else
2221 {
2229 {
2230 gnu_field_bitpos
2233 gnu_field_offset
2236 }
2237 }
2239 {
2242 }
2243 else
2244 {
2247 }
2250 {
2264 /* ??? Avoid a large unsigned result that will overflow when
2265 converted to the signed universal_integer. */
2268 else
2269 gnu_result
2276 }
2278 /* If this has a PLACEHOLDER_EXPR, qualify it by the object we are
2279 handling. */
2282 }
2286 {
2292 /* The result of {MIN,MAX}_EXPR is unspecified if either operand is
2293 a NaN so we implement the semantics of C99 f{min,max} to make it
2294 predictable in this case: if either operand is a NaN, the other
2295 is returned; if both operands are NaN's, a NaN is returned. */
2298 {
2304 /* If the operands have side-effects, they need to be evaluated
2305 only once in spite of the multiple references in the result. */
2313 integer_zero_node);
2317 integer_zero_node);
2327 /* If the operands have side-effects, they need to be evaluated
2328 before doing the tests above since the place they otherwise
2329 would end up being evaluated at run time could be wrong. */
2331 gnu_result
2335 gnu_result
2337 }
2338 else
2342 }
2368 /* Note this size cannot be self-referential. */
2378 /* What we want is the offset of the ARRAY field in the record
2379 that the thin pointer designates. */
2387 /* This is just a zero cast to the pointer type for our prefix and
2388 dereferenced. */
2390 gnu_result
2393 integer_zero_node));
2398 {
2405 {
2410 ;
2411 }
2419 && (DECL_BY_COMPONENT_PTR_P
2423 }
2427 /* We treat Model as identical to Machine. This is true for at least
2428 IEEE and some other nice floating-point systems. */
2430 /* ... fall through ... */
2433 /* The trick is to force the compiler to store the result in memory so
2434 that we do not have extra precision used. But do this only when this
2435 is necessary, i.e. if FP_ARITH_MAY_WIDEN is true and the precision of
2436 the type is lower than that of the longest floating-point type. */
2443 && fp_arith_may_widen
2446 {
2448 tree field
2458 asm_expr
2470 gnu_result
2474 }
2481 /* This can be a random address so build an alias-all pointer type. */
2482 gnu_expr
2485 gnu_expr);
2490 /* This abort means that we have an unimplemented attribute. */
2492 }
2494 /* If this is an attribute where the prefix was unused, force a use of it if
2495 it has a side-effect. But don't do it if the prefix is just an entity
2496 name. However, if an access check is needed, we must do it. See second
2497 example in AARM 11.6(5.e). */
2501 gnu_result
2506 }
2507 \f
2508 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Case_Statement,
2509 to a GCC tree, which is returned. */
2511 static tree
2513 {
2515 Node_Id gnat_when;
2516 location_t end_locus;
2524 /* We build a SWITCH_EXPR that contains the code with interspersed
2525 CASE_LABEL_EXPRs for each label. */
2534 {
2536 Node_Id gnat_choice;
2538 /* First compile all the different case choices for the current WHEN
2539 alternative. */
2543 {
2548 {
2563 /* This represents either a subtype range or a static value of
2564 some kind; Ekind says which. */
2566 {
2572 }
2574 /* ... fall through ... */
2586 }
2588 /* Everything should be folded into constants at this point. */
2598 gnat_choice);
2600 }
2602 /* This construct doesn't define a scope so we shouldn't push a binding
2603 level around the statement list. Except that we have always done so
2604 historically and this makes it possible to reduce stack usage. As a
2605 compromise, we keep doing it for case statements, for which this has
2606 never been problematic, but not for case expressions in Ada 2012. */
2608 {
2609 const bool is_case_expression
2611 tree group
2616 {
2621 }
2622 }
2623 }
2625 /* Now emit a definition of the label the cases branch to, if any. */
2628 gnu_result
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). */
3197 {
3202 }
3203 }
3205 /* Second, if loop vectorization is enabled and the iterations of the
3206 loop can easily be proved as independent, mark the loop. */
3208 && flag_tree_loop_vectorize
3215 }
3217 /* If we have an outer COND_EXPR, that's our result and this loop is its
3218 "true" statement. Otherwise, the result is the LOOP_STMT. */
3220 {
3224 }
3225 else
3231 }
3232 \f
3233 /* This page implements a form of Named Return Value optimization modelled
3234 on the C++ optimization of the same name. The main difference is that
3235 we disregard any semantical considerations when applying it here, the
3236 counterpart being that we don't try to apply it to semantically loaded
3237 return types, i.e. types with the TYPE_BY_REFERENCE_P flag set.
3239 We consider a function body of the following GENERIC form:
3241 return_type R1;
3242 [...]
3243 RETURN_EXPR [<retval> = ...]
3244 [...]
3245 RETURN_EXPR [<retval> = R1]
3246 [...]
3247 return_type Ri;
3248 [...]
3249 RETURN_EXPR [<retval> = ...]
3250 [...]
3251 RETURN_EXPR [<retval> = Ri]
3252 [...]
3254 where the Ri are not addressable and we try to fulfill a simple criterion
3255 that would make it possible to replace one or several Ri variables by the
3256 single RESULT_DECL of the function.
3258 The first observation is that RETURN_EXPRs that don't directly reference
3259 any of the Ri variables on the RHS of their assignment are transparent wrt
3260 the optimization. This is because the Ri variables aren't addressable so
3261 any transformation applied to them doesn't affect the RHS; moreover, the
3262 assignment writes the full <retval> object so existing values are entirely
3263 discarded.
3265 This property can be extended to some forms of RETURN_EXPRs that reference
3266 the Ri variables, for example CONSTRUCTORs, but isn't true in the general
3267 case, in particular when function calls are involved.
3269 Therefore the algorithm is as follows:
3271 1. Collect the list of candidates for a Named Return Value (Ri variables
3272 on the RHS of assignments of RETURN_EXPRs) as well as the list of the
3273 other expressions on the RHS of such assignments.
3275 2. Prune the members of the first list (candidates) that are referenced
3276 by a member of the second list (expressions).
3278 3. Extract a set of candidates with non-overlapping live ranges from the
3279 first list. These are the Named Return Values.
3281 4. Adjust the relevant RETURN_EXPRs and replace the occurrences of the
3282 Named Return Values in the function with the RESULT_DECL.
3284 If the function returns an unconstrained type, things are a bit different
3285 because the anonymous return object is allocated on the secondary stack
3286 and RESULT_DECL is only a pointer to it. Each return object can be of a
3287 different size and is allocated separately so we need not care about the
3288 addressability and the aforementioned overlapping issues. Therefore, we
3289 don't collect the other expressions and skip step #2 in the algorithm. */
3291 struct nrv_data
3292 {
3293 bitmap nrv;
3294 tree result;
3295 Node_Id gnat_ret;
3297 };
3299 /* Return true if T is a Named Return Value. */
3303 {
3305 }
3307 /* Helper function for walk_tree, used by finalize_nrv below. */
3309 static tree
3311 {
3315 /* No need to walk into types or decls. */
3323 }
3325 /* Prune Named Return Values in BLOCK and return true if there is still a
3326 Named Return Value in BLOCK or one of its sub-blocks. */
3328 static bool
3330 {
3332 tree t;
3334 /* First recurse on the sub-blocks. */
3338 /* Then make sure to keep at most one NRV per block. */
3341 {
3344 else
3346 }
3349 }
3351 /* Helper function for walk_tree, used by finalize_nrv below. */
3353 static tree
3355 {
3359 /* No need to walk into types. */
3363 /* Change RETURN_EXPRs of NRVs to just refer to the RESULT_DECL; this is a
3364 nop, but differs from using NULL_TREE in that it indicates that we care
3365 about the value of the RESULT_DECL. */
3368 {
3371 /* Strip useless conversions around the return value. */
3377 }
3379 /* Replace the DECL_EXPR of NRVs with an initialization of the RESULT_DECL,
3380 if needed. */
3383 {
3387 {
3392 }
3393 else
3397 /* Identify the NRV to the RESULT_DECL for debugging purposes. */
3400 /* ??? Kludge to avoid an assertion failure during inlining. */
3403 }
3405 /* And replace all uses of NRVs with the RESULT_DECL. */
3409 /* Avoid walking into the same tree more than once. Unfortunately, we
3410 can't just use walk_tree_without_duplicates because it would only
3411 call us for the first occurrence of NRVs in the function body. */
3416 }
3418 /* Likewise, but used when the function returns an unconstrained type. */
3420 static tree
3422 {
3426 /* No need to walk into types. */
3430 /* We need to see the DECL_EXPR of NRVs before any other references so we
3431 walk the body of BIND_EXPR before walking its variables. */
3435 /* Change RETURN_EXPRs of NRVs to assign to the RESULT_DECL only the final
3436 return value built by the allocator instead of the whole construct. */
3439 {
3442 /* This is the construct returned by the allocator. */
3445 {
3450 else
3452 }
3454 /* Strip useless conversions around the return value. */
3459 /* Strip unpadding around the return value. */
3464 /* Assign the new return value to the RESULT_DECL. */
3468 }
3470 /* Adjust the DECL_EXPR of NRVs to call the allocator and save the result
3471 into a new variable. */
3474 {
3481 /* Create an artificial context to build the allocation. */
3486 /* This will return a COMPOUND_EXPR with the allocation in the first
3487 arm and the final return value in the second arm. */
3494 /* The new variable is built as a reference to the allocated space. */
3495 new_var
3501 {
3504 /* The new initial value is a COMPOUND_EXPR with the allocation in
3505 the first arm and the value of P_ARRAY in the second arm. */
3511 /* Build a modified CONSTRUCTOR that references NEW_VAR. */
3518 }
3519 else
3520 {
3521 /* The new initial value is just the allocation. */
3524 }
3528 /* Destroy the artificial context and insert the new statements. */
3533 /* Chain NEW_VAR immediately after VAR and ignore the latter. */
3538 /* Save the new return value and the dereference of NEW_VAR. */
3542 /* ??? Kludge to avoid messing up during inlining. */
3544 }
3546 /* And replace all uses of NRVs with the dereference of NEW_VAR. */
3550 /* Avoid walking into the same tree more than once. Unfortunately, we
3551 can't just use walk_tree_without_duplicates because it would only
3552 call us for the first occurrence of NRVs in the function body. */
3557 }
3559 /* Finalize the Named Return Value optimization for FNDECL. The NRV bitmap
3560 contains the candidates for Named Return Value and OTHER is a list of
3561 the other return values. GNAT_RET is a representative return node. */
3563 static void
3565 {
3568 walk_tree_fn func;
3570 tree iter;
3572 /* We shouldn't be applying the optimization to return types that we aren't
3573 allowed to manipulate freely. */
3576 /* Prune the candidates that are referenced by other return values. */
3586 /* Prune also the candidates that are referenced by nested functions. */
3594 /* Extract a set of NRVs with non-overlapping live ranges. */
3598 /* Adjust the relevant RETURN_EXPRs and replace the occurrences of NRVs. */
3605 else
3609 }
3611 /* Return true if RET_VAL can be used as a Named Return Value for the
3612 anonymous return object RET_OBJ. */
3614 static bool
3616 {
3629 /* For the constrained case, test for addressability. */
3633 /* For the constrained case, test for overalignment. */
3637 /* For the unconstrained case, test for bogus initialization. */
3644 }
3646 /* Build a RETURN_EXPR. If RET_VAL is non-null, build a RETURN_EXPR around
3647 the assignment of RET_VAL to RET_OBJ. Otherwise build a bare RETURN_EXPR
3648 around RESULT_OBJ, which may be null in this case. */
3650 static tree
3652 {
3653 tree result_expr;
3656 {
3657 /* The gimplifier explicitly enforces the following invariant:
3659 RETURN_EXPR
3660 |
3661 INIT_EXPR
3662 / \
3663 / \
3664 RET_OBJ ...
3666 As a consequence, type consistency dictates that we use the type
3667 of the RET_OBJ as the operation type. */
3670 /* Convert the right operand to the operation type. Note that this is
3671 the transformation applied in the INIT_EXPR case of build_binary_op,
3672 with the assumption that the type cannot involve a placeholder. */
3676 /* We always can use an INIT_EXPR for the return object. */
3679 /* If the function returns an aggregate type, find out whether this is
3680 a candidate for Named Return Value. If so, record it. Otherwise,
3681 if this is an expression of some kind, record it elsewhere. */
3687 {
3688 /* Strip useless conversions around the return value. */
3692 /* Now apply the test to the return value. */
3694 {
3698 }
3700 /* Note that we need not care about CONSTRUCTORs here, as they are
3701 totally transparent given the read-compose-write semantics of
3702 assignments from CONSTRUCTORs. */
3705 }
3706 }
3707 else
3711 }
3712 \f
3713 /* Subroutine of gnat_to_gnu to process gnat_node, an N_Subprogram_Body. We
3714 don't return anything. */
3716 static void
3718 {
3719 /* Defining identifier of a parameter to the subprogram. */
3720 Entity_Id gnat_param;
3721 /* The defining identifier for the subprogram body. Note that if a
3722 specification has appeared before for this body, then the identifier
3723 occurring in that specification will also be a defining identifier and all
3724 the calls to this subprogram will point to that specification. */
3725 Entity_Id gnat_subprog_id
3728 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
3729 tree gnu_subprog_decl;
3730 /* Its RESULT_DECL node. */
3731 tree gnu_result_decl;
3732 /* Its FUNCTION_TYPE node. */
3733 tree gnu_subprog_type;
3734 /* The TYPE_CI_CO_LIST of its FUNCTION_TYPE node, if any. */
3735 tree gnu_cico_list;
3736 /* The entry in the CI_CO_LIST that represents a function return, if any. */
3738 tree gnu_result;
3739 location_t locus;
3743 /* If this is a generic object or if it has been eliminated,
3744 ignore it. */
3750 /* If this subprogram acts as its own spec, define it. Otherwise, just get
3751 the already-elaborated tree node. However, if this subprogram had its
3752 elaboration deferred, we will already have made a tree node for it. So
3753 treat it as not being defined in that case. Such a subprogram cannot
3754 have an address clause or a freeze node, so this test is safe, though it
3755 does disable some otherwise-useful error checking. */
3756 gnu_subprog_decl
3767 /* If the function returns by invisible reference, make it explicit in the
3768 function body. See gnat_to_gnu_entity, E_Subprogram_Type case. */
3770 {
3774 }
3776 /* Set the line number in the decl to correspond to that of the body. */
3780 /* Initialize the information structure for the function. */
3789 /* If there are copy-in/copy-out parameters, we need to ensure that they are
3790 properly copied out by the return statement. We do this by making a new
3791 block and converting any return into a goto to a label at the end of the
3792 block. */
3794 {
3803 /* If this is a function with copy-in/copy-out parameters and which does
3804 not return by invisible reference, we also need a variable for the
3805 return value to be placed. */
3807 {
3808 tree gnu_return_type
3811 gnu_return_var
3817 }
3821 /* See whether there are parameters for which we don't have a GCC tree
3822 yet. These must be Out parameters. Make a VAR_DECL for them and
3823 put it into TYPE_CI_CO_LIST, which must contain an empty entry too.
3824 We can match up the entries because TYPE_CI_CO_LIST is in the order
3825 of the parameters. */
3830 {
3832 tree gnu_decl;
3834 /* Skip any entries that have been already filled in; they must
3835 correspond to In Out parameters. */
3839 /* Do any needed dereferences for by-ref objects. */
3845 /* Do any needed references for padded types. */
3848 }
3849 }
3850 else
3853 /* Get a tree corresponding to the code for the subprogram. */
3859 /* Generate the code of the subprogram itself. A return statement will be
3860 present and any Out parameters will be handled there. */
3865 /* If we populated the parameter attributes cache, we need to make sure that
3866 the cached expressions are evaluated on all the possible paths leading to
3867 their uses. So we force their evaluation on entry of the function. */
3870 {
3877 {
3884 }
3890 }
3892 /* If we are dealing with a return from an Ada procedure with parameters
3893 passed by copy-in/copy-out, we need to return a record containing the
3894 final values of these parameters. If the list contains only one entry,
3895 return just that entry though.
3897 For a full description of the copy-in/copy-out parameter mechanism, see
3898 the part of the gnat_to_gnu_entity routine dealing with the translation
3899 of subprograms.
3901 We need to make a block that contains the definition of that label and
3902 the copying of the return value. It first contains the function, then
3903 the label and copy statement. */
3905 {
3906 const Node_Id gnat_end_label
3915 /* If this is a function which returns by invisible reference, the
3916 return value has already been dealt with at the return statements,
3917 so we only need to indirectly copy out the parameters. */
3919 {
3920 tree gnu_ret_deref
3922 tree t;
3927 {
3928 tree gnu_field_deref
3933 }
3934 }
3936 /* Otherwise, if this is a procedure or a function which does not return
3937 by invisible reference, we can do a direct block-copy out. */
3938 else
3939 {
3940 tree gnu_retval;
3944 else
3945 gnu_retval
3947 gnu_cico_list);
3951 }
3955 }
3959 /* Attempt setting the end_locus of our GCC body tree, typically a
3960 BIND_EXPR or STATEMENT_LIST, then the end_locus of our GCC subprogram
3961 declaration tree. */
3965 /* On SEH targets, install an exception handler around the main entry
3966 point to catch unhandled exceptions. */
3969 {
3970 tree t;
3971 tree etype;
3983 }
3987 /* Finally annotate the parameters and disconnect the trees for parameters
3988 that we have turned into variables since they are now unusable. */
3992 {
4001 }
4003 /* Disconnect the variable created for the return value. */
4007 /* If the function returns an aggregate type and we have candidates for
4008 a Named Return Value, finalize the optimization. */
4010 {
4017 }
4019 /* If this is an inlined external function that has been marked uninlinable,
4020 drop the body and stop there. Otherwise compile the body. */
4023 else
4025 }
4026 \f
4027 /* Return true if GNAT_NODE references an Atomic entity. */
4029 static bool
4031 {
4032 Entity_Id gnat_entity;
4035 {
4054 /* ... fall through ... */
4061 }
4064 }
4066 /* Return true if GNAT_NODE references a Volatile_Full_Access entity. */
4068 static bool
4070 {
4071 Entity_Id gnat_entity;
4074 {
4092 }
4095 }
4097 /* Strip any type conversion on GNAT_NODE and return the result. */
4099 static Node_Id
4101 {
4108 }
4110 /* Return true if GNAT_NODE requires outer atomic access, i.e. atomic access
4111 of an object of which GNAT_NODE is a component. */
4113 static bool
4115 {
4119 {
4121 {
4126 gnat_node
4140 }
4141 }
4144 }
4146 /* Return true if GNAT_NODE requires atomic access and set SYNC according to
4147 the associated synchronization setting. */
4149 static bool
4151 {
4156 /* First, scan the parent to find out cases where the flag is irrelevant. */
4158 {
4161 /* Do not mess up machine code insertions. */
4165 /* Nothing to do if we are the prefix of an attribute, since we do not
4166 want an atomic access for things like 'Size. */
4168 /* ... fall through ... */
4171 /* The N_Reference node is like an attribute. */
4179 /* If we are the prefix, then the access is only partial. */
4185 /* Nothing to do for the identifier in an object renaming declaration,
4186 the renaming itself does not need atomic access. */
4191 }
4193 /* Then, scan the node to find the atomic object. */
4196 /* For Atomic itself, only reads and updates of the object as a whole require
4197 atomic access (RM C.6 (15)). But for Volatile_Full_Access, all reads and
4198 updates require atomic access. */
4203 /* If an outer atomic access will also be required, it cancels this one. */
4210 }
4211 \f
4212 /* Create a temporary variable with PREFIX and TYPE, and return it. */
4214 static tree
4216 {
4217 tree gnu_temp
4223 }
4225 /* Create a temporary variable with PREFIX and initialize it with GNU_INIT.
4226 Put the initialization statement into GNU_INIT_STMT and annotate it with
4227 the SLOC of GNAT_NODE. Return the temporary variable. */
4229 static tree
4231 Node_Id gnat_node)
4232 {
4239 }
4241 /* Subroutine of gnat_to_gnu to translate gnat_node, either an N_Function_Call
4242 or an N_Procedure_Call_Statement, to a GCC tree, which is returned.
4243 GNU_RESULT_TYPE_P is a pointer to where we should place the result type.
4244 If GNU_TARGET is non-null, this must be a function call on the RHS of a
4245 N_Assignment_Statement and the result is to be placed into that object.
4246 If OUTER_ATOMIC_ACCESS is true, then the assignment to GNU_TARGET must be a
4247 load-modify-store sequence. Otherwise, if ATOMIC_ACCESS is true, then the
4248 assignment to GNU_TARGET must be atomic. If, in addition, ATOMIC_SYNC is
4249 true, then the assignment to GNU_TARGET requires atomic synchronization. */
4251 static tree
4254 {
4257 /* The GCC node corresponding to the GNAT subprogram name. This can either
4258 be a FUNCTION_DECL node if we are dealing with a standard subprogram call,
4259 or an indirect reference expression (an INDIRECT_REF node) pointing to a
4260 subprogram. */
4262 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
4264 /* The return type of the FUNCTION_TYPE. */
4276 Entity_Id gnat_formal;
4277 Node_Id gnat_actual;
4282 /* If we are calling a stubbed function, raise Program_Error, but Elaborate
4283 all our args first. */
4285 {
4295 {
4298 }
4301 }
4303 /* For a call to a nested function, check the inlining status. */
4308 /* The only way we can be making a call via an access type is if Name is an
4309 explicit dereference. In that case, get the list of formal args from the
4310 type the access type is pointing to. Otherwise, get the formals from the
4311 entity being called. */
4313 {
4316 /* If the access type doesn't require foreign-compatible representation,
4317 be prepared for descriptors. */
4321 }
4323 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
4325 else
4328 /* The lifetime of the temporaries created for the call ends right after the
4329 return value is copied, so we can give them the scope of the elaboration
4330 routine at top level. */
4332 {
4335 }
4337 /* First, create the temporary for the return value when:
4339 1. There is no target and the function has copy-in/copy-out parameters,
4340 because we need to preserve the return value before copying back the
4341 parameters.
4343 2. There is no target and the call is made for neither an object nor a
4344 renaming declaration, nor a return statement, nor an allocator, and
4345 the return type has variable size because in this case the gimplifier
4346 cannot create the temporary, or more generally is simply an aggregate
4347 type, because the gimplifier would then create the temporary in the
4348 outermost scope instead of locally.
4350 3. There is a target and it is a slice or an array with fixed size,
4351 and the return type has variable size, because the gimplifier
4352 doesn't handle these cases.
4354 4. There is no target and we have misaligned In Out or Out parameters
4355 passed by reference, because we need to preserve the return value
4356 before copying back the parameters. However, in this case, we'll
4357 defer creating the temporary, see below.
4359 This must be done before we push a binding level around the call, since
4360 we will pop it before copying the return value. */
4363 || (!gnu_target
4371 || (gnu_target
4377 {
4380 }
4382 /* If we don't need a value or have already created it, push a binding level
4383 around the call. This will narrow the lifetime of the temporaries we may
4384 need to make when translating the parameters as much as possible. */
4386 {
4390 }
4392 /* Create the list of the actual parameters as GCC expects it, namely a
4393 chain of TREE_LIST nodes in which the TREE_VALUE field of each node
4394 is an expression and the TREE_PURPOSE field is null. But skip Out
4395 parameters not passed by reference and that need not be copied in. */
4400 {
4405 const bool is_true_formal_parm
4407 const bool is_by_ref_formal_parm
4408 = is_true_formal_parm
4411 /* In the Out or In Out case, we must suppress conversions that yield
4412 an lvalue but can nevertheless cause the creation of a temporary,
4413 because we need the real object in this case, either to pass its
4414 address if it's passed by reference or as target of the back copy
4415 done after the call if it uses the copy-in/copy-out mechanism.
4416 We do it in the In case too, except for an unchecked conversion
4417 to an elementary type or a constrained composite type because it
4418 alone can cause the actual to be misaligned and the addressability
4419 test is applied to the real object. */
4420 const bool suppress_type_conversion
4427 Node_Id gnat_name = suppress_type_conversion
4431 /* If it's possible we may need to use this expression twice, make sure
4432 that any side-effects are handled via SAVE_EXPRs; likewise if we need
4433 to force side-effects before the call. */
4435 {
4439 gnu_name
4441 }
4443 /* If we are passing a non-addressable parameter by reference, pass the
4444 address of a copy. In the Out or In Out case, set up to copy back
4445 out after the call. */
4449 {
4453 /* Do not issue warnings for CONSTRUCTORs since this is not a copy
4454 but sort of an instantiation for them. */
4456 ;
4458 /* If the type is passed by reference, a copy is not allowed. */
4461 gnat_actual);
4463 /* For users of Starlet we issue a warning because the interface
4464 apparently assumes that by-ref parameters outlive the procedure
4465 invocation. The code still will not work as intended, but we
4466 cannot do much better since low-level parts of the back-end
4467 would allocate temporaries at will because of the misalignment
4468 if we did not do so here. */
4470 {
4471 post_error
4473 post_error_ne
4477 gnat_formal);
4478 }
4480 /* If the actual type of the object is already the nominal type,
4481 we have nothing to do, except if the size is self-referential
4482 in which case we'll remove the unpadding below. */
4485 ;
4487 /* Otherwise remove the unpadding from all the objects. */
4489 && TYPE_IS_PADDING_P
4493 /* Otherwise convert to the nominal type of the object if needed.
4494 There are several cases in which we need to make the temporary
4495 using this type instead of the actual type of the object when
4496 they are distinct, because the expectations of the callee would
4497 otherwise not be met:
4498 - if it's a justified modular type,
4499 - if the actual type is a smaller form of it,
4500 - if it's a smaller form of the actual type. */
4504 gnu_name_type)))
4510 /* If this is an In Out or Out parameter and we're returning a value,
4511 we need to create a temporary for the return value because we must
4512 preserve it before copying back at the very end. */
4514 {
4517 }
4519 /* If we haven't pushed a binding level, push it now. This will
4520 narrow the lifetime of the temporary we are about to make as
4521 much as possible. */
4523 {
4527 }
4529 /* Create an explicit temporary holding the copy. */
4530 gnu_temp
4533 /* But initialize it on the fly like for an implicit temporary as
4534 we aren't necessarily having a statement list. */
4536 gnu_temp);
4538 /* Set up to move the copy back to the original if needed. */
4540 {
4541 /* If the original is a COND_EXPR whose first arm isn't meant to
4542 be further used, just deal with the second arm. This is very
4543 likely the conditional expression built for a check. */
4546 && integer_zerop
4550 gnu_stmt
4555 }
4556 }
4558 /* Start from the real object and build the actual. */
4561 /* If atomic access is required for an In or In Out actual parameter,
4562 build the atomic load. */
4564 && !is_by_ref_formal_parm
4569 /* If this was a procedure call, we may not have removed any padding.
4570 So do it here for the part we will use as an input, if any. */
4573 gnu_actual
4576 /* Put back the conversion we suppressed above in the computation of the
4577 real object. And even if we didn't suppress any conversion there, we
4578 may have suppressed a conversion to the Etype of the actual earlier,
4579 since the parent is a procedure call, so put it back here. Note that
4580 we might have a dummy type here if the actual is the dereference of a
4581 pointer to it, but that's OK if the formal is passed by reference. */
4589 else
4592 /* Make sure that the actual is in range of the formal's type. */
4595 gnu_actual
4598 /* Unless this is an In parameter, we must remove any justified modular
4599 building from GNU_NAME to get an lvalue. */
4604 gnu_name
4607 /* First see if the parameter is passed by reference. */
4609 {
4611 {
4612 /* In Out or Out parameters passed by reference don't use the
4613 copy-in/copy-out mechanism so the address of the real object
4614 must be passed to the function. */
4617 /* If we have a padded type, be sure we've removed padding. */
4620 gnu_actual);
4622 /* If we have the constructed subtype of an aliased object
4623 with an unconstrained nominal subtype, the type of the
4624 actual includes the template, although it is formally
4625 constrained. So we need to convert it back to the real
4626 constructed subtype to retrieve the constrained part
4627 and takes its address. */
4633 gnu_actual);
4634 }
4636 /* There is no need to convert the actual to the formal's type before
4637 taking its address. The only exception is for unconstrained array
4638 types because of the way we build fat pointers. */
4640 {
4641 /* Put back a view conversion for In Out or Out parameters. */
4644 gnu_actual);
4646 }
4648 /* The symmetry of the paths to the type of an entity is broken here
4649 since arguments don't know that they will be passed by ref. */
4652 }
4654 /* Then see if the parameter is an array passed to a foreign convention
4655 subprogram. */
4657 {
4663 {
4666 }
4668 /* Take the address of the object and convert to the proper pointer
4669 type. We'd like to actually compute the address of the beginning
4670 of the array using an ADDR_EXPR of an ARRAY_REF, but there's a
4671 possibility that the ARRAY_REF might return a constant and we'd be
4672 getting the wrong address. Neither approach is exactly correct,
4673 but this is the most likely to work in all cases. */
4675 }
4677 /* Otherwise the parameter is passed by copy. */
4678 else
4679 {
4680 tree gnu_size;
4685 /* If we didn't create a PARM_DECL for the formal, this means that
4686 it is an Out parameter not passed by reference and that need not
4687 be copied in. In this case, the value of the actual need not be
4688 read. However, we still need to make sure that its side-effects
4689 are evaluated before the call, so we evaluate its address. */
4691 {
4693 {
4696 }
4698 }
4702 /* If this is 'Null_Parameter, pass a zero even though we are
4703 dereferencing it. */
4709 {
4710 tree type_for_size
4712 gnu_actual
4716 }
4717 else
4719 }
4722 }
4724 gnu_call
4729 /* If we have created a temporary for the return value, initialize it. */
4731 {
4732 tree gnu_stmt
4737 }
4739 /* If this is a subprogram with copy-in/copy-out parameters, we need to
4740 unpack the valued returned from the function into the In Out or Out
4741 parameters. We deal with the function return (if this is an Ada
4742 function) below. */
4744 {
4745 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy-in/
4746 copy-out parameters. */
4750 /* The call sequence must contain one and only one call, even though the
4751 function is pure. Save the result into a temporary if needed. */
4753 {
4755 {
4756 tree gnu_stmt;
4757 gnu_call
4760 }
4763 }
4765 /* The first entry is for the actual return value if this is a
4766 function, so skip it. */
4772 else
4779 /* If we are dealing with a copy-in/copy-out parameter, we must
4780 retrieve its value from the record returned in the call. */
4786 {
4787 /* Get the value to assign to this Out or In Out parameter. It is
4788 either the result of the function if there is only a single such
4789 parameter or the appropriate field from the record returned. */
4790 tree gnu_result
4792 ? gnu_call
4796 /* If the actual is a conversion, get the inner expression, which
4797 will be the real destination, and convert the result to the
4798 type of the actual parameter. */
4799 tree gnu_actual
4802 /* If the result is a padded type, remove the padding. */
4804 gnu_result
4806 gnu_result);
4808 /* If the actual is a type conversion, the real target object is
4809 denoted by the inner Expression and we need to convert the
4810 result to the associated type.
4811 We also need to convert our gnu assignment target to this type
4812 if the corresponding GNU_NAME was constructed from the GNAT
4813 conversion node and not from the inner Expression. */
4815 {
4816 gnu_result
4817 = convert_with_check
4825 }
4827 /* Unchecked conversions as actuals for Out parameters are not
4828 allowed in user code because they are not variables, but do
4829 occur in front-end expansions. The associated GNU_NAME is
4830 always obtained from the inner expression in such cases. */
4833 gnu_result,
4835 else
4836 {
4838 gnu_result
4840 gnat_actual);
4845 }
4847 /* If an outer atomic access is required for an actual parameter,
4848 build the load-modify-store sequence. */
4850 gnu_result
4853 /* Or else, if simple atomic access is required, build the atomic
4854 store. */
4858 /* Otherwise build a regular assignment. */
4859 else
4868 }
4869 }
4871 /* If this is a function call, the result is the call expression unless a
4872 target is specified, in which case we copy the result into the target
4873 and return the assignment statement. */
4875 {
4876 /* If this is a function with copy-in/copy-out parameters, extract the
4877 return value from it and update the return type. */
4879 {
4881 gnu_call
4884 }
4886 /* If the function returns an unconstrained array or by direct reference,
4887 we have to dereference the pointer. */
4893 {
4897 /* If range check is needed, emit code to generate it. */
4899 gnu_call
4901 gnat_parent);
4903 /* ??? If the return type has variable size, then force the return
4904 slot optimization as we would not be able to create a temporary.
4905 That's what has been done historically. */
4908 else
4911 /* Use the required method to move the result to the target. */
4913 gnu_call
4917 else
4918 gnu_call
4924 }
4925 else
4927 }
4929 /* Otherwise, if this is a procedure call statement without copy-in/copy-out
4930 parameters, the result is just the call statement. */
4934 /* Finally, add the copy back statements, if any. */
4940 /* If we have pushed a binding level, pop it and finish up the enclosing
4941 statement group. */
4943 {
4947 }
4949 /* Otherwise, retrieve the statement list, if any. */
4953 /* Otherwise, just return the call expression. */
4954 else
4957 /* If we nevertheless need a value, make a COMPOUND_EXPR to return it.
4958 But first simplify if we have only one statement in the list. */
4960 {
4964 gnu_result
4966 }
4969 }
4970 \f
4971 /* Subroutine of gnat_to_gnu to translate gnat_node, an
4972 N_Handled_Sequence_Of_Statements, to a GCC tree, which is returned. */
4974 static tree
4976 {
4979 /* If just annotating, ignore all EH and cleanups. */
4983 bool fe_sjlj
4989 tree gnu_result;
4990 tree gnu_expr;
4991 Node_Id gnat_temp;
4993 /* The GCC exception handling mechanism can handle both ZCX and SJLJ schemes
4994 and we have our own SJLJ mechanism. To call the GCC mechanism, we call
4995 add_cleanup, and when we leave the binding, end_stmt_group will create
4996 the TRY_FINALLY_EXPR.
4998 ??? The region level calls down there have been specifically put in place
4999 for a ZCX context and currently the order in which things are emitted
5000 (region/handlers) is different from the SJLJ case. Instead of putting
5001 other calls with different conditions at other places for the SJLJ case,
5002 it seems cleaner to reorder things for the SJLJ case and generalize the
5003 condition to make it not ZCX specific.
5005 If there are any exceptions or cleanup processing involved, we need an
5006 outer statement group (for Fe_Sjlj) and binding level. */
5008 {
5011 }
5013 /* If using fe_sjlj, make the variables for the setjmp buffer and save
5014 area for address of previous buffer. Do this first since we need to have
5015 the setjmp buf known for any decls in this block. */
5017 {
5018 gnu_jmpsave_decl
5020 jmpbuf_ptr_type,
5025 /* The __builtin_setjmp receivers will immediately reinstall it. Now
5026 because of the unstructured form of EH used by fe_sjlj, there
5027 might be forward edges going to __builtin_setjmp receivers on which
5028 it is uninitialized, although they will never be actually taken. */
5030 gnu_jmpbuf_decl
5032 jmpbuf_type,
5033 NULL_TREE,
5039 /* When we exit this block, restore the saved value. */
5043 }
5045 /* If we are to call a function when exiting this block, add a cleanup
5046 to the binding level we made above. Note that add_cleanup is FIFO
5047 so we must register this cleanup after the EH cleanup just above. */
5049 {
5052 /* When not optimizing, disable inlining of finalizers as this can
5053 create a more complex CFG in the parent function. */
5057 /* If there is no end label attached, we use the location of the At_End
5058 procedure because Expand_Cleanup_Actions might reset the location of
5059 the enclosing construct to that of an inner statement. */
5063 }
5065 /* Now build the tree for the declarations and statements inside this block.
5066 If this is SJLJ, set our jmp_buf as the current buffer. */
5070 {
5073 gnu_jmpbuf_decl));
5076 }
5082 /* Generate code for each statement in the block. */
5090 /* Now generate code for the two exception models, if either is relevant for
5091 this block. */
5093 {
5095 tree gnu_handler;
5097 /* Make a binding level for the exception handling declarations and code
5098 and set up gnu_except_ptr_stack for the handlers to use. */
5109 /* Generate code for each handler. The N_Exception_Handler case does the
5110 real work and returns a COND_EXPR for each handler, which we chain
5111 together here. */
5114 {
5117 /* If this is the first one, set it as the outer one. Otherwise,
5118 point the "else" part of the previous handler to us. Then point
5119 to our "else" part. */
5122 else
5126 }
5128 /* If none of the exception handlers did anything, re-raise but do not
5129 defer abortion. */
5132 set_expr_location_from_node
5138 else
5141 /* End the binding level dedicated to the exception handlers and get the
5142 whole statement group. */
5147 /* If the setjmp returns 1, we restore our incoming longjmp value and
5148 then check the handlers. */
5151 gnu_jmpsave_decl),
5152 gnat_node);
5156 /* This block is now "if (setjmp) ... <handlers> else <block>". */
5158 (build_call_n_expr
5161 gnu_jmpbuf_decl))),
5163 }
5165 {
5166 tree gnu_handlers;
5167 location_t locus;
5169 /* First make a block containing the handlers. */
5177 /* Now make the TRY_CATCH_EXPR for the block. */
5180 /* Set a location. We need to find a unique location for the dispatching
5181 code, otherwise we can get coverage or debugging issues. Try with
5182 the location of the end label. */
5186 else
5187 /* Clear column information so that the exception handler of an
5188 implicit transient block does not incorrectly inherit the slocs
5189 of a decision, which would otherwise confuse control flow based
5190 coverage analysis tools. */
5192 }
5193 else
5196 /* Now close our outer block, if we had to make one. */
5198 {
5202 }
5205 }
5206 \f
5207 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
5208 to a GCC tree, which is returned. This is the variant for front-end sjlj
5209 exception handling. */
5211 static tree
5213 {
5214 /* Unless this is "Others" or the special "Non-Ada" exception for Ada, make
5215 an "if" statement to select the proper exceptions. For "Others", exclude
5216 exceptions where Handled_By_Others is nonzero unless the All_Others flag
5217 is set. For "Non-ada", accept an exception if "Lang" is 'V'. */
5220 Node_Id gnat_temp;
5224 {
5225 tree this_choice;
5228 {
5231 else
5232 this_choice
5233 = build_binary_op
5235 convert
5237 build_component_ref
5238 (build_unary_op
5241 not_handled_by_others_decl,
5243 integer_zero_node);
5244 }
5248 {
5250 tree gnu_expr;
5252 /* Exception may be a renaming. Recover original exception which is
5253 the one elaborated and registered. */
5259 this_choice
5260 = build_binary_op
5265 }
5266 else
5271 }
5274 }
5275 \f
5276 /* Return true if no statement in GNAT_LIST can alter the control flow. */
5278 static bool
5280 {
5284 /* This is very conservative, we reject everything except for simple
5285 assignments between identifiers or literals. */
5289 {
5301 }
5304 }
5306 /* Subroutine of gnat_to_gnu to translate gnat_node, an N_Exception_Handler,
5307 to a GCC tree, which is returned. This is the variant for GCC exception
5308 schemes. */
5310 static tree
5312 {
5315 /* We build a TREE_LIST of nodes representing what exception types this
5316 handler can catch, with special cases for others and all others cases.
5318 Each exception type is actually identified by a pointer to the exception
5319 id, or to a dummy object for "others" and "all others". */
5321 gnat_temp;
5323 {
5327 {
5330 }
5333 {
5336 /* Exception may be a renaming. Recover original exception which is
5337 the one elaborated and registered. */
5343 }
5344 else
5347 /* The GCC interface expects NULL to be passed for catch all handlers, so
5348 it would be quite tempting to set gnu_etypes_list to NULL if gnu_etype
5349 is integer_zero_node. It would not work, however, because GCC's
5350 notion of "catch all" is stronger than our notion of "others". Until
5351 we correctly use the cleanup interface as well, doing that would
5352 prevent the "all others" handlers from being seen, because nothing
5353 can be caught beyond a catch all from GCC's point of view. */
5355 }
5360 /* Expand a call to the begin_handler hook at the beginning of the handler,
5361 and arrange for a call to the end_handler hook to occur on every possible
5362 exit path.
5364 The hooks expect a pointer to the low level occurrence. This is required
5365 for our stack management scheme because a raise inside the handler pushes
5366 a new occurrence on top of the stack, which means that this top does not
5367 necessarily match the occurrence this handler was dealing with.
5369 __builtin_eh_pointer references the exception occurrence being
5370 propagated. Upon handler entry, this is the exception for which the
5371 handler is triggered. This might not be the case upon handler exit,
5372 however, as we might have a new occurrence propagated by the handler's
5373 body, and the end_handler hook called as a cleanup in this context.
5375 We use a local variable to retrieve the incoming value at handler entry
5376 time, and reuse it to feed the end_handler hook's argument at exit. */
5378 tree gnu_current_exc_ptr
5382 gnu_incoming_exc_ptr
5389 gnu_incoming_exc_ptr),
5390 gnat_node);
5392 /* Declare and initialize the choice parameter, if present. */
5394 {
5395 tree gnu_param
5401 gnu_incoming_exc_ptr));
5402 }
5406 /* We don't have an End_Label at hand to set the location of the cleanup
5407 actions, so we use that of the exception handler itself instead. */
5411 else
5418 return
5420 }
5421 \f
5422 /* Subroutine of gnat_to_gnu to generate code for an N_Compilation unit. */
5424 static void
5426 {
5431 Entity_Id gnat_entity;
5432 Node_Id gnat_pragma;
5433 /* Make the decl for the elaboration procedure. Emit debug info for it, so
5434 that users can break into their elaboration code in debuggers. Kludge:
5435 don't consider it as a definition so that we have a line map for its body,
5436 but no subprogram description in debug info. */
5437 tree gnu_elab_proc_decl
5438 = create_subprog_decl
5447 /* Initialize the information structure for the function. */
5456 /* For a body, first process the spec if there is one. */
5462 {
5469 }
5471 /* Then process any pragmas and declarations preceding the unit. */
5480 /* Process the unit itself. */
5483 /* Generate code for all the inlined subprograms. */
5487 {
5488 Node_Id gnat_body;
5490 /* Without optimization, process only the required subprograms. */
5494 /* The set of inlined subprograms is computed from data recorded early
5495 during expansion and it can be a strict superset of the final set
5496 computed after semantic analysis, for example if a call to such a
5497 subprogram occurs in a pragma Assert and assertions are disabled.
5498 In that case, semantic analysis resets Is_Public to false but the
5499 entry for the subprogram in the inlining tables is stalled. */
5505 {
5506 /* ??? This happens when only the spec of a package is provided. */
5510 gnat_body
5512 }
5514 /* Define the entity first so we set DECL_EXTERNAL. */
5517 }
5519 /* Process any pragmas and actions following the unit. */
5524 /* Save away what we've made so far and finish it up. */
5531 /* Record this potential elaboration procedure for later processing. */
5538 /* Force the processing for all nodes that remain in the queue. */
5540 }
5541 \f
5542 /* Mark COND, a boolean expression, as predicating a call to a noreturn
5543 function, i.e. predict that it is very likely false, and return it.
5545 The compiler will automatically predict the last edge leading to a call
5546 to a noreturn function as very unlikely taken. This function makes it
5547 possible to expand the prediction to predecessors in case the condition
5548 is made up of several short-circuit operators. */
5550 static tree
5552 {
5562 PRED_NORETURN));
5565 }
5567 /* Subroutine of gnat_to_gnu to translate GNAT_RANGE, a node representing a
5568 range of values, into GNU_LOW and GNU_HIGH bounds. */
5570 static void
5572 {
5573 /* GNAT_RANGE is either an N_Range or an identifier denoting a subtype. */
5575 {
5583 {
5587 *gnu_low
5589 *gnu_high
5591 }
5596 }
5597 }
5599 /* Subroutine of gnat_to_gnu to translate GNAT_NODE, an N_Raise_xxx_Error,
5600 to a GCC tree and return it. GNU_RESULT_TYPE_P is a pointer to where
5601 we should place the result type. */
5603 static tree
5605 {
5609 const bool with_extra_info
5610 = Exception_Extra_Info
5615 /* The following processing is not required for correctness. Its purpose is
5616 to give more precise error messages and to record some information. */
5618 {
5628 {
5635 {
5653 }
5661 {
5667 }
5670 && gnu_low_bound
5671 && gnu_high_bound
5674 gnu_result
5678 /* If optimization is enabled and we are inside a loop, we try to
5679 compute invariant conditions for checks applied to the iteration
5680 variable, i.e. conditions that are independent of the variable
5681 and necessary in order for the checks to fail in the course of
5682 some iteration. If we succeed, we consider an alternative:
5684 1. If loop unswitching is enabled, we prepend these conditions
5685 to the original conditions of the checks. This will make it
5686 possible for the loop unswitching pass to replace the loop
5687 with two loops, one of which has the checks eliminated and
5688 the other has the original checks reinstated, and a prologue
5689 implementing a run-time selection. The former loop will be
5690 for example suitable for vectorization.
5692 2. Otherwise, we instead append the conditions to the original
5693 conditions of the checks. At worse, if the conditions cannot
5694 be evaluated at compile time, they will be evaluated as true
5695 at run time only when the checks have already failed, thus
5696 contributing negatively only to the size of the executable.
5697 But the hope is that these invariant conditions be evaluated
5698 at compile time to false, thus taking away the entire checks
5699 with them. */
5702 && (!gnu_low_bound
5704 && (!gnu_high_bound
5707 {
5714 rci->inserted_cond
5721 boolean_type_node,
5723 gnu_cond);
5724 else
5726 boolean_type_node,
5727 gnu_cond,
5729 }
5731 /* Or else, if aggressive loop optimizations are enabled, we just
5732 record that there are checks applied to iteration variables. */
5734 && flag_aggressive_loop_optimizations
5738 }
5743 }
5745 /* The following processing does the common work. */
5746 common:
5753 /* If the type is VOID, this is a statement, so we need to generate the code
5754 for the call. Handle a condition, if there is one. */
5756 {
5758 {
5763 }
5764 }
5765 else
5769 }
5770 \f
5771 /* Return true if GNAT_NODE is on the LHS of an assignment or an actual
5772 parameter of a call. */
5774 static bool
5776 {
5791 }
5793 /* Return true if either GNAT_NODE or a view of GNAT_NODE is on the LHS
5794 of an assignment or an actual parameter of a call. */
5796 static bool
5798 {
5799 Node_Kind kind;
5811 }
5813 /* Return true if GNAT_NODE, an unchecked type conversion, is a no-op as far
5814 as gigi is concerned. This is used to avoid conversions on the LHS. */
5816 static bool
5818 {
5821 /* The conversion must be on the LHS of an assignment or an actual parameter
5822 of a call. Otherwise, even if the conversion was essentially a no-op, it
5823 could de facto ensure type consistency and this should be preserved. */
5829 /* We're interested in artificial conversions generated by the front-end
5830 to make private types explicit, e.g. in Expand_Assign_Array. */
5837 /* The direct conversion to the underlying type is a no-op. */
5841 /* For an array subtype, the conversion to the PAIT is a no-op. */
5846 /* For a record subtype, the conversion to the type is a no-op. */
5852 }
5854 /* Return true if GNAT_NODE represents a statement. */
5856 static bool
5858 {
5874 }
5876 /* This function is the driver of the GNAT to GCC tree transformation process.
5877 It is the entry point of the tree transformer. GNAT_NODE is the root of
5878 some GNAT tree. Return the root of the corresponding GCC tree. If this
5879 is an expression, return the GCC equivalent of the expression. If this
5880 is a statement, return the statement or add it to the current statement
5881 group, in which case anything returned is to be interpreted as occurring
5882 after anything added. */
5884 tree
5886 {
5892 Node_Id gnat_temp;
5895 /* Save node number for error message and set location information. */
5899 /* If we are only annotating types and this node is a statement, return
5900 an empty statement list. */
5904 /* If we are only annotating types and this node is a subexpression, return
5905 a NULL_EXPR, but filter out nodes appearing in the expressions attached
5906 to packed array implementation types. */
5921 N_Raise_Constraint_Error));
5926 {
5929 /* If this is a statement and we are at top level, it must be part of
5930 the elaboration procedure, so mark us as being in that procedure. */
5932 {
5935 }
5937 /* If we are in the elaboration procedure, check if we are violating a
5938 No_Elaboration_Code restriction by having a statement there. Don't
5939 check for a possible No_Elaboration_Code restriction violation on
5940 N_Handled_Sequence_Of_Statements, as we want to signal an error on
5941 every nested real statement instead. This also avoids triggering
5942 spurious errors on dummy (empty) sequences created by the front-end
5943 for package bodies in some cases. */
5948 }
5951 {
5952 /********************************/
5953 /* Chapter 2: Lexical Elements */
5954 /********************************/
5963 /* If atomic access is required on the RHS, build the atomic load. */
5970 {
5971 tree gnu_type;
5973 /* Get the type of the result, looking inside any padding and
5974 justified modular types. Then get the value in that type. */
5983 /* If the result overflows (meaning it doesn't fit in its base type),
5984 abort. We would like to check that the value is within the range
5985 of the subtype, but that causes problems with subtypes whose usage
5986 will raise Constraint_Error and with biased representation, so
5987 we don't. */
5989 }
5993 /* If a Entity is present, it means that this was one of the
5994 literals in a user-defined character type. In that case,
5995 just return the value in the CONST_DECL. Otherwise, use the
5996 character code. In that case, the base type should be an
5997 INTEGER_TYPE, but we won't bother checking for that. */
6001 else
6002 gnu_result
6010 /* If this is of a fixed-point type, the value we want is the value of
6011 the corresponding integer. */
6013 {
6015 gnu_result_type);
6017 }
6019 else
6020 {
6023 /* First convert the value to a machine number if it isn't already.
6024 That will force the base to 2 for non-zero values and simplify
6025 the rest of the logic. */
6027 ur_realval
6033 else
6034 {
6035 REAL_VALUE_TYPE tmp;
6039 /* The base must be 2 as Machine guarantees this, so we scale
6040 the value, which we know can fit in the mantissa of the type
6041 (hence the use of that type above). */
6046 }
6048 /* Now see if we need to negate the result. Do it this way to
6049 properly handle -0. */
6051 gnu_result
6053 gnu_result);
6054 }
6061 {
6068 else
6071 /* Build the string with the characters in the literal. Note
6072 that Ada strings are 1-origin. */
6076 /* Put a null at the end of the string in case it's in a context
6077 where GCC will want to treat it as a C string. */
6082 /* Strings in GCC don't normally have types, but we want
6083 this to not be converted to the array type. */
6088 }
6089 else
6090 {
6091 /* Build a list consisting of each character, then make
6092 the aggregate. */
6102 {
6108 }
6111 }
6118 /**************************************/
6119 /* Chapter 3: Declarations and Types */
6120 /**************************************/
6137 /* If we are just annotating types and this object has an unconstrained
6138 or task type, don't elaborate it. */
6148 && (!type_annotate_only
6150 {
6153 gnu_expr
6158 }
6159 else
6162 /* If this is a deferred constant with an address clause, we ignore the
6163 full view since the clause is on the partial view and we cannot have
6164 2 different GCC trees for the object. The only bits of the full view
6165 we will use is the initializer, but it will be directly fetched. */
6171 /* If this object has its elaboration delayed, we must force evaluation
6172 of GNU_EXPR now and save it for the freeze point. Note that we need
6173 not do anything special at the global level since the lifetime of the
6174 temporary is fully contained within the elaboration routine. */
6176 {
6178 {
6181 }
6182 }
6183 else
6191 /* Don't do anything if this renaming is handled by the front end and it
6192 does not need debug info. Note that we consider renamings don't need
6193 debug info when optimizing: our way to describe them has a
6194 memory/elaboration footprint.
6196 Don't do anything neither if we are just annotating types and this
6197 object has a composite or task type, don't elaborate it. */
6200 && !optimize
6201 && can_materialize_object_renaming_p
6203 && ! (type_annotate_only
6207 {
6208 tree gnu_temp
6212 /* See case 2 of renaming in gnat_to_gnu_entity. */
6215 }
6222 /* See the above case for the rationale. */
6224 {
6225 tree gnu_temp
6231 }
6235 {
6241 /* Materializing renamed subprograms will only benefit the debugging
6242 information as they aren't referenced in the generated code. So
6243 skip them when they aren't needed. Avoid doing this if:
6245 - there is a freeze node: in this case the renamed entity is not
6246 elaborated yet,
6247 - the renamed subprogram is intrinsic: it will not be available in
6248 the debugging information (note that both or only one of the
6249 renaming and the renamed subprograms can be intrinsic). */
6260 }
6269 /* These are fully handled in the front end. */
6270 /* ??? For package renamings, find a way to use GENERIC namespaces so
6271 that we get proper debug information for them. */
6275 /*************************************/
6276 /* Chapter 4: Names and Expressions */
6277 /*************************************/
6280 /* Make sure the designated type is complete before dereferencing. */
6285 /* If atomic access is required on the RHS, build the atomic load. */
6292 {
6293 tree gnu_array_object
6295 tree gnu_type;
6302 /* Convert vector inputs to their representative array type, to fit
6303 what the code below expects. */
6305 {
6309 }
6313 /* If we got a padded type, remove it too. */
6315 gnu_array_object
6317 gnu_array_object);
6319 /* The failure of this assertion will very likely come from a missing
6320 expansion for a packed array access. */
6323 /* First compute the number of dimensions of the array, then
6324 fill the expression array, the order depending on whether
6325 this is a Convention_Fortran array or not. */
6330 ;
6339 else
6345 /* Start with the prefix and build the successive references. */
6351 {
6357 gnu_result
6360 /* Array accesses are bound-checked so they cannot trap, but this
6361 is valid only if they are not hoisted ahead of the check. We
6362 need to mark them as no-trap to get decent loop optimizations
6363 in the presence of -fnon-call-exceptions, so we do it when we
6364 know that the original expression had no side-effects. */
6370 /* If aggressive loop optimizations are enabled, we warn for loops
6371 overrunning a simple array of size 1 not at the end of a record.
6372 This is aimed to catch misuses of the trailing array idiom. */
6374 && flag_aggressive_loop_optimizations
6390 {
6393 }
6394 }
6398 /* If atomic access is required on the RHS, build the atomic load. */
6402 }
6406 {
6407 tree gnu_array_object
6418 /* If this is a slice with non-constant size of an array with constant
6419 size, set the maximum size for the allocation of temporaries. */
6427 }
6431 {
6432 Entity_Id gnat_prefix
6439 /* gnat_to_gnu_entity does not save the GNU tree made for renamed
6440 discriminants so avoid making recursive calls on each reference
6441 to them by following the appropriate link directly here. */
6443 {
6444 /* For discriminant references in tagged types always substitute
6445 the corresponding discriminant as the actual component. */
6450 /* For discriminant references in untagged types always substitute
6451 the corresponding stored discriminant. */
6454 }
6456 /* Handle extracting the real or imaginary part of a complex.
6457 The real part is the first field and the imaginary the last. */
6462 else
6463 {
6466 gnu_result
6470 && lvalue_required_for_attribute_p
6472 }
6476 /* If atomic access is required on the RHS, build the atomic load. */
6480 }
6484 {
6485 /* The attribute designator. */
6488 /* The Elab_Spec and Elab_Body attributes are special in that Prefix
6489 is a unit, not an object with a GCC equivalent. */
6491 return
6497 gnat_node);
6500 }
6504 /* Like 'Access as far as we are concerned. */
6512 {
6513 tree gnu_aggr_type;
6515 /* ??? It is wrong to evaluate the type now, but there doesn't
6516 seem to be any other practical way of doing it. */
6520 gnu_aggr_type = gnu_result_type
6525 gnu_aggr_type
6535 gnu_result
6538 gnu_aggr_type);
6541 gnu_aggr_type,
6544 gnu_result
6545 = build_binary_op
6550 (Next
6552 else
6556 }
6564 else
6574 /* If this is a qualified expression for a tagged type, we mark the type
6575 as used. Because of polymorphism, this might be the only reference to
6576 the tagged type in the program while objects have it as dynamic type.
6577 The debugger needs to see it to display these objects properly. */
6581 gnu_result
6585 kind == N_Type_Conversion
6593 /* Skip further processing if the conversion is deemed a no-op. */
6595 {
6599 }
6601 /* If the result is a pointer type, see if we are improperly
6602 converting to a stricter alignment. */
6605 {
6611 post_error_ne_tree_2
6615 }
6617 /* If we are converting a descriptor to a function pointer, first
6618 build the pointer. */
6630 {
6639 {
6643 }
6645 /* If LOW and HIGH are identical, perform an equality test. Otherwise,
6646 ensure that GNU_OBJ is evaluated only once and perform a full range
6647 test. */
6649 gnu_result
6651 else
6652 {
6661 gnu_result
6663 }
6666 gnu_result
6668 }
6676 ? RDIV_EXPR
6685 /* These can either be operations on booleans or on modular types.
6686 Fall through for boolean types since that's the way GNU_CODES is
6687 set up. */
6689 {
6690 enum tree_code code
6701 }
6703 /* ... fall through ... */
6723 {
6727 tree gnu_type;
6733 /* Pending generic support for efficient vector logical operations in
6734 GCC, convert vectors to their representative array type view and
6735 fallthrough. */
6739 /* If this is a comparison operator, convert any references to an
6740 unconstrained array value into a reference to the actual array. */
6742 {
6748 {
6751 }
6752 }
6754 /* If this is a shift whose count is not guaranteed to be correct,
6755 we need to adjust the shift count. */
6757 {
6759 tree gnu_max_shift
6766 gnu_rhs
6767 = build_binary_op
6770 gnu_count_type,
6771 gnu_max_shift,
6773 gnu_rhs);
6774 }
6776 /* For right shifts, the type says what kind of shift to do,
6777 so we may need to choose a different type. In this case,
6778 we have to ignore integer overflow lest it propagates all
6779 the way down and causes a CE to be explicitly raised. */
6781 {
6784 }
6787 {
6790 }
6793 {
6799 }
6801 /* Instead of expanding overflow checks for addition, subtraction
6802 and multiplication itself, the front end will leave this to
6803 the back end when Backend_Overflow_Checks_On_Target is set. */
6805 && Backend_Overflow_Checks_On_Target
6811 else
6812 {
6813 /* Some operations, e.g. comparisons of arrays, generate complex
6814 trees that need to be annotated while they are being built. */
6817 }
6819 /* If this is a logical shift with the shift count not verified,
6820 we must return zero if it is too large. We cannot compensate
6821 above in this case. */
6824 gnu_result
6825 = build_cond_expr
6828 gnu_rhs,
6832 gnu_result);
6833 }
6837 {
6840 tree gnu_false
6844 gnu_result
6846 }
6855 /* This case can apply to a boolean or a modular type.
6856 Fall through for a boolean operand since GNU_CODES is set
6857 up to handle this. */
6859 {
6863 gnu_expr);
6865 }
6867 /* ... fall through ... */
6874 /* Instead of expanding overflow checks for negation and absolute
6875 value itself, the front end will leave this to the back end
6876 when Backend_Overflow_Checks_On_Target is set. */
6878 && Backend_Overflow_Checks_On_Target
6881 gnu_result
6884 else
6890 {
6892 tree gnu_type;
6897 /* The Expression operand can either be an N_Identifier or
6898 Expanded_Name, which must represent a type, or a
6899 N_Qualified_Expression, which contains both the object type and an
6900 initial value for the object. */
6905 {
6906 Entity_Id gnat_desig_type
6914 gnu_init
6920 else
6921 {
6925 }
6927 /* See the N_Qualified_Expression case for the rationale. */
6932 }
6933 else
6940 ignore_init_type);
6941 }
6944 /**************************/
6945 /* Chapter 5: Statements */
6946 /**************************/
6954 /* When not optimizing, turn null statements from source into gotos to
6955 the next statement that the middle-end knows how to preserve. */
6957 {
6968 }
6969 else
6974 /* Get the LHS and RHS of the statement and convert any reference to an
6975 unconstrained array into a reference to the underlying array. */
6978 /* If the type has a size that overflows, convert this into raise of
6979 Storage_Error: execution shouldn't have gotten here anyway. */
6983 N_Raise_Storage_Error);
6985 {
6986 bool outer_atomic_access
6988 bool atomic_access
6989 = !outer_atomic_access
6991 gnu_result
6994 }
6995 else
6996 {
6998 const Entity_Id gnat_type
7000 const bool regular_array_type_p
7002 const bool use_memset_p
7003 = (regular_array_type_p
7007 /* If we'll use memset, we need to find the inner expression. */
7009 {
7010 Node_Id gnat_inner
7014 gnat_inner
7017 }
7018 else
7021 /* If range check is needed, emit code to generate it. */
7024 gnat_node);
7026 /* If an outer atomic access is required on the LHS, build the load-
7027 modify-store sequence. */
7031 /* Or else, if atomic access is required, build the atomic store. */
7035 /* Or else, use memset when the conditions are met. */
7037 {
7038 tree value
7040 ? integer_zero_node
7044 tree size
7049 {
7050 tree mask
7054 }
7056 }
7058 /* Otherwise build a regular assignment. */
7059 else
7060 gnu_result
7063 /* If the assignment type is a regular array and the two sides are
7064 not completely disjoint, play safe and use memmove. But don't do
7065 it for a bit-packed array as it might not be byte-aligned. */
7067 && regular_array_type_p
7069 {
7073 tree size
7079 }
7080 }
7084 {
7087 /* Make the outer COND_EXPR. Avoid non-determinism. */
7096 /* Now make a COND_EXPR for each of the "else if" parts. Put each
7097 into the previous "else" part and point to where to put any
7098 outer "else". Also avoid non-determinism. */
7102 {
7112 }
7115 }
7127 /* The only way to enter the block is to fall through to it. */
7129 {
7136 }
7137 else
7142 gnu_result
7152 {
7155 /* If the subprogram is a function, we must return the expression. */
7157 {
7160 /* If this function has copy-in/copy-out parameters parameters and
7161 doesn't return by invisible reference, get the real object for
7162 the return. See Subprogram_Body_to_gnu. */
7166 else
7169 /* Get the GCC tree for the expression to be returned. */
7172 /* Do not remove the padding from GNU_RET_VAL if the inner type is
7173 self-referential since we want to allocate the fixed size. */
7175 && type_is_padding_self_referential
7179 /* If the function returns by direct reference, return a pointer
7180 to the return value. */
7185 /* Otherwise, if it returns an unconstrained array, we have to
7186 allocate a new version of the result and return it. */
7188 {
7191 /* And find out whether this is a candidate for Named Return
7192 Value. If so, record it. */
7194 {
7197 /* Strip useless conversions around the return value. */
7201 /* Strip unpadding around the return value. */
7203 && TYPE_IS_PADDING_P
7207 /* Now apply the test to the return value. */
7209 {
7215 }
7216 }
7219 gnu_ret_val,
7224 }
7226 /* Otherwise, if it returns by invisible reference, dereference
7227 the pointer it is passed using the type of the return value
7228 and build the copy operation manually. This ensures that we
7229 don't copy too much data, for example if the return type is
7230 unconstrained with a maximum size. */
7232 {
7233 tree gnu_ret_deref
7235 gnu_ret_obj);
7240 }
7241 }
7243 else
7246 /* If we have a return label defined, convert this into a branch to
7247 that label. The return proper will be handled elsewhere. */
7249 {
7252 gnu_ret_val));
7257 /* When not optimizing, make sure the return is preserved. */
7260 }
7262 /* Otherwise, build a regular return. */
7263 else
7265 }
7269 gnu_result
7273 /***************************/
7274 /* Chapter 6: Subprograms */
7275 /***************************/
7278 /* Unless there is a freeze node, declare the entity. We consider
7279 this a definition even though we're not generating code for the
7280 subprogram because we will be making the corresponding GCC node.
7281 When there is a freeze node, it is considered the definition of
7282 the subprogram and we do nothing until after it is encountered.
7283 That's an efficiency issue: the types involved in the profile
7284 are far more likely to be frozen between the declaration and
7285 the freeze node than before the declaration, so we save some
7286 updates of the GCC node by waiting until the freeze node.
7287 The counterpart is that we assume that there is no reference
7288 to the subprogram between the declaration and the freeze node
7289 in the expanded code; otherwise, it will be interpreted as an
7290 external reference and very likely give rise to a link failure. */
7298 /* This subprogram doesn't exist for code generation purposes, but we
7299 have to elaborate the types of any parameters and result, unless
7300 they are imported types (nothing to generate in this case).
7302 The parameter list may contain types with freeze nodes, e.g. not null
7303 subtypes, so the subprogram itself may carry a freeze node, in which
7304 case its elaboration must be deferred. */
7306 /* Process the parameter types first. */
7309 = First_Formal_With_Extras
7317 /* Then the result type, set to Standard_Void_Type for procedures. */
7318 {
7319 Entity_Id gnat_temp_type
7324 }
7330 /* For a child unit identifier go up a level to get the specification.
7331 We get this when we try to find the spec of a child unit package
7332 that is the compilation unit being compiled. */
7347 /************************/
7348 /* Chapter 7: Packages */
7349 /************************/
7365 /* If this is the body of a generic package - do nothing. */
7367 {
7370 }
7381 /********************************/
7382 /* Chapter 8: Visibility Rules */
7383 /********************************/
7387 /* Nothing to do here - but these may appear in list of declarations. */
7391 /*********************/
7392 /* Chapter 9: Tasks */
7393 /*********************/
7404 /*********************************************************/
7405 /* Chapter 10: Program Structure and Compilation Issues */
7406 /*********************************************************/
7409 /* This is not called for the main unit on which gigi is invoked. */
7421 /* These nodes should only be present when annotating types. */
7431 /* Simply process whatever unit is being inserted. */
7434 else
7435 {
7438 }
7441 /***************************/
7442 /* Chapter 11: Exceptions */
7443 /***************************/
7446 /* If there is an At_End procedure attached to this node, and the EH
7447 mechanism is front-end, we must have at least a corresponding At_End
7448 handler, unless the No_Exception_Handlers restriction is set. */
7463 else
7468 /* Only for reraise in back-end exceptions mode. */
7475 /* Clear the current exception pointer so that the occurrence won't be
7476 deallocated. */
7516 /******************************/
7517 /* Chapter 12: Generic Units */
7518 /******************************/
7528 /* These nodes can appear on a declaration list but there is nothing to
7529 to be done with them. */
7533 /**************************************************/
7534 /* Chapter 13: Representation Clauses and */
7535 /* Implementation-Dependent Features */
7536 /**************************************************/
7541 /* The only one we need to deal with is 'Address since, for the others,
7542 the front-end puts the information elsewhere. */
7546 /* And we only deal with 'Address if the object has a Freeze node. */
7551 /* Get the value to use as the address and save it as the equivalent
7552 for the object. When it is frozen, gnat_to_gnu_entity will do the
7553 right thing. */
7560 /* We do nothing with these. SEM puts the information elsewhere. */
7566 {
7576 /* First retrieve the 3 operand lists built by the front-end. */
7579 {
7586 }
7590 {
7597 }
7601 gnu_clobbers
7604 gnu_clobbers);
7606 /* Then perform some standard checking and processing on the
7607 operands. In particular, mark them addressable if needed. */
7615 {
7617 constraint
7623 {
7624 /* If the operand is going to end up in memory,
7625 mark it addressable. Note that we don't test
7626 allows_mem like in the input case below; this
7627 is modelled on the C front-end. */
7629 {
7636 }
7637 }
7638 else
7642 }
7645 {
7647 constraint
7653 {
7654 /* If the operand is going to end up in memory,
7655 mark it addressable. */
7657 {
7664 }
7665 }
7666 else
7670 }
7676 }
7677 else
7682 /****************/
7683 /* Added Nodes */
7684 /****************/
7687 /* This construct doesn't define a scope so we don't push a binding
7688 level around the statement list, but we wrap it in a SAVE_EXPR to
7689 protect it from unsharing. Elaborate the expression as part of the
7690 same statement group as the actions so that the type declaration
7691 gets inserted there as well. This ensures that the type elaboration
7692 code is issued past the actions computing values on which it might
7693 depend. */
7702 gnu_result
7726 {
7727 tree gnu_ptr
7732 /* If this is a thin pointer, we must first dereference it to create
7733 a fat pointer, then go back below to a thin pointer. The reason
7734 for this is that we need to have a fat pointer someplace in order
7735 to properly compute the size. */
7739 gnu_ptr));
7741 /* If this is a fat pointer, the object must have been allocated with
7742 the template in front of the array. So pass the template address,
7743 and get the total size; do it by converting to a thin pointer. */
7745 gnu_ptr
7747 (TYPE_OBJECT_RECORD_TYPE
7749 gnu_ptr);
7753 /* If this is a thin pointer, the object must have been allocated with
7754 the template in front of the array. So pass the template address,
7755 and get the total size. */
7757 gnu_ptr
7759 gnu_ptr,
7761 byte_position
7762 (DECL_CHAIN
7765 /* If we have a special dynamic constrained subtype on the node, use
7766 it to compute the size; otherwise, use the designated subtype. */
7768 {
7769 gnu_actual_obj_type
7773 gnu_actual_obj_type
7775 gnu_actual_obj_type,
7778 }
7779 else
7785 gnu_result
7789 gnat_node);
7790 }
7798 else
7803 /* The only validation we currently do on an unchecked conversion is
7804 that of aliasing assumptions. */
7814 /* These nodes should only be present when annotating types. */
7820 /* Other nodes are not supposed to reach here. */
7822 }
7824 /* If we pushed the processing of the elaboration routine, pop it back. */
7828 /* When not optimizing, turn boolean rvalues B into B != false tests
7829 so that we can put the location information of the reference to B on
7830 the inequality operator for better debug info. */
7841 {
7842 gnu_result
7848 }
7850 /* Set the location information on the result if it's not a simple name.
7851 Note that we may have no result if we tried to build a CALL_EXPR node
7852 to a procedure with no side-effects and optimization is enabled. */
7856 /* If we're supposed to return something of void_type, it means we have
7857 something we're elaborating for effect, so just return. */
7861 /* If the result is a constant that overflowed, raise Constraint_Error. */
7863 {
7865 gnu_result
7868 N_Raise_Constraint_Error));
7869 }
7871 /* If the result has side-effects and is of an unconstrained type, protect
7872 the expression in case it will be referenced multiple times, i.e. for
7873 its value and to compute the size of an object. But do it neither for
7874 an object nor a renaming declaration, nor a return statement of a call
7875 to a function that returns an unconstrained record type with default
7876 discriminant, because there is no size to be computed in these cases
7877 and this will create a useless temporary. We must do this before any
7878 conversions. */
7889 /* Now convert the result to the result type, unless we are in one of the
7890 following cases:
7892 1. If this is the LHS of an assignment or an actual parameter of a
7893 call, return the result almost unmodified since the RHS will have
7894 to be converted to our type in that case, unless the result type
7895 has a simpler size. Likewise if there is just a no-op unchecked
7896 conversion in-between. Similarly, don't convert integral types
7897 that are the operands of an unchecked conversion since we need
7898 to ignore those conversions (for 'Valid).
7900 2. If we have a label (which doesn't have any well-defined type), a
7901 field or an error, return the result almost unmodified. Similarly,
7902 if the two types are record types with the same name, don't convert.
7903 This will be the case when we are converting from a packable version
7904 of a type to its original type and we need those conversions to be
7905 NOPs in order for assignments into these types to work properly.
7907 3. If the type is void or if we have no result, return error_mark_node
7908 to show we have no result.
7910 4. If this is a call to a function that returns with variable size and
7911 the call is used as the expression in either an object or a renaming
7912 declaration, return the result unmodified because we want to use the
7913 return slot optimization in this case.
7915 5. Finally, if the type of the result is already correct. */
7933 && (CONTAINS_PLACEHOLDER_P
7937 {
7938 /* Remove padding only if the inner object is of self-referential
7939 size: in that case it must be an object of unconstrained type
7940 with a default discriminant and we want to avoid copying too
7941 much data. */
7944 gnu_result);
7945 }
7954 {
7955 /* Remove any padding. */
7958 gnu_result);
7959 }
7969 ;
7974 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on the result. */
7981 }
7983 /* Similar to gnat_to_gnu, but discard any object that might be created in
7984 the course of the translation of GNAT_NODE, which must be an "external"
7985 expression in the sense that it will be elaborated elsewhere. */
7987 tree
7989 {
7993 /* Force the local context and create a fake scope that we zap
7994 at the end so declarations will not be stuck either in the
7995 global varpool or in the current scope. */
7997 {
8000 }
8011 /* Do not import locations from external units. */
8016 }
8017 \f
8018 /* Subroutine of above to push the exception label stack. GNU_STACK is
8019 a pointer to the stack to update and GNAT_LABEL, if present, is the
8020 label to push onto the stack. */
8022 static void
8024 {
8030 }
8031 \f
8032 /* Return true if the statement list STMT_LIST is empty. */
8034 static bool
8036 {
8037 tree_stmt_iterator tsi;
8040 {
8043 /* Anything else than an empty STMT_STMT counts as something. */
8046 }
8049 }
8051 /* Record the current code position in GNAT_NODE. */
8053 static void
8055 {
8060 }
8062 /* Insert the code for GNAT_NODE at the position saved for that node. */
8064 static void
8066 {
8069 /* It's too late to remove the STMT_STMT itself at this point. */
8074 }
8075 \f
8076 /* Start a new statement group chained to the previous group. */
8078 void
8080 {
8083 /* First see if we can get one from the free list. */
8086 else
8092 }
8094 /* Add GNU_STMT to the current statement group. If it is an expression with
8095 no effects, it is ignored. */
8097 void
8099 {
8101 }
8103 /* Similar, but the statement is always added, regardless of side-effects. */
8105 void
8107 {
8109 }
8111 /* Like add_stmt, but set the location of GNU_STMT to that of GNAT_NODE. */
8113 void
8115 {
8116 /* Do not emit a location for renamings that come from generic instantiation,
8117 they are likely to disturb debugging. */
8121 }
8123 /* Similar, but the statement is always added, regardless of side-effects. */
8125 void
8127 {
8131 }
8133 /* Add a declaration statement for GNU_DECL to the current statement group.
8134 Get SLOC from Entity_Id. */
8136 void
8138 {
8142 /* If this is a variable that Gigi is to ignore, we may have been given
8143 an ERROR_MARK. So test for it. We also might have been given a
8144 reference for a renaming. So only do something for a decl. Also
8145 ignore a TYPE_DECL for an UNCONSTRAINED_ARRAY_TYPE. */
8153 /* If we are external or global, we don't want to output the DECL_EXPR for
8154 this DECL node since we already have evaluated the expressions in the
8155 sizes and positions as globals and doing it again would be wrong. */
8157 {
8158 /* Mark everything as used to prevent node sharing with subprograms.
8159 Note that walk_tree knows how to deal with TYPE_DECL, but neither
8160 VAR_DECL nor CONST_DECL. This appears to be somewhat arbitrary. */
8164 {
8168 }
8169 /* In any case, we have to deal with our own TYPE_ADA_SIZE field. */
8174 }
8175 else
8178 /* If this is a variable and an initializer is attached to it, it must be
8179 valid for the context. Similar to init_const in create_var_decl. */
8186 {
8189 {
8192 }
8194 /* If GNU_DECL has a padded type, convert it to the unpadded
8195 type so the assignment is done properly. */
8201 }
8202 }
8204 /* Callback for walk_tree to mark the visited trees rooted at *TP. */
8206 static tree
8208 {
8214 /* Don't mark a dummy type as visited because we want to mark its sizes
8215 and fields once it's filled in. */
8223 }
8225 /* Mark nodes rooted at T with TREE_VISITED and types as having their
8226 sized gimplified. We use this to indicate all variable sizes and
8227 positions in global types may not be shared by any subprogram. */
8229 void
8231 {
8233 }
8235 /* Add GNU_CLEANUP, a cleanup action, to the current code group and
8236 set its location to that of GNAT_NODE if present, but with column info
8237 cleared so that conditional branches generated as part of the cleanup
8238 code do not interfere with coverage analysis tools. */
8240 static void
8242 {
8246 }
8248 /* Set the BLOCK node corresponding to the current code group to GNU_BLOCK. */
8250 void
8252 {
8255 }
8257 /* Return code corresponding to the current code group. It is normally
8258 a STATEMENT_LIST, but may also be a BIND_EXPR or TRY_FINALLY_EXPR if
8259 BLOCK or cleanups were set. */
8261 tree
8263 {
8267 /* If this is a null list, allocate a new STATEMENT_LIST. Then, if there
8268 are cleanups, make a TRY_FINALLY_EXPR. Last, if there is a BLOCK,
8269 make a BIND_EXPR. Note that we nest in that because the cleanup may
8270 reference variables in the block. */
8282 /* Remove this group from the stack and add it to the free list. */
8288 }
8290 /* Return whether the current statement group may fall through. */
8294 {
8297 else
8299 }
8301 /* Add a list of statements from GNAT_LIST, a possibly-empty list of
8302 statements.*/
8304 static void
8306 {
8307 Node_Id gnat_node;
8313 }
8315 /* Build a tree from GNAT_LIST, a possibly-empty list of statements.
8316 If BINDING_P is true, push and pop a binding level around the list. */
8318 static tree
8320 {
8332 }
8333 \f
8334 /* Generate GIMPLE in place for the expression at *EXPR_P. */
8336 int
8339 {
8342 tree op;
8348 {
8350 /* If this is an aggregate type, build a null pointer of the appropriate
8351 type and dereference it. */
8356 integer_zero_node));
8357 /* Otherwise, just make a VAR_DECL. */
8358 else
8359 {
8362 }
8368 /* We should only do this if we are just elaborating for side-effects,
8369 but we can't know that yet. */
8376 /* If we are taking the address of a constant CONSTRUCTOR, make sure it
8377 is put into static memory. We know that it's going to be read-only
8378 given the semantics we have and it must be in static memory when the
8379 reference is in an elaboration procedure. */
8381 {
8385 }
8387 /* Replace atomic loads with their first argument. That's necessary
8388 because the gimplifier would create a temporary otherwise. */
8391 {
8394 {
8400 else
8402 }
8403 else
8405 }
8412 /* If we are view-converting a CONSTRUCTOR or a call from an aggregate
8413 type to a scalar one, explicitly create the local temporary. That's
8414 required if the type is passed by reference. */
8418 {
8427 }
8434 /* The expressions for the RM bounds must be gimplified to ensure that
8435 they are properly elaborated. See gimplify_decl_expr. */
8439 {
8444 {
8449 {
8453 }
8457 {
8461 }
8463 }
8468 }
8470 /* ... fall through ... */
8474 }
8475 }
8477 /* Generate GIMPLE in place for the statement at *STMT_P. */
8479 static enum gimplify_status
8481 {
8485 {
8491 {
8497 /* Build the condition expression from the test, if any. */
8499 {
8500 /* Deal with the optimization hints. */
8504 annot_expr_ivdep_kind));
8508 annot_expr_no_vector_kind));
8512 annot_expr_vector_kind));
8514 gnu_cond
8517 }
8519 /* Set to emit the statements of the loop. */
8522 /* We first emit the start label and then a conditional jump to the
8523 end label if there's a top condition, then the update if it's at
8524 the top, then the body of the loop, then a conditional jump to
8525 the end label if there's a bottom condition, then the update if
8526 it's at the bottom, and finally a jump to the start label and the
8527 definition of the end label. */
8529 gnu_start_label),
8530 stmt_p);
8551 gnu_end_label),
8552 stmt_p);
8554 }
8557 /* Build a statement to jump to the corresponding end label, then
8558 see if it needs to be conditional. */
8567 }
8568 }
8569 \f
8570 /* Force a reference to each of the entities in GNAT_PACKAGE recursively.
8572 This routine is exclusively called in type_annotate mode, to compute DDA
8573 information for types in withed units, for ASIS use. */
8575 static void
8577 {
8578 Entity_Id gnat_entity;
8583 {
8586 /* We are interested only in entities visible from the main unit. */
8590 /* Skip stuff internal to the compiler. */
8600 /* Skip named numbers. */
8604 /* Skip generic declarations. */
8608 /* Skip formal objects. */
8612 /* Skip package bodies. */
8616 /* Skip limited views that point back to the main unit. */
8622 /* Skip types that aren't frozen. */
8626 /* Recurse on real packages that aren't in the main unit. */
8628 {
8632 }
8633 else
8635 }
8636 }
8638 /* Force a reference to each of the entities in packages withed by GNAT_NODE.
8639 Operate recursively but check that we aren't elaborating something more
8640 than once.
8642 This routine is exclusively called in type_annotate mode, to compute DDA
8643 information for types in withed units, for ASIS use. */
8645 static void
8647 {
8648 Entity_Id gnat_with_clause;
8650 /* Process each unit only once. As we trace the context of all relevant
8651 units transitively, including generic bodies, we may encounter the
8652 same generic unit repeatedly. */
8656 /* Save entities in all context units. A body may have an implicit_with
8657 on its own spec, if the context includes a child unit, so don't save
8658 the spec twice. */
8665 {
8675 {
8678 /* Retrieve compilation unit node of generic body. */
8683 /* If body is available, elaborate its context. */
8686 }
8687 }
8691 }
8692 \f
8693 /* Do the processing of GNAT_NODE, an N_Freeze_Entity. */
8695 static void
8697 {
8702 /* If this is a package, we need to generate code for the package. */
8704 {
8705 insert_code_for
8709 }
8711 /* Don't do anything for class-wide types as they are always transformed
8712 into their root type. */
8716 /* Check for an old definition if this isn't an object with address clause,
8717 since the saved GCC tree is the address expression in that case. */
8718 gnu_old
8722 /* Don't do anything for subprograms that may have been elaborated before
8723 their freeze nodes. This can happen, for example, because of an inner
8724 call in an instance body or because of previous compilation of a spec
8725 for inlining purposes. */
8733 /* If we have a non-dummy type old tree, we have nothing to do, except for
8734 aborting, since this node was never delayed as it should have been. We
8735 let this happen for concurrent types and their Corresponding_Record_Type,
8736 however, because each might legitimately be elaborated before its own
8737 freeze node, e.g. while processing the other. */
8741 {
8746 }
8748 /* Reset the saved tree, if any, and elaborate the object or type for real.
8749 If there is a full view, elaborate it and use the result. And, if this
8750 is the root type of a class-wide type, reuse it for the latter. */
8752 {
8757 {
8764 {
8767 }
8768 }
8774 }
8778 {
8787 /* Propagate back-annotations from full view to partial view. */
8797 /* The above call may have defined this entity (the simplest example
8798 of this is when we have a private enumeral type since the bounds
8799 will have the public view). */
8802 }
8803 else
8804 {
8805 tree gnu_init
8811 }
8818 /* If we have an old type and we've made pointers to this type, update those
8819 pointers. If this is a Taft amendment type in the main unit, we need to
8820 mark the type as used since other units referencing it don't see the full
8821 declaration and, therefore, cannot mark it as used themselves. */
8823 {
8830 }
8831 }
8832 \f
8833 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
8834 We make two passes, one to elaborate anything other than bodies (but
8835 we declare a function if there was no spec). The second pass
8836 elaborates the bodies.
8838 GNAT_END_LIST gives the element in the list past the end. Normally,
8839 this is Empty, but can be First_Real_Statement for a
8840 Handled_Sequence_Of_Statements.
8842 We make a complete pass through both lists if PASS1P is true, then make
8843 the second pass over both lists if PASS2P is true. The lists usually
8844 correspond to the public and private parts of a package. */
8846 static void
8849 {
8851 Node_Id gnat_decl;
8861 {
8862 /* For package specs, we recurse inside the declarations,
8863 thus taking the two pass approach inside the boundary. */
8871 /* Similarly for any declarations in the actions of a
8872 freeze node. */
8874 {
8877 }
8879 /* Package bodies with freeze nodes get their elaboration deferred
8880 until the freeze node, but the code must be placed in the right
8881 place, so record the code position now. */
8889 (Corresponding_Spec
8892 record_code_position
8895 /* We defer most subprogram bodies to the second pass. */
8897 {
8899 {
8905 }
8906 }
8908 /* For bodies and stubs that act as their own specs, the entity
8909 itself must be elaborated in the first pass, because it may
8910 be used in other declarations. */
8912 {
8913 Node_Id gnat_subprog_id
8920 }
8922 /* Concurrent stubs stand for the corresponding subprogram bodies,
8923 which are deferred like other bodies. */
8926 ;
8928 /* Renamed subprograms may not be elaborated yet at this point
8929 since renamings do not trigger freezing. Wait for the second
8930 pass to take care of them. */
8932 ;
8934 else
8936 }
8938 /* Here we elaborate everything we deferred above except for package bodies,
8939 which are elaborated at their freeze nodes. Note that we must also
8940 go inside things (package specs and freeze nodes) the first pass did. */
8946 {
8965 }
8966 }
8967 \f
8968 /* Make a unary operation of kind CODE using build_unary_op, but guard
8969 the operation by an overflow check. CODE can be one of NEGATE_EXPR
8970 or ABS_EXPR. GNU_TYPE is the type desired for the result. Usually
8971 the operation is to be performed in that type. GNAT_NODE is the gnat
8972 node conveying the source location for which the error should be
8973 signaled. */
8975 static tree
8977 Node_Id gnat_node)
8978 {
8987 }
8989 /* Make a binary operation of kind CODE using build_binary_op, but guard
8990 the operation by an overflow check. CODE can be one of PLUS_EXPR,
8991 MINUS_EXPR or MULT_EXPR. GNU_TYPE is the type desired for the result.
8992 Usually the operation is to be performed in that type. GNAT_NODE is
8993 the GNAT node conveying the source location for which the error should
8994 be signaled. */
8996 static tree
8999 {
9008 /* Assert that the precision is a power of 2. */
9011 /* Prefer a constant on the RHS to simplify checks. */
9015 {
9019 }
9023 /* If we can fold the expression to a constant, just return it.
9024 The caller will deal with overflow, no need to generate a check. */
9028 /* If no operand is a constant, we use the generic implementation. */
9030 {
9031 /* Never inline a 64-bit mult for a 32-bit target, it's way too long. */
9033 {
9038 }
9043 {
9055 }
9058 tree call
9066 return
9068 }
9070 /* If one operand is a constant, we expose the overflow condition to enable
9071 a subsequent simplication or even elimination. */
9073 {
9077 /* When rhs > 0, overflow when lhs > type_max - rhs. */
9082 /* When rhs < 0, overflow when lhs < type_min - rhs. */
9086 else
9092 {
9095 /* When lhs > 0, overflow when rhs < lhs - type_max. */
9100 /* When lhs < 0, overflow when rhs > lhs - type_min. */
9104 else
9106 }
9107 else
9108 {
9111 /* When rhs > 0, overflow when lhs < type_min + rhs. */
9116 /* When rhs < 0, overflow when lhs > type_max + rhs. */
9120 else
9122 }
9128 {
9135 /* When rhs > 1, overflow outside [type_min/rhs; type_max/rhs]. */
9136 check
9142 }
9144 {
9149 /* When rhs == -1, overflow if lhs == type_min. */
9150 check
9152 else
9153 /* When rhs < -1, overflow outside [type_max/rhs; type_min/rhs]. */
9154 check
9160 }
9161 else
9167 }
9170 }
9172 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
9173 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
9174 which we have to check. GNAT_NODE is the GNAT node conveying the source
9175 location for which the error should be signaled. */
9177 static tree
9179 {
9183 /* If GNU_EXPR has GNAT_RANGE_TYPE as its base type, no check is needed.
9184 This can for example happen when translating 'Val or 'Value. */
9188 /* Range checks can only be applied to types with ranges. */
9192 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
9193 we can't do anything since we might be truncating the bounds. No
9194 check is needed in this case. */
9200 /* Checked expressions must be evaluated only once. */
9203 /* Note that the form of the check is
9204 (not (expr >= lo)) or (not (expr <= hi))
9205 the reason for this slightly convoluted form is that NaNs
9206 are not considered to be in range in the float case. */
9207 return emit_check
9209 invert_truthvalue
9213 TYPE_MIN_VALUE
9215 invert_truthvalue
9219 TYPE_MAX_VALUE
9222 }
9223 \f
9224 /* GNU_COND contains the condition corresponding to an index, overflow or
9225 range check of value GNU_EXPR. Build a COND_EXPR that returns GNU_EXPR
9226 if GNU_COND is false and raises a CONSTRAINT_ERROR if GNU_COND is true.
9227 REASON is the code that says why the exception is raised. GNAT_NODE is
9228 the node conveying the source location for which the error should be
9229 signaled.
9231 We used to propagate TREE_SIDE_EFFECTS from GNU_EXPR to the COND_EXPR,
9232 overwriting the setting inherited from the call statement, on the ground
9233 that the expression need not be evaluated just for the check. However
9234 that's incorrect because, in the GCC type system, its value is presumed
9235 to be valid so its comparison against the type bounds always yields true
9236 and, therefore, could be done without evaluating it; given that it can
9237 be a computation that overflows the bounds, the language may require the
9238 check to fail and thus the expression to be evaluated in this case. */
9240 static tree
9242 {
9243 tree gnu_call
9245 return
9251 gnu_expr);
9252 }
9253 \f
9254 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing overflow
9255 checks if OVERFLOW_P is true and range checks if RANGE_P is true.
9256 If TRUNCATE_P true, do a float-to-integer conversion with truncation,
9257 otherwise round. GNAT_NODE is the GNAT node conveying the source location
9258 for which the error should be signaled. */
9260 static tree
9263 {
9270 /* If we are not doing any checks, the output is an integral type and the
9271 input is not a floating-point type, just do the conversion. This is
9272 required for packed array types and is simpler in all cases anyway. */
9274 && !overflow_p
9279 /* If the mode of the input base type is larger, then converting to it below
9280 may pessimize the final conversion step, for example generate a libcall
9281 instead of a simple instruction, so use a narrower type in this case. */
9288 /* First convert the expression to the base type. This will never generate
9289 code, but makes the tests below simpler. But don't do this if converting
9290 from an integer type to an unconstrained array type since then we need to
9291 get the bounds from the original (unpacked) type. */
9295 /* If overflow checks are requested, we need to be sure the result will fit
9296 in the output base type. But don't do this if the input is integer and
9297 the output floating-point. */
9300 {
9301 /* Ensure GNU_EXPR only gets evaluated once. */
9309 /* Convert the lower bounds to signed types, so we're sure we're
9310 comparing them properly. Likewise, convert the upper bounds
9311 to unsigned types. */
9314 gnu_in_lb
9319 gnu_in_ub
9323 gnu_out_lb
9327 gnu_out_ub
9330 /* Check each bound separately and only if the result bound
9331 is tighter than the bound on the input type. Note that all the
9332 types are base types, so the bounds must be constant. Also,
9333 the comparison is done in the base type of the input, which
9334 always has the proper signedness. First check for input
9335 integer (which means output integer), output float (which means
9336 both float), or mixed, in which case we always compare.
9337 Note that we have to do the comparison which would *fail* in the
9338 case of an error since if it's an FP comparison and one of the
9339 values is a NaN or Inf, the comparison will fail. */
9346 gnu_cond
9347 = invert_truthvalue
9350 gnu_out_lb)));
9358 gnu_cond
9360 invert_truthvalue
9362 gnu_input,
9364 gnu_out_ub))));
9369 }
9371 /* Now convert to the result base type. If this is a non-truncating
9372 float-to-integer conversion, round. */
9376 {
9382 /* The following calculations depend on proper rounding to even
9383 of each arithmetic operation. In order to prevent excess
9384 precision from spoiling this property, use the widest hardware
9385 floating-point type if FP_ARITH_MAY_WIDEN is true. */
9386 calc_type
9389 /* Compute the exact value calc_type'Pred (0.5) at compile time. */
9396 /* If the input is strictly negative, subtract this value
9397 and otherwise add it from the input. For 0.5, the result
9398 is exactly between 1.0 and the machine number preceding 1.0
9399 (for calc_type). Since the last bit of 1.0 is even, this 0.5
9400 will round to 1.0, while all other number with an absolute
9401 value less than 0.5 round to 0.0. For larger numbers exactly
9402 halfway between integers, rounding will always be correct as
9403 the true mathematical result will be closer to the higher
9404 integer compared to the lower one. So, this constant works
9405 for all floating-point numbers.
9407 The reason to use the same constant with subtract/add instead
9408 of a positive and negative constant is to allow the comparison
9409 to be scheduled in parallel with retrieval of the constant and
9410 conversion of the input to the calc_type (if necessary). */
9415 gnu_comp
9417 gnu_add_pred_half
9419 gnu_subtract_pred_half
9423 }
9429 else
9432 /* Finally, do the range check if requested. Note that if the result type
9433 is a modular type, the range check is actually an overflow check. */
9435 || (overflow_p
9441 }
9442 \f
9443 /* Return true if GNU_EXPR can be directly addressed. This is the case
9444 unless it is an expression involving computation or if it involves a
9445 reference to a bitfield or to an object not sufficiently aligned for
9446 its type. If GNU_TYPE is non-null, return true only if GNU_EXPR can
9447 be directly addressed as an object of this type.
9449 *** Notes on addressability issues in the Ada compiler ***
9451 This predicate is necessary in order to bridge the gap between Gigi
9452 and the middle-end about addressability of GENERIC trees. A tree
9453 is said to be addressable if it can be directly addressed, i.e. if
9454 its address can be taken, is a multiple of the type's alignment on
9455 strict-alignment architectures and returns the first storage unit
9456 assigned to the object represented by the tree.
9458 In the C family of languages, everything is in practice addressable
9459 at the language level, except for bit-fields. This means that these
9460 compilers will take the address of any tree that doesn't represent
9461 a bit-field reference and expect the result to be the first storage
9462 unit assigned to the object. Even in cases where this will result
9463 in unaligned accesses at run time, nothing is supposed to be done
9464 and the program is considered as erroneous instead (see PR c/18287).
9466 The implicit assumptions made in the middle-end are in keeping with
9467 the C viewpoint described above:
9468 - the address of a bit-field reference is supposed to be never
9469 taken; the compiler (generally) will stop on such a construct,
9470 - any other tree is addressable if it is formally addressable,
9471 i.e. if it is formally allowed to be the operand of ADDR_EXPR.
9473 In Ada, the viewpoint is the opposite one: nothing is addressable
9474 at the language level unless explicitly declared so. This means
9475 that the compiler will both make sure that the trees representing
9476 references to addressable ("aliased" in Ada parlance) objects are
9477 addressable and make no real attempts at ensuring that the trees
9478 representing references to non-addressable objects are addressable.
9480 In the first case, Ada is effectively equivalent to C and handing
9481 down the direct result of applying ADDR_EXPR to these trees to the
9482 middle-end works flawlessly. In the second case, Ada cannot afford
9483 to consider the program as erroneous if the address of trees that
9484 are not addressable is requested for technical reasons, unlike C;
9485 as a consequence, the Ada compiler must arrange for either making
9486 sure that this address is not requested in the middle-end or for
9487 compensating by inserting temporaries if it is requested in Gigi.
9489 The first goal can be achieved because the middle-end should not
9490 request the address of non-addressable trees on its own; the only
9491 exception is for the invocation of low-level block operations like
9492 memcpy, for which the addressability requirements are lower since
9493 the type's alignment can be disregarded. In practice, this means
9494 that Gigi must make sure that such operations cannot be applied to
9495 non-BLKmode bit-fields.
9497 The second goal is achieved by means of the addressable_p predicate,
9498 which computes whether a temporary must be inserted by Gigi when the
9499 address of a tree is requested; if so, the address of the temporary
9500 will be used in lieu of that of the original tree and some glue code
9501 generated to connect everything together. */
9503 static bool
9505 {
9506 /* For an integral type, the size of the actual type of the object may not
9507 be greater than that of the expected type, otherwise an indirect access
9508 in the latter type wouldn't correctly set all the bits of the object. */
9514 /* The size of the actual type of the object may not be smaller than that
9515 of the expected type, otherwise an indirect access in the latter type
9516 would be larger than the object. But only record types need to be
9517 considered in practice for this case. */
9524 {
9529 /* All DECLs are addressable: if they are in a register, we can force
9530 them to memory. */
9535 /* Taking the address of a dereference yields the original pointer. */
9540 /* Taking the address yields a pointer to the constant pool. */
9544 /* Taking the address of a static constructor yields a pointer to the
9545 tree constant pool. */
9557 /* All rvalues are deemed addressable since taking their address will
9558 force a temporary to be created by the middle-end. */
9562 /* The address of a compound expression is that of its 2nd operand. */
9566 /* We accept &COND_EXPR as soon as both operands are addressable and
9567 expect the outcome to be the address of the selected operand. */
9573 /* Even with DECL_BIT_FIELD cleared, we have to ensure that
9574 the field is sufficiently aligned, in case it is subject
9575 to a pragma Component_Alignment. But we don't need to
9576 check the alignment of the containing record, as it is
9577 guaranteed to be not smaller than that of its most
9578 aligned field that is not a bit-field. */
9579 && (!STRICT_ALIGNMENT
9582 /* The field of a padding record is always addressable. */
9596 {
9597 /* This is addressable if we can avoid a copy. */
9601 && (!STRICT_ALIGNMENT
9606 && (!STRICT_ALIGNMENT
9612 }
9616 }
9617 }
9618 \f
9619 /* Do the processing for the declaration of a GNAT_ENTITY, a type or subtype.
9620 If a Freeze node exists for the entity, delay the bulk of the processing.
9621 Otherwise make a GCC type for GNAT_ENTITY and set up the correspondence. */
9623 void
9625 {
9626 tree gnu_old
9629 /* If we are to delay elaboration of this type, just do any elaboration
9630 needed for expressions within the declaration and make a dummy node
9631 for it and its Full_View (if any), in case something points to it.
9632 Do not do this if it has already been done (the only way that can
9633 happen is if the private completion is also delayed). */
9635 {
9639 {
9644 {
9648 }
9649 }
9652 }
9654 /* If we saved away a dummy type for this node, it means that this made the
9655 type that corresponds to the full type of an incomplete type. Clear that
9656 type for now and then update the type in the pointers below. But, if the
9657 saved type is not dummy, it very likely means that we have a use before
9658 declaration for the type in the tree, what we really cannot handle. */
9660 {
9665 }
9667 /* Now fully elaborate the type. */
9671 /* If we have an old type and we've made pointers to this type, update those
9672 pointers. If this is a Taft amendment type in the main unit, we need to
9673 mark the type as used since other units referencing it don't see the full
9674 declaration and, therefore, cannot mark it as used themselves. */
9676 {
9681 }
9683 /* If this is a record type corresponding to a task or protected type
9684 that is a completion of an incomplete type, perform a similar update
9685 on the type. ??? Including protected types here is a guess. */
9689 {
9690 tree gnu_task_old
9700 }
9701 }
9702 \f
9703 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
9704 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting of the
9705 associations that are from RECORD_TYPE. If we see an internal record, make
9706 a recursive call to fill it in as well. */
9708 static tree
9710 {
9712 tree field;
9715 {
9718 /* _Parent is an internal field, but may have values in the aggregate,
9719 so check for values first. */
9721 {
9724 }
9727 {
9732 }
9733 else
9734 /* If we have a record subtype, the names will match, but not the
9735 actual FIELD_DECLs. */
9738 {
9741 }
9747 }
9750 }
9752 /* GNAT_ENTITY is the type of the resulting constructor, GNAT_ASSOC is the
9753 front of the Component_Associations of an N_Aggregate and GNU_TYPE is the
9754 GCC type of the corresponding record type. Return the CONSTRUCTOR. */
9756 static tree
9758 {
9761 /* We test for GNU_FIELD being empty in the case where a variant
9762 was the last thing since we don't take things off GNAT_ASSOC in
9763 that case. We check GNAT_ASSOC in case we have a variant, but it
9764 has no fields. */
9767 {
9772 /* The expander is supposed to put a single component selector name
9773 in every record component association. */
9776 /* Ignore discriminants that have Corresponding_Discriminants in tagged
9777 types since we'll be setting those fields in the parent subtype. */
9783 /* Also ignore discriminants of Unchecked_Unions. */
9788 /* Before assigning a value in an aggregate make sure range checks
9789 are done if required. Then convert to the type of the field. */
9795 /* Add the field and expression to the list. */
9797 }
9802 {
9803 /* Verify that every entry in GNU_LIST was used. */
9806 }
9809 }
9811 /* Build a possibly nested constructor for array aggregates. GNAT_EXPR is
9812 the first element of an array aggregate. It may itself be an aggregate.
9813 GNU_ARRAY_TYPE is the GCC type corresponding to the array aggregate.
9814 GNAT_COMPONENT_TYPE is the type of the array component; it is needed
9815 for range checking. */
9817 static tree
9819 Entity_Id gnat_component_type)
9820 {
9825 {
9826 tree gnu_expr;
9828 /* If the expression is itself an array aggregate then first build the
9829 innermost constructor if it is part of our array (multi-dimensional
9830 case). */
9836 gnat_component_type);
9837 else
9838 {
9839 /* If the expression is a conversion to an unconstrained array type,
9840 skip it to avoid spilling to memory. */
9845 else
9848 /* Before assigning the element to the array, make sure it is
9849 in range. */
9852 }
9859 integer_one_node));
9860 }
9863 }
9864 \f
9865 /* Process a N_Validate_Unchecked_Conversion node. */
9867 static void
9869 {
9873 /* If the target is a pointer type, see if we are either converting from a
9874 non-pointer or from a pointer to a type with a different alias set and
9875 warn if so, unless the pointer has been marked to alias everything. */
9878 {
9888 target_alias_set)))
9889 {
9893 gnat_node);
9896 }
9897 }
9899 /* Likewise if the target is a fat pointer type, but we have no mechanism to
9900 mitigate the problem in this case, so we unconditionally warn. */
9902 {
9903 tree gnu_source_desig_type
9907 tree gnu_target_desig_type
9914 target_alias_set)))
9915 {
9919 gnat_node);
9920 }
9921 }
9922 }
9923 \f
9924 /* EXP is to be used in a context where access objects are implicitly
9925 dereferenced. Handle the cases when it is an access object. */
9927 static Node_Id
9929 {
9932 /* Make sure the designated type is complete before dereferencing. */
9937 }
9939 /* EXP is to be treated as an array or record. Handle the cases when it is
9940 an access object and perform the required dereferences. */
9942 static tree
9944 {
9945 /* If the type is a pointer, dereference it. */
9950 /* If we got a padded type, remove it too. */
9955 }
9956 \f
9957 /* Convert SLOC into LOCUS. Return true if SLOC corresponds to a source code
9958 location and false if it doesn't. If CLEAR_COLUMN is true, set the column
9959 information to 0. */
9961 bool
9963 {
9968 {
9971 }
9978 /* We can have zero if pragma Source_Reference is in effect. */
9982 /* Translate the location. */
9983 *locus
9987 }
9989 /* Similar to set_expr_location, but start with the Sloc of GNAT_NODE and
9990 don't do anything if it doesn't correspond to a source location. And,
9991 if CLEAR_COLUMN is true, set the column information to 0. */
9993 static void
9995 {
9996 location_t locus;
10002 }
10004 /* More elaborate version of set_expr_location_from_node to be used in more
10005 general contexts, for example the result of the translation of a generic
10006 GNAT node. */
10008 static void
10010 {
10011 /* Set the location information on the node if it is a real expression.
10012 References can be reused for multiple GNAT nodes and they would get
10013 the location information of their last use. Also make sure not to
10014 overwrite an existing location as it is probably more precise. */
10017 {
10018 CASE_CONVERT:
10027 /* ... fall through ... */
10031 {
10034 }
10036 }
10037 }
10039 /* Set the end_locus information for GNU_NODE, if any, from an explicit end
10040 location associated with GNAT_NODE or GNAT_NODE itself, whichever makes
10041 most sense. Return true if a sensible assignment was performed. */
10043 static bool
10045 {
10046 Node_Id gnat_end_label;
10047 location_t end_locus;
10049 /* Pick the GNAT node of which we'll take the sloc to assign to the GCC node
10050 end_locus when there is one. We consider only GNAT nodes with a possible
10051 End_Label attached. If the End_Label actually was unassigned, fallback
10052 on the original node. We'd better assign an explicit sloc associated with
10053 the outer construct in any case. */
10056 {
10069 }
10074 /* Some expanded subprograms have neither an End_Label nor a Sloc
10075 attached. Notify that to callers. For a block statement with no
10076 End_Label, clear column information, so that the tree for a
10077 transient block does not receive the sloc of a source condition. */
10084 {
10095 }
10096 }
10097 \f
10098 /* Return a colon-separated list of encodings contained in encoded Ada
10099 name. */
10103 {
10107 }
10109 /* Extract the Ada name from an encoded name. */
10113 {
10117 }
10118 \f
10119 /* Post an error message. MSG is the error message, properly annotated.
10120 NODE is the node at which to post the error and the node to use for the
10121 '&' substitution. */
10123 void
10125 {
10126 String_Template temp;
10127 String_Pointer sp;
10137 }
10139 /* Similar to post_error, but NODE is the node at which to post the error and
10140 ENT is the node to use for the '&' substitution. */
10142 void
10144 {
10145 String_Template temp;
10146 String_Pointer sp;
10156 }
10158 /* Similar to post_error_ne, but NUM is the number to use for the '^'. */
10160 void
10162 {
10165 }
10167 /* Similar to post_error_ne, but T is a GCC tree representing the number to
10168 write. If T represents a constant, the text inside curly brackets in
10169 MSG will be output (presumably including a '^'). Otherwise it will not
10170 be output and the text inside square brackets will be output instead. */
10172 void
10174 {
10181 {
10184 }
10185 else
10189 {
10195 ;
10196 else
10198 }
10203 }
10205 /* Similar to post_error_ne_tree, but NUM is a second integer to write. */
10207 void
10210 {
10213 }
10215 /* Return a label to branch to for the exception type in KIND or NULL_TREE
10216 if none. */
10218 tree
10220 {
10222 {
10234 }
10237 }
10239 /* Return the decl for the current elaboration procedure. */
10241 static tree
10243 {
10245 }
10247 /* Initialize the table that maps GNAT codes to GCC codes for simple
10248 binary and unary operations. */
10250 static void
10252 {
10277 }