| blob | e0d7a5f55685a15101bae4586944a75a9be2e631 |
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * D E C L *
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 along with GCC; see the 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 ****************************************************************************/
55 /* "stdcall" and "thiscall" conventions should be processed in a specific way
56 on 32-bit x86/Windows only. The macros below are helpers to avoid having
57 to check for a Windows specific attribute throughout this unit. */
59 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
60 #ifdef TARGET_64BIT
61 #define Has_Stdcall_Convention(E) \
62 (!TARGET_64BIT && Convention (E) == Convention_Stdcall)
63 #define Has_Thiscall_Convention(E) \
64 (!TARGET_64BIT && is_cplusplus_method (E))
65 #else
66 #define Has_Stdcall_Convention(E) (Convention (E) == Convention_Stdcall)
67 #define Has_Thiscall_Convention(E) (is_cplusplus_method (E))
68 #endif
69 #else
70 #define Has_Stdcall_Convention(E) 0
71 #define Has_Thiscall_Convention(E) 0
72 #endif
76 /* Stack realignment is necessary for functions with foreign conventions when
77 the ABI doesn't mandate as much as what the compiler assumes - that is, up
78 to PREFERRED_STACK_BOUNDARY.
80 Such realignment can be requested with a dedicated function type attribute
81 on the targets that support it. We define FOREIGN_FORCE_REALIGN_STACK to
82 characterize the situations where the attribute should be set. We rely on
83 compiler configuration settings for 'main' to decide. */
85 #ifdef MAIN_STACK_BOUNDARY
86 #define FOREIGN_FORCE_REALIGN_STACK \
87 (MAIN_STACK_BOUNDARY < PREFERRED_STACK_BOUNDARY)
88 #else
89 #define FOREIGN_FORCE_REALIGN_STACK 0
90 #endif
92 struct incomplete
93 {
95 tree old_type;
96 Entity_Id full_type;
97 };
99 /* These variables are used to defer recursively expanding incomplete types
100 while we are processing a record, an array or a subprogram type. */
104 /* This variable is used to delay expanding types coming from a limited with
105 clause and completed Taft Amendment types until the end of the spec. */
109 tree discriminant;
110 tree replacement;
115 /* The type of the variant. */
116 tree type;
118 /* The associated field. */
119 tree field;
121 /* The value of the qualifier. */
122 tree qual;
124 /* The type of the variant after transformation. */
125 tree new_type;
129 /* A map used to cache the result of annotate_value. */
131 {
134 {
136 }
140 {
142 }
144 static int
146 {
148 }
149 };
153 /* A map used to associate a dummy type with a list of subprogram entities. */
155 {
158 };
160 void
162 {
163 }
165 void
167 {
169 }
172 {
175 {
177 }
181 {
183 }
185 static int
187 {
189 }
190 };
223 tree *);
247 /* The relevant constituents of a subprogram binding to a GCC builtin. Used
248 to pass around calls performing profile compatibility checks. */
257 \f
258 /* Given GNAT_ENTITY, a GNAT defining identifier node, which denotes some Ada
259 entity, return the equivalent GCC tree for that entity (a ..._DECL node)
260 and associate the ..._DECL node with the input GNAT defining identifier.
262 If GNAT_ENTITY is a variable or a constant declaration, GNU_EXPR gives its
263 initial value (in GCC tree form). This is optional for a variable. For
264 a renamed entity, GNU_EXPR gives the object being renamed.
266 DEFINITION is true if this call is intended for a definition. This is used
267 for separate compilation where it is necessary to know whether an external
268 declaration or a definition must be created if the GCC equivalent was not
269 created previously. */
271 tree
273 {
274 /* Contains the kind of the input GNAT node. */
276 /* True if this is a type. */
278 /* True if this is an artificial entity. */
280 /* True if debug info is requested for this entity. */
282 /* True if this entity is to be considered as imported. */
283 const bool imported_p
285 /* For a type, contains the equivalent GNAT node to be used in gigi. */
287 /* Temporary used to walk the GNAT tree. */
288 Entity_Id gnat_temp;
289 /* Contains the GCC DECL node which is equivalent to the input GNAT node.
290 This node will be associated with the GNAT node by calling at the end
291 of the `switch' statement. */
293 /* Contains the GCC type to be used for the GCC node. */
295 /* Contains the GCC size tree to be used for the GCC node. */
297 /* Contains the GCC name to be used for the GCC node. */
298 tree gnu_entity_name;
299 /* True if we have already saved gnu_decl as a GNAT association. */
301 /* True if we incremented defer_incomplete_level. */
303 /* True if we incremented force_global. */
305 /* True if we should check to see if elaborated during processing. */
307 /* True if we made GNU_DECL and its type here. */
309 /* Size and alignment of the GCC node, if meaningful. */
311 /* Contains the list of attributes directly attached to the entity. */
314 /* Since a use of an Itype is a definition, process it as such if it is in
315 the main unit, except for E_Access_Subtype because it's actually a use
316 of its base type, and for E_Record_Subtype with cloned subtype because
317 it's actually a use of the cloned subtype, see below. */
319 && is_type
326 {
327 /* Ensure that we are in a subprogram mentioned in the Scope chain of
328 this entity, our current scope is global, or we encountered a task
329 or entry (where we can't currently accurately check scoping). */
332 {
335 }
340 {
345 gnat_temp
357 && (current_function_decl
359 {
362 }
363 }
365 /* This abort means the Itype has an incorrect scope, i.e. that its
366 scope does not correspond to the subprogram it is declared in. */
368 }
370 /* If we've already processed this entity, return what we got last time.
371 If we are defining the node, we should not have already processed it.
372 In that case, we will abort below when we try to save a new GCC tree
373 for this object. We also need to handle the case of getting a dummy
374 type when a Full_View exists but be careful so as not to trigger its
375 premature elaboration. */
378 {
387 {
388 gnu_decl
392 }
395 }
397 /* If this is a numeric or enumeral type, or an access type, a nonzero Esize
398 must be specified unless it was specified by the programmer. Exceptions
399 are for access-to-protected-subprogram types and all access subtypes, as
400 another GNAT type is used to lay out the GCC type for them. */
412 /* The RM size must be specified for all discrete and fixed-point types. */
416 /* If we get here, it means we have not yet done anything with this entity.
417 If we are not defining it, it must be a type or an entity that is defined
418 elsewhere or externally, otherwise we should have defined it already. */
420 || type_annotate_only
421 || is_type
428 /* Get the name of the entity and set up the line number and filename of
429 the original definition for use in any decl we make. Make sure we do not
430 inherit another source location. */
436 /* For cases when we are not defining (i.e., we are referencing from
437 another compilation unit) public entities, show we are at global level
438 for the purpose of computing scopes. Don't do this for components or
439 discriminants since the relevant test is whether or not the record is
440 being defined. */
448 /* Handle any attributes directly attached to the entity. */
452 /* Do some common processing for types. */
454 {
455 /* Compute the equivalent type to be used in gigi. */
458 /* Machine_Attributes on types are expected to be propagated to
459 subtypes. The corresponding Gigi_Rep_Items are only attached
460 to the first subtype though, so we handle the propagation here. */
467 /* Compute a default value for the size of an elementary type. */
469 {
479 else
484 }
485 }
488 {
491 {
492 /* The GNAT record where the component was defined. */
495 /* If the entity is a discriminant of an extended tagged type used to
496 rename a discriminant of the parent type, return the latter. */
500 {
501 gnu_decl
506 }
508 /* If the entity is an inherited component (in the case of extended
509 tagged record types), just return the original entity, which must
510 be a FIELD_DECL. Likewise for discriminants. If the entity is a
511 non-girder discriminant (in the case of derived untagged record
512 types), return the stored discriminant it renames. */
515 {
516 gnu_decl
519 /* GNU_DECL contains a PLACEHOLDER_EXPR for discriminants. */
523 }
525 /* Otherwise, if we are not defining this and we have no GCC type
526 for the containing record, make one for it. Then we should
527 have made our own equivalent. */
529 {
530 /* ??? If this is in a record whose scope is a protected
531 type and we have an Original_Record_Component, use it.
532 This is a workaround for major problems in protected type
533 handling. */
537 {
538 gnu_decl
542 }
543 else
544 {
547 }
551 }
553 /* Here we have no GCC type and this is a reference rather than a
554 definition. This should never happen. Most likely the cause is
555 reference before declaration in the GNAT tree for gnat_entity. */
557 }
560 /* Ignore constant definitions already marked with the error node. See
561 the N_Object_Declaration case of gnat_to_gnu for the rationale. */
565 {
568 }
570 /* Ignore deferred constant definitions without address clause since
571 they are processed fully in the front-end. If No_Initialization
572 is set, this is not a deferred constant but a constant whose value
573 is built manually. And constants that are renamings are handled
574 like variables. */
576 && !gnu_expr
580 {
584 }
586 /* If this is a use of a deferred constant without address clause,
587 get its full definition. */
591 {
592 gnu_decl
596 }
598 /* If we have a constant that we are not defining, get the expression it
599 was defined to represent. This is necessary to avoid generating dumb
600 elaboration code in simple cases, but we may throw it away later if it
601 is not a constant. But do not retrieve it if it is an allocator since
602 the designated type might still be dummy at this point. */
608 /* The expression may contain N_Expression_With_Actions nodes and
609 thus object declarations from other units. Discard them. */
610 gnu_expr
613 /* ... fall through ... */
619 {
621 /* Always create a variable for volatile objects and variables seen
622 constant but with a Linker_Section pragma. */
623 bool const_flag
636 /* We implement RM 13.3(19) for exported and imported (non-constant)
637 objects by making them volatile. */
638 bool volatile_flag
645 tree gnu_object_size;
647 /* We need to translate the renamed object even though we are only
648 referencing the renaming. But it may contain a call for which
649 we'll generate a temporary to hold the return value and which
650 is part of the definition of the renaming, so discard it. */
652 {
656 else
658 }
660 /* Get the type after elaborating the renamed object. */
664 else
665 {
668 /* If this is a standard exception definition, use the standard
669 exception type. This is necessary to make sure that imported
670 and exported views of exceptions are merged in LTO mode. */
674 }
676 /* For a debug renaming declaration, build a debug-only entity. */
678 {
679 /* Force a non-null value to make sure the symbol is retained. */
683 integer_minus_one_node));
691 }
693 /* If this is a loop variable, its type should be the base type.
694 This is because the code for processing a loop determines whether
695 a normal loop end test can be done by comparing the bounds of the
696 loop against those of the base type, which is presumed to be the
697 size used for computation. But this is not correct when the size
698 of the subtype is smaller than the type. */
702 /* Reject non-renamed objects whose type is an unconstrained array or
703 any object whose type is a dummy type or void. */
708 {
711 force_global--;
713 }
715 /* If an alignment is specified, use it if valid. Note that exceptions
716 are objects but don't have an alignment. We must do this before we
717 validate the size, since the alignment can affect the size. */
719 {
725 /* No point in changing the type if there is an address clause
726 as the final type of the object will be a reference type. */
729 else
730 {
733 gnu_type
737 /* If a padding record was made, declare it now since it will
738 never be declared otherwise. This is necessary to ensure
739 that its subtrees are properly marked. */
743 }
744 }
746 /* If we are defining the object, see if it has a Size and validate it
747 if so. If we are not defining the object and a Size clause applies,
748 simply retrieve the value. We don't want to ignore the clause and
749 it is expected to have been validated already. Then get the new
750 type, if any. */
759 {
760 gnu_type
766 }
768 /* If this object has self-referential size, it must be a record with
769 a default discriminant. We are supposed to allocate an object of
770 the maximum size in this case, unless it is a constant with an
771 initializing expression, in which case we can get the size from
772 that. Note that the resulting size may still be a variable, so
773 this may end up with an indirect allocation. */
776 {
778 {
781 {
782 /* If the initializing expression is itself a constant,
783 despite having a nominal type with self-referential
784 size, we can get the size directly from it. */
786 && TYPE_IS_PADDING_P
790 || DECL_READONLY_ONCE_ELAB
793 else
794 gnu_size
796 }
797 else
799 }
800 /* We may have no GNU_EXPR because No_Initialization is
801 set even though there's an Expression. */
806 gnu_size
808 (Etype
810 else
811 {
814 }
816 /* If the size isn't constant and we are at global level, call
817 elaborate_expression_1 to make a variable for it rather than
818 calculating it each time. */
822 }
824 /* If the size is zero byte, make it one byte since some linkers have
825 troubles with zero-sized objects. If the object will have a
826 template, that will make it nonzero so don't bother. Also avoid
827 doing that for an object renaming or an object with an address
828 clause, as we would lose useful information on the view size
829 (e.g. for null array slices) and we are not allocating the object
830 here anyway. */
842 /* If this is an object with no specified size and alignment, and
843 if either it is atomic or we are not optimizing alignment for
844 space and it is composite and not an exception, an Out parameter
845 or a reference to another object, and the size of its type is a
846 constant, set the alignment to the smallest one which is not
847 smaller than the size, with an appropriate cap. */
856 && !imported_p
862 /* If the object is set to have atomic components, find the component
863 type and validate it.
865 ??? Note that we ignore Has_Volatile_Components on objects; it's
866 not at all clear what to do in that case. */
868 {
877 }
879 /* If this is an aliased object with an unconstrained array nominal
880 subtype, make a type that includes the template. We will either
881 allocate or create a variable of that type, see below. */
885 {
887 gnu_type
889 gnu_type,
892 debug_info_p);
893 }
895 /* ??? If this is an object of CW type initialized to a value, try to
896 ensure that the object is sufficient aligned for this value, but
897 without pessimizing the allocation. This is a kludge necessary
898 because we don't support dynamic alignment. */
905 #ifdef MINIMUM_ATOMIC_ALIGNMENT
906 /* If the size is a constant and no alignment is specified, force
907 the alignment to be the minimum valid atomic alignment. The
908 restriction on constant size avoids problems with variable-size
909 temporaries; if the size is variable, there's no issue with
910 atomic access. Also don't do this for a constant, since it isn't
911 necessary and can interfere with constant replacement. Finally,
912 do not do it for Out parameters since that creates an
913 size inconsistency with In parameters. */
923 #endif
925 /* Make a new type with the desired size and alignment, if needed.
926 But do not take into account alignment promotions to compute the
927 size of the object. */
930 {
936 /* If a padding record was made, declare it now since it will
937 never be declared otherwise. This is necessary to ensure
938 that its subtrees are properly marked. */
942 }
944 /* Now check if the type of the object allows atomic access. */
948 /* If this is a renaming, avoid as much as possible to create a new
949 object. However, in some cases, creating it is required because
950 renaming can be applied to objects that are not names in Ada.
951 This processing needs to be applied to the raw expression so as
952 to make it more likely to rename the underlying object. */
954 {
955 /* If the renamed object had padding, strip off the reference to
956 the inner object and reset our type. */
959 /* Strip useless conversions around the object. */
961 {
964 }
966 /* Or else, if the renamed object has an unconstrained type with
967 default discriminant, use the padded type. */
971 /* Case 1: if this is a constant renaming stemming from a function
972 call, treat it as a normal object whose initial value is what
973 is being renamed. RM 3.3 says that the result of evaluating a
974 function call is a constant object. Therefore, it can be the
975 inner object of a constant renaming and the renaming must be
976 fully instantiated, i.e. it cannot be a reference to (part of)
977 an existing object. And treat other rvalues (addresses, null
978 expressions, constructors and literals) the same way. */
982 /* Expand_Dispatching_Call can prepend a comparison of the tags
983 before the call to "=". */
994 /* We need to detect the case where a temporary is created to
995 hold the return value, since we cannot safely rename it at
996 top level as it lives only in the elaboration routine. */
999 /* We also need to detect the case where the front-end creates
1000 a dangling 'reference to a function call at top level and
1001 substitutes it in the renaming, for example:
1003 q__b : boolean renames r__f.e (1);
1005 can be rewritten into:
1007 q__R1s : constant q__A2s := r__f'reference;
1008 [...]
1009 q__b : boolean renames q__R1s.all.e (1);
1011 We cannot safely rename the rewritten expression since the
1012 underlying object lives only in the elaboration routine. */
1014 && (inner
1018 ;
1020 /* Case 2: if the renaming entity need not be materialized, use
1021 the elaborated renamed expression for the renaming. But this
1022 means that the caller is responsible for evaluating the address
1023 of the renaming in the correct place for the definition case to
1024 instantiate the SAVE_EXPRs. */
1026 {
1029 gnu_decl
1033 /* We cannot evaluate the first arm of a COMPOUND_EXPR in the
1034 correct place for this case. */
1037 /* No DECL_EXPR will be created so the expression needs to be
1038 marked manually because it will likely be shared. */
1042 /* This assertion will fail if the renamed object isn't aligned
1043 enough as to make it possible to honor the alignment set on
1044 the renaming. */
1046 {
1051 }
1053 /* The expression might not be a DECL so save it manually. */
1058 }
1060 /* Case 3: otherwise, make a constant pointer to the object we
1061 are renaming and attach the object to the pointer after it is
1062 elaborated. The object will be referenced directly instead
1063 of indirectly via the pointer to avoid aliasing problems with
1064 non-addressable entities. The pointer is called a "renaming"
1065 pointer in this case. Note that we also need to preserve the
1066 volatility of the renamed object through the indirection. */
1067 else
1068 {
1072 gnu_type
1081 renamed_obj
1085 /* The expression needs to be marked manually because it will
1086 likely be shared, even for a definition since the ADDR_EXPR
1087 built below can cause the first few nodes to be folded. */
1094 else
1095 {
1096 gnu_expr
1099 gnu_expr
1101 gnu_expr);
1102 }
1103 }
1104 }
1106 /* If we are defining an aliased object whose nominal subtype is
1107 unconstrained, the object is a record that contains both the
1108 template and the object. If there is an initializer, it will
1109 have already been converted to the right type, but we need to
1110 create the template if there is no initializer. */
1112 && !gnu_expr
1115 /* Beware that padding might have been introduced above. */
1118 == RECORD_TYPE
1119 && TYPE_CONTAINS_TEMPLATE_P
1121 {
1122 tree template_field
1130 NULL_TREE);
1133 }
1135 /* Convert the expression to the type of the object if need be. */
1139 /* If this is a pointer that doesn't have an initializing expression,
1140 initialize it to NULL, unless the object is declared imported as
1141 per RM B.1(24). */
1144 && !gnu_expr
1148 /* If we are defining the object and it has an Address clause, we must
1149 either get the address expression from the saved GCC tree for the
1150 object if it has a Freeze node, or elaborate the address expression
1151 here since the front-end has guaranteed that the elaboration has no
1152 effects in this case. */
1154 {
1157 tree gnu_address
1163 /* Convert the type of the object to a reference type that can
1164 alias everything as per RM 13.3(19). */
1167 gnu_type
1171 const_flag
1177 /* If this is an aliased object with an unconstrained array nominal
1178 subtype, then it can overlay only another aliased object with an
1179 unconstrained array nominal subtype and compatible template. */
1183 {
1187 /* This is the pattern built for a regular object. */
1191 /* This is the pattern built for an overaligned object. */
1194 == PLUS_EXPR
1197 gnu_address
1201 else
1202 {
1205 gnat_entity);
1208 }
1209 }
1211 /* If we don't have an initializing expression for the underlying
1212 variable, the initializing expression for the pointer is the
1213 specified address. Otherwise, we have to make a COMPOUND_EXPR
1214 to assign both the address and the initial value. */
1217 else
1218 gnu_expr
1222 NULL_TREE,
1223 gnu_address),
1224 gnu_expr),
1225 gnu_address);
1226 }
1228 /* If it has an address clause and we are not defining it, mark it
1229 as an indirect object. Likewise for Stdcall objects that are
1230 imported. */
1233 {
1234 /* Convert the type of the object to a reference type that can
1235 alias everything as per RM 13.3(19). */
1238 gnu_type
1245 /* No point in taking the address of an initializing expression
1246 that isn't going to be used. */
1249 /* If it has an address clause whose value is known at compile
1250 time, make the object a CONST_DECL. This will avoid a
1251 useless dereference. */
1253 {
1254 Node_Id gnat_address
1258 {
1261 }
1262 }
1263 }
1265 /* If we are at top level and this object is of variable size,
1266 make the actual type a hidden pointer to the real type and
1267 make the initializer be a memory allocation and initialization.
1268 Likewise for objects we aren't defining (presumed to be
1269 external references from other packages), but there we do
1270 not set up an initialization.
1272 If the object's size overflows, make an allocator too, so that
1273 Storage_Error gets raised. Note that we will never free
1274 such memory, so we presume it never will get allocated. */
1277 || !definition
1279 || (gnu_size
1281 size_binop
1283 bitsize_unit_node)),
1285 || !definition
1287 {
1296 /* In case this was a aliased object whose nominal subtype is
1297 unconstrained, the pointer above will be a thin pointer and
1298 build_allocator will automatically make the template.
1300 If we have a template initializer only (that we made above),
1301 pretend there is none and rely on what build_allocator creates
1302 again anyway. Otherwise (if we have a full initializer), get
1303 the data part and feed that to build_allocator.
1305 If we are elaborating a mutable object, tell build_allocator to
1306 ignore a possibly simpler size from the initializer, if any, as
1307 we must allocate the maximum possible size in this case. */
1309 {
1314 {
1315 gnu_alloc_type
1321 else
1322 gnu_expr
1323 = build_component_ref
1327 }
1332 gnat_entity);
1334 gnu_expr
1337 }
1338 else
1340 }
1342 /* If this object would go into the stack and has an alignment larger
1343 than the largest stack alignment the back-end can honor, resort to
1344 a variable of "aligning type". */
1347 && !imported_p
1348 && !static_flag
1350 {
1351 /* Create the new variable. No need for extra room before the
1352 aligned field as this is in automatic storage. */
1353 tree gnu_new_type
1357 tree gnu_new_var
1362 gnat_entity);
1364 /* Initialize the aligned field if we have an initializer. */
1366 add_stmt_with_node
1368 build_component_ref
1371 gnu_expr),
1372 gnat_entity);
1374 /* And setup this entity as a reference to the aligned field. */
1376 gnu_expr
1377 = build_unary_op
1387 }
1389 /* If this is an aggregate constant initialized to a constant, force it
1390 to be statically allocated. This saves an initialization copy. */
1392 && const_flag
1393 && gnu_expr
1402 /* If this is an aliased object with an unconstrained array nominal
1403 subtype, we make its type a thin reference, i.e. the reference
1404 counterpart of a thin pointer, so it points to the array part.
1405 This is aimed to make it easier for the debugger to decode the
1406 object. Note that we have to do it this late because of the
1407 couple of allocation adjustments that might be made above. */
1411 {
1412 /* In case the object with the template has already been allocated
1413 just above, we have nothing to do here. */
1415 {
1416 /* This variable is a GNAT encoding used by Workbench: let it
1417 go through the debugging information but mark it as
1418 artificial: users are not interested in it. */
1419 tree gnu_unc_var
1435 }
1438 gnu_type
1440 }
1442 /* Convert the expression to the type of the object if need be. */
1446 /* If this name is external or a name was specified, use it, but don't
1447 use the Interface_Name with an address clause (see cd30005). */
1453 /* Deal with a pragma Linker_Section on a constant or variable. */
1459 /* Now create the variable or the constant and set various flags. */
1460 gnu_decl
1471 /* If we are defining an Out parameter and optimization isn't enabled,
1472 create a fake PARM_DECL for debugging purposes and make it point to
1473 the VAR_DECL. Suppress debug info for the latter but make sure it
1474 will live in memory so that it can be accessed from within the
1475 debugger through the PARM_DECL. */
1477 && definition
1478 && debug_info_p
1479 && !optimize
1481 {
1488 }
1490 /* If this is a loop parameter, set the corresponding flag. */
1494 /* If this is a renaming pointer, attach the renamed object to it. */
1498 /* If this is a constant and we are defining it or it generates a real
1499 symbol at the object level and we are referencing it, we may want
1500 or need to have a true variable to represent it:
1501 - if optimization isn't enabled, for debugging purposes,
1502 - if the constant is public and not overlaid on something else,
1503 - if its address is taken,
1504 - if either itself or its type is aliased. */
1513 {
1514 tree gnu_corr_var
1522 }
1524 /* If this is a constant, even if we don't need a true variable, we
1525 may need to avoid returning the initializer in every case. That
1526 can happen for the address of a (constant) constructor because,
1527 upon dereferencing it, the constructor will be reinjected in the
1528 tree, which may not be valid in every case; see lvalue_required_p
1529 for more details. */
1533 /* If this object is declared in a block that contains a block with an
1534 exception handler, and we aren't using the GCC exception mechanism,
1535 we must force this variable in memory in order to avoid an invalid
1536 optimization. */
1541 /* If this is a local variable with non-BLKmode and aggregate type,
1542 and optimization isn't enabled, then force it in memory so that
1543 a register won't be allocated to it with possible subparts left
1544 uninitialized and reaching the register allocator. */
1554 /* If we are defining an object with variable size or an object with
1555 fixed size that will be dynamically allocated, and we are using the
1556 front-end setjmp/longjmp exception mechanism, update the setjmp
1557 buffer. */
1570 gnat_entity);
1572 /* Back-annotate Esize and Alignment of the object if not already
1573 known. Note that we pick the values of the type, not those of
1574 the object, to shield ourselves from low-level platform-dependent
1575 adjustments like alignment promotion. This is both consistent with
1576 all the treatment above, where alignment and size are set on the
1577 type of the object and not on the object directly, and makes it
1578 possible to support all confirming representation clauses. */
1580 used_by_ref);
1581 }
1585 /* Return a TYPE_DECL for "void" that we previously made. */
1590 /* A special case: for the types Character and Wide_Character in
1591 Standard, we do not list all the literals. So if the literals
1592 are not specified, make this an integer type. */
1594 {
1597 else
1601 /* Set TYPE_STRING_FLAG for Character and Wide_Character types.
1602 This is needed by the DWARF-2 back-end to distinguish between
1603 unsigned integer types and character types. */
1606 /* This flag is needed by the call just below. */
1610 }
1611 else
1612 {
1613 /* We have a list of enumeral constants in First_Literal. We make a
1614 CONST_DECL for each one and build into GNU_LITERAL_LIST the list
1615 to be placed into TYPE_FIELDS. Each node is itself a TREE_LIST
1616 whose TREE_VALUE is the literal name and whose TREE_PURPOSE is the
1617 value of the literal. But when we have a regular boolean type, we
1618 simplify this a little by using a BOOLEAN_TYPE. */
1623 Entity_Id gnat_literal;
1636 {
1637 tree gnu_value
1639 /* Do not generate debug info for individual enumerators. */
1640 tree gnu_literal
1646 gnu_list
1648 }
1653 /* Note that the bounds are updated at the end of this function
1654 to avoid an infinite recursion since they refer to the type. */
1656 }
1660 /* For integer types, just make a signed type the appropriate number
1661 of bits. */
1667 {
1668 /* Small_Value is the scale factor. */
1674 /* Try to decode the scale factor and to save it for the fixed-point
1675 types debug hook. */
1677 /* There are various ways to describe the scale factor, however there
1678 are cases where back-end internals cannot hold it. In such cases,
1679 we output invalid scale factor for such cases (i.e. the 0/0
1680 rational constant) but we expect GNAT to output GNAT encodings,
1681 then. Thus, keep this in sync with
1682 Exp_Dbug.Is_Handled_Scale_Factor. */
1684 /* When encoded as 1/2**N or 1/10**N, describe the scale factor as a
1685 binary or decimal scale: it is easier to read for humans. */
1689 {
1690 /* Given RM restrictions on 'Small values, we assume here that
1691 the denominator fits in an int. */
1694 const tree exponent
1697 scale_factor
1699 integer_one_node,
1702 }
1704 /* Default to arbitrary scale factors descriptions. */
1705 else
1706 {
1711 {
1712 const tree gnu_num
1715 const tree gnu_den
1720 }
1721 else
1722 /* If compiler internals cannot represent arbitrary scale
1723 factors, output an invalid scale factor so that debugger
1724 don't try to handle them but so that we still have a type
1725 in the output. Note that GNAT */
1727 }
1731 }
1735 {
1736 /* For modular types, make the unsigned type of the proper number
1737 of bits and then set up the modulus, if required. */
1740 /* Packed Array Impl. Types are supposed to be subtypes only. */
1745 /* Get the modulus in this type. If it overflows, assume it is because
1746 it is equal to 2**Esize. Note that there is no overflow checking
1747 done on unsigned type, so we detect the overflow by looking for
1748 a modulus of zero, which is otherwise invalid. */
1752 {
1757 }
1759 /* If the upper bound is not maximal, make an extra subtype. */
1762 {
1769 }
1770 }
1779 /* For integral subtypes, we make a new INTEGER_TYPE. Note that we do
1780 not want to call create_range_type since we would like each subtype
1781 node to be distinct. ??? Historically this was in preparation for
1782 when memory aliasing is implemented, but that's obsolete now given
1783 the call to relate_alias_sets below.
1785 The TREE_TYPE field of the INTEGER_TYPE points to the base type;
1786 this fact is used by the arithmetic conversion functions.
1788 We elaborate the Ancestor_Subtype if it is not in the current unit
1789 and one of our bounds is non-static. We do this to ensure consistent
1790 naming in the case where several subtypes share the same bounds, by
1791 elaborating the first such subtype first, thus using its name. */
1800 /* Set the precision to the Esize except for bit-packed arrays. */
1805 /* First subtypes of Character are treated as Character; otherwise
1806 this should be an unsigned type if the base type is unsigned or
1807 if the lower bound is constant and non-negative or if the type
1808 is biased. However, even if the lower bound is constant and
1809 non-negative, we use a signed type for a subtype with the same
1810 size as its signed base type, because this eliminates useless
1811 conversions to it and gives more leeway to the optimizer; but
1812 this means that we will need to explicitly test for this case
1813 when we change the representation based on the RM size. */
1825 else
1829 SET_TYPE_RM_MIN_VALUE
1832 debug_info_p));
1834 SET_TYPE_RM_MAX_VALUE
1837 debug_info_p));
1842 /* Do the same processing for Character subtypes as for types. */
1844 {
1849 }
1851 /* Inherit our alias set from what we're a subtype of. Subtypes
1852 are not different types and a pointer can designate any instance
1853 within a subtype hierarchy. */
1856 /* One of the above calls might have caused us to be elaborated,
1857 so don't blow up if so. */
1859 {
1862 }
1864 /* Attach the TYPE_STUB_DECL in case we have a parallel type. */
1868 /* For a packed array, make the original array type a parallel/debug
1869 type. */
1873 discrete_type:
1875 /* We have to handle clauses that under-align the type specially. */
1878 && Present
1881 {
1885 }
1887 /* If the type we are dealing with represents a bit-packed array,
1888 we need to have the bits left justified on big-endian targets
1889 and right justified on little-endian targets. We also need to
1890 ensure that when the value is read (e.g. for comparison of two
1891 such values), we only get the good bits, since the unused bits
1892 are uninitialized. Both goals are accomplished by wrapping up
1893 the modular type in an enclosing record type. */
1896 {
1899 /* Set the RM size before wrapping up the original type. */
1904 /* Strip the ___XP suffix for standard DWARF. */
1908 /* Create a stripped-down declaration, mainly for debugging. */
1910 gnat_entity);
1912 /* Now save it and build the enclosing record type. */
1922 /* Propagate the alignment of the modular type to the record type,
1923 unless there is an alignment clause that under-aligns the type.
1924 This means that bit-packed arrays are given "ceil" alignment for
1925 their size by default, which may seem counter-intuitive but makes
1926 it possible to overlay them on modular types easily. */
1930 /* Propagate the reverse storage order flag to the record type so
1931 that the required byte swapping is performed when retrieving the
1932 enclosed modular value. */
1938 /* Don't declare the field as addressable since we won't be taking
1939 its address and this would prevent create_field_decl from making
1940 a bitfield. */
1941 gnu_field
1945 /* We will output additional debug info manually below. */
1951 {
1952 /* Make the original array type a parallel/debug type. */
1955 /* Since GNU_TYPE is a padding type around the packed array
1956 implementation type, the padded type is its debug type. */
1959 }
1960 }
1962 /* If the type we are dealing with has got a smaller alignment than the
1963 natural one, we need to wrap it up in a record type and misalign the
1964 latter; we reuse the padding machinery for this purpose. */
1966 {
1969 /* Set the RM size before wrapping the type. */
1972 gnu_type
1978 }
1983 /* The type of the Low and High bounds can be our type if this is
1984 a type from Standard, so set them at the end of the function. */
1991 /* See the E_Signed_Integer_Subtype case for the rationale. */
2008 SET_TYPE_RM_MIN_VALUE
2011 debug_info_p));
2013 SET_TYPE_RM_MAX_VALUE
2016 debug_info_p));
2018 /* Inherit our alias set from what we're a subtype of, as for
2019 integer subtypes. */
2022 /* One of the above calls might have caused us to be elaborated,
2023 so don't blow up if so. */
2027 /* Array Types and Subtypes
2029 Unconstrained array types are represented by E_Array_Type and
2030 constrained array types are represented by E_Array_Subtype. There
2031 are no actual objects of an unconstrained array type; all we have
2032 are pointers to that type.
2034 The following fields are defined on array types and subtypes:
2036 Component_Type Component type of the array.
2037 Number_Dimensions Number of dimensions (an int).
2038 First_Index Type of first index. */
2041 {
2042 const bool convention_fortran_p
2045 tree gnu_template_type;
2046 tree gnu_ptr_template;
2053 tree comp_type;
2055 /* Create the type for the component now, as it simplifies breaking
2056 type reference loops. */
2057 comp_type
2060 {
2061 /* As a side effect, the type may have been translated. */
2064 }
2066 /* We complete an existing dummy fat pointer type in place. This both
2067 avoids further complex adjustments in update_pointer_to and yields
2068 better debugging information in DWARF by leveraging the support for
2069 incomplete declarations of "tagged" types in the DWARF back-end. */
2072 {
2075 /* Save the contents of the dummy type for update_pointer_to. */
2077 gnu_ptr_template =
2080 }
2081 else
2082 {
2086 }
2088 /* Make a node for the array. If we are not defining the array
2089 suppress expanding incomplete types. */
2093 {
2094 defer_incomplete_level++;
2096 }
2098 /* Build the fat pointer type. Use a "void *" object instead of
2099 a pointer to the array type since we don't have the array type
2100 yet (it will reference the fat pointer via the bounds). */
2101 tem
2109 {
2110 /* We are going to lay it out again so reset the alias set. */
2116 {
2119 }
2120 }
2121 else
2122 {
2125 }
2127 /* Build a reference to the template from a PLACEHOLDER_EXPR that
2128 is the fat pointer. This will be used to access the individual
2129 fields once we build them. */
2133 gnu_template_reference
2138 /* Now create the GCC type for each index and add the fields for that
2139 index to the template. */
2145 {
2148 tree gnu_index_base_type
2153 /* Make the FIELD_DECLs for the low and high bounds of this
2154 type and then make extractions of these fields from the
2155 template. */
2158 gnu_index_base_type,
2166 gnu_index_base_type,
2174 /* We can't use build_component_ref here since the template type
2175 isn't complete yet. */
2178 NULL_TREE);
2181 NULL_TREE);
2187 /* Compute the size of this dimension. See the E_Array_Subtype
2188 case below for the rationale. */
2189 gnu_high
2193 gnu_max,
2196 /* Make a range type with the new range in the Ada base type.
2197 Then make an index type with the size range in sizetype. */
2201 gnu_orig_min,
2202 gnu_orig_max),
2203 gnat_entity);
2205 /* Update the maximum size of the array in elements. */
2207 {
2208 tree gnu_min
2210 tree gnu_max
2212 tree gnu_this_max
2219 else
2220 gnu_max_size
2222 }
2226 }
2228 /* Install all the fields into the template. */
2233 gnu_template_fields
2236 debug_info_p);
2239 /* If Component_Size is not already specified, annotate it with the
2240 size of the component. */
2245 /* Compute the maximum size of the array in units and bits. */
2247 {
2253 }
2254 else
2257 /* Now build the array type. */
2260 {
2268 }
2270 /* If an alignment is specified, use it if valid. But ignore it
2271 for the original type of packed array types. If the alignment
2272 was requested with an explicit alignment clause, state so. */
2275 {
2278 gnat_entity,
2282 }
2284 /* Tag top-level ARRAY_TYPE nodes for packed arrays and their
2285 implementation types as such so that the debug information back-end
2286 can output the appropriate description for them. */
2294 /* Adjust the type of the pointer-to-array field of the fat pointer
2295 and record the aliasing relationships if necessary. */
2300 /* The result type is an UNCONSTRAINED_ARRAY_TYPE that indicates the
2301 corresponding fat pointer. */
2308 /* If the maximum size doesn't overflow, use it. */
2314 {
2319 }
2324 /* If told to generate GNAT encodings for them (GDB rely on them at the
2325 moment): give the fat pointer type a name. If this is a packed
2326 array, tell the debugger how to interpret the underlying bits. */
2329 else
2331 tree xup_name
2336 gnat_entity);
2338 /* Create the type to be designated by thin pointers: a record type for
2339 the array and its template. We used to shift the fields to have the
2340 template at a negative offset, but this was somewhat of a kludge; we
2341 now shift thin pointer values explicitly but only those which have a
2342 TYPE_UNCONSTRAINED_ARRAY attached to the designated RECORD_TYPE.
2343 Note that GDB can handle standard DWARF information for them, so we
2344 don't have to name them as a GNAT encoding, except if specifically
2345 asked to. */
2346 tree xut_name
2351 debug_info_p);
2355 }
2360 /* This is the actual data type for array variables. Multidimensional
2361 arrays are implemented as arrays of arrays. Note that arrays which
2362 have sparse enumeration subtypes as index components create sparse
2363 arrays, which is obviously space inefficient but so much easier to
2364 code for now.
2366 Also note that the subtype never refers to the unconstrained array
2367 type, which is somewhat at variance with Ada semantics.
2369 First check to see if this is simply a renaming of the array type.
2370 If so, the result is the array type. */
2374 ;
2375 else
2376 {
2378 const bool convention_fortran_p
2387 /* First create the GCC type for each index and find out whether
2388 special types are needed for debugging information. */
2391 gnat_base_index
2397 {
2399 tree gnu_index_base_type
2401 tree gnu_orig_min
2404 tree gnu_orig_max
2409 tree gnu_base_index_type
2411 tree gnu_base_index_base_type
2413 tree gnu_base_orig_min
2416 tree gnu_base_orig_max
2419 tree gnu_high;
2421 /* See if the base array type is already flat. If it is, we
2422 are probably compiling an ACATS test but it will cause the
2423 code below to malfunction if we don't handle it specially. */
2427 {
2431 }
2433 /* Similarly, if one of the values overflows in sizetype and the
2434 range is null, use 1..0 for the sizetype bounds. */
2439 {
2443 }
2445 /* If the minimum and maximum values both overflow in sizetype,
2446 but the difference in the original type does not overflow in
2447 sizetype, ignore the overflow indication. */
2451 && !TREE_OVERFLOW
2454 gnu_orig_max,
2455 gnu_orig_min))))
2456 {
2460 }
2462 /* Compute the size of this dimension in the general case. We
2463 need to provide GCC with an upper bound to use but have to
2464 deal with the "superflat" case. There are three ways to do
2465 this. If we can prove that the array can never be superflat,
2466 we can just use the high bound of the index type. */
2469 /* Bit-Packed Array Impl. Types are never superflat. */
2471 && Is_Bit_Packed_Array
2475 /* Otherwise, if the high bound is constant but the low bound is
2476 not, we use the expression (hb >= lb) ? lb : hb + 1 for the
2477 lower bound. Note that the comparison must be done in the
2478 original type to avoid any overflow during the conversion. */
2481 {
2483 gnu_min
2486 boolean_type_node,
2487 gnu_orig_max,
2488 gnu_orig_min),
2489 gnu_min,
2491 size_one_node));
2492 }
2494 /* Finally we use (hb >= lb) ? hb : lb - 1 for the upper bound
2495 in all the other cases. Note that, here as well as above,
2496 the condition used in the comparison must be equivalent to
2497 the condition (length != 0). This is relied upon in order
2498 to optimize array comparisons in compare_arrays. Moreover
2499 we use int_const_binop for the shift by 1 if the bound is
2500 constant to avoid any unwanted overflow. */
2501 else
2502 gnu_high
2505 boolean_type_node,
2506 gnu_orig_max,
2507 gnu_orig_min),
2508 gnu_max,
2511 size_one_node)
2513 size_one_node));
2515 /* Reuse the index type for the range type. Then make an index
2516 type with the size range in sizetype. */
2519 gnat_entity);
2521 /* Update the maximum size of the array in elements. Here we
2522 see if any constraint on the index type of the base type
2523 can be used in the case of self-referential bound on the
2524 index type of the subtype. We look for a non-"infinite"
2525 and non-self-referential bound from any type involved and
2526 handle each bound separately. */
2528 {
2531 tree gnu_base_base_min
2534 tree gnu_base_base_max
2555 else
2556 {
2557 tree gnu_this_max;
2559 /* Use int_const_binop if the bounds are constant to
2560 avoid any unwanted overflow. */
2563 gnu_this_max
2566 gnu_base_max,
2567 gnu_base_min));
2568 else
2569 gnu_this_max
2572 gnu_base_max,
2573 gnu_base_min));
2575 gnu_max_size
2577 }
2578 }
2580 /* We need special types for debugging information to point to
2581 the index types if they have variable bounds, are not integer
2582 types, are biased or are wider than sizetype. These are GNAT
2583 encodings, so we have to include them only when all encodings
2584 are requested. */
2594 }
2596 /* Then flatten: create the array of arrays. For an array type
2597 used to implement a packed array, get the component type from
2598 the original array type since the representation clauses that
2599 can affect it are on the latter. */
2602 {
2607 /* One of the above calls might have caused us to be elaborated,
2608 so don't blow up if so. */
2610 {
2613 }
2614 }
2615 else
2616 {
2618 debug_info_p);
2620 /* One of the above calls might have caused us to be elaborated,
2621 so don't blow up if so. */
2623 {
2626 }
2627 }
2629 /* Compute the maximum size of the array in units and bits. */
2631 {
2637 }
2638 else
2641 /* Now build the array type. */
2643 {
2652 }
2654 /* Strip the ___XP suffix for standard DWARF. */
2657 {
2658 Entity_Id gnat_original_array_type
2661 gnu_entity_name
2663 }
2665 /* Attach the TYPE_STUB_DECL in case we have a parallel type. */
2669 /* If this is a multi-dimensional array and we are at global level,
2670 we need to make a variable corresponding to the stride of the
2671 inner dimensions. */
2673 {
2674 tree gnu_arr_type;
2679 {
2689 /* ??? For now, store the size as a multiple of the
2690 alignment of the element type in bytes so that we
2691 can see the alignment from the tree. */
2699 /* ??? create_type_decl is not invoked on the inner types so
2700 the MULT_EXPR node built above will never be marked. */
2702 }
2703 }
2705 /* If we need to write out a record type giving the names of the
2706 bounds for debugging purposes, do it now and make the record
2707 type a parallel type. This is not needed for a packed array
2708 since the bounds are conveyed by the original array type. */
2710 && debug_info_p
2712 {
2715 tree gnu_field;
2721 {
2725 /* Make sure to reference the types themselves, and not just
2726 their names, as the debugger may fall back on them. */
2732 }
2736 }
2738 /* If this is a packed array type, make the original array type a
2739 parallel/debug type. Otherwise, if such GNAT encodings are
2740 required, do it for the base array type if it isn't artificial to
2741 make sure it is kept in the debug info. */
2743 {
2746 gnat_entity);
2747 else
2748 {
2749 tree gnu_base_decl
2756 }
2757 }
2763 /* Tag top-level ARRAY_TYPE nodes for packed arrays and their
2764 implementation types as such so that the debug information back-end
2765 can output the appropriate description for them. */
2770 /* If the size is self-referential and the maximum size doesn't
2771 overflow, use it. */
2773 && gnu_max_size
2778 {
2784 }
2786 /* Set our alias set to that of our base type. This gives all
2787 array subtypes the same alias set. */
2790 /* If this is a packed type, make this type the same as the packed
2791 array type, but do some adjusting in the type first. */
2793 {
2794 Entity_Id gnat_index;
2795 tree gnu_inner;
2797 /* First finish the type we had been making so that we output
2798 debugging information for it. */
2801 {
2802 const int quals
2803 = TYPE_QUAL_VOLATILE
2806 }
2807 /* Make it artificial only if the base type was artificial too.
2808 That's sort of "morally" true and will make it possible for
2809 the debugger to look it up by name in DWARF, which is needed
2810 in order to decode the packed array type. */
2811 gnu_decl
2815 gnat_entity);
2817 /* Save it as our equivalent in case the call below elaborates
2818 this type again. */
2821 gnu_decl
2836 /* We need to attach the index type to the type we just made so
2837 that the actual bounds can later be put into a template. */
2842 {
2844 {
2845 /* The TYPE_ACTUAL_BOUNDS field is overloaded with the
2846 TYPE_MODULUS for modular types so we make an extra
2847 subtype if necessary. */
2849 {
2850 tree gnu_subtype
2859 }
2863 /* Check for other cases of overloading. */
2865 }
2870 SET_TYPE_ACTUAL_BOUNDS
2877 SET_TYPE_ACTUAL_BOUNDS
2883 }
2884 }
2885 }
2889 /* Create the type for a string literal. */
2890 {
2891 Entity_Id gnat_full_type
2896 tree gnu_string_array_type
2898 tree gnu_string_index_type
2901 tree gnu_lower_bound
2904 tree gnu_length
2906 gnu_string_index_type);
2907 tree gnu_upper_bound
2909 gnu_lower_bound,
2912 integer_one_node)));
2913 tree gnu_index_type
2917 gnu_lower_bound,
2918 gnu_upper_bound),
2919 gnat_entity);
2921 gnu_type
2924 gnu_index_type);
2928 }
2931 /* Record Types and Subtypes
2933 The following fields are defined on record types:
2935 Has_Discriminants True if the record has discriminants
2936 First_Discriminant Points to head of list of discriminants
2937 First_Entity Points to head of list of fields
2938 Is_Tagged_Type True if the record is tagged
2940 Implementation of Ada records and discriminated records:
2942 A record type definition is transformed into the equivalent of a C
2943 struct definition. The fields that are the discriminants which are
2944 found in the Full_Type_Declaration node and the elements of the
2945 Component_List found in the Record_Type_Definition node. The
2946 Component_List can be a recursive structure since each Variant of
2947 the Variant_Part of the Component_List has a Component_List.
2949 Processing of a record type definition comprises starting the list of
2950 field declarations here from the discriminants and the calling the
2951 function components_to_record to add the rest of the fields from the
2952 component list and return the gnu type node. The function
2953 components_to_record will call itself recursively as it traverses
2954 the tree. */
2958 {
2959 gnu_type
2960 = build_complex_type
2961 (get_unpadded_type
2964 (Component_List
2965 (Type_Definition
2969 }
2971 {
2974 Node_Id gnat_constr;
2977 tree gnu_get_parent;
2978 /* Set PACKED in keeping with gnat_to_gnu_field. */
2979 const int packed
2988 const bool is_extension
2994 /* See if all fields have a rep clause. Stop when we find one
2995 that doesn't. */
3003 {
3006 }
3008 /* If this is a record extension, go a level further to find the
3009 record definition. Also, verify we have a Parent_Subtype. */
3011 {
3018 }
3020 /* Make a node for the record. If we are not defining the record,
3021 suppress expanding incomplete types. */
3030 {
3031 defer_incomplete_level++;
3033 }
3035 /* If both a size and rep clause were specified, put the size on
3036 the record type now so that it can get the proper layout. */
3041 /* Always set the alignment on the record type here so that it can
3042 get the proper layout. */
3047 else
3048 {
3051 /* If a type needs strict alignment, the minimum size will be the
3052 type size instead of the RM size (see validate_size). Cap the
3053 alignment lest it causes this type size to become too large. */
3055 {
3060 }
3061 }
3063 /* If we have a Parent_Subtype, make a field for the parent. If
3064 this record has rep clauses, force the position to zero. */
3066 {
3069 tree gnu_parent;
3072 /* A major complexity here is that the parent subtype will
3073 reference our discriminants in its Stored_Constraint list.
3074 But those must reference the parent component of this record
3075 which is precisely of the parent subtype we have not built yet!
3076 To break the circle we first build a dummy COMPONENT_REF which
3077 represents the "get to the parent" operation and initialize
3078 each of those discriminants to a COMPONENT_REF of the above
3079 dummy parent referencing the corresponding discriminant of the
3080 base type of the parent subtype. */
3085 gnu_dummy_parent_type),
3086 NULL_TREE);
3093 {
3094 tree gnu_field
3097 save_gnu_tree
3102 }
3104 /* Then we build the parent subtype. If it has discriminants but
3105 the type itself has unknown discriminants, this means that it
3106 doesn't contain information about how the discriminants are
3107 derived from those of the ancestor type, so it cannot be used
3108 directly. Instead it is built by cloning the parent subtype
3109 of the underlying record view of the type, for which the above
3110 derivation of discriminants has been made explicit. */
3113 {
3116 /* If we are defining the type, the underlying record
3117 view must already have been elaborated at this point.
3118 Otherwise do it now as its parent subtype cannot be
3119 technically elaborated on its own. */
3122 else
3127 /* Substitute the "get to the parent" of the type for that
3128 of its underlying record view in the cloned type. */
3133 {
3135 tree gnu_ref
3138 gnu_parent
3140 }
3141 }
3142 else
3145 /* The parent field needs strict alignment so, if it is to
3146 be created with a component clause below, then we need
3147 to apply the same adjustment as in gnat_to_gnu_field. */
3149 {
3150 /* ??? For historical reasons, we do it on strict-alignment
3151 platforms only, where it is really required. This means
3152 that a confirming representation clause will change the
3153 behavior of the compiler on the other platforms. */
3156 else
3157 parent_packed
3159 }
3161 /* Finally we fix up both kinds of twisted COMPONENT_REF we have
3162 initially built. The discriminants must reference the fields
3163 of the parent subtype and not those of its base type for the
3164 placeholder machinery to properly work. */
3166 {
3167 /* The actual parent subtype is the full view. */
3169 {
3172 else
3174 }
3180 {
3181 Entity_Id field;
3190 }
3191 }
3193 /* The "get to the parent" COMPONENT_REF must be given its
3194 proper type... */
3197 /* ...and reference the _Parent field of this record. */
3198 gnu_field
3201 has_rep
3203 has_rep
3209 }
3211 /* Make the fields for the discriminants and put them into the record
3212 unless it's an Unchecked_Union. */
3217 {
3218 /* If this is a record extension and this discriminant is the
3219 renaming of another discriminant, we've handled it above. */
3224 gnu_field
3226 debug_info_p);
3228 /* Make an expression using a PLACEHOLDER_EXPR from the
3229 FIELD_DECL node just created and link that with the
3230 corresponding GNAT defining identifier. */
3238 {
3241 }
3242 }
3244 /* If we have a derived untagged type that renames discriminants in
3245 the parent type, the (stored) discriminants are just a copy of the
3246 discriminants of the parent type. This means that any constraints
3247 added by the renaming in the derivation are disregarded as far as
3248 the layout of the derived type is concerned. To rescue them, we
3249 change the type of the (stored) discriminants to a subtype with
3250 the bounds of the type of the visible discriminants. */
3252 && !is_extension
3258 /* Ignore access discriminants. */
3261 {
3264 tree gnu_ref
3268 /* GNU_REF must be an expression using a PLACEHOLDER_EXPR built
3269 just above for one of the stored discriminants. */
3273 {
3275 tree gnu_subtype
3286 }
3287 }
3289 /* If this is a derived type with discriminants and these discriminants
3290 affect the initial shape it has inherited, factor them in. */
3292 && !is_extension
3300 {
3301 tree gnu_parent_type
3310 /* Set the layout of the type to match that of the parent type,
3311 doing required substitutions. If we are in minimal GNAT
3312 encodings mode, we don't need debug info for the inner record
3313 types, as they will be part of the embedding variant record's
3314 debug info. */
3315 copy_and_substitute_in_layout
3317 gnu_subst_list,
3319 }
3320 else
3321 {
3322 /* Add the fields into the record type and finish it up. */
3329 NULL);
3331 /* If there are entities in the chain corresponding to components
3332 that we did not elaborate, ensure we elaborate their types if
3333 they are Itypes. */
3342 }
3344 /* Fill in locations of fields. */
3347 /* If this is a record type associated with an exception definition,
3348 equate its fields to those of the standard exception type. This
3349 will make it possible to convert between them. */
3351 {
3352 tree gnu_std_field;
3355 gnu_field;
3360 }
3361 }
3365 /* If an equivalent type is present, that is what we should use.
3366 Otherwise, fall through to handle this like a record subtype
3367 since it may have constraints. */
3369 {
3373 }
3375 /* ... fall through ... */
3378 /* If Cloned_Subtype is Present it means this record subtype has
3379 identical layout to that type or subtype and we should use
3380 that GCC type for this one. The front end guarantees that
3381 the component list is shared. */
3383 {
3388 }
3390 /* Otherwise, first ensure the base type is elaborated. Then, if we are
3391 changing the type, make a new type with each field having the type of
3392 the field in the new subtype but the position computed by transforming
3393 every discriminant reference according to the constraints. We don't
3394 see any difference between private and non-private type here since
3395 derivations from types should have been deferred until the completion
3396 of the private type. */
3397 else
3398 {
3402 {
3403 defer_incomplete_level++;
3405 }
3407 tree gnu_base_type
3411 {
3414 }
3416 /* If this is a record subtype associated with a dispatch table,
3417 strip the suffix. This is necessary to make sure 2 different
3418 subtypes associated with the imported and exported views of a
3419 dispatch table are properly merged in LTO mode. */
3421 {
3428 }
3430 /* When the subtype has discriminants and these discriminants affect
3431 the initial shape it has inherited, factor them in. But for an
3432 Unchecked_Union (it must be an Itype), just return the type. */
3438 {
3441 tree gnu_unpad_base_type;
3446 {
3447 /* Use the ultimate base record type as the debug type.
3448 Subtypes and derived types bring no useful
3449 information. */
3453 tree gnu_debug_type
3456 }
3462 /* Set the size, alignment and alias set of the type to match
3463 those of the base type, doing required substitutions. */
3465 gnu_subst_list);
3469 else
3472 /* Set the layout of the type to match that of the base type,
3473 doing required substitutions. We will output debug info
3474 manually below so pass false as last argument. */
3479 /* Fill in locations of fields. */
3482 /* If debugging information is being written for the type and if
3483 we are asked to output such encodings, write a record that
3484 shows what we are a subtype of and also make a variable that
3485 indicates our size, if still variable. */
3487 {
3489 tree gnu_unpad_base_name
3497 build_reference_type
3499 gnu_subtype_marker,
3516 }
3517 }
3519 /* Otherwise, go down all the components in the new type and make
3520 them equivalent to those in the base type. */
3521 else
3522 {
3532 gnat_to_gnu_field_decl
3535 }
3536 }
3541 /* Use the special descriptor type for dispatch tables if needed,
3542 that is to say for the Prim_Ptr of a-tags.ads and its clones.
3543 Note that we are only required to do so for static tables in
3544 order to be compatible with the C++ ABI, but Ada 2005 allows
3545 to extend library level tagged types at the local level so
3546 we do it in the non-static case as well. */
3549 {
3553 }
3555 /* ... fall through ... */
3562 {
3563 /* The designated type and its equivalent type for gigi. */
3566 /* Whether it comes from a limited with. */
3567 const bool is_from_limited_with
3570 /* Whether it is a completed Taft Amendment type. Such a type is to
3571 be treated as coming from a limited with clause if it is not in
3572 the main unit, i.e. we break potential circularities here in case
3573 the body of an external unit is loaded for inter-unit inlining. */
3574 const bool is_completed_taft_type
3578 /* The "full view" of the designated type. If this is an incomplete
3579 entity from a limited with, treat its non-limited view as the full
3580 view. Otherwise, if this is an incomplete or private type, use the
3581 full view. In the former case, we might point to a private type,
3582 in which case, we need its full view. Also, we want to look at the
3583 actual type used for the representation, so this takes a total of
3584 three steps. */
3585 Entity_Id gnat_desig_full_direct_first
3586 = (is_from_limited_with
3590 Entity_Id gnat_desig_full_direct
3591 = ((is_from_limited_with
3596 Entity_Id gnat_desig_full
3598 /* The type actually used to represent the designated type, either
3599 gnat_desig_full or gnat_desig_equiv. */
3600 Entity_Id gnat_desig_rep;
3601 /* We want to know if we'll be seeing the freeze node for any
3602 incomplete type we may be pointing to. */
3603 const bool in_main_unit
3607 /* True if we make a dummy type here. */
3609 /* The mode to be used for the pointer type. */
3610 scalar_int_mode p_mode;
3611 /* The GCC type used for the designated type. */
3618 /* If either the designated type or its full view is an unconstrained
3619 array subtype, replace it with the type it's a subtype of. This
3620 avoids problems with multiple copies of unconstrained array types.
3621 Likewise, if the designated type is a subtype of an incomplete
3622 record type, use the parent type to avoid order of elaboration
3623 issues. This can lose some code efficiency, but there is no
3624 alternative. */
3635 /* Set the type that's the representation of the designated type. */
3636 gnat_desig_rep
3639 /* If we already know what the full type is, use it. */
3643 /* Get the type of the thing we are to point to and build a pointer to
3644 it. If it is a reference to an incomplete or private type with a
3645 full view that is a record, an array or an access, make a dummy type
3646 and get the actual type later when we have verified it is safe. */
3653 /* Likewise if this is a reference to a record, an array or a
3654 subprogram type and we are to defer elaborating incomplete
3655 types. We do this because this access type may be the full
3656 view of a private type. */
3663 /* If this is a reference from a limited_with type back to our
3664 main unit and there's a freeze node for it, either we have
3665 already processed the declaration and made the dummy type,
3666 in which case we just reuse the latter, or we have not yet,
3667 in which case we make the dummy type and it will be reused
3668 when the declaration is finally processed. In both cases,
3669 the pointer eventually created below will be automatically
3670 adjusted when the freeze node is processed. */
3671 || (in_main_unit
3672 && is_from_limited_with
3674 {
3677 }
3679 /* Otherwise handle the case of a pointer to itself. */
3681 {
3682 gnu_type
3686 }
3688 /* If expansion is disabled, the equivalent type of a concurrent type
3689 is absent, so we use the void pointer type. */
3693 /* If the ultimately designated type is an incomplete type with no full
3694 view, we use the void pointer type in LTO mode to avoid emitting a
3695 dummy type in the GIMPLE IR. We cannot do that in regular mode as
3696 the name of the dummy type in used by GDB for a global lookup. */
3702 /* Finally, handle the default case where we can just elaborate our
3703 designated type. */
3704 else
3707 /* It is possible that a call to gnat_to_gnu_type above resolved our
3708 type. If so, just return it. */
3710 {
3713 }
3715 /* Access-to-unconstrained-array types need a special treatment. */
3717 {
3718 /* If the processing above got something that has a pointer, then
3719 we are done. This could have happened either because the type
3720 was elaborated or because somebody else executed the code. */
3725 }
3727 /* If we haven't done it yet, build the pointer type the usual way. */
3729 {
3730 /* Modify the designated type if we are pointing only to constant
3731 objects, but don't do it for a dummy type. */
3734 gnu_desig_type
3737 gnu_type
3740 }
3742 /* If the designated type is not declared in the main unit and we made
3743 a dummy node for it, save our definition, elaborate the actual type
3744 and replace the dummy type we made with the actual one. But if we
3745 are to defer actually looking up the actual type, make an entry in
3746 the deferred list instead. If this is from a limited with, we may
3747 have to defer until the end of the current unit. */
3749 {
3751 gnu_type
3757 gnat_entity);
3764 && !is_from_limited_with
3766 {
3769 }
3770 else
3771 {
3781 }
3782 }
3783 }
3788 /* If we are just annotating types and have no equivalent record type,
3789 just use the void pointer type. */
3793 /* The run-time representation is the equivalent type. */
3794 else
3795 {
3798 }
3800 /* The designated subtype must be elaborated as well, if it does
3801 not have its own freeze node. */
3812 /* We treat this as identical to its base type; any constraint is
3813 meaningful only to the front-end. */
3817 /* The designated subtype must be elaborated as well, if it does
3818 not have its own freeze node. But designated subtypes created
3819 for constrained components of records with discriminants are
3820 not frozen by the front-end and not elaborated here, because
3821 their use may appear before the base type is frozen and it is
3822 not clear that they are needed in gigi. With the current model,
3823 there is no correct place where they could be elaborated. */
3828 {
3829 /* If we are to defer elaborating incomplete types, make a dummy
3830 type node and elaborate it later. */
3832 {
3835 p->old_type
3840 }
3845 }
3848 /* Subprogram Entities
3850 The following access functions are defined for subprograms:
3852 Etype Return type or Standard_Void_Type.
3853 First_Formal The first formal parameter.
3854 Is_Imported Indicates that the subprogram has appeared in
3855 an INTERFACE or IMPORT pragma. For now we
3856 assume that the external language is C.
3857 Is_Exported Likewise but for an EXPORT pragma.
3858 Is_Inlined True if the subprogram is to be inlined.
3860 Each parameter is first checked by calling must_pass_by_ref on its
3861 type to determine if it is passed by reference. For parameters which
3862 are copied in, if they are Ada In Out or Out parameters, their return
3863 value becomes part of a record which becomes the return type of the
3864 function (C function - note that this applies only to Ada procedures
3865 so there is no Ada return type). Additional code to store back the
3866 parameters will be generated on the caller side. This transformation
3867 is done here, not in the front-end.
3869 The intended result of the transformation can be seen from the
3870 equivalent source rewritings that follow:
3872 struct temp {int a,b};
3873 procedure P (A,B: In Out ...) is temp P (int A,B)
3874 begin {
3875 .. ..
3876 end P; return {A,B};
3877 }
3879 temp t;
3880 P(X,Y); t = P(X,Y);
3881 X = t.a , Y = t.b;
3883 For subprogram types we need to perform mainly the same conversions to
3884 GCC form that are needed for procedures and function declarations. The
3885 only difference is that at the end, we make a type declaration instead
3886 of a function declaration. */
3891 {
3892 tree gnu_ext_name
3894 enum inline_status_t inline_status
3896 ? is_suppressed
3898 ? is_required
3901 /* Subprograms marked both Intrinsic and Always_Inline need not
3902 have a body of their own. */
3903 bool extern_flag
3905 || imported_p
3908 tree gnu_param_list;
3910 /* A parameter may refer to this type, so defer completion of any
3911 incomplete types. */
3913 {
3914 defer_incomplete_level++;
3916 }
3918 /* If the subprogram has an alias, it is probably inherited, so
3919 we can use the original one. If the original "subprogram"
3920 is actually an enumeration literal, it may be the first use
3921 of its type, so we must elaborate that type now. */
3923 {
3930 gnu_decl
3933 /* Elaborate any Itypes in the parameters of this entity. */
3940 /* Materialize renamed subprograms in the debugging information
3941 when the renamed object is compile time known. We can consider
3942 such renamings as imported declarations.
3944 Because the parameters in generics instantiation are generally
3945 materialized as renamings, we ofter end up having both the
3946 renamed subprogram and the renaming in the same context and with
3947 the same name: in this case, renaming is both useless debug-wise
3948 and potentially harmful as name resolution in the debugger could
3949 return twice the same entity! So avoid this case. */
3958 && gnu_decl
3960 {
3965 }
3968 }
3970 /* Get the GCC tree for the (underlying) subprogram type. If the
3971 entity is an actual subprogram, also get the parameter list. */
3972 gnu_type
3976 {
3980 }
3982 /* Deal with platform-specific calling conventions. */
3984 prepend_one_attribute
3987 gnat_entity);
3989 prepend_one_attribute
3992 gnat_entity);
3994 /* If we should request stack realignment for a foreign convention
3995 subprogram, do so. Note that this applies to task entry points
3996 in particular. */
3999 prepend_one_attribute
4002 gnat_entity);
4004 /* Deal with a pragma Linker_Section on a subprogram. */
4010 /* If we are defining the subprogram and it has an Address clause
4011 we must get the address expression from the saved GCC tree for the
4012 subprogram if it has a Freeze_Node. Otherwise, we elaborate
4013 the address expression here since the front-end has guaranteed
4014 in that case that the elaboration has no effects. If there is
4015 an Address clause and we are not defining the object, just
4016 make it a constant. */
4018 {
4022 gnu_address
4029 /* Convert the type of the object to a reference type that can
4030 alias everything as per RM 13.3(19). */
4031 gnu_type
4036 gnu_decl
4042 }
4044 /* If this is a mere subprogram type, just create the declaration. */
4046 {
4049 gnu_decl
4052 }
4054 /* Otherwise create the subprogram declaration with the external name,
4055 the type and the parameter list. However, if this a reference to
4056 the allocation routines, reuse the canonical declaration nodes as
4057 they come with special properties. */
4058 else
4059 {
4064 else
4065 {
4066 gnu_decl
4071 debug_info_p,
4073 gnat_entity);
4077 }
4078 }
4079 }
4090 {
4091 const bool is_from_limited_with
4093 /* Get the "full view" of this entity. If this is an incomplete
4094 entity from a limited with, treat its non-limited view as the
4095 full view. Otherwise, use either the full view or the underlying
4096 full view, whichever is present. This is used in all the tests
4097 below. */
4098 const Entity_Id full_view
4099 = is_from_limited_with
4107 /* If this is an incomplete type with no full view, it must be a Taft
4108 Amendment type or an incomplete type coming from a limited context,
4109 in which cases we return a dummy type. Otherwise, we just get the
4110 type from its Etype. */
4112 {
4114 {
4117 }
4118 else
4119 {
4120 gnu_decl
4123 }
4124 }
4126 /* Or else, if we already made a type for the full view, reuse it. */
4130 /* Or else, if we are not defining the type or there is no freeze
4131 node on it, get the type for the full view. Likewise if this is
4132 a limited_with'ed type not declared in the main unit, which can
4133 happen for incomplete formal types instantiated on a type coming
4134 from a limited_with clause. */
4137 || (is_from_limited_with
4139 {
4142 }
4144 /* Otherwise, make a dummy type entry which will be replaced later.
4145 Save it as the full declaration's type so we can do any needed
4146 updates when we see it. */
4147 else
4148 {
4154 }
4155 }
4159 /* Class-wide types are always transformed into their root type. */
4168 /* If we are just annotating types and have no equivalent record type,
4169 just return void_type, except for root types that have discriminants
4170 because the discriminants will very likely be used in the declarative
4171 part of the associated body so they need to be translated. */
4173 {
4176 {
4178 Entity_Id gnat_field;
4180 /* This is a minimal version of the E_Record_Type handling. */
4187 {
4188 tree gnu_field
4200 }
4204 }
4205 else
4207 }
4209 /* Concurrent types are always transformed into their record type. */
4210 else
4221 /* Nothing at all to do here, so just return an ERROR_MARK and claim
4222 we've already saved it, so we don't try to. */
4228 /* This is a SPARK annotation that only reaches here when compiling in
4229 ASIS mode. */
4237 }
4239 /* If we had a case where we evaluated another type and it might have
4240 defined this one, handle it here. */
4242 {
4245 }
4247 /* If we are processing a type and there is either no decl for it or
4248 we just made one, do some common processing for the type, such as
4249 handling alignment and possible padding. */
4251 {
4254 /* Process the attributes, if not already done. Note that the type is
4255 already defined so we cannot pass true for IN_PLACE here. */
4258 /* ??? Don't set the size for a String_Literal since it is either
4259 confirming or we don't handle it properly (if the low bound is
4260 non-constant). */
4262 {
4265 gnu_size
4268 }
4270 /* If a size was specified, see if we can make a new type of that size
4271 by rearranging the type, for example from a fat to a thin pointer. */
4273 {
4274 gnu_type
4281 }
4283 /* If the alignment has not already been processed and this is not
4284 an unconstrained array type, see if an alignment is specified.
4285 If not, we pick a default alignment for atomic objects. */
4287 ;
4289 {
4293 /* Warn on suspiciously large alignments. This should catch
4294 errors about the (alignment,byte)/(size,bit) discrepancy. */
4296 {
4297 tree size;
4299 /* If a size was specified, take it into account. Otherwise
4300 use the RM size for records or unions as the type size has
4301 already been adjusted to the alignment. */
4307 else
4310 /* Consider an alignment as suspicious if the alignment/size
4311 ratio is greater or equal to the byte/bit ratio. */
4316 gnat_entity);
4317 }
4318 }
4329 /* See if we need to pad the type. If we did, and made a record,
4330 the name of the new type may be changed. So get it back for
4331 us when we make the new TYPE_DECL below. */
4339 /* Now set the RM size of the type. We cannot do it before padding
4340 because we need to accept arbitrary RM sizes on integral types. */
4343 /* If we are at global level, GCC will have applied variable_size to
4344 the type, but that won't have done anything. So, if it's not
4345 a constant or self-referential, call elaborate_expression_1 to
4346 make a variable for the size rather than calculating it each time.
4347 Handle both the RM size and the actual size. */
4352 {
4359 /* ??? For now, store the size as a multiple of the alignment in
4360 bytes so that we can see the alignment from the tree. */
4366 /* ??? gnu_type may come from an existing type so the MULT_EXPR node
4367 may not be marked by the call to create_type_decl below. */
4371 {
4376 {
4380 /* If the position of the variant part is constant, subtract
4381 it from the size of the type of the parent to get the new
4382 size. This manual CSE reduces the data size. */
4384 {
4392 }
4393 else
4394 {
4400 /* ??? For now, store the size as a multiple of the
4401 alignment in bytes so that we can see the alignment
4402 from the tree. */
4409 /* ??? For now, store the offset as a multiple of the
4410 alignment in bytes so that we can see the alignment
4411 from the tree. */
4415 DECL_OFFSET_ALIGN
4417 }
4421 }
4425 else
4426 ada_size
4430 }
4431 }
4433 /* Similarly, if this is a record type or subtype at global level, call
4434 elaborate_expression_2 on any field position. Skip any fields that
4435 we haven't made trees for to avoid problems with class-wide types. */
4440 {
4443 /* ??? For now, store the offset as a multiple of the alignment
4444 in bytes so that we can see the alignment from the tree. */
4447 {
4454 /* ??? The context of gnu_field is not necessarily gnu_type
4455 so the MULT_EXPR node built above may not be marked by
4456 the call to create_type_decl below. */
4458 }
4459 }
4464 /* If this is not an unconstrained array type, set some flags. */
4466 {
4467 /* Tell the middle-end that objects of tagged types are guaranteed to
4468 be properly aligned. This is necessary because conversions to the
4469 class-wide type are translated into conversions to the root type,
4470 which can be less aligned than some of its derived types. */
4475 /* Record whether the type is passed by reference. */
4479 /* Record whether an alignment clause was specified. */
4483 /* Record whether a pragma Universal_Aliasing was specified. */
4487 /* If it is passed by reference, force BLKmode to ensure that
4488 objects of this type will always be put in memory. */
4491 }
4493 /* If this is a derived type, relate its alias set to that of its parent
4494 to avoid troubles when a call to an inherited primitive is inlined in
4495 a context where a derived object is accessed. The inlined code works
4496 on the parent view so the resulting code may access the same object
4497 using both the parent and the derived alias sets, which thus have to
4498 conflict. As the same issue arises with component references, the
4499 parent alias set also has to conflict with composite types enclosing
4500 derived components. For instance, if we have:
4502 type D is new T;
4503 type R is record
4504 Component : D;
4505 end record;
4507 we want T to conflict with both D and R, in addition to R being a
4508 superset of D by record/component construction.
4510 One way to achieve this is to perform an alias set copy from the
4511 parent to the derived type. This is not quite appropriate, though,
4512 as we don't want separate derived types to conflict with each other:
4514 type I1 is new Integer;
4515 type I2 is new Integer;
4517 We want I1 and I2 to both conflict with Integer but we do not want
4518 I1 to conflict with I2, and an alias set copy on derivation would
4519 have that effect.
4521 The option chosen is to make the alias set of the derived type a
4522 superset of that of its parent type. It trivially fulfills the
4523 simple requirement for the Integer derivation example above, and
4524 the component case as well by superset transitivity:
4526 superset superset
4527 R ----------> D ----------> T
4529 However, for composite types, conversions between derived types are
4530 translated into VIEW_CONVERT_EXPRs so a sequence like:
4532 type Comp1 is new Comp;
4533 type Comp2 is new Comp;
4534 procedure Proc (C : Comp1);
4536 C : Comp2;
4537 Proc (Comp1 (C));
4539 is translated into:
4541 C : Comp2;
4542 Proc ((Comp1 &) &VIEW_CONVERT_EXPR <Comp1> (C));
4544 and gimplified into:
4546 C : Comp2;
4547 Comp1 *C.0;
4548 C.0 = (Comp1 *) &C;
4549 Proc (C.0);
4551 i.e. generates code involving type punning. Therefore, Comp1 needs
4552 to conflict with Comp2 and an alias set copy is required.
4554 The language rules ensure the parent type is already frozen here. */
4558 {
4560 /* For constrained packed array subtypes, the implementation type is
4561 used instead of the nominal type. */
4569 }
4572 {
4573 const int quals
4574 = TYPE_QUAL_VOLATILE
4577 }
4582 gnat_entity);
4583 else
4584 {
4587 }
4588 }
4590 /* If we got a type that is not dummy, back-annotate the alignment of the
4591 type if not already in the tree. Likewise for the size, if any. */
4593 {
4597 {
4601 /* If the default alignment of "double" or larger scalar types is
4602 specifically capped and this is not an array with an alignment
4603 clause on the component type, return the cap. */
4605 is_capped_double
4608 is_capped_double
4610 else
4615 else
4619 }
4622 {
4625 /* If the size is self-referential, annotate the maximum value. */
4629 /* If we are just annotating types and the type is tagged, the tag
4630 and the parent components are not generated by the front-end so
4631 alignment and sizes must be adjusted if there is no rep clause. */
4638 {
4639 tree offset;
4642 {
4646 }
4647 else
4648 {
4649 unsigned int align
4653 }
4656 offset
4664 }
4666 /* If there is a rep clause, only adjust alignment and Esize. */
4668 {
4669 unsigned int align
4674 }
4676 /* Otherwise no adjustment is needed. */
4677 else
4679 }
4683 }
4685 /* If we haven't already, associate the ..._DECL node that we just made with
4686 the input GNAT entity node. */
4690 /* Now we are sure gnat_entity has a corresponding ..._DECL node,
4691 eliminate as many deferred computations as possible. */
4694 /* If this is an enumeration or floating-point type, we were not able to set
4695 the bounds since they refer to the type. These are always static. */
4698 {
4702 /* If this is a padded type, we need to use the underlying type. */
4706 /* If this is a floating point type and we haven't set a floating
4707 point type yet, use this in the evaluation of the bounds. */
4715 {
4716 /* Enumeration types have specific RM bounds. */
4719 }
4720 else
4721 {
4722 /* Floating-point types don't have specific RM bounds. */
4725 }
4726 }
4728 /* If we deferred processing of incomplete types, re-enable it. If there
4729 were no other disables and we have deferred types to process, do so. */
4733 {
4736 /* We are back to level 0 for the deferring of incomplete types.
4737 But processing these incomplete types below may itself require
4738 deferring, so preserve what we have and restart from scratch. */
4743 {
4750 }
4751 }
4753 /* If we are not defining this type, see if it's on one of the lists of
4754 incomplete types. If so, handle the list entry now. */
4756 {
4761 {
4765 }
4771 {
4777 }
4778 }
4781 force_global--;
4783 /* If this is a packed array type whose original array type is itself
4784 an Itype without freeze node, make sure the latter is processed. */
4792 }
4794 /* Similar, but if the returned value is a COMPONENT_REF, return the
4795 FIELD_DECL. */
4797 tree
4799 {
4806 }
4808 /* Similar, but GNAT_ENTITY is assumed to refer to a GNAT type. Return
4809 the GCC type corresponding to that entity. */
4811 tree
4813 {
4814 tree gnu_decl;
4816 /* The back end never attempts to annotate generic types. */
4824 }
4826 /* Similar, but GNAT_ENTITY is assumed to refer to a GNAT type. Return
4827 the unpadded version of the GCC type corresponding to that entity. */
4829 tree
4831 {
4838 }
4840 /* Return whether the E_Subprogram_Type/E_Function/E_Procedure GNAT_ENTITY is
4841 a C++ imported method or equivalent.
4843 We use the predicate on 32-bit x86/Windows to find out whether we need to
4844 use the "thiscall" calling convention for GNAT_ENTITY. This convention is
4845 used for C++ methods (functions with METHOD_TYPE) by the back-end. */
4847 bool
4849 {
4850 /* A constructor is a method on the C++ side. We deal with it now because
4851 it is declared without the 'this' parameter in the sources and, although
4852 the front-end will create a version with the 'this' parameter for code
4853 generation purposes, we want to return true for both versions. */
4857 /* Check that the subprogram has C++ convention. */
4861 /* And that the type of the first parameter (indirectly) has it too. */
4872 /* This is the main case: a C++ virtual method imported as a primitive
4873 operation of a tagged type. */
4877 /* This is set on the E_Subprogram_Type built for a dispatching call. */
4881 /* A thunk needs to be handled like its associated primitive operation. */
4885 /* Now on to the annoying case: a C++ non-virtual method, imported either
4886 as a non-primitive operation of a tagged type or as a primitive operation
4887 of an untagged type. We cannot reliably differentiate these cases from
4888 their static member or regular function equivalents in Ada, so we ask
4889 the C++ side through the mangled name of the function, as the implicit
4890 'this' parameter is not encoded in the mangled name of a method. */
4892 {
4899 DMGL_GNU_V3
4900 | DMGL_TYPES
4901 | DMGL_PARAMS
4907 /* We need to release MEM once we have a successful demangling. */
4914 {
4915 /* Make sure there is at least one parameter in C++ too. */
4917 {
4920 n_ada_args++;
4926 n_cpp_args++;
4932 }
4933 else
4935 }
4940 }
4943 }
4945 /* Finalize the processing of From_Limited_With incomplete types. */
4947 void
4949 {
4956 {
4960 {
4965 }
4968 }
4969 }
4971 /* Return the equivalent type to be used for GNAT_ENTITY, if it's a kind
4972 of type (such E_Task_Type) that has a different type which Gigi uses
4973 for its representation. If the type does not have a special type for
4974 its representation, return GNAT_ENTITY. */
4976 Entity_Id
4978 {
4985 {
5011 }
5014 }
5016 /* Return a GCC tree for a type corresponding to the component type of the
5017 array type or subtype GNAT_ARRAY. DEFINITION is true if this component
5018 is for an array being defined. DEBUG_INFO_P is true if we need to write
5019 debug information for other types that we may create in the process. */
5021 static tree
5024 {
5027 tree gnu_comp_size;
5030 /* If an alignment is specified, use it as a cap on the component type
5031 so that it can be honored for the whole type. But ignore it for the
5032 original type of packed array types. */
5036 else
5039 /* Try to get a smaller form of the component if needed. */
5052 /* Get and validate any specified Component_Size. */
5053 gnu_comp_size
5058 /* If the array has aliased components and the component size can be zero,
5059 force at least unit size to ensure that the components have distinct
5060 addresses. */
5066 gnu_comp_size
5069 /* If the component type is a RECORD_TYPE that has a self-referential size,
5070 then use the maximum size for the component size. */
5076 /* Honor the component size. This is not needed for bit-packed arrays. */
5078 {
5084 else
5090 /* If a padding record was made, declare it now since it will never be
5091 declared otherwise. This is necessary to ensure that its subtrees
5092 are properly marked. */
5095 gnat_array);
5096 }
5098 /* If the component type is a padded type made for a non-bit-packed array
5099 of scalars with reverse storage order, we need to propagate the reverse
5100 storage order to the padding type since it is the innermost enclosing
5101 aggregate type around the scalar. */
5109 {
5110 const int quals
5111 = TYPE_QUAL_VOLATILE
5114 }
5117 }
5119 /* Return a GCC tree for a parameter corresponding to GNAT_PARAM, to be placed
5120 in the parameter list of GNAT_SUBPROG. GNU_PARAM_TYPE is the GCC tree for
5121 the type of the parameter. FIRST is true if this is the first parameter in
5122 the list of GNAT_SUBPROG. Also set CICO to true if the parameter must use
5123 the copy-in copy-out implementation mechanism.
5125 The returned tree is a PARM_DECL, except for the cases where no parameter
5126 needs to be actually passed to the subprogram; the type of this "shadow"
5127 parameter is then returned instead. */
5129 static tree
5132 {
5138 /* The parameter can be indirectly modified if its address is taken. */
5144 tree gnu_param;
5146 /* Make sure to use the proper SLOC for vector ABI warnings. */
5150 /* Builtins are expanded inline and there is no real call sequence involved.
5151 So the type expected by the underlying expander is always the type of the
5152 argument "as is". */
5157 /* Handle the first parameter of a valued procedure specially: it's a copy
5158 mechanism for which the parameter is never allocated. */
5160 {
5164 }
5166 /* Or else, see if a Mechanism was supplied that forced this parameter
5167 to be passed one way or another. */
5169 ;
5171 /* Positive mechanism means by copy for sufficiently small parameters. */
5173 {
5178 else
5180 }
5182 /* Otherwise, it's an unsupported mechanism so error out. */
5183 else
5184 {
5187 }
5189 /* If this is either a foreign function or if the underlying type won't
5190 be passed by reference and is as aligned as the original type, strip
5191 off possible padding type. */
5193 {
5202 }
5204 /* If this is a read-only parameter, make a variant of the type that is
5205 read-only. ??? However, if this is a self-referential type, the type
5206 can be very complex, so skip it for now. */
5210 /* For foreign conventions, pass arrays as pointers to the element type.
5211 First check for unconstrained array and get the underlying array. */
5213 gnu_param_type
5216 /* Arrays are passed as pointers to element type for foreign conventions. */
5218 {
5219 /* Strip off any multi-dimensional entries, then strip
5220 off the last array to get the component type. */
5229 gnu_param_type
5233 }
5235 /* Fat pointers are passed as thin pointers for foreign conventions. */
5237 gnu_param_type
5240 /* If we were requested or muss pass by reference, do so.
5241 If we were requested to pass by copy, do so.
5242 Otherwise, for foreign conventions, pass In Out or Out parameters
5243 or aggregates by reference. For COBOL and Fortran, pass all
5244 integer and FP types that way too. For Convention Ada, use
5245 the standard Ada default. */
5249 && ((foreign
5251 || (foreign
5256 || (!foreign
5258 {
5259 /* We take advantage of 6.2(12) by considering that references built for
5260 parameters whose type isn't by-ref and for which the mechanism hasn't
5261 been forced to by-ref allow only a restricted form of aliasing. */
5262 restricted_aliasing_p
5266 }
5268 /* Pass In Out or Out parameters using copy-in copy-out mechanism. */
5277 /* If this is an Out parameter that isn't passed by reference and isn't
5278 a pointer or aggregate, we don't make a PARM_DECL for it. Instead,
5279 it will be a VAR_DECL created when we process the procedure, so just
5280 return its type. For the special parameter of a valued procedure,
5281 never pass it in.
5283 An exception is made to cover the RM-6.4.1 rule requiring "by copy"
5284 Out parameters with discriminants or implicit initial values to be
5285 handled like In Out parameters. These type are normally built as
5286 aggregates, hence passed by reference, except for some packed arrays
5287 which end up encoded in special integer types. Note that scalars can
5288 be given implicit initial values using the Default_Value aspect.
5290 The exception we need to make is then for packed arrays of records
5291 with discriminants or implicit initial values. We have no light/easy
5292 way to check for the latter case, so we merely check for packed arrays
5293 of records. This may lead to useless copy-in operations, but in very
5294 rare cases only, as these would be exceptions in a set of already
5295 exceptional situations. */
5297 && !by_ref
5298 && (by_return
5317 /* If no Mechanism was specified, indicate what we're using, then
5318 back-annotate it. */
5324 }
5326 /* Associate GNAT_SUBPROG with GNU_TYPE, which must be a dummy type, so that
5327 GNAT_SUBPROG is updated when GNU_TYPE is completed.
5329 Ada 2012 (AI05-019) says that freezing a subprogram does not always freeze
5330 the corresponding profile, which means that, by the time the freeze node
5331 of the subprogram is encountered, types involved in its profile may still
5332 be not yet frozen. That's why we need to update GNAT_SUBPROG when we see
5333 the freeze node of types involved in its profile, either types of formal
5334 parameters or the return type. */
5336 static void
5338 {
5346 {
5351 }
5353 /* Even if there is already a slot for GNU_TYPE, we need to set the flag
5354 because the vector might have been just emptied by update_profiles_with.
5355 This can happen when there are 2 freeze nodes associated with different
5356 views of the same type; the type will be really complete only after the
5357 second freeze node is encountered. */
5362 /* Make sure GNAT_SUBPROG is not associated twice with the same dummy type,
5363 since this would mean updating twice its profile. */
5365 {
5369 /* Entity_Id is a simple integer so we can implement a stable order on
5370 the vector with an ordered insertion scheme and binary search. */
5372 {
5379 else
5381 }
5383 /* l == u and therefore is the insertion point. */
5385 }
5386 else
5390 }
5392 /* Update the GCC tree previously built for the profile of GNAT_SUBPROG. */
5394 static void
5396 {
5397 tree gnu_param_list;
5402 {
5403 /* Builtins cannot have their address taken so we can reset them. */
5408 }
5414 /* If GNAT_SUBPROG is an actual subprogram, GNU_SUBPROG is a FUNCTION_DECL
5415 and needs to be adjusted too. */
5417 {
5419 tree gnu_ext_name
5424 }
5425 }
5427 /* Update the GCC trees previously built for the profiles involving GNU_TYPE,
5428 a dummy type which appears in profiles. */
5430 void
5432 {
5440 /* The flag needs to be reset before calling update_profile, in case
5441 associate_subprog_with_dummy_type is again invoked on GNU_TYPE. */
5450 }
5452 /* Return the GCC tree for GNAT_TYPE present in the profile of a subprogram.
5454 Ada 2012 (AI05-0151) says that incomplete types coming from a limited
5455 context may now appear as parameter and result types. As a consequence,
5456 we may need to defer their translation until after a freeze node is seen
5457 or to the end of the current unit. We also aim at handling temporarily
5458 incomplete types created by the usual delayed elaboration scheme. */
5460 static tree
5462 {
5463 /* This is the same logic as the E_Access_Type case of gnat_to_gnu_entity
5464 so the rationale is exposed in that place. These processings probably
5465 ought to be merged at some point. */
5467 const bool is_from_limited_with
5470 Entity_Id gnat_full_direct_first
5471 = (is_from_limited_with
5475 Entity_Id gnat_full_direct
5476 = ((is_from_limited_with
5484 tree gnu_type;
5490 && ((!in_main_unit
5497 {
5501 {
5508 }
5509 }
5514 else
5517 /* Access-to-unconstrained-array types need a special treatment. */
5519 {
5522 }
5525 }
5527 /* Return a GCC tree for a subprogram type corresponding to GNAT_SUBPROG.
5528 DEFINITION is true if this is for a subprogram being defined. DEBUG_INFO_P
5529 is true if we need to write debug information for other types that we may
5530 create in the process. Also set PARAM_LIST to the list of parameters.
5531 If GNAT_SUBPROG is bound to a GCC builtin, return the DECL for the builtin
5532 directly instead of its type. */
5534 static tree
5537 {
5540 Entity_Id gnat_param;
5543 tree gnu_return_type;
5546 /* Non-null for subprograms containing parameters passed by copy-in copy-out
5547 (In Out or Out parameters not passed by reference), in which case it is
5548 the list of nodes used to specify the values of the In Out/Out parameters
5549 that are returned as a record upon procedure return. The TREE_PURPOSE of
5550 an element of this list is a FIELD_DECL of the record and the TREE_VALUE
5551 is the PARM_DECL corresponding to that field. This list will be saved in
5552 the TYPE_CI_CO_LIST field of the FUNCTION_TYPE node we create. */
5555 /* Fields in return type of procedure with copy-in copy-out parameters. */
5557 /* The semantics of "pure" in Ada essentially matches that of "const"
5558 in the back-end. In particular, both properties are orthogonal to
5559 the "nothrow" property if the EH circuitry is explicit in the
5560 internal representation of the back-end. If we are to completely
5561 hide the EH circuitry from it, we need to declare that calls to pure
5562 Ada subprograms that can throw have side effects since they can
5563 trigger an "abnormal" transfer of control flow; thus they can be
5564 neither "const" nor "pure" in the back-end sense. */
5572 /* Look into the return type and get its associated GCC tree if it is not
5573 void, and then compute various flags for the subprogram type. But make
5574 sure not to do this processing multiple times. */
5581 {
5586 }
5588 else
5589 {
5590 /* For foreign convention subprograms, return System.Address as void *
5591 or equivalent. Note that this comprises GCC builtins. */
5595 else
5598 /* If this function returns by reference, make the actual return type
5599 the reference type and make a note of that. */
5601 {
5604 }
5606 /* If the return type is an unconstrained array type, the return value
5607 will be allocated on the secondary stack so the actual return type
5608 is the fat pointer type. */
5610 {
5613 }
5615 /* This is the same unconstrained array case, but for a dummy type. */
5618 {
5621 }
5623 /* Likewise, if the return type requires a transient scope, the return
5624 value will also be allocated on the secondary stack so the actual
5625 return type is the reference type. */
5627 {
5630 }
5632 /* If the Mechanism is By_Reference, ensure this function uses the
5633 target's by-invisible-reference mechanism, which may not be the
5634 same as above (e.g. it might be passing an extra parameter). */
5638 /* Likewise, if the return type is itself By_Reference. */
5642 /* If the type is a padded type and the underlying type would not be
5643 passed by reference or the function has a foreign convention, return
5644 the underlying type. */
5646 && (!default_pass_by_ref
5651 /* If the return type is unconstrained, it must have a maximum size.
5652 Use the padded type as the effective return type. And ensure the
5653 function uses the target's by-invisible-reference mechanism to
5654 avoid copying too much data when it returns. */
5656 {
5660 /* If the size overflows to 0, set it to an arbitrary positive
5661 value so that assignments in the type are preserved. Their
5662 actual size is independent of this positive value. */
5666 {
5669 }
5675 /* Declare it now since it will never be declared otherwise. This
5676 is necessary to ensure that its subtrees are properly marked. */
5683 }
5685 /* If the return type has a size that overflows, we usually cannot have
5686 a function that returns that type. This usage doesn't really make
5687 sense anyway, so issue an error here. */
5692 {
5697 }
5699 /* If the return type is incomplete, there are 2 cases: if the function
5700 returns by reference, then the return type is only linked indirectly
5701 in the profile, so the profile can be seen as complete since it need
5702 not be further modified, only the reference types need be adjusted;
5703 otherwise the profile is incomplete and need be adjusted too. */
5705 {
5708 }
5712 || return_by_direct_ref_p
5713 || return_by_invisi_ref_p
5715 }
5717 /* A procedure (something that doesn't return anything) shouldn't be
5718 considered const since there would be no reason for calling such a
5719 subprogram. Note that procedures with Out (or In Out) parameters
5720 have already been converted into a function with a return type.
5721 Similarly, if the function returns an unconstrained type, then the
5722 function will allocate the return value on the secondary stack and
5723 thus calls to it cannot be CSE'ed, lest the stack be reclaimed. */
5727 /* Loop over the parameters and get their associated GCC tree. While doing
5728 this, build a copy-in copy-out structure if we need one. */
5732 {
5733 const bool mech_is_by_ref
5740 /* Fetch an existing parameter with complete type and reuse it. But we
5741 didn't save the CICO property so we can only do it for In parameters
5742 or parameters passed by reference. */
5747 {
5750 }
5752 /* Otherwise translate the parameter type and act accordingly. */
5753 else
5754 {
5757 /* For foreign convention subprograms, pass System.Address as void *
5758 or equivalent. Note that this comprises GCC builtins. */
5762 else
5765 /* If the parameter type is incomplete, there are 2 cases: if it is
5766 passed by reference, then the type is only linked indirectly in
5767 the profile, so the profile can be seen as complete since it need
5768 not be further modified, only the reference type need be adjusted;
5769 otherwise the profile is incomplete and need be adjusted too. */
5771 {
5772 Node_Id gnat_decl;
5776 && TYPE_IS_FAT_POINTER_P
5779 {
5781 gnu_param
5791 }
5793 /* ??? This is a kludge to support null procedures in spec taking
5794 a parameter with an untagged incomplete type coming from a
5795 limited context. The front-end creates a body without knowing
5796 anything about the non-limited view, which is illegal Ada and
5797 cannot be supported. Create a parameter with a fake type. */
5805 else
5806 {
5807 /* Build a minimal PARM_DECL without DECL_ARG_TYPE so that
5808 Call_to_gnu will stop if it encounters the PARM_DECL. */
5809 gnu_param
5811 gnu_param_type);
5813 gnu_param_type);
5815 }
5816 }
5818 /* Otherwise build the parameter declaration normally. */
5819 else
5820 {
5821 gnu_param
5825 /* We are returned either a PARM_DECL or a type if no parameter
5826 needs to be passed; in either case, adjust the type. */
5829 else
5830 {
5833 }
5834 }
5835 }
5837 /* If we have a GCC tree for the parameter, register it. */
5840 {
5841 gnu_param_type_list
5846 /* If a parameter is a pointer, a function may modify memory through
5847 it and thus shouldn't be considered a const function. Also, the
5848 memory may be modified between two calls, so they can't be CSE'ed.
5849 The latter case also handles by-ref parameters. */
5853 }
5855 /* If the parameter uses the copy-in copy-out mechanism, allocate a field
5856 for it in the return type and register the association. */
5858 {
5860 {
5863 /* If this is a function, we also need a field for the
5864 return value to be placed. */
5866 {
5867 tree gnu_field
5869 gnu_return_type,
5875 gnu_cico_list
5877 }
5880 /* Set a default alignment to speed up accesses. But we should
5881 not increase the size of the structure too much, lest it does
5882 not fit in return registers anymore. */
5885 }
5887 tree gnu_field
5896 }
5897 }
5899 /* If the subprogram uses the copy-in copy-out mechanism, possibly adjust
5900 and finish up the return type. */
5902 {
5903 /* If we have a CICO list but it has only one entry, we convert
5904 this function into a function that returns this object. */
5908 /* Do not finalize the return type if the subprogram is stubbed
5909 since structures are incomplete for the back-end. */
5911 {
5915 /* Try to promote the mode of the return type if it is passed
5916 in registers, again to speed up accesses. */
5919 NULL_TREE))
5920 {
5921 unsigned int size
5924 scalar_int_mode mode;
5929 {
5937 }
5938 }
5942 }
5945 }
5947 /* The lists have been built in reverse. */
5953 /* If the profile is incomplete, we only set the (temporary) return and
5954 parameter types; otherwise, we build the full type. In either case,
5955 we reuse an already existing GCC tree that we built previously here. */
5957 {
5959 ;
5960 else
5967 }
5968 else
5969 {
5971 {
5980 }
5981 else
5982 {
5983 gnu_type
5986 /* GNU_TYPE may be shared since GCC hashes types. Unshare it if it
5987 has a different TYPE_CI_CO_LIST or flags. */
5989 return_unconstrained_p,
5990 return_by_direct_ref_p,
5991 return_by_invisi_ref_p))
5992 {
5998 }
5999 }
6007 /* If this subprogram is expectedly bound to a GCC builtin, fetch the
6008 corresponding DECL node and check the parameter association. */
6011 {
6015 /* If we have a builtin DECL for that function, use it. Check if
6016 the profiles are compatible and warn if they are not. Note that
6017 the checker is expected to post diagnostics in this case. */
6019 {
6020 intrin_binding_t inb
6024 post_error
6026 gnat_subprog);
6029 }
6031 /* Inability to find the builtin DECL most often indicates a genuine
6032 mistake, but imports of unregistered intrinsics are sometimes used
6033 on purpose to allow hooking in alternate bodies; we post a warning
6034 conditioned on Wshadow in this case, to let developers be notified
6035 on demand without risking false positives with common default sets
6036 of options. */
6039 }
6040 }
6043 }
6045 /* Return the external name for GNAT_SUBPROG given its entity name. */
6047 static tree
6049 {
6052 /* If there was no specified Interface_Name and the external and
6053 internal names of the subprogram are the same, only use the
6054 internal name to allow disambiguation of nested subprograms. */
6059 }
6061 /* Like build_qualified_type, but TYPE_QUALS is added to the existing
6062 qualifiers on TYPE. */
6064 static tree
6066 {
6067 /* Qualifiers must be put on the associated array type. */
6072 }
6074 /* Set TYPE_NONALIASED_COMPONENT on an array type built by means of
6075 build_nonshared_array_type. */
6077 static void
6079 {
6082 }
6084 /* Set TYPE_REVERSE_STORAGE_ORDER on an array type built by means of
6085 build_nonshared_array_type. */
6087 static void
6089 {
6092 }
6094 /* Return true if DISCR1 and DISCR2 represent the same discriminant. */
6096 static bool
6098 {
6105 return
6107 }
6109 /* Return true if the array type GNU_TYPE, which represents a dimension of
6110 GNAT_TYPE, has a non-aliased component in the back-end sense. */
6112 static bool
6114 {
6115 /* If the array type is not the innermost dimension of the GNAT type,
6116 then it has a non-aliased component. */
6121 /* If the array type has an aliased component in the front-end sense,
6122 then it also has an aliased component in the back-end sense. */
6126 /* If this is a derived type, then it has a non-aliased component if
6127 and only if its parent type also has one. */
6129 {
6133 gnu_parent_type
6138 }
6140 /* Otherwise, rely exclusively on properties of the element type. */
6142 }
6144 /* Return true if GNAT_ADDRESS is a value known at compile-time. */
6146 static bool
6148 {
6149 /* Handle reference to a constant. */
6152 {
6156 }
6158 /* Catch System'To_Address. */
6163 }
6165 /* Return true if GNAT_RANGE, a N_Range node, cannot be superflat, i.e. if the
6166 inequality HB >= LB-1 is true. LB and HB are the low and high bounds. */
6168 static bool
6170 {
6172 Node_Id scalar_range;
6175 /* If the low bound is not constant, try to find an upper bound. */
6184 /* If the high bound is not constant, try to find a lower bound. */
6193 /* If we have failed to find constant bounds, punt. */
6198 /* We need at least a signed 64-bit type to catch most cases. */
6204 /* If the low bound is the smallest integer, nothing can be smaller. */
6210 }
6212 /* Return true if GNU_EXPR is (essentially) the address of a CONSTRUCTOR. */
6214 static bool
6216 {
6224 }
6226 /* Return true if the size in units represented by GNU_SIZE can be handled by
6227 an allocation. If STATIC_P is true, consider only what can be done with a
6228 static allocation. */
6230 static bool
6232 {
6233 /* We can allocate a fixed size if it is a valid for the middle-end. */
6237 /* We can allocate a variable size if this isn't a static allocation. */
6238 else
6240 }
6242 /* Return true if GNU_EXPR needs a conversion to GNU_TYPE when used as the
6243 initial value of an object of GNU_TYPE. */
6245 static bool
6247 {
6248 /* Do not convert if the object's type is unconstrained because this would
6249 generate useless evaluations of the CONSTRUCTOR to compute the size. */
6254 /* Do not convert if the object's type is a padding record whose field is of
6255 self-referential size because we want to copy only the actual data. */
6259 /* Do not convert a call to a function that returns with variable size since
6260 we want to use the return slot optimization in this case. */
6265 /* Do not convert to a record type with a variant part from a record type
6266 without one, to keep the object simpler. */
6273 /* In all the other cases, convert the expression to the object's type. */
6275 }
6276 \f
6277 /* Given GNAT_ENTITY, elaborate all expressions that are required to
6278 be elaborated at the point of its definition, but do nothing else. */
6280 void
6282 {
6284 {
6291 {
6295 /* ??? Tests to avoid Constraint_Error in static expressions
6296 are needed until after the front stops generating bogus
6297 conversions on bounds of real types. */
6305 }
6312 {
6313 Node_Id gnat_discriminant_expr;
6314 Entity_Id gnat_field;
6318 gnat_discriminant_expr
6323 /* Ignore access discriminants. */
6328 }
6331 }
6332 }
6333 \f
6334 /* Prepend to ATTR_LIST an entry for an attribute with provided TYPE,
6335 NAME, ARGS and ERROR_POINT. */
6337 static void
6340 tree attr_name,
6341 tree attr_args,
6342 Node_Id attr_error_point)
6343 {
6353 }
6355 /* Prepend to ATTR_LIST an entry for an attribute provided by GNAT_PRAGMA. */
6357 static void
6359 {
6364 /* Map the pragma at hand. Skip if this isn't one we know how to handle. */
6366 {
6397 }
6399 /* See what arguments we have and turn them into GCC trees for attribute
6400 handlers. These expect identifier for strings. We handle at most two
6401 arguments and static expressions only. */
6403 {
6409 {
6413 {
6417 }
6420 }
6424 {
6429 }
6430 }
6432 /* Prepend to the list. Make a list of the argument we might have, as GCC
6433 expects it. */
6435 gnu_arg1
6439 }
6441 /* Prepend to ATTR_LIST the list of attributes for GNAT_ENTITY, if any. */
6443 static void
6445 {
6446 Node_Id gnat_temp;
6448 /* Attributes are stored as Representation Item pragmas. */
6454 }
6455 \f
6456 /* Given a GNAT tree GNAT_EXPR, for an expression which is a value within a
6457 type definition (either a bound or a discriminant value) for GNAT_ENTITY,
6458 return the GCC tree to use for that expression. S is the suffix to use
6459 if a variable needs to be created and DEFINITION is true if this is done
6460 for a definition of GNAT_ENTITY. If NEED_VALUE is true, we need a result;
6461 otherwise, we are just elaborating the expression for side-effects. If
6462 NEED_DEBUG is true, we need a variable for debugging purposes even if it
6463 isn't needed for code generation. */
6465 static tree
6468 {
6469 tree gnu_expr;
6471 /* If we already elaborated this expression (e.g. it was involved
6472 in the definition of a private type), use the old value. */
6476 /* If we don't need a value and this is static or a discriminant,
6477 we don't need to do anything. */
6484 /* If it's a static expression, we don't need a variable for debugging. */
6488 /* Otherwise, convert this tree to its GCC equivalent and elaborate it. */
6492 /* Save the expression in case we try to elaborate this entity again. Since
6493 it's not a DECL, don't check it. Don't save if it's a discriminant. */
6498 }
6500 /* Similar, but take a GNU expression and always return a result. */
6502 static tree
6505 {
6510 /* If GNU_EXPR contains a placeholder, just return it. We rely on the fact
6511 that an expression cannot contain both a discriminant and a variable. */
6515 /* If GNU_EXPR is neither a constant nor based on a read-only variable, make
6516 a variable that is initialized to contain the expression when the package
6517 containing the definition is elaborated. If this entity is defined at top
6518 level, replace the expression by the variable; otherwise use a SAVE_EXPR
6519 if this is necessary. */
6522 else
6523 {
6524 /* Skip any conversions and simple constant arithmetics to see if the
6525 expression is based on a read-only variable. */
6533 expr_variable_p
6534 = !(inner
6537 }
6539 /* We only need to use the variable if we are in a global context since GCC
6540 can do the right thing in the local case. However, when not optimizing,
6541 use it for bounds of loop iteration scheme to avoid code duplication. */
6542 use_variable = expr_variable_p
6543 && (expr_global_p
6544 || (!optimize
6545 && definition
6550 /* Now create it, possibly only for debugging purposes. */
6552 {
6553 /* The following variable creation can happen when processing the body
6554 of subprograms that are defined out of the extended main unit and
6555 inlined. In this case, we are not at the global scope, and thus the
6556 new variable must not be tagged "external", as we used to do here as
6557 soon as DEFINITION was false. */
6558 tree gnu_decl
6565 /* Using this variable at debug time (if need_debug is true) requires a
6566 proper location. The back-end will compute a location for this
6567 variable only if the variable is used by the generated code.
6568 Returning the variable ensures the caller will use it in generated
6569 code. Note that there is no need for a location if the debug info
6570 contains an integer constant.
6571 TODO: when the encoding-based debug scheme is dropped, move this
6572 condition to the top-level IF block: we will not need to create a
6573 variable anymore in such cases, then. */
6576 }
6579 }
6581 /* Similar, but take an alignment factor and make it explicit in the tree. */
6583 static tree
6586 {
6588 return
6591 gnu_expr,
6592 unit_align),
6594 need_debug),
6595 unit_align);
6596 }
6598 /* Structure to hold internal data for elaborate_reference. */
6600 struct er_data
6601 {
6602 Entity_Id entity;
6605 };
6607 /* Wrapper function around elaborate_expression_1 for elaborate_reference. */
6609 static tree
6611 {
6615 /* This is what elaborate_expression_1 does if NEED_DEBUG is false. */
6619 /* If this is a COMPONENT_REF of a fat pointer, elaborate the entire fat
6620 pointer. This may be more efficient, but will also allow us to more
6621 easily find the match for the PLACEHOLDER_EXPR. */
6629 return
6631 }
6633 /* Elaborate the reference REF to be used as renamed object for GNAT_ENTITY.
6634 DEFINITION is true if this is done for a definition of GNAT_ENTITY and
6635 INIT is set to the first arm of a COMPOUND_EXPR present in REF, if any. */
6637 static tree
6640 {
6643 }
6644 \f
6645 /* Given a GNU tree and a GNAT list of choices, generate an expression to test
6646 the value passed against the list of choices. */
6648 static tree
6650 {
6651 Node_Id choice;
6652 Node_Id gnat_temp;
6657 {
6659 {
6664 this_test
6679 this_test
6690 /* This represents either a subtype range, an enumeration
6691 literal, or a constant Ekind says which. If an enumeration
6692 literal or constant, fall through to the next case. */
6695 {
6701 this_test
6709 }
6711 /* ... fall through ... */
6726 }
6730 else
6733 }
6736 }
6737 \f
6738 /* Adjust PACKED setting as passed to gnat_to_gnu_field for a field of
6739 type FIELD_TYPE to be placed in RECORD_TYPE. Return the result. */
6741 static int
6743 {
6744 /* If the field contains an item of variable size, we cannot pack it
6745 because we cannot create temporaries of non-fixed size in case
6746 we need to take the address of the field. See addressable_p and
6747 the notes on the addressability issues for further details. */
6751 /* In the other cases, we can honor the packing. */
6755 /* If the alignment of the record is specified and the field type
6756 is over-aligned, request Storage_Unit alignment for the field. */
6761 /* Likewise if the maximum alignment of the record is specified. */
6767 }
6769 /* Return a GCC tree for a field corresponding to GNAT_FIELD to be
6770 placed in GNU_RECORD_TYPE.
6772 PACKED is 1 if the enclosing record is packed or -1 if the enclosing
6773 record has Component_Alignment of Storage_Unit.
6775 DEFINITION is true if this field is for a record being defined.
6777 DEBUG_INFO_P is true if we need to write debug information for types
6778 that we may create in the process. */
6780 static tree
6783 {
6786 const bool is_atomic
6789 const bool is_independent
6791 const bool is_volatile
6794 /* We used to consider that volatile fields also require strict alignment,
6795 but that was an interpolation and would cause us to reject a pragma
6796 volatile on a packed record type containing boolean components, while
6797 there is no basis to do so in the RM. In such cases, the writes will
6798 involve load-modify-store sequences, but that's OK for volatile. The
6799 only constraint is the implementation advice whereby only the bits of
6800 the components should be accessed if they both start and end on byte
6801 boundaries, but that should be guaranteed by the GCC memory model. */
6802 const bool needs_strict_alignment
6808 /* If this field requires strict alignment, we cannot pack it because
6809 it would very likely be under-aligned in the record. */
6812 else
6815 /* If a size is specified, use it. Otherwise, if the record type is packed,
6816 use the official RM size. See "Handling of Type'Size Values" in Einfo
6817 for further details. */
6824 else
6827 /* If we have a specified size that is smaller than that of the field's type,
6828 or a position is specified, and the field's type is a record that doesn't
6829 require strict alignment, see if we can get either an integral mode form
6830 of the type or a smaller form. If we can, show a size was specified for
6831 the field if there wasn't one already, so we know to make this a bitfield
6832 and avoid making things wider.
6834 Changing to an integral mode form is useful when the record is packed as
6835 we can then place the field at a non-byte-aligned position and so achieve
6836 tighter packing. This is in addition required if the field shares a byte
6837 with another field and the front-end lets the back-end handle the access
6838 to the field, because GCC cannot handle non-byte-aligned BLKmode fields.
6840 Changing to a smaller form is required if the specified size is smaller
6841 than that of the field's type and the type contains sub-fields that are
6842 padded, in order to avoid generating accesses to these sub-fields that
6843 are wider than the field.
6845 We avoid the transformation if it is not required or potentially useful,
6846 as it might entail an increase of the field's alignment and have ripple
6847 effects on the outer record type. A typical case is a field known to be
6848 byte-aligned and not to share a byte with another field. */
6854 || (gnu_size
6860 {
6863 {
6867 }
6868 }
6871 {
6872 const unsigned int align
6875 gnu_field_type
6879 }
6882 {
6890 /* Ensure the position does not overlap with the parent subtype, if there
6891 is one. This test is omitted if the parent of the tagged type has a
6892 full rep clause since, in this case, component clauses are allowed to
6893 overlay the space allocated for the parent type and the front-end has
6894 checked that there are no overlapping components. */
6896 {
6901 post_error_ne_tree
6904 }
6906 /* If this field needs strict alignment, make sure that the record is
6907 sufficiently aligned and that the position and size are consistent
6908 with the type. But don't do it if we are just annotating types and
6909 the field's type is tagged, since tagged types aren't fully laid out
6910 in this mode. Also, note that atomic implies volatile so the inner
6911 test sequences ordering is significant here. */
6914 {
6920 /* If the position is not a multiple of the alignment of the type,
6921 then error out and reset the position. */
6924 {
6936 else
6940 type_align);
6942 }
6945 {
6949 /* If the size is lower than that of the type, or greater for
6950 atomic and aliased, then error out and reset the size. */
6952 {
6964 else
6968 gnu_type_size);
6970 }
6972 /* Likewise if the size is not a multiple of a byte, */
6974 bitsize_unit_node)))
6975 {
6984 else
6989 }
6990 }
6991 }
6992 }
6994 /* If the record has rep clauses and this is the tag field, make a rep
6995 clause for it as well. */
6998 {
7001 }
7003 else
7004 {
7007 /* If we are packing the record and the field is BLKmode, round the
7008 size up to a byte boundary. */
7011 }
7013 /* We need to make the size the maximum for the type if it is
7014 self-referential and an unconstrained type. In that case, we can't
7015 pack the field since we can't make a copy to align it. */
7017 && !gnu_size
7020 {
7023 }
7025 /* If a size is specified, adjust the field's type to it. */
7027 {
7028 tree orig_field_type;
7030 /* If the field's type is justified modular, we would need to remove
7031 the wrapper to (better) meet the layout requirements. However we
7032 can do so only if the field is not aliased to preserve the unique
7033 layout, if it has the same storage order as the enclosing record
7034 and if the prescribed size is not greater than that of the packed
7035 array to preserve the justification. */
7045 /* Similarly if the field's type is a misaligned integral type, but
7046 there is no restriction on the size as there is no justification. */
7052 gnu_field_type
7060 /* If a padding record was made, declare it now since it will never be
7061 declared otherwise. This is necessary to ensure that its subtrees
7062 are properly marked. */
7067 }
7069 /* Otherwise (or if there was an error), don't specify a position. */
7070 else
7073 /* If the field's type is a padded type made for a scalar field of a record
7074 type with reverse storage order, we need to propagate the reverse storage
7075 order to the padding type since it is the innermost enclosing aggregate
7076 type around the scalar. */
7085 /* Now create the decl for the field. */
7086 gnu_field
7094 {
7099 }
7102 }
7103 \f
7104 /* Return true if at least one member of COMPONENT_LIST needs strict
7105 alignment. */
7107 static bool
7109 {
7110 Node_Id component_decl;
7115 {
7123 }
7126 }
7128 /* Return true if TYPE is a type with variable size or a padding type with a
7129 field of variable size or a record that has a field with such a type. */
7131 static bool
7133 {
7134 tree field;
7151 }
7152 \f
7153 /* Return true if FIELD is an artificial field. */
7155 static bool
7157 {
7158 /* These fields are generated by the front-end proper. */
7162 /* These fields are generated by gigi. */
7167 }
7169 /* Return true if FIELD is a non-artificial field with self-referential
7170 size. */
7172 static bool
7174 {
7182 }
7184 /* Return true if FIELD is a non-artificial field with variable size. */
7186 static bool
7188 {
7196 }
7198 /* qsort comparer for the bit positions of two record components. */
7200 static int
7202 {
7205 const int ret
7209 }
7211 /* Reverse function from gnat_to_gnu_field: return the GNAT field present in
7212 either GNAT_COMPONENT_LIST or the discriminants of GNAT_RECORD_TYPE, and
7213 corresponding to the GNU tree GNU_FIELD. */
7215 static Entity_Id
7217 Entity_Id gnat_record_type)
7218 {
7226 {
7230 }
7240 }
7242 /* Issue a warning for the problematic placement of GNU_FIELD present in
7243 either GNAT_COMPONENT_LIST or the discriminants of GNAT_RECORD_TYPE.
7244 IN_VARIANT is true if GNAT_COMPONENT_LIST is the list of a variant.
7245 DO_REORDER is true if fields of GNAT_RECORD_TYPE are being reordered. */
7247 static void
7251 {
7256 = in_variant
7266 = do_reorder
7270 Entity_Id gnat_field
7278 }
7280 /* Structure holding information for a given variant. */
7282 {
7283 /* The record type of the variant. */
7284 tree type;
7286 /* The name of the variant. */
7287 tree name;
7289 /* The qualifier of the variant. */
7290 tree qual;
7292 /* Whether the variant has a rep clause. */
7295 /* Whether the variant is packed. */
7300 /* Translate and chain GNAT_COMPONENT_LIST present in GNAT_RECORD_TYPE to
7301 GNU_FIELD_LIST, set the result as the field list of GNU_RECORD_TYPE and
7302 finish it up. Return true if GNU_RECORD_TYPE has a rep clause that affects
7303 the layout (see below). When called from gnat_to_gnu_entity during the
7304 processing of a record definition, the GCC node for the parent, if any,
7305 will be the single field of GNU_RECORD_TYPE and the GCC nodes for the
7306 discriminants will be on GNU_FIELD_LIST. The other call to this function
7307 is a recursive call for the component list of a variant and, in this case,
7308 GNU_FIELD_LIST is empty.
7310 PACKED is 1 if this is for a packed record or -1 if this is for a record
7311 with Component_Alignment of Storage_Unit.
7313 DEFINITION is true if we are defining this record type.
7315 CANCEL_ALIGNMENT is true if the alignment should be zeroed before laying
7316 out the record. This means the alignment only serves to force fields to
7317 be bitfields, but not to require the record to be that aligned. This is
7318 used for variants.
7320 ALL_REP is true if a rep clause is present for all the fields.
7322 UNCHECKED_UNION is true if we are building this type for a record with a
7323 Pragma Unchecked_Union.
7325 ARTIFICIAL is true if this is a type that was generated by the compiler.
7327 DEBUG_INFO is true if we need to write debug information about the type.
7329 MAYBE_UNUSED is true if this type may be unused in the end; this doesn't
7330 mean that its contents may be unused as well, only the container itself.
7332 FIRST_FREE_POS, if nonzero, is the first (lowest) free field position in
7333 the outer record type down to this variant level. It is nonzero only if
7334 all the fields down to this level have a rep clause and ALL_REP is false.
7336 P_GNU_REP_LIST, if nonzero, is a pointer to a list to which each field
7337 with a rep clause is to be added; in this case, that is all that should
7338 be done with such fields and the return value will be false. */
7340 static bool
7347 {
7348 const bool needs_xv_encodings
7360 /* For each component referenced in a component declaration create a GCC
7361 field and add it to the list, skipping pragmas in the GNAT list. */
7368 {
7372 /* If present, the _Parent field must have been created as the single
7373 field of the record type. Put it before any other fields. */
7375 {
7378 }
7379 else
7380 {
7384 /* If this is the _Tag field, put it before any other fields. */
7388 /* If this is the _Controller field, put it before the other
7389 fields except for the _Tag or _Parent field. */
7391 {
7394 }
7396 /* If this is a regular field, put it after the other fields. */
7397 else
7398 {
7404 /* And record information for the final layout. */
7409 }
7410 }
7413 }
7415 /* At the end of the component list there may be a variant part. */
7418 /* We create a QUAL_UNION_TYPE for the variant part since the variants are
7419 mutually exclusive and should go in the same memory. To do this we need
7420 to treat each variant as a record whose elements are created from the
7421 component list for the variant. So here we create the records from the
7422 lists for the variants and put them all into the QUAL_UNION_TYPE.
7423 If this is an Unchecked_Union, we make a UNION_TYPE instead or
7424 use GNU_RECORD_TYPE if there are no fields so far. */
7426 {
7430 tree gnu_var_name
7441 gnu_union_name
7444 /* Reuse the enclosing union if this is an Unchecked_Union whose fields
7445 are all in the variant part, to match the layout of C unions. There
7446 is an associated check below. */
7449 else
7450 {
7451 gnu_union_type
7459 }
7461 /* If all the fields down to this level have a rep clause, find out
7462 whether all the fields at this level also have one. If so, then
7463 compute the new first free position to be passed downward. */
7466 {
7468 gnu_field;
7471 {
7474 this_first_free_pos
7476 }
7477 else
7478 {
7481 }
7482 }
7484 /* We build the variants in two passes. The bulk of the work is done in
7485 the first pass, that is to say translating the GNAT nodes, building
7486 the container types and computing the associated properties. However
7487 we cannot finish up the container types during this pass because we
7488 don't know where the variant part will be placed until the end. */
7492 {
7497 vinfo_t vinfo;
7505 /* Set the alignment of the inner type in case we need to make
7506 inner objects into bitfields, but then clear it out so the
7507 record actually gets only the alignment required. */
7513 /* Similarly, if the outer record has a size specified and all
7514 the fields have a rep clause, we can propagate the size. */
7516 {
7520 }
7522 /* Add the fields into the record type for the variant. Note that
7523 we aren't sure to really use it at this point, see below. */
7524 has_rep
7530 all_rep || this_first_free_pos
7533 /* Translate the qualifier and annotate the GNAT node. */
7537 /* Deal with packedness like in gnat_to_gnu_field. */
7539 {
7542 }
7543 else
7544 field_packed
7547 /* Push this variant onto the stack for the second pass. */
7555 /* Compute the global properties that will determine the placement of
7556 the variant part. */
7560 }
7562 /* Round up the first free position to the alignment of the variant part
7563 for the variants without rep clause. This will guarantee a consistent
7564 layout independently of the placement of the variant part. */
7568 /* In the second pass, the container types are adjusted if necessary and
7569 finished up, then the corresponding fields of the variant part are
7570 built with their qualifier, unless this is an unchecked union. */
7572 {
7576 /* If this is an Unchecked_Union whose fields are all in the variant
7577 part and we have a single field with no representation clause or
7578 placed at offset zero, use the field directly to match the layout
7579 of C unions. */
7581 && gnu_field_list
7585 {
7588 }
7589 else
7590 {
7591 /* Finalize the variant type now. We used to throw away empty
7592 record types but we no longer do that because we need them to
7593 generate complete debug info for the variant; otherwise, the
7594 union type definition will be lacking the fields associated
7595 with these empty variants. */
7597 {
7598 /* The variant part will be at offset 0 so we need to ensure
7599 that the fields are laid out starting from the first free
7600 position at this level. */
7602 tree gnu_rep_part;
7606 gnu_rep_part
7608 this_first_free_pos);
7613 }
7620 gnu_field
7622 gnu_union_type,
7623 all_rep_and_size
7632 }
7636 }
7638 /* Only make the QUAL_UNION_TYPE if there are non-empty variants. */
7640 {
7644 {
7648 }
7653 /* If GNU_UNION_TYPE is our record type, it means we must have an
7654 Unchecked_Union with no fields. Verify that and, if so, just
7655 return. */
7657 {
7659 && !gnu_field_list
7662 }
7667 /* Deal with packedness like in gnat_to_gnu_field. */
7670 else
7671 union_field_packed
7674 gnu_variant_part
7676 all_rep_and_size
7682 }
7683 }
7685 /* Scan GNU_FIELD_LIST and see if any fields have rep clauses. If they do,
7686 pull them out and put them onto the appropriate list.
7688 Similarly, pull out the fields with zero size and no rep clause, as they
7689 would otherwise modify the layout and thus very likely run afoul of the
7690 Ada semantics, which are different from those of C here.
7692 Finally, if there is an aliased field placed in the list after fields
7693 with self-referential size, pull out the latter in the same way.
7695 Optionally, if the reordering mechanism is enabled, pull out the fields
7696 with self-referential size, variable size and fixed size not a multiple
7697 of a byte, so that they don't cause the regular fields to be either at
7698 self-referential/variable offset or misaligned. Note, in the latter
7699 case, that this can only happen in packed record types so the alignment
7700 is effectively capped to the byte for the whole record. But we don't
7701 do it for non-packed record types if pragma Optimize_Alignment (Space)
7702 is specified because this can prevent alignment gaps from being filled.
7704 Optionally, if the layout warning is enabled, keep track of the above 4
7705 different kinds of fields and issue a warning if some of them would be
7706 (or are being) reordered by the reordering mechanism.
7708 ??? If we reorder fields, the debugging information will be affected and
7709 the debugger print fields in a different order from the source code. */
7710 const bool do_reorder
7716 const bool w_reorder
7718 && Warn_On_Questionable_Layout
7730 #define MOVE_FROM_FIELD_LIST_TO(LIST) \
7731 do { \
7732 if (gnu_last) \
7733 DECL_CHAIN (gnu_last) = gnu_next; \
7734 else \
7735 gnu_field_list = gnu_next; \
7736 \
7737 DECL_CHAIN (gnu_field) = (LIST); \
7738 (LIST) = gnu_field; \
7739 } while (0)
7743 {
7747 {
7750 }
7753 {
7763 }
7766 {
7769 }
7771 /* We don't need further processing in default mode. */
7773 {
7776 }
7779 {
7781 {
7785 do_reorder);
7786 else
7788 }
7791 {
7794 }
7795 }
7798 {
7800 {
7804 do_reorder);
7805 else
7807 }
7810 {
7813 }
7814 }
7816 else
7817 {
7818 /* If the field has no size, then it cannot be bit-packed. */
7819 const unsigned int bitp_size
7824 /* If the field is bit-packed, we move it to a temporary list that
7825 contains the contiguously preceding bit-packed fields, because
7826 we want to be able to put them back if the misalignment happens
7827 to cancel itself after several bit-packed fields. */
7829 {
7833 {
7836 }
7839 {
7842 }
7843 }
7845 /* No more bit-packed fields, move the existing ones to the end or
7846 put them back at their original location. */
7848 {
7852 {
7856 gnat_component_list,
7858 do_reorder);
7865 }
7866 else
7867 {
7868 /* Rechain the temporary list in front of GNU_FIELD. */
7871 {
7876 else
7880 }
7881 }
7882 }
7884 else
7886 }
7889 }
7891 #undef MOVE_FROM_FIELD_LIST_TO
7895 /* If permitted, we reorder the fields as follows:
7897 1) all (groups of) fields whose length is fixed and multiple of a byte,
7898 2) the remaining fields whose length is fixed and not multiple of a byte,
7899 3) the remaining fields whose length doesn't depend on discriminants,
7900 4) all fields whose length depends on discriminants,
7901 5) the variant part,
7903 within the record and within each variant recursively. */
7906 {
7907 /* If we have pending bit-packed fields, warn if they would be moved
7908 to after regular fields. */
7916 }
7919 {
7920 /* If we have pending bit-packed fields on the temporary list, we put
7921 them either on the bit-packed list or back on the regular list. */
7923 {
7926 else
7928 }
7930 gnu_field_list
7934 }
7936 /* Otherwise, if there is an aliased field placed after a field whose length
7937 depends on discriminants, we put all the fields of the latter sort, last.
7938 We need to do this in case an object of this record type is mutable. */
7942 /* If P_REP_LIST is nonzero, this means that we are asked to move the fields
7943 in our REP list to the previous level because this level needs them in
7944 order to do a correct layout, i.e. avoid having overlapping fields. */
7948 /* Deal with the annoying case of an extension of a record with variable size
7949 and partial rep clause, for which the _Parent field is forced at offset 0
7950 and has variable size, which we do not support below. Note that we cannot
7951 do it if the field has fixed size because we rely on the presence of the
7952 REP part built below to trigger the reordering of the fields in a derived
7953 record type when all the fields have a fixed position. */
7957 && !variants_have_rep
7958 && first_free_pos
7961 {
7965 }
7967 /* Otherwise, sort the fields by bit position and put them into their own
7968 record, before the others, if we also have fields without rep clause. */
7970 {
7975 /* If all the fields have a rep clause, we can do a flat layout. */
7976 layout_with_rep = !gnu_field_list
7978 gnu_rep_type
7982 gnu_field;
7988 /* Put the fields in the list in order of increasing position, which
7989 means we start from the end. */
7992 {
7996 }
8000 else
8001 {
8006 /* If FIRST_FREE_POS is nonzero, we need to ensure that the fields
8007 without rep clause are laid out starting from this position.
8008 Therefore, we force it as a minimal size on the REP part. */
8009 gnu_rep_part
8012 /* Chain the REP part at the beginning of the field list. */
8015 }
8016 }
8018 /* Chain the variant part at the end of the field list. */
8030 /* Chain the fields with zero size at the beginning of the field list. */
8036 }
8037 \f
8038 /* Given GNU_SIZE, a GCC tree representing a size, return a Uint to be
8039 placed into an Esize, Component_Bit_Offset, or Component_Size value
8040 in the GNAT tree. */
8042 static Uint
8044 {
8046 TCode tcode;
8050 /* See if we've already saved the value for this node. */
8052 {
8060 }
8061 else
8064 /* If we do not return inside this switch, TCODE will be set to the
8065 code to be used in a call to Create_Node. */
8067 {
8069 /* For negative values, build NEGATE_EXPR of the opposite. Such values
8070 can appear for discriminants in expressions for variants. */
8072 {
8076 }
8077 else
8082 /* The only case we handle here is a simple discriminant reference. */
8084 {
8088 /* Climb up the chain of successive extensions, if any. */
8095 {
8096 /* Fall through to common processing as a FIELD_DECL. */
8099 }
8100 else
8102 }
8103 else
8112 CASE_CONVERT:
8116 /* Now just list the operations we handle. */
8146 /* Fold conversions from bytes to bits into inner operations. */
8149 {
8153 {
8156 widest_int op1;
8160 else
8165 }
8166 }
8171 /* For negative values in sizetype, build NEGATE_EXPR of the opposite.
8172 Such values appear in expressions with aligning patterns. Note that,
8173 since sizetype is unsigned, we have to jump through some hoops. */
8175 {
8180 {
8183 }
8184 }
8188 /* In regular mode, inline back only if symbolic annotation is requested
8189 in order to avoid memory explosion on big discriminated record types.
8190 But not in ASIS mode, as symbolic annotation is required for DDA. */
8192 {
8195 }
8196 else
8201 }
8203 /* Now get each of the operands that's relevant for this code. If any
8204 cannot be expressed as a repinfo node, say we can't. */
8207 {
8211 }
8215 /* Save the result in the cache. */
8217 {
8219 /* We can't assume the hash table data hasn't moved since the initial
8220 look up, so we have to search again. Allocating and inserting an
8221 entry at that point would be an alternative, but then we'd better
8222 discard the entry if we decided not to cache it. */
8228 }
8231 }
8233 /* Given GNAT_ENTITY, an object (constant, variable, parameter, exception)
8234 and GNU_TYPE, its corresponding GCC type, set Esize and Alignment to the
8235 size and alignment used by Gigi. Prefer SIZE over TYPE_SIZE if non-null.
8236 BY_REF is true if the object is used by reference. */
8238 void
8240 {
8242 {
8245 else
8247 }
8250 {
8259 }
8264 }
8266 /* Return first element of field list whose TREE_PURPOSE is the same as ELEM.
8267 Return NULL_TREE if there is no such element in the list. */
8269 static tree
8271 {
8273 {
8278 }
8280 }
8282 /* Given GNAT_ENTITY, a record type, and GNU_TYPE, its corresponding GCC type,
8283 set Component_Bit_Offset and Esize of the components to the position and
8284 size used by Gigi. */
8286 static void
8288 {
8289 /* For an extension, the inherited components have not been translated because
8290 they are fetched from the _Parent component on the fly. */
8291 const bool is_extension
8294 /* We operate by first making a list of all fields and their position (we
8295 can get the size easily) and then update all the sizes in the tree. */
8296 tree gnu_list
8307 {
8309 gnu_list);
8311 {
8312 tree parent_offset;
8314 /* If we are just annotating types and the type is tagged, the tag
8315 and the parent components are not generated by the front-end so
8316 we need to add the appropriate offset to each component without
8317 representation clause. */
8321 {
8322 /* For a component appearing in the current extension, the
8323 offset is the size of the parent. */
8326 parent_offset
8328 bitsizetype);
8329 else
8333 parent_offset
8336 }
8337 else
8340 Set_Component_Bit_Offset
8342 annotate_value
8346 parent_offset)));
8350 }
8352 {
8353 /* If there is no entry, this is an inherited component whose
8354 position is the same as in the parent type. */
8357 /* If we are just annotating types, discriminants renaming those of
8358 the parent have no entry so deal with them specifically. */
8368 }
8369 }
8370 }
8371 \f
8372 /* Scan all fields in GNU_TYPE and return a TREE_LIST where TREE_PURPOSE is
8373 the FIELD_DECL and TREE_VALUE a TREE_VEC containing the byte position, the
8374 value to be placed into DECL_OFFSET_ALIGN and the bit position. The list
8375 of fields is flattened, except for variant parts if DO_NOT_FLATTEN_VARIANT
8376 is set to true. GNU_POS is to be added to the position, GNU_BITPOS to the
8377 bit position, OFFSET_ALIGN is the present offset alignment. GNU_LIST is a
8378 pre-existing list to be chained to the newly created entries. */
8380 static tree
8383 {
8384 tree gnu_field;
8387 gnu_field;
8389 {
8394 unsigned int our_offset_align
8403 /* Recurse on internal fields, flattening the nested fields except for
8404 those in the variant part, if requested. */
8406 {
8410 gnu_list
8414 else
8415 gnu_list
8419 }
8420 }
8423 }
8425 /* Return a list describing the substitutions needed to reflect the
8426 discriminant substitutions from GNAT_TYPE to GNAT_SUBTYPE. They can
8427 be in any order. The values in an element of the list are in the form
8428 of operands to SUBSTITUTE_IN_EXPR. DEFINITION is true if this is for
8429 a definition of GNAT_SUBTYPE. */
8433 {
8435 Entity_Id gnat_discrim;
8436 Node_Id gnat_constr;
8443 /* Ignore access discriminants. */
8445 {
8448 elaborate_expression
8454 }
8457 }
8459 /* Scan all fields in QUAL_UNION_TYPE and return a list describing the
8460 variants of QUAL_UNION_TYPE that are still relevant after applying
8461 the substitutions described in SUBST_LIST. GNU_LIST is a pre-existing
8462 list to be prepended to the newly created entries. */
8467 {
8468 tree gnu_field;
8471 gnu_field;
8473 {
8481 /* If the new qualifier is not unconditionally false, its variant may
8482 still be accessed. */
8484 {
8490 /* Recurse on the variant subpart of the variant, if any. */
8496 /* If the new qualifier is unconditionally true, the subsequent
8497 variants cannot be accessed. */
8500 }
8501 }
8504 }
8505 \f
8506 /* UINT_SIZE is a Uint giving the specified size for an object of GNU_TYPE
8507 corresponding to GNAT_OBJECT. If the size is valid, return an INTEGER_CST
8508 corresponding to its value. Otherwise, return NULL_TREE. KIND is set to
8509 VAR_DECL if we are specifying the size of an object, TYPE_DECL for the
8510 size of a type, and FIELD_DECL for the size of a field. COMPONENT_P is
8511 true if we are being called to process the Component_Size of GNAT_OBJECT;
8512 this is used only for error messages. ZERO_OK is true if a size of zero
8513 is permitted; if ZERO_OK is false, it means that a size of zero should be
8514 treated as an unspecified size. */
8516 static tree
8519 {
8520 Node_Id gnat_error_node;
8523 /* Return 0 if no size was specified. */
8527 /* Ignore a negative size since that corresponds to our back-annotation. */
8531 /* Find the node to use for error messages. */
8538 else
8541 /* Get the size as an INTEGER_CST. Issue an error if a size was specified
8542 but cannot be represented in bitsizetype. */
8545 {
8548 gnat_object);
8549 else
8551 gnat_object);
8553 }
8555 /* Ignore a zero size if it is not permitted. */
8559 /* The size of objects is always a multiple of a byte. */
8562 {
8566 else
8570 }
8572 /* If this is an integral type or a packed array type, the front-end has
8573 already verified the size, so we need not do it here (which would mean
8574 checking against the bounds). However, if this is an aliased object,
8575 it may not be smaller than the type of the object. */
8580 /* If the object is a record that contains a template, add the size of the
8581 template to the specified size. */
8587 /* If a type needs strict alignment, a component of this type in
8588 a packed record cannot be packed and thus uses the type size. */
8591 else
8594 /* Modify the size of a discriminated type to be the maximum size. */
8598 /* If this is an access type or a fat pointer, the minimum size is that given
8599 by the smallest integral mode that's valid for pointers. */
8601 {
8606 }
8608 /* Issue an error either if the default size of the object isn't a constant
8609 or if the new size is smaller than it. */
8613 {
8615 post_error_ne_tree
8618 else
8619 post_error_ne_tree
8623 }
8626 }
8627 \f
8628 /* Similarly, but both validate and process a value of RM size. This routine
8629 is only called for types. */
8631 static void
8633 {
8634 Node_Id gnat_attr_node;
8637 /* Do nothing if no size was specified. */
8641 /* Ignore a negative size since that corresponds to our back-annotation. */
8645 /* Only issue an error if a Value_Size clause was explicitly given.
8646 Otherwise, we'd be duplicating an error on the Size clause. */
8647 gnat_attr_node
8650 /* Get the size as an INTEGER_CST. Issue an error if a size was specified
8651 but cannot be represented in bitsizetype. */
8654 {
8657 gnat_entity);
8659 }
8661 /* Ignore a zero size unless a Value_Size clause exists, or a size clause
8662 exists, or this is an integer type, in which case the front-end will
8663 have always set it. */
8672 /* If the old size is self-referential, get the maximum size. */
8676 /* Issue an error either if the old size of the object isn't a constant or
8677 if the new size is smaller than it. The front-end has already verified
8678 this for scalar and packed array types. */
8686 && TYPE_PACKED_ARRAY_TYPE_P
8689 {
8691 post_error_ne_tree
8695 }
8697 /* Otherwise, set the RM size proper for integral types... */
8704 /* ...or the Ada size for record and union types. */
8708 }
8709 \f
8710 /* ALIGNMENT is a Uint giving the alignment specified for GNAT_ENTITY,
8711 a type or object whose present alignment is ALIGN. If this alignment is
8712 valid, return it. Otherwise, give an error and return ALIGN. */
8714 static unsigned int
8716 {
8719 Node_Id gnat_error_node;
8721 /* Don't worry about checking alignment if alignment was not specified
8722 by the source program and we already posted an error for this entity. */
8726 /* Post the error on the alignment clause if any. Note, for the implicit
8727 base type of an array type, the alignment clause is on the first
8728 subtype. */
8736 gnat_error_node =
8739 else
8742 /* Within GCC, an alignment is an integer, so we must make sure a value is
8743 specified that fits in that range. Also, there is an upper bound to
8744 alignments we can support/allow. */
8752 {
8756 /* If the default alignment of "double" or larger scalar types is
8757 specifically capped and the new alignment is above the cap, do
8758 not post an error and change the alignment only if there is an
8759 alignment clause; this makes it possible to have the associated
8760 GCC type overaligned by default for performance reasons. */
8762 {
8763 Entity_Id gnat_type
8765 is_capped_double
8767 }
8769 {
8770 Entity_Id gnat_type
8772 is_capped_double
8774 }
8775 else
8779 {
8782 }
8783 else
8784 {
8791 }
8792 }
8793 else
8794 {
8798 }
8801 }
8802 \f
8803 /* Promote the alignment of GNU_TYPE corresponding to GNAT_ENTITY. Return
8804 a positive value on success or zero on failure. */
8806 static unsigned int
8808 {
8811 /* No point in promoting the alignment if this doesn't prevent BLKmode access
8812 to the object, in particular block copy, as this will for example disable
8813 the NRV optimization for it. No point in jumping through all the hoops
8814 needed in order to support BIGGEST_ALIGNMENT if we don't really have to.
8815 So we cap to the smallest alignment that corresponds to a known efficient
8816 memory access pattern, except for Atomic and Volatile_Full_Access. */
8818 {
8821 }
8822 else
8823 {
8826 }
8828 /* Do the promotion within the above limits. */
8834 else
8837 /* But make sure not to under-align the object. */
8841 /* And honor the minimum valid atomic alignment, if any. */
8842 #ifdef MINIMUM_ATOMIC_ALIGNMENT
8845 #endif
8848 }
8849 \f
8850 /* Verify that TYPE is something we can implement atomically. If not, issue
8851 an error for GNAT_ENTITY. COMPONENT_P is true if we are being called to
8852 process a component type. */
8854 static void
8856 {
8858 Node_Id gnat_node;
8859 machine_mode mode;
8862 tree size;
8864 /* If this is an anonymous base type, nothing to check, the error will be
8865 reported on the source type if need be. */
8874 /* Consider all aligned floating-point types atomic and any aligned types
8875 that are represented by integers no wider than a machine word. */
8876 scalar_int_mode int_mode;
8883 /* For the moment, also allow anything that has an alignment equal to its
8884 size and which is smaller than a word. */
8895 {
8896 unsigned char pragma_id
8901 {
8904 }
8905 }
8913 else
8916 }
8917 \f
8919 /* Helper for the intrin compatibility checks family. Evaluate whether
8920 two types are definitely incompatible. */
8922 static bool
8924 {
8939 {
8946 /* Assume designated types are ok. We'd need to account for char * and
8947 void * variants to do better, which could rapidly get messy and isn't
8948 clearly worth the effort. */
8953 }
8956 }
8958 /* Helper for intrin_profiles_compatible_p, to perform compatibility checks
8959 on the Ada/builtin argument lists for the INB binding. */
8961 static bool
8963 {
8969 /* Sequence position of the last argument we checked. */
8973 {
8977 /* If we've exhausted both lists simultaneously, we're done. */
8981 /* If one list is shorter than the other, they fail to match. */
8985 /* If we're done with the Ada args and not with the internal builtin
8986 args, or the other way around, complain. */
8989 {
8992 }
8996 {
9000 }
9002 /* Otherwise, check that types match for the current argument. */
9003 argpos ++;
9005 {
9009 }
9014 }
9017 }
9019 /* Helper for intrin_profiles_compatible_p, to perform compatibility checks
9020 on the Ada/builtin return values for the INB binding. */
9022 static bool
9024 {
9028 /* Accept function imported as procedure, common and convenient. */
9033 /* Check return types compatibility otherwise. Note that this
9034 handles void/void as well. */
9036 {
9040 }
9043 }
9045 /* Check and return whether the Ada and gcc builtin profiles bound by INB are
9046 compatible. Issue relevant warnings when they are not.
9048 This is intended as a light check to diagnose the most obvious cases, not
9049 as a full fledged type compatibility predicate. It is the programmer's
9050 responsibility to ensure correctness of the Ada declarations in Imports,
9051 especially when binding straight to a compiler internal. */
9053 static bool
9055 {
9056 /* Check compatibility on return values and argument lists, each responsible
9057 for posting warnings as appropriate. Ensure use of the proper sloc for
9058 this purpose. */
9071 }
9072 \f
9073 /* Return a FIELD_DECL node modeled on OLD_FIELD. FIELD_TYPE is its type
9074 and RECORD_TYPE is the type of the parent. If SIZE is nonzero, it is the
9075 specified size for this field. POS_LIST is a position list describing
9076 the layout of OLD_FIELD and SUBST_LIST a substitution list to be applied
9077 to this layout. */
9079 static tree
9083 {
9095 /* If the position is now a constant, we can set it as the position of the
9096 field when we make it. Otherwise, we need to deal with it specially. */
9099 else
9102 new_field
9108 {
9110 /* Finalize the position. */
9119 }
9127 }
9129 /* Create the REP part of RECORD_TYPE with REP_TYPE. If MIN_SIZE is nonzero,
9130 it is the minimal size the REP_PART must have. */
9132 static tree
9134 {
9135 tree field;
9145 }
9147 /* Return the REP part of RECORD_TYPE, if any. Otherwise return NULL. */
9149 static tree
9151 {
9154 /* The REP part is the first field, internal, another record, and its name
9155 starts with an 'R'. */
9163 }
9165 /* Return the variant part of RECORD_TYPE, if any. Otherwise return NULL. */
9167 tree
9169 {
9170 tree field;
9172 /* The variant part is the only internal field that is a qualified union. */
9179 }
9181 /* Return a new variant part modeled on OLD_VARIANT_PART. VARIANT_LIST is
9182 the list of variants to be used and RECORD_TYPE is the type of the parent.
9183 POS_LIST is a position list describing the layout of fields present in
9184 OLD_VARIANT_PART and SUBST_LIST a substitution list to be applied to this
9185 layout. DEBUG_INFO_P is true if we need to write debug information. */
9187 static tree
9193 {
9201 /* First create the type of the variant part from that of the old one. */
9207 /* If the position of the variant part is constant, subtract it from the
9208 size of the type of the parent to get the new size. This manual CSE
9209 reduces the code size when not optimizing. */
9213 {
9223 first_bit));
9226 }
9227 else
9230 /* Now finish up the new variants and populate the union type. */
9232 {
9236 /* Skip variants that don't belong to this nesting level. */
9240 /* Retrieve the list of fields already added to the new variant. */
9244 /* If the old variant had a variant subpart, we need to create a new
9245 variant subpart and add it to the field list. */
9249 {
9250 tree new_variant_subpart
9253 debug_info_p);
9256 }
9258 /* Finish up the new variant and create the field. */
9264 new_field
9272 }
9274 /* Finish up the union type and create the variant part. Note that we don't
9275 reverse the field list because VARIANT_LIST has been traversed in reverse
9276 order. */
9282 new_variant_part
9288 /* With multiple discriminants it is possible for an inner variant to be
9289 statically selected while outer ones are not; in this case, the list
9290 of fields of the inner variant is not flattened and we end up with a
9291 qualified union with a single member. Drop the useless container. */
9293 {
9302 }
9305 }
9307 /* Copy the size (and alignment and alias set) from OLD_TYPE to NEW_TYPE,
9308 which are both RECORD_TYPE, after applying the substitutions described
9309 in SUBST_LIST. */
9311 static void
9314 {
9338 SET_TYPE_ADA_SIZE
9342 /* Finalize the size. */
9345 }
9347 /* Return true if DISC is a stored discriminant of RECORD_TYPE. */
9351 {
9358 else
9360 }
9362 /* Copy the layout from {GNAT,GNU}_OLD_TYPE to {GNAT,GNU}_NEW_TYPE, which are
9363 both record types, after applying the substitutions described in SUBST_LIST.
9364 DEBUG_INFO_P is true if we need to write debug information for NEW_TYPE. */
9366 static void
9368 Entity_Id gnat_old_type,
9369 tree gnu_new_type,
9370 tree gnu_old_type,
9373 {
9379 /* Look for REP and variant parts in the old type. */
9383 /* If there is a variant part, we must compute whether the constraints
9384 statically select a particular variant. If so, we simply drop the
9385 qualified union and flatten the list of fields. Otherwise we will
9386 build a new qualified union for the variants that are still relevant. */
9388 {
9395 /* If all the qualifiers are unconditionally true, the innermost variant
9396 is statically selected. */
9400 {
9403 }
9405 /* Otherwise, create the new variants. */
9408 {
9411 tree suffix
9420 gnu_subst_list);
9422 }
9423 }
9424 else
9425 {
9428 }
9430 /* Make a list of fields and their position in the old type. */
9431 tree gnu_pos_list
9437 /* Now go down every component in the new type and compute its size and
9438 position from those of the component in the old type and the stored
9439 constraints of the new type. */
9452 {
9461 /* If the type is the same, retrieve the GCC type from the
9462 old field to take into account possible adjustments. */
9465 else
9468 /* If there was a component clause, the field types must be the same
9469 for the old and new types, so copy the data from the old field to
9470 avoid recomputation here. Also if the field is justified modular
9471 and the optimization in gnat_to_gnu_field was applied. */
9477 {
9480 }
9482 /* If the old field was packed and of constant size, we have to get the
9483 old size here as it might differ from what the Etype conveys and the
9484 latter might overlap with the following field. Try to arrange the
9485 type for possible better packing along the way. */
9488 {
9494 }
9496 else
9499 /* If the context of the old field is the old type or its REP part,
9500 put the field directly in the new type; otherwise look up the
9501 context in the variant list and put the field either in the new
9502 type if there is a selected variant or in one new variant. */
9506 else
9507 {
9510 tree rep_part;
9520 else
9521 /* The front-end may pass us "ghost" components if it fails to
9522 recognize that a constrain statically selects a particular
9523 variant. Discard them. */
9525 }
9527 /* Now create the new field modeled on the old one. */
9528 gnu_field
9534 /* If the context is a variant, put it in the new variant directly. */
9536 {
9539 }
9541 /* To match the layout crafted in components_to_record, if this is
9542 the _Tag or _Parent field, put it before any other fields. */
9546 /* Similarly, if this is the _Controller field, put it before the
9547 other fields except for the _Tag or _Parent field. */
9549 {
9552 }
9554 /* Otherwise, put it after the other fields. */
9555 else
9556 {
9563 }
9565 /* For a stored discriminant in a derived type, replace the field. */
9567 {
9570 }
9571 else
9573 }
9575 /* If there is no variant list or a selected variant and the fields all have
9576 constant position, put them in order of increasing position to match that
9577 of constant CONSTRUCTORs. */
9579 {
9590 {
9593 }
9594 }
9596 /* If there is a variant list and no selected variant, we need to create the
9597 nest of variant parts from the old nest. */
9599 {
9600 tree new_variant_part
9606 }
9613 /* If NEW_TYPE is a subtype, it inherits all the attributes from OLD_TYPE.
9614 Otherwise sizes and alignment must be computed independently. */
9616 {
9619 }
9620 else
9623 /* Now go through the entities again looking for Itypes that we have not yet
9624 elaborated (e.g. Etypes of fields that have Original_Components). */
9633 }
9635 /* Associate to GNU_TYPE, the translation of GNAT_ENTITY, which is
9636 the implementation type of a packed array type (Is_Packed_Array_Impl_Type),
9637 the original array type if it has been translated. This association is a
9638 parallel type for GNAT encodings or a debug type for standard DWARF. Note
9639 that for standard DWARF, we also want to get the original type name. */
9641 static void
9643 {
9644 Entity_Id gnat_original_array_type
9646 tree gnu_original_array_type;
9657 {
9665 }
9666 else
9668 }
9669 \f
9670 /* Given a type T, a FIELD_DECL F, and a replacement value R, return an
9671 equivalent type with adjusted size expressions where all occurrences
9672 of references to F in a PLACEHOLDER_EXPR have been replaced by R.
9674 The function doesn't update the layout of the type, i.e. it assumes
9675 that the substitution is purely formal. That's why the replacement
9676 value R must itself contain a PLACEHOLDER_EXPR. */
9678 tree
9680 {
9681 tree nt;
9686 {
9692 /* First the domain types of arrays. */
9695 {
9707 SET_TYPE_INDEX_TYPE
9711 }
9713 /* Then the subtypes. */
9716 {
9728 }
9740 /* These should never show up here. */
9744 {
9764 }
9769 {
9771 tree field;
9773 /* Start out with no fields, make new fields, and chain them
9774 in. If we haven't actually changed the type of any field,
9775 discard everything we've done and return the old type. */
9780 {
9785 {
9788 }
9792 {
9795 }
9797 /* Do the substitution inside the qualifier, if any. */
9799 {
9802 {
9805 }
9806 }
9813 }
9823 }
9827 }
9828 }
9829 \f
9830 /* Return the RM size of GNU_TYPE. This is the actual number of bits
9831 needed to represent the object. */
9833 tree
9835 {
9836 /* For integral types, we store the RM size explicitly. */
9840 /* Return the RM size of the actual data plus the size of the template. */
9843 return
9848 /* For record or union types, we store the size explicitly. */
9854 /* For other types, this is just the size. */
9856 }
9857 \f
9858 /* Return the name to be used for GNAT_ENTITY. If a type, create a
9859 fully-qualified name, possibly with type information encoding.
9860 Otherwise, return the name. */
9864 {
9867 }
9869 tree
9871 {
9874 }
9876 /* Return an identifier representing the external name to be used for
9877 GNAT_ENTITY. If SUFFIX is specified, the name is followed by "___"
9878 and the specified suffix. */
9880 tree
9882 {
9890 /* A variable using the Stdcall convention lives in a DLL. We adjust
9891 its name to use the jump table, the _imp__NAME contains the address
9892 for the NAME variable. */
9895 {
9901 }
9904 }
9906 /* Given GNU_NAME, an IDENTIFIER_NODE containing a name and SUFFIX, a
9907 string, return a new IDENTIFIER_NODE that is the concatenation of
9908 the name followed by "___" and the specified suffix. */
9910 tree
9912 {
9919 }
9921 /* Initialize data structures of the decl.c module. */
9923 void
9925 {
9926 /* Initialize the cache of annotated values. */
9929 /* Initialize the association of dummy types with subprograms. */
9931 }
9933 /* Destroy data structures of the decl.c module. */
9935 void
9937 {
9938 /* Destroy the cache of annotated values. */
9942 /* Destroy the association of dummy types with subprograms. */
9945 }