| blob | e0eec16911ca64277e273d0a4ae979a2352134e0 |
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * T R A N S *
6 * *
7 * C Implementation File *
8 * *
9 * Copyright (C) 1992-2003, 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 2, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING. If not, write *
19 * to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, *
20 * MA 02111-1307, USA. *
21 * *
22 * GNAT was originally developed by the GNAT team at New York University. *
23 * Extensive contributions were provided by Ada Core Technologies Inc. *
24 * *
25 ****************************************************************************/
68 /* Current filename without path. */
71 /* Flag indicating whether file names are discarded in exception messages */
74 /* If true, then gigi is being called on an analyzed but unexpanded
75 tree, and the only purpose of the call is to properly annotate
76 types with representation information. */
79 /* List of TREE_LIST nodes representing a block stack. TREE_VALUE
80 of each gives the variable used for the setjmp buffer in the current
81 block, if any. TREE_PURPOSE gives the bottom condition for a loop,
82 if this block is for a loop. The latter is only used to save the tree
83 over GC. */
84 tree gnu_block_stack;
86 /* List of TREE_LIST nodes representing a stack of exception pointer
87 variables. TREE_VALUE is the VAR_DECL that stores the address of
88 the raised exception. Nonzero means we are in an exception
89 handler. Not used in the zero-cost case. */
92 /* List of TREE_LIST nodes containing pending elaborations lists.
93 used to prevent the elaborations being reclaimed by GC. */
96 /* Map GNAT tree codes to GCC tree codes for simple expressions. */
99 /* Current node being treated, in case gigi_abort called. */
100 Node_Id error_gnat_node;
102 /* Variable that stores a list of labels to be used as a goto target instead of
103 a return in some functions. See processing for N_Subprogram_Body. */
123 /* Constants for +0.5 and -0.5 for float-to-integer rounding. */
126 \f
127 /* This is the main program of the back-end. It sets up all the table
128 structures and then generates code. */
130 void
142 Int number_units ATTRIBUTE_UNUSED,
144 Entity_Id standard_integer,
145 Entity_Id standard_long_long_float,
146 Entity_Id standard_exception_type,
147 Int gigi_operating_mode)
148 {
149 tree gnu_standard_long_long_float;
150 tree gnu_standard_exception_type;
165 /* If we are just annotating types, give VOID_TYPE zero sizes to avoid
166 errors. */
168 {
171 }
173 /* See if we should discard file names in exception messages. */
181 /* Initialize ourselves. */
187 /* Enable GNAT stack checking method if needed */
191 /* Save the type we made for integer as the type for Standard.Integer.
192 Then make the rest of the standard types. Note that some of these
193 may be subtypes. */
202 gnu_standard_long_long_float
204 gnu_standard_exception_type
209 /* Process any Pragma Ident for the main unit. */
210 #ifdef ASM_OUTPUT_IDENT
212 ASM_OUTPUT_IDENT
215 #endif
217 /* If we are using the GCC exception mechanism, let GCC know. */
222 }
224 \f
225 /* This function is the driver of the GNAT to GCC tree transformation process.
226 GNAT_NODE is the root of some gnat tree. It generates code for that
227 part of the tree. */
229 void
231 {
232 tree gnu_root;
234 /* Save node number in case error */
239 /* If we return a statement, generate code for it. */
243 /* This should just generate code, not return a value. If it returns
244 a value, something is wrong. */
247 }
249 /* GNAT_NODE is the root of some GNAT tree. Return the root of the GCC
250 tree corresponding to that GNAT tree. Normally, no code is generated.
251 We just return an equivalent tree which is used elsewhere to generate
252 code. */
254 tree
256 {
257 tree gnu_root;
259 /* Save node number in case error */
264 /* If we got no code as a result, something is wrong. */
269 }
270 \f
271 /* This function is the driver of the GNAT to GCC tree transformation process.
272 It is the entry point of the tree transformer. GNAT_NODE is the root of
273 some GNAT tree. Return the root of the corresponding GCC tree or
274 error_mark_node to signal that there is no GCC tree to return.
276 The latter is the case if only code generation actions have to be performed
277 like in the case of if statements, loops, etc. This routine is wrapped
278 in the above two routines for most purposes. */
280 static tree
282 {
285 tree gnu_expr;
287 Node_Id gnat_temp;
288 Entity_Id gnat_temp_type;
290 /* Set input_file_name and lineno from the Sloc in the GNAT tree. */
293 /* If this is a Statement and we are at top level, we add the statement
294 as an elaboration for a null tree. That will cause it to be placed
295 in the elaboration procedure. */
308 {
312 }
314 /* If this node is a non-static subexpression and we are only
315 annotating types, make this into a NULL_EXPR for non-VOID types
316 and error_mark_node for void return types. But allow
317 N_Identifier since we use it for lots of things, including
318 getting trees for discriminants. */
324 {
329 else
332 }
335 {
336 /********************************/
337 /* Chapter 2: Lexical Elements: */
338 /********************************/
345 /* If the Etype of this node does not equal the Etype of the
346 Entity, something is wrong with the entity map, probably in
347 generic instantiation. However, this does not apply to
348 types. Since we sometime have strange Ekind's, just do
349 this test for objects. Also, if the Etype of the Entity is
350 private, the Etype of the N_Identifier is allowed to be the full
351 type and also we consider a packed array type to be the same as
352 the original type. Similarly, a class-wide type is equivalent
353 to a subtype of itself. Finally, if the types are Itypes,
354 one may be a copy of the other, which is also legal. */
378 /* If this is a reference to a deferred constant whose partial view
379 is an unconstrained private type, the proper type is on the full
380 view of the constant, not on the full view of the type, which may
381 be unconstrained.
383 This may be a reference to a type, for example in the prefix of the
384 attribute Position, generated for dispatching code (see Make_DT in
385 exp_disp,adb). In that case we need the type itself, not is parent,
386 in particular if it is a derived type */
392 {
396 }
397 else
398 {
399 /* Expand the type of this identitier first, in case it is
400 an enumeral literal, which only get made when the type
401 is expanded. There is no order-of-elaboration issue here.
402 We want to use the Actual_Subtype if it has already been
403 elaborated, otherwise the Etype. Avoid using Actual_Subtype
404 for packed arrays to simplify things. */
412 else
416 }
420 /* If we are in an exception handler, force this variable into memory
421 to ensure optimization does not remove stores that appear
422 redundant but are actually needed in case an exception occurs.
424 ??? Note that we need not do this if the variable is declared within
425 the handler, only if it is referenced in the handler and declared
426 in an enclosing block, but we have no way of testing that
427 right now. */
429 {
432 }
434 /* Some objects (such as parameters passed by reference, globals of
435 variable size, and renamed objects) actually represent the address
436 of the object. In that case, we must do the dereference. Likewise,
437 deal with parameters to foreign convention subprograms. Call fold
438 here since GNU_RESULT may be a CONST_DECL. */
443 {
449 gnu_result);
454 }
456 /* The GNAT tree has the type of a function as the type of its result.
457 Also use the type of the result if the Etype is a subtype which
458 is nominally unconstrained. But remove any padding from the
459 resulting type. */
462 {
467 }
469 /* We always want to return the underlying INTEGER_CST for an
470 enumeration literal to avoid the need to call fold in lots
471 of places. But don't do this is the parent will be taking
472 the address of this object. */
474 {
488 }
492 {
493 tree gnu_type;
495 /* Get the type of the result, looking inside any padding and
496 left-justified modular types. Then get the value in that type. */
505 /* If the result overflows (meaning it doesn't fit in its base type),
506 abort. We would like to check that the value is within the range
507 of the subtype, but that causes problems with subtypes whose usage
508 will raise Constraint_Error and with biased representation, so
509 we don't. */
512 }
516 /* If a Entity is present, it means that this was one of the
517 literals in a user-defined character type. In that case,
518 just return the value in the CONST_DECL. Otherwise, use the
519 character code. In that case, the base type should be an
520 INTEGER_TYPE, but we won't bother checking for that. */
524 else
530 /* If this is of a fixed-point type, the value we want is the
531 value of the corresponding integer. */
533 {
536 gnu_result_type);
539 }
541 /* We should never see a Vax_Float type literal, since the front end
542 is supposed to transform these using appropriate conversions */
546 else
547 {
552 /* If the real value is zero, so is the result. Otherwise,
553 convert it to a machine number if it isn't already. That
554 forces BASE to 0 or 2 and simplifies the rest of our logic. */
557 else
558 {
560 ur_realval
564 gnu_result
567 /* If we have a base of zero, divide by the denominator.
568 Otherwise, the base must be 2 and we scale the value, which
569 we know can fit in the mantissa of the type (hence the use
570 of that type above). */
572 gnu_result
575 gnu_result,
577 gnu_result_type));
581 else
582 {
583 REAL_VALUE_TYPE tmp;
588 }
589 }
591 /* Now see if we need to negate the result. Do it this way to
592 properly handle -0. */
594 gnu_result
596 gnu_result);
597 }
604 {
605 /* We assume here that all strings are of type standard.string.
606 "Weird" types of string have been converted to an aggregate
607 by the expander. */
613 /* Build the string with the characters in the literal. Note
614 that Ada strings are 1-origin. */
618 /* Put a null at the end of the string in case it's in a context
619 where GCC will want to treat it as a C string. */
624 /* Strings in GCC don't normally have types, but we want
625 this to not be converted to the array type. */
627 }
628 else
629 {
630 /* Build a list consisting of each character, then make
631 the aggregate. */
638 gnu_list
644 gnu_list);
646 gnu_result
648 }
655 /* Check for (and ignore) unrecognized pragma */
660 {
662 /* Do nothing at top level: all such variables are already
663 viewable. */
671 {
679 }
685 {
699 }
706 }
709 /**************************************/
710 /* Chapter 3: Declarations and Types: */
711 /**************************************/
726 /* If we are just annotating types and this object has an unconstrained
727 or task type, don't elaborate it. */
738 && (! type_annotate_only
740 {
745 /* If this object has its elaboration delayed, we must force
746 evaluation of GNU_EXPR right now and save it for when the object
747 is frozen. */
749 {
752 gnu_expr
756 else
760 }
761 }
762 else
777 /* Don't do anything if this renaming is handled by the front end.
778 or if we are just annotating types and this object has a
779 composite or task type, don't elaborate it. */
781 && ! (type_annotate_only
785 {
788 }
799 /* These are fully handled in the front end. */
802 /*************************************/
803 /* Chapter 4: Names and Expressions: */
804 /*************************************/
813 {
815 tree gnu_type;
823 /* If we got a padded type, remove it too. */
826 gnu_array_object
828 gnu_array_object);
832 /* First compute the number of dimensions of the array, then
833 fill the expression array, the order depending on whether
834 this is a Convention_Fortran array or not. */
839 ;
848 else
856 {
864 gnu_expr
865 = emit_index_check
872 }
873 }
879 {
880 tree gnu_type;
886 /* Do any implicit dereferences of the prefix and do any needed
887 range check. */
892 {
893 /* Get the bounds of the slice. */
894 tree gnu_index_type
900 /* Check to see that the minimum slice value is in range */
901 gnu_expr_l
902 = emit_index_check
907 /* Check to see that the maximum slice value is in range */
908 gnu_expr_h
909 = emit_index_check
914 /* Derive a good type to convert everything too */
917 /* Build a compound expression that does the range checks */
918 gnu_expr
923 /* Build a conditional expression that returns the range checks
924 expression if the slice range is not null (max >= min) or
925 returns the min if the slice range is null */
926 gnu_expr
930 gnu_max_expr),
932 gnu_min_expr)),
934 }
935 else
940 }
944 {
948 tree gnu_field;
952 {
957 }
961 /* For discriminant references in tagged types always substitute the
962 corresponding discriminant as the actual selected component. */
968 /* For discriminant references of untagged types always substitute the
969 corresponding stored discriminant. */
974 /* Handle extracting the real or imaginary part of a complex.
975 The real part is the first field and the imaginary the last. */
981 else
982 {
985 /* If there are discriminants, the prefix might be
986 evaluated more than once, which is a problem if it has
987 side-effects. */
994 gnu_result
998 }
1004 }
1008 {
1009 /* The attribute designator (like an enumeration value). */
1012 tree gnu_prefix;
1013 tree gnu_type;
1015 /* The Elab_Spec and Elab_Body attributes are special in that
1016 Prefix is a unit, not an object with a GCC equivalent. Similarly
1017 for Elaborated, since that variable isn't otherwise known. */
1019 {
1020 gnu_prefix
1021 = create_subprog_decl
1023 attribute == Attr_Elab_Body
1027 }
1032 /* If the input is a NULL_EXPR, make a new one. */
1034 {
1039 }
1042 {
1045 /* These are just conversions until since representation
1046 clauses for enumerations are handled in the front end. */
1047 {
1054 }
1059 /* These just add or subject the constant 1. Representation
1060 clauses for enumerations are handled in the front-end. */
1065 {
1067 gnu_expr
1068 = emit_check
1070 gnu_expr,
1071 attribute == Attr_Pred
1075 }
1077 gnu_result
1087 /* Conversions don't change something's address but can cause
1088 us to miss the COMPONENT_REF case below, so strip them off. */
1089 gnu_prefix
1093 /* If we are taking 'Address of an unconstrained object,
1094 this is the pointer to the underlying array. */
1097 /* ... fall through ... */
1104 gnu_result
1111 /* For 'Code_Address, find an inner ADDR_EXPR and mark it
1112 so that we don't try to build a trampoline. */
1114 {
1120 ;
1124 }
1129 {
1130 tree gnu_obj_type;
1135 /* If this is an unconstrained array, we know the object must
1136 have been allocated with the template in front of the object.
1137 So compute the template address.*/
1140 gnu_ptr
1142 (TYPE_OBJECT_RECORD_TYPE
1144 gnu_ptr);
1149 {
1152 tree gnu_byte_offset
1159 }
1162 }
1172 /* Remove NOPS from gnu_expr and conversions from gnu_prefix.
1173 We only use GNU_EXPR to see if a COMPONENT_REF was involved. */
1181 /* Replace an unconstrained array type with the type of the
1182 underlying array. We can't do this with a call to
1183 maybe_unconstrained_array since we may have a TYPE_DECL.
1184 For 'Max_Size_In_Storage_Elements, use the record type
1185 that will be used to allocate the object and its template. */
1188 {
1192 }
1194 /* If we are looking for the size of a field, return the
1195 field size. Otherwise, if the prefix is an object,
1196 or if 'Object_Size or 'Max_Size_In_Storage_Elements has
1197 been specified, the result is the GCC size of the type.
1198 Otherwise, the result is the RM_Size of the type. */
1204 {
1205 /* If this is a padded type, the GCC size isn't relevant
1206 to the programmer. Normally, what we want is the RM_Size,
1207 which was set from the specified size, but if it was not
1208 set, we want the size of the relevant field. Using the MAX
1209 of those two produces the right result in all case. Don't
1210 use the size of the field if it's a self-referential type,
1211 since that's never what's wanted. */
1215 {
1219 gnu_result
1222 }
1223 else
1225 }
1226 else
1232 /* Deal with a self-referential size by returning the maximum
1233 size for a type and by qualifying the size with
1234 the object for 'Size of an object. */
1237 {
1241 else
1243 }
1245 /* If the type contains a template, subtract the size of the
1246 template. */
1254 /* Always perform division using unsigned arithmetic as the
1255 size cannot be negative, but may be an overflowed positive
1256 value. This provides correct results for sizes up to 512 MB.
1257 ??? Size should be calculated in storage elements directly. */
1262 gnu_result,
1263 bitsize_unit_node)));
1270 && (TYPE_IS_PADDING_P
1279 gnu_result
1281 else
1292 {
1299 else
1300 gnu_result
1301 = build_binary_op
1303 build_binary_op
1315 }
1316 /* ... fall through ... */
1318 {
1319 int Dimension
1324 /* Make sure any implicit dereference gets done. */
1332 {
1334 tree gnu_type_temp;
1340 ;
1343 }
1352 gnu_result
1355 gnu_result
1357 else
1358 /* 'Length or 'Range_Length. */
1359 {
1360 tree gnu_compute_type
1361 = gnat_signed_or_unsigned_type
1364 gnu_result
1365 = build_binary_op
1367 build_binary_op
1369 build_binary_op
1372 TYPE_MAX_VALUE
1375 TYPE_MIN_VALUE
1379 }
1381 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1382 we are handling. Note that these attributes could not
1383 have been used on an unconstrained array type. */
1389 }
1396 {
1397 HOST_WIDE_INT bitsize;
1398 HOST_WIDE_INT bitpos;
1399 tree gnu_offset;
1400 tree gnu_field_bitpos;
1401 tree gnu_field_offset;
1402 tree gnu_inner;
1410 /* We can have 'Bit on any object, but if it isn't a
1411 COMPONENT_REF, the result is zero. Do not allow
1412 'Bit on a bare component, though. */
1416 {
1419 }
1430 {
1431 gnu_field_bitpos
1433 gnu_field_offset
1440 {
1441 gnu_field_bitpos
1445 gnu_field_offset
1449 }
1450 }
1452 {
1455 }
1456 else
1457 {
1460 }
1463 {
1475 gnu_result
1479 bitsize_one_node);
1485 }
1487 /* If this has a PLACEHOLDER_EXPR, qualify it by the object
1488 we are handling. */
1494 }
1517 && (TYPE_IS_PADDING_P
1525 gnu_type
1535 /* Note this size cannot be self-referential. */
1542 /* This is just a zero cast to the pointer type for
1543 our prefix and dereferenced. */
1545 gnu_result
1548 integer_zero_node));
1553 {
1560 {
1565 ;
1566 }
1574 && (DECL_BY_COMPONENT_PTR_P
1578 }
1582 /* Say we have an unimplemented attribute. Then set the
1583 value to be returned to be a zero and hope that's something
1584 we can convert to the type of this attribute. */
1590 }
1592 /* If this is an attribute where the prefix was unused,
1593 force a use of it if it has a side-effect. But don't do it if
1594 the prefix is just an entity name. However, if an access check
1595 is needed, we must do it. See second example in AARM 11.6(5.e). */
1600 }
1604 /* Like 'Access as far as we are concerned. */
1612 {
1613 tree gnu_aggr_type;
1615 /* ??? It is wrong to evaluate the type now, but there doesn't
1616 seem to be any other practical way of doing it. */
1618 gnu_aggr_type = gnu_result_type
1623 gnu_aggr_type
1630 gnu_result
1632 gnu_aggr_type);
1634 {
1635 /* The first element is the discrimant, which we ignore. The
1636 next is the field we're building. Convert the expression
1637 to the type of the field and then to the union type. */
1638 Node_Id gnat_assoc
1641 tree gnu_field_type
1646 }
1649 gnu_aggr_type,
1652 gnu_result
1653 = build_binary_op
1658 (Next
1660 else
1664 }
1674 /* Get the operand expression. */
1678 gnu_result
1690 /* If the result is a pointer type, see if we are improperly
1691 converting to a stricter alignment. */
1695 {
1698 unsigned int oalign
1703 post_error_ne_tree_2
1707 }
1715 {
1718 tree gnu_low;
1719 tree gnu_high;
1721 /* GNAT_RANGE is either an N_Range node or an identifier
1722 denoting a subtype. */
1724 {
1727 }
1730 {
1735 }
1736 else
1741 /* If LOW and HIGH are identical, perform an equality test.
1742 Otherwise, ensure that GNU_OBJECT is only evaluated once
1743 and perform a full range test. */
1747 else
1748 {
1750 gnu_result
1756 }
1760 }
1768 ? RDIV_EXPR
1775 {
1776 /* Some processing below (e.g. clear_last_expr) requires access to
1777 status fields now maintained in the current function context, so
1778 we'll setup a dummy one if needed. We cannot use global_binding_p,
1779 since it might be true due to force_global and making a dummy
1780 context would kill the current function context. */
1783 tree gnu_rhs_side;
1788 /* The elaboration of the RHS may generate code. If so,
1789 we need to make sure it gets executed after the LHS. */
1804 gnu_rhs);
1807 }
1811 /* These can either be operations on booleans or on modular types.
1812 Fall through for boolean types since that's the way GNU_CODES is
1813 set up. */
1815 Modular_Integer_Kind))
1816 {
1817 enum tree_code code
1828 }
1830 /* ... fall through ... */
1841 {
1843 tree gnu_type;
1849 /* If this is a comparison operator, convert any references to
1850 an unconstrained array value into a reference to the
1851 actual array. */
1853 {
1856 }
1858 /* If the result type is a private type, its full view may be a
1859 numeric subtype. The representation we need is that of its base
1860 type, given that it is the result of an arithmetic operation. */
1862 gnu_type = gnu_result_type
1865 /* If this is a shift whose count is not guaranteed to be correct,
1866 we need to adjust the shift count. */
1869 {
1871 tree gnu_max_shift
1879 gnu_rhs
1880 = build_binary_op
1883 gnu_count_type,
1884 gnu_max_shift,
1886 integer_one_node)),
1887 gnu_rhs);
1888 }
1890 /* For right shifts, the type says what kind of shift to do,
1891 so we may need to choose a different type. */
1900 {
1903 }
1907 /* If this is a logical shift with the shift count not verified,
1908 we must return zero if it is too large. We cannot compensate
1909 above in this case. */
1913 gnu_result
1914 = build_cond_expr
1917 gnu_rhs,
1921 gnu_result);
1922 }
1926 {
1929 tree gnu_false
1936 }
1945 /* This case can apply to a boolean or a modular type.
1946 Fall through for a boolean operand since GNU_CODES is set
1947 up to handle this. */
1949 {
1953 gnu_expr);
1955 }
1957 /* ... fall through ... */
1964 else
1973 {
1975 tree gnu_type;
1979 /* The Expression operand can either be an N_Identifier or
1980 Expanded_Name, which must represent a type, or a
1981 N_Qualified_Expression, which contains both the object type and an
1982 initial value for the object. */
1987 {
1988 Entity_Id gnat_desig_type
1999 {
2002 }
2003 else
2004 {
2010 }
2011 }
2012 else
2019 }
2022 /***************************/
2023 /* Chapter 5: Statements: */
2024 /***************************/
2028 {
2034 /* If this is the first label of an exception handler, we must
2035 mark that any CALL_INSN can jump to it. */
2039 nonlocal_goto_handler_labels
2041 nonlocal_goto_handler_labels);
2042 }
2052 /* Get the LHS and RHS of the statement and convert any reference to an
2053 unconstrained array into a reference to the underlying array. */
2055 gnu_rhs
2058 /* If range check is needed, emit code to generate it */
2062 /* If either side's type has a size that overflows, convert this
2063 into raise of Storage_Error: execution shouldn't have gotten
2064 here anyway. */
2070 else
2071 gnu_result
2078 /* Start an IF statement giving the condition. */
2083 /* Generate code for the statements to be executed if the condition
2084 is true. */
2091 /* Generate each of the "else if" parts. */
2093 {
2097 {
2098 Node_Id gnat_statement;
2102 /* Set up the line numbers for each condition we test. */
2110 }
2111 }
2113 /* Finally, handle any statements in the "else" part. */
2115 {
2122 }
2128 {
2129 Node_Id gnat_when;
2130 Node_Id gnat_choice;
2131 tree gnu_label;
2132 Node_Id gnat_statement;
2137 /* The range of values in a case statement is determined by the
2138 rules in RM 5.4(7-9). In almost all cases, this range is
2139 represented by the Etype of the expression. One exception arises
2140 in the case of a simple name that is parenthesized. This still
2141 has the Etype of the name, but since it is not a name, para 7
2142 does not apply, and we need to go to the base type. This is the
2143 only case where parenthesization affects the dynamic semantics
2144 (i.e. the range of possible values at runtime that is covered by
2145 the others alternative.
2147 Another exception is if the subtype of the expression is
2148 non-static. In that case, we also have to use the base type. */
2160 {
2161 /* First compile all the different case choices for the current
2162 WHEN alternative. */
2166 {
2173 {
2175 /* Abort on all errors except range empty, which
2176 means we ignore this alternative. */
2177 error_code
2187 error_code
2188 = pushcase_range
2201 /* This represents either a subtype range or a static value
2202 of some kind; Ekind says which. If a static value,
2203 fall through to the next case. */
2205 {
2208 error_code
2216 }
2217 /* ... fall through ... */
2232 }
2233 }
2235 /* After compiling the choices attached to the WHEN compile the
2236 body of statements that have to be executed, should the
2237 "WHEN ... =>" be taken. Push a binding level here in case
2238 variables are declared since we want them to be local to this
2239 set of statements instead of the block containing the Case
2240 statement. */
2248 /* Communicate to GCC that we are done with the current WHEN,
2249 i.e. insert a "break" statement. */
2253 }
2256 }
2260 {
2261 /* The loop variable in GCC form, if any. */
2263 /* PREINCREMENT_EXPR or PREDECREMENT_EXPR. */
2265 /* Used if this is a named loop for so EXIT can work. */
2267 /* Condition to continue loop tested at top of loop. */
2269 /* Similar, but tested at bottom of loop. */
2271 Node_Id gnat_statement;
2276 /* Set the condition that under which the loop should continue.
2277 For "LOOP .... END LOOP;" the condition is always true. */
2279 ;
2280 /* The case "WHILE condition LOOP ..... END LOOP;" */
2283 else
2284 {
2285 /* We have an iteration scheme. */
2286 Node_Id gnat_loop_spec
2298 tree gnu_limit
2302 /* We know the loop variable will not overflow if GNU_LAST is
2303 a constant and is not equal to GNU_LIMIT. If it might
2304 overflow, we have to move the limit test to the end of
2305 the loop. In that case, we have to test for an
2306 empty loop outside the loop. */
2310 {
2316 }
2318 /* Open a new nesting level that will surround the loop to declare
2319 the loop index variable. */
2323 /* Declare the loop index and set it to its initial value. */
2327 gnu_loop_var);
2329 /* The loop variable might be a padded type, so use `convert' to
2330 get a reference to the inner variable if so. */
2333 /* Set either the top or bottom exit condition as
2334 appropriate depending on whether we know an overflow
2335 cannot occur or not. */
2337 gnu_bottom_condition
2340 else
2341 gnu_top_condition
2346 }
2351 else
2354 /* If the loop was named, have the name point to this loop. In this
2355 case, the association is not a ..._DECL node; in fact, it isn't
2356 a GCC tree node at all. Since this name is referenced inside
2357 the loop, do it before we process the statements of the loop. */
2359 {
2364 }
2368 /* We must evaluate the condition after we've entered the
2369 loop so that any expression actions get done in the right
2370 place. */
2376 /* Make the loop body into its own block, so any allocated
2377 storage will be released every iteration. This is needed
2378 for stack allocation. */
2381 gnu_block_stack
2398 {
2401 gnu_loop_var,
2403 integer_one_node));
2406 }
2412 {
2413 /* Close the nesting level that sourround the loop that was used to
2414 declare the loop index variable. */
2418 }
2421 {
2424 }
2425 }
2442 {
2443 /* Which loop to exit, NULL if the current loop. */
2445 /* The GCC version of the optional GNAT condition node attached to the
2446 exit statement. Exit the loop if this is false. */
2450 loop_id
2459 }
2466 {
2467 /* The gnu function type of the subprogram currently processed. */
2469 /* The return value from the subprogram. */
2472 /* If we are dealing with a "return;" from an Ada procedure with
2473 parameters passed by copy in copy out, we need to return a record
2474 containing the final values of these parameters. If the list
2475 contains only one entry, return just that entry.
2477 For a full description of the copy in copy out parameter mechanism,
2478 see the part of the gnat_to_gnu_entity routine dealing with the
2479 translation of subprograms.
2481 But if we have a return label defined, convert this into
2482 a branch to that label. */
2488 {
2491 else
2492 gnu_ret_val
2495 }
2497 /* If the Ada subprogram is a function, we just need to return the
2498 expression. If the subprogram returns an unconstrained
2499 array, we have to allocate a new version of the result and
2500 return it. If we return by reference, return a pointer. */
2503 {
2506 /* Do not remove the padding from GNU_RET_VAL if the inner
2507 type is self-referential since we want to allocate the fixed
2508 size in that case. */
2512 && (TYPE_IS_PADDING_P
2514 && (CONTAINS_PLACEHOLDER_P
2523 {
2526 /* We have two cases: either the function returns with
2527 depressed stack or not. If not, we allocate on the
2528 secondary stack. If so, we allocate in the stack frame.
2529 if no copy is needed, the front end will set By_Ref,
2530 which we handle in the case above. */
2532 gnu_ret_val
2535 gnat_node);
2536 else
2537 gnu_ret_val
2542 }
2543 }
2549 gnu_ret_val));
2550 else
2553 }
2566 /****************************/
2567 /* Chapter 6: Subprograms: */
2568 /****************************/
2571 /* Unless there is a freeze node, declare the subprogram. We consider
2572 this a "definition" even though we're not generating code for
2573 the subprogram because we will be making the corresponding GCC
2574 node here. */
2583 /* This subprogram doesn't exist for code generation purposes, but we
2584 have to elaborate the types of any parameters, unless they are
2585 imported types (nothing to generate in this case). */
2597 /* For a child unit identifier go up a level to get the
2598 specificaton. We get this when we try to find the spec of
2599 a child unit package that is the compilation unit being compiled. */
2604 {
2605 /* Save debug output mode in case it is reset. */
2608 /* Definining identifier of a parameter to the subprogram. */
2609 Entity_Id gnat_param;
2610 /* The defining identifier for the subprogram body. Note that if a
2611 specification has appeared before for this body, then the identifier
2612 occurring in that specification will also be a defining identifier
2613 and all the calls to this subprogram will point to that
2614 specification. */
2615 Entity_Id gnat_subprog_id
2619 /* The FUNCTION_DECL node corresponding to the subprogram spec. */
2620 tree gnu_subprog_decl;
2621 /* The FUNCTION_TYPE node corresponding to the subprogram spec. */
2622 tree gnu_subprog_type;
2623 tree gnu_cico_list;
2625 /* If this is a generic object or if it has been eliminated,
2626 ignore it. */
2633 /* If debug information is suppressed for the subprogram,
2634 turn debug mode off for the duration of processing. */
2636 {
2639 }
2641 /* If this subprogram acts as its own spec, define it. Otherwise,
2642 just get the already-elaborated tree node. However, if this
2643 subprogram had its elaboration deferred, we will already have
2644 made a tree node for it. So treat it as not being defined in
2645 that case. Such a subprogram cannot have an address clause or
2646 a freeze node, so this test is safe, though it does disable
2647 some otherwise-useful error checking. */
2648 gnu_subprog_decl
2655 /* Set the line number in the decl to correspond to that of
2656 the body so that the line number notes are written
2657 correctly. */
2663 /* There used to be a second call to set_lineno here, with
2664 write_note_p set, but begin_subprog_body actually already emits the
2665 note we want (via init_function_start).
2667 Emitting a second note here was necessary for -ftest-coverage with
2668 GCC 2.8.1, as the first one was skipped by branch_prob. This is no
2669 longer the case with GCC 3.x, so emitting a second note here would
2670 result in having the first line of the subprogram counted twice by
2671 gcov. */
2679 /* If there are OUT parameters, we need to ensure that the
2680 return statement properly copies them out. We do this by
2681 making a new block and converting any inner return into a goto
2682 to a label at the end of the block. */
2685 {
2686 gnu_return_label_stack
2689 gnu_return_label_stack);
2692 }
2693 else
2694 gnu_return_label_stack
2697 /* See if there are any parameters for which we don't yet have
2698 GCC entities. These must be for OUT parameters for which we
2699 will be making VAR_DECL nodes here. Fill them in to
2700 TYPE_CI_CO_LIST, which must contain the empty entry as well.
2701 We can match up the entries because TYPE_CI_CO_LIST is in the
2702 order of the parameters. */
2709 else
2710 {
2711 /* Skip any entries that have been already filled in; they
2712 must correspond to IN OUT parameters. */
2715 ;
2717 /* Do any needed references for padded types. */
2721 }
2725 /* Generate the code of the subprogram itself. A return statement
2726 will be present and any OUT parameters will be handled there. */
2734 {
2735 tree gnu_retval;
2745 else
2747 gnu_cico_list);
2750 gnu_retval
2753 expand_return
2756 gnu_retval));
2758 }
2762 /* Disconnect the trees for parameters that we made variables for
2763 from the GNAT entities since these will become unusable after
2764 we end the function. */
2775 }
2784 {
2785 /* The GCC node corresponding to the GNAT subprogram name. This can
2786 either be a FUNCTION_DECL node if we are dealing with a standard
2787 subprogram call, or an indirect reference expression (an
2788 INDIRECT_REF node) pointing to a subprogram. */
2790 /* The FUNCTION_TYPE node giving the GCC type of the subprogram. */
2792 tree gnu_subprog_addr
2794 Entity_Id gnat_formal;
2795 Node_Id gnat_actual;
2799 tree gnu_subprog_call;
2802 {
2810 }
2815 /* If we are calling a stubbed function, make this into a
2816 raise of Program_Error. Elaborate all our args first. */
2820 {
2827 {
2829 gnu_result
2832 }
2833 else
2834 expand_expr_stmt
2837 }
2839 /* The only way we can be making a call via an access type is
2840 if Name is an explicit dereference. In that case, get the
2841 list of formal args from the type the access type is pointing
2842 to. Otherwise, get the formals from entity being called. */
2846 /* Assume here that this must be 'Elab_Body or 'Elab_Spec. */
2848 else
2851 /* Create the list of the actual parameters as GCC expects it, namely
2852 a chain of TREE_LIST nodes in which the TREE_VALUE field of each
2853 node is a parameter-expression and the TREE_PURPOSE field is
2854 null. Skip OUT parameters that are not passed by reference and
2855 don't need to be copied in. */
2861 {
2863 /* We treat a conversion between aggregate types as if it
2864 is an unchecked conversion. */
2865 int unchecked_convert_p
2870 Node_Id gnat_name
2874 tree gnu_actual;
2876 /* If it's possible we may need to use this expression twice,
2877 make sure than any side-effects are handled via SAVE_EXPRs.
2878 Likewise if we need to force side-effects before the call.
2879 ??? This is more conservative than we need since we don't
2880 need to do this for pass-by-ref with no conversion.
2881 If we are passing a non-addressable Out or In Out parameter by
2882 reference, pass the address of a copy and set up to copy back
2883 out after the call. */
2886 {
2892 && (DECL_BY_COMPONENT_PTR_P
2894 || DECL_BY_DESCRIPTOR_P
2896 {
2898 tree gnu_temp;
2900 /* Remove any unpadding on the actual and make a copy.
2901 But if the actual is a left-justified modular type,
2902 first convert to it. */
2906 && (TYPE_IS_PADDING_P
2910 && (TYPE_LEFT_JUSTIFIED_MODULAR_P
2916 /* Since we're going to take the address of the SAVE_EXPR,
2917 we don't want it to be marked as unchanging.
2918 So set TREE_ADDRESSABLE. */
2921 {
2924 }
2926 /* Set up to move the copy back to the original. */
2928 gnu_after_list);
2931 }
2932 }
2934 /* If this was a procedure call, we may not have removed any
2935 padding. So do it here for the part we will use as an
2936 input, if any. */
2942 gnu_actual);
2945 && ! unchecked_convert_p
2949 /* Do any needed conversions. We need only check for
2950 unchecked conversion since normal conversions will be handled
2951 by just converting to the formal type. */
2953 {
2954 gnu_actual
2956 gnu_actual,
2961 /* One we've done the unchecked conversion, we still
2962 must ensure that the object is in range of the formal's
2963 type. */
2968 }
2970 /* We may have suppressed a conversion to the Etype of the
2971 actual since the parent is a procedure call. So add the
2972 conversion here. */
2974 gnu_actual);
2979 /* If we have not saved a GCC object for the formal, it means it
2980 is an OUT parameter not passed by reference and that does not
2981 need to be copied in. Otherwise, look at the PARM_DECL to see
2982 if it is passed by reference. */
2986 {
2988 {
2991 /* If we have a padded type, be sure we've removed the
2992 padding. */
2996 gnu_actual
2998 gnu_actual);
2999 }
3001 /* The symmetry of the paths to the type of an entity is
3002 broken here since arguments don't know that they will
3003 be passed by ref. */
3006 gnu_actual);
3007 }
3011 {
3018 {
3019 gnu_formal_type
3022 }
3024 /* Take the address of the object and convert to the
3025 proper pointer type. We'd like to actually compute
3026 the address of the beginning of the array using
3027 an ADDR_EXPR of an ARRAY_REF, but there's a possibility
3028 that the ARRAY_REF might return a constant and we'd
3029 be getting the wrong address. Neither approach is
3030 exactly correct, but this is the most likely to work
3031 in all cases. */
3034 gnu_actual));
3035 }
3039 {
3040 /* If arg is 'Null_Parameter, pass zero descriptor. */
3044 gnu_actual
3046 integer_zero_node);
3047 else
3048 gnu_actual
3051 gnat_formal));
3052 }
3053 else
3054 {
3058 gnu_name_list
3066 /* If this is 'Null_Parameter, pass a zero even though we are
3067 dereferencing it. */
3072 BITS_PER_WORD))
3073 gnu_actual
3074 = unchecked_convert
3079 else
3080 gnu_actual
3083 gnu_actual);
3084 }
3086 gnu_actual_list
3089 }
3093 NULL_TREE);
3096 /* If it is a function call, the result is the call expression. */
3098 {
3101 /* If the function returns an unconstrained array or by reference,
3102 we have to de-dereference the pointer. */
3106 gnu_result);
3109 }
3111 /* If this is the case where the GNAT tree contains a procedure call
3112 but the Ada procedure has copy in copy out parameters, the special
3113 parameter passing mechanism must be used. */
3115 {
3116 /* List of FIELD_DECLs associated with the PARM_DECLs of the copy
3117 in copy out parameters. */
3122 {
3123 tree gnu_name;
3127 /* If any of the names had side-effects, ensure they are
3128 all evaluated before the call. */
3132 gnu_subprog_call
3135 }
3139 else
3146 /* If we are dealing with a copy in copy out parameter, we must
3147 retrieve its value from the record returned in the function
3148 call. */
3154 && ((DECL_BY_COMPONENT_PTR_P
3156 || (DECL_BY_DESCRIPTOR_P
3159 {
3160 /* Get the value to assign to this OUT or IN OUT
3161 parameter. It is either the result of the function if
3162 there is only a single such parameter or the appropriate
3163 field from the record returned. */
3164 tree gnu_result
3166 : build_component_ref
3169 int unchecked_conversion
3171 /* If the actual is a conversion, get the inner expression,
3172 which will be the real destination, and convert the
3173 result to the type of the actual parameter. */
3174 tree gnu_actual
3177 /* If the result is a padded type, remove the padding. */
3180 gnu_result
3183 gnu_result);
3185 /* If the result is a type conversion, do it. */
3187 gnu_result
3188 = convert_with_check
3195 gnu_result
3198 else
3199 {
3209 gnu_result);
3210 }
3217 }
3218 }
3219 else
3220 {
3223 }
3225 /* Handle anything we need to assign back. */
3227 gnu_expr;
3232 }
3235 /*************************/
3236 /* Chapter 7: Packages: */
3237 /*************************/
3251 /* If this is the body of a generic package - do nothing */
3258 {
3262 }
3265 /*********************************/
3266 /* Chapter 8: Visibility Rules: */
3267 /*********************************/
3271 /* Nothing to do here - but these may appear in list of declarations */
3274 /***********************/
3275 /* Chapter 9: Tasks: */
3276 /***********************/
3285 /***********************************************************/
3286 /* Chapter 10: Program Structure and Compilation Issues: */
3287 /***********************************************************/
3291 /* For a body, first process the spec if there is one. */
3300 {
3307 };
3314 /* Process any pragmas following the unit. */
3320 /* Put all the Actions into the elaboration routine if we already had
3321 elaborations. This will happen anyway if they are statements, but we
3322 want to force declarations there too due to order-of-elaboration
3323 issues. Most should have Is_Statically_Allocated set. If we
3324 have had no elaborations, we have no order-of-elaboration issue and
3325 don't want to create elaborations here. */
3329 {
3333 else
3335 }
3337 /* Generate elaboration code for this unit, if necessary, and
3338 say whether we did or not. */
3339 Set_Has_No_Elaboration_Code
3341 build_unit_elab
3353 /* Simply process whatever unit is being inserted. */
3361 /***************************/
3362 /* Chapter 11: Exceptions: */
3363 /***************************/
3367 /* The GCC exception handling mechanism can handle both ZCX and SJLJ
3368 schemes and we have our own SJLJ mechanism. To call the GCC
3369 mechanism, we first call expand_eh_region_start if there is at least
3370 one handler associated with the region. We then generate code for
3371 the region and call expand_start_all_catch to announce that the
3372 associated handlers are going to be generated.
3374 For each handler we call expand_start_catch, generate code for the
3375 handler, and then call expand_end_catch.
3377 After all the handlers, we call expand_end_all_catch.
3379 Here we deal with the region level calls and the
3380 N_Exception_Handler branch deals with the handler level calls
3381 (start_catch/end_catch).
3383 ??? The region level calls down there have been specifically put in
3384 place for a ZCX context and currently the order in which things are
3385 emitted (region/handlers) is different from the SJLJ case. Instead of
3386 putting other calls with different conditions at other places for the
3387 SJLJ case, it seems cleaner to reorder things for the SJLJ case and
3388 generalize the condition to make it not ZCX specific. */
3390 /* If there is an At_End procedure attached to this node, and the eh
3391 mechanism is GNAT oriented (SJLJ or ZCX with front end tables), we
3392 must have at least a corresponding At_End handler, unless the
3393 No_Exception_Handlers restriction is set. */
3401 {
3402 /* Need a binding level that we can exit for this sequence if there is
3403 at least one exception handler for this block (since each handler
3404 needs an identified exit point) or there is an At_End procedure
3405 attached to this node (in order to have an attachment point for a
3406 GCC cleanup). */
3407 bool exitable_binding_for_block
3408 = (! type_annotate_only
3412 /* Make a binding level that we can exit if we need one. */
3414 {
3417 }
3419 /* If we are to call a function when exiting this block, expand a GCC
3420 cleanup to take care. We have made a binding level for this cleanup
3421 above. */
3423 {
3424 tree gnu_cleanup_call
3427 tree gnu_cleanup_decl
3433 }
3435 /* Now we generate the code for this block, with a different layout
3436 for GNAT SJLJ and for GCC or front end ZCX. The handlers come first
3437 in the GNAT SJLJ case, while they come after the handled sequence
3438 in the other cases. */
3440 /* First deal with possible handlers for the GNAT SJLJ scheme. */
3444 {
3445 /* We already have a fresh binding level at hand. Declare a
3446 variable to save the old __gnat_jmpbuf value and a variable for
3447 our jmpbuf. Call setjmp and handle each of the possible
3448 exceptions if it returns one. */
3450 tree gnu_jmpsave_decl
3452 jmpbuf_ptr_type,
3456 tree gnu_jmpbuf_decl
3464 /* When we exit this block, restore the saved value. */
3467 gnu_jmpsave_decl));
3469 /* Call setjmp and handle exceptions if it returns one. */
3471 expand_start_cond
3474 gnu_jmpbuf_decl)),
3477 /* Restore our incoming longjmp value before we do anything. */
3478 expand_expr_stmt
3481 /* Make a binding level for the exception handling declarations
3482 and code. Don't assign it an exit label, since this is the
3483 outer block we want to exit at the end of each handler. */
3487 gnu_except_ptr_stack
3489 create_var_decl
3494 gnu_except_ptr_stack);
3496 /* Generate code for each handler. The N_Exception_Handler case
3497 below does the real work. We ignore the dummy exception handler
3498 for the identifier case, as this is used only by the front
3499 end. */
3505 /* If none of the exception handlers did anything, re-raise
3506 but do not defer abortion. */
3508 expand_expr_stmt
3514 /* End the binding level dedicated to the exception handlers. */
3518 /* End the "if" on setjmp. Note that we have arranged things so
3519 control never returns here. */
3522 /* This is now immediately before the body proper. Set our jmp_buf
3523 as the current buffer. */
3524 expand_expr_stmt
3527 gnu_jmpbuf_decl)));
3528 }
3530 /* Now comes the processing for the sequence body. */
3532 /* If we use the back-end eh support, tell the back-end we are
3533 starting a new exception region. */
3539 /* Generate code and declarations for the prefix of this block,
3540 if any. */
3545 /* Generate code for each statement in the block. */
3553 /* Exit the binding level we made, if any. */
3557 /* Compile the handlers for front end ZCX or back-end supported
3558 exceptions. */
3562 {
3573 }
3575 /* Close the binding level we made, if any. */
3577 {
3580 }
3581 }
3587 {
3588 /* Unless this is "Others" or the special "Non-Ada" exception
3589 for Ada, make an "if" statement to select the proper
3590 exceptions. For "Others", exclude exceptions where
3591 Handled_By_Others is nonzero unless the All_Others flag is set.
3592 For "Non-ada", accept an exception if "Lang" is 'V'. */
3597 {
3598 tree this_choice;
3601 {
3604 else
3605 this_choice
3606 = build_binary_op
3608 convert
3610 build_component_ref
3611 (build_unary_op
3616 integer_zero_node);
3617 }
3621 {
3624 /* Exception may be a renaming. Recover original exception
3625 which is the one elaborated and registered. */
3629 /* ??? Note that we have to use gnat_to_gnu_entity here
3630 since the type of the exception will be wrong in the
3631 VMS case and that's exactly what this test is for. */
3634 /* If this was a VMS exception, check import_code
3635 against the value of the exception. */
3637 this_choice
3638 = build_binary_op
3640 build_component_ref
3641 (build_unary_op
3645 gnu_expr);
3646 else
3647 this_choice
3648 = build_binary_op
3651 convert
3655 /* If this is the distinguished exception "Non_Ada_Error"
3656 (and we are in VMS mode), also allow a non-Ada
3657 exception (a VMS condition) to match. */
3659 {
3660 tree gnu_comp
3661 = build_component_ref
3662 (build_unary_op
3667 this_choice
3668 = build_binary_op
3670 build_binary_op
3674 this_choice);
3675 }
3676 }
3677 else
3682 }
3687 }
3689 /* Tell the back end that we start an exception handler if necessary. */
3691 {
3692 /* We build a TREE_LIST of nodes representing what exception
3693 types this handler is able to catch, with special cases
3694 for others and all others cases.
3696 Each exception type is actually identified by a pointer to the
3697 exception id, with special value zero for "others" and one for
3698 "all others". Beware that these special values are known and used
3699 by the personality routine to identify the corresponding specific
3700 kinds of handlers.
3702 ??? For initial time frame reasons, the others and all_others
3703 cases have been handled using specific type trees, but this
3704 somehow hides information to the back-end, which expects NULL to
3705 be passed for catch all and end_cleanup to be used for cleanups.
3707 Care should be taken to ensure that the control flow impact of
3708 such clauses is rendered in some way. lang_eh_type_covers is
3709 doing the trick currently. */
3716 {
3718 gnu_etype
3723 {
3726 /* Exception may be a renaming. Recover original exception
3727 which is the one elaborated and registered. */
3733 gnu_etype
3735 }
3736 else
3739 /* The GCC interface expects NULL to be passed for catch all
3740 handlers, so it would be quite tempting to set gnu_etypes_list
3741 to NULL if gnu_etype is integer_zero_node. It would not work,
3742 however, because GCC's notion of "catch all" is stronger than
3743 our notion of "others". Until we correctly use the cleanup
3744 interface as well, the doing tht would prevent the "all
3745 others" handlers from beeing seen, because nothing can be
3746 caught beyond a catch all from GCC's point of view. */
3747 gnu_etypes_list
3750 }
3757 {
3758 /* Expand a call to the begin_handler hook at the beginning of the
3759 handler, and arrange for a call to the end_handler hook to
3760 occur on every possible exit path.
3762 The hooks expect a pointer to the low level occurrence. This
3763 is required for our stack management scheme because a raise
3764 inside the handler pushes a new occurrence on top of the
3765 stack, which means that this top does not necessarily match
3766 the occurrence this handler was dealing with.
3768 The EXC_PTR_EXPR object references the exception occurrence
3769 beeing propagated. Upon handler entry, this is the exception
3770 for which the handler is triggered. This might not be the case
3771 upon handler exit, however, as we might have a new occurrence
3772 propagated by the handler's body, and the end_handler hook
3773 called as a cleanup in this context.
3775 We use a local variable to retrieve the incoming value at
3776 handler entry time, and reuse it to feed the end_handler
3777 hook's argument at exit time. */
3778 tree gnu_current_exc_ptr
3780 tree gnu_incoming_exc_ptr
3785 expand_expr_stmt
3787 expand_decl_cleanup
3789 }
3790 }
3797 {
3798 /* Tell the back end that we're done with the current handler. */
3803 }
3804 else
3805 /* At the end of the handler, exit the block. We made this block in
3806 N_Handled_Sequence_Of_Statements. */
3814 /*******************************/
3815 /* Chapter 12: Generic Units: */
3816 /*******************************/
3826 /* These nodes can appear on a declaration list but there is nothing to
3827 to be done with them. */
3830 /***************************************************/
3831 /* Chapter 13: Representation Clauses and */
3832 /* Implementation-Dependent Features: */
3833 /***************************************************/
3837 /* The only one we need deal with is for 'Address. For the others, SEM
3838 puts the information elsewhere. We need only deal with 'Address
3839 if the object has a Freeze_Node (which it never will currently). */
3844 /* Get the value to use as the address and save it as the
3845 equivalent for GNAT_TEMP. When the object is frozen,
3846 gnat_to_gnu_entity will do the right thing. */
3854 /* We do nothing with these. SEM puts the information elsewhere. */
3859 {
3865 /* First process inputs, then outputs, then clobbers. */
3868 {
3873 gnu_input_list
3876 }
3880 {
3885 gnu_orig_out_list
3887 gnu_output_list
3890 }
3894 gnu_clobber_list
3897 gnu_clobber_list);
3904 input_location);
3906 /* Copy all the intermediate outputs into the specified outputs. */
3911 {
3912 expand_expr_stmt
3917 }
3918 }
3921 /***************************************************/
3922 /* Added Nodes */
3923 /***************************************************/
3937 {
3939 tree gnu_obj_type;
3940 tree gnu_obj_size;
3943 /* If this is an unconstrained array, we know the object must
3944 have been allocated with the template in front of the object.
3945 So pass the template address, but get the total size. Do this
3946 by converting to a thin pointer. */
3948 gnu_ptr
3950 (TYPE_OBJECT_RECORD_TYPE
3952 gnu_ptr);
3960 {
3963 tree gnu_byte_offset
3970 }
3973 expand_expr_stmt
3977 }
3990 /* If the type is VOID, this is a statement, so we need to
3991 generate the code for the call. Handle a Condition, if there
3992 is one. */
3994 {
4004 }
4005 else
4009 /* Nothing to do, since front end does all validation using the
4010 values that Gigi back-annotates. */
4023 }
4025 /* If the result is a statement, set needed flags and return it. */
4027 {
4032 }
4034 /* If the result is a constant that overflows, raise constraint error. */
4037 {
4040 gnu_result
4043 }
4045 /* If our result has side-effects and is of an unconstrained type,
4046 make a SAVE_EXPR so that we can be sure it will only be referenced
4047 once. Note we must do this before any conversions. */
4053 /* Now convert the result to the proper type. If the type is void or if
4054 we have no result, return error_mark_node to show we have no result.
4055 If the type of the result is correct or if we have a label (which doesn't
4056 have any well-defined type), return our result. Also don't do the
4057 conversion if the "desired" type involves a PLACEHOLDER_EXPR in its size
4058 since those are the cases where the front end may have the type wrong due
4059 to "instantiating" the unconstrained record with discriminant values
4060 or if this is a FIELD_DECL. If this is the Name of an assignment
4061 statement or a parameter of a procedure call, return what we have since
4062 the RHS has to be converted to our type there in that case, unless
4063 GNU_RESULT_TYPE has a simpler size. Similarly, if the two types are
4064 record types with the same name, the expression type has integral mode,
4065 and GNU_RESULT_TYPE BLKmode, don't convert. This will be the case when
4066 we are converting from a packable type to its actual type and we need
4067 those conversions to be NOPs in order for assignments into these types to
4068 work properly if the inner object is a bitfield and hence can't have
4069 its address taken. Finally, don't convert integral types that are the
4070 operand of an unchecked conversion since we need to ignore those
4071 conversions (for 'Valid). Otherwise, convert the result to the proper
4072 type. */
4092 && (CONTAINS_PLACEHOLDER_P
4096 {
4097 /* In this case remove padding only if the inner object is of
4098 self-referential size: in that case it must be an object of
4099 unconstrained type with a default discriminant. In other cases,
4100 we want to avoid copying too much data. */
4107 gnu_result);
4108 }
4124 {
4125 /* Remove any padding record, but do nothing more in this case. */
4129 gnu_result);
4130 }
4138 /* We don't need any NOP_EXPR or NON_LVALUE_EXPR on GNU_RESULT. */
4145 }
4146 \f
4147 /* GNU_STMT is a statement. We generate code for that statement. */
4149 void
4151 {
4155 {
4162 }
4163 }
4164 \f
4165 /* Force references to each of the entities in packages GNAT_NODE with's
4166 so that the debugging information for all of them are identical
4167 in all clients. Operate recursively on anything it with's, but check
4168 that we aren't elaborating something more than once. */
4170 /* The reason for this routine's existence is two-fold.
4171 First, with some debugging formats, notably MDEBUG on SGI
4172 IRIX, the linker will remove duplicate debugging information if two
4173 clients have identical debugguing information. With the normal scheme
4174 of elaboration, this does not usually occur, since entities in with'ed
4175 packages are elaborated on demand, and if clients have different usage
4176 patterns, the normal case, then the order and selection of entities
4177 will differ. In most cases however, it seems that linkers do not know
4178 how to eliminate duplicate debugging information, even if it is
4179 identical, so the use of this routine would increase the total amount
4180 of debugging information in the final executable.
4182 Second, this routine is called in type_annotate mode, to compute DDA
4183 information for types in withed units, for ASIS use */
4185 static void
4187 {
4190 /* Process each unit only once. As we trace the context of all relevant
4191 units transitively, including generic bodies, we may encounter the
4192 same generic unit repeatedly */
4197 /* Save entities in all context units. A body may have an implicit_with
4198 on its own spec, if the context includes a child unit, so don't save
4199 the spec twice. */
4207 {
4211 {
4228 }
4230 {
4231 Node_Id gnat_body
4234 /* Retrieve compilation unit node of generic body. */
4239 /* If body is available, elaborate its context. */
4242 }
4243 }
4247 }
4248 \f
4249 /* Do the processing of N_Freeze_Entity, GNAT_NODE. */
4251 static void
4253 {
4255 tree gnu_old;
4256 tree gnu_new;
4257 tree gnu_init
4262 /* If this is a package, need to generate code for the package. */
4264 {
4265 insert_code_for
4269 }
4271 /* Check for old definition after the above call. This Freeze_Node
4272 might be for one its Itypes. */
4273 gnu_old
4276 /* If this entity has an Address representation clause, GNU_OLD is the
4277 address, so discard it here. */
4281 /* Don't do anything for class-wide types they are always
4282 transformed into their root type. */
4288 /* Don't do anything for subprograms that may have been elaborated before
4289 their freeze nodes. This can happen, for example because of an inner call
4290 in an instance body. */
4297 /* If we have a non-dummy type old tree, we have nothing to do. Unless
4298 this is the public view of a private type whose full view was not
4299 delayed, this node was never delayed as it should have been.
4300 Also allow this to happen for concurrent types since we may have
4301 frozen both the Corresponding_Record_Type and this type. */
4305 {
4312 else
4314 }
4316 /* Reset the saved tree, if any, and elaborate the object or type for real.
4317 If there is a full declaration, elaborate it and copy the type to
4318 GNAT_ENTITY. Likewise if this is the record subtype corresponding to
4319 a class wide type or subtype. */
4321 {
4330 }
4334 {
4337 /* The above call may have defined this entity (the simplest example
4338 of this is when we have a private enumeral type since the bounds
4339 will have the public view. */
4345 }
4346 else
4349 /* If we've made any pointers to the old version of this type, we
4350 have to update them. */
4354 }
4355 \f
4356 /* Process the list of inlined subprograms of GNAT_NODE, which is an
4357 N_Compilation_Unit. */
4359 static void
4361 {
4362 Entity_Id gnat_entity;
4363 Node_Id gnat_body;
4365 /* If we can inline, generate RTL for all the inlined subprograms.
4366 Define the entity first so we set DECL_EXTERNAL. */
4371 {
4375 {
4376 /* ??? This really should always be Present. */
4380 gnat_body
4382 }
4385 {
4388 }
4389 }
4390 }
4391 \f
4392 /* Elaborate decls in the lists GNAT_DECLS and GNAT_DECLS2, if present.
4393 We make two passes, one to elaborate anything other than bodies (but
4394 we declare a function if there was no spec). The second pass
4395 elaborates the bodies.
4397 GNAT_END_LIST gives the element in the list past the end. Normally,
4398 this is Empty, but can be First_Real_Statement for a
4399 Handled_Sequence_Of_Statements.
4401 We make a complete pass through both lists if PASS1P is true, then make
4402 the second pass over both lists if PASS2P is true. The lists usually
4403 correspond to the public and private parts of a package. */
4405 static void
4407 List_Id gnat_decls2,
4408 Node_Id gnat_end_list,
4411 {
4413 Node_Id gnat_decl;
4423 {
4426 /* For package specs, we recurse inside the declarations,
4427 thus taking the two pass approach inside the boundary. */
4435 /* Similarly for any declarations in the actions of a
4436 freeze node. */
4438 {
4441 }
4443 /* Package bodies with freeze nodes get their elaboration deferred
4444 until the freeze node, but the code must be placed in the right
4445 place, so record the code position now. */
4453 (Corresponding_Spec
4456 record_code_position
4459 /* We defer most subprogram bodies to the second pass. */
4461 {
4463 {
4469 }
4470 }
4471 /* For bodies and stubs that act as their own specs, the entity
4472 itself must be elaborated in the first pass, because it may
4473 be used in other declarations. */
4475 {
4476 Node_Id gnat_subprog_id =
4483 }
4485 /* Concurrent stubs stand for the corresponding subprogram bodies,
4486 which are deferred like other bodies. */
4489 ;
4491 else
4493 }
4495 /* Here we elaborate everything we deferred above except for package bodies,
4496 which are elaborated at their freeze nodes. Note that we must also
4497 go inside things (package specs and freeze nodes) the first pass did. */
4503 {
4519 }
4520 }
4521 \f
4522 /* Emit code for a range check. GNU_EXPR is the expression to be checked,
4523 GNAT_RANGE_TYPE the gnat type or subtype containing the bounds against
4524 which we have to check. */
4526 static tree
4528 {
4534 /* If GNU_EXPR has an integral type that is narrower than GNU_RANGE_TYPE,
4535 we can't do anything since we might be truncating the bounds. No
4536 check is needed in this case. */
4542 /* Checked expressions must be evaluated only once. */
4545 /* There's no good type to use here, so we might as well use
4546 integer_type_node. Note that the form of the check is
4547 (not (expr >= lo)) or (not (expr >= hi))
4548 the reason for this slightly convoluted form is that NaN's
4549 are not considered to be in range in the float case. */
4550 return emit_check
4552 invert_truthvalue
4556 invert_truthvalue
4560 gnu_high)))),
4562 }
4563 \f
4564 /* Emit code for an index check. GNU_ARRAY_OBJECT is the array object
4565 which we are about to index, GNU_EXPR is the index expression to be
4566 checked, GNU_LOW and GNU_HIGH are the lower and upper bounds
4567 against which GNU_EXPR has to be checked. Note that for index
4568 checking we cannot use the emit_range_check function (although very
4569 similar code needs to be generated in both cases) since for index
4570 checking the array type against which we are checking the indeces
4571 may be unconstrained and consequently we need to retrieve the
4572 actual index bounds from the array object itself
4573 (GNU_ARRAY_OBJECT). The place where we need to do that is in
4574 subprograms having unconstrained array formal parameters */
4576 static tree
4578 tree gnu_expr,
4579 tree gnu_low,
4580 tree gnu_high)
4581 {
4582 tree gnu_expr_check;
4584 /* Checked expressions must be evaluated only once. */
4587 /* Must do this computation in the base type in case the expression's
4588 type is an unsigned subtypes. */
4591 /* If GNU_LOW or GNU_HIGH are a PLACEHOLDER_EXPR, qualify them by
4592 the object we are handling. */
4601 /* There's no good type to use here, so we might as well use
4602 integer_type_node. */
4603 return emit_check
4606 gnu_expr_check,
4608 gnu_low)),
4610 gnu_expr_check,
4612 gnu_high))),
4614 }
4615 \f
4616 /* Given GNU_COND which contains the condition corresponding to an access,
4617 discriminant or range check, of value GNU_EXPR, build a COND_EXPR
4618 that returns GNU_EXPR if GNU_COND is false and raises a
4619 CONSTRAINT_ERROR if GNU_COND is true. REASON is the code that says
4620 why the exception was raised. */
4622 static tree
4624 {
4625 tree gnu_call;
4626 tree gnu_result;
4630 /* Use an outer COMPOUND_EXPR to make sure that GNU_EXPR will get evaluated
4631 in front of the comparison in case it ends up being a SAVE_EXPR. Put the
4632 whole thing inside its own SAVE_EXPR so the inner SAVE_EXPR doesn't leak
4633 out. */
4637 gnu_expr));
4639 /* If GNU_EXPR has side effects, make the outer COMPOUND_EXPR and
4640 protect it. Otherwise, show GNU_RESULT has no side effects: we
4641 don't need to evaluate it just for the check. */
4643 gnu_result
4645 else
4648 /* ??? Unfortunately, if we don't put a SAVE_EXPR around this whole thing,
4649 we will repeatedly do the test. It would be nice if GCC was able
4650 to optimize this and only do it once. */
4652 }
4653 \f
4654 /* Return an expression that converts GNU_EXPR to GNAT_TYPE, doing
4655 overflow checks if OVERFLOW_P is nonzero and range checks if
4656 RANGE_P is nonzero. GNAT_TYPE is known to be an integral type.
4657 If TRUNCATE_P is nonzero, do a float to integer conversion with
4658 truncation; otherwise round. */
4660 static tree
4662 tree gnu_expr,
4666 {
4678 /* If we are not doing any checks, the output is an integral type, and
4679 the input is not a floating type, just do the conversion. This
4680 shortcut is required to avoid problems with packed array types
4681 and simplifies code in all cases anyway. */
4686 /* First convert the expression to its base type. This
4687 will never generate code, but makes the tests below much simpler.
4688 But don't do this if converting from an integer type to an unconstrained
4689 array type since then we need to get the bounds from the original
4690 (unpacked) type. */
4694 /* If overflow checks are requested, we need to be sure the result will
4695 fit in the output base type. But don't do this if the input
4696 is integer and the output floating-point. */
4699 {
4700 /* Ensure GNU_EXPR only gets evaluated once. */
4704 /* Convert the lower bounds to signed types, so we're sure we're
4705 comparing them properly. Likewise, convert the upper bounds
4706 to unsigned types. */
4720 /* Check each bound separately and only if the result bound
4721 is tighter than the bound on the input type. Note that all the
4722 types are base types, so the bounds must be constant. Also,
4723 the comparison is done in the base type of the input, which
4724 always has the proper signedness. First check for input
4725 integer (which means output integer), output float (which means
4726 both float), or mixed, in which case we always compare.
4727 Note that we have to do the comparison which would *fail* in the
4728 case of an error since if it's an FP comparison and one of the
4729 values is a NaN or Inf, the comparison will fail. */
4736 gnu_cond
4737 = invert_truthvalue
4740 gnu_out_lb)));
4748 gnu_cond
4750 invert_truthvalue
4752 gnu_input,
4754 gnu_out_ub))));
4758 CE_Overflow_Check_Failed);
4759 }
4761 /* Now convert to the result base type. If this is a non-truncating
4762 float-to-integer conversion, round. */
4765 {
4775 gnu_result
4777 }
4783 else
4786 /* Finally, do the range check if requested. Note that if the
4787 result type is a modular type, the range check is actually
4788 an overflow check. */
4796 }
4797 \f
4798 /* Return 1 if GNU_EXPR can be directly addressed. This is the case unless
4799 it is an expression involving computation or if it involves a bitfield
4800 reference. This returns the same as gnat_mark_addressable in most
4801 cases. */
4803 static int
4805 {
4807 {
4812 /* All DECLs are addressable: if they are in a register, we can force
4813 them to memory. */
4839 {
4840 /* This is addressable if we can avoid a copy. */
4854 }
4858 }
4859 }
4860 \f
4861 /* Do the processing for the declaration of a GNAT_ENTITY, a type. If
4862 a separate Freeze node exists, delay the bulk of the processing. Otherwise
4863 make a GCC type for GNAT_ENTITY and set up the correspondance. */
4865 void
4867 {
4868 tree gnu_old
4870 tree gnu_new;
4872 /* If we are to delay elaboration of this type, just do any
4873 elaborations needed for expressions within the declaration and
4874 make a dummy type entry for this node and its Full_View (if
4875 any) in case something points to it. Don't do this if it
4876 has already been done (the only way that can happen is if
4877 the private completion is also delayed). */
4883 {
4887 {
4896 }
4899 }
4901 /* If we saved away a dummy type for this node it means that this
4902 made the type that corresponds to the full type of an incomplete
4903 type. Clear that type for now and then update the type in the
4904 pointers. */
4906 {
4909 {
4910 /* If this was a withed access type, this is not an error
4911 and merely indicates we've already elaborated the type
4912 already. */
4917 }
4920 }
4922 /* Now fully elaborate the type. */
4927 /* If we have an old type and we've made pointers to this type,
4928 update those pointers. */
4933 /* If this is a record type corresponding to a task or protected type
4934 that is a completion of an incomplete type, perform a similar update
4935 on the type. */
4936 /* ??? Including protected types here is a guess. */
4941 {
4942 tree gnu_task_old
4952 }
4953 }
4954 \f
4955 /* GNAT_ASSOC is the front of the Component_Associations of an N_Aggregate.
4956 GNU_TYPE is the GCC type of the corresponding record.
4958 Return a CONSTRUCTOR to build the record. */
4960 static tree
4962 {
4965 /* We test for GNU_FIELD being empty in the case where a variant
4966 was the last thing since we don't take things off GNAT_ASSOC in
4967 that case. We check GNAT_ASSOC in case we have a variant, but it
4968 has no fields. */
4972 {
4977 /* The expander is supposed to put a single component selector name
4978 in every record component association */
4982 /* Before assigning a value in an aggregate make sure range checks
4983 are done if required. Then convert to the type of the field. */
4989 /* Add the field and expression to the list. */
4991 }
4995 /* Verify every enty in GNU_LIST was used. */
5001 }
5003 /* Builds a possibly nested constructor for array aggregates. GNAT_EXPR
5004 is the first element of an array aggregate. It may itself be an
5005 aggregate (an array or record aggregate). GNU_ARRAY_TYPE is the gnu type
5006 corresponding to the array aggregate. GNAT_COMPONENT_TYPE is the type
5007 of the array component. It is needed for range checking. */
5009 static tree
5011 tree gnu_array_type,
5012 Entity_Id gnat_component_type)
5013 {
5014 tree gnu_expr;
5018 {
5019 /* If the expression is itself an array aggregate then first build the
5020 innermost constructor if it is part of our array (multi-dimensional
5021 case). */
5028 gnat_component_type);
5029 else
5030 {
5033 /* before assigning the element to the array make sure it is
5034 in range */
5037 }
5039 gnu_expr_list
5041 gnu_expr_list);
5042 }
5045 }
5046 \f
5047 /* Subroutine of assoc_to_constructor: VALUES is a list of field associations,
5048 some of which are from RECORD_TYPE. Return a CONSTRUCTOR consisting
5049 of the associations that are from RECORD_TYPE. If we see an internal
5050 record, make a recursive call to fill it in as well. */
5052 static tree
5054 {
5059 {
5062 /* _Parent is an internal field, but may have values in the aggregate,
5063 so check for values first. */
5065 {
5068 }
5071 {
5076 }
5077 else
5078 /* If we have a record subtype, the names will match, but not the
5079 actual FIELD_DECLs. */
5082 {
5085 }
5091 }
5094 }
5095 \f
5096 /* EXP is to be treated as an array or record. Handle the cases when it is
5097 an access object and perform the required dereferences. */
5099 static tree
5101 {
5102 /* If the type is a pointer, dereference it. */
5107 /* If we got a padded type, remove it too. */
5113 }
5114 \f
5115 /* Protect EXP from multiple evaluation. This may make a SAVE_EXPR. */
5117 tree
5119 {
5122 /* If this has no side effects, we don't need to do anything. */
5126 /* If it is a conversion, protect what's inside the conversion.
5127 Similarly, if we're indirectly referencing something, we only
5128 actually need to protect the address since the data itself can't
5129 change in these situations. */
5138 /* If EXP is a fat pointer or something that can be placed into a register,
5139 just make a SAVE_EXPR. */
5143 /* Otherwise, dereference, protect the address, and re-reference. */
5144 else
5145 return
5149 exp)));
5150 }
5151 \f
5152 /* This is equivalent to stabilize_reference in GCC's tree.c, but we know
5153 how to handle our new nodes and we take an extra argument that says
5154 whether to force evaluation of everything. */
5156 tree
5158 {
5164 {
5168 /* No action is needed in this case. */
5180 result
5189 force));
5195 force),
5203 force),
5205 force));
5212 force));
5219 force));
5225 force),
5227 force));
5236 /* If arg isn't a kind of lvalue we recognize, make no change.
5237 Caller should recognize the error for an invalid lvalue. */
5243 }
5247 }
5249 /* Similar to stabilize_reference_1 in tree.c, but supports an extra
5250 arg to force a SAVE_EXPR for everything. */
5252 static tree
5254 {
5259 /* We cannot ignore const expressions because it might be a reference
5260 to a const array but whose index contains side-effects. But we can
5261 ignore things that are actual constant or that already have been
5262 handled by this function. */
5268 {
5282 /* Constants need no processing. In fact, we should never reach
5283 here. */
5287 /* Recursively stabilize each operand. */
5294 /* Recursively stabilize each operand. */
5297 force));
5302 }
5306 }
5307 \f
5308 /* GNAT_UNIT is the Defining_Identifier for some package or subprogram,
5309 either a spec or a body, BODY_P says which. If needed, make a function
5310 to be the elaboration routine for that object and perform the elaborations
5311 in GNU_ELAB_LIST.
5313 Return 1 if we didn't need an elaboration function, zero otherwise. */
5315 static int
5317 {
5318 tree gnu_decl;
5319 rtx insn;
5322 /* If we have nothing to do, return. */
5326 /* Prevent the elaboration list from being reclaimed by the GC. */
5328 gnu_elab_list);
5330 /* Set our file and line number to that of the object and set up the
5331 elaboration routine. */
5333 body_p ?
5345 /* Emit the assignments for the elaborations we have to do. If there
5346 is no destination, this is just a call to execute some statement
5347 that was placed within the declarative region. But first save a
5348 pointer so we can see if any insns were generated. */
5354 {
5357 }
5358 else
5359 {
5364 /* If LHS has a padded type, convert it to the unpadded type
5365 so the assignment is done properly. */
5374 }
5376 /* See if any non-NOTE insns were generated. */
5379 {
5382 }
5389 /* We are finished with the elaboration list it can now be discarded. */
5392 /* If there were no insns, we don't need an elab routine. It would
5393 be nice to not output this one, but there's no good way to do that. */
5395 }
5396 \f
5399 /* Determine the input_filename and the input_line from the source location
5400 (Sloc) of GNAT_NODE node. Set the global variable input_filename and
5401 input_line. If WRITE_NOTE_P is true, emit a line number note. */
5403 void
5405 {
5409 }
5411 /* Likewise, but passed a Sloc. */
5413 void
5415 {
5416 /* If node not from source code, ignore. */
5420 /* Use the identifier table to make a hashed, permanent copy of the filename,
5421 since the name table gets reallocated after Gigi returns but before all
5422 the debugging information is output. The __gnat_to_canonical_file_spec
5423 call translates filenames from pragmas Source_Reference that contain host
5424 style syntax not understood by gdb. */
5425 input_filename
5426 = IDENTIFIER_POINTER
5427 (get_identifier
5428 (__gnat_to_canonical_file_spec
5429 (Get_Name_String
5432 /* ref_filename is the reference file name as given by sinput (i.e no
5433 directory) */
5434 ref_filename
5435 = IDENTIFIER_POINTER
5436 (get_identifier
5437 (Get_Name_String
5443 }
5444 \f
5445 /* Post an error message. MSG is the error message, properly annotated.
5446 NODE is the node at which to post the error and the node to use for the
5447 "&" substitution. */
5449 void
5451 {
5452 String_Template temp;
5453 Fat_Pointer fp;
5459 }
5461 /* Similar, but NODE is the node at which to post the error and ENT
5462 is the node to use for the "&" substitution. */
5464 void
5466 {
5467 String_Template temp;
5468 Fat_Pointer fp;
5474 }
5476 /* Similar, but NODE is the node at which to post the error, ENT is the node
5477 to use for the "&" substitution, and N is the number to use for the ^. */
5479 void
5481 {
5482 String_Template temp;
5483 Fat_Pointer fp;
5491 }
5492 \f
5493 /* Similar to post_error_ne_num, but T is a GCC tree representing the
5494 number to write. If the tree represents a constant that fits within
5495 a host integer, the text inside curly brackets in MSG will be output
5496 (presumably including a '^'). Otherwise that text will not be output
5497 and the text inside square brackets will be output instead. */
5499 void
5501 {
5504 Fat_Pointer fp;
5512 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_INT
5513 &&
5514 compare_tree_int
5516 #endif
5517 )
5518 {
5521 }
5522 else
5526 {
5532 ;
5533 else
5535 }
5542 }
5544 /* Similar to post_error_ne_tree, except that NUM is a second
5545 integer to write in the message. */
5547 void
5549 Node_Id node,
5550 Entity_Id ent,
5551 tree t,
5553 {
5556 }
5558 /* Set the node for a second '&' in the error message. */
5560 void
5562 {
5564 }
5565 \f
5566 /* Signal abort, with "Gigi abort" as the error label, and error_gnat_node
5567 as the relevant node that provides the location info for the error */
5569 void
5571 {
5573 Fat_Pointer fp;
5579 }
5580 \f
5581 /* Initialize the table that maps GNAT codes to GCC codes for simple
5582 binary and unary operations. */
5584 void
5586 {
5612 }